%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP720-2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 : Unsatisfiable 115.09s 29.35s
% Output : CNFRefutation 115.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of clauses : 53 ( 53 unt; 0 nHn; 11 RR)
% Number of literals : 53 ( 52 equ; 10 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 105 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c04,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c04) ).
cnf(c05,axiom,
mult(X1,X2) = mult(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).
cnf(c06,axiom,
ld(mult(X1,X2),mult(X1,mult(X2,mult(X3,X4)))) = mult(ld(mult(X1,X2),mult(X1,mult(X2,X3))),ld(mult(X1,X2),mult(X1,mult(X2,X4)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).
cnf(c03,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03) ).
cnf(c01,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).
cnf(c02,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
cnf(c08,axiom,
mult(mult(op_a,op_a),mult(op_b,op_b)) != mult(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c08) ).
cnf(c_0_7,axiom,
ld(X1,mult(X1,X2)) = X2,
c04 ).
cnf(c_0_8,axiom,
mult(X1,X2) = mult(X2,X1),
c05 ).
cnf(c_0_9,axiom,
ld(mult(X1,X2),mult(X1,mult(X2,mult(X3,X4)))) = mult(ld(mult(X1,X2),mult(X1,mult(X2,X3))),ld(mult(X1,X2),mult(X1,mult(X2,X4)))),
c06 ).
cnf(c_0_10,plain,
ld(X1,mult(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
ld(mult(X1,X1),mult(X1,mult(X1,mult(X1,X2)))) = mult(X1,ld(mult(X1,X1),mult(X1,mult(X1,X2)))),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
mult(X1,ld(X1,X2)) = X2,
c03 ).
cnf(c_0_13,axiom,
mult(X1,unit) = X1,
c01 ).
cnf(c_0_14,plain,
ld(mult(X1,X1),mult(X1,mult(X1,X2))) = mult(X1,ld(mult(X1,X1),mult(X1,X2))),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_16,plain,
mult(X1,ld(mult(X1,X1),X1)) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_13]),c_0_15]) ).
cnf(c_0_17,plain,
ld(ld(X1,X2),X2) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_18,plain,
ld(mult(X1,X1),X1) = ld(X1,unit),
inference(spm,[status(thm)],[c_0_7,c_0_16]) ).
cnf(c_0_19,plain,
ld(ld(X1,unit),X1) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,axiom,
mult(unit,X1) = X1,
c02 ).
cnf(c_0_21,plain,
mult(ld(mult(X1,X2),mult(X1,mult(X2,X3))),ld(mult(X1,X2),mult(X1,X4))) = ld(mult(X1,X2),mult(X1,mult(X2,mult(X3,ld(X2,X4))))),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_22,plain,
mult(ld(X1,unit),mult(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_23,plain,
ld(unit,X1) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_24,plain,
mult(ld(X1,unit),mult(X1,X2)) = mult(X1,mult(ld(X1,unit),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_8]),c_0_12]),c_0_23]),c_0_8]),c_0_12]),c_0_23]),c_0_8]),c_0_12]),c_0_12]),c_0_23]) ).
cnf(c_0_25,plain,
mult(mult(op_a,op_a),mult(op_b,op_b)) != mult(X1,X1),
inference(fof_simplification,[status(thm)],[c08]) ).
cnf(c_0_26,plain,
ld(ld(mult(X1,X2),mult(X1,mult(X2,X3))),ld(mult(X1,X2),mult(X1,mult(X2,mult(X3,X4))))) = ld(mult(X1,X2),mult(X1,mult(X2,X4))),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_27,plain,
ld(mult(X1,X2),mult(X1,mult(X2,mult(X3,X1)))) = mult(X1,ld(mult(X1,X2),mult(X1,mult(X2,X3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_10]),c_0_10]),c_0_8]) ).
cnf(c_0_28,plain,
ld(X1,mult(X2,mult(ld(X2,X1),mult(X3,ld(ld(X2,X1),X4))))) = mult(ld(X1,mult(X2,mult(ld(X2,X1),X3))),ld(X1,mult(X2,X4))),
inference(spm,[status(thm)],[c_0_21,c_0_12]) ).
cnf(c_0_29,plain,
mult(ld(X1,unit),ld(X1,unit)) = ld(X1,ld(X1,unit)),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_30,plain,
mult(X1,mult(ld(X1,unit),ld(X1,X2))) = mult(ld(X1,unit),X2),
inference(spm,[status(thm)],[c_0_24,c_0_12]) ).
cnf(c_0_31,plain,
mult(mult(op_a,op_a),mult(op_b,op_b)) != mult(X1,X1),
c_0_25 ).
cnf(c_0_32,plain,
ld(ld(mult(X1,X2),mult(X1,mult(X2,X3))),ld(mult(X1,X2),mult(X1,mult(X2,X4)))) = ld(mult(X1,X2),mult(X1,mult(X2,ld(X3,X4)))),
inference(spm,[status(thm)],[c_0_26,c_0_12]) ).
cnf(c_0_33,plain,
ld(mult(X1,X2),mult(X1,mult(X2,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_20]),c_0_13]),c_0_15]),c_0_13]) ).
cnf(c_0_34,plain,
ld(X1,mult(X2,ld(ld(X2,X1),unit))) = mult(ld(X1,X2),ld(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_12]),c_0_12]),c_0_13]),c_0_13]) ).
cnf(c_0_35,plain,
ld(X1,mult(ld(X1,unit),X2)) = mult(ld(X1,unit),ld(X1,X2)),
inference(spm,[status(thm)],[c_0_7,c_0_30]) ).
cnf(c_0_36,plain,
ld(mult(X1,X2),mult(X1,mult(X2,mult(X3,X3)))) != mult(mult(op_a,op_a),mult(op_b,op_b)),
inference(spm,[status(thm)],[c_0_31,c_0_9]) ).
cnf(c_0_37,plain,
ld(ld(mult(X1,X2),mult(X1,mult(X2,X3))),X1) = ld(mult(X1,X2),mult(X1,mult(X2,ld(X3,X1)))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
mult(X1,mult(ld(X1,X2),ld(X1,X2))) = mult(X2,ld(ld(X2,X1),unit)),
inference(spm,[status(thm)],[c_0_12,c_0_34]) ).
cnf(c_0_39,plain,
ld(ld(X1,unit),mult(X1,X2)) = mult(X1,ld(ld(X1,unit),X2)),
inference(spm,[status(thm)],[c_0_35,c_0_17]) ).
cnf(c_0_40,plain,
mult(X1,mult(ld(X1,unit),mult(X2,X2))) != mult(mult(op_a,op_a),mult(op_b,op_b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_24]),c_0_8]),c_0_12]),c_0_23]) ).
cnf(c_0_41,plain,
ld(ld(ld(X1,X2),unit),X2) = ld(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_12]),c_0_7]),c_0_12]),c_0_12]) ).
cnf(c_0_42,plain,
mult(X1,ld(ld(X1,unit),ld(X1,X2))) = ld(ld(X1,unit),X2),
inference(spm,[status(thm)],[c_0_39,c_0_12]) ).
cnf(c_0_43,plain,
mult(X1,mult(X2,ld(ld(X2,ld(X1,unit)),unit))) != mult(mult(op_a,op_a),mult(op_b,op_b)),
inference(spm,[status(thm)],[c_0_40,c_0_38]) ).
cnf(c_0_44,plain,
ld(ld(X1,mult(X2,X2)),X2) = ld(ld(X1,X2),unit),
inference(spm,[status(thm)],[c_0_17,c_0_41]) ).
cnf(c_0_45,plain,
ld(ld(X1,unit),ld(X1,X2)) = ld(X1,ld(ld(X1,unit),X2)),
inference(spm,[status(thm)],[c_0_7,c_0_42]) ).
cnf(c_0_46,plain,
mult(ld(X1,unit),mult(X2,ld(ld(X2,X1),unit))) != mult(mult(op_a,op_a),mult(op_b,op_b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_13]),c_0_17]) ).
cnf(c_0_47,plain,
ld(ld(X1,ld(ld(X1,unit),X2)),ld(X1,X2)) = ld(X1,unit),
inference(spm,[status(thm)],[c_0_17,c_0_45]) ).
cnf(c_0_48,plain,
mult(ld(ld(X1,X2),unit),ld(ld(X1,unit),X2)) != mult(mult(op_a,op_a),mult(op_b,op_b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_17]),c_0_8]),c_0_12]) ).
cnf(c_0_49,plain,
mult(X1,ld(ld(X1,mult(X2,X2)),unit)) != mult(mult(op_a,op_a),mult(op_b,op_b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_41]),c_0_17]),c_0_17]),c_0_8]) ).
cnf(c_0_50,plain,
mult(mult(X1,X2),ld(ld(mult(X1,X2),X1),unit)) = mult(X1,mult(X2,X2)),
inference(spm,[status(thm)],[c_0_38,c_0_7]) ).
cnf(c_0_51,plain,
mult(mult(X1,X1),mult(X2,X2)) != mult(mult(op_a,op_a),mult(op_b,op_b)),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_52,plain,
$false,
inference(er,[status(thm)],[c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP720-2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n017.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 20:30:57 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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
% 115.09/29.35 % Version: 3.5.1
% 115.09/29.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 115.09/29.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 115.09/29.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 115.09/29.35 % Starting new_bool_3 with 300s (1) cores
% 115.09/29.35 % Starting new_bool_1 with 300s (1) cores
% 115.09/29.35 % Starting sh5l with 300s (1) cores
% 115.09/29.35 % new_bool_1 with pid 591697 completed with status 9
% 115.09/29.35 % sh5l with pid 591698 completed with status 9
% 115.09/29.35 % new_bool_3 with pid 591696 completed with status 9
% 115.09/29.35 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 591695 completed with status 0
% 115.09/29.35 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 115.09/29.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 115.09/29.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 115.09/29.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 115.09/29.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 115.09/29.35 % No SInE strategy applied
% 115.09/29.35 % Search class: FUUPM-FFSF22-MFFFFFNN
% 115.09/29.35 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 115.09/29.35 % Starting SubtermCWHack with 136s (1) cores
% 115.09/29.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 115.09/29.35 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 115.09/29.35 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 115.09/29.35 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 115.09/29.35 % E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 591704 completed with status 0
% 115.09/29.35 % Result found by E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 115.09/29.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 115.09/29.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 115.09/29.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 115.09/29.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 115.09/29.35 % No SInE strategy applied
% 115.09/29.35 % Search class: FUUPM-FFSF22-MFFFFFNN
% 115.09/29.35 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 115.09/29.35 % Starting SubtermCWHack with 136s (1) cores
% 115.09/29.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 115.09/29.35 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 115.09/29.35 % Preprocessing time : 0.001 s
% 115.09/29.35 % Presaturation interreduction done
% 115.09/29.35
% 115.09/29.35 % Proof found!
% 115.09/29.35 % SZS status Unsatisfiable
% 115.09/29.35 % SZS output start CNFRefutation
% See solution above
% 115.09/29.35 % Parsed axioms : 8
% 115.09/29.35 % Removed by relevancy pruning/SinE : 0
% 115.09/29.35 % Initial clauses : 8
% 115.09/29.35 % Removed in clause preprocessing : 0
% 115.09/29.35 % Initial clauses in saturation : 8
% 115.09/29.35 % Processed clauses : 10740
% 115.09/29.35 % ...of these trivial : 645
% 115.09/29.35 % ...subsumed : 9462
% 115.09/29.35 % ...remaining for further processing : 633
% 115.09/29.35 % Other redundant clauses eliminated : 0
% 115.09/29.35 % Clauses deleted for lack of memory : 0
% 115.09/29.35 % Backward-subsumed : 2
% 115.09/29.35 % Backward-rewritten : 100
% 115.09/29.35 % Generated clauses : 240267
% 115.09/29.35 % ...of the previous two non-redundant : 221634
% 115.09/29.35 % ...aggressively subsumed : 0
% 115.09/29.35 % Contextual simplify-reflections : 0
% 115.09/29.35 % Paramodulations : 240266
% 115.09/29.35 % Factorizations : 0
% 115.09/29.35 % NegExts : 0
% 115.09/29.35 % Equation resolutions : 1
% 115.09/29.35 % Disequality decompositions : 0
% 115.09/29.35 % Total rewrite steps : 1303255
% 115.09/29.35 % ...of those cached : 1279461
% 115.09/29.35 % Propositional unsat checks : 0
% 115.09/29.35 % Propositional check models : 0
% 115.09/29.35 % Propositional check unsatisfiable : 0
% 115.09/29.35 % Propositional clauses : 0
% 115.09/29.35 % Propositional clauses after purity: 0
% 115.09/29.35 % Propositional unsat core size : 0
% 115.09/29.35 % Propositional preprocessing time : 0.000
% 115.09/29.35 % Propositional encoding time : 0.000
% 115.09/29.35 % Propositional solver time : 0.000
% 115.09/29.35 % Success case prop preproc time : 0.000
% 115.09/29.35 % Success case prop encoding time : 0.000
% 115.09/29.35 % Success case prop solver time : 0.000
% 115.09/29.35 % Current number of processed clauses : 523
% 115.09/29.35 % Positive orientable unit clauses : 311
% 115.09/29.35 % Positive unorientable unit clauses: 5
% 115.09/29.35 % Negative unit clauses : 207
% 115.09/29.35 % Non-unit-clauses : 0
% 115.09/29.35 % Current number of unprocessed clauses: 209746
% 115.09/29.35 % ...number of literals in the above : 209746
% 115.09/29.35 % Current number of archived formulas : 0
% 115.09/29.35 % Current number of archived clauses : 110
% 115.09/29.35 % Clause-clause subsumption calls (NU) : 0
% 115.09/29.35 % Rec. Clause-clause subsumption calls : 0
% 115.09/29.35 % Non-unit clause-clause subsumptions : 0
% 115.09/29.35 % Unit Clause-clause subsumption calls : 12996
% 115.09/29.35 % Rewrite failures with RHS unbound : 0
% 115.09/29.35 % BW rewrite match attempts : 6260
% 115.09/29.35 % BW rewrite match successes : 134
% 115.09/29.35 % Condensation attempts : 0
% 115.09/29.35 % Condensation successes : 0
% 115.09/29.35 % Termbank termtop insertions : 53978507
% 115.09/29.35 % Search garbage collected termcells : 2
% 115.09/29.35
% 115.09/29.35 % -------------------------------------------------
% 115.09/29.35 % User time : 28.202 s
% 115.09/29.35 % System time : 0.419 s
% 115.09/29.35 % Total time : 28.621 s
% 115.09/29.35 % Maximum resident set size: 3636 pages
% 115.09/29.35
% 115.09/29.35 % -------------------------------------------------
% 115.09/29.35 % User time : 141.328 s
% 115.09/29.35 % System time : 2.552 s
% 115.09/29.35 % Total time : 143.879 s
% 115.09/29.35 % Maximum resident set size: 4608 pages
% 115.09/29.35 % E exiting
%------------------------------------------------------------------------------