%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN207-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 : n001.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:46 PM UTC 2026
% Result : Unsatisfiable 0.50s 0.49s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of clauses : 59 ( 24 unt; 0 nHn; 49 RR)
% Number of literals : 121 ( 0 equ; 65 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 91 ( 36 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_002,axiom,
( ~ n0(X2,X1)
| l1(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_002) ).
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(rule_186,axiom,
( ~ l1(X2,X1)
| q2(X1,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_186) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
cnf(rule_189,axiom,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_189) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
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(axiom_7,axiom,
n0(d,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_7) ).
cnf(prove_this,negated_conjecture,
~ s3(c,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_16,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_17,plain,
( ~ p0(X1,X1)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_18,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
c_0_16 ).
cnf(c_0_19,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_20,plain,
( ~ p0(X1,X1)
| s1(X1) ),
c_0_17 ).
cnf(c_0_21,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_22,plain,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_133]) ).
cnf(c_0_23,plain,
( ~ s1(X2)
| s1(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
s1(b),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
c_0_22 ).
cnf(c_0_26,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_002]) ).
cnf(c_0_28,plain,
( ~ l2(X2,X1)
| ~ l0(c)
| ~ k1(X2)
| q2(X1,c,X2) ),
inference(fof_simplification,[status(thm)],[rule_183]) ).
cnf(c_0_29,plain,
( ~ m0(X3,X4,X1)
| ~ p0(X2,X2)
| l2(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_30,plain,
( ~ l1(X2,X1)
| q2(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_186]) ).
cnf(c_0_31,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
c_0_27 ).
cnf(c_0_32,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_33,plain,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
inference(fof_simplification,[status(thm)],[rule_189]) ).
cnf(c_0_34,plain,
( ~ l2(X2,X1)
| ~ l0(c)
| ~ k1(X2)
| q2(X1,c,X2) ),
c_0_28 ).
cnf(c_0_35,axiom,
l0(c),
axiom_24 ).
cnf(c_0_36,plain,
( ~ m0(X2,X3,X1)
| l2(X1,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_21]) ).
cnf(c_0_37,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_38,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_39,plain,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_273]) ).
cnf(c_0_40,plain,
( ~ l1(X2,X1)
| q2(X1,X1,X2) ),
c_0_30 ).
cnf(c_0_41,plain,
l1(c,c),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_42,plain,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
c_0_33 ).
cnf(c_0_43,plain,
( ~ k1(X2)
| ~ l2(X2,X1)
| q2(X1,c,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_44,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_38 ).
cnf(c_0_46,axiom,
n0(d,b),
axiom_7 ).
cnf(c_0_47,plain,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
c_0_39 ).
cnf(c_0_48,plain,
q2(c,c,c),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_49,plain,
( ~ q2(b,X1,b)
| s2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_24])]) ).
cnf(c_0_50,plain,
( ~ k1(X1)
| q2(X1,c,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,plain,
k1(b),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,plain,
( ~ m0(c,X2,X1)
| ~ s2(c)
| s3(c,X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
s2(c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_54,negated_conjecture,
~ s3(c,c),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_55,plain,
( ~ m0(c,X2,X1)
| s3(c,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]) ).
cnf(c_0_56,negated_conjecture,
~ s3(c,c),
c_0_54 ).
cnf(c_0_57,plain,
s3(c,X1),
inference(spm,[status(thm)],[c_0_55,c_0_37]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN207-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.09/0.36 % Computer : n001.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 10:52:00 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.50/0.49 % Version: 3.5.1
% 0.50/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.50/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.50/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.50/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.50/0.49 % Starting sh5l with 300s (1) cores
% 0.50/0.49 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2934095 completed with status 0
% 0.50/0.49 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.50/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.50/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.50/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.50/0.49 % No SInE strategy applied
% 0.50/0.49 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.50/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.50/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.50/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.50/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.50/0.49 % Starting new_bool_1 with 136s (1) cores
% 0.50/0.49 % new_bool_3 with pid 2934103 completed with status 0
% 0.50/0.49 % Result found by new_bool_3
% 0.50/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.50/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.50/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.50/0.49 % No SInE strategy applied
% 0.50/0.49 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.50/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.50/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.50/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.50/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.50/0.49 % Preprocessing time : 0.003 s
% 0.50/0.49 % Presaturation interreduction done
% 0.50/0.49
% 0.50/0.49 % Proof found!
% 0.50/0.49 % SZS status Unsatisfiable
% 0.50/0.49 % SZS output start CNFRefutation
% See solution above
% 0.50/0.49 % Parsed axioms : 369
% 0.50/0.49 % Removed by relevancy pruning/SinE : 0
% 0.50/0.49 % Initial clauses : 369
% 0.50/0.49 % Removed in clause preprocessing : 7
% 0.50/0.49 % Initial clauses in saturation : 362
% 0.50/0.49 % Processed clauses : 993
% 0.50/0.49 % ...of these trivial : 61
% 0.50/0.49 % ...subsumed : 30
% 0.50/0.49 % ...remaining for further processing : 902
% 0.50/0.49 % Other redundant clauses eliminated : 0
% 0.50/0.49 % Clauses deleted for lack of memory : 0
% 0.50/0.49 % Backward-subsumed : 50
% 0.50/0.49 % Backward-rewritten : 223
% 0.50/0.49 % Generated clauses : 1049
% 0.50/0.49 % ...of the previous two non-redundant : 761
% 0.50/0.49 % ...aggressively subsumed : 0
% 0.50/0.49 % Contextual simplify-reflections : 2
% 0.50/0.49 % Paramodulations : 1049
% 0.50/0.49 % Factorizations : 0
% 0.50/0.49 % NegExts : 0
% 0.50/0.49 % Equation resolutions : 0
% 0.50/0.49 % Disequality decompositions : 0
% 0.50/0.49 % Total rewrite steps : 843
% 0.50/0.49 % ...of those cached : 578
% 0.50/0.49 % Propositional unsat checks : 0
% 0.50/0.49 % Propositional check models : 0
% 0.50/0.49 % Propositional check unsatisfiable : 0
% 0.50/0.49 % Propositional clauses : 0
% 0.50/0.49 % Propositional clauses after purity: 0
% 0.50/0.49 % Propositional unsat core size : 0
% 0.50/0.49 % Propositional preprocessing time : 0.000
% 0.50/0.49 % Propositional encoding time : 0.000
% 0.50/0.49 % Propositional solver time : 0.000
% 0.50/0.49 % Success case prop preproc time : 0.000
% 0.50/0.49 % Success case prop encoding time : 0.000
% 0.50/0.49 % Success case prop solver time : 0.000
% 0.50/0.49 % Current number of processed clauses : 301
% 0.50/0.49 % Positive orientable unit clauses : 126
% 0.50/0.49 % Positive unorientable unit clauses: 0
% 0.50/0.49 % Negative unit clauses : 0
% 0.50/0.49 % Non-unit-clauses : 175
% 0.50/0.49 % Current number of unprocessed clauses: 368
% 0.50/0.49 % ...number of literals in the above : 955
% 0.50/0.49 % Current number of archived formulas : 0
% 0.50/0.49 % Current number of archived clauses : 601
% 0.50/0.49 % Clause-clause subsumption calls (NU) : 47371
% 0.50/0.49 % Rec. Clause-clause subsumption calls : 33328
% 0.50/0.49 % Non-unit clause-clause subsumptions : 65
% 0.50/0.49 % Unit Clause-clause subsumption calls : 3463
% 0.50/0.49 % Rewrite failures with RHS unbound : 0
% 0.50/0.49 % BW rewrite match attempts : 395
% 0.50/0.49 % BW rewrite match successes : 146
% 0.50/0.49 % Condensation attempts : 0
% 0.50/0.49 % Condensation successes : 0
% 0.50/0.49 % Termbank termtop insertions : 26099
% 0.50/0.49 % Search garbage collected termcells : 1461
% 0.50/0.49
% 0.50/0.49 % -------------------------------------------------
% 0.50/0.49 % User time : 0.050 s
% 0.50/0.49 % System time : 0.006 s
% 0.50/0.49 % Total time : 0.055 s
% 0.50/0.49 % Maximum resident set size: 4420 pages
% 0.50/0.49
% 0.50/0.49 % -------------------------------------------------
% 0.50/0.49 % User time : 0.215 s
% 0.50/0.49 % System time : 0.024 s
% 0.50/0.49 % Total time : 0.239 s
% 0.50/0.49 % Maximum resident set size: 5120 pages
% 0.50/0.49 % E exiting
%------------------------------------------------------------------------------