%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN299-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 : n004.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.13s 0.48s
% Output : CNFRefutation 0.13s
% 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 : 70 ( 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 : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 38 ( 9 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_15,axiom,
n0(a,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_15) ).
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(rule_125,axiom,
( ~ p0(X1,X1)
| s1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_125) ).
cnf(prove_this,negated_conjecture,
~ s3(b,a),
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_38,axiom,
m0(b,a,a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_38) ).
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(a,b),
axiom_15 ).
cnf(c_0_18,plain,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_273]) ).
cnf(c_0_19,plain,
( ~ n1(X1,X1,X2)
| ~ k1(X2)
| q2(X1,X1,X1) ),
c_0_13 ).
cnf(c_0_20,plain,
n1(b,b,b),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
k1(b),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( ~ p0(X1,X1)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_23,plain,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
c_0_18 ).
cnf(c_0_24,plain,
q2(b,b,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_25,negated_conjecture,
~ s3(b,a),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_26,plain,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
inference(fof_simplification,[status(thm)],[rule_189]) ).
cnf(c_0_27,plain,
( ~ p0(X1,X1)
| s1(X1) ),
c_0_22 ).
cnf(c_0_28,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_29,plain,
( ~ m0(b,X2,X1)
| ~ s2(b)
| s3(b,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,axiom,
m0(b,a,a),
axiom_38 ).
cnf(c_0_31,negated_conjecture,
~ s3(b,a),
c_0_25 ).
cnf(c_0_32,plain,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
c_0_26 ).
cnf(c_0_33,plain,
s1(b),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
~ s2(b),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_35,plain,
( ~ q2(b,X1,b)
| s2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_36,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN299-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.36 % Computer : n004.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 10:48:20 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.48 % Version: 3.5.1
% 0.13/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.48 % Starting sh5l with 300s (1) cores
% 0.13/0.48 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2956619 completed with status 0
% 0.13/0.48 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.13/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.48 % No SInE strategy applied
% 0.13/0.48 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.13/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.13/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.48 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.48 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2956626 completed with status 0
% 0.13/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.13/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.48 % No SInE strategy applied
% 0.13/0.48 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.13/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.13/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.48 % Preprocessing time : 0.003 s
% 0.13/0.48 % Presaturation interreduction done
% 0.13/0.48
% 0.13/0.48 % Proof found!
% 0.13/0.48 % SZS status Unsatisfiable
% 0.13/0.48 % SZS output start CNFRefutation
% See solution above
% 0.13/0.48 % Parsed axioms : 369
% 0.13/0.48 % Removed by relevancy pruning/SinE : 0
% 0.13/0.48 % Initial clauses : 369
% 0.13/0.48 % Removed in clause preprocessing : 7
% 0.13/0.48 % Initial clauses in saturation : 362
% 0.13/0.48 % Processed clauses : 1017
% 0.13/0.48 % ...of these trivial : 32
% 0.13/0.48 % ...subsumed : 44
% 0.13/0.48 % ...remaining for further processing : 941
% 0.13/0.48 % Other redundant clauses eliminated : 0
% 0.13/0.48 % Clauses deleted for lack of memory : 0
% 0.13/0.48 % Backward-subsumed : 41
% 0.13/0.48 % Backward-rewritten : 250
% 0.13/0.48 % Generated clauses : 1240
% 0.13/0.48 % ...of the previous two non-redundant : 891
% 0.13/0.48 % ...aggressively subsumed : 0
% 0.13/0.48 % Contextual simplify-reflections : 2
% 0.13/0.48 % Paramodulations : 1240
% 0.13/0.48 % Factorizations : 0
% 0.13/0.48 % NegExts : 0
% 0.13/0.48 % Equation resolutions : 0
% 0.13/0.48 % Disequality decompositions : 0
% 0.13/0.48 % Total rewrite steps : 943
% 0.13/0.48 % ...of those cached : 681
% 0.13/0.48 % Propositional unsat checks : 0
% 0.13/0.48 % Propositional check models : 0
% 0.13/0.48 % Propositional check unsatisfiable : 0
% 0.13/0.48 % Propositional clauses : 0
% 0.13/0.48 % Propositional clauses after purity: 0
% 0.13/0.48 % Propositional unsat core size : 0
% 0.13/0.48 % Propositional preprocessing time : 0.000
% 0.13/0.48 % Propositional encoding time : 0.000
% 0.13/0.48 % Propositional solver time : 0.000
% 0.13/0.48 % Success case prop preproc time : 0.000
% 0.13/0.48 % Success case prop encoding time : 0.000
% 0.13/0.48 % Success case prop solver time : 0.000
% 0.13/0.48 % Current number of processed clauses : 322
% 0.13/0.48 % Positive orientable unit clauses : 134
% 0.13/0.48 % Positive unorientable unit clauses: 0
% 0.13/0.48 % Negative unit clauses : 2
% 0.13/0.48 % Non-unit-clauses : 186
% 0.13/0.48 % Current number of unprocessed clauses: 506
% 0.13/0.48 % ...number of literals in the above : 1263
% 0.13/0.48 % Current number of archived formulas : 0
% 0.13/0.48 % Current number of archived clauses : 619
% 0.13/0.48 % Clause-clause subsumption calls (NU) : 51856
% 0.13/0.48 % Rec. Clause-clause subsumption calls : 36852
% 0.13/0.48 % Non-unit clause-clause subsumptions : 79
% 0.13/0.48 % Unit Clause-clause subsumption calls : 3657
% 0.13/0.48 % Rewrite failures with RHS unbound : 0
% 0.13/0.48 % BW rewrite match attempts : 395
% 0.13/0.48 % BW rewrite match successes : 139
% 0.13/0.48 % Condensation attempts : 0
% 0.13/0.48 % Condensation successes : 0
% 0.13/0.48 % Termbank termtop insertions : 28227
% 0.13/0.48 % Search garbage collected termcells : 1461
% 0.13/0.48
% 0.13/0.48 % -------------------------------------------------
% 0.13/0.48 % User time : 0.051 s
% 0.13/0.48 % System time : 0.007 s
% 0.13/0.48 % Total time : 0.058 s
% 0.13/0.48 % Maximum resident set size: 4472 pages
% 0.13/0.48
% 0.13/0.48 % -------------------------------------------------
% 0.13/0.48 % User time : 0.206 s
% 0.13/0.48 % System time : 0.032 s
% 0.13/0.48 % Total time : 0.238 s
% 0.13/0.48 % Maximum resident set size: 5120 pages
% 0.13/0.48 % E exiting
%------------------------------------------------------------------------------