TSTP Solution File: GRP704+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GRP704+1 : TPTP v8.1.0. Released v4.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 09:03:23 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 27 unt; 0 def)
% Number of atoms : 39 ( 38 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 7 ~; 4 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f02) ).
fof(f10,axiom,
! [X1,X2] : mult(X2,mult(op_c,X1)) = mult(mult(X2,op_c),X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f10) ).
fof(f13,axiom,
! [X1,X2] : op_f = mult(X2,mult(X1,ld(mult(X2,X1),op_c))),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f13) ).
fof(f01,axiom,
! [X1,X2] : mult(X2,ld(X2,X1)) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f01) ).
fof(goals,conjecture,
! [X4,X5] :
( mult(op_f,mult(X4,X5)) = mult(mult(op_f,X4),X5)
& mult(X4,mult(X5,op_f)) = mult(mult(X4,X5),op_f)
& mult(X4,mult(op_f,X5)) = mult(mult(X4,op_f),X5) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(f08,axiom,
! [X1,X2] : mult(op_c,mult(X2,X1)) = mult(mult(op_c,X2),X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f08) ).
fof(f09,axiom,
! [X1,X2] : mult(X2,mult(X1,op_c)) = mult(mult(X2,X1),op_c),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f09) ).
fof(c_0_7,plain,
! [X3,X4] : ld(X4,mult(X4,X3)) = X3,
inference(variable_rename,[status(thm)],[f02]) ).
fof(c_0_8,plain,
! [X3,X4] : mult(X4,mult(op_c,X3)) = mult(mult(X4,op_c),X3),
inference(variable_rename,[status(thm)],[f10]) ).
cnf(c_0_9,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
mult(X1,mult(op_c,X2)) = mult(mult(X1,op_c),X2),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X3,X4] : op_f = mult(X4,mult(X3,ld(mult(X4,X3),op_c))),
inference(variable_rename,[status(thm)],[f13]) ).
fof(c_0_12,plain,
! [X3,X4] : mult(X4,ld(X4,X3)) = X3,
inference(variable_rename,[status(thm)],[f01]) ).
cnf(c_0_13,plain,
ld(mult(X1,op_c),mult(X1,mult(op_c,X2))) = X2,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
op_f = mult(X1,mult(X2,ld(mult(X1,X2),op_c))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
ld(mult(X1,op_c),op_c) = ld(mult(X1,op_c),op_f),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_17,negated_conjecture,
~ ! [X4,X5] :
( mult(op_f,mult(X4,X5)) = mult(mult(op_f,X4),X5)
& mult(X4,mult(X5,op_f)) = mult(mult(X4,X5),op_f)
& mult(X4,mult(op_f,X5)) = mult(mult(X4,op_f),X5) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_18,plain,
! [X3,X4] : mult(op_c,mult(X4,X3)) = mult(mult(op_c,X4),X3),
inference(variable_rename,[status(thm)],[f08]) ).
cnf(c_0_19,plain,
mult(X1,mult(op_c,ld(mult(X1,op_c),op_f))) = op_c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_10]) ).
cnf(c_0_20,plain,
mult(X1,mult(op_c,ld(mult(X1,op_c),X2))) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
fof(c_0_21,plain,
! [X3,X4] : mult(X4,mult(X3,op_c)) = mult(mult(X4,X3),op_c),
inference(variable_rename,[status(thm)],[f09]) ).
fof(c_0_22,negated_conjecture,
( mult(op_f,mult(esk1_0,esk2_0)) != mult(mult(op_f,esk1_0),esk2_0)
| mult(esk3_0,mult(esk4_0,op_f)) != mult(mult(esk3_0,esk4_0),op_f)
| mult(esk5_0,mult(op_f,esk6_0)) != mult(mult(esk5_0,op_f),esk6_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
cnf(c_0_23,plain,
mult(op_c,mult(X1,X2)) = mult(mult(op_c,X1),X2),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
op_c = op_f,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
mult(X1,mult(X2,op_c)) = mult(mult(X1,X2),op_c),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( mult(esk5_0,mult(op_f,esk6_0)) != mult(mult(esk5_0,op_f),esk6_0)
| mult(esk3_0,mult(esk4_0,op_f)) != mult(mult(esk3_0,esk4_0),op_f)
| mult(op_f,mult(esk1_0,esk2_0)) != mult(mult(op_f,esk1_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
mult(mult(op_f,X1),X2) = mult(op_f,mult(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
cnf(c_0_28,plain,
mult(mult(X1,X2),op_f) = mult(X1,mult(X2,op_f)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_24]),c_0_24]) ).
cnf(c_0_29,plain,
mult(mult(X1,op_f),X2) = mult(X1,mult(op_f,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_24]),c_0_24]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP704+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n018.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 12:31:13 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.015 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 31
% 0.25/1.43 # Proof object clause steps : 16
% 0.25/1.43 # Proof object formula steps : 15
% 0.25/1.43 # Proof object conjectures : 5
% 0.25/1.43 # Proof object clause conjectures : 2
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 7
% 0.25/1.43 # Proof object initial formulas used : 7
% 0.25/1.43 # Proof object generating inferences : 4
% 0.25/1.43 # Proof object simplifying inferences : 13
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 14
% 0.25/1.43 # Removed by relevancy pruning/SinE : 6
% 0.25/1.43 # Initial clauses : 8
% 0.25/1.43 # Removed in clause preprocessing : 0
% 0.25/1.43 # Initial clauses in saturation : 8
% 0.25/1.43 # Processed clauses : 31
% 0.25/1.43 # ...of these trivial : 2
% 0.25/1.43 # ...subsumed : 0
% 0.25/1.43 # ...remaining for further processing : 28
% 0.25/1.43 # Other redundant clauses eliminated : 0
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 0
% 0.25/1.43 # Backward-rewritten : 20
% 0.25/1.43 # Generated clauses : 412
% 0.25/1.43 # ...of the previous two non-trivial : 383
% 0.25/1.43 # Contextual simplify-reflections : 0
% 0.25/1.43 # Paramodulations : 412
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 0
% 0.25/1.43 # Current number of processed clauses : 8
% 0.25/1.43 # Positive orientable unit clauses : 8
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 0
% 0.25/1.43 # Non-unit-clauses : 0
% 0.25/1.43 # Current number of unprocessed clauses: 44
% 0.25/1.43 # ...number of literals in the above : 44
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 20
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 0
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 0
% 0.25/1.43 # Non-unit clause-clause subsumptions : 0
% 0.25/1.43 # Unit Clause-clause subsumption calls : 0
% 0.25/1.43 # Rewrite failures with RHS unbound : 4
% 0.25/1.43 # BW rewrite match attempts : 9
% 0.25/1.43 # BW rewrite match successes : 6
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 6719
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.024 s
% 0.25/1.43 # System time : 0.001 s
% 0.25/1.43 # Total time : 0.025 s
% 0.25/1.43 # Maximum resident set size: 3044 pages
%------------------------------------------------------------------------------