%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP715+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:41:02 PM UTC 2026
% Result : Theorem 0.24s 0.62s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 29 ( 25 unt; 0 def)
% Number of atoms : 33 ( 32 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 : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f07,axiom,
! [X2,X3] : mult(X3,mult(X2,X2)) = mult(mult(X3,X2),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',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/benchmark/theBenchmark.p',f06) ).
fof(f09,axiom,
! [X3] : mult(unit,X3) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f09) ).
fof(f11,axiom,
mult(op_b,op_a) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f11) ).
fof(f10,axiom,
mult(op_a,op_b) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f10) ).
fof(f08,axiom,
! [X3] : mult(X3,unit) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).
fof(goals,conjecture,
! [X4] :
( mult(mult(X4,op_b),op_a) = X4
& mult(mult(X4,op_a),op_b) = X4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(c_0_7,plain,
! [X9,X10] : mult(X10,mult(X9,X9)) = mult(mult(X10,X9),X9),
inference(variable_rename,[status(thm)],[f07]) ).
fof(c_0_8,plain,
! [X6,X7,X8] : mult(mult(mult(X8,X7),X6),X7) = mult(X8,mult(mult(X7,X6),X7)),
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,
! [X12] : mult(unit,X12) = X12,
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_b,op_a) = unit,
inference(split_conjunct,[status(thm)],[f11]) ).
cnf(c_0_14,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
mult(op_a,op_b) = unit,
inference(split_conjunct,[status(thm)],[f10]) ).
fof(c_0_16,plain,
! [X11] : mult(X11,unit) = X11,
inference(variable_rename,[status(thm)],[f08]) ).
cnf(c_0_17,plain,
mult(mult(mult(X1,op_b),op_a),mult(op_b,op_b)) = mult(X1,mult(op_b,op_b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_9]) ).
cnf(c_0_18,plain,
mult(op_a,mult(op_b,op_b)) = op_b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_15]),c_0_14]) ).
cnf(c_0_19,plain,
mult(X1,unit) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,negated_conjecture,
~ ! [X4] :
( mult(mult(X4,op_b),op_a) = X4
& mult(mult(X4,op_a),op_b) = X4 ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_21,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(spm,[status(thm)],[c_0_10,c_0_17]),c_0_18]),c_0_13]),c_0_19]) ).
fof(c_0_22,negated_conjecture,
( mult(mult(esk1_0,op_b),op_a) != esk1_0
| mult(mult(esk1_0,op_a),op_b) != esk1_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
cnf(c_0_23,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_21]),c_0_18]),c_0_13]),c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( mult(mult(esk1_0,op_b),op_a) != esk1_0
| mult(mult(esk1_0,op_a),op_b) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,plain,
mult(mult(X1,op_a),mult(op_b,op_b)) = mult(X1,op_b),
inference(spm,[status(thm)],[c_0_9,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
mult(mult(esk1_0,op_b),op_a) != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_23])]) ).
cnf(c_0_27,plain,
mult(mult(X1,op_b),op_a) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_25]),c_0_23]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP715+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.46 % Computer : n006.cluster.edu
% 0.21/0.46 % Model : x86_64 x86_64
% 0.21/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46 % Memory : 8046.5625MB
% 0.21/0.46 % OS : Linux 6.8.0-71-generic
% 0.21/0.46 % CPULimit : 300
% 0.21/0.46 % WCLimit : 300
% 0.21/0.46 % DateTime : Sun Sep 20 20:34:57 UTC 2026
% 0.21/0.46 % CPUTime :
% 0.21/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.52 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.24/0.62 % Version: 3.5.1
% 0.24/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.62 % Starting sh5l with 300s (1) cores
% 0.24/0.62 % new_bool_3 with pid 1221257 completed with status 0
% 0.24/0.62 % Result found by new_bool_3
% 0.24/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.62 % Search class: FUHPM-FFSF22-MFFFFFNN
% 0.24/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.62 % SubtermCWHack with pid 1221265 completed with status 0
% 0.24/0.62 % Result found by SubtermCWHack
% 0.24/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.62 % Search class: FUHPM-FFSF22-MFFFFFNN
% 0.24/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.62 % Preprocessing time : 0.002 s
% 0.24/0.62
% 0.24/0.62 % Proof found!
% 0.24/0.62 % SZS status Theorem
% 0.24/0.62 % SZS output start CNFRefutation
% See solution above
% 0.24/0.62 % Parsed axioms : 12
% 0.24/0.62 % Removed by relevancy pruning/SinE : 5
% 0.24/0.62 % Initial clauses : 7
% 0.24/0.62 % Removed in clause preprocessing : 0
% 0.24/0.62 % Initial clauses in saturation : 7
% 0.24/0.62 % Processed clauses : 54
% 0.24/0.62 % ...of these trivial : 4
% 0.24/0.62 % ...subsumed : 0
% 0.24/0.62 % ...remaining for further processing : 50
% 0.24/0.62 % Other redundant clauses eliminated : 0
% 0.24/0.62 % Clauses deleted for lack of memory : 0
% 0.24/0.62 % Backward-subsumed : 0
% 0.24/0.62 % Backward-rewritten : 13
% 0.24/0.62 % Generated clauses : 501
% 0.24/0.62 % ...of the previous two non-redundant : 350
% 0.24/0.62 % ...aggressively subsumed : 0
% 0.24/0.62 % Contextual simplify-reflections : 0
% 0.24/0.62 % Paramodulations : 501
% 0.24/0.62 % Factorizations : 0
% 0.24/0.62 % NegExts : 0
% 0.24/0.62 % Equation resolutions : 0
% 0.24/0.62 % Disequality decompositions : 0
% 0.24/0.62 % Total rewrite steps : 720
% 0.24/0.62 % ...of those cached : 590
% 0.24/0.62 % Propositional unsat checks : 0
% 0.24/0.62 % Propositional check models : 0
% 0.24/0.62 % Propositional check unsatisfiable : 0
% 0.24/0.62 % Propositional clauses : 0
% 0.24/0.62 % Propositional clauses after purity: 0
% 0.24/0.62 % Propositional unsat core size : 0
% 0.24/0.62 % Propositional preprocessing time : 0.000
% 0.24/0.62 % Propositional encoding time : 0.000
% 0.24/0.62 % Propositional solver time : 0.000
% 0.24/0.62 % Success case prop preproc time : 0.000
% 0.24/0.62 % Success case prop encoding time : 0.000
% 0.24/0.62 % Success case prop solver time : 0.000
% 0.24/0.62 % Current number of processed clauses : 37
% 0.24/0.62 % Positive orientable unit clauses : 37
% 0.24/0.62 % Positive unorientable unit clauses: 0
% 0.24/0.62 % Negative unit clauses : 0
% 0.24/0.62 % Non-unit-clauses : 0
% 0.24/0.62 % Current number of unprocessed clauses: 299
% 0.24/0.62 % ...number of literals in the above : 299
% 0.24/0.62 % Current number of archived formulas : 0
% 0.24/0.62 % Current number of archived clauses : 13
% 0.24/0.62 % Clause-clause subsumption calls (NU) : 0
% 0.24/0.62 % Rec. Clause-clause subsumption calls : 0
% 0.24/0.62 % Non-unit clause-clause subsumptions : 0
% 0.24/0.62 % Unit Clause-clause subsumption calls : 0
% 0.24/0.62 % Rewrite failures with RHS unbound : 0
% 0.24/0.62 % BW rewrite match attempts : 47
% 0.24/0.62 % BW rewrite match successes : 15
% 0.24/0.62 % Condensation attempts : 0
% 0.24/0.62 % Condensation successes : 0
% 0.24/0.62 % Termbank termtop insertions : 10747
% 0.24/0.62 % Search garbage collected termcells : 49
% 0.24/0.62
% 0.24/0.62 % -------------------------------------------------
% 0.24/0.62 % User time : 0.021 s
% 0.24/0.62 % System time : 0.001 s
% 0.24/0.62 % Total time : 0.022 s
% 0.24/0.62 % Maximum resident set size: 3636 pages
% 0.24/0.62
% 0.24/0.62 % -------------------------------------------------
% 0.24/0.62 % User time : 0.022 s
% 0.24/0.62 % System time : 0.009 s
% 0.24/0.62 % Total time : 0.030 s
% 0.24/0.62 % Maximum resident set size: 4608 pages
% 0.24/0.62 % E exiting
%------------------------------------------------------------------------------