%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : RNG039-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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 02:06:08 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 53 ( 41 unt; 0 nHn; 33 RR)
% Number of literals : 71 ( 29 equ; 23 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 59 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause44,axiom,
product(a,multiply(b,X1),multiply(X2,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause44) ).
cnf(clause35,axiom,
multiply(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause35) ).
cnf(multiplication_is_well_defined,axiom,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',multiplication_is_well_defined) ).
cnf(addition_is_well_defined,axiom,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',addition_is_well_defined) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',closure_of_multiplication) ).
cnf(a_times_b,negated_conjecture,
product(a,b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_times_b) ).
cnf(clause37,axiom,
multiply(b,a) = d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause37) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',additive_identity1) ).
cnf(absorbtion1,axiom,
sum(X1,add(X1,X2),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorbtion1) ).
cnf(clause68,axiom,
product(add(b,a),b,add(b,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause68) ).
cnf(clause34,axiom,
add(X1,X1) = additive_identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause34) ).
cnf(prove_c_equals_d,negated_conjecture,
c != d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c_equals_d) ).
cnf(clause71,axiom,
product(X1,X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause71) ).
cnf(clause69,axiom,
product(add(b,a),a,add(d,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause69) ).
cnf(c_0_14,axiom,
product(a,multiply(b,X1),multiply(X2,X1)),
clause44 ).
cnf(c_0_15,axiom,
multiply(X1,X1) = X1,
clause35 ).
cnf(c_0_16,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[multiplication_is_well_defined]) ).
cnf(c_0_17,plain,
product(a,multiply(b,X1),X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
c_0_16 ).
cnf(c_0_19,plain,
product(a,b,b),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_20,plain,
( ~ product(a,b,X1)
| X1 = b ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
product(a,b,multiply(X1,b)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[addition_is_well_defined]) ).
cnf(c_0_23,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_multiplication ).
cnf(c_0_24,plain,
multiply(X1,b) = b,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
product(a,b,c),
a_times_b ).
cnf(c_0_26,axiom,
multiply(b,a) = d,
clause37 ).
cnf(c_0_27,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
c_0_22 ).
cnf(c_0_28,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_29,plain,
product(X1,b,b),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( ~ product(a,b,X1)
| X1 = c ),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_31,plain,
product(a,d,d),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_26]),c_0_26]) ).
cnf(c_0_32,plain,
( ~ sum(additive_identity,X2,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,axiom,
sum(X1,add(X1,X2),X2),
absorbtion1 ).
cnf(c_0_34,plain,
( ~ product(X2,b,X1)
| X1 = b ),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_35,axiom,
product(add(b,a),b,add(b,c)),
clause68 ).
cnf(c_0_36,negated_conjecture,
c = b,
inference(spm,[status(thm)],[c_0_30,c_0_19]) ).
cnf(c_0_37,axiom,
add(X1,X1) = additive_identity,
clause34 ).
cnf(c_0_38,negated_conjecture,
c != d,
inference(fof_simplification,[status(thm)],[prove_c_equals_d]) ).
cnf(c_0_39,plain,
( ~ product(a,d,X1)
| X1 = d ),
inference(spm,[status(thm)],[c_0_18,c_0_31]) ).
cnf(c_0_40,plain,
product(a,d,a),
inference(spm,[status(thm)],[c_0_17,c_0_26]) ).
cnf(c_0_41,plain,
add(additive_identity,X1) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_42,plain,
additive_identity = b,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37]) ).
cnf(c_0_43,negated_conjecture,
c != d,
c_0_38 ).
cnf(c_0_44,plain,
d = a,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,axiom,
product(X1,X1,X1),
clause71 ).
cnf(c_0_46,axiom,
product(add(b,a),a,add(d,a)),
clause69 ).
cnf(c_0_47,plain,
add(b,X1) = X1,
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
c != a,
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
( ~ product(X2,X2,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_18,c_0_45]) ).
cnf(c_0_50,plain,
product(a,a,b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_44]),c_0_37]),c_0_42]) ).
cnf(c_0_51,negated_conjecture,
b != a,
inference(rw,[status(thm)],[c_0_48,c_0_36]) ).
cnf(c_0_52,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG039-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 % Computer : n014.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 04:14:50 UTC 2026
% 0.16/0.39 % CPUTime :
% 0.16/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 Running first-order theorem proving
% 0.16/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.16/0.46 % Version: 3.5.1
% 0.16/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 % Starting sh5l with 300s (1) cores
% 0.16/0.46 % sh5l with pid 3112618 completed with status 0
% 0.16/0.46 % Result found by sh5l
% 0.16/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 % Starting sh5l with 300s (1) cores
% 0.16/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.46 % Search class: FHUSM-FFMM21-SFFFFFNN
% 0.16/0.46 % partial match(1): FHUSM-FFMF21-SFFFFFNN
% 0.16/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.46 % SubtermCWHack with pid 3112625 completed with status 0
% 0.16/0.46 % Result found by SubtermCWHack
% 0.16/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 % Starting sh5l with 300s (1) cores
% 0.16/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.46 % Search class: FHUSM-FFMM21-SFFFFFNN
% 0.16/0.46 % partial match(1): FHUSM-FFMF21-SFFFFFNN
% 0.16/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.46 % Preprocessing time : 0.002 s
% 0.16/0.46
% 0.16/0.46 % Proof found!
% 0.16/0.46 % SZS status Unsatisfiable
% 0.16/0.46 % SZS output start CNFRefutation
% See solution above
% 0.16/0.46 % Parsed axioms : 60
% 0.16/0.46 % Removed by relevancy pruning/SinE : 0
% 0.16/0.46 % Initial clauses : 60
% 0.16/0.46 % Removed in clause preprocessing : 0
% 0.16/0.46 % Initial clauses in saturation : 60
% 0.16/0.46 % Processed clauses : 133
% 0.16/0.46 % ...of these trivial : 11
% 0.16/0.46 % ...subsumed : 6
% 0.16/0.46 % ...remaining for further processing : 116
% 0.16/0.46 % Other redundant clauses eliminated : 0
% 0.16/0.46 % Clauses deleted for lack of memory : 0
% 0.16/0.46 % Backward-subsumed : 1
% 0.16/0.46 % Backward-rewritten : 70
% 0.16/0.46 % Generated clauses : 390
% 0.16/0.46 % ...of the previous two non-redundant : 281
% 0.16/0.46 % ...aggressively subsumed : 0
% 0.16/0.46 % Contextual simplify-reflections : 0
% 0.16/0.46 % Paramodulations : 390
% 0.16/0.46 % Factorizations : 0
% 0.16/0.46 % NegExts : 0
% 0.16/0.46 % Equation resolutions : 0
% 0.16/0.46 % Disequality decompositions : 0
% 0.16/0.46 % Total rewrite steps : 395
% 0.16/0.46 % ...of those cached : 319
% 0.16/0.46 % Propositional unsat checks : 0
% 0.16/0.46 % Propositional check models : 0
% 0.16/0.46 % Propositional check unsatisfiable : 0
% 0.16/0.46 % Propositional clauses : 0
% 0.16/0.46 % Propositional clauses after purity: 0
% 0.16/0.46 % Propositional unsat core size : 0
% 0.16/0.46 % Propositional preprocessing time : 0.000
% 0.16/0.46 % Propositional encoding time : 0.000
% 0.16/0.46 % Propositional solver time : 0.000
% 0.16/0.46 % Success case prop preproc time : 0.000
% 0.16/0.46 % Success case prop encoding time : 0.000
% 0.16/0.46 % Success case prop solver time : 0.000
% 0.16/0.46 % Current number of processed clauses : 45
% 0.16/0.46 % Positive orientable unit clauses : 32
% 0.16/0.46 % Positive unorientable unit clauses: 0
% 0.16/0.46 % Negative unit clauses : 1
% 0.16/0.46 % Non-unit-clauses : 12
% 0.16/0.46 % Current number of unprocessed clauses: 195
% 0.16/0.46 % ...number of literals in the above : 547
% 0.16/0.46 % Current number of archived formulas : 0
% 0.16/0.46 % Current number of archived clauses : 71
% 0.16/0.46 % Clause-clause subsumption calls (NU) : 125
% 0.16/0.46 % Rec. Clause-clause subsumption calls : 86
% 0.16/0.46 % Non-unit clause-clause subsumptions : 7
% 0.16/0.46 % Unit Clause-clause subsumption calls : 10
% 0.16/0.46 % Rewrite failures with RHS unbound : 0
% 0.16/0.46 % BW rewrite match attempts : 136
% 0.16/0.46 % BW rewrite match successes : 18
% 0.16/0.46 % Condensation attempts : 0
% 0.16/0.46 % Condensation successes : 0
% 0.16/0.46 % Termbank termtop insertions : 4919
% 0.16/0.46 % Search garbage collected termcells : 61
% 0.16/0.46
% 0.16/0.46 % -------------------------------------------------
% 0.16/0.46 % User time : 0.009 s
% 0.16/0.46 % System time : 0.004 s
% 0.16/0.46 % Total time : 0.013 s
% 0.16/0.46 % Maximum resident set size: 3668 pages
% 0.16/0.46
% 0.16/0.46 % -------------------------------------------------
% 0.16/0.46 % User time : 0.011 s
% 0.16/0.46 % System time : 0.009 s
% 0.16/0.46 % Total time : 0.020 s
% 0.16/0.46 % Maximum resident set size: 4608 pages
% 0.16/0.46 % E exiting
%------------------------------------------------------------------------------