TSTP Solution File: GEO500+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO500+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 04:06:03 EDT 2022
% Result : Theorem 0.23s 3.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 52 ( 24 unt; 0 def)
% Number of atoms : 97 ( 24 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 88 ( 43 ~; 40 |; 5 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 130 ( 6 sgn 72 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aSatz7_19,conjecture,
! [X12,X15,X13] :
( s(X12,s(X15,X13)) != s(X15,s(X12,X13))
| X12 = X15 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',aSatz7_19) ).
fof(aSatz7_7,axiom,
! [X12,X13] : s(X12,s(X12,X13)) = X13,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',aSatz7_7) ).
fof(aSatz7_4a,axiom,
! [X13,X12] : s_m(X13,X12,s(X12,X13)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',aSatz7_4a) ).
fof(d_Defn7_1,axiom,
! [X12,X29,X15] :
( ( ~ s_m(X12,X29,X15)
| s_t(X12,X29,X15) )
& ( ~ s_m(X12,X29,X15)
| s_e(X29,X12,X29,X15) )
& ( ~ s_t(X12,X29,X15)
| ~ s_e(X29,X12,X29,X15)
| s_m(X12,X29,X15) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d_Defn7_1) ).
fof(aA2,axiom,
! [X1,X2,X3,X4,X5,X6] :
( ~ s_e(X1,X2,X3,X4)
| ~ s_e(X1,X2,X5,X6)
| s_e(X3,X4,X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO011+0.ax',aA2) ).
fof(aSatz7_13,axiom,
! [X13,X16,X12] : s_e(X13,X16,s(X12,X13),s(X12,X16)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',aSatz7_13) ).
fof(aSatz2_2,axiom,
! [X12,X15,X14,X17] :
( ~ s_e(X12,X15,X14,X17)
| s_e(X14,X17,X12,X15) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',aSatz2_2) ).
fof(aSatz7_15b,axiom,
! [X13,X16,X27,X12] :
( s_t(X13,X16,X27)
| ~ s_t(s(X12,X13),s(X12,X16),s(X12,X27)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',aSatz7_15b) ).
fof(aSatz7_17,axiom,
! [X13,X12,X16,X15] :
( ~ s_m(X13,X12,X16)
| ~ s_m(X13,X15,X16)
| X12 = X15 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',aSatz7_17) ).
fof(aSatz7_10a,axiom,
! [X12,X13] :
( s(X12,X13) != X13
| X13 = X12 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',aSatz7_10a) ).
fof(c_0_10,negated_conjecture,
~ ! [X12,X15,X13] :
( s(X12,s(X15,X13)) != s(X15,s(X12,X13))
| X12 = X15 ),
inference(assume_negation,[status(cth)],[aSatz7_19]) ).
fof(c_0_11,plain,
! [X14,X15] : s(X14,s(X14,X15)) = X15,
inference(variable_rename,[status(thm)],[aSatz7_7]) ).
fof(c_0_12,negated_conjecture,
( s(esk1_0,s(esk2_0,esk3_0)) = s(esk2_0,s(esk1_0,esk3_0))
& esk1_0 != esk2_0 ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_13,plain,
! [X14,X15] : s_m(X14,X15,s(X15,X14)),
inference(variable_rename,[status(thm)],[aSatz7_4a]) ).
cnf(c_0_14,plain,
s(X1,s(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
s(esk1_0,s(esk2_0,esk3_0)) = s(esk2_0,s(esk1_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X30,X31,X32,X30,X31,X32,X30,X31,X32] :
( ( ~ s_m(X30,X31,X32)
| s_t(X30,X31,X32) )
& ( ~ s_m(X30,X31,X32)
| s_e(X31,X30,X31,X32) )
& ( ~ s_t(X30,X31,X32)
| ~ s_e(X31,X30,X31,X32)
| s_m(X30,X31,X32) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[d_Defn7_1])])])]) ).
cnf(c_0_17,plain,
s_m(X1,X2,s(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
s(esk1_0,s(esk2_0,s(esk1_0,esk3_0))) = s(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_19,plain,
! [X7,X8,X9,X10,X11,X12] :
( ~ s_e(X7,X8,X9,X10)
| ~ s_e(X7,X8,X11,X12)
| s_e(X9,X10,X11,X12) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[aA2])]) ).
cnf(c_0_20,plain,
( s_e(X1,X2,X1,X3)
| ~ s_m(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
s_m(s(esk2_0,s(esk1_0,esk3_0)),esk1_0,s(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_22,plain,
! [X17,X18,X19] : s_e(X17,X18,s(X19,X17),s(X19,X18)),
inference(variable_rename,[status(thm)],[aSatz7_13]) ).
cnf(c_0_23,plain,
( s_e(X1,X2,X3,X4)
| ~ s_e(X5,X6,X3,X4)
| ~ s_e(X5,X6,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
s_e(esk1_0,s(esk2_0,s(esk1_0,esk3_0)),esk1_0,s(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
s_e(X1,X2,s(X3,X1),s(X3,X2)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_26,plain,
! [X18,X19,X20,X21] :
( ~ s_e(X18,X19,X20,X21)
| s_e(X20,X21,X18,X19) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[aSatz2_2])]) ).
cnf(c_0_27,negated_conjecture,
( s_e(X1,X2,esk1_0,s(esk2_0,esk3_0))
| ~ s_e(esk1_0,s(esk2_0,s(esk1_0,esk3_0)),X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
s_e(X1,s(X2,X3),s(X2,X1),X3),
inference(spm,[status(thm)],[c_0_25,c_0_14]) ).
fof(c_0_29,plain,
! [X28,X29,X30,X31] :
( s_t(X28,X29,X30)
| ~ s_t(s(X31,X28),s(X31,X29),s(X31,X30)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[aSatz7_15b])])])]) ).
cnf(c_0_30,plain,
( s_t(X1,X2,X3)
| ~ s_m(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_31,plain,
! [X17,X18,X19,X20] :
( ~ s_m(X17,X18,X19)
| ~ s_m(X17,X20,X19)
| X18 = X20 ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[aSatz7_17])]) ).
cnf(c_0_32,plain,
( s_e(X1,X2,X3,X4)
| ~ s_e(X3,X4,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,negated_conjecture,
s_e(s(esk2_0,esk1_0),s(esk1_0,esk3_0),esk1_0,s(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( s_t(X2,X3,X4)
| ~ s_t(s(X1,X2),s(X1,X3),s(X1,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,plain,
s_t(X1,X2,s(X2,X1)),
inference(spm,[status(thm)],[c_0_30,c_0_17]) ).
cnf(c_0_36,plain,
( X1 = X2
| ~ s_m(X3,X2,X4)
| ~ s_m(X3,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
( s_e(X1,X2,s(X3,X4),X5)
| ~ s_e(X4,s(X3,X5),X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_38,negated_conjecture,
s_e(esk1_0,s(esk2_0,esk3_0),s(esk2_0,esk1_0),s(esk1_0,esk3_0)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
( s_t(X1,s(X2,X3),X4)
| ~ s_t(s(X2,X1),X3,s(X2,X4)) ),
inference(spm,[status(thm)],[c_0_34,c_0_14]) ).
cnf(c_0_40,negated_conjecture,
s_t(s(esk2_0,s(esk1_0,esk3_0)),esk1_0,s(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_35,c_0_18]) ).
cnf(c_0_41,plain,
( X1 = X2
| ~ s_m(X3,X1,s(X2,X3)) ),
inference(spm,[status(thm)],[c_0_36,c_0_17]) ).
cnf(c_0_42,plain,
( s_m(X1,X2,X3)
| ~ s_e(X2,X1,X2,X3)
| ~ s_t(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_43,negated_conjecture,
s_e(s(esk2_0,esk1_0),s(esk1_0,esk3_0),s(esk2_0,esk1_0),esk3_0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
s_t(s(esk1_0,esk3_0),s(esk2_0,esk1_0),esk3_0),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_45,plain,
! [X14,X15] :
( s(X14,X15) != X15
| X15 = X14 ),
inference(variable_rename,[status(thm)],[aSatz7_10a]) ).
cnf(c_0_46,plain,
( X1 = X2
| ~ s_m(s(X2,X3),X1,X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_14]) ).
cnf(c_0_47,negated_conjecture,
s_m(s(esk1_0,esk3_0),s(esk2_0,esk1_0),esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_48,plain,
( X1 = X2
| s(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_49,negated_conjecture,
s(esk2_0,esk1_0) = esk1_0,
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GEO500+1 : TPTP v8.1.0. Released v7.0.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 18 06:55:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/3.42 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.23/3.42 # Preprocessing time : 0.024 s
% 0.23/3.42
% 0.23/3.42 # Proof found!
% 0.23/3.42 # SZS status Theorem
% 0.23/3.42 # SZS output start CNFRefutation
% See solution above
% 0.23/3.42 # Proof object total steps : 52
% 0.23/3.42 # Proof object clause steps : 31
% 0.23/3.42 # Proof object formula steps : 21
% 0.23/3.42 # Proof object conjectures : 17
% 0.23/3.42 # Proof object clause conjectures : 14
% 0.23/3.42 # Proof object formula conjectures : 3
% 0.23/3.42 # Proof object initial clauses used : 13
% 0.23/3.42 # Proof object initial formulas used : 10
% 0.23/3.42 # Proof object generating inferences : 18
% 0.23/3.42 # Proof object simplifying inferences : 3
% 0.23/3.42 # Training examples: 0 positive, 0 negative
% 0.23/3.42 # Parsed axioms : 121
% 0.23/3.42 # Removed by relevancy pruning/SinE : 0
% 0.23/3.42 # Initial clauses : 172
% 0.23/3.42 # Removed in clause preprocessing : 1
% 0.23/3.42 # Initial clauses in saturation : 171
% 0.23/3.42 # Processed clauses : 10993
% 0.23/3.42 # ...of these trivial : 109
% 0.23/3.42 # ...subsumed : 8110
% 0.23/3.42 # ...remaining for further processing : 2774
% 0.23/3.42 # Other redundant clauses eliminated : 36
% 0.23/3.42 # Clauses deleted for lack of memory : 0
% 0.23/3.42 # Backward-subsumed : 77
% 0.23/3.42 # Backward-rewritten : 424
% 0.23/3.42 # Generated clauses : 135374
% 0.23/3.42 # ...of the previous two non-trivial : 129811
% 0.23/3.42 # Contextual simplify-reflections : 2085
% 0.23/3.42 # Paramodulations : 135269
% 0.23/3.42 # Factorizations : 2
% 0.23/3.42 # Equation resolutions : 103
% 0.23/3.42 # Current number of processed clauses : 2266
% 0.23/3.42 # Positive orientable unit clauses : 91
% 0.23/3.42 # Positive unorientable unit clauses: 0
% 0.23/3.42 # Negative unit clauses : 191
% 0.23/3.42 # Non-unit-clauses : 1984
% 0.23/3.42 # Current number of unprocessed clauses: 104938
% 0.23/3.42 # ...number of literals in the above : 475783
% 0.23/3.42 # Current number of archived formulas : 0
% 0.23/3.42 # Current number of archived clauses : 502
% 0.23/3.42 # Clause-clause subsumption calls (NU) : 2058631
% 0.23/3.42 # Rec. Clause-clause subsumption calls : 1341181
% 0.23/3.42 # Non-unit clause-clause subsumptions : 4080
% 0.23/3.42 # Unit Clause-clause subsumption calls : 65245
% 0.23/3.42 # Rewrite failures with RHS unbound : 0
% 0.23/3.42 # BW rewrite match attempts : 3336
% 0.23/3.42 # BW rewrite match successes : 10
% 0.23/3.42 # Condensation attempts : 0
% 0.23/3.42 # Condensation successes : 0
% 0.23/3.42 # Termbank termtop insertions : 2639111
% 0.23/3.42
% 0.23/3.42 # -------------------------------------------------
% 0.23/3.42 # User time : 2.386 s
% 0.23/3.42 # System time : 0.066 s
% 0.23/3.42 # Total time : 2.452 s
% 0.23/3.42 # Maximum resident set size: 108228 pages
%------------------------------------------------------------------------------