%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN181-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 : n018.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:19 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.53s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 23
% Syntax : Number of clauses : 84 ( 33 unt; 0 nHn; 64 RR)
% Number of literals : 170 ( 0 equ; 89 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 18 ( 17 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 146 ( 52 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_029,axiom,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_029) ).
cnf(rule_110,axiom,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_110) ).
cnf(rule_085,axiom,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_085) ).
cnf(rule_005,axiom,
( ~ m0(X2,X2,X1)
| m1(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_005) ).
cnf(rule_127,axiom,
( ~ k2(X4,X2)
| ~ k1(X4)
| ~ m1(X3,X2,X1)
| k2(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_127) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
cnf(rule_129,axiom,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_129) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_137,axiom,
( ~ p1(X2,X3,X1)
| n2(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(rule_124,axiom,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_124) ).
cnf(rule_236,axiom,
( ~ n2(X1)
| m3(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_236) ).
cnf(axiom_15,axiom,
n0(a,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_15) ).
cnf(axiom_34,axiom,
n0(c,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_34) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
cnf(rule_181,axiom,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_181) ).
cnf(rule_295,axiom,
( ~ m3(X4,X5,X4)
| ~ q2(X4,X2,X1)
| ~ k3(X3,X3,X1)
| q4(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_295) ).
cnf(rule_194,axiom,
( ~ k2(X2,X1)
| k3(X1,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_194) ).
cnf(rule_187,axiom,
( ~ q2(X2,X2,X2)
| ~ k0(X2)
| ~ m0(X3,X4,X1)
| ~ r1(X2)
| q2(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_187) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(prove_this,negated_conjecture,
~ q4(d,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
cnf(c_0_23,plain,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_029]) ).
cnf(c_0_24,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_110]) ).
cnf(c_0_25,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_26,plain,
( ~ m0(X2,X2,X1)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_005]) ).
cnf(c_0_27,plain,
( ~ k2(X4,X2)
| ~ k1(X4)
| ~ m1(X3,X2,X1)
| k2(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_127]) ).
cnf(c_0_28,plain,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
c_0_23 ).
cnf(c_0_29,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_30,axiom,
s0(b),
axiom_5 ).
cnf(c_0_31,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_129]) ).
cnf(c_0_32,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
c_0_24 ).
cnf(c_0_33,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_34,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_35,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_25 ).
cnf(c_0_36,plain,
( ~ m0(X2,X2,X1)
| m1(X1,X2,X1) ),
c_0_26 ).
cnf(c_0_37,plain,
( ~ k2(X4,X2)
| ~ k1(X4)
| ~ m1(X3,X2,X1)
| k2(X1,X2) ),
c_0_27 ).
cnf(c_0_38,plain,
m1(b,X1,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_39,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
c_0_31 ).
cnf(c_0_40,plain,
q1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_42,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
inference(fof_simplification,[status(thm)],[rule_124]) ).
cnf(c_0_43,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_236]) ).
cnf(c_0_44,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
c_0_34 ).
cnf(c_0_45,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_35,c_0_29]) ).
cnf(c_0_46,plain,
m1(X1,d,X1),
inference(spm,[status(thm)],[c_0_36,c_0_33]) ).
cnf(c_0_47,plain,
( ~ k1(X2)
| ~ k2(X2,X1)
| k2(b,X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_48,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_49,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_41 ).
cnf(c_0_50,axiom,
n0(a,b),
axiom_15 ).
cnf(c_0_51,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_52,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
c_0_42 ).
cnf(c_0_53,axiom,
s0(d),
axiom_1 ).
cnf(c_0_54,plain,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_181]) ).
cnf(c_0_55,plain,
( ~ m3(X4,X5,X4)
| ~ q2(X4,X2,X1)
| ~ k3(X3,X3,X1)
| q4(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_295]) ).
cnf(c_0_56,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
c_0_43 ).
cnf(c_0_57,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_58,plain,
( ~ k2(X2,X1)
| k3(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_194]) ).
cnf(c_0_59,plain,
( ~ k1(X2)
| ~ k2(X2,d)
| k2(X1,d) ),
inference(spm,[status(thm)],[c_0_37,c_0_46]) ).
cnf(c_0_60,plain,
( ~ k1(X1)
| k2(b,X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_61,plain,
k1(b),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_62,plain,
k1(d),
inference(spm,[status(thm)],[c_0_49,c_0_51]) ).
cnf(c_0_63,plain,
( ~ q2(X2,X2,X2)
| ~ k0(X2)
| ~ m0(X3,X4,X1)
| ~ r1(X2)
| q2(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_187]) ).
cnf(c_0_64,plain,
( ~ q0(X1,X2)
| ~ q1(d,X2,d)
| r1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]) ).
cnf(c_0_65,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_66,plain,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
c_0_54 ).
cnf(c_0_67,plain,
( ~ m3(X4,X5,X4)
| ~ q2(X4,X2,X1)
| ~ k3(X3,X3,X1)
| q4(X1,X2) ),
c_0_55 ).
cnf(c_0_68,plain,
m3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57])]) ).
cnf(c_0_69,plain,
( ~ k2(X2,X1)
| k3(X1,X1,X2) ),
c_0_58 ).
cnf(c_0_70,plain,
k2(X1,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_62])]) ).
cnf(c_0_71,plain,
( ~ q2(X2,X2,X2)
| ~ k0(X2)
| ~ m0(X3,X4,X1)
| ~ r1(X2)
| q2(X1,X2,X1) ),
c_0_63 ).
cnf(c_0_72,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_40])]) ).
cnf(c_0_73,plain,
q2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_45])]) ).
cnf(c_0_74,plain,
( ~ q2(X4,X2,X1)
| ~ k3(X3,X3,X1)
| q4(X1,X2) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_75,plain,
k3(d,d,X1),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_76,plain,
( ~ m0(X3,X4,X1)
| ~ k0(X2)
| q2(X1,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72]),c_0_73])]) ).
cnf(c_0_77,negated_conjecture,
~ q4(d,b),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_78,plain,
( ~ q2(X3,X2,X1)
| q4(X1,X2) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_79,plain,
( ~ k0(X2)
| q2(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_76,c_0_33]) ).
cnf(c_0_80,negated_conjecture,
~ q4(d,b),
c_0_77 ).
cnf(c_0_81,plain,
( ~ k0(X2)
| q4(X1,X2) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_82,axiom,
k0(b),
axiom_32 ).
cnf(c_0_83,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN181-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n018.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 10:47:44 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.17/0.53 % Version: 3.5.1
% 0.17/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.53 % Starting sh5l with 300s (1) cores
% 0.17/0.53 % new_bool_3 with pid 1684295 completed with status 0
% 0.17/0.53 % Result found by new_bool_3
% 0.17/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.53 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.17/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.17/0.53 % SubtermCWHack with pid 1684301 completed with status 0
% 0.17/0.53 % Result found by SubtermCWHack
% 0.17/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.53 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.17/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.17/0.53 % Preprocessing time : 0.004 s
% 0.17/0.53
% 0.17/0.53 % Proof found!
% 0.17/0.53 % SZS status Unsatisfiable
% 0.17/0.53 % SZS output start CNFRefutation
% See solution above
% 0.17/0.53 % Parsed axioms : 369
% 0.17/0.53 % Removed by relevancy pruning/SinE : 31
% 0.17/0.53 % Initial clauses : 338
% 0.17/0.53 % Removed in clause preprocessing : 6
% 0.17/0.53 % Initial clauses in saturation : 332
% 0.17/0.53 % Processed clauses : 1467
% 0.17/0.53 % ...of these trivial : 159
% 0.17/0.53 % ...subsumed : 240
% 0.17/0.53 % ...remaining for further processing : 1068
% 0.17/0.53 % Other redundant clauses eliminated : 0
% 0.17/0.53 % Clauses deleted for lack of memory : 0
% 0.17/0.53 % Backward-subsumed : 206
% 0.17/0.53 % Backward-rewritten : 342
% 0.17/0.53 % Generated clauses : 2001
% 0.17/0.53 % ...of the previous two non-redundant : 1513
% 0.17/0.53 % ...aggressively subsumed : 0
% 0.17/0.53 % Contextual simplify-reflections : 1
% 0.17/0.53 % Paramodulations : 2001
% 0.17/0.53 % Factorizations : 0
% 0.17/0.53 % NegExts : 0
% 0.17/0.53 % Equation resolutions : 0
% 0.17/0.53 % Disequality decompositions : 0
% 0.17/0.53 % Total rewrite steps : 1458
% 0.17/0.53 % ...of those cached : 980
% 0.17/0.53 % Propositional unsat checks : 0
% 0.17/0.53 % Propositional check models : 0
% 0.17/0.53 % Propositional check unsatisfiable : 0
% 0.17/0.53 % Propositional clauses : 0
% 0.17/0.53 % Propositional clauses after purity: 0
% 0.17/0.53 % Propositional unsat core size : 0
% 0.17/0.53 % Propositional preprocessing time : 0.000
% 0.17/0.53 % Propositional encoding time : 0.000
% 0.17/0.53 % Propositional solver time : 0.000
% 0.17/0.53 % Success case prop preproc time : 0.000
% 0.17/0.53 % Success case prop encoding time : 0.000
% 0.17/0.53 % Success case prop solver time : 0.000
% 0.17/0.53 % Current number of processed clauses : 520
% 0.17/0.53 % Positive orientable unit clauses : 229
% 0.17/0.53 % Positive unorientable unit clauses: 0
% 0.17/0.53 % Negative unit clauses : 1
% 0.17/0.53 % Non-unit-clauses : 290
% 0.17/0.53 % Current number of unprocessed clauses: 143
% 0.17/0.53 % ...number of literals in the above : 526
% 0.17/0.53 % Current number of archived formulas : 0
% 0.17/0.53 % Current number of archived clauses : 548
% 0.17/0.53 % Clause-clause subsumption calls (NU) : 35248
% 0.17/0.53 % Rec. Clause-clause subsumption calls : 29257
% 0.17/0.53 % Non-unit clause-clause subsumptions : 376
% 0.17/0.53 % Unit Clause-clause subsumption calls : 3898
% 0.17/0.53 % Rewrite failures with RHS unbound : 0
% 0.17/0.53 % BW rewrite match attempts : 711
% 0.17/0.53 % BW rewrite match successes : 284
% 0.17/0.53 % Condensation attempts : 0
% 0.17/0.53 % Condensation successes : 0
% 0.17/0.53 % Termbank termtop insertions : 32857
% 0.17/0.53 % Search garbage collected termcells : 1503
% 0.17/0.53
% 0.17/0.53 % -------------------------------------------------
% 0.17/0.53 % User time : 0.084 s
% 0.17/0.53 % System time : 0.008 s
% 0.17/0.53 % Total time : 0.093 s
% 0.17/0.53 % Maximum resident set size: 4420 pages
% 0.17/0.53
% 0.17/0.53 % -------------------------------------------------
% 0.17/0.53 % User time : 0.091 s
% 0.17/0.53 % System time : 0.013 s
% 0.17/0.53 % Total time : 0.104 s
% 0.17/0.53 % Maximum resident set size: 4864 pages
% 0.17/0.53 % E exiting
%------------------------------------------------------------------------------