%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP715-11 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:01 PM UTC 2026
% Result : Unsatisfiable 0.44s 0.52s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 9 RR)
% Number of literals : 23 ( 22 equ; 3 neg)
% Maximal clause size : 1 ( 1 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 : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f07,axiom,
mult(X1,mult(X2,X2)) = mult(mult(X1,X2),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f07) ).
cnf(f06,axiom,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).
cnf(f11,axiom,
mult(op_b,op_a) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f11) ).
cnf(f09,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).
cnf(f10,axiom,
mult(op_a,op_b) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f10) ).
cnf(f08,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).
cnf(goal,negated_conjecture,
mult(mult(x0,op_b),op_a) != x0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(c_0_7,axiom,
mult(X1,mult(X2,X2)) = mult(mult(X1,X2),X2),
f07 ).
cnf(c_0_8,axiom,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
f06 ).
cnf(c_0_9,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_7,c_0_8]) ).
cnf(c_0_10,axiom,
mult(op_b,op_a) = unit,
f11 ).
cnf(c_0_11,axiom,
mult(unit,X1) = X1,
f09 ).
cnf(c_0_12,axiom,
mult(op_a,op_b) = unit,
f10 ).
cnf(c_0_13,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_9,c_0_10]),c_0_11]),c_0_7]) ).
cnf(c_0_14,plain,
mult(op_a,mult(op_b,op_b)) = op_b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_12]),c_0_11]) ).
cnf(c_0_15,axiom,
mult(X1,unit) = X1,
f08 ).
cnf(c_0_16,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_8,c_0_13]),c_0_14]),c_0_10]),c_0_15]) ).
cnf(c_0_17,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_8,c_0_16]),c_0_14]),c_0_10]),c_0_15]) ).
cnf(c_0_18,negated_conjecture,
mult(mult(x0,op_b),op_a) != x0,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_19,plain,
mult(mult(X1,op_a),mult(op_b,op_b)) = mult(X1,op_b),
inference(spm,[status(thm)],[c_0_7,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
mult(mult(x0,op_b),op_a) != x0,
c_0_18 ).
cnf(c_0_21,plain,
mult(mult(X1,op_b),op_a) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_19]),c_0_17]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP715-11 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n003.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 20 20:36:44 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.43 Running first-order theorem proving
% 0.10/0.43 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.44/0.52 % Version: 3.5.1
% 0.44/0.52 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.44/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.44/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.44/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.44/0.52 % Starting sh5l with 300s (1) cores
% 0.44/0.52 % new_bool_3 with pid 2562411 completed with status 0
% 0.44/0.52 % Result found by new_bool_3
% 0.44/0.52 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.44/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.44/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.44/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.44/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.44/0.52 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.44/0.52 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.44/0.52 % Starting SubtermCWHack with 28s (1) cores
% 0.44/0.52 % SubtermCWHack with pid 2562419 completed with status 0
% 0.44/0.52 % Result found by SubtermCWHack
% 0.44/0.52 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.44/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.44/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.44/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.44/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.44/0.52 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.44/0.52 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.44/0.52 % Starting SubtermCWHack with 28s (1) cores
% 0.44/0.52 % Preprocessing time : 0.001 s
% 0.44/0.52
% 0.44/0.52 % Proof found!
% 0.44/0.52 % SZS status Unsatisfiable
% 0.44/0.52 % SZS output start CNFRefutation
% See solution above
% 0.44/0.52 % Parsed axioms : 12
% 0.44/0.52 % Removed by relevancy pruning/SinE : 5
% 0.44/0.52 % Initial clauses : 7
% 0.44/0.52 % Removed in clause preprocessing : 0
% 0.44/0.52 % Initial clauses in saturation : 7
% 0.44/0.52 % Processed clauses : 53
% 0.44/0.52 % ...of these trivial : 4
% 0.44/0.52 % ...subsumed : 0
% 0.44/0.52 % ...remaining for further processing : 49
% 0.44/0.52 % Other redundant clauses eliminated : 0
% 0.44/0.52 % Clauses deleted for lack of memory : 0
% 0.44/0.52 % Backward-subsumed : 0
% 0.44/0.52 % Backward-rewritten : 12
% 0.44/0.52 % Generated clauses : 501
% 0.44/0.52 % ...of the previous two non-redundant : 349
% 0.44/0.52 % ...aggressively subsumed : 0
% 0.44/0.52 % Contextual simplify-reflections : 0
% 0.44/0.52 % Paramodulations : 501
% 0.44/0.52 % Factorizations : 0
% 0.44/0.52 % NegExts : 0
% 0.44/0.52 % Equation resolutions : 0
% 0.44/0.52 % Disequality decompositions : 0
% 0.44/0.52 % Total rewrite steps : 719
% 0.44/0.52 % ...of those cached : 590
% 0.44/0.52 % Propositional unsat checks : 0
% 0.44/0.52 % Propositional check models : 0
% 0.44/0.52 % Propositional check unsatisfiable : 0
% 0.44/0.52 % Propositional clauses : 0
% 0.44/0.52 % Propositional clauses after purity: 0
% 0.44/0.52 % Propositional unsat core size : 0
% 0.44/0.52 % Propositional preprocessing time : 0.000
% 0.44/0.52 % Propositional encoding time : 0.000
% 0.44/0.52 % Propositional solver time : 0.000
% 0.44/0.52 % Success case prop preproc time : 0.000
% 0.44/0.52 % Success case prop encoding time : 0.000
% 0.44/0.52 % Success case prop solver time : 0.000
% 0.44/0.52 % Current number of processed clauses : 37
% 0.44/0.52 % Positive orientable unit clauses : 37
% 0.44/0.52 % Positive unorientable unit clauses: 0
% 0.44/0.52 % Negative unit clauses : 0
% 0.44/0.52 % Non-unit-clauses : 0
% 0.44/0.52 % Current number of unprocessed clauses: 299
% 0.44/0.52 % ...number of literals in the above : 299
% 0.44/0.52 % Current number of archived formulas : 0
% 0.44/0.52 % Current number of archived clauses : 12
% 0.44/0.52 % Clause-clause subsumption calls (NU) : 0
% 0.44/0.52 % Rec. Clause-clause subsumption calls : 0
% 0.44/0.52 % Non-unit clause-clause subsumptions : 0
% 0.44/0.52 % Unit Clause-clause subsumption calls : 0
% 0.44/0.52 % Rewrite failures with RHS unbound : 0
% 0.44/0.52 % BW rewrite match attempts : 47
% 0.44/0.52 % BW rewrite match successes : 14
% 0.44/0.52 % Condensation attempts : 0
% 0.44/0.52 % Condensation successes : 0
% 0.44/0.52 % Termbank termtop insertions : 10554
% 0.44/0.52 % Search garbage collected termcells : 19
% 0.44/0.52
% 0.44/0.52 % -------------------------------------------------
% 0.44/0.52 % User time : 0.011 s
% 0.44/0.52 % System time : 0.002 s
% 0.44/0.52 % Total time : 0.012 s
% 0.44/0.52 % Maximum resident set size: 3636 pages
% 0.44/0.52
% 0.44/0.52 % -------------------------------------------------
% 0.44/0.52 % User time : 0.013 s
% 0.44/0.52 % System time : 0.005 s
% 0.44/0.52 % Total time : 0.018 s
% 0.44/0.52 % Maximum resident set size: 4864 pages
% 0.44/0.52 % E exiting
%------------------------------------------------------------------------------