%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN180-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 : n006.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.54s 0.52s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 24
% Syntax : Number of clauses : 86 ( 38 unt; 0 nHn; 72 RR)
% Number of literals : 169 ( 0 equ; 86 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 19 ( 18 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 132 ( 47 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_021,axiom,
( ~ k0(X2)
| ~ l0(X1)
| m1(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_021) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
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_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_24,axiom,
l0(c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
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_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(rule_137,axiom,
( ~ p1(X2,X3,X1)
| n2(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_20) ).
cnf(axiom_15,axiom,
n0(a,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_15) ).
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_26,axiom,
n0(d,c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
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(a,e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_28) ).
cnf(c_0_24,plain,
( ~ k0(X2)
| ~ l0(X1)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_021]) ).
cnf(c_0_25,plain,
( ~ k0(X2)
| ~ l0(X1)
| m1(X1,X2,X1) ),
c_0_24 ).
cnf(c_0_26,axiom,
k0(b),
axiom_32 ).
cnf(c_0_27,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_110]) ).
cnf(c_0_28,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_29,plain,
( ~ k2(X4,X2)
| ~ k1(X4)
| ~ m1(X3,X2,X1)
| k2(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_127]) ).
cnf(c_0_30,plain,
( ~ l0(X1)
| m1(X1,b,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,axiom,
l0(c),
axiom_24 ).
cnf(c_0_32,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_129]) ).
cnf(c_0_33,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
c_0_27 ).
cnf(c_0_34,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_35,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_36,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_37,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_28 ).
cnf(c_0_38,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_39,axiom,
l0(a),
axiom_20 ).
cnf(c_0_40,plain,
( ~ k2(X4,X2)
| ~ k1(X4)
| ~ m1(X3,X2,X1)
| k2(X1,X2) ),
c_0_29 ).
cnf(c_0_41,plain,
m1(c,b,c),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_42,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
c_0_32 ).
cnf(c_0_43,plain,
q1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_44,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_35 ).
cnf(c_0_45,axiom,
n0(a,b),
axiom_15 ).
cnf(c_0_46,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
inference(fof_simplification,[status(thm)],[rule_124]) ).
cnf(c_0_47,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_236]) ).
cnf(c_0_48,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
c_0_36 ).
cnf(c_0_49,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_50,plain,
m1(a,b,a),
inference(spm,[status(thm)],[c_0_30,c_0_39]) ).
cnf(c_0_51,plain,
( ~ k1(X1)
| ~ k2(X1,b)
| k2(c,b) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_52,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_53,plain,
k1(b),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_54,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_55,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
c_0_46 ).
cnf(c_0_56,axiom,
s0(d),
axiom_1 ).
cnf(c_0_57,plain,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_181]) ).
cnf(c_0_58,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_59,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
c_0_47 ).
cnf(c_0_60,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_61,plain,
( ~ k2(X2,X1)
| k3(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_194]) ).
cnf(c_0_62,plain,
( ~ k1(X1)
| ~ k2(X1,b)
| k2(a,b) ),
inference(spm,[status(thm)],[c_0_40,c_0_50]) ).
cnf(c_0_63,plain,
k2(c,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_64,plain,
k1(c),
inference(spm,[status(thm)],[c_0_44,c_0_54]) ).
cnf(c_0_65,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_66,plain,
( ~ q0(X1,X2)
| ~ q1(d,X2,d)
| r1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]) ).
cnf(c_0_67,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_68,plain,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
c_0_57 ).
cnf(c_0_69,plain,
( ~ m3(X4,X5,X4)
| ~ q2(X4,X2,X1)
| ~ k3(X3,X3,X1)
| q4(X1,X2) ),
c_0_58 ).
cnf(c_0_70,plain,
m3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]) ).
cnf(c_0_71,plain,
( ~ k2(X2,X1)
| k3(X1,X1,X2) ),
c_0_61 ).
cnf(c_0_72,plain,
k2(a,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]) ).
cnf(c_0_73,plain,
( ~ q2(X2,X2,X2)
| ~ k0(X2)
| ~ m0(X3,X4,X1)
| ~ r1(X2)
| q2(X1,X2,X1) ),
c_0_65 ).
cnf(c_0_74,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_43])]) ).
cnf(c_0_75,plain,
q2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_49])]) ).
cnf(c_0_76,plain,
( ~ q2(X4,X2,X1)
| ~ k3(X3,X3,X1)
| q4(X1,X2) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_77,plain,
k3(b,b,a),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_78,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_73,c_0_74]),c_0_75])]) ).
cnf(c_0_79,negated_conjecture,
~ q4(a,e),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_80,plain,
( ~ q2(X2,X1,a)
| q4(a,X1) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,plain,
( ~ k0(X2)
| q2(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_78,c_0_34]) ).
cnf(c_0_82,negated_conjecture,
~ q4(a,e),
c_0_79 ).
cnf(c_0_83,plain,
( ~ k0(X1)
| q4(a,X1) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_84,axiom,
k0(e),
axiom_28 ).
cnf(c_0_85,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN180-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.13/0.37 % Computer : n006.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 10:45:27 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/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.54/0.52 % Version: 3.5.1
% 0.54/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.54/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.54/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.54/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.54/0.52 % Starting sh5l with 300s (1) cores
% 0.54/0.52 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2663655 completed with status 0
% 0.54/0.52 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.54/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.54/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.54/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.54/0.52 % No SInE strategy applied
% 0.54/0.52 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.54/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.54/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.54/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.54/0.52 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.54/0.52 % Starting new_bool_3 with 136s (1) cores
% 0.54/0.52 % Starting new_bool_1 with 136s (1) cores
% 0.54/0.52 % SubtermCWHack with pid 2663659 completed with status 0
% 0.54/0.52 % Result found by SubtermCWHack
% 0.54/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.54/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.54/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.54/0.52 % No SInE strategy applied
% 0.54/0.52 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.54/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.54/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.54/0.52 % Preprocessing time : 0.003 s
% 0.54/0.52
% 0.54/0.52 % Proof found!
% 0.54/0.52 % SZS status Unsatisfiable
% 0.54/0.52 % SZS output start CNFRefutation
% See solution above
% 0.54/0.52 % Parsed axioms : 369
% 0.54/0.52 % Removed by relevancy pruning/SinE : 0
% 0.54/0.52 % Initial clauses : 369
% 0.54/0.52 % Removed in clause preprocessing : 7
% 0.54/0.52 % Initial clauses in saturation : 362
% 0.54/0.52 % Processed clauses : 1701
% 0.54/0.52 % ...of these trivial : 163
% 0.54/0.52 % ...subsumed : 268
% 0.54/0.52 % ...remaining for further processing : 1270
% 0.54/0.52 % Other redundant clauses eliminated : 0
% 0.54/0.52 % Clauses deleted for lack of memory : 0
% 0.54/0.52 % Backward-subsumed : 257
% 0.54/0.52 % Backward-rewritten : 369
% 0.54/0.52 % Generated clauses : 2431
% 0.54/0.52 % ...of the previous two non-redundant : 1859
% 0.54/0.52 % ...aggressively subsumed : 0
% 0.54/0.52 % Contextual simplify-reflections : 0
% 0.54/0.52 % Paramodulations : 2431
% 0.54/0.52 % Factorizations : 0
% 0.54/0.52 % NegExts : 0
% 0.54/0.52 % Equation resolutions : 0
% 0.54/0.52 % Disequality decompositions : 0
% 0.54/0.52 % Total rewrite steps : 1713
% 0.54/0.52 % ...of those cached : 1160
% 0.54/0.52 % Propositional unsat checks : 0
% 0.54/0.52 % Propositional check models : 0
% 0.54/0.52 % Propositional check unsatisfiable : 0
% 0.54/0.52 % Propositional clauses : 0
% 0.54/0.52 % Propositional clauses after purity: 0
% 0.54/0.52 % Propositional unsat core size : 0
% 0.54/0.52 % Propositional preprocessing time : 0.000
% 0.54/0.52 % Propositional encoding time : 0.000
% 0.54/0.52 % Propositional solver time : 0.000
% 0.54/0.52 % Success case prop preproc time : 0.000
% 0.54/0.52 % Success case prop encoding time : 0.000
% 0.54/0.52 % Success case prop solver time : 0.000
% 0.54/0.52 % Current number of processed clauses : 644
% 0.54/0.52 % Positive orientable unit clauses : 260
% 0.54/0.52 % Positive unorientable unit clauses: 0
% 0.54/0.52 % Negative unit clauses : 2
% 0.54/0.52 % Non-unit-clauses : 382
% 0.54/0.52 % Current number of unprocessed clauses: 188
% 0.54/0.52 % ...number of literals in the above : 699
% 0.54/0.52 % Current number of archived formulas : 0
% 0.54/0.52 % Current number of archived clauses : 626
% 0.54/0.52 % Clause-clause subsumption calls (NU) : 47564
% 0.54/0.52 % Rec. Clause-clause subsumption calls : 39915
% 0.54/0.52 % Non-unit clause-clause subsumptions : 443
% 0.54/0.52 % Unit Clause-clause subsumption calls : 5332
% 0.54/0.52 % Rewrite failures with RHS unbound : 0
% 0.54/0.52 % BW rewrite match attempts : 788
% 0.54/0.52 % BW rewrite match successes : 324
% 0.54/0.52 % Condensation attempts : 0
% 0.54/0.52 % Condensation successes : 0
% 0.54/0.52 % Termbank termtop insertions : 38782
% 0.54/0.52 % Search garbage collected termcells : 1461
% 0.54/0.52
% 0.54/0.52 % -------------------------------------------------
% 0.54/0.52 % User time : 0.068 s
% 0.54/0.52 % System time : 0.007 s
% 0.54/0.52 % Total time : 0.075 s
% 0.54/0.52 % Maximum resident set size: 4472 pages
% 0.54/0.52
% 0.54/0.52 % -------------------------------------------------
% 0.54/0.52 % User time : 0.293 s
% 0.54/0.52 % System time : 0.027 s
% 0.54/0.52 % Total time : 0.320 s
% 0.54/0.52 % Maximum resident set size: 5120 pages
% 0.54/0.52 % E exiting
%------------------------------------------------------------------------------