%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN208-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 : n018.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:23 PM UTC 2026
% Result : Unsatisfiable 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 47 ( 23 unt; 0 nHn; 40 RR)
% Number of literals : 86 ( 0 equ; 42 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 : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 48 ( 23 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_045,axiom,
( ~ q0(d,d)
| n1(d,d,d) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_045) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
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_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_179,axiom,
( ~ n1(X1,X1,X2)
| ~ k1(X2)
| q2(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_179) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(axiom_34,axiom,
n0(c,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_34) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
cnf(rule_273,axiom,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_273) ).
cnf(prove_this,negated_conjecture,
~ s3(d,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
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,
( ~ q0(d,d)
| n1(d,d,d) ),
inference(fof_simplification,[status(thm)],[rule_045]) ).
cnf(c_0_17,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_18,plain,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
inference(fof_simplification,[status(thm)],[rule_190]) ).
cnf(c_0_19,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
c_0_14 ).
cnf(c_0_20,axiom,
q0(a,b),
axiom_36 ).
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,
( ~ n1(X1,X1,X2)
| ~ k1(X2)
| q2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_179]) ).
cnf(c_0_24,plain,
( ~ q0(d,d)
| n1(d,d,d) ),
c_0_16 ).
cnf(c_0_25,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_26,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_17 ).
cnf(c_0_27,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_28,plain,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
c_0_18 ).
cnf(c_0_29,axiom,
s0(d),
axiom_1 ).
cnf(c_0_30,plain,
( ~ s1(X1)
| s1(a) ),
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,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_273]) ).
cnf(c_0_33,plain,
( ~ n1(X1,X1,X2)
| ~ k1(X2)
| q2(X1,X1,X1) ),
c_0_23 ).
cnf(c_0_34,plain,
n1(d,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_35,plain,
k1(d),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,plain,
( ~ s1(a)
| s2(d) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_37,plain,
s1(a),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
c_0_32 ).
cnf(c_0_39,plain,
q2(d,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_40,plain,
s2(d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_41,negated_conjecture,
~ s3(d,b),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_42,plain,
( ~ m0(d,X2,X1)
| s3(d,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_43,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_44,negated_conjecture,
~ s3(d,b),
c_0_41 ).
cnf(c_0_45,plain,
s3(d,X1),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN208-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.13/0.38 % Computer : n018.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 10:48:30 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/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.19/0.50 % Version: 3.5.1
% 0.19/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 % Starting sh5l with 300s (1) cores
% 0.19/0.50 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1686715 completed with status 0
% 0.19/0.50 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.19/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.50 % No SInE strategy applied
% 0.19/0.50 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.19/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.50 % Starting new_bool_3 with 136s (1) cores
% 0.19/0.50 % Starting new_bool_1 with 136s (1) cores
% 0.19/0.50 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 1686722 completed with status 0
% 0.19/0.50 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.19/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.50 % No SInE strategy applied
% 0.19/0.50 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.19/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.50 % Preprocessing time : 0.003 s
% 0.19/0.50 % Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 % Proof found!
% 0.19/0.50 % SZS status Unsatisfiable
% 0.19/0.50 % SZS output start CNFRefutation
% See solution above
% 0.19/0.50 % Parsed axioms : 369
% 0.19/0.50 % Removed by relevancy pruning/SinE : 0
% 0.19/0.50 % Initial clauses : 369
% 0.19/0.50 % Removed in clause preprocessing : 7
% 0.19/0.50 % Initial clauses in saturation : 362
% 0.19/0.50 % Processed clauses : 795
% 0.19/0.50 % ...of these trivial : 20
% 0.19/0.50 % ...subsumed : 27
% 0.19/0.50 % ...remaining for further processing : 748
% 0.19/0.50 % Other redundant clauses eliminated : 0
% 0.19/0.50 % Clauses deleted for lack of memory : 0
% 0.19/0.50 % Backward-subsumed : 11
% 0.19/0.50 % Backward-rewritten : 66
% 0.19/0.50 % Generated clauses : 614
% 0.19/0.50 % ...of the previous two non-redundant : 446
% 0.19/0.50 % ...aggressively subsumed : 0
% 0.19/0.50 % Contextual simplify-reflections : 2
% 0.19/0.50 % Paramodulations : 614
% 0.19/0.50 % Factorizations : 0
% 0.19/0.50 % NegExts : 0
% 0.19/0.50 % Equation resolutions : 0
% 0.19/0.50 % Disequality decompositions : 0
% 0.19/0.50 % Total rewrite steps : 420
% 0.19/0.50 % ...of those cached : 280
% 0.19/0.50 % Propositional unsat checks : 0
% 0.19/0.50 % Propositional check models : 0
% 0.19/0.50 % Propositional check unsatisfiable : 0
% 0.19/0.50 % Propositional clauses : 0
% 0.19/0.50 % Propositional clauses after purity: 0
% 0.19/0.50 % Propositional unsat core size : 0
% 0.19/0.50 % Propositional preprocessing time : 0.000
% 0.19/0.50 % Propositional encoding time : 0.000
% 0.19/0.50 % Propositional solver time : 0.000
% 0.19/0.50 % Success case prop preproc time : 0.000
% 0.19/0.50 % Success case prop encoding time : 0.000
% 0.19/0.50 % Success case prop solver time : 0.000
% 0.19/0.50 % Current number of processed clauses : 343
% 0.19/0.50 % Positive orientable unit clauses : 129
% 0.19/0.50 % Positive unorientable unit clauses: 0
% 0.19/0.50 % Negative unit clauses : 0
% 0.19/0.50 % Non-unit-clauses : 214
% 0.19/0.50 % Current number of unprocessed clauses: 325
% 0.19/0.50 % ...number of literals in the above : 791
% 0.19/0.50 % Current number of archived formulas : 0
% 0.19/0.50 % Current number of archived clauses : 405
% 0.19/0.50 % Clause-clause subsumption calls (NU) : 36767
% 0.19/0.50 % Rec. Clause-clause subsumption calls : 26442
% 0.19/0.50 % Non-unit clause-clause subsumptions : 37
% 0.19/0.50 % Unit Clause-clause subsumption calls : 587
% 0.19/0.50 % Rewrite failures with RHS unbound : 0
% 0.19/0.50 % BW rewrite match attempts : 88
% 0.19/0.50 % BW rewrite match successes : 53
% 0.19/0.50 % Condensation attempts : 0
% 0.19/0.50 % Condensation successes : 0
% 0.19/0.50 % Termbank termtop insertions : 21178
% 0.19/0.50 % Search garbage collected termcells : 1461
% 0.19/0.50
% 0.19/0.50 % -------------------------------------------------
% 0.19/0.50 % User time : 0.039 s
% 0.19/0.50 % System time : 0.006 s
% 0.19/0.50 % Total time : 0.045 s
% 0.19/0.50 % Maximum resident set size: 4420 pages
% 0.19/0.50
% 0.19/0.50 % -------------------------------------------------
% 0.19/0.50 % User time : 0.140 s
% 0.19/0.50 % System time : 0.026 s
% 0.19/0.50 % Total time : 0.167 s
% 0.19/0.50 % Maximum resident set size: 5120 pages
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------