%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP700-10 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:58 PM UTC 2026
% Result : Unsatisfiable 0.16s 5.51s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 4 RR)
% Number of literals : 26 ( 25 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f08,axiom,
mult(mult(X1,X2),mult(X2,mult(X3,X2))) = mult(mult(X1,mult(X2,mult(X2,X3))),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).
cnf(f06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
cnf(f05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(goal,negated_conjecture,
tuple(mult(X1,x0),mult(x0,X1)) != tuple(unit,unit),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(c_0_8,axiom,
mult(mult(X1,X2),mult(X2,mult(X3,X2))) = mult(mult(X1,mult(X2,mult(X2,X3))),X2),
f08 ).
cnf(c_0_9,axiom,
mult(unit,X1) = X1,
f06 ).
cnf(c_0_10,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_11,plain,
mult(mult(X1,mult(X1,X2)),X1) = mult(X1,mult(X1,mult(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).
cnf(c_0_12,plain,
ld(mult(X1,mult(X1,X2)),mult(X1,mult(X1,mult(X2,X1)))) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_14,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_15,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_16,plain,
ld(mult(X1,mult(X1,rd(X2,X1))),mult(X1,mult(X1,X2))) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,axiom,
mult(X1,unit) = X1,
f05 ).
cnf(c_0_18,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
ld(mult(X1,mult(X1,rd(unit,X1))),mult(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
tuple(mult(X1,x0),mult(x0,X1)) != tuple(unit,unit),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_21,plain,
mult(X1,mult(X1,rd(unit,X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_14]) ).
cnf(c_0_22,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
tuple(mult(X1,x0),mult(x0,X1)) != tuple(unit,unit),
c_0_20 ).
cnf(c_0_24,plain,
mult(X1,rd(unit,X1)) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_21]),c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP700-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/5.39 % Computer : n019.cluster.edu
% 0.12/5.39 % Model : x86_64 x86_64
% 0.12/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39 % Memory : 8046.5625MB
% 0.12/5.39 % OS : Linux 6.8.0-71-generic
% 0.12/5.39 % CPULimit : 300
% 0.12/5.39 % WCLimit : 300
% 0.12/5.39 % DateTime : Sun Sep 20 20:34:11 UTC 2026
% 0.12/5.39 % CPUTime :
% 0.12/5.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.44 Running first-order theorem proving
% 0.16/5.44 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.16/5.51 % Version: 3.5.1
% 0.16/5.51 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/5.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.51 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/5.51 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.51 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.51 % Starting sh5l with 300s (1) cores
% 0.16/5.51 % sh5l with pid 882561 completed with status 0
% 0.16/5.51 % Result found by sh5l
% 0.16/5.51 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/5.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.51 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/5.51 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.51 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.51 % Starting sh5l with 300s (1) cores
% 0.16/5.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/5.51 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/5.51 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.16/5.51 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.51 % Starting SubtermCWHack with 28s (1) cores
% 0.16/5.51 % SubtermCWHack with pid 882569 completed with status 0
% 0.16/5.51 % Result found by SubtermCWHack
% 0.16/5.51 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/5.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.51 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/5.51 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.51 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.51 % Starting sh5l with 300s (1) cores
% 0.16/5.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/5.51 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/5.51 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.16/5.51 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.51 % Starting SubtermCWHack with 28s (1) cores
% 0.16/5.51 % Preprocessing time : 0.001 s
% 0.16/5.51
% 0.16/5.51 % Proof found!
% 0.16/5.51 % SZS status Unsatisfiable
% 0.16/5.51 % SZS output start CNFRefutation
% See solution above
% 0.16/5.51 % Parsed axioms : 9
% 0.16/5.51 % Removed by relevancy pruning/SinE : 0
% 0.16/5.51 % Initial clauses : 9
% 0.16/5.51 % Removed in clause preprocessing : 0
% 0.16/5.51 % Initial clauses in saturation : 9
% 0.16/5.51 % Processed clauses : 79
% 0.16/5.51 % ...of these trivial : 9
% 0.16/5.51 % ...subsumed : 6
% 0.16/5.51 % ...remaining for further processing : 64
% 0.16/5.51 % Other redundant clauses eliminated : 0
% 0.16/5.51 % Clauses deleted for lack of memory : 0
% 0.16/5.51 % Backward-subsumed : 0
% 0.16/5.51 % Backward-rewritten : 12
% 0.16/5.51 % Generated clauses : 1157
% 0.16/5.51 % ...of the previous two non-redundant : 769
% 0.16/5.51 % ...aggressively subsumed : 0
% 0.16/5.51 % Contextual simplify-reflections : 0
% 0.16/5.51 % Paramodulations : 1157
% 0.16/5.51 % Factorizations : 0
% 0.16/5.51 % NegExts : 0
% 0.16/5.51 % Equation resolutions : 0
% 0.16/5.51 % Disequality decompositions : 0
% 0.16/5.51 % Total rewrite steps : 1707
% 0.16/5.51 % ...of those cached : 1511
% 0.16/5.51 % Propositional unsat checks : 0
% 0.16/5.51 % Propositional check models : 0
% 0.16/5.51 % Propositional check unsatisfiable : 0
% 0.16/5.51 % Propositional clauses : 0
% 0.16/5.51 % Propositional clauses after purity: 0
% 0.16/5.51 % Propositional unsat core size : 0
% 0.16/5.51 % Propositional preprocessing time : 0.000
% 0.16/5.51 % Propositional encoding time : 0.000
% 0.16/5.51 % Propositional solver time : 0.000
% 0.16/5.51 % Success case prop preproc time : 0.000
% 0.16/5.51 % Success case prop encoding time : 0.000
% 0.16/5.51 % Success case prop solver time : 0.000
% 0.16/5.51 % Current number of processed clauses : 52
% 0.16/5.51 % Positive orientable unit clauses : 46
% 0.16/5.51 % Positive unorientable unit clauses: 0
% 0.16/5.51 % Negative unit clauses : 6
% 0.16/5.51 % Non-unit-clauses : 0
% 0.16/5.51 % Current number of unprocessed clauses: 696
% 0.16/5.51 % ...number of literals in the above : 696
% 0.16/5.51 % Current number of archived formulas : 0
% 0.16/5.51 % Current number of archived clauses : 12
% 0.16/5.51 % Clause-clause subsumption calls (NU) : 0
% 0.16/5.51 % Rec. Clause-clause subsumption calls : 0
% 0.16/5.51 % Non-unit clause-clause subsumptions : 0
% 0.16/5.51 % Unit Clause-clause subsumption calls : 4
% 0.16/5.51 % Rewrite failures with RHS unbound : 0
% 0.16/5.51 % BW rewrite match attempts : 59
% 0.16/5.51 % BW rewrite match successes : 10
% 0.16/5.51 % Condensation attempts : 0
% 0.16/5.51 % Condensation successes : 0
% 0.16/5.51 % Termbank termtop insertions : 19393
% 0.16/5.51 % Search garbage collected termcells : 2
% 0.16/5.51
% 0.16/5.51 % -------------------------------------------------
% 0.16/5.51 % User time : 0.025 s
% 0.16/5.51 % System time : 0.003 s
% 0.16/5.51 % Total time : 0.027 s
% 0.16/5.51 % Maximum resident set size: 3320 pages
% 0.16/5.51
% 0.16/5.51 % -------------------------------------------------
% 0.16/5.51 % User time : 0.026 s
% 0.16/5.51 % System time : 0.008 s
% 0.16/5.51 % Total time : 0.033 s
% 0.16/5.51 % Maximum resident set size: 4608 pages
% 0.16/5.51 % E exiting
%------------------------------------------------------------------------------