%------------------------------------------------------------------------------
% File : E-SAT---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 : n010.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:59 PM UTC 2026
% Result : Unsatisfiable 0.18s 0.51s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 36 ( 15 unt; 0 nHn; 28 RR)
% Number of literals : 70 ( 0 equ; 38 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 52 ( 23 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_085,axiom,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_085) ).
cnf(rule_181,axiom,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_181) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
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_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_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
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_31,axiom,
m0(b,b,e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_31) ).
cnf(c_0_10,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_11,plain,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_181]) ).
cnf(c_0_12,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_10 ).
cnf(c_0_13,axiom,
p0(b,X1),
axiom_14 ).
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,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_273]) ).
cnf(c_0_17,plain,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
c_0_11 ).
cnf(c_0_18,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
c_0_14 ).
cnf(c_0_20,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_21,plain,
( ~ p0(X1,X1)
| s1(X1) ),
c_0_15 ).
cnf(c_0_22,plain,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
c_0_16 ).
cnf(c_0_23,plain,
q2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_24,negated_conjecture,
~ s3(b,X1),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_25,plain,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
inference(fof_simplification,[status(thm)],[rule_189]) ).
cnf(c_0_26,plain,
( ~ s1(X2)
| s1(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
s1(b),
inference(spm,[status(thm)],[c_0_21,c_0_13]) ).
cnf(c_0_28,plain,
( ~ m0(X1,X3,X2)
| ~ s2(X1)
| s3(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,axiom,
m0(b,b,e),
axiom_31 ).
cnf(c_0_30,negated_conjecture,
~ s3(b,X1),
c_0_24 ).
cnf(c_0_31,plain,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
c_0_25 ).
cnf(c_0_32,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
~ s2(b),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_34,plain,
( ~ q2(b,X1,b)
| s2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_35,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_23])]),
[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.12/0.37 % Computer : n010.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 10:48:40 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/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.51 % Version: 3.5.1
% 0.18/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.51 % Starting sh5l with 300s (1) cores
% 0.18/0.51 % new_bool_1 with pid 709187 completed with status 0
% 0.18/0.51 % Result found by new_bool_1
% 0.18/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.51 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.18/0.51 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.51 % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.51 % SubtermCWHack with pid 709189 completed with status 0
% 0.18/0.51 % Result found by SubtermCWHack
% 0.18/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.51 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.18/0.51 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.51 % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.51 % Preprocessing time : 0.004 s
% 0.18/0.51
% 0.18/0.51 % Proof found!
% 0.18/0.51 % SZS status Unsatisfiable
% 0.18/0.51 % SZS output start CNFRefutation
% See solution above
% 0.18/0.51 % Parsed axioms : 369
% 0.18/0.51 % Removed by relevancy pruning/SinE : 24
% 0.18/0.51 % Initial clauses : 345
% 0.18/0.51 % Removed in clause preprocessing : 6
% 0.18/0.51 % Initial clauses in saturation : 339
% 0.18/0.51 % Processed clauses : 1042
% 0.18/0.51 % ...of these trivial : 127
% 0.18/0.51 % ...subsumed : 116
% 0.18/0.51 % ...remaining for further processing : 799
% 0.18/0.51 % Other redundant clauses eliminated : 0
% 0.18/0.51 % Clauses deleted for lack of memory : 0
% 0.18/0.51 % Backward-subsumed : 91
% 0.18/0.51 % Backward-rewritten : 222
% 0.18/0.51 % Generated clauses : 1290
% 0.18/0.51 % ...of the previous two non-redundant : 938
% 0.18/0.51 % ...aggressively subsumed : 0
% 0.18/0.51 % Contextual simplify-reflections : 0
% 0.18/0.51 % Paramodulations : 1290
% 0.18/0.51 % Factorizations : 0
% 0.18/0.51 % NegExts : 0
% 0.18/0.51 % Equation resolutions : 0
% 0.18/0.51 % Disequality decompositions : 0
% 0.18/0.51 % Total rewrite steps : 1053
% 0.18/0.51 % ...of those cached : 707
% 0.18/0.51 % Propositional unsat checks : 0
% 0.18/0.51 % Propositional check models : 0
% 0.18/0.51 % Propositional check unsatisfiable : 0
% 0.18/0.51 % Propositional clauses : 0
% 0.18/0.51 % Propositional clauses after purity: 0
% 0.18/0.51 % Propositional unsat core size : 0
% 0.18/0.51 % Propositional preprocessing time : 0.000
% 0.18/0.51 % Propositional encoding time : 0.000
% 0.18/0.51 % Propositional solver time : 0.000
% 0.18/0.51 % Success case prop preproc time : 0.000
% 0.18/0.51 % Success case prop encoding time : 0.000
% 0.18/0.51 % Success case prop solver time : 0.000
% 0.18/0.51 % Current number of processed clauses : 486
% 0.18/0.51 % Positive orientable unit clauses : 200
% 0.18/0.51 % Positive unorientable unit clauses: 0
% 0.18/0.51 % Negative unit clauses : 2
% 0.18/0.51 % Non-unit-clauses : 284
% 0.18/0.51 % Current number of unprocessed clauses: 123
% 0.18/0.51 % ...number of literals in the above : 480
% 0.18/0.51 % Current number of archived formulas : 0
% 0.18/0.51 % Current number of archived clauses : 313
% 0.18/0.51 % Clause-clause subsumption calls (NU) : 24350
% 0.18/0.51 % Rec. Clause-clause subsumption calls : 19468
% 0.18/0.51 % Non-unit clause-clause subsumptions : 189
% 0.18/0.51 % Unit Clause-clause subsumption calls : 1828
% 0.18/0.51 % Rewrite failures with RHS unbound : 0
% 0.18/0.51 % BW rewrite match attempts : 511
% 0.18/0.51 % BW rewrite match successes : 189
% 0.18/0.51 % Condensation attempts : 0
% 0.18/0.51 % Condensation successes : 0
% 0.18/0.51 % Termbank termtop insertions : 25968
% 0.18/0.51 % Search garbage collected termcells : 1491
% 0.18/0.51
% 0.18/0.51 % -------------------------------------------------
% 0.18/0.51 % User time : 0.057 s
% 0.18/0.51 % System time : 0.006 s
% 0.18/0.51 % Total time : 0.063 s
% 0.18/0.51 % Maximum resident set size: 4420 pages
% 0.18/0.51
% 0.18/0.51 % -------------------------------------------------
% 0.18/0.51 % User time : 0.064 s
% 0.18/0.51 % System time : 0.010 s
% 0.18/0.51 % Total time : 0.074 s
% 0.18/0.51 % Maximum resident set size: 4864 pages
% 0.18/0.51 % E exiting
%------------------------------------------------------------------------------