TSTP Solution File: GEO504+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO504+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n005.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:04 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 18 unt; 0 def)
% Number of atoms : 61 ( 3 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 51 ( 26 ~; 22 |; 3 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 93 ( 3 sgn 57 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aSatz8_2,conjecture,
! [X12,X15,X14] :
( ~ s_r(X12,X15,X14)
| s_r(X14,X15,X12) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',aSatz8_2) ).
fof(d_Defn8_1,axiom,
! [X12,X15,X14] :
( ( ~ s_r(X12,X15,X14)
| s_e(X12,X14,X12,s(X15,X14)) )
& ( s_r(X12,X15,X14)
| ~ s_e(X12,X14,X12,s(X15,X14)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d_Defn8_1) ).
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.mepo_128.in',aSatz2_2) ).
fof(aSatz2_5,axiom,
! [X12,X15,X14,X17] :
( ~ s_e(X12,X15,X14,X17)
| s_e(X12,X15,X17,X14) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',aSatz2_5) ).
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.mepo_128.in',aSatz7_13) ).
fof(aSatz7_7,axiom,
! [X12,X13] : s(X12,s(X12,X13)) = X13,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',aSatz7_7) ).
fof(aA1,axiom,
! [X1,X2] : s_e(X1,X2,X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO011+0.ax',aA1) ).
fof(c_0_8,negated_conjecture,
~ ! [X12,X15,X14] :
( ~ s_r(X12,X15,X14)
| s_r(X14,X15,X12) ),
inference(assume_negation,[status(cth)],[aSatz8_2]) ).
fof(c_0_9,plain,
! [X16,X17,X18,X16,X17,X18] :
( ( ~ s_r(X16,X17,X18)
| s_e(X16,X18,X16,s(X17,X18)) )
& ( s_r(X16,X17,X18)
| ~ s_e(X16,X18,X16,s(X17,X18)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[d_Defn8_1])])])]) ).
fof(c_0_10,negated_conjecture,
( s_r(esk1_0,esk2_0,esk3_0)
& ~ s_r(esk3_0,esk2_0,esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_8])])])]) ).
fof(c_0_11,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_12,plain,
( s_e(X1,X2,X1,s(X3,X2))
| ~ s_r(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
s_r(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X18,X19,X20,X21] :
( ~ s_e(X18,X19,X20,X21)
| s_e(X18,X19,X21,X20) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[aSatz2_5])]) ).
cnf(c_0_15,plain,
( s_e(X1,X2,X3,X4)
| ~ s_e(X3,X4,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
s_e(esk1_0,esk3_0,esk1_0,s(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_17,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_18,plain,
( s_e(X1,X2,X3,X4)
| ~ s_e(X1,X2,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
s_e(esk1_0,s(esk2_0,esk3_0),esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_20,plain,
! [X17,X18,X19] : s_e(X17,X18,s(X19,X17),s(X19,X18)),
inference(variable_rename,[status(thm)],[aSatz7_13]) ).
fof(c_0_21,plain,
! [X14,X15] : s(X14,s(X14,X15)) = X15,
inference(variable_rename,[status(thm)],[aSatz7_7]) ).
fof(c_0_22,plain,
! [X3,X4] : s_e(X3,X4,X4,X3),
inference(variable_rename,[status(thm)],[aA1]) ).
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_17]) ).
cnf(c_0_24,negated_conjecture,
s_e(esk1_0,s(esk2_0,esk3_0),esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
s_e(X1,X2,s(X3,X1),s(X3,X2)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
s(X1,s(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
s_e(X1,X2,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( s_e(X1,X2,esk3_0,esk1_0)
| ~ s_e(esk1_0,s(esk2_0,esk3_0),X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
s_e(X1,s(X2,X3),s(X2,X1),X3),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
~ s_r(esk3_0,esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,plain,
( s_r(X1,X3,X2)
| ~ s_e(X1,X2,X1,s(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,plain,
( s_e(X1,X2,X3,X4)
| ~ s_e(X4,X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
s_e(s(esk2_0,esk1_0),esk3_0,esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
~ s_e(esk3_0,esk1_0,esk3_0,s(esk2_0,esk1_0)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO504+1 : TPTP v8.1.0. Released v7.0.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n005.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 08:17:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.021 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 36
% 0.22/1.41 # Proof object clause steps : 19
% 0.22/1.41 # Proof object formula steps : 17
% 0.22/1.41 # Proof object conjectures : 12
% 0.22/1.41 # Proof object clause conjectures : 9
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 10
% 0.22/1.41 # Proof object initial formulas used : 8
% 0.22/1.41 # Proof object generating inferences : 9
% 0.22/1.41 # Proof object simplifying inferences : 1
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 131
% 0.22/1.41 # Removed by relevancy pruning/SinE : 58
% 0.22/1.41 # Initial clauses : 80
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 80
% 0.22/1.41 # Processed clauses : 1789
% 0.22/1.41 # ...of these trivial : 97
% 0.22/1.41 # ...subsumed : 1095
% 0.22/1.41 # ...remaining for further processing : 597
% 0.22/1.41 # Other redundant clauses eliminated : 10
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 19
% 0.22/1.41 # Backward-rewritten : 0
% 0.22/1.41 # Generated clauses : 14203
% 0.22/1.41 # ...of the previous two non-trivial : 12140
% 0.22/1.41 # Contextual simplify-reflections : 338
% 0.22/1.41 # Paramodulations : 14184
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 19
% 0.22/1.41 # Current number of processed clauses : 575
% 0.22/1.41 # Positive orientable unit clauses : 80
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 5
% 0.22/1.41 # Non-unit-clauses : 490
% 0.22/1.41 # Current number of unprocessed clauses: 10202
% 0.22/1.41 # ...number of literals in the above : 39034
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 19
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 65372
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 47039
% 0.22/1.41 # Non-unit clause-clause subsumptions : 1224
% 0.22/1.41 # Unit Clause-clause subsumption calls : 1521
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 3134
% 0.22/1.41 # BW rewrite match successes : 0
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 195122
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.272 s
% 0.22/1.41 # System time : 0.008 s
% 0.22/1.41 # Total time : 0.280 s
% 0.22/1.41 # Maximum resident set size: 12108 pages
%------------------------------------------------------------------------------