%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN266-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 : 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:32:54 PM UTC 2026
% Result : Unsatisfiable 0.18s 0.52s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 49 ( 18 unt; 0 nHn; 39 RR)
% Number of literals : 93 ( 0 equ; 47 neg)
% Maximal clause size : 4 ( 1 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 : 77 ( 25 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_085,axiom,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_085) ).
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_228,axiom,
( ~ m3(X3,X1,X3)
| ~ m2(X2)
| ~ n2(X1)
| m3(X1,X2,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_228) ).
cnf(rule_236,axiom,
( ~ n2(X1)
| m3(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_236) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(rule_136,axiom,
( ~ k1(b)
| m2(b) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_136) ).
cnf(axiom_15,axiom,
n0(a,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_15) ).
cnf(rule_007,axiom,
( ~ r0(X1)
| ~ p0(X3,X2)
| m1(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_007) ).
cnf(rule_251,axiom,
( ~ p2(X1,X2,X4)
| ~ m3(X2,X3,X4)
| p3(X1,X2,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_251) ).
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_13,axiom,
r0(e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_13) ).
cnf(prove_this,negated_conjecture,
~ p3(b,e,e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_13,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_14,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_15,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_13 ).
cnf(c_0_16,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_17,plain,
( ~ m3(X3,X1,X3)
| ~ m2(X2)
| ~ n2(X1)
| m3(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_228]) ).
cnf(c_0_18,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
c_0_14 ).
cnf(c_0_19,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_236]) ).
cnf(c_0_21,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_22,plain,
( ~ m3(X3,X1,X3)
| ~ m2(X2)
| ~ n2(X1)
| m3(X1,X2,X2) ),
c_0_17 ).
cnf(c_0_23,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
c_0_20 ).
cnf(c_0_25,plain,
( ~ k1(b)
| m2(b) ),
inference(fof_simplification,[status(thm)],[rule_136]) ).
cnf(c_0_26,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_21 ).
cnf(c_0_27,axiom,
n0(a,b),
axiom_15 ).
cnf(c_0_28,plain,
( ~ r0(X1)
| ~ p0(X3,X2)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_007]) ).
cnf(c_0_29,plain,
( ~ m2(X2)
| ~ m3(X3,X1,X3)
| m3(X1,X2,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_30,plain,
m3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_23])]) ).
cnf(c_0_31,plain,
( ~ k1(b)
| m2(b) ),
c_0_25 ).
cnf(c_0_32,plain,
k1(b),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
( ~ r0(X1)
| ~ p0(X3,X2)
| m1(X1,X2,X1) ),
c_0_28 ).
cnf(c_0_34,plain,
( ~ p2(X1,X2,X4)
| ~ m3(X2,X3,X4)
| p3(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_251]) ).
cnf(c_0_35,plain,
( ~ m2(X2)
| m3(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
m2(b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_37,plain,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_176]) ).
cnf(c_0_38,plain,
( ~ r0(X1)
| m1(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_16]) ).
cnf(c_0_39,axiom,
r0(e),
axiom_13 ).
cnf(c_0_40,negated_conjecture,
~ p3(b,e,e),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_41,plain,
( ~ p2(X1,X2,X4)
| ~ m3(X2,X3,X4)
| p3(X1,X2,X2) ),
c_0_34 ).
cnf(c_0_42,plain,
m3(X1,b,b),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
c_0_37 ).
cnf(c_0_44,plain,
m1(e,X1,e),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
~ p3(b,e,e),
c_0_40 ).
cnf(c_0_46,plain,
( ~ p2(X1,X2,b)
| p3(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
p2(X1,e,X1),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN266-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n019.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 10:47:35 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.18/0.52 % Version: 3.5.1
% 0.18/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.52 % Starting sh5l with 300s (1) cores
% 0.18/0.52 % new_bool_1 with pid 2371386 completed with status 0
% 0.18/0.52 % Result found by new_bool_1
% 0.18/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.52 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.18/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.52 % SubtermCWHack with pid 2371393 completed with status 0
% 0.18/0.52 % Result found by SubtermCWHack
% 0.18/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.52 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.18/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.52 % Preprocessing time : 0.004 s
% 0.18/0.52
% 0.18/0.52 % Proof found!
% 0.18/0.52 % SZS status Unsatisfiable
% 0.18/0.52 % SZS output start CNFRefutation
% See solution above
% 0.18/0.52 % Parsed axioms : 369
% 0.18/0.52 % Removed by relevancy pruning/SinE : 38
% 0.18/0.52 % Initial clauses : 331
% 0.18/0.52 % Removed in clause preprocessing : 5
% 0.18/0.52 % Initial clauses in saturation : 326
% 0.18/0.52 % Processed clauses : 1068
% 0.18/0.52 % ...of these trivial : 131
% 0.18/0.52 % ...subsumed : 141
% 0.18/0.52 % ...remaining for further processing : 796
% 0.18/0.52 % Other redundant clauses eliminated : 0
% 0.18/0.52 % Clauses deleted for lack of memory : 0
% 0.18/0.52 % Backward-subsumed : 87
% 0.18/0.52 % Backward-rewritten : 234
% 0.18/0.52 % Generated clauses : 1335
% 0.18/0.52 % ...of the previous two non-redundant : 972
% 0.18/0.52 % ...aggressively subsumed : 0
% 0.18/0.52 % Contextual simplify-reflections : 1
% 0.18/0.52 % Paramodulations : 1335
% 0.18/0.52 % Factorizations : 0
% 0.18/0.52 % NegExts : 0
% 0.18/0.52 % Equation resolutions : 0
% 0.18/0.52 % Disequality decompositions : 0
% 0.18/0.52 % Total rewrite steps : 1089
% 0.18/0.52 % ...of those cached : 732
% 0.18/0.52 % Propositional unsat checks : 0
% 0.18/0.52 % Propositional check models : 0
% 0.18/0.52 % Propositional check unsatisfiable : 0
% 0.18/0.52 % Propositional clauses : 0
% 0.18/0.52 % Propositional clauses after purity: 0
% 0.18/0.52 % Propositional unsat core size : 0
% 0.18/0.52 % Propositional preprocessing time : 0.000
% 0.18/0.52 % Propositional encoding time : 0.000
% 0.18/0.52 % Propositional solver time : 0.000
% 0.18/0.52 % Success case prop preproc time : 0.000
% 0.18/0.52 % Success case prop encoding time : 0.000
% 0.18/0.52 % Success case prop solver time : 0.000
% 0.18/0.52 % Current number of processed clauses : 475
% 0.18/0.52 % Positive orientable unit clauses : 194
% 0.18/0.52 % Positive unorientable unit clauses: 0
% 0.18/0.52 % Negative unit clauses : 4
% 0.18/0.52 % Non-unit-clauses : 277
% 0.18/0.52 % Current number of unprocessed clauses: 110
% 0.18/0.52 % ...number of literals in the above : 451
% 0.18/0.52 % Current number of archived formulas : 0
% 0.18/0.52 % Current number of archived clauses : 321
% 0.18/0.52 % Clause-clause subsumption calls (NU) : 22688
% 0.18/0.52 % Rec. Clause-clause subsumption calls : 18016
% 0.18/0.52 % Non-unit clause-clause subsumptions : 193
% 0.18/0.52 % Unit Clause-clause subsumption calls : 1654
% 0.18/0.52 % Rewrite failures with RHS unbound : 0
% 0.18/0.52 % BW rewrite match attempts : 543
% 0.18/0.52 % BW rewrite match successes : 201
% 0.18/0.52 % Condensation attempts : 0
% 0.18/0.52 % Condensation successes : 0
% 0.18/0.52 % Termbank termtop insertions : 26045
% 0.18/0.52 % Search garbage collected termcells : 1515
% 0.18/0.52
% 0.18/0.52 % -------------------------------------------------
% 0.18/0.52 % User time : 0.065 s
% 0.18/0.52 % System time : 0.007 s
% 0.18/0.52 % Total time : 0.072 s
% 0.18/0.52 % Maximum resident set size: 4472 pages
% 0.18/0.52
% 0.18/0.52 % -------------------------------------------------
% 0.18/0.52 % User time : 0.072 s
% 0.18/0.52 % System time : 0.012 s
% 0.18/0.52 % Total time : 0.084 s
% 0.18/0.52 % Maximum resident set size: 4864 pages
% 0.18/0.52 % E exiting
%------------------------------------------------------------------------------