%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN270-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:31 PM UTC 2026
% Result : Unsatisfiable 0.37s 0.48s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 36 ( 17 unt; 0 nHn; 32 RR)
% Number of literals : 67 ( 0 equ; 34 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 : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 44 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_029,axiom,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_029) ).
cnf(rule_057,axiom,
( ~ r0(X1)
| n1(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_057) ).
cnf(rule_176,axiom,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_176) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
cnf(rule_152,axiom,
( ~ p2(X1,X2,X1)
| ~ p0(X1,X2)
| ~ n1(X3,X2,X3)
| p2(X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_152) ).
cnf(axiom_9,axiom,
r0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
cnf(rule_267,axiom,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_267) ).
cnf(axiom_18,axiom,
p0(c,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_18) ).
cnf(rule_285,axiom,
( ~ r3(X2,X1,X2)
| ~ r0(X1)
| p4(X1,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_285) ).
cnf(prove_this,negated_conjecture,
~ p4(b,b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_11,plain,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_029]) ).
cnf(c_0_12,plain,
( ~ r0(X1)
| n1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_057]) ).
cnf(c_0_13,plain,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_176]) ).
cnf(c_0_14,plain,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
c_0_11 ).
cnf(c_0_15,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_16,axiom,
s0(b),
axiom_5 ).
cnf(c_0_17,plain,
( ~ p2(X1,X2,X1)
| ~ p0(X1,X2)
| ~ n1(X3,X2,X3)
| p2(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_152]) ).
cnf(c_0_18,plain,
( ~ r0(X1)
| n1(X1,X1,X1) ),
c_0_12 ).
cnf(c_0_19,axiom,
r0(b),
axiom_9 ).
cnf(c_0_20,plain,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
c_0_13 ).
cnf(c_0_21,plain,
m1(b,X1,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_22,plain,
( ~ p2(X1,X2,X1)
| ~ p0(X1,X2)
| ~ n1(X3,X2,X3)
| p2(X1,X2,X2) ),
c_0_17 ).
cnf(c_0_23,plain,
n1(b,b,b),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
p2(X1,b,X1),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_267]) ).
cnf(c_0_26,plain,
( ~ p0(X1,b)
| p2(X1,b,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_27,axiom,
p0(c,b),
axiom_18 ).
cnf(c_0_28,plain,
( ~ r3(X2,X1,X2)
| ~ r0(X1)
| p4(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_285]) ).
cnf(c_0_29,plain,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
c_0_25 ).
cnf(c_0_30,plain,
p2(c,b,b),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
~ p4(b,b,c),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_32,plain,
( ~ r3(X2,X1,X2)
| ~ r0(X1)
| p4(X1,X1,X2) ),
c_0_28 ).
cnf(c_0_33,plain,
r3(c,b,c),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
~ p4(b,b,c),
c_0_31 ).
cnf(c_0_35,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_19])]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN270-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.10/0.36 % Computer : n026.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 10:50:22 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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.37/0.48 % Version: 3.5.1
% 0.37/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.37/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.37/0.48 % Starting sh5l with 300s (1) cores
% 0.37/0.48 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2078622 completed with status 0
% 0.37/0.48 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.37/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.37/0.48 % No SInE strategy applied
% 0.37/0.48 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.37/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.37/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.37/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.37/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.37/0.48 % Starting new_bool_1 with 136s (1) cores
% 0.37/0.48 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2078629 completed with status 0
% 0.37/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.37/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.37/0.48 % No SInE strategy applied
% 0.37/0.48 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.37/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.37/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.37/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.37/0.48 % Preprocessing time : 0.003 s
% 0.37/0.48 % Presaturation interreduction done
% 0.37/0.48
% 0.37/0.48 % Proof found!
% 0.37/0.48 % SZS status Unsatisfiable
% 0.37/0.48 % SZS output start CNFRefutation
% See solution above
% 0.37/0.48 % Parsed axioms : 369
% 0.37/0.48 % Removed by relevancy pruning/SinE : 0
% 0.37/0.48 % Initial clauses : 369
% 0.37/0.48 % Removed in clause preprocessing : 7
% 0.37/0.48 % Initial clauses in saturation : 362
% 0.37/0.48 % Processed clauses : 906
% 0.37/0.48 % ...of these trivial : 27
% 0.37/0.48 % ...subsumed : 30
% 0.37/0.48 % ...remaining for further processing : 849
% 0.37/0.48 % Other redundant clauses eliminated : 0
% 0.37/0.48 % Clauses deleted for lack of memory : 0
% 0.37/0.48 % Backward-subsumed : 16
% 0.37/0.48 % Backward-rewritten : 72
% 0.37/0.48 % Generated clauses : 1016
% 0.37/0.48 % ...of the previous two non-redundant : 700
% 0.37/0.48 % ...aggressively subsumed : 0
% 0.37/0.48 % Contextual simplify-reflections : 2
% 0.37/0.48 % Paramodulations : 1016
% 0.37/0.48 % Factorizations : 0
% 0.37/0.48 % NegExts : 0
% 0.37/0.48 % Equation resolutions : 0
% 0.37/0.48 % Disequality decompositions : 0
% 0.37/0.48 % Total rewrite steps : 650
% 0.37/0.48 % ...of those cached : 484
% 0.37/0.48 % Propositional unsat checks : 0
% 0.37/0.48 % Propositional check models : 0
% 0.37/0.48 % Propositional check unsatisfiable : 0
% 0.37/0.48 % Propositional clauses : 0
% 0.37/0.48 % Propositional clauses after purity: 0
% 0.37/0.48 % Propositional unsat core size : 0
% 0.37/0.48 % Propositional preprocessing time : 0.000
% 0.37/0.48 % Propositional encoding time : 0.000
% 0.37/0.48 % Propositional solver time : 0.000
% 0.37/0.48 % Success case prop preproc time : 0.000
% 0.37/0.48 % Success case prop encoding time : 0.000
% 0.37/0.48 % Success case prop solver time : 0.000
% 0.37/0.48 % Current number of processed clauses : 433
% 0.37/0.48 % Positive orientable unit clauses : 139
% 0.37/0.48 % Positive unorientable unit clauses: 0
% 0.37/0.48 % Negative unit clauses : 1
% 0.37/0.48 % Non-unit-clauses : 293
% 0.37/0.48 % Current number of unprocessed clauses: 461
% 0.37/0.48 % ...number of literals in the above : 1167
% 0.37/0.48 % Current number of archived formulas : 0
% 0.37/0.48 % Current number of archived clauses : 416
% 0.37/0.48 % Clause-clause subsumption calls (NU) : 47506
% 0.37/0.48 % Rec. Clause-clause subsumption calls : 33734
% 0.37/0.48 % Non-unit clause-clause subsumptions : 40
% 0.37/0.48 % Unit Clause-clause subsumption calls : 630
% 0.37/0.48 % Rewrite failures with RHS unbound : 0
% 0.37/0.48 % BW rewrite match attempts : 103
% 0.37/0.48 % BW rewrite match successes : 60
% 0.37/0.48 % Condensation attempts : 0
% 0.37/0.48 % Condensation successes : 0
% 0.37/0.48 % Termbank termtop insertions : 26321
% 0.37/0.48 % Search garbage collected termcells : 1461
% 0.37/0.48
% 0.37/0.48 % -------------------------------------------------
% 0.37/0.48 % User time : 0.047 s
% 0.37/0.48 % System time : 0.005 s
% 0.37/0.48 % Total time : 0.052 s
% 0.37/0.48 % Maximum resident set size: 4216 pages
% 0.37/0.48
% 0.37/0.48 % -------------------------------------------------
% 0.37/0.48 % User time : 0.203 s
% 0.37/0.48 % System time : 0.022 s
% 0.37/0.48 % Total time : 0.225 s
% 0.37/0.48 % Maximum resident set size: 4864 pages
% 0.37/0.48 % E exiting
%------------------------------------------------------------------------------