TSTP Solution File: GRP703+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GRP703+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 21 unt; 0 def)
% Number of atoms : 35 ( 34 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 9 ~; 5 |; 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 : 41 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(f12,axiom,
! [X1,X2] : op_e = mult(mult(rd(op_c,mult(X2,X1)),X1),X2),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f12) ).
fof(f03,axiom,
! [X1,X2] : mult(rd(X2,X1),X1) = X2,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f03) ).
fof(goals,conjecture,
! [X4,X5] :
( mult(op_e,mult(X4,X5)) = mult(mult(op_e,X4),X5)
& mult(X4,mult(X5,op_e)) = mult(mult(X4,X5),op_e)
& mult(X4,mult(op_e,X5)) = mult(mult(X4,op_e),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(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_6,plain,
! [X3,X4] : mult(X4,mult(X3,op_c)) = mult(mult(X4,X3),op_c),
inference(variable_rename,[status(thm)],[f09]) ).
fof(c_0_7,plain,
! [X3,X4] : op_e = mult(mult(rd(op_c,mult(X4,X3)),X3),X4),
inference(variable_rename,[status(thm)],[f12]) ).
fof(c_0_8,plain,
! [X3,X4] : mult(rd(X4,X3),X3) = X4,
inference(variable_rename,[status(thm)],[f03]) ).
cnf(c_0_9,plain,
mult(X1,mult(X2,op_c)) = mult(mult(X1,X2),op_c),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
op_e = mult(mult(rd(op_c,mult(X1,X2)),X2),X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,negated_conjecture,
~ ! [X4,X5] :
( mult(op_e,mult(X4,X5)) = mult(mult(op_e,X4),X5)
& mult(X4,mult(X5,op_e)) = mult(mult(X4,X5),op_e)
& mult(X4,mult(op_e,X5)) = mult(mult(X4,op_e),X5) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_12,plain,
! [X3,X4] : mult(op_c,mult(X4,X3)) = mult(mult(op_c,X4),X3),
inference(variable_rename,[status(thm)],[f08]) ).
cnf(c_0_13,plain,
mult(rd(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
mult(rd(op_c,mult(op_c,X1)),mult(X1,op_c)) = op_e,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_15,negated_conjecture,
( mult(op_e,mult(esk1_0,esk2_0)) != mult(mult(op_e,esk1_0),esk2_0)
| mult(esk3_0,mult(esk4_0,op_e)) != mult(mult(esk3_0,esk4_0),op_e)
| mult(esk5_0,mult(op_e,esk6_0)) != mult(mult(esk5_0,op_e),esk6_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_16,plain,
mult(op_c,mult(X1,X2)) = mult(mult(op_c,X1),X2),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
op_c = op_e,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_18,plain,
! [X3,X4] : mult(X4,mult(op_c,X3)) = mult(mult(X4,op_c),X3),
inference(variable_rename,[status(thm)],[f10]) ).
cnf(c_0_19,negated_conjecture,
( mult(esk5_0,mult(op_e,esk6_0)) != mult(mult(esk5_0,op_e),esk6_0)
| mult(esk3_0,mult(esk4_0,op_e)) != mult(mult(esk3_0,esk4_0),op_e)
| mult(op_e,mult(esk1_0,esk2_0)) != mult(mult(op_e,esk1_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
mult(mult(op_e,X1),X2) = mult(op_e,mult(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_21,plain,
mult(X1,mult(op_c,X2)) = mult(mult(X1,op_c),X2),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( mult(mult(esk3_0,esk4_0),op_e) != mult(esk3_0,mult(esk4_0,op_e))
| mult(mult(esk5_0,op_e),esk6_0) != mult(esk5_0,mult(op_e,esk6_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_23,plain,
mult(mult(X1,X2),op_e) = mult(X1,mult(X2,op_e)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_17]),c_0_17]) ).
cnf(c_0_24,plain,
mult(mult(X1,op_e),X2) = mult(X1,mult(op_e,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_17]),c_0_17]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP703+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n021.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 : Tue Jun 14 01:46:57 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.014 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 26
% 0.23/1.42 # Proof object clause steps : 13
% 0.23/1.42 # Proof object formula steps : 13
% 0.23/1.42 # Proof object conjectures : 6
% 0.23/1.42 # Proof object clause conjectures : 3
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 6
% 0.23/1.42 # Proof object initial formulas used : 6
% 0.23/1.42 # Proof object generating inferences : 2
% 0.23/1.42 # Proof object simplifying inferences : 12
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 14
% 0.23/1.42 # Removed by relevancy pruning/SinE : 6
% 0.23/1.42 # Initial clauses : 8
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 8
% 0.23/1.42 # Processed clauses : 21
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 0
% 0.23/1.42 # ...remaining for further processing : 20
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 9
% 0.23/1.42 # Generated clauses : 188
% 0.23/1.42 # ...of the previous two non-trivial : 159
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 188
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 11
% 0.23/1.42 # Positive orientable unit clauses : 11
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 0
% 0.23/1.42 # Non-unit-clauses : 0
% 0.23/1.42 # Current number of unprocessed clauses: 85
% 0.23/1.42 # ...number of literals in the above : 85
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 9
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.42 # Non-unit clause-clause subsumptions : 0
% 0.23/1.42 # Unit Clause-clause subsumption calls : 0
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 5
% 0.23/1.42 # BW rewrite match successes : 3
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 4031
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.014 s
% 0.23/1.42 # System time : 0.005 s
% 0.23/1.42 # Total time : 0.019 s
% 0.23/1.42 # Maximum resident set size: 2780 pages
%------------------------------------------------------------------------------