%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN191-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 : n012.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:44 PM UTC 2026
% Result : Unsatisfiable 0.07s 0.55s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 21
% Syntax : Number of clauses : 73 ( 30 unt; 0 nHn; 59 RR)
% Number of literals : 148 ( 0 equ; 78 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 110 ( 38 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_137,axiom,
( ~ p1(X2,X3,X1)
| n2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(rule_174,axiom,
( ~ k1(e)
| ~ n2(X1)
| p2(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_174) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_30) ).
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_110,axiom,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_110) ).
cnf(rule_267,axiom,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_267) ).
cnf(rule_127,axiom,
( ~ k2(X4,X2)
| ~ k1(X4)
| ~ m1(X3,X2,X1)
| k2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_127) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
cnf(rule_129,axiom,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_129) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_124,axiom,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_124) ).
cnf(rule_272,axiom,
( ~ r3(X3,X1,X1)
| ~ r2(X3)
| ~ k2(X2,X3)
| r3(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_272) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
cnf(rule_188,axiom,
( ~ l0(X1)
| ~ r1(X1)
| r2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_188) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(prove_this,negated_conjecture,
~ r3(c,b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(c_0_21,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_22,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_23,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_21 ).
cnf(c_0_24,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_25,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_26,plain,
( ~ k1(e)
| ~ n2(X1)
| p2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_174]) ).
cnf(c_0_27,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
c_0_22 ).
cnf(c_0_28,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_25 ).
cnf(c_0_30,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_31,plain,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_029]) ).
cnf(c_0_32,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_110]) ).
cnf(c_0_33,plain,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_267]) ).
cnf(c_0_34,plain,
( ~ k1(e)
| ~ n2(X1)
| p2(X1,X1,X1) ),
c_0_26 ).
cnf(c_0_35,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,plain,
k1(e),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
( ~ k2(X4,X2)
| ~ k1(X4)
| ~ m1(X3,X2,X1)
| k2(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_127]) ).
cnf(c_0_38,plain,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
c_0_31 ).
cnf(c_0_39,axiom,
s0(b),
axiom_5 ).
cnf(c_0_40,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_129]) ).
cnf(c_0_41,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
c_0_32 ).
cnf(c_0_42,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_43,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
inference(fof_simplification,[status(thm)],[rule_124]) ).
cnf(c_0_44,plain,
( ~ r3(X3,X1,X1)
| ~ r2(X3)
| ~ k2(X2,X3)
| r3(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[rule_272]) ).
cnf(c_0_45,plain,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
c_0_33 ).
cnf(c_0_46,plain,
p2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_47,plain,
( ~ k2(X4,X2)
| ~ k1(X4)
| ~ m1(X3,X2,X1)
| k2(X1,X2) ),
c_0_37 ).
cnf(c_0_48,plain,
m1(b,X1,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_24]),c_0_39])]) ).
cnf(c_0_49,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
c_0_40 ).
cnf(c_0_50,plain,
q1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_51,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
c_0_43 ).
cnf(c_0_52,axiom,
s0(d),
axiom_1 ).
cnf(c_0_53,plain,
( ~ r3(X3,X1,X1)
| ~ r2(X3)
| ~ k2(X2,X3)
| r3(X1,X2,X3) ),
c_0_44 ).
cnf(c_0_54,plain,
r3(X1,X1,X1),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_55,plain,
( ~ k1(X2)
| ~ k2(X2,X1)
| k2(b,X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_56,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,plain,
( ~ l0(X1)
| ~ r1(X1)
| r2(X1) ),
inference(fof_simplification,[status(thm)],[rule_188]) ).
cnf(c_0_58,plain,
( ~ q0(X1,X2)
| ~ q1(d,X2,d)
| r1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).
cnf(c_0_59,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_60,plain,
( ~ k2(X2,X1)
| ~ r2(X1)
| r3(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_61,plain,
( ~ k1(X1)
| k2(b,X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,plain,
( ~ l0(X1)
| ~ r1(X1)
| r2(X1) ),
c_0_57 ).
cnf(c_0_63,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_50])]) ).
cnf(c_0_64,negated_conjecture,
~ r3(c,b,c),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_65,plain,
( ~ k1(X1)
| ~ r2(X1)
| r3(X1,b,X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,plain,
( ~ l0(X1)
| r2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63])]) ).
cnf(c_0_67,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_68,negated_conjecture,
~ r3(c,b,c),
c_0_64 ).
cnf(c_0_69,plain,
( ~ l0(X1)
| ~ k1(X1)
| r3(X1,b,X1) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_70,plain,
k1(c),
inference(spm,[status(thm)],[c_0_29,c_0_67]) ).
cnf(c_0_71,axiom,
l0(c),
axiom_24 ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN191-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.48 % Computer : n012.cluster.edu
% 0.03/0.48 % Model : x86_64 x86_64
% 0.03/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.48 % Memory : 8046.5625MB
% 0.03/0.48 % OS : Linux 6.8.0-71-generic
% 0.03/0.48 % CPULimit : 300
% 0.03/0.48 % WCLimit : 300
% 0.03/0.48 % DateTime : Mon Sep 21 10:45:08 UTC 2026
% 0.03/0.48 % CPUTime :
% 0.03/0.48 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.50 Running first-order theorem proving
% 0.03/0.50 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.07/0.55 % Version: 3.5.1
% 0.07/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.07/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.07/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.55 % Starting sh5l with 300s (1) cores
% 0.07/0.55 % new_bool_3 with pid 2191298 completed with status 0
% 0.07/0.55 % Result found by new_bool_3
% 0.07/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.07/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.07/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.55 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.07/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.55 % SubtermCWHack with pid 2191303 completed with status 0
% 0.07/0.55 % Result found by SubtermCWHack
% 0.07/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.07/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.07/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.55 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.07/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.55 % Preprocessing time : 0.002 s
% 0.07/0.55
% 0.07/0.55 % Proof found!
% 0.07/0.55 % SZS status Unsatisfiable
% 0.07/0.55 % SZS output start CNFRefutation
% See solution above
% 0.07/0.55 % Parsed axioms : 369
% 0.07/0.55 % Removed by relevancy pruning/SinE : 38
% 0.07/0.55 % Initial clauses : 331
% 0.07/0.55 % Removed in clause preprocessing : 5
% 0.07/0.55 % Initial clauses in saturation : 326
% 0.07/0.55 % Processed clauses : 923
% 0.07/0.55 % ...of these trivial : 112
% 0.07/0.55 % ...subsumed : 97
% 0.07/0.55 % ...remaining for further processing : 714
% 0.07/0.55 % Other redundant clauses eliminated : 0
% 0.07/0.55 % Clauses deleted for lack of memory : 0
% 0.07/0.55 % Backward-subsumed : 72
% 0.07/0.55 % Backward-rewritten : 190
% 0.07/0.55 % Generated clauses : 1107
% 0.07/0.55 % ...of the previous two non-redundant : 780
% 0.07/0.55 % ...aggressively subsumed : 0
% 0.07/0.55 % Contextual simplify-reflections : 1
% 0.07/0.55 % Paramodulations : 1107
% 0.07/0.55 % Factorizations : 0
% 0.07/0.55 % NegExts : 0
% 0.07/0.55 % Equation resolutions : 0
% 0.07/0.55 % Disequality decompositions : 0
% 0.07/0.55 % Total rewrite steps : 921
% 0.07/0.55 % ...of those cached : 612
% 0.07/0.55 % Propositional unsat checks : 0
% 0.07/0.55 % Propositional check models : 0
% 0.07/0.55 % Propositional check unsatisfiable : 0
% 0.07/0.55 % Propositional clauses : 0
% 0.07/0.55 % Propositional clauses after purity: 0
% 0.07/0.55 % Propositional unsat core size : 0
% 0.07/0.55 % Propositional preprocessing time : 0.000
% 0.07/0.55 % Propositional encoding time : 0.000
% 0.07/0.55 % Propositional solver time : 0.000
% 0.07/0.55 % Success case prop preproc time : 0.000
% 0.07/0.55 % Success case prop encoding time : 0.000
% 0.07/0.55 % Success case prop solver time : 0.000
% 0.07/0.55 % Current number of processed clauses : 452
% 0.07/0.55 % Positive orientable unit clauses : 183
% 0.07/0.55 % Positive unorientable unit clauses: 0
% 0.07/0.55 % Negative unit clauses : 2
% 0.07/0.55 % Non-unit-clauses : 267
% 0.07/0.55 % Current number of unprocessed clauses: 95
% 0.07/0.55 % ...number of literals in the above : 399
% 0.07/0.55 % Current number of archived formulas : 0
% 0.07/0.55 % Current number of archived clauses : 262
% 0.07/0.55 % Clause-clause subsumption calls (NU) : 20110
% 0.07/0.55 % Rec. Clause-clause subsumption calls : 16309
% 0.07/0.55 % Non-unit clause-clause subsumptions : 158
% 0.07/0.55 % Unit Clause-clause subsumption calls : 1103
% 0.07/0.55 % Rewrite failures with RHS unbound : 0
% 0.07/0.55 % BW rewrite match attempts : 314
% 0.07/0.55 % BW rewrite match successes : 163
% 0.07/0.55 % Condensation attempts : 0
% 0.07/0.55 % Condensation successes : 0
% 0.07/0.55 % Termbank termtop insertions : 23604
% 0.07/0.55 % Search garbage collected termcells : 1515
% 0.07/0.55
% 0.07/0.55 % -------------------------------------------------
% 0.07/0.55 % User time : 0.027 s
% 0.07/0.55 % System time : 0.005 s
% 0.07/0.55 % Total time : 0.032 s
% 0.07/0.55 % Maximum resident set size: 4728 pages
% 0.07/0.55
% 0.07/0.55 % -------------------------------------------------
% 0.07/0.55 % User time : 0.031 s
% 0.07/0.55 % System time : 0.007 s
% 0.07/0.55 % Total time : 0.038 s
% 0.07/0.55 % Maximum resident set size: 4864 pages
% 0.07/0.55 % E exiting
%------------------------------------------------------------------------------