%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN193-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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 03:32:44 PM UTC 2026
% Result : Unsatisfiable 0.39s 0.53s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 35 ( 35 unt; 0 nHn; 11 RR)
% Number of literals : 35 ( 34 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 3 con; 0-4 aty)
% Number of variables : 55 ( 25 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_029,axiom,
ifeq(p0(X1,X2),true,ifeq(s0(X1),true,m1(X1,X2,X1),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_029) ).
cnf(axiom_5,axiom,
s0(b) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
cnf(axiom_14,axiom,
p0(b,X1) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_14) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(rule_176,axiom,
ifeq(m1(X1,X2,X1),true,p2(X2,X1,X2),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_176) ).
cnf(rule_240,axiom,
ifeq(p2(X1,X2,X3),true,n3(X3),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_240) ).
cnf(rule_002,axiom,
ifeq(n0(X1,X2),true,l1(X2,X2),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_002) ).
cnf(axiom_30,axiom,
n0(e,e) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_30) ).
cnf(rule_298,axiom,
ifeq(q3(X1,X2),true,ifeq(n3(X3),true,ifeq(p0(X4,X3),true,r4(X3),true),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_298) ).
cnf(rule_186,axiom,
ifeq(l1(X1,X2),true,q2(X2,X2,X1),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_186) ).
cnf(rule_255,axiom,
ifeq(q2(X1,X2,X3),true,ifeq(n0(X1,X2),true,q3(X2,X3),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_255) ).
cnf(prove_this,negated_conjecture,
r4(b) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_12,axiom,
ifeq(p0(X1,X2),true,ifeq(s0(X1),true,m1(X1,X2,X1),true),true) = true,
rule_029 ).
cnf(c_0_13,axiom,
s0(b) = true,
axiom_5 ).
cnf(c_0_14,axiom,
p0(b,X1) = true,
axiom_14 ).
cnf(c_0_15,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_16,axiom,
ifeq(m1(X1,X2,X1),true,p2(X2,X1,X2),true) = true,
rule_176 ).
cnf(c_0_17,plain,
m1(b,X1,b) = true,
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_15]) ).
cnf(c_0_18,axiom,
ifeq(p2(X1,X2,X3),true,n3(X3),true) = true,
rule_240 ).
cnf(c_0_19,plain,
p2(X1,b,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15]) ).
cnf(c_0_20,axiom,
ifeq(n0(X1,X2),true,l1(X2,X2),true) = true,
rule_002 ).
cnf(c_0_21,axiom,
n0(e,e) = true,
axiom_30 ).
cnf(c_0_22,axiom,
ifeq(q3(X1,X2),true,ifeq(n3(X3),true,ifeq(p0(X4,X3),true,r4(X3),true),true),true) = true,
rule_298 ).
cnf(c_0_23,plain,
n3(X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_15]) ).
cnf(c_0_24,axiom,
ifeq(l1(X1,X2),true,q2(X2,X2,X1),true) = true,
rule_186 ).
cnf(c_0_25,plain,
l1(e,e) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15]) ).
cnf(c_0_26,plain,
ifeq(q3(X1,X2),true,ifeq(p0(X3,X4),true,r4(X4),true),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_15]) ).
cnf(c_0_27,axiom,
ifeq(q2(X1,X2,X3),true,ifeq(n0(X1,X2),true,q3(X2,X3),true),true) = true,
rule_255 ).
cnf(c_0_28,plain,
q2(e,e,e) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15]) ).
cnf(c_0_29,negated_conjecture,
r4(b) != true,
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_30,plain,
ifeq(q3(X1,X2),true,r4(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_14]),c_0_15]) ).
cnf(c_0_31,plain,
q3(e,e) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_21]),c_0_15]),c_0_15]) ).
cnf(c_0_32,negated_conjecture,
r4(b) != true,
c_0_29 ).
cnf(c_0_33,plain,
r4(X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_15]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN193-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n009.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 10:45:27 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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.39/0.53 % Version: 3.5.1
% 0.39/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.39/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.39/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.39/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.39/0.53 % Starting sh5l with 300s (1) cores
% 0.39/0.53 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1548222 completed with status 0
% 0.39/0.53 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.39/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.39/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.39/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.39/0.53 % No SInE strategy applied
% 0.39/0.53 % Search class: FUUPM-FFLM31-MFFFFFNN
% 0.39/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.39/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.39/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.39/0.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.39/0.53 % Starting new_bool_3 with 136s (1) cores
% 0.39/0.53 % Starting new_bool_1 with 136s (1) cores
% 0.39/0.53 % new_bool_3 with pid 1548239 completed with status 0
% 0.39/0.53 % Result found by new_bool_3
% 0.39/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.39/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.39/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.39/0.53 % No SInE strategy applied
% 0.39/0.53 % Search class: FUUPM-FFLM31-MFFFFFNN
% 0.39/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.39/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.39/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.39/0.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.39/0.53 % Starting new_bool_3 with 136s (1) cores
% 0.39/0.53 % Preprocessing time : 0.003 s
% 0.39/0.53 % Presaturation interreduction done
% 0.39/0.53
% 0.39/0.53 % Proof found!
% 0.39/0.53 % SZS status Unsatisfiable
% 0.39/0.53 % SZS output start CNFRefutation
% See solution above
% 0.39/0.53 % Parsed axioms : 363
% 0.39/0.53 % Removed by relevancy pruning/SinE : 0
% 0.39/0.53 % Initial clauses : 363
% 0.39/0.53 % Removed in clause preprocessing : 0
% 0.39/0.53 % Initial clauses in saturation : 363
% 0.39/0.53 % Processed clauses : 1101
% 0.39/0.53 % ...of these trivial : 206
% 0.39/0.53 % ...subsumed : 0
% 0.39/0.53 % ...remaining for further processing : 895
% 0.39/0.53 % Other redundant clauses eliminated : 0
% 0.39/0.53 % Clauses deleted for lack of memory : 0
% 0.39/0.53 % Backward-subsumed : 0
% 0.39/0.53 % Backward-rewritten : 203
% 0.39/0.53 % Generated clauses : 2816
% 0.39/0.53 % ...of the previous two non-redundant : 2063
% 0.39/0.53 % ...aggressively subsumed : 0
% 0.39/0.53 % Contextual simplify-reflections : 0
% 0.39/0.53 % Paramodulations : 2816
% 0.39/0.53 % Factorizations : 0
% 0.39/0.53 % NegExts : 0
% 0.39/0.53 % Equation resolutions : 0
% 0.39/0.53 % Disequality decompositions : 0
% 0.39/0.53 % Total rewrite steps : 5093
% 0.39/0.53 % ...of those cached : 3589
% 0.39/0.53 % Propositional unsat checks : 0
% 0.39/0.53 % Propositional check models : 0
% 0.39/0.53 % Propositional check unsatisfiable : 0
% 0.39/0.53 % Propositional clauses : 0
% 0.39/0.53 % Propositional clauses after purity: 0
% 0.39/0.53 % Propositional unsat core size : 0
% 0.39/0.53 % Propositional preprocessing time : 0.000
% 0.39/0.53 % Propositional encoding time : 0.000
% 0.39/0.53 % Propositional solver time : 0.000
% 0.39/0.53 % Success case prop preproc time : 0.000
% 0.39/0.53 % Success case prop encoding time : 0.000
% 0.39/0.53 % Success case prop solver time : 0.000
% 0.39/0.53 % Current number of processed clauses : 347
% 0.39/0.53 % Positive orientable unit clauses : 347
% 0.39/0.53 % Positive unorientable unit clauses: 0
% 0.39/0.53 % Negative unit clauses : 0
% 0.39/0.53 % Non-unit-clauses : 0
% 0.39/0.53 % Current number of unprocessed clauses: 1475
% 0.39/0.53 % ...number of literals in the above : 1475
% 0.39/0.53 % Current number of archived formulas : 0
% 0.39/0.53 % Current number of archived clauses : 548
% 0.39/0.53 % Clause-clause subsumption calls (NU) : 0
% 0.39/0.53 % Rec. Clause-clause subsumption calls : 0
% 0.39/0.53 % Non-unit clause-clause subsumptions : 0
% 0.39/0.53 % Unit Clause-clause subsumption calls : 0
% 0.39/0.53 % Rewrite failures with RHS unbound : 0
% 0.39/0.53 % BW rewrite match attempts : 3258
% 0.39/0.53 % BW rewrite match successes : 165
% 0.39/0.53 % Condensation attempts : 0
% 0.39/0.53 % Condensation successes : 0
% 0.39/0.53 % Termbank termtop insertions : 57837
% 0.39/0.53 % Search garbage collected termcells : 2
% 0.39/0.53
% 0.39/0.53 % -------------------------------------------------
% 0.39/0.53 % User time : 0.077 s
% 0.39/0.53 % System time : 0.010 s
% 0.39/0.53 % Total time : 0.086 s
% 0.39/0.53 % Maximum resident set size: 4188 pages
% 0.39/0.53
% 0.39/0.53 % -------------------------------------------------
% 0.39/0.53 % User time : 0.267 s
% 0.39/0.53 % System time : 0.062 s
% 0.39/0.53 % Total time : 0.329 s
% 0.39/0.53 % Maximum resident set size: 5120 pages
% 0.39/0.53 % E exiting
%------------------------------------------------------------------------------