%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG128-1 : TPTP v9.3.1. Released v5.4.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:05:57 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.55s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of clauses : 36 ( 36 unt; 0 nHn; 6 RR)
% Number of literals : 36 ( 35 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 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 : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sos_006,axiom,
add(unit,add(X1,mult(X1,X1))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_006) ).
cnf(sos_004,axiom,
add(zero,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_004) ).
cnf(sos,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
cnf(sos_001,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_001) ).
cnf(sos_003,axiom,
mult(X1,add(X2,X3)) = add(mult(X1,X2),mult(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_003) ).
cnf(sos_005,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_005) ).
cnf(sos_002,axiom,
mult(X1,X2) = mult(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_002) ).
cnf(goals,negated_conjecture,
add(x0,x1) != mult(x0,x1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c_0_8,axiom,
add(unit,add(X1,mult(X1,X1))) = X1,
sos_006 ).
cnf(c_0_9,axiom,
add(zero,X1) = X1,
sos_004 ).
cnf(c_0_10,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
sos ).
cnf(c_0_11,plain,
add(unit,mult(zero,zero)) = zero,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
add(unit,add(mult(zero,zero),X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9]) ).
cnf(c_0_13,axiom,
add(X1,X2) = add(X2,X1),
sos_001 ).
cnf(c_0_14,plain,
add(unit,add(X1,mult(zero,zero))) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
mult(X1,add(X2,X3)) = add(mult(X1,X2),mult(X1,X3)),
sos_003 ).
cnf(c_0_16,plain,
add(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_17,plain,
add(unit,mult(zero,X1)) = mult(zero,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,axiom,
mult(X1,unit) = X1,
sos_005 ).
cnf(c_0_19,axiom,
mult(X1,X2) = mult(X2,X1),
sos_002 ).
cnf(c_0_20,plain,
zero = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16]) ).
cnf(c_0_21,plain,
mult(unit,X1) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
add(unit,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_20]),c_0_21]),c_0_20]),c_0_21]) ).
cnf(c_0_23,plain,
add(X1,unit) = X1,
inference(rw,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_24,plain,
add(X1,mult(X1,X1)) = X1,
inference(rw,[status(thm)],[c_0_8,c_0_22]) ).
cnf(c_0_25,plain,
add(X1,mult(X1,X2)) = mult(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_18]),c_0_13]),c_0_23]) ).
cnf(c_0_26,plain,
mult(X1,X1) = X1,
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
add(X1,add(X2,X3)) = add(X2,add(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_13]),c_0_10]) ).
cnf(c_0_28,plain,
add(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_29,negated_conjecture,
add(x0,x1) != mult(x0,x1),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_30,plain,
mult(X1,add(X2,X1)) = mult(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_26]),c_0_13]),c_0_25]) ).
cnf(c_0_31,plain,
add(X1,add(X1,X2)) = add(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_10]),c_0_28]) ).
cnf(c_0_32,plain,
mult(X1,add(X1,X2)) = mult(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_26]),c_0_25]) ).
cnf(c_0_33,negated_conjecture,
add(x0,x1) != mult(x0,x1),
c_0_29 ).
cnf(c_0_34,plain,
mult(X1,X2) = add(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_26]),c_0_19]),c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : RNG128-1 : TPTP v9.3.1. Released v5.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n014.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 04:22:19 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.52 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.24/0.55 % Version: 3.5.1
% 0.24/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.55 % Starting sh5l with 300s (1) cores
% 0.24/0.55 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3128045 completed with status 0
% 0.24/0.55 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.24/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.55 % No SInE strategy applied
% 0.24/0.55 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.24/0.55 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.24/0.55 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.24/0.55 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.24/0.55 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.24/0.55 % SubtermCWHack with pid 3128049 completed with status 0
% 0.24/0.55 % Result found by SubtermCWHack
% 0.24/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.55 % No SInE strategy applied
% 0.24/0.55 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.24/0.55 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.55 % Preprocessing time : 0.002 s
% 0.24/0.55
% 0.24/0.55 % Proof found!
% 0.24/0.55 % SZS status Unsatisfiable
% 0.24/0.55 % SZS output start CNFRefutation
% See solution above
% 0.24/0.55 % Parsed axioms : 8
% 0.24/0.55 % Removed by relevancy pruning/SinE : 0
% 0.24/0.55 % Initial clauses : 8
% 0.24/0.55 % Removed in clause preprocessing : 0
% 0.24/0.55 % Initial clauses in saturation : 8
% 0.24/0.55 % Processed clauses : 94
% 0.24/0.55 % ...of these trivial : 25
% 0.24/0.55 % ...subsumed : 35
% 0.24/0.55 % ...remaining for further processing : 34
% 0.24/0.55 % Other redundant clauses eliminated : 0
% 0.24/0.55 % Clauses deleted for lack of memory : 0
% 0.24/0.55 % Backward-subsumed : 0
% 0.24/0.55 % Backward-rewritten : 22
% 0.24/0.55 % Generated clauses : 410
% 0.24/0.55 % ...of the previous two non-redundant : 299
% 0.24/0.55 % ...aggressively subsumed : 0
% 0.24/0.55 % Contextual simplify-reflections : 0
% 0.24/0.55 % Paramodulations : 410
% 0.24/0.55 % Factorizations : 0
% 0.24/0.55 % NegExts : 0
% 0.24/0.55 % Equation resolutions : 0
% 0.24/0.55 % Disequality decompositions : 0
% 0.24/0.55 % Total rewrite steps : 387
% 0.24/0.55 % ...of those cached : 262
% 0.24/0.55 % Propositional unsat checks : 0
% 0.24/0.55 % Propositional check models : 0
% 0.24/0.55 % Propositional check unsatisfiable : 0
% 0.24/0.55 % Propositional clauses : 0
% 0.24/0.55 % Propositional clauses after purity: 0
% 0.24/0.55 % Propositional unsat core size : 0
% 0.24/0.55 % Propositional preprocessing time : 0.000
% 0.24/0.55 % Propositional encoding time : 0.000
% 0.24/0.55 % Propositional solver time : 0.000
% 0.24/0.55 % Success case prop preproc time : 0.000
% 0.24/0.55 % Success case prop encoding time : 0.000
% 0.24/0.55 % Success case prop solver time : 0.000
% 0.24/0.55 % Current number of processed clauses : 12
% 0.24/0.55 % Positive orientable unit clauses : 8
% 0.24/0.55 % Positive unorientable unit clauses: 4
% 0.24/0.55 % Negative unit clauses : 0
% 0.24/0.55 % Non-unit-clauses : 0
% 0.24/0.55 % Current number of unprocessed clauses: 193
% 0.24/0.55 % ...number of literals in the above : 193
% 0.24/0.55 % Current number of archived formulas : 0
% 0.24/0.55 % Current number of archived clauses : 22
% 0.24/0.55 % Clause-clause subsumption calls (NU) : 0
% 0.24/0.55 % Rec. Clause-clause subsumption calls : 0
% 0.24/0.55 % Non-unit clause-clause subsumptions : 0
% 0.24/0.55 % Unit Clause-clause subsumption calls : 6
% 0.24/0.55 % Rewrite failures with RHS unbound : 0
% 0.24/0.55 % BW rewrite match attempts : 84
% 0.24/0.55 % BW rewrite match successes : 45
% 0.24/0.55 % Condensation attempts : 0
% 0.24/0.55 % Condensation successes : 0
% 0.24/0.55 % Termbank termtop insertions : 2520
% 0.24/0.55 % Search garbage collected termcells : 2
% 0.24/0.55
% 0.24/0.55 % -------------------------------------------------
% 0.24/0.55 % User time : 0.011 s
% 0.24/0.55 % System time : 0.003 s
% 0.24/0.55 % Total time : 0.014 s
% 0.24/0.55 % Maximum resident set size: 3632 pages
% 0.24/0.55
% 0.24/0.55 % -------------------------------------------------
% 0.24/0.55 % User time : 0.045 s
% 0.24/0.55 % System time : 0.016 s
% 0.24/0.55 % Total time : 0.062 s
% 0.24/0.55 % Maximum resident set size: 4608 pages
% 0.24/0.55 % E exiting
%------------------------------------------------------------------------------