%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN161-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 : n009.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:40 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.48s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of clauses : 62 ( 26 unt; 0 nHn; 56 RR)
% Number of literals : 121 ( 0 equ; 66 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 15 ( 14 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 75 ( 29 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_126) ).
cnf(rule_125,axiom,
( ~ p0(X1,X1)
| s1(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_125) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(rule_315,axiom,
( ~ k4(X1)
| ~ s1(X1)
| n5(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_315) ).
cnf(rule_274,axiom,
( ~ n3(e)
| ~ q3(e,b)
| ~ n0(c,d)
| k4(c) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_274) ).
cnf(rule_159,axiom,
( ~ k1(X1)
| p2(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_159) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_30) ).
cnf(axiom_34,axiom,
n0(c,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_34) ).
cnf(prove_this,negated_conjecture,
~ n5(c,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_240,axiom,
( ~ p2(X2,X3,X1)
| n3(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_240) ).
cnf(rule_255,axiom,
( ~ n0(X3,X1)
| ~ q2(X3,X1,X2)
| q3(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_255) ).
cnf(rule_186,axiom,
( ~ l1(X2,X1)
| q2(X1,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_186) ).
cnf(rule_003,axiom,
( ~ m0(X2,X1,X3)
| ~ r0(X4)
| ~ p0(X3,X1)
| l1(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_003) ).
cnf(axiom_27,axiom,
m0(e,b,c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_27) ).
cnf(axiom_18,axiom,
p0(c,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_18) ).
cnf(axiom_13,axiom,
r0(e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_13) ).
cnf(c_0_18,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_19,plain,
( ~ p0(X1,X1)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_20,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
c_0_18 ).
cnf(c_0_21,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_22,plain,
( ~ p0(X1,X1)
| s1(X1) ),
c_0_19 ).
cnf(c_0_23,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_24,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_25,plain,
( ~ k4(X1)
| ~ s1(X1)
| n5(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_315]) ).
cnf(c_0_26,plain,
( ~ s1(X2)
| s1(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
s1(b),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( ~ n3(e)
| ~ q3(e,b)
| ~ n0(c,d)
| k4(c) ),
inference(fof_simplification,[status(thm)],[rule_274]) ).
cnf(c_0_29,plain,
( ~ k1(X1)
| p2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_159]) ).
cnf(c_0_30,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_24 ).
cnf(c_0_31,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_32,plain,
( ~ k4(X1)
| ~ s1(X1)
| n5(X1,X1) ),
c_0_25 ).
cnf(c_0_33,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
( ~ n3(e)
| ~ q3(e,b)
| ~ n0(c,d)
| k4(c) ),
c_0_28 ).
cnf(c_0_35,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_36,negated_conjecture,
~ n5(c,X1),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_37,plain,
( ~ p2(X2,X3,X1)
| n3(X1) ),
inference(fof_simplification,[status(thm)],[rule_240]) ).
cnf(c_0_38,plain,
( ~ k1(X1)
| p2(X1,X1,X1) ),
c_0_29 ).
cnf(c_0_39,plain,
k1(e),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_40,plain,
( ~ n0(X3,X1)
| ~ q2(X3,X1,X2)
| q3(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_255]) ).
cnf(c_0_41,plain,
( ~ l1(X2,X1)
| q2(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_186]) ).
cnf(c_0_42,plain,
( ~ k4(X1)
| n5(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_43,plain,
( ~ n3(e)
| ~ q3(e,b)
| k4(c) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_44,negated_conjecture,
~ n5(c,X1),
c_0_36 ).
cnf(c_0_45,plain,
( ~ p2(X2,X3,X1)
| n3(X1) ),
c_0_37 ).
cnf(c_0_46,plain,
p2(e,e,e),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_47,plain,
( ~ n0(X3,X1)
| ~ q2(X3,X1,X2)
| q3(X1,X2) ),
c_0_40 ).
cnf(c_0_48,plain,
( ~ l1(X2,X1)
| q2(X1,X1,X2) ),
c_0_41 ).
cnf(c_0_49,plain,
( ~ n3(e)
| ~ q3(e,b) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_50,plain,
n3(e),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
( ~ n0(X1,X1)
| ~ l1(X2,X1)
| q3(X1,X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
( ~ m0(X2,X1,X3)
| ~ r0(X4)
| ~ p0(X3,X1)
| l1(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_003]) ).
cnf(c_0_53,plain,
~ q3(e,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_54,plain,
( ~ l1(X1,e)
| q3(e,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_31]) ).
cnf(c_0_55,plain,
( ~ m0(X2,X1,X3)
| ~ r0(X4)
| ~ p0(X3,X1)
| l1(X1,X2) ),
c_0_52 ).
cnf(c_0_56,axiom,
m0(e,b,c),
axiom_27 ).
cnf(c_0_57,axiom,
p0(c,b),
axiom_18 ).
cnf(c_0_58,plain,
~ l1(b,e),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,axiom,
r0(e),
axiom_13 ).
cnf(c_0_60,plain,
~ r0(X1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]),c_0_58]) ).
cnf(c_0_61,plain,
$false,
inference(sr,[status(thm)],[c_0_59,c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYN161-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n009.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 10:44:58 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/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.17/0.48 % Version: 3.5.1
% 0.17/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 % Starting sh5l with 300s (1) cores
% 0.17/0.48 % new_bool_1 with pid 1546630 completed with status 0
% 0.17/0.48 % Result found by new_bool_1
% 0.17/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.48 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.17/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.17/0.48 % SubtermCWHack with pid 1546632 completed with status 0
% 0.17/0.48 % Result found by SubtermCWHack
% 0.17/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.48 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.17/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.17/0.48 % Preprocessing time : 0.004 s
% 0.17/0.48
% 0.17/0.48 % Proof found!
% 0.17/0.48 % SZS status Unsatisfiable
% 0.17/0.48 % SZS output start CNFRefutation
% See solution above
% 0.17/0.48 % Parsed axioms : 369
% 0.17/0.48 % Removed by relevancy pruning/SinE : 32
% 0.17/0.48 % Initial clauses : 337
% 0.17/0.48 % Removed in clause preprocessing : 6
% 0.17/0.48 % Initial clauses in saturation : 331
% 0.17/0.48 % Processed clauses : 526
% 0.17/0.48 % ...of these trivial : 79
% 0.17/0.48 % ...subsumed : 9
% 0.17/0.48 % ...remaining for further processing : 438
% 0.17/0.48 % Other redundant clauses eliminated : 0
% 0.17/0.48 % Clauses deleted for lack of memory : 0
% 0.17/0.48 % Backward-subsumed : 53
% 0.17/0.48 % Backward-rewritten : 160
% 0.17/0.48 % Generated clauses : 454
% 0.17/0.48 % ...of the previous two non-redundant : 333
% 0.17/0.48 % ...aggressively subsumed : 0
% 0.17/0.48 % Contextual simplify-reflections : 1
% 0.17/0.48 % Paramodulations : 452
% 0.17/0.48 % Factorizations : 0
% 0.17/0.48 % NegExts : 0
% 0.17/0.48 % Equation resolutions : 0
% 0.17/0.48 % Disequality decompositions : 0
% 0.17/0.48 % Total rewrite steps : 468
% 0.17/0.48 % ...of those cached : 249
% 0.17/0.48 % Propositional unsat checks : 0
% 0.17/0.48 % Propositional check models : 0
% 0.17/0.48 % Propositional check unsatisfiable : 0
% 0.17/0.48 % Propositional clauses : 0
% 0.17/0.48 % Propositional clauses after purity: 0
% 0.17/0.48 % Propositional unsat core size : 0
% 0.17/0.48 % Propositional preprocessing time : 0.000
% 0.17/0.48 % Propositional encoding time : 0.000
% 0.17/0.48 % Propositional solver time : 0.000
% 0.17/0.48 % Success case prop preproc time : 0.000
% 0.17/0.48 % Success case prop encoding time : 0.000
% 0.17/0.48 % Success case prop solver time : 0.000
% 0.17/0.48 % Current number of processed clauses : 223
% 0.17/0.48 % Positive orientable unit clauses : 110
% 0.17/0.48 % Positive unorientable unit clauses: 0
% 0.17/0.48 % Negative unit clauses : 5
% 0.17/0.48 % Non-unit-clauses : 108
% 0.17/0.48 % Current number of unprocessed clauses: 91
% 0.17/0.48 % ...number of literals in the above : 355
% 0.17/0.48 % Current number of archived formulas : 0
% 0.17/0.48 % Current number of archived clauses : 215
% 0.17/0.48 % Clause-clause subsumption calls (NU) : 6041
% 0.17/0.48 % Rec. Clause-clause subsumption calls : 5388
% 0.17/0.48 % Non-unit clause-clause subsumptions : 36
% 0.17/0.48 % Unit Clause-clause subsumption calls : 614
% 0.17/0.48 % Rewrite failures with RHS unbound : 0
% 0.17/0.48 % BW rewrite match attempts : 216
% 0.17/0.48 % BW rewrite match successes : 140
% 0.17/0.48 % Condensation attempts : 0
% 0.17/0.48 % Condensation successes : 0
% 0.17/0.48 % Termbank termtop insertions : 16210
% 0.17/0.48 % Search garbage collected termcells : 1503
% 0.17/0.48
% 0.17/0.48 % -------------------------------------------------
% 0.17/0.48 % User time : 0.028 s
% 0.17/0.48 % System time : 0.005 s
% 0.17/0.48 % Total time : 0.033 s
% 0.17/0.48 % Maximum resident set size: 4472 pages
% 0.17/0.48
% 0.17/0.48 % -------------------------------------------------
% 0.17/0.48 % User time : 0.036 s
% 0.17/0.48 % System time : 0.009 s
% 0.17/0.48 % Total time : 0.045 s
% 0.17/0.48 % Maximum resident set size: 4864 pages
% 0.17/0.48 % E exiting
%------------------------------------------------------------------------------