%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GRP665+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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 09:03:11 EDT 2022
% Result : Theorem 0.25s 1.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 19 unt; 0 def)
% Number of atoms : 36 ( 35 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 12 ~; 7 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] :
( mult(op_c,mult(X4,X5)) = mult(mult(op_c,X4),X5)
& mult(mult(X4,op_c),X5) = mult(X4,mult(op_c,X5))
& mult(mult(X4,X5),op_c) = mult(X4,mult(X5,op_c)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(f09,axiom,
! [X2] : mult(op_c,X2) = mult(X2,op_c),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f09) ).
fof(f07,axiom,
! [X3,X1,X2] : mult(X2,mult(X1,X3)) = mult(rd(mult(X2,X1),X2),mult(X2,X3)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f07) ).
fof(f04,axiom,
! [X1,X2] : rd(mult(X2,X1),X1) = X2,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f04) ).
fof(f08,axiom,
! [X3,X1,X2] : mult(mult(X2,X1),X3) = mult(mult(X2,X3),ld(X3,mult(X1,X3))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f08) ).
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f02) ).
fof(c_0_6,negated_conjecture,
~ ! [X4,X5] :
( mult(op_c,mult(X4,X5)) = mult(mult(op_c,X4),X5)
& mult(mult(X4,op_c),X5) = mult(X4,mult(op_c,X5))
& mult(mult(X4,X5),op_c) = mult(X4,mult(X5,op_c)) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_7,negated_conjecture,
( mult(op_c,mult(esk1_0,esk2_0)) != mult(mult(op_c,esk1_0),esk2_0)
| mult(mult(esk3_0,op_c),esk4_0) != mult(esk3_0,mult(op_c,esk4_0))
| mult(mult(esk5_0,esk6_0),op_c) != mult(esk5_0,mult(esk6_0,op_c)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_8,plain,
! [X3] : mult(op_c,X3) = mult(X3,op_c),
inference(variable_rename,[status(thm)],[f09]) ).
fof(c_0_9,plain,
! [X4,X5,X6] : mult(X6,mult(X5,X4)) = mult(rd(mult(X6,X5),X6),mult(X6,X4)),
inference(variable_rename,[status(thm)],[f07]) ).
fof(c_0_10,plain,
! [X3,X4] : rd(mult(X4,X3),X3) = X4,
inference(variable_rename,[status(thm)],[f04]) ).
fof(c_0_11,plain,
! [X4,X5,X6] : mult(mult(X6,X5),X4) = mult(mult(X6,X4),ld(X4,mult(X5,X4))),
inference(variable_rename,[status(thm)],[f08]) ).
fof(c_0_12,plain,
! [X3,X4] : ld(X4,mult(X4,X3)) = X3,
inference(variable_rename,[status(thm)],[f02]) ).
cnf(c_0_13,negated_conjecture,
( mult(mult(esk5_0,esk6_0),op_c) != mult(esk5_0,mult(esk6_0,op_c))
| mult(mult(esk3_0,op_c),esk4_0) != mult(esk3_0,mult(op_c,esk4_0))
| mult(op_c,mult(esk1_0,esk2_0)) != mult(mult(op_c,esk1_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
mult(op_c,X1) = mult(X1,op_c),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
mult(X1,mult(X2,X3)) = mult(rd(mult(X1,X2),X1),mult(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
rd(mult(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),ld(X3,mult(X2,X3))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( mult(mult(op_c,esk1_0),esk2_0) != mult(op_c,mult(esk1_0,esk2_0))
| mult(mult(op_c,esk3_0),esk4_0) != mult(esk3_0,mult(op_c,esk4_0))
| mult(esk5_0,mult(op_c,esk6_0)) != mult(op_c,mult(esk5_0,esk6_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14]),c_0_14]) ).
cnf(c_0_20,plain,
mult(X1,mult(op_c,X2)) = mult(op_c,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_16]) ).
cnf(c_0_21,plain,
mult(mult(X1,op_c),X2) = mult(op_c,mult(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_14]),c_0_18]),c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( mult(mult(op_c,esk1_0),esk2_0) != mult(op_c,mult(esk1_0,esk2_0))
| mult(mult(op_c,esk3_0),esk4_0) != mult(op_c,mult(esk3_0,esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20])]) ).
cnf(c_0_23,plain,
mult(mult(op_c,X1),X2) = mult(op_c,mult(X1,X2)),
inference(spm,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP665+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 01:03:09 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.25/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.44 # Preprocessing time : 0.014 s
% 0.25/1.44
% 0.25/1.44 # Failure: Out of unprocessed clauses!
% 0.25/1.44 # OLD status GaveUp
% 0.25/1.44 # Parsed axioms : 10
% 0.25/1.44 # Removed by relevancy pruning/SinE : 8
% 0.25/1.44 # Initial clauses : 2
% 0.25/1.44 # Removed in clause preprocessing : 0
% 0.25/1.44 # Initial clauses in saturation : 2
% 0.25/1.44 # Processed clauses : 3
% 0.25/1.44 # ...of these trivial : 0
% 0.25/1.44 # ...subsumed : 0
% 0.25/1.44 # ...remaining for further processing : 3
% 0.25/1.44 # Other redundant clauses eliminated : 0
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 0
% 0.25/1.44 # Backward-rewritten : 1
% 0.25/1.44 # Generated clauses : 0
% 0.25/1.44 # ...of the previous two non-trivial : 1
% 0.25/1.44 # Contextual simplify-reflections : 0
% 0.25/1.44 # Paramodulations : 0
% 0.25/1.44 # Factorizations : 0
% 0.25/1.44 # Equation resolutions : 0
% 0.25/1.44 # Current number of processed clauses : 2
% 0.25/1.44 # Positive orientable unit clauses : 0
% 0.25/1.44 # Positive unorientable unit clauses: 1
% 0.25/1.44 # Negative unit clauses : 0
% 0.25/1.44 # Non-unit-clauses : 1
% 0.25/1.44 # Current number of unprocessed clauses: 0
% 0.25/1.44 # ...number of literals in the above : 0
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 1
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 0
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 0
% 0.25/1.44 # Non-unit clause-clause subsumptions : 0
% 0.25/1.44 # Unit Clause-clause subsumption calls : 0
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 6
% 0.25/1.44 # BW rewrite match successes : 6
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 297
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.013 s
% 0.25/1.44 # System time : 0.001 s
% 0.25/1.44 # Total time : 0.014 s
% 0.25/1.44 # Maximum resident set size: 2776 pages
% 0.25/1.44 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.25/1.44 # Preprocessing time : 0.013 s
% 0.25/1.44
% 0.25/1.44 # Proof found!
% 0.25/1.44 # SZS status Theorem
% 0.25/1.44 # SZS output start CNFRefutation
% See solution above
% 0.25/1.44 # Proof object total steps : 25
% 0.25/1.44 # Proof object clause steps : 12
% 0.25/1.44 # Proof object formula steps : 13
% 0.25/1.44 # Proof object conjectures : 7
% 0.25/1.44 # Proof object clause conjectures : 4
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 6
% 0.25/1.44 # Proof object initial formulas used : 6
% 0.25/1.44 # Proof object generating inferences : 3
% 0.25/1.44 # Proof object simplifying inferences : 12
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 10
% 0.25/1.44 # Removed by relevancy pruning/SinE : 0
% 0.25/1.44 # Initial clauses : 10
% 0.25/1.44 # Removed in clause preprocessing : 0
% 0.25/1.44 # Initial clauses in saturation : 10
% 0.25/1.44 # Processed clauses : 57
% 0.25/1.44 # ...of these trivial : 10
% 0.25/1.44 # ...subsumed : 15
% 0.25/1.44 # ...remaining for further processing : 32
% 0.25/1.44 # Other redundant clauses eliminated : 0
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 0
% 0.25/1.44 # Backward-rewritten : 3
% 0.25/1.44 # Generated clauses : 366
% 0.25/1.44 # ...of the previous two non-trivial : 235
% 0.25/1.44 # Contextual simplify-reflections : 0
% 0.25/1.44 # Paramodulations : 366
% 0.25/1.44 # Factorizations : 0
% 0.25/1.44 # Equation resolutions : 0
% 0.25/1.44 # Current number of processed clauses : 29
% 0.25/1.44 # Positive orientable unit clauses : 26
% 0.25/1.44 # Positive unorientable unit clauses: 3
% 0.25/1.44 # Negative unit clauses : 0
% 0.25/1.44 # Non-unit-clauses : 0
% 0.25/1.44 # Current number of unprocessed clauses: 179
% 0.25/1.44 # ...number of literals in the above : 179
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 3
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 0
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 0
% 0.25/1.44 # Non-unit clause-clause subsumptions : 0
% 0.25/1.44 # Unit Clause-clause subsumption calls : 0
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 15
% 0.25/1.44 # BW rewrite match successes : 7
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 5086
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.017 s
% 0.25/1.44 # System time : 0.002 s
% 0.25/1.44 # Total time : 0.019 s
% 0.25/1.44 # Maximum resident set size: 3044 pages
%------------------------------------------------------------------------------