%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN202-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:22 PM UTC 2026
% Result : Unsatisfiable 0.03s 0.47s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 50 ( 21 unt; 0 nHn; 37 RR)
% Number of literals : 102 ( 0 equ; 56 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 75 ( 35 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_126) ).
cnf(rule_125,axiom,
( ~ p0(X1,X1)
| s1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_125) ).
cnf(rule_124,axiom,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_124) ).
cnf(rule_110,axiom,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_110) ).
cnf(rule_085,axiom,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_085) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_181,axiom,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_181) ).
cnf(rule_189,axiom,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_189) ).
cnf(rule_187,axiom,
( ~ q2(X2,X2,X2)
| ~ k0(X2)
| ~ m0(X3,X4,X1)
| ~ r1(X2)
| q2(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_187) ).
cnf(prove_this,negated_conjecture,
~ s2(e),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_28) ).
cnf(c_0_14,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_15,plain,
( ~ p0(X1,X1)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_16,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
inference(fof_simplification,[status(thm)],[rule_124]) ).
cnf(c_0_17,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_110]) ).
cnf(c_0_18,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_19,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
c_0_14 ).
cnf(c_0_20,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_21,plain,
( ~ p0(X1,X1)
| s1(X1) ),
c_0_15 ).
cnf(c_0_22,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_23,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
c_0_16 ).
cnf(c_0_24,axiom,
s0(d),
axiom_1 ).
cnf(c_0_25,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
c_0_17 ).
cnf(c_0_26,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_27,plain,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_181]) ).
cnf(c_0_28,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_18 ).
cnf(c_0_29,plain,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
inference(fof_simplification,[status(thm)],[rule_189]) ).
cnf(c_0_30,plain,
( ~ s1(X2)
| s1(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_31,plain,
s1(b),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_32,plain,
( ~ q2(X2,X2,X2)
| ~ k0(X2)
| ~ m0(X3,X4,X1)
| ~ r1(X2)
| q2(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_187]) ).
cnf(c_0_33,plain,
( ~ q0(X1,X2)
| ~ q1(d,X2,d)
| r1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_34,plain,
q1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,plain,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
c_0_27 ).
cnf(c_0_36,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_37,negated_conjecture,
~ s2(e),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_38,plain,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
c_0_29 ).
cnf(c_0_39,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_40,plain,
( ~ q2(X2,X2,X2)
| ~ k0(X2)
| ~ m0(X3,X4,X1)
| ~ r1(X2)
| q2(X1,X2,X1) ),
c_0_32 ).
cnf(c_0_41,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_20]),c_0_34])]) ).
cnf(c_0_42,plain,
q2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_43,negated_conjecture,
~ s2(e),
c_0_37 ).
cnf(c_0_44,plain,
( ~ q2(b,X1,b)
| s2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_45,plain,
( ~ m0(X3,X4,X1)
| ~ k0(X2)
| q2(X1,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_46,negated_conjecture,
~ q2(b,e,b),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
( ~ k0(X2)
| q2(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_26]) ).
cnf(c_0_48,axiom,
k0(e),
axiom_28 ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN202-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n019.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:46:04 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.40 Running first-order theorem proving
% 0.03/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.03/0.47 % Version: 3.5.1
% 0.03/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.03/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.03/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.47 % Starting sh5l with 300s (1) cores
% 0.03/0.47 % new_bool_1 with pid 2366842 completed with status 0
% 0.03/0.47 % Result found by new_bool_1
% 0.03/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.03/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.03/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/0.47 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.03/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.03/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.03/0.47 % SubtermCWHack with pid 2366848 completed with status 0
% 0.03/0.47 % Result found by SubtermCWHack
% 0.03/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.03/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.03/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/0.47 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.03/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.03/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.03/0.47 % Preprocessing time : 0.002 s
% 0.03/0.47
% 0.03/0.47 % Proof found!
% 0.03/0.47 % SZS status Unsatisfiable
% 0.03/0.47 % SZS output start CNFRefutation
% See solution above
% 0.03/0.47 % Parsed axioms : 369
% 0.03/0.47 % Removed by relevancy pruning/SinE : 41
% 0.03/0.47 % Initial clauses : 328
% 0.03/0.47 % Removed in clause preprocessing : 5
% 0.03/0.47 % Initial clauses in saturation : 323
% 0.03/0.47 % Processed clauses : 1164
% 0.03/0.47 % ...of these trivial : 136
% 0.03/0.47 % ...subsumed : 148
% 0.03/0.47 % ...remaining for further processing : 880
% 0.03/0.47 % Other redundant clauses eliminated : 0
% 0.03/0.47 % Clauses deleted for lack of memory : 0
% 0.03/0.47 % Backward-subsumed : 97
% 0.03/0.47 % Backward-rewritten : 226
% 0.03/0.47 % Generated clauses : 1546
% 0.03/0.47 % ...of the previous two non-redundant : 1171
% 0.03/0.47 % ...aggressively subsumed : 0
% 0.03/0.47 % Contextual simplify-reflections : 1
% 0.03/0.47 % Paramodulations : 1546
% 0.03/0.47 % Factorizations : 0
% 0.03/0.47 % NegExts : 0
% 0.03/0.47 % Equation resolutions : 0
% 0.03/0.47 % Disequality decompositions : 0
% 0.03/0.47 % Total rewrite steps : 1125
% 0.03/0.47 % ...of those cached : 756
% 0.03/0.47 % Propositional unsat checks : 0
% 0.03/0.47 % Propositional check models : 0
% 0.03/0.47 % Propositional check unsatisfiable : 0
% 0.03/0.47 % Propositional clauses : 0
% 0.03/0.47 % Propositional clauses after purity: 0
% 0.03/0.47 % Propositional unsat core size : 0
% 0.03/0.47 % Propositional preprocessing time : 0.000
% 0.03/0.47 % Propositional encoding time : 0.000
% 0.03/0.47 % Propositional solver time : 0.000
% 0.03/0.47 % Success case prop preproc time : 0.000
% 0.03/0.47 % Success case prop encoding time : 0.000
% 0.03/0.47 % Success case prop solver time : 0.000
% 0.03/0.47 % Current number of processed clauses : 557
% 0.03/0.47 % Positive orientable unit clauses : 207
% 0.03/0.47 % Positive unorientable unit clauses: 0
% 0.03/0.47 % Negative unit clauses : 2
% 0.03/0.47 % Non-unit-clauses : 348
% 0.03/0.47 % Current number of unprocessed clauses: 203
% 0.03/0.47 % ...number of literals in the above : 757
% 0.03/0.47 % Current number of archived formulas : 0
% 0.03/0.47 % Current number of archived clauses : 323
% 0.03/0.47 % Clause-clause subsumption calls (NU) : 26116
% 0.03/0.47 % Rec. Clause-clause subsumption calls : 21441
% 0.03/0.47 % Non-unit clause-clause subsumptions : 225
% 0.03/0.47 % Unit Clause-clause subsumption calls : 1770
% 0.03/0.47 % Rewrite failures with RHS unbound : 0
% 0.03/0.47 % BW rewrite match attempts : 562
% 0.03/0.47 % BW rewrite match successes : 199
% 0.03/0.47 % Condensation attempts : 0
% 0.03/0.47 % Condensation successes : 0
% 0.03/0.47 % Termbank termtop insertions : 28213
% 0.03/0.47 % Search garbage collected termcells : 1514
% 0.03/0.47
% 0.03/0.47 % -------------------------------------------------
% 0.03/0.47 % User time : 0.042 s
% 0.03/0.47 % System time : 0.004 s
% 0.03/0.47 % Total time : 0.046 s
% 0.03/0.47 % Maximum resident set size: 4472 pages
% 0.03/0.47
% 0.03/0.47 % -------------------------------------------------
% 0.03/0.47 % User time : 0.050 s
% 0.03/0.47 % System time : 0.007 s
% 0.03/0.47 % Total time : 0.057 s
% 0.03/0.47 % Maximum resident set size: 5120 pages
% 0.03/0.47 % E exiting
%------------------------------------------------------------------------------