%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN116-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:23:10 PM UTC 2026
% Result : Unsatisfiable 0.06s 0.35s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 14 RR)
% Number of literals : 34 ( 33 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 : 14 ( 14 usr; 3 con; 0-4 aty)
% Number of variables : 39 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_085,axiom,
ifeq(p0(X1,X2),true,p1(X2,X2,X2),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_085) ).
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_137,axiom,
ifeq(p1(X1,X2,X3),true,n2(X3),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_137) ).
cnf(rule_244,axiom,
ifeq(n2(X1),true,p3(X1,X1,X1),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_244) ).
cnf(rule_057,axiom,
ifeq(r0(X1),true,n1(X1,X1,X1),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_057) ).
cnf(axiom_9,axiom,
r0(b) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
cnf(rule_299,axiom,
ifeq(p3(X1,X2,X3),true,ifeq(l1(X4,X2),true,s4(X4),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_299) ).
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_301,axiom,
ifeq(s4(e),true,ifeq(n1(b,b,b),true,k5(b),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_301) ).
cnf(prove_this,negated_conjecture,
k5(b) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_12,axiom,
ifeq(p0(X1,X2),true,p1(X2,X2,X2),true) = true,
rule_085 ).
cnf(c_0_13,axiom,
p0(b,X1) = true,
axiom_14 ).
cnf(c_0_14,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_15,axiom,
ifeq(p1(X1,X2,X3),true,n2(X3),true) = true,
rule_137 ).
cnf(c_0_16,plain,
p1(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,axiom,
ifeq(n2(X1),true,p3(X1,X1,X1),true) = true,
rule_244 ).
cnf(c_0_18,plain,
n2(X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14]) ).
cnf(c_0_19,axiom,
ifeq(r0(X1),true,n1(X1,X1,X1),true) = true,
rule_057 ).
cnf(c_0_20,axiom,
r0(b) = true,
axiom_9 ).
cnf(c_0_21,axiom,
ifeq(p3(X1,X2,X3),true,ifeq(l1(X4,X2),true,s4(X4),true),true) = true,
rule_299 ).
cnf(c_0_22,plain,
p3(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_14]) ).
cnf(c_0_23,axiom,
ifeq(n0(X1,X2),true,l1(X2,X2),true) = true,
rule_002 ).
cnf(c_0_24,axiom,
n0(e,e) = true,
axiom_30 ).
cnf(c_0_25,axiom,
ifeq(s4(e),true,ifeq(n1(b,b,b),true,k5(b),true),true) = true,
rule_301 ).
cnf(c_0_26,plain,
n1(b,b,b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_14]) ).
cnf(c_0_27,plain,
ifeq(l1(X1,X2),true,s4(X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_14]) ).
cnf(c_0_28,plain,
l1(e,e) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_14]) ).
cnf(c_0_29,negated_conjecture,
k5(b) != true,
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_30,plain,
ifeq(s4(e),true,k5(b),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_14]) ).
cnf(c_0_31,plain,
s4(e) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_14]) ).
cnf(c_0_32,negated_conjecture,
k5(b) != true,
c_0_29 ).
cnf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_14]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN116-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Mon Sep 21 10:43:51 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.32 Running first-order theorem proving
% 0.06/0.32 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.06/0.35 % Version: 3.5.1
% 0.06/0.35 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.06/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.35 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.06/0.35 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.35 % Starting new_bool_1 with 300s (1) cores
% 0.06/0.35 % Starting sh5l with 300s (1) cores
% 0.06/0.35 % sh5l with pid 2187210 completed with status 0
% 0.06/0.35 % Result found by sh5l
% 0.06/0.35 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.06/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.35 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.06/0.35 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.35 % Starting new_bool_1 with 300s (1) cores
% 0.06/0.35 % Starting sh5l with 300s (1) cores
% 0.06/0.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.06/0.35 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.06/0.35 % Search class: FUUPM-FFLM31-MFFFFFNN
% 0.06/0.35 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.35 % Starting SubtermCWHack with 31s (1) cores
% 0.06/0.35 % SubtermCWHack with pid 2187218 completed with status 0
% 0.06/0.35 % Result found by SubtermCWHack
% 0.06/0.35 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.06/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.35 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.06/0.35 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.35 % Starting new_bool_1 with 300s (1) cores
% 0.06/0.35 % Starting sh5l with 300s (1) cores
% 0.06/0.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.06/0.35 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.06/0.35 % Search class: FUUPM-FFLM31-MFFFFFNN
% 0.06/0.35 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.35 % Starting SubtermCWHack with 31s (1) cores
% 0.06/0.35 % Preprocessing time : 0.003 s
% 0.06/0.35
% 0.06/0.35 % Proof found!
% 0.06/0.35 % SZS status Unsatisfiable
% 0.06/0.35 % SZS output start CNFRefutation
% See solution above
% 0.06/0.35 % Parsed axioms : 363
% 0.06/0.35 % Removed by relevancy pruning/SinE : 0
% 0.06/0.35 % Initial clauses : 363
% 0.06/0.35 % Removed in clause preprocessing : 0
% 0.06/0.35 % Initial clauses in saturation : 363
% 0.06/0.35 % Processed clauses : 458
% 0.06/0.35 % ...of these trivial : 44
% 0.06/0.35 % ...subsumed : 0
% 0.06/0.35 % ...remaining for further processing : 414
% 0.06/0.35 % Other redundant clauses eliminated : 0
% 0.06/0.35 % Clauses deleted for lack of memory : 0
% 0.06/0.35 % Backward-subsumed : 0
% 0.06/0.35 % Backward-rewritten : 222
% 0.06/0.35 % Generated clauses : 718
% 0.06/0.35 % ...of the previous two non-redundant : 348
% 0.06/0.35 % ...aggressively subsumed : 0
% 0.06/0.35 % Contextual simplify-reflections : 0
% 0.06/0.35 % Paramodulations : 718
% 0.06/0.35 % Factorizations : 0
% 0.06/0.35 % NegExts : 0
% 0.06/0.35 % Equation resolutions : 0
% 0.06/0.35 % Disequality decompositions : 0
% 0.06/0.35 % Total rewrite steps : 1199
% 0.06/0.35 % ...of those cached : 649
% 0.06/0.35 % Propositional unsat checks : 0
% 0.06/0.35 % Propositional check models : 0
% 0.06/0.35 % Propositional check unsatisfiable : 0
% 0.06/0.35 % Propositional clauses : 0
% 0.06/0.35 % Propositional clauses after purity: 0
% 0.06/0.35 % Propositional unsat core size : 0
% 0.06/0.35 % Propositional preprocessing time : 0.000
% 0.06/0.35 % Propositional encoding time : 0.000
% 0.06/0.35 % Propositional solver time : 0.000
% 0.06/0.35 % Success case prop preproc time : 0.000
% 0.06/0.35 % Success case prop encoding time : 0.000
% 0.06/0.35 % Success case prop solver time : 0.000
% 0.06/0.35 % Current number of processed clauses : 192
% 0.06/0.35 % Positive orientable unit clauses : 191
% 0.06/0.35 % Positive unorientable unit clauses: 0
% 0.06/0.35 % Negative unit clauses : 1
% 0.06/0.35 % Non-unit-clauses : 0
% 0.06/0.35 % Current number of unprocessed clauses: 221
% 0.06/0.35 % ...number of literals in the above : 221
% 0.06/0.35 % Current number of archived formulas : 0
% 0.06/0.35 % Current number of archived clauses : 222
% 0.06/0.35 % Clause-clause subsumption calls (NU) : 0
% 0.06/0.35 % Rec. Clause-clause subsumption calls : 0
% 0.06/0.35 % Non-unit clause-clause subsumptions : 0
% 0.06/0.35 % Unit Clause-clause subsumption calls : 0
% 0.06/0.35 % Rewrite failures with RHS unbound : 0
% 0.06/0.35 % BW rewrite match attempts : 606
% 0.06/0.35 % BW rewrite match successes : 206
% 0.06/0.35 % Condensation attempts : 0
% 0.06/0.35 % Condensation successes : 0
% 0.06/0.35 % Termbank termtop insertions : 17240
% 0.06/0.35 % Search garbage collected termcells : 2
% 0.06/0.35
% 0.06/0.35 % -------------------------------------------------
% 0.06/0.35 % User time : 0.014 s
% 0.06/0.35 % System time : 0.003 s
% 0.06/0.35 % Total time : 0.016 s
% 0.06/0.35 % Maximum resident set size: 4188 pages
% 0.06/0.35
% 0.06/0.35 % -------------------------------------------------
% 0.06/0.35 % User time : 0.017 s
% 0.06/0.35 % System time : 0.005 s
% 0.06/0.35 % Total time : 0.023 s
% 0.06/0.35 % Maximum resident set size: 5120 pages
% 0.06/0.35 % E exiting
%------------------------------------------------------------------------------