%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN228-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:49 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.46s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 23 ( 12 unt; 0 nHn; 18 RR)
% Number of literals : 40 ( 0 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 28 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_007,axiom,
( ~ r0(X1)
| ~ p0(X3,X2)
| m1(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_007) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_176,axiom,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_176) ).
cnf(axiom_13,axiom,
r0(e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_13) ).
cnf(rule_215,axiom,
( ~ p2(X1,X2,X1)
| ~ r0(X1)
| l3(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_215) ).
cnf(prove_this,negated_conjecture,
~ l3(b,e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_9,axiom,
r0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
cnf(c_0_7,plain,
( ~ r0(X1)
| ~ p0(X3,X2)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_007]) ).
cnf(c_0_8,plain,
( ~ r0(X1)
| ~ p0(X3,X2)
| m1(X1,X2,X1) ),
c_0_7 ).
cnf(c_0_9,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_10,plain,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_176]) ).
cnf(c_0_11,plain,
( ~ r0(X1)
| m1(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
r0(e),
axiom_13 ).
cnf(c_0_13,plain,
( ~ p2(X1,X2,X1)
| ~ r0(X1)
| l3(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_215]) ).
cnf(c_0_14,plain,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
c_0_10 ).
cnf(c_0_15,plain,
m1(e,X1,e),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
~ l3(b,e),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_17,plain,
( ~ p2(X1,X2,X1)
| ~ r0(X1)
| l3(X1,X2) ),
c_0_13 ).
cnf(c_0_18,plain,
p2(X1,e,X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
~ l3(b,e),
c_0_16 ).
cnf(c_0_20,plain,
( ~ r0(X1)
| l3(X1,e) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
r0(b),
axiom_9 ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN228-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n019.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.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 10:46:35 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.09/0.46 % Version: 3.5.1
% 0.09/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.09/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.09/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.46 % Starting sh5l with 300s (1) cores
% 0.09/0.46 % new_bool_3 with pid 2368669 completed with status 0
% 0.09/0.46 % Result found by new_bool_3
% 0.09/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.09/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.09/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.46 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.09/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.46 % SubtermCWHack with pid 2368675 completed with status 0
% 0.09/0.46 % Result found by SubtermCWHack
% 0.09/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.09/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.09/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.46 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.09/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.46 % Preprocessing time : 0.003 s
% 0.09/0.46
% 0.09/0.46 % Proof found!
% 0.09/0.46 % SZS status Unsatisfiable
% 0.09/0.46 % SZS output start CNFRefutation
% See solution above
% 0.09/0.46 % Parsed axioms : 369
% 0.09/0.46 % Removed by relevancy pruning/SinE : 30
% 0.09/0.46 % Initial clauses : 339
% 0.09/0.46 % Removed in clause preprocessing : 6
% 0.09/0.46 % Initial clauses in saturation : 333
% 0.09/0.46 % Processed clauses : 339
% 0.09/0.46 % ...of these trivial : 49
% 0.09/0.46 % ...subsumed : 4
% 0.09/0.46 % ...remaining for further processing : 286
% 0.09/0.46 % Other redundant clauses eliminated : 0
% 0.09/0.46 % Clauses deleted for lack of memory : 0
% 0.09/0.46 % Backward-subsumed : 15
% 0.09/0.46 % Backward-rewritten : 123
% 0.09/0.46 % Generated clauses : 269
% 0.09/0.46 % ...of the previous two non-redundant : 178
% 0.09/0.46 % ...aggressively subsumed : 0
% 0.09/0.46 % Contextual simplify-reflections : 0
% 0.09/0.46 % Paramodulations : 269
% 0.09/0.46 % Factorizations : 0
% 0.09/0.46 % NegExts : 0
% 0.09/0.46 % Equation resolutions : 0
% 0.09/0.46 % Disequality decompositions : 0
% 0.09/0.46 % Total rewrite steps : 327
% 0.09/0.46 % ...of those cached : 168
% 0.09/0.46 % Propositional unsat checks : 0
% 0.09/0.46 % Propositional check models : 0
% 0.09/0.46 % Propositional check unsatisfiable : 0
% 0.09/0.46 % Propositional clauses : 0
% 0.09/0.46 % Propositional clauses after purity: 0
% 0.09/0.46 % Propositional unsat core size : 0
% 0.09/0.46 % Propositional preprocessing time : 0.000
% 0.09/0.46 % Propositional encoding time : 0.000
% 0.09/0.46 % Propositional solver time : 0.000
% 0.09/0.46 % Success case prop preproc time : 0.000
% 0.09/0.46 % Success case prop encoding time : 0.000
% 0.09/0.46 % Success case prop solver time : 0.000
% 0.09/0.46 % Current number of processed clauses : 148
% 0.09/0.46 % Positive orientable unit clauses : 92
% 0.09/0.46 % Positive unorientable unit clauses: 0
% 0.09/0.46 % Negative unit clauses : 1
% 0.09/0.46 % Non-unit-clauses : 55
% 0.09/0.46 % Current number of unprocessed clauses: 155
% 0.09/0.46 % ...number of literals in the above : 568
% 0.09/0.46 % Current number of archived formulas : 0
% 0.09/0.46 % Current number of archived clauses : 138
% 0.09/0.46 % Clause-clause subsumption calls (NU) : 1776
% 0.09/0.46 % Rec. Clause-clause subsumption calls : 1553
% 0.09/0.46 % Non-unit clause-clause subsumptions : 13
% 0.09/0.46 % Unit Clause-clause subsumption calls : 447
% 0.09/0.46 % Rewrite failures with RHS unbound : 0
% 0.09/0.46 % BW rewrite match attempts : 155
% 0.09/0.46 % BW rewrite match successes : 104
% 0.09/0.46 % Condensation attempts : 0
% 0.09/0.46 % Condensation successes : 0
% 0.09/0.46 % Termbank termtop insertions : 13934
% 0.09/0.46 % Search garbage collected termcells : 1501
% 0.09/0.46
% 0.09/0.46 % -------------------------------------------------
% 0.09/0.46 % User time : 0.012 s
% 0.09/0.46 % System time : 0.007 s
% 0.09/0.46 % Total time : 0.019 s
% 0.09/0.46 % Maximum resident set size: 4472 pages
% 0.09/0.46
% 0.09/0.46 % -------------------------------------------------
% 0.09/0.46 % User time : 0.019 s
% 0.09/0.46 % System time : 0.011 s
% 0.09/0.46 % Total time : 0.030 s
% 0.09/0.46 % Maximum resident set size: 4864 pages
% 0.09/0.46 % E exiting
%------------------------------------------------------------------------------