%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : ALG210+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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 : Thu Jul 14 16:50:23 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of formulae : 52 ( 39 unt; 0 def)
% Number of atoms : 77 ( 51 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 45 ( 20 ~; 15 |; 7 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 89 ( 1 sgn 14 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X2] :
( element(X2)
<=> ? [X3] :
( times(X2,X3) = X2
& times(X2,X2) = X3 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_2) ).
fof(conjecture_1,conjecture,
! [X1,X2] :
( ( element(X1)
& element(X2) )
=> element(times(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conjecture_1) ).
fof(axiom_1,axiom,
! [X1,X2,X3] : times(times(X1,X2),X3) = times(X2,times(X3,X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_1) ).
fof(c_0_3,plain,
! [X4,X4,X6] :
( ( times(X4,esk3_1(X4)) = X4
| ~ element(X4) )
& ( times(X4,X4) = esk3_1(X4)
| ~ element(X4) )
& ( times(X4,X6) != X4
| times(X4,X4) != X6
| element(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])])])])]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( ( element(X1)
& element(X2) )
=> element(times(X1,X2)) ),
inference(assume_negation,[status(cth)],[conjecture_1]) ).
cnf(c_0_5,plain,
( times(X1,esk3_1(X1)) = X1
| ~ element(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( times(X1,X1) = esk3_1(X1)
| ~ element(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_7,negated_conjecture,
( element(esk1_0)
& element(esk2_0)
& ~ element(times(esk1_0,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_8,plain,
! [X4,X5,X6] : times(times(X4,X5),X6) = times(X5,times(X6,X4)),
inference(variable_rename,[status(thm)],[axiom_1]) ).
cnf(c_0_9,plain,
( times(X1,times(X1,X1)) = X1
| ~ element(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,negated_conjecture,
element(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
times(times(X1,X2),X3) = times(X2,times(X3,X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
times(esk2_0,times(esk2_0,esk2_0)) = esk2_0,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( element(X1)
| times(X1,X1) != X2
| times(X1,X2) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
times(times(esk2_0,esk2_0),times(X1,esk2_0)) = times(esk2_0,X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( element(times(esk2_0,esk2_0))
| times(esk2_0,X1) != times(esk2_0,esk2_0)
| times(esk2_0,esk2_0) != times(X1,esk2_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).
cnf(c_0_16,plain,
times(times(X1,times(X2,X3)),X4) = times(X3,times(times(X4,X1),X2)),
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
cnf(c_0_17,plain,
( times(esk3_1(X1),times(X2,X1)) = times(X1,X2)
| ~ element(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_18,negated_conjecture,
element(times(esk2_0,esk2_0)),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
times(times(X1,times(X2,X3)),X4) = times(X3,times(X1,times(X2,X4))),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_20,negated_conjecture,
element(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,negated_conjecture,
times(esk3_1(times(esk2_0,esk2_0)),esk2_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_12]),c_0_11]),c_0_12]),c_0_18])]) ).
cnf(c_0_22,plain,
times(X1,times(X2,times(X3,X4))) = times(X3,times(X4,times(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_11]),c_0_19]) ).
cnf(c_0_23,negated_conjecture,
times(esk2_0,times(esk2_0,times(esk2_0,X1))) = times(esk2_0,X1),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_24,negated_conjecture,
times(esk1_0,times(esk1_0,esk1_0)) = esk1_0,
inference(spm,[status(thm)],[c_0_9,c_0_20]) ).
cnf(c_0_25,plain,
times(times(X1,X2),times(X3,X4)) = times(X2,times(X4,times(X1,X3))),
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
cnf(c_0_26,negated_conjecture,
times(times(esk2_0,X1),esk3_1(times(esk2_0,esk2_0))) = times(X1,esk2_0),
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
times(esk2_0,times(X1,times(esk2_0,esk2_0))) = times(esk2_0,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
times(esk1_0,times(esk1_0,times(esk1_0,X1))) = times(esk1_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_24]),c_0_25]) ).
cnf(c_0_29,negated_conjecture,
times(X1,esk2_0) = times(esk2_0,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_26]),c_0_19]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
times(esk1_0,times(X1,times(esk1_0,esk1_0))) = times(esk1_0,X1),
inference(spm,[status(thm)],[c_0_22,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
times(times(esk2_0,X1),X2) = times(X1,times(esk2_0,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_29]) ).
cnf(c_0_32,plain,
times(times(times(X1,X2),X3),X4) = times(X1,times(X2,times(X3,X4))),
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_33,negated_conjecture,
times(X1,times(esk1_0,X2)) = times(X2,times(esk1_0,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_30]),c_0_25]),c_0_28]) ).
cnf(c_0_34,negated_conjecture,
times(times(X1,esk2_0),X2) = times(X1,times(esk2_0,X2)),
inference(spm,[status(thm)],[c_0_31,c_0_29]) ).
cnf(c_0_35,plain,
times(X1,times(X2,times(X3,X4))) = times(times(X1,X3),times(X2,X4)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_25]),c_0_32]) ).
cnf(c_0_36,negated_conjecture,
times(times(esk1_0,esk1_0),times(esk1_0,X1)) = times(esk1_0,X1),
inference(spm,[status(thm)],[c_0_25,c_0_30]) ).
cnf(c_0_37,plain,
times(times(times(X1,X2),X3),X4) = times(X3,times(times(X2,X4),X1)),
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
cnf(c_0_38,negated_conjecture,
times(esk2_0,times(esk2_0,times(X1,times(esk2_0,esk1_0)))) = times(X1,times(esk2_0,esk1_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_33]),c_0_29]),c_0_29]) ).
cnf(c_0_39,negated_conjecture,
times(X1,times(esk2_0,times(X2,X3))) = times(X1,times(X2,times(esk2_0,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_34]),c_0_35]) ).
cnf(c_0_40,negated_conjecture,
times(times(esk1_0,X1),X2) = times(X1,times(esk1_0,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_36]),c_0_36]) ).
cnf(c_0_41,plain,
times(X1,times(X2,times(X3,X4))) = times(X3,times(times(X2,X4),X1)),
inference(rw,[status(thm)],[c_0_37,c_0_32]) ).
cnf(c_0_42,negated_conjecture,
times(esk2_0,times(X1,times(esk2_0,times(esk2_0,esk1_0)))) = times(X1,times(esk2_0,esk1_0)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
times(esk1_0,times(esk2_0,X1)) = times(esk2_0,times(esk1_0,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_29]),c_0_31]) ).
cnf(c_0_44,negated_conjecture,
times(X1,esk1_0) = times(esk1_0,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_24]),c_0_40]),c_0_28]) ).
cnf(c_0_45,negated_conjecture,
~ element(times(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_46,plain,
( element(times(X1,X2))
| times(X2,times(X3,X1)) != times(X1,X2)
| times(X2,times(X2,times(X1,X1))) != X3 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_11]),c_0_25]) ).
cnf(c_0_47,negated_conjecture,
times(esk1_0,times(X1,times(esk2_0,X2))) = times(esk2_0,times(esk1_0,times(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_42]),c_0_19]),c_0_31]),c_0_31]),c_0_23]),c_0_43]) ).
cnf(c_0_48,negated_conjecture,
times(esk1_0,times(X1,X2)) = times(X2,times(esk1_0,X1)),
inference(spm,[status(thm)],[c_0_11,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
~ element(times(esk2_0,esk1_0)),
inference(rw,[status(thm)],[c_0_45,c_0_29]) ).
cnf(c_0_50,negated_conjecture,
( times(esk2_0,times(esk1_0,X1)) != times(esk2_0,esk1_0)
| times(esk2_0,times(esk2_0,times(esk1_0,esk1_0))) != X1 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_29]),c_0_43]),c_0_49]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_50]),c_0_43]),c_0_30]),c_0_29]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ALG210+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n024.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 : Wed Jun 8 17:12:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.014 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 52
% 0.21/1.40 # Proof object clause steps : 45
% 0.21/1.40 # Proof object formula steps : 7
% 0.21/1.40 # Proof object conjectures : 33
% 0.21/1.40 # Proof object clause conjectures : 30
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 7
% 0.21/1.40 # Proof object initial formulas used : 3
% 0.21/1.40 # Proof object generating inferences : 36
% 0.21/1.40 # Proof object simplifying inferences : 37
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 3
% 0.21/1.40 # Removed by relevancy pruning/SinE : 0
% 0.21/1.40 # Initial clauses : 7
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 7
% 0.21/1.40 # Processed clauses : 4374
% 0.21/1.40 # ...of these trivial : 180
% 0.21/1.40 # ...subsumed : 3788
% 0.21/1.40 # ...remaining for further processing : 406
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 16
% 0.21/1.40 # Backward-rewritten : 85
% 0.21/1.40 # Generated clauses : 75223
% 0.21/1.40 # ...of the previous two non-trivial : 68874
% 0.21/1.40 # Contextual simplify-reflections : 22
% 0.21/1.40 # Paramodulations : 75217
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 6
% 0.21/1.40 # Current number of processed clauses : 305
% 0.21/1.40 # Positive orientable unit clauses : 69
% 0.21/1.40 # Positive unorientable unit clauses: 51
% 0.21/1.40 # Negative unit clauses : 8
% 0.21/1.40 # Non-unit-clauses : 177
% 0.21/1.40 # Current number of unprocessed clauses: 53212
% 0.21/1.40 # ...number of literals in the above : 91940
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 101
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 27181
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 23801
% 0.21/1.40 # Non-unit clause-clause subsumptions : 1485
% 0.21/1.40 # Unit Clause-clause subsumption calls : 1210
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 5358
% 0.21/1.40 # BW rewrite match successes : 1683
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 1285327
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.891 s
% 0.21/1.40 # System time : 0.031 s
% 0.21/1.40 # Total time : 0.922 s
% 0.21/1.40 # Maximum resident set size: 51864 pages
% 0.21/23.40 eprover: CPU time limit exceeded, terminating
% 0.21/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.47 eprover: No such file or directory
% 0.21/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.47 eprover: No such file or directory
% 0.21/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.48 eprover: No such file or directory
% 0.21/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.48 eprover: No such file or directory
% 0.21/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.49 eprover: No such file or directory
% 0.21/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.49 eprover: No such file or directory
% 0.21/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.50 eprover: No such file or directory
% 0.21/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.51 eprover: No such file or directory
% 0.21/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.51 eprover: No such file or directory
% 0.21/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.52 eprover: No such file or directory
% 0.21/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.52 eprover: No such file or directory
%------------------------------------------------------------------------------