TSTP Solution File: GRP702+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GRP702+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n014.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:22 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 27 unt; 0 def)
% Number of atoms : 41 ( 40 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 20 ( 11 ~; 5 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 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 : 45 ( 0 sgn 26 !; 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(f11,axiom,
! [X2] : op_d = ld(X2,mult(op_c,X2)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f11) ).
fof(goals,conjecture,
! [X4,X5] :
( mult(op_d,mult(X4,X5)) = mult(mult(op_d,X4),X5)
& mult(X4,mult(X5,op_d)) = mult(mult(X4,X5),op_d)
& mult(X4,mult(op_d,X5)) = mult(mult(X4,op_d),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(f01,axiom,
! [X1,X2] : mult(X2,ld(X2,X1)) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f01) ).
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(c_0_7,plain,
! [X3,X4] : ld(X4,mult(X4,X3)) = X3,
inference(variable_rename,[status(thm)],[f02]) ).
fof(c_0_8,plain,
! [X3] : op_d = ld(X3,mult(op_c,X3)),
inference(variable_rename,[status(thm)],[f11]) ).
fof(c_0_9,negated_conjecture,
~ ! [X4,X5] :
( mult(op_d,mult(X4,X5)) = mult(mult(op_d,X4),X5)
& mult(X4,mult(X5,op_d)) = mult(mult(X4,X5),op_d)
& mult(X4,mult(op_d,X5)) = mult(mult(X4,op_d),X5) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_10,plain,
! [X3,X4] : mult(op_c,mult(X4,X3)) = mult(mult(op_c,X4),X3),
inference(variable_rename,[status(thm)],[f08]) ).
cnf(c_0_11,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
op_d = ld(X1,mult(op_c,X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,negated_conjecture,
( mult(op_d,mult(esk1_0,esk2_0)) != mult(mult(op_d,esk1_0),esk2_0)
| mult(esk3_0,mult(esk4_0,op_d)) != mult(mult(esk3_0,esk4_0),op_d)
| mult(esk5_0,mult(op_d,esk6_0)) != mult(mult(esk5_0,op_d),esk6_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_14,plain,
mult(op_c,mult(X1,X2)) = mult(mult(op_c,X1),X2),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
op_c = op_d,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,plain,
! [X3,X4] : mult(X4,mult(X3,op_c)) = mult(mult(X4,X3),op_c),
inference(variable_rename,[status(thm)],[f09]) ).
cnf(c_0_17,negated_conjecture,
( mult(esk5_0,mult(op_d,esk6_0)) != mult(mult(esk5_0,op_d),esk6_0)
| mult(esk3_0,mult(esk4_0,op_d)) != mult(mult(esk3_0,esk4_0),op_d)
| mult(op_d,mult(esk1_0,esk2_0)) != mult(mult(op_d,esk1_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
mult(mult(op_d,X1),X2) = mult(op_d,mult(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
cnf(c_0_19,plain,
mult(X1,mult(X2,op_c)) = mult(mult(X1,X2),op_c),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X3,X4] : mult(X4,ld(X4,X3)) = X3,
inference(variable_rename,[status(thm)],[f01]) ).
cnf(c_0_21,negated_conjecture,
( mult(mult(esk3_0,esk4_0),op_d) != mult(esk3_0,mult(esk4_0,op_d))
| mult(mult(esk5_0,op_d),esk6_0) != mult(esk5_0,mult(op_d,esk6_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_22,plain,
mult(mult(X1,X2),op_d) = mult(X1,mult(X2,op_d)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_15]),c_0_15]) ).
cnf(c_0_23,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
ld(X1,mult(op_d,X1)) = op_d,
inference(rw,[status(thm)],[c_0_12,c_0_15]) ).
fof(c_0_25,plain,
! [X3,X4] : mult(X4,mult(op_c,X3)) = mult(mult(X4,op_c),X3),
inference(variable_rename,[status(thm)],[f10]) ).
cnf(c_0_26,negated_conjecture,
mult(mult(esk5_0,op_d),esk6_0) != mult(esk5_0,mult(op_d,esk6_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_27,plain,
mult(X1,op_d) = mult(op_d,X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
mult(X1,mult(op_c,X2)) = mult(mult(X1,op_c),X2),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
mult(mult(esk5_0,op_d),esk6_0) != mult(esk5_0,mult(esk6_0,op_d)),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
mult(mult(X1,op_d),X2) = mult(X1,mult(op_d,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_15]),c_0_15]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP702+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 12:29:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.014 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 32
% 0.24/1.42 # Proof object clause steps : 17
% 0.24/1.42 # Proof object formula steps : 15
% 0.24/1.42 # Proof object conjectures : 8
% 0.24/1.42 # Proof object clause conjectures : 5
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 7
% 0.24/1.42 # Proof object initial formulas used : 7
% 0.24/1.42 # Proof object generating inferences : 2
% 0.24/1.42 # Proof object simplifying inferences : 15
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 14
% 0.24/1.42 # Removed by relevancy pruning/SinE : 6
% 0.24/1.42 # Initial clauses : 8
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 8
% 0.24/1.42 # Processed clauses : 32
% 0.24/1.42 # ...of these trivial : 1
% 0.24/1.42 # ...subsumed : 5
% 0.24/1.42 # ...remaining for further processing : 26
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 9
% 0.24/1.42 # Generated clauses : 320
% 0.24/1.42 # ...of the previous two non-trivial : 250
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 320
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 17
% 0.24/1.42 # Positive orientable unit clauses : 14
% 0.24/1.42 # Positive unorientable unit clauses: 3
% 0.24/1.42 # Negative unit clauses : 0
% 0.24/1.42 # Non-unit-clauses : 0
% 0.24/1.42 # Current number of unprocessed clauses: 195
% 0.24/1.42 # ...number of literals in the above : 195
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 9
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.24/1.42 # Non-unit clause-clause subsumptions : 0
% 0.24/1.42 # Unit Clause-clause subsumption calls : 2
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 15
% 0.24/1.42 # BW rewrite match successes : 12
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 5427
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.018 s
% 0.24/1.42 # System time : 0.004 s
% 0.24/1.42 # Total time : 0.022 s
% 0.24/1.42 # Maximum resident set size: 3044 pages
%------------------------------------------------------------------------------