%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN298-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 : n026.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:35 PM UTC 2026
% Result : Unsatisfiable 0.18s 0.49s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 37 ( 17 unt; 0 nHn; 35 RR)
% Number of literals : 69 ( 0 equ; 37 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 43 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_057,axiom,
( ~ r0(X1)
| n1(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_057) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
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_9,axiom,
r0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
cnf(axiom_7,axiom,
n0(d,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_7) ).
cnf(rule_125,axiom,
( ~ p0(X1,X1)
| s1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_125) ).
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(b,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
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_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(axiom_31,axiom,
m0(b,b,e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_31) ).
cnf(c_0_11,plain,
( ~ r0(X1)
| n1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_057]) ).
cnf(c_0_12,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_13,plain,
( ~ n1(X1,X1,X2)
| ~ k1(X2)
| q2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_179]) ).
cnf(c_0_14,plain,
( ~ r0(X1)
| n1(X1,X1,X1) ),
c_0_11 ).
cnf(c_0_15,axiom,
r0(b),
axiom_9 ).
cnf(c_0_16,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_12 ).
cnf(c_0_17,axiom,
n0(d,b),
axiom_7 ).
cnf(c_0_18,plain,
( ~ p0(X1,X1)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_19,plain,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_273]) ).
cnf(c_0_20,plain,
( ~ n1(X1,X1,X2)
| ~ k1(X2)
| q2(X1,X1,X1) ),
c_0_13 ).
cnf(c_0_21,plain,
n1(b,b,b),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
k1(b),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
~ s3(b,X1),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_24,plain,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
inference(fof_simplification,[status(thm)],[rule_189]) ).
cnf(c_0_25,plain,
( ~ p0(X1,X1)
| s1(X1) ),
c_0_18 ).
cnf(c_0_26,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_27,plain,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
c_0_19 ).
cnf(c_0_28,plain,
q2(b,b,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_29,negated_conjecture,
~ s3(b,X1),
c_0_23 ).
cnf(c_0_30,plain,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
c_0_24 ).
cnf(c_0_31,plain,
s1(b),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
( ~ m0(b,X1,X2)
| ~ s2(b) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_33,plain,
( ~ q2(b,X1,b)
| s2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_34,axiom,
m0(b,b,e),
axiom_31 ).
cnf(c_0_35,plain,
~ m0(b,X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_28])]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[c_0_34,c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN298-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 : n026.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:51:07 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/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.18/0.49 % Version: 3.5.1
% 0.18/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 % Starting sh5l with 300s (1) cores
% 0.18/0.49 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2081079 completed with status 0
% 0.18/0.49 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.18/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.49 % No SInE strategy applied
% 0.18/0.49 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.18/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.18/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.18/0.49 % Starting new_bool_1 with 136s (1) cores
% 0.18/0.49 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2081086 completed with status 0
% 0.18/0.49 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.18/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.49 % No SInE strategy applied
% 0.18/0.49 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.18/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.18/0.49 % Preprocessing time : 0.003 s
% 0.18/0.49 % Presaturation interreduction done
% 0.18/0.49
% 0.18/0.49 % Proof found!
% 0.18/0.49 % SZS status Unsatisfiable
% 0.18/0.49 % SZS output start CNFRefutation
% See solution above
% 0.18/0.49 % Parsed axioms : 369
% 0.18/0.49 % Removed by relevancy pruning/SinE : 0
% 0.18/0.49 % Initial clauses : 369
% 0.18/0.49 % Removed in clause preprocessing : 7
% 0.18/0.49 % Initial clauses in saturation : 362
% 0.18/0.49 % Processed clauses : 783
% 0.18/0.49 % ...of these trivial : 20
% 0.18/0.49 % ...subsumed : 24
% 0.18/0.49 % ...remaining for further processing : 739
% 0.18/0.49 % Other redundant clauses eliminated : 0
% 0.18/0.49 % Clauses deleted for lack of memory : 0
% 0.18/0.49 % Backward-subsumed : 17
% 0.18/0.49 % Backward-rewritten : 59
% 0.18/0.49 % Generated clauses : 602
% 0.18/0.49 % ...of the previous two non-redundant : 408
% 0.18/0.49 % ...aggressively subsumed : 0
% 0.18/0.49 % Contextual simplify-reflections : 2
% 0.18/0.49 % Paramodulations : 600
% 0.18/0.49 % Factorizations : 0
% 0.18/0.49 % NegExts : 0
% 0.18/0.49 % Equation resolutions : 0
% 0.18/0.49 % Disequality decompositions : 0
% 0.18/0.49 % Total rewrite steps : 430
% 0.18/0.49 % ...of those cached : 289
% 0.18/0.49 % Propositional unsat checks : 0
% 0.18/0.49 % Propositional check models : 0
% 0.18/0.49 % Propositional check unsatisfiable : 0
% 0.18/0.49 % Propositional clauses : 0
% 0.18/0.49 % Propositional clauses after purity: 0
% 0.18/0.49 % Propositional unsat core size : 0
% 0.18/0.49 % Propositional preprocessing time : 0.000
% 0.18/0.49 % Propositional encoding time : 0.000
% 0.18/0.49 % Propositional solver time : 0.000
% 0.18/0.49 % Success case prop preproc time : 0.000
% 0.18/0.49 % Success case prop encoding time : 0.000
% 0.18/0.49 % Success case prop solver time : 0.000
% 0.18/0.49 % Current number of processed clauses : 333
% 0.18/0.49 % Positive orientable unit clauses : 131
% 0.18/0.49 % Positive unorientable unit clauses: 0
% 0.18/0.49 % Negative unit clauses : 2
% 0.18/0.49 % Non-unit-clauses : 200
% 0.18/0.49 % Current number of unprocessed clauses: 298
% 0.18/0.49 % ...number of literals in the above : 764
% 0.18/0.49 % Current number of archived formulas : 0
% 0.18/0.49 % Current number of archived clauses : 406
% 0.18/0.49 % Clause-clause subsumption calls (NU) : 36703
% 0.18/0.49 % Rec. Clause-clause subsumption calls : 26511
% 0.18/0.49 % Non-unit clause-clause subsumptions : 32
% 0.18/0.49 % Unit Clause-clause subsumption calls : 527
% 0.18/0.49 % Rewrite failures with RHS unbound : 0
% 0.18/0.49 % BW rewrite match attempts : 86
% 0.18/0.49 % BW rewrite match successes : 51
% 0.18/0.49 % Condensation attempts : 0
% 0.18/0.49 % Condensation successes : 0
% 0.18/0.49 % Termbank termtop insertions : 20989
% 0.18/0.49 % Search garbage collected termcells : 1461
% 0.18/0.49
% 0.18/0.49 % -------------------------------------------------
% 0.18/0.49 % User time : 0.034 s
% 0.18/0.49 % System time : 0.010 s
% 0.18/0.49 % Total time : 0.044 s
% 0.18/0.49 % Maximum resident set size: 4472 pages
% 0.18/0.49
% 0.18/0.49 % -------------------------------------------------
% 0.18/0.49 % User time : 0.158 s
% 0.18/0.49 % System time : 0.028 s
% 0.18/0.49 % Total time : 0.186 s
% 0.18/0.49 % Maximum resident set size: 4864 pages
% 0.18/0.49 % E exiting
%------------------------------------------------------------------------------