TSTP Solution File: GRP715+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GRP715+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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:26 EDT 2022
% Result : Theorem 0.17s 1.36s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 26 unt; 0 def)
% Number of atoms : 34 ( 33 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 2 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f07,axiom,
! [X2,X3] : mult(X3,mult(X2,X2)) = mult(mult(X3,X2),X2),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f07) ).
fof(f06,axiom,
! [X1,X2,X3] : mult(mult(mult(X3,X2),X1),X2) = mult(X3,mult(mult(X2,X1),X2)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f06) ).
fof(f09,axiom,
! [X3] : mult(unit,X3) = X3,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f09) ).
fof(f10,axiom,
mult(op_a,op_b) = unit,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f10) ).
fof(f08,axiom,
! [X3] : mult(X3,unit) = X3,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f08) ).
fof(goals,conjecture,
! [X4] :
( mult(mult(X4,op_a),op_b) = X4
& mult(mult(X4,op_b),op_a) = X4 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(f11,axiom,
mult(op_b,op_a) = unit,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f11) ).
fof(c_0_7,plain,
! [X4,X5] : mult(X5,mult(X4,X4)) = mult(mult(X5,X4),X4),
inference(variable_rename,[status(thm)],[f07]) ).
fof(c_0_8,plain,
! [X4,X5,X6] : mult(mult(mult(X6,X5),X4),X5) = mult(X6,mult(mult(X5,X4),X5)),
inference(variable_rename,[status(thm)],[f06]) ).
cnf(c_0_9,plain,
mult(X1,mult(X2,X2)) = mult(mult(X1,X2),X2),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X4] : mult(unit,X4) = X4,
inference(variable_rename,[status(thm)],[f09]) ).
cnf(c_0_12,plain,
mult(mult(X1,mult(mult(X2,X3),X2)),X2) = mult(mult(mult(X1,X2),X3),mult(X2,X2)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
mult(op_a,op_b) = unit,
inference(split_conjunct,[status(thm)],[f10]) ).
cnf(c_0_14,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X4] : mult(X4,unit) = X4,
inference(variable_rename,[status(thm)],[f08]) ).
fof(c_0_16,negated_conjecture,
~ ! [X4] :
( mult(mult(X4,op_a),op_b) = X4
& mult(mult(X4,op_b),op_a) = X4 ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_17,plain,
mult(mult(mult(X1,mult(mult(X2,X3),X2)),X2),X3) = mult(mult(X1,X2),mult(mult(X3,mult(X2,X2)),X3)),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_18,plain,
mult(op_b,op_a) = unit,
inference(split_conjunct,[status(thm)],[f11]) ).
cnf(c_0_19,plain,
mult(op_a,mult(op_b,op_b)) = op_b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_13]),c_0_14]) ).
cnf(c_0_20,plain,
mult(X1,unit) = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,negated_conjecture,
( mult(mult(esk1_0,op_a),op_b) != esk1_0
| mult(mult(esk2_0,op_b),op_a) != esk2_0 ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
cnf(c_0_22,plain,
mult(mult(X1,mult(op_b,op_b)),op_a) = mult(X1,op_b),
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_17,c_0_18]),c_0_14]),c_0_9]),c_0_19]),c_0_18]),c_0_20]) ).
cnf(c_0_23,plain,
mult(op_b,mult(op_a,op_a)) = op_a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_18]),c_0_14]) ).
cnf(c_0_24,negated_conjecture,
( mult(mult(esk2_0,op_b),op_a) != esk2_0
| mult(mult(esk1_0,op_a),op_b) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
mult(mult(X1,op_a),op_b) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_22]),c_0_19]),c_0_18]),c_0_20]) ).
cnf(c_0_26,plain,
mult(mult(mult(X1,op_b),mult(op_a,op_a)),mult(op_b,op_b)) = mult(X1,op_b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_23]),c_0_13]),c_0_20]) ).
cnf(c_0_27,negated_conjecture,
mult(mult(esk2_0,op_b),op_a) != esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_28,plain,
mult(mult(X1,op_b),op_a) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_26]),c_0_10]),c_0_23]),c_0_13]),c_0_20]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GRP715+1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.11 % Command : run_ET %s %d
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Mon Jun 13 11:00:11 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.17/1.36 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.17/1.36 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.17/1.36 # Preprocessing time : 0.009 s
% 0.17/1.36
% 0.17/1.36 # Proof found!
% 0.17/1.36 # SZS status Theorem
% 0.17/1.36 # SZS output start CNFRefutation
% See solution above
% 0.17/1.36 # Proof object total steps : 30
% 0.17/1.36 # Proof object clause steps : 17
% 0.17/1.36 # Proof object formula steps : 13
% 0.17/1.36 # Proof object conjectures : 6
% 0.17/1.36 # Proof object clause conjectures : 3
% 0.17/1.36 # Proof object formula conjectures : 3
% 0.17/1.36 # Proof object initial clauses used : 7
% 0.17/1.36 # Proof object initial formulas used : 7
% 0.17/1.36 # Proof object generating inferences : 8
% 0.17/1.36 # Proof object simplifying inferences : 20
% 0.17/1.36 # Training examples: 0 positive, 0 negative
% 0.17/1.36 # Parsed axioms : 12
% 0.17/1.36 # Removed by relevancy pruning/SinE : 5
% 0.17/1.36 # Initial clauses : 7
% 0.17/1.36 # Removed in clause preprocessing : 0
% 0.17/1.36 # Initial clauses in saturation : 7
% 0.17/1.36 # Processed clauses : 112
% 0.17/1.36 # ...of these trivial : 29
% 0.17/1.36 # ...subsumed : 4
% 0.17/1.36 # ...remaining for further processing : 79
% 0.17/1.36 # Other redundant clauses eliminated : 0
% 0.17/1.36 # Clauses deleted for lack of memory : 0
% 0.17/1.36 # Backward-subsumed : 0
% 0.17/1.36 # Backward-rewritten : 22
% 0.17/1.36 # Generated clauses : 2108
% 0.17/1.36 # ...of the previous two non-trivial : 1625
% 0.17/1.36 # Contextual simplify-reflections : 0
% 0.17/1.36 # Paramodulations : 2108
% 0.17/1.36 # Factorizations : 0
% 0.17/1.36 # Equation resolutions : 0
% 0.17/1.36 # Current number of processed clauses : 57
% 0.17/1.36 # Positive orientable unit clauses : 53
% 0.17/1.36 # Positive unorientable unit clauses: 4
% 0.17/1.36 # Negative unit clauses : 0
% 0.17/1.36 # Non-unit-clauses : 0
% 0.17/1.36 # Current number of unprocessed clauses: 1144
% 0.17/1.36 # ...number of literals in the above : 1144
% 0.17/1.36 # Current number of archived formulas : 0
% 0.17/1.36 # Current number of archived clauses : 22
% 0.17/1.36 # Clause-clause subsumption calls (NU) : 0
% 0.17/1.36 # Rec. Clause-clause subsumption calls : 0
% 0.17/1.36 # Non-unit clause-clause subsumptions : 0
% 0.17/1.36 # Unit Clause-clause subsumption calls : 10
% 0.17/1.36 # Rewrite failures with RHS unbound : 0
% 0.17/1.36 # BW rewrite match attempts : 114
% 0.17/1.36 # BW rewrite match successes : 18
% 0.17/1.36 # Condensation attempts : 0
% 0.17/1.36 # Condensation successes : 0
% 0.17/1.36 # Termbank termtop insertions : 54043
% 0.17/1.36
% 0.17/1.36 # -------------------------------------------------
% 0.17/1.36 # User time : 0.039 s
% 0.17/1.36 # System time : 0.001 s
% 0.17/1.36 # Total time : 0.040 s
% 0.17/1.36 # Maximum resident set size: 4624 pages
%------------------------------------------------------------------------------