%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP751-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 : n016.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:45:04 PM UTC 2026
% Result : Unsatisfiable 1.49s 1.01s
% Output : CNFRefutation 1.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% 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 : 6 ( 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 : 62 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(f07,axiom,
mult(mult(X1,X2),mult(X3,X3)) = mult(mult(X1,X3),mult(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f07) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(f05,axiom,
mult(mult(X1,mult(X1,X1)),mult(X2,X3)) = mult(mult(X1,X2),mult(mult(X1,X1),X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(goals,negated_conjecture,
mult(a,mult(b,c)) != mult(mult(rd(a,a),b),mult(a,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_5,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_6,axiom,
mult(mult(X1,X2),mult(X3,X3)) = mult(mult(X1,X3),mult(X2,X3)),
f07 ).
cnf(c_0_7,plain,
rd(mult(mult(X1,X2),mult(X3,X3)),mult(X2,X3)) = mult(X1,X3),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_9,plain,
rd(mult(X1,mult(X2,X2)),mult(X3,X2)) = mult(rd(X1,X3),X2),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
mult(rd(rd(X1,mult(X2,X2)),X3),X2) = rd(X1,mult(X3,X2)),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,axiom,
mult(mult(X1,mult(X1,X1)),mult(X2,X3)) = mult(mult(X1,X2),mult(mult(X1,X1),X3)),
f05 ).
cnf(c_0_12,plain,
mult(mult(rd(X1,X2),X3),mult(X2,X2)) = mult(X1,mult(X3,X2)),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_13,plain,
rd(rd(X1,mult(X2,X3)),X3) = rd(rd(X1,mult(X3,X3)),X2),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_14,plain,
rd(mult(mult(X1,mult(X1,X1)),mult(X2,X3)),mult(mult(X1,X1),X3)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_15,plain,
rd(mult(X1,mult(X2,X3)),mult(X3,X3)) = mult(rd(X1,X3),X2),
inference(spm,[status(thm)],[c_0_5,c_0_12]) ).
cnf(c_0_16,plain,
mult(rd(X1,rd(X2,X3)),X3) = rd(mult(X1,mult(X3,X3)),X2),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_17,plain,
rd(mult(rd(mult(X1,mult(X1,X1)),X2),X3),mult(X1,X1)) = rd(mult(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,plain,
rd(rd(mult(X1,mult(X2,X2)),X3),X2) = rd(X1,rd(X3,X2)),
inference(spm,[status(thm)],[c_0_5,c_0_16]) ).
cnf(c_0_19,plain,
mult(rd(X1,rd(X2,X1)),X3) = rd(mult(X1,mult(X3,X1)),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_17]),c_0_18]) ).
cnf(c_0_20,negated_conjecture,
mult(a,mult(b,c)) != mult(mult(rd(a,a),b),mult(a,c)),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_21,plain,
mult(rd(X1,mult(X2,X3)),mult(X2,X2)) = mult(rd(X1,mult(X3,X3)),mult(X3,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_22,plain,
rd(mult(X1,mult(X2,X1)),mult(X3,X1)) = mult(rd(X1,X3),X2),
inference(spm,[status(thm)],[c_0_19,c_0_5]) ).
cnf(c_0_23,negated_conjecture,
mult(a,mult(b,c)) != mult(mult(rd(a,a),b),mult(a,c)),
c_0_20 ).
cnf(c_0_24,plain,
mult(mult(rd(X1,X1),X2),mult(X1,X3)) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_12]),c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP751-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n016.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Sun Sep 20 20:42:52 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.54 Running first-order theorem proving
% 0.25/0.55 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
% 1.49/1.01 % Version: 3.5.1
% 1.49/1.01 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.49/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.49/1.01 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.49/1.01 % Starting new_bool_3 with 300s (1) cores
% 1.49/1.01 % Starting new_bool_1 with 300s (1) cores
% 1.49/1.01 % Starting sh5l with 300s (1) cores
% 1.49/1.01 % new_bool_1 with pid 771274 completed with status 0
% 1.49/1.01 % Result found by new_bool_1
% 1.49/1.01 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.49/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.49/1.01 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.49/1.01 % Starting new_bool_3 with 300s (1) cores
% 1.49/1.01 % Starting new_bool_1 with 300s (1) cores
% 1.49/1.01 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.49/1.01 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.49/1.01 % Search class: FUUPM-FFSF22-MFFFFFNN
% 1.49/1.01 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 1.49/1.01 % Starting SubtermCWHack with 28s (1) cores
% 1.49/1.01 % SubtermCWHack with pid 771278 completed with status 0
% 1.49/1.01 % Result found by SubtermCWHack
% 1.49/1.01 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.49/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.49/1.01 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.49/1.01 % Starting new_bool_3 with 300s (1) cores
% 1.49/1.01 % Starting new_bool_1 with 300s (1) cores
% 1.49/1.01 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.49/1.01 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.49/1.01 % Search class: FUUPM-FFSF22-MFFFFFNN
% 1.49/1.01 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 1.49/1.01 % Starting SubtermCWHack with 28s (1) cores
% 1.49/1.01 % Preprocessing time : 0.002 s
% 1.49/1.01
% 1.49/1.01 % Proof found!
% 1.49/1.01 % SZS status Unsatisfiable
% 1.49/1.01 % SZS output start CNFRefutation
% See solution above
% 1.49/1.01 % Parsed axioms : 8
% 1.49/1.01 % Removed by relevancy pruning/SinE : 2
% 1.49/1.01 % Initial clauses : 6
% 1.49/1.01 % Removed in clause preprocessing : 0
% 1.49/1.01 % Initial clauses in saturation : 6
% 1.49/1.01 % Processed clauses : 310
% 1.49/1.01 % ...of these trivial : 29
% 1.49/1.01 % ...subsumed : 163
% 1.49/1.01 % ...remaining for further processing : 118
% 1.49/1.01 % Other redundant clauses eliminated : 0
% 1.49/1.01 % Clauses deleted for lack of memory : 0
% 1.49/1.01 % Backward-subsumed : 0
% 1.49/1.01 % Backward-rewritten : 13
% 1.49/1.01 % Generated clauses : 33870
% 1.49/1.01 % ...of the previous two non-redundant : 31594
% 1.49/1.01 % ...aggressively subsumed : 0
% 1.49/1.01 % Contextual simplify-reflections : 0
% 1.49/1.01 % Paramodulations : 33870
% 1.49/1.01 % Factorizations : 0
% 1.49/1.01 % NegExts : 0
% 1.49/1.01 % Equation resolutions : 0
% 1.49/1.01 % Disequality decompositions : 0
% 1.49/1.01 % Total rewrite steps : 12057
% 1.49/1.01 % ...of those cached : 9960
% 1.49/1.01 % Propositional unsat checks : 0
% 1.49/1.01 % Propositional check models : 0
% 1.49/1.01 % Propositional check unsatisfiable : 0
% 1.49/1.01 % Propositional clauses : 0
% 1.49/1.01 % Propositional clauses after purity: 0
% 1.49/1.01 % Propositional unsat core size : 0
% 1.49/1.01 % Propositional preprocessing time : 0.000
% 1.49/1.01 % Propositional encoding time : 0.000
% 1.49/1.01 % Propositional solver time : 0.000
% 1.49/1.01 % Success case prop preproc time : 0.000
% 1.49/1.01 % Success case prop encoding time : 0.000
% 1.49/1.01 % Success case prop solver time : 0.000
% 1.49/1.01 % Current number of processed clauses : 105
% 1.49/1.01 % Positive orientable unit clauses : 66
% 1.49/1.01 % Positive unorientable unit clauses: 39
% 1.49/1.01 % Negative unit clauses : 0
% 1.49/1.01 % Non-unit-clauses : 0
% 1.49/1.01 % Current number of unprocessed clauses: 31282
% 1.49/1.01 % ...number of literals in the above : 31282
% 1.49/1.01 % Current number of archived formulas : 0
% 1.49/1.01 % Current number of archived clauses : 13
% 1.49/1.01 % Clause-clause subsumption calls (NU) : 0
% 1.49/1.01 % Rec. Clause-clause subsumption calls : 0
% 1.49/1.01 % Non-unit clause-clause subsumptions : 0
% 1.49/1.01 % Unit Clause-clause subsumption calls : 257
% 1.49/1.01 % Rewrite failures with RHS unbound : 0
% 1.49/1.01 % BW rewrite match attempts : 548
% 1.49/1.01 % BW rewrite match successes : 21
% 1.49/1.01 % Condensation attempts : 0
% 1.49/1.01 % Condensation successes : 0
% 1.49/1.01 % Termbank termtop insertions : 647440
% 1.49/1.01 % Search garbage collected termcells : 7
% 1.49/1.01
% 1.49/1.01 % -------------------------------------------------
% 1.49/1.01 % User time : 0.369 s
% 1.49/1.01 % System time : 0.024 s
% 1.49/1.01 % Total time : 0.393 s
% 1.49/1.01 % Maximum resident set size: 3632 pages
% 1.49/1.01
% 1.49/1.01 % -------------------------------------------------
% 1.49/1.01 % User time : 0.372 s
% 1.49/1.01 % System time : 0.030 s
% 1.49/1.01 % Total time : 0.402 s
% 1.49/1.01 % Maximum resident set size: 4608 pages
% 1.49/1.01 % E exiting
%------------------------------------------------------------------------------