%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN117-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 : n006.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.12s 0.47s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 49 ( 18 unt; 0 nHn; 39 RR)
% Number of literals : 89 ( 0 equ; 43 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 92 ( 46 sgn)
% Comments :
%------------------------------------------------------------------------------
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_014,axiom,
( ~ m0(X2,X3,X1)
| m1(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_014) ).
cnf(rule_129,axiom,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_129) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_176,axiom,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_176) ).
cnf(rule_252,axiom,
( ~ k2(X3,X3)
| ~ q0(X2,X1)
| p3(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_252) ).
cnf(rule_267,axiom,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_267) ).
cnf(rule_300,axiom,
( ~ r3(X3,X1,X1)
| ~ s4(X2)
| k5(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_300) ).
cnf(rule_299,axiom,
( ~ l1(X1,X3)
| ~ p3(X2,X3,X4)
| s4(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_299) ).
cnf(axiom_6,axiom,
q0(b,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_6) ).
cnf(rule_002,axiom,
( ~ n0(X2,X1)
| l1(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_002) ).
cnf(axiom_15,axiom,
n0(a,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_15) ).
cnf(prove_this,negated_conjecture,
~ k5(e),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_13,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_110]) ).
cnf(c_0_14,plain,
( ~ m0(X2,X3,X1)
| m1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_014]) ).
cnf(c_0_15,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_129]) ).
cnf(c_0_16,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
c_0_13 ).
cnf(c_0_17,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_18,plain,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_176]) ).
cnf(c_0_19,plain,
( ~ m0(X2,X3,X1)
| m1(X1,X1,X1) ),
c_0_14 ).
cnf(c_0_20,plain,
( ~ k2(X3,X3)
| ~ q0(X2,X1)
| p3(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_252]) ).
cnf(c_0_21,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
c_0_15 ).
cnf(c_0_22,plain,
q1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_267]) ).
cnf(c_0_24,plain,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
c_0_18 ).
cnf(c_0_25,plain,
m1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_26,plain,
( ~ k2(X3,X3)
| ~ q0(X2,X1)
| p3(X1,X1,X1) ),
c_0_20 ).
cnf(c_0_27,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( ~ r3(X3,X1,X1)
| ~ s4(X2)
| k5(X1) ),
inference(fof_simplification,[status(thm)],[rule_300]) ).
cnf(c_0_29,plain,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
c_0_23 ).
cnf(c_0_30,plain,
p2(X1,X1,X1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
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,
( ~ q0(X2,X1)
| p3(X1,X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_33,axiom,
q0(b,b),
axiom_6 ).
cnf(c_0_34,plain,
( ~ r3(X3,X1,X1)
| ~ s4(X2)
| k5(X1) ),
c_0_28 ).
cnf(c_0_35,plain,
r3(X1,X1,X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
( ~ l1(X1,X3)
| ~ p3(X2,X3,X4)
| s4(X1) ),
c_0_31 ).
cnf(c_0_37,plain,
p3(b,b,b),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_002]) ).
cnf(c_0_39,plain,
( ~ s4(X2)
| k5(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
( ~ l1(X1,b)
| s4(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
c_0_38 ).
cnf(c_0_42,axiom,
n0(a,b),
axiom_15 ).
cnf(c_0_43,negated_conjecture,
~ k5(e),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_44,plain,
( ~ l1(X2,b)
| k5(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
l1(b,b),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
~ k5(e),
c_0_43 ).
cnf(c_0_47,plain,
k5(X1),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN117-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.37 % Computer : n006.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 10:43:57 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.47 % Version: 3.5.1
% 0.12/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.47 % Starting sh5l with 300s (1) cores
% 0.12/0.47 % new_bool_3 with pid 2658720 completed with status 0
% 0.12/0.47 % Result found by new_bool_3
% 0.12/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.47 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.12/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.47 % SubtermCWHack with pid 2658726 completed with status 0
% 0.12/0.47 % Result found by SubtermCWHack
% 0.12/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.47 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.12/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.47 % Preprocessing time : 0.004 s
% 0.12/0.47
% 0.12/0.47 % Proof found!
% 0.12/0.47 % SZS status Unsatisfiable
% 0.12/0.47 % SZS output start CNFRefutation
% See solution above
% 0.12/0.47 % Parsed axioms : 369
% 0.12/0.47 % Removed by relevancy pruning/SinE : 36
% 0.12/0.47 % Initial clauses : 333
% 0.12/0.47 % Removed in clause preprocessing : 7
% 0.12/0.47 % Initial clauses in saturation : 326
% 0.12/0.47 % Processed clauses : 378
% 0.12/0.47 % ...of these trivial : 46
% 0.12/0.47 % ...subsumed : 9
% 0.12/0.47 % ...remaining for further processing : 323
% 0.12/0.47 % Other redundant clauses eliminated : 0
% 0.12/0.47 % Clauses deleted for lack of memory : 0
% 0.12/0.47 % Backward-subsumed : 25
% 0.12/0.47 % Backward-rewritten : 105
% 0.12/0.47 % Generated clauses : 301
% 0.12/0.47 % ...of the previous two non-redundant : 207
% 0.12/0.47 % ...aggressively subsumed : 0
% 0.12/0.47 % Contextual simplify-reflections : 1
% 0.12/0.47 % Paramodulations : 301
% 0.12/0.47 % Factorizations : 0
% 0.12/0.47 % NegExts : 0
% 0.12/0.47 % Equation resolutions : 0
% 0.12/0.47 % Disequality decompositions : 0
% 0.12/0.47 % Total rewrite steps : 300
% 0.12/0.47 % ...of those cached : 157
% 0.12/0.47 % Propositional unsat checks : 0
% 0.12/0.47 % Propositional check models : 0
% 0.12/0.47 % Propositional check unsatisfiable : 0
% 0.12/0.47 % Propositional clauses : 0
% 0.12/0.47 % Propositional clauses after purity: 0
% 0.12/0.47 % Propositional unsat core size : 0
% 0.12/0.47 % Propositional preprocessing time : 0.000
% 0.12/0.47 % Propositional encoding time : 0.000
% 0.12/0.47 % Propositional solver time : 0.000
% 0.12/0.47 % Success case prop preproc time : 0.000
% 0.12/0.47 % Success case prop encoding time : 0.000
% 0.12/0.47 % Success case prop solver time : 0.000
% 0.12/0.47 % Current number of processed clauses : 193
% 0.12/0.47 % Positive orientable unit clauses : 97
% 0.12/0.47 % Positive unorientable unit clauses: 0
% 0.12/0.47 % Negative unit clauses : 1
% 0.12/0.47 % Non-unit-clauses : 95
% 0.12/0.47 % Current number of unprocessed clauses: 134
% 0.12/0.47 % ...number of literals in the above : 482
% 0.12/0.47 % Current number of archived formulas : 0
% 0.12/0.47 % Current number of archived clauses : 130
% 0.12/0.47 % Clause-clause subsumption calls (NU) : 4737
% 0.12/0.47 % Rec. Clause-clause subsumption calls : 4101
% 0.12/0.47 % Non-unit clause-clause subsumptions : 29
% 0.12/0.47 % Unit Clause-clause subsumption calls : 694
% 0.12/0.47 % Rewrite failures with RHS unbound : 0
% 0.12/0.47 % BW rewrite match attempts : 139
% 0.12/0.47 % BW rewrite match successes : 86
% 0.12/0.47 % Condensation attempts : 0
% 0.12/0.47 % Condensation successes : 0
% 0.12/0.47 % Termbank termtop insertions : 14358
% 0.12/0.47 % Search garbage collected termcells : 1498
% 0.12/0.47
% 0.12/0.47 % -------------------------------------------------
% 0.12/0.47 % User time : 0.022 s
% 0.12/0.47 % System time : 0.007 s
% 0.12/0.47 % Total time : 0.029 s
% 0.12/0.47 % Maximum resident set size: 4420 pages
% 0.12/0.47
% 0.12/0.47 % -------------------------------------------------
% 0.12/0.47 % User time : 0.029 s
% 0.12/0.47 % System time : 0.011 s
% 0.12/0.47 % Total time : 0.040 s
% 0.12/0.47 % Maximum resident set size: 4864 pages
% 0.12/0.47 % E exiting
%------------------------------------------------------------------------------