%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN179-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 : n016.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:19 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.49s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 19
% Syntax : Number of clauses : 67 ( 29 unt; 0 nHn; 55 RR)
% Number of literals : 144 ( 0 equ; 80 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 91 ( 34 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(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(rule_133,axiom,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_133) ).
cnf(rule_050,axiom,
( ~ p0(b,X2)
| ~ l0(X1)
| ~ s0(b)
| n1(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_050) ).
cnf(rule_183,axiom,
( ~ l2(X2,X1)
| ~ l0(c)
| ~ k1(X2)
| q2(X1,c,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_183) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(rule_257,axiom,
( ~ q3(X2,X1)
| ~ s2(X1)
| ~ n1(X3,X1,X2)
| q3(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_257) ).
cnf(rule_255,axiom,
( ~ n0(X3,X1)
| ~ q2(X3,X1,X2)
| q3(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_255) ).
cnf(rule_190,axiom,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_190) ).
cnf(axiom_36,axiom,
q0(a,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_36) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(prove_this,negated_conjecture,
~ q3(d,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_34,axiom,
n0(c,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_34) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
cnf(c_0_19,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_20,plain,
( ~ p0(X1,X1)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_21,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
c_0_19 ).
cnf(c_0_22,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_23,plain,
( ~ p0(X1,X1)
| s1(X1) ),
c_0_20 ).
cnf(c_0_24,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_25,plain,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_133]) ).
cnf(c_0_26,plain,
( ~ s1(X2)
| s1(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
s1(b),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
c_0_25 ).
cnf(c_0_29,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( ~ p0(b,X2)
| ~ l0(X1)
| ~ s0(b)
| n1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_050]) ).
cnf(c_0_31,plain,
( ~ l2(X2,X1)
| ~ l0(c)
| ~ k1(X2)
| q2(X1,c,X2) ),
inference(fof_simplification,[status(thm)],[rule_183]) ).
cnf(c_0_32,plain,
( ~ m0(X3,X4,X1)
| ~ p0(X2,X2)
| l2(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_33,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_34,plain,
( ~ p0(b,X2)
| ~ l0(X1)
| ~ s0(b)
| n1(X1,X2,X1) ),
c_0_30 ).
cnf(c_0_35,axiom,
s0(b),
axiom_5 ).
cnf(c_0_36,plain,
( ~ l2(X2,X1)
| ~ l0(c)
| ~ k1(X2)
| q2(X1,c,X2) ),
c_0_31 ).
cnf(c_0_37,axiom,
l0(c),
axiom_24 ).
cnf(c_0_38,plain,
( ~ p0(X2,X2)
| l2(X1,X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
( ~ q3(X2,X1)
| ~ s2(X1)
| ~ n1(X3,X1,X2)
| q3(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_257]) ).
cnf(c_0_40,plain,
( ~ l0(X1)
| n1(X1,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_24])]) ).
cnf(c_0_41,plain,
( ~ n0(X3,X1)
| ~ q2(X3,X1,X2)
| q3(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_255]) ).
cnf(c_0_42,plain,
( ~ k1(X2)
| ~ l2(X2,X1)
| q2(X1,c,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_43,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_38,c_0_24]) ).
cnf(c_0_44,plain,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
inference(fof_simplification,[status(thm)],[rule_190]) ).
cnf(c_0_45,axiom,
q0(a,b),
axiom_36 ).
cnf(c_0_46,plain,
( ~ q3(X2,X1)
| ~ s2(X1)
| ~ n1(X3,X1,X2)
| q3(X1,X2) ),
c_0_39 ).
cnf(c_0_47,plain,
n1(c,X1,c),
inference(spm,[status(thm)],[c_0_40,c_0_37]) ).
cnf(c_0_48,plain,
( ~ n0(X3,X1)
| ~ q2(X3,X1,X2)
| q3(X1,X2) ),
c_0_41 ).
cnf(c_0_49,plain,
( ~ k1(X1)
| q2(X1,c,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
c_0_44 ).
cnf(c_0_51,axiom,
s0(d),
axiom_1 ).
cnf(c_0_52,plain,
( ~ s1(X1)
| s1(a) ),
inference(spm,[status(thm)],[c_0_21,c_0_45]) ).
cnf(c_0_53,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_54,negated_conjecture,
~ q3(d,X1),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_55,plain,
( ~ s2(X1)
| ~ q3(c,X1)
| q3(X1,c) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_56,plain,
( ~ n0(X1,c)
| ~ k1(X1)
| q3(c,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_57,plain,
( ~ s1(a)
| s2(d) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]) ).
cnf(c_0_58,plain,
s1(a),
inference(spm,[status(thm)],[c_0_52,c_0_27]) ).
cnf(c_0_59,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_53 ).
cnf(c_0_60,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_61,negated_conjecture,
~ q3(d,X1),
c_0_54 ).
cnf(c_0_62,plain,
( ~ n0(X1,c)
| ~ k1(X1)
| ~ s2(X1)
| q3(X1,c) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_63,plain,
s2(d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]) ).
cnf(c_0_64,plain,
k1(d),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_66,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_64]),c_0_65])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN179-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n016.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 10:50:22 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.43 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.17/0.49 % Version: 3.5.1
% 0.17/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 % Starting sh5l with 300s (1) cores
% 0.17/0.49 % new_bool_1 with pid 2240062 completed with status 0
% 0.17/0.49 % Result found by new_bool_1
% 0.17/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.49 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.17/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.17/0.49 % SubtermCWHack with pid 2240064 completed with status 0
% 0.17/0.49 % Result found by SubtermCWHack
% 0.17/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.49 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.17/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.17/0.49 % Preprocessing time : 0.006 s
% 0.17/0.49
% 0.17/0.49 % Proof found!
% 0.17/0.49 % SZS status Unsatisfiable
% 0.17/0.49 % SZS output start CNFRefutation
% See solution above
% 0.17/0.49 % Parsed axioms : 369
% 0.17/0.49 % Removed by relevancy pruning/SinE : 30
% 0.17/0.49 % Initial clauses : 339
% 0.17/0.49 % Removed in clause preprocessing : 6
% 0.17/0.49 % Initial clauses in saturation : 333
% 0.17/0.49 % Processed clauses : 678
% 0.17/0.49 % ...of these trivial : 91
% 0.17/0.49 % ...subsumed : 32
% 0.17/0.49 % ...remaining for further processing : 555
% 0.17/0.49 % Other redundant clauses eliminated : 0
% 0.17/0.49 % Clauses deleted for lack of memory : 0
% 0.17/0.49 % Backward-subsumed : 36
% 0.17/0.49 % Backward-rewritten : 174
% 0.17/0.49 % Generated clauses : 697
% 0.17/0.49 % ...of the previous two non-redundant : 499
% 0.17/0.49 % ...aggressively subsumed : 0
% 0.17/0.49 % Contextual simplify-reflections : 0
% 0.17/0.49 % Paramodulations : 697
% 0.17/0.49 % Factorizations : 0
% 0.17/0.49 % NegExts : 0
% 0.17/0.49 % Equation resolutions : 0
% 0.17/0.49 % Disequality decompositions : 0
% 0.17/0.49 % Total rewrite steps : 661
% 0.17/0.49 % ...of those cached : 398
% 0.17/0.49 % Propositional unsat checks : 0
% 0.17/0.49 % Propositional check models : 0
% 0.17/0.49 % Propositional check unsatisfiable : 0
% 0.17/0.49 % Propositional clauses : 0
% 0.17/0.49 % Propositional clauses after purity: 0
% 0.17/0.49 % Propositional unsat core size : 0
% 0.17/0.49 % Propositional preprocessing time : 0.000
% 0.17/0.49 % Propositional encoding time : 0.000
% 0.17/0.49 % Propositional solver time : 0.000
% 0.17/0.49 % Success case prop preproc time : 0.000
% 0.17/0.49 % Success case prop encoding time : 0.000
% 0.17/0.49 % Success case prop solver time : 0.000
% 0.17/0.49 % Current number of processed clauses : 345
% 0.17/0.49 % Positive orientable unit clauses : 161
% 0.17/0.49 % Positive unorientable unit clauses: 0
% 0.17/0.49 % Negative unit clauses : 7
% 0.17/0.49 % Non-unit-clauses : 177
% 0.17/0.49 % Current number of unprocessed clauses: 93
% 0.17/0.49 % ...number of literals in the above : 360
% 0.17/0.49 % Current number of archived formulas : 0
% 0.17/0.49 % Current number of archived clauses : 210
% 0.17/0.49 % Clause-clause subsumption calls (NU) : 8873
% 0.17/0.49 % Rec. Clause-clause subsumption calls : 8069
% 0.17/0.49 % Non-unit clause-clause subsumptions : 55
% 0.17/0.49 % Unit Clause-clause subsumption calls : 779
% 0.17/0.49 % Rewrite failures with RHS unbound : 0
% 0.17/0.49 % BW rewrite match attempts : 252
% 0.17/0.49 % BW rewrite match successes : 152
% 0.17/0.49 % Condensation attempts : 0
% 0.17/0.49 % Condensation successes : 0
% 0.17/0.49 % Termbank termtop insertions : 18917
% 0.17/0.49 % Search garbage collected termcells : 1503
% 0.17/0.49
% 0.17/0.49 % -------------------------------------------------
% 0.17/0.49 % User time : 0.040 s
% 0.17/0.49 % System time : 0.004 s
% 0.17/0.49 % Total time : 0.044 s
% 0.17/0.49 % Maximum resident set size: 4472 pages
% 0.17/0.49
% 0.17/0.49 % -------------------------------------------------
% 0.17/0.49 % User time : 0.047 s
% 0.17/0.49 % System time : 0.009 s
% 0.17/0.49 % Total time : 0.056 s
% 0.17/0.49 % Maximum resident set size: 5120 pages
% 0.17/0.49 % E exiting
%------------------------------------------------------------------------------