%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN116-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:34 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.44s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 50 ( 21 unt; 0 nHn; 45 RR)
% Number of literals : 88 ( 0 equ; 44 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 79 ( 36 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_021,axiom,
( ~ k0(X2)
| ~ l0(X1)
| m1(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_021) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
cnf(rule_176,axiom,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_176) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(rule_267,axiom,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_267) ).
cnf(rule_085,axiom,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_085) ).
cnf(rule_300,axiom,
( ~ r3(X3,X1,X1)
| ~ s4(X2)
| k5(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_300) ).
cnf(prove_this,negated_conjecture,
~ k5(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_137,axiom,
( ~ p1(X2,X3,X1)
| n2(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_299,axiom,
( ~ l1(X1,X3)
| ~ p3(X2,X3,X4)
| s4(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_299) ).
cnf(rule_244,axiom,
( ~ n2(X1)
| p3(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_244) ).
cnf(rule_002,axiom,
( ~ n0(X2,X1)
| l1(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_002) ).
cnf(axiom_34,axiom,
n0(c,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_34) ).
cnf(c_0_14,plain,
( ~ k0(X2)
| ~ l0(X1)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_021]) ).
cnf(c_0_15,plain,
( ~ k0(X2)
| ~ l0(X1)
| m1(X1,X2,X1) ),
c_0_14 ).
cnf(c_0_16,axiom,
k0(b),
axiom_32 ).
cnf(c_0_17,plain,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_176]) ).
cnf(c_0_18,plain,
( ~ l0(X1)
| m1(X1,b,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,axiom,
l0(c),
axiom_24 ).
cnf(c_0_20,plain,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_267]) ).
cnf(c_0_21,plain,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
c_0_17 ).
cnf(c_0_22,plain,
m1(c,b,c),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_24,plain,
( ~ r3(X3,X1,X1)
| ~ s4(X2)
| k5(X1) ),
inference(fof_simplification,[status(thm)],[rule_300]) ).
cnf(c_0_25,plain,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
c_0_20 ).
cnf(c_0_26,plain,
p2(b,c,b),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
~ k5(b),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_28,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_29,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_23 ).
cnf(c_0_30,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_31,plain,
( ~ l1(X1,X3)
| ~ p3(X2,X3,X4)
| s4(X1) ),
inference(fof_simplification,[status(thm)],[rule_299]) ).
cnf(c_0_32,plain,
( ~ r3(X3,X1,X1)
| ~ s4(X2)
| k5(X1) ),
c_0_24 ).
cnf(c_0_33,plain,
r3(b,b,b),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,negated_conjecture,
~ k5(b),
c_0_27 ).
cnf(c_0_35,plain,
( ~ n2(X1)
| p3(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_244]) ).
cnf(c_0_36,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
c_0_28 ).
cnf(c_0_37,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_002]) ).
cnf(c_0_39,plain,
( ~ l1(X1,X3)
| ~ p3(X2,X3,X4)
| s4(X1) ),
c_0_31 ).
cnf(c_0_40,plain,
~ s4(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_41,plain,
( ~ n2(X1)
| p3(X1,X1,X1) ),
c_0_35 ).
cnf(c_0_42,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
c_0_38 ).
cnf(c_0_44,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_45,plain,
( ~ l1(X4,X2)
| ~ p3(X1,X2,X3) ),
inference(sr,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
p3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]) ).
cnf(c_0_47,plain,
l1(d,d),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
~ l1(X1,X2),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,plain,
$false,
inference(sr,[status(thm)],[c_0_47,c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN116-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n003.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 10:45:46 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.44 % Version: 3.5.1
% 0.13/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.44 % Starting sh5l with 300s (1) cores
% 0.13/0.44 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 4088082 completed with status 0
% 0.13/0.44 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.13/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44 % No SInE strategy applied
% 0.13/0.44 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.13/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.44 % SubtermCWHack with pid 4088090 completed with status 0
% 0.13/0.44 % Result found by SubtermCWHack
% 0.13/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44 % No SInE strategy applied
% 0.13/0.44 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.13/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44 % Preprocessing time : 0.003 s
% 0.13/0.44
% 0.13/0.44 % Proof found!
% 0.13/0.44 % SZS status Unsatisfiable
% 0.13/0.44 % SZS output start CNFRefutation
% See solution above
% 0.13/0.44 % Parsed axioms : 369
% 0.13/0.44 % Removed by relevancy pruning/SinE : 0
% 0.13/0.44 % Initial clauses : 369
% 0.13/0.44 % Removed in clause preprocessing : 7
% 0.13/0.44 % Initial clauses in saturation : 362
% 0.13/0.44 % Processed clauses : 381
% 0.13/0.44 % ...of these trivial : 51
% 0.13/0.44 % ...subsumed : 5
% 0.13/0.44 % ...remaining for further processing : 325
% 0.13/0.44 % Other redundant clauses eliminated : 0
% 0.13/0.44 % Clauses deleted for lack of memory : 0
% 0.13/0.44 % Backward-subsumed : 27
% 0.13/0.44 % Backward-rewritten : 133
% 0.13/0.44 % Generated clauses : 290
% 0.13/0.44 % ...of the previous two non-redundant : 196
% 0.13/0.44 % ...aggressively subsumed : 0
% 0.13/0.44 % Contextual simplify-reflections : 0
% 0.13/0.44 % Paramodulations : 285
% 0.13/0.44 % Factorizations : 0
% 0.13/0.44 % NegExts : 0
% 0.13/0.44 % Equation resolutions : 0
% 0.13/0.44 % Disequality decompositions : 0
% 0.13/0.44 % Total rewrite steps : 347
% 0.13/0.44 % ...of those cached : 177
% 0.13/0.44 % Propositional unsat checks : 0
% 0.13/0.44 % Propositional check models : 0
% 0.13/0.44 % Propositional check unsatisfiable : 0
% 0.13/0.44 % Propositional clauses : 0
% 0.13/0.44 % Propositional clauses after purity: 0
% 0.13/0.44 % Propositional unsat core size : 0
% 0.13/0.44 % Propositional preprocessing time : 0.000
% 0.13/0.44 % Propositional encoding time : 0.000
% 0.13/0.44 % Propositional solver time : 0.000
% 0.13/0.44 % Success case prop preproc time : 0.000
% 0.13/0.44 % Success case prop encoding time : 0.000
% 0.13/0.44 % Success case prop solver time : 0.000
% 0.13/0.44 % Current number of processed clauses : 160
% 0.13/0.44 % Positive orientable unit clauses : 89
% 0.13/0.44 % Positive unorientable unit clauses: 0
% 0.13/0.44 % Negative unit clauses : 3
% 0.13/0.44 % Non-unit-clauses : 68
% 0.13/0.44 % Current number of unprocessed clauses: 159
% 0.13/0.44 % ...number of literals in the above : 583
% 0.13/0.44 % Current number of archived formulas : 0
% 0.13/0.44 % Current number of archived clauses : 165
% 0.13/0.44 % Clause-clause subsumption calls (NU) : 3013
% 0.13/0.44 % Rec. Clause-clause subsumption calls : 2593
% 0.13/0.44 % Non-unit clause-clause subsumptions : 14
% 0.13/0.44 % Unit Clause-clause subsumption calls : 760
% 0.13/0.44 % Rewrite failures with RHS unbound : 0
% 0.13/0.44 % BW rewrite match attempts : 164
% 0.13/0.44 % BW rewrite match successes : 112
% 0.13/0.44 % Condensation attempts : 0
% 0.13/0.44 % Condensation successes : 0
% 0.13/0.44 % Termbank termtop insertions : 14969
% 0.13/0.44 % Search garbage collected termcells : 1459
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.017 s
% 0.13/0.44 % System time : 0.003 s
% 0.13/0.44 % Total time : 0.020 s
% 0.13/0.44 % Maximum resident set size: 4472 pages
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.070 s
% 0.13/0.44 % System time : 0.017 s
% 0.13/0.44 % Total time : 0.086 s
% 0.13/0.44 % Maximum resident set size: 4864 pages
% 0.13/0.44 % E exiting
%------------------------------------------------------------------------------