# No SinE strategy applied

# Auto-Ordering is analysing problem.
# Problem is type GHSSNFFMS33MS
# Auto-mode selected ordering type KBO6
# Auto-mode selected ordering precedence scheme <invfreqconjmax>
# Auto-mode selected weight ordering scheme <invfreqrank>
#
# Auto-Heuristic is analysing problem.
# Problem is type GHSSNFFMS33MS
# Auto-Mode selected heuristic G_E___200_C45_F1_AE_CS_SP_PI_S0Y
# and selection function SelectMaxLComplexAvoidPosPred.
#
# Initializing proof state
# Scanning for AC axioms
#
#cnf(i_0_19,negated_conjecture,(~cong(esk8_0,esk9_0,esk8_0,esk9_0))).
#
#cnf(i_0_1,plain,(X1=X2|~bet(X1,X2,X1))).
#
#cnf(i_0_17,plain,(nbet(esk5_0,esk6_0,esk7_0))).
#
#cnf(i_0_16,plain,(nbet(esk6_0,esk7_0,esk5_0))).
#
#cnf(i_0_15,plain,(nbet(esk7_0,esk5_0,esk6_0))).
#
#cnf(i_0_3,plain,(X1=X2|~cong(X1,X2,X3,X3))).
#
#cnf(i_0_2,plain,(cong(X1,X2,X2,X1))).
#
#cnf(i_0_13,plain,(nbet(X1,X2,X3)|bet(X1,X2,X3))).
#
#cnf(i_0_14,plain,(~nbet(X1,X2,X3)|~bet(X1,X2,X3))).
#
#cnf(i_0_12,plain,(bet(X1,X2,esk4_4(X1,X2,X3,X4)))).
#
#cnf(i_0_11,plain,(cong(X1,esk4_4(X2,X1,X3,X4),X3,X4))).
#
#cnf(i_0_4,plain,(cong(X1,X2,X3,X4)|~cong(X5,X6,X3,X4)|~cong(X5,X6,X1,X2))).
#
#cnf(i_0_6,plain,(bet(X5,esk1_5(X4,X1,X3,X5,X2),X1)|~bet(X4,X5,X3)|~bet(X1,X2,X3))).
#
#cnf(i_0_5,plain,(bet(X2,esk1_5(X4,X1,X3,X5,X2),X4)|~bet(X4,X5,X3)|~bet(X1,X2,X3))).
#
#cnf(i_0_9,plain,(X1=X2|bet(X1,X4,esk2_5(X1,X3,X4,X2,X5))|~bet(X3,X2,X4)|~bet(X1,X2,X5))).
#
#cnf(i_0_8,plain,(X1=X2|bet(X1,X3,esk3_5(X1,X3,X4,X2,X5))|~bet(X3,X2,X4)|~bet(X1,X2,X5))).
#
#cnf(i_0_7,plain,(X1=X2|bet(esk2_5(X1,X3,X4,X2,X5),X5,esk3_5(X1,X3,X4,X2,X5))|~bet(X3,X2,X4)|~bet(X1,X2,X5))).
#
#cnf(i_0_10,plain,(X5=X6|cong(X1,X2,X3,X4)|~cong(X6,X2,X8,X4)|~cong(X6,X1,X8,X3)|~cong(X5,X6,X7,X8)|~cong(X5,X2,X7,X4)|~bet(X7,X8,X3)|~bet(X5,X6,X1))).
#
#cnf(i_0_18,plain,(X4=X5|bet(X1,X2,X3)|bet(X2,X3,X1)|bet(X3,X1,X2)|~cong(X3,X4,X3,X5)|~cong(X2,X4,X2,X5)|~cong(X1,X4,X1,X5))).
#
#cnf(i_0_20,plain,(~bet(esk7_0,esk5_0,esk6_0))).
#
#cnf(i_0_21,plain,(~bet(esk6_0,esk7_0,esk5_0))).
#
#cnf(i_0_22,plain,(~bet(esk5_0,esk6_0,esk7_0))).
#
#cnf(i_0_26,plain,(cong(X1,X2,X3,X4)|~cong(X4,X3,X1,X2))).
#
#cnf(i_0_33,plain,(cong(X1,X2,X1,X2))).

# Proof found!
# SZS status Theorem
# Parsed axioms                        : 13
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 19
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 19
# Processed clauses                    : 24
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 24
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 1
# Generated clauses                    : 17
# ...of the previous two non-trivial   : 13
# Contextual simplify-reflections      : 0
# Paramodulations                      : 17
# Factorizations                       : 0
# Equation resolutions                 : 0
# Current number of processed clauses  : 23
#    Positive orientable unit clauses  : 7
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 3
#    Non-unit-clauses                  : 13
# Current number of unprocessed clauses: 8
# ...number of literals in the above   : 30
# Clause-clause subsumption calls (NU) : 90
# Rec. Clause-clause subsumption calls : 37
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 32
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 20
# BW rewrite match successes           : 1
