%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP665-12 : 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 : n008.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:40:41 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.48s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 5 RR)
% Number of literals : 12 ( 11 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(goal,negated_conjecture,
mult(mult(x0,x1),op_c) != mult(x0,mult(x1,op_c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(f09,axiom,
mult(op_c,X1) = mult(X1,op_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).
cnf(f07,axiom,
mult(X1,mult(X2,X3)) = mult(rd(mult(X1,X2),X1),mult(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f07) ).
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
cnf(c_0_4,negated_conjecture,
mult(mult(x0,x1),op_c) != mult(x0,mult(x1,op_c)),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_5,negated_conjecture,
mult(mult(x0,x1),op_c) != mult(x0,mult(x1,op_c)),
c_0_4 ).
cnf(c_0_6,axiom,
mult(op_c,X1) = mult(X1,op_c),
f09 ).
cnf(c_0_7,axiom,
mult(X1,mult(X2,X3)) = mult(rd(mult(X1,X2),X1),mult(X1,X3)),
f07 ).
cnf(c_0_8,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_9,negated_conjecture,
mult(x0,mult(op_c,x1)) != mult(op_c,mult(x0,x1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_10,plain,
mult(X1,mult(op_c,X2)) = mult(op_c,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_6]),c_0_8]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP665-12 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 % Computer : n008.cluster.edu
% 0.14/0.39 % Model : x86_64 x86_64
% 0.14/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39 % Memory : 8046.5625MB
% 0.14/0.39 % OS : Linux 6.8.0-71-generic
% 0.14/0.39 % CPULimit : 300
% 0.14/0.39 % WCLimit : 300
% 0.14/0.39 % DateTime : Sun Sep 20 20:31:27 UTC 2026
% 0.14/0.39 % CPUTime :
% 0.14/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/0.44 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.14/0.48 % Version: 3.5.1
% 0.14/0.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.48 % Starting sh5l with 300s (1) cores
% 0.14/0.48 % sh5l with pid 3556891 completed with status 0
% 0.14/0.48 % Result found by sh5l
% 0.14/0.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.48 % Starting sh5l with 300s (1) cores
% 0.14/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.48 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.48 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.14/0.48 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.48 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.48 % SubtermCWHack with pid 3556899 completed with status 0
% 0.14/0.48 % Result found by SubtermCWHack
% 0.14/0.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.48 % Starting sh5l with 300s (1) cores
% 0.14/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.48 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.48 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.14/0.48 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.48 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.48 % Preprocessing time : 0.001 s
% 0.14/0.48
% 0.14/0.48 % Proof found!
% 0.14/0.48 % SZS status Unsatisfiable
% 0.14/0.48 % SZS output start CNFRefutation
% See solution above
% 0.14/0.48 % Parsed axioms : 10
% 0.14/0.48 % Removed by relevancy pruning/SinE : 0
% 0.14/0.48 % Initial clauses : 10
% 0.14/0.48 % Removed in clause preprocessing : 0
% 0.14/0.48 % Initial clauses in saturation : 10
% 0.14/0.48 % Processed clauses : 35
% 0.14/0.48 % ...of these trivial : 4
% 0.14/0.48 % ...subsumed : 6
% 0.14/0.48 % ...remaining for further processing : 25
% 0.14/0.48 % Other redundant clauses eliminated : 0
% 0.14/0.48 % Clauses deleted for lack of memory : 0
% 0.14/0.48 % Backward-subsumed : 0
% 0.14/0.48 % Backward-rewritten : 3
% 0.14/0.48 % Generated clauses : 176
% 0.14/0.48 % ...of the previous two non-redundant : 85
% 0.14/0.48 % ...aggressively subsumed : 0
% 0.14/0.48 % Contextual simplify-reflections : 0
% 0.14/0.48 % Paramodulations : 176
% 0.14/0.48 % Factorizations : 0
% 0.14/0.48 % NegExts : 0
% 0.14/0.48 % Equation resolutions : 0
% 0.14/0.48 % Disequality decompositions : 0
% 0.14/0.48 % Total rewrite steps : 102
% 0.14/0.48 % ...of those cached : 54
% 0.14/0.48 % Propositional unsat checks : 0
% 0.14/0.48 % Propositional check models : 0
% 0.14/0.48 % Propositional check unsatisfiable : 0
% 0.14/0.48 % Propositional clauses : 0
% 0.14/0.48 % Propositional clauses after purity: 0
% 0.14/0.48 % Propositional unsat core size : 0
% 0.14/0.48 % Propositional preprocessing time : 0.000
% 0.14/0.48 % Propositional encoding time : 0.000
% 0.14/0.48 % Propositional solver time : 0.000
% 0.14/0.48 % Success case prop preproc time : 0.000
% 0.14/0.48 % Success case prop encoding time : 0.000
% 0.14/0.48 % Success case prop solver time : 0.000
% 0.14/0.48 % Current number of processed clauses : 22
% 0.14/0.48 % Positive orientable unit clauses : 19
% 0.14/0.48 % Positive unorientable unit clauses: 3
% 0.14/0.48 % Negative unit clauses : 0
% 0.14/0.48 % Non-unit-clauses : 0
% 0.14/0.48 % Current number of unprocessed clauses: 54
% 0.14/0.48 % ...number of literals in the above : 54
% 0.14/0.48 % Current number of archived formulas : 0
% 0.14/0.48 % Current number of archived clauses : 3
% 0.14/0.48 % Clause-clause subsumption calls (NU) : 0
% 0.14/0.48 % Rec. Clause-clause subsumption calls : 0
% 0.14/0.48 % Non-unit clause-clause subsumptions : 0
% 0.14/0.48 % Unit Clause-clause subsumption calls : 1
% 0.14/0.48 % Rewrite failures with RHS unbound : 0
% 0.14/0.48 % BW rewrite match attempts : 11
% 0.14/0.48 % BW rewrite match successes : 6
% 0.14/0.48 % Condensation attempts : 0
% 0.14/0.48 % Condensation successes : 0
% 0.14/0.48 % Termbank termtop insertions : 1574
% 0.14/0.48 % Search garbage collected termcells : 2
% 0.14/0.48
% 0.14/0.48 % -------------------------------------------------
% 0.14/0.48 % User time : 0.005 s
% 0.14/0.48 % System time : 0.002 s
% 0.14/0.48 % Total time : 0.007 s
% 0.14/0.48 % Maximum resident set size: 3632 pages
% 0.14/0.48
% 0.14/0.48 % -------------------------------------------------
% 0.14/0.48 % User time : 0.005 s
% 0.14/0.48 % System time : 0.008 s
% 0.14/0.48 % Total time : 0.013 s
% 0.14/0.48 % Maximum resident set size: 4608 pages
% 0.14/0.48 % E exiting
%------------------------------------------------------------------------------