%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : RNG128-1 : TPTP v9.3.1. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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 02:06:30 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 6 RR)
% Number of literals : 31 ( 30 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sos_006,axiom,
add(unit,add(X1,mult(X1,X1))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_006) ).
cnf(sos,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
cnf(sos_004,axiom,
add(zero,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_004) ).
cnf(sos_001,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_001) ).
cnf(sos_003,axiom,
mult(X1,add(X2,X3)) = add(mult(X1,X2),mult(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_003) ).
cnf(sos_005,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_005) ).
cnf(goals,negated_conjecture,
add(x0,x1) != mult(x0,x1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(sos_002,axiom,
mult(X1,X2) = mult(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_002) ).
cnf(c_0_8,axiom,
add(unit,add(X1,mult(X1,X1))) = X1,
sos_006 ).
cnf(c_0_9,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
sos ).
cnf(c_0_10,axiom,
add(zero,X1) = X1,
sos_004 ).
cnf(c_0_11,axiom,
add(X1,X2) = add(X2,X1),
sos_001 ).
cnf(c_0_12,plain,
add(unit,add(X1,add(X2,mult(add(X1,X2),add(X1,X2))))) = add(X1,X2),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
add(unit,mult(zero,zero)) = zero,
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_14,axiom,
mult(X1,add(X2,X3)) = add(mult(X1,X2),mult(X1,X3)),
sos_003 ).
cnf(c_0_15,plain,
add(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
zero = unit,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_13]),c_0_15]) ).
cnf(c_0_17,plain,
add(unit,X1) = X1,
inference(rw,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_18,axiom,
mult(X1,unit) = X1,
sos_005 ).
cnf(c_0_19,plain,
add(X1,unit) = X1,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
add(X1,mult(X1,X1)) = X1,
inference(rw,[status(thm)],[c_0_8,c_0_17]) ).
cnf(c_0_21,plain,
add(X1,mult(X1,X2)) = mult(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_18]),c_0_11]),c_0_19]) ).
cnf(c_0_22,plain,
mult(X1,X1) = X1,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
add(x0,x1) != mult(x0,x1),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_24,plain,
mult(X1,add(X2,X1)) = mult(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_22]),c_0_11]),c_0_21]) ).
cnf(c_0_25,plain,
add(X1,add(mult(X1,X1),X2)) = add(X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_20]) ).
cnf(c_0_26,axiom,
mult(X1,X2) = mult(X2,X1),
sos_002 ).
cnf(c_0_27,plain,
mult(X1,add(X1,X2)) = mult(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_22]),c_0_21]) ).
cnf(c_0_28,negated_conjecture,
add(x0,x1) != mult(x0,x1),
c_0_23 ).
cnf(c_0_29,plain,
mult(X1,X2) = add(X1,X2),
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_24,c_0_25]),c_0_22]),c_0_22]),c_0_22]),c_0_26]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : RNG128-1 : TPTP v9.3.1. Released v5.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n017.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 04:17:41 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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.15/0.47 % Version: 3.5.1
% 0.15/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 % Starting sh5l with 300s (1) cores
% 0.15/0.47 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1410397 completed with status 0
% 0.15/0.47 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.47 % No SInE strategy applied
% 0.15/0.47 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.15/0.47 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.47 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.15/0.47 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.47 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.47 % E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 1410404 completed with status 0
% 0.15/0.47 % Result found by E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 0.15/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.47 % No SInE strategy applied
% 0.15/0.47 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.15/0.47 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.47 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.15/0.47 % Preprocessing time : 0.002 s
% 0.15/0.47 % Presaturation interreduction done
% 0.15/0.47
% 0.15/0.47 % Proof found!
% 0.15/0.47 % SZS status Unsatisfiable
% 0.15/0.47 % SZS output start CNFRefutation
% See solution above
% 0.15/0.47 % Parsed axioms : 8
% 0.15/0.47 % Removed by relevancy pruning/SinE : 0
% 0.15/0.47 % Initial clauses : 8
% 0.15/0.47 % Removed in clause preprocessing : 0
% 0.15/0.47 % Initial clauses in saturation : 8
% 0.15/0.47 % Processed clauses : 66
% 0.15/0.47 % ...of these trivial : 16
% 0.15/0.47 % ...subsumed : 10
% 0.15/0.47 % ...remaining for further processing : 40
% 0.15/0.47 % Other redundant clauses eliminated : 0
% 0.15/0.47 % Clauses deleted for lack of memory : 0
% 0.15/0.47 % Backward-subsumed : 0
% 0.15/0.47 % Backward-rewritten : 21
% 0.15/0.47 % Generated clauses : 309
% 0.15/0.47 % ...of the previous two non-redundant : 204
% 0.15/0.47 % ...aggressively subsumed : 0
% 0.15/0.47 % Contextual simplify-reflections : 0
% 0.15/0.47 % Paramodulations : 309
% 0.15/0.47 % Factorizations : 0
% 0.15/0.47 % NegExts : 0
% 0.15/0.47 % Equation resolutions : 0
% 0.15/0.47 % Disequality decompositions : 0
% 0.15/0.47 % Total rewrite steps : 397
% 0.15/0.47 % ...of those cached : 282
% 0.15/0.47 % Propositional unsat checks : 0
% 0.15/0.47 % Propositional check models : 0
% 0.15/0.47 % Propositional check unsatisfiable : 0
% 0.15/0.47 % Propositional clauses : 0
% 0.15/0.47 % Propositional clauses after purity: 0
% 0.15/0.47 % Propositional unsat core size : 0
% 0.15/0.47 % Propositional preprocessing time : 0.000
% 0.15/0.47 % Propositional encoding time : 0.000
% 0.15/0.47 % Propositional solver time : 0.000
% 0.15/0.47 % Success case prop preproc time : 0.000
% 0.15/0.47 % Success case prop encoding time : 0.000
% 0.15/0.47 % Success case prop solver time : 0.000
% 0.15/0.47 % Current number of processed clauses : 11
% 0.15/0.47 % Positive orientable unit clauses : 9
% 0.15/0.47 % Positive unorientable unit clauses: 2
% 0.15/0.47 % Negative unit clauses : 0
% 0.15/0.47 % Non-unit-clauses : 0
% 0.15/0.47 % Current number of unprocessed clauses: 140
% 0.15/0.47 % ...number of literals in the above : 140
% 0.15/0.47 % Current number of archived formulas : 0
% 0.15/0.47 % Current number of archived clauses : 29
% 0.15/0.47 % Clause-clause subsumption calls (NU) : 0
% 0.15/0.47 % Rec. Clause-clause subsumption calls : 0
% 0.15/0.47 % Non-unit clause-clause subsumptions : 0
% 0.15/0.47 % Unit Clause-clause subsumption calls : 4
% 0.15/0.47 % Rewrite failures with RHS unbound : 0
% 0.15/0.47 % BW rewrite match attempts : 111
% 0.15/0.47 % BW rewrite match successes : 60
% 0.15/0.47 % Condensation attempts : 0
% 0.15/0.47 % Condensation successes : 0
% 0.15/0.47 % Termbank termtop insertions : 2295
% 0.15/0.47 % Search garbage collected termcells : 2
% 0.15/0.47
% 0.15/0.47 % -------------------------------------------------
% 0.15/0.47 % User time : 0.009 s
% 0.15/0.47 % System time : 0.003 s
% 0.15/0.47 % Total time : 0.013 s
% 0.15/0.47 % Maximum resident set size: 3632 pages
% 0.15/0.47
% 0.15/0.47 % -------------------------------------------------
% 0.15/0.47 % User time : 0.029 s
% 0.15/0.47 % System time : 0.017 s
% 0.15/0.47 % Total time : 0.046 s
% 0.15/0.47 % Maximum resident set size: 4864 pages
% 0.15/0.47 % E exiting
%------------------------------------------------------------------------------