%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN181-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 : n014.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:43 PM UTC 2026
% Result : Unsatisfiable 0.18s 0.51s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 21
% Syntax : Number of clauses : 77 ( 31 unt; 0 nHn; 53 RR)
% Number of literals : 162 ( 0 equ; 88 neg)
% Maximal clause size : 5 ( 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 : 131 ( 56 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_082,axiom,
( ~ p1(X3,X1,X4)
| ~ m0(X3,X1,X4)
| p1(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_082) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(axiom_12,axiom,
m0(a,X1,a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_12) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SYN001-0.ax',rule_124) ).
cnf(rule_117,axiom,
( ~ s0(d)
| ~ k0(e)
| q1(d,d,d) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_117) ).
cnf(rule_137,axiom,
( ~ p1(X2,X3,X1)
| n2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(rule_201,axiom,
( ~ m2(X3)
| ~ m2(X4)
| ~ p1(X2,X3,X1)
| k3(X1,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_201) ).
cnf(rule_136,axiom,
( ~ k1(b)
| m2(b) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_136) ).
cnf(axiom_7,axiom,
n0(d,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_7) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_28) ).
cnf(rule_236,axiom,
( ~ n2(X1)
| m3(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_236) ).
cnf(rule_187,axiom,
( ~ q2(X2,X2,X2)
| ~ k0(X2)
| ~ m0(X3,X4,X1)
| ~ r1(X2)
| q2(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_187) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(rule_181,axiom,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SYN001-0.ax',rule_295) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(prove_this,negated_conjecture,
~ q4(d,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
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(X3,X1,X4)
| ~ m0(X3,X1,X4)
| p1(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[rule_082]) ).
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,
( ~ p1(X3,X1,X4)
| ~ m0(X3,X1,X4)
| p1(X1,X2,X3) ),
c_0_22 ).
cnf(c_0_26,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( ~ m0(X1,X1,X1)
| p1(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,axiom,
m0(a,X1,a),
axiom_12 ).
cnf(c_0_29,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_30,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
inference(fof_simplification,[status(thm)],[rule_124]) ).
cnf(c_0_31,plain,
( ~ s0(d)
| ~ k0(e)
| q1(d,d,d) ),
inference(fof_simplification,[status(thm)],[rule_117]) ).
cnf(c_0_32,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_33,plain,
( ~ m2(X3)
| ~ m2(X4)
| ~ p1(X2,X3,X1)
| k3(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_201]) ).
cnf(c_0_34,plain,
p1(a,X1,a),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( ~ k1(b)
| m2(b) ),
inference(fof_simplification,[status(thm)],[rule_136]) ).
cnf(c_0_36,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_29 ).
cnf(c_0_37,axiom,
n0(d,b),
axiom_7 ).
cnf(c_0_38,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
c_0_30 ).
cnf(c_0_39,axiom,
s0(d),
axiom_1 ).
cnf(c_0_40,plain,
( ~ s0(d)
| ~ k0(e)
| q1(d,d,d) ),
c_0_31 ).
cnf(c_0_41,axiom,
k0(e),
axiom_28 ).
cnf(c_0_42,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_236]) ).
cnf(c_0_43,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
c_0_32 ).
cnf(c_0_44,plain,
( ~ m2(X3)
| ~ m2(X4)
| ~ p1(X2,X3,X1)
| k3(X1,X1,X2) ),
c_0_33 ).
cnf(c_0_45,plain,
p1(X1,X2,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_34]),c_0_28])]) ).
cnf(c_0_46,plain,
( ~ k1(b)
| m2(b) ),
c_0_35 ).
cnf(c_0_47,plain,
k1(b),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_48,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_49,plain,
( ~ q0(X1,X2)
| ~ q1(d,X2,d)
| r1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_50,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_51,plain,
q1(d,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_39]),c_0_41])]) ).
cnf(c_0_52,plain,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_181]) ).
cnf(c_0_53,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_54,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
c_0_42 ).
cnf(c_0_55,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_43,c_0_26]) ).
cnf(c_0_56,plain,
( ~ m2(X3)
| ~ m2(X2)
| k3(a,a,X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_57,plain,
m2(b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]) ).
cnf(c_0_58,plain,
( ~ q2(X2,X2,X2)
| ~ k0(X2)
| ~ m0(X3,X4,X1)
| ~ r1(X2)
| q2(X1,X2,X1) ),
c_0_48 ).
cnf(c_0_59,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_60,plain,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
c_0_52 ).
cnf(c_0_61,plain,
( ~ m3(X4,X5,X4)
| ~ q2(X4,X2,X1)
| ~ k3(X3,X3,X1)
| q4(X1,X2) ),
c_0_53 ).
cnf(c_0_62,plain,
m3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]) ).
cnf(c_0_63,plain,
( ~ m2(X2)
| k3(a,a,X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_64,plain,
( ~ m0(X3,X4,X1)
| ~ k0(X2)
| ~ q2(X2,X2,X2)
| q2(X1,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]) ).
cnf(c_0_65,plain,
q2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_26])]) ).
cnf(c_0_66,plain,
( ~ q2(X4,X2,X1)
| ~ k3(X3,X3,X1)
| q4(X1,X2) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,plain,
k3(a,a,X1),
inference(spm,[status(thm)],[c_0_63,c_0_57]) ).
cnf(c_0_68,plain,
( ~ m0(X3,X4,X1)
| ~ k0(X2)
| q2(X1,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]) ).
cnf(c_0_69,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_70,negated_conjecture,
~ q4(d,b),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_71,plain,
( ~ q2(X3,X2,X1)
| q4(X1,X2) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_72,plain,
( ~ k0(X2)
| q2(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_73,negated_conjecture,
~ q4(d,b),
c_0_70 ).
cnf(c_0_74,plain,
( ~ k0(X2)
| q4(X1,X2) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_75,axiom,
k0(b),
axiom_32 ).
cnf(c_0_76,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN181-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n014.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % 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:45:34 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.18/0.51 % Version: 3.5.1
% 0.18/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.51 % Starting sh5l with 300s (1) cores
% 0.18/0.51 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3870811 completed with status 0
% 0.18/0.51 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.18/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.51 % No SInE strategy applied
% 0.18/0.51 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.18/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.51 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.18/0.51 % Starting new_bool_3 with 136s (1) cores
% 0.18/0.51 % Starting new_bool_1 with 136s (1) cores
% 0.18/0.51 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 3870818 completed with status 0
% 0.18/0.51 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.18/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.51 % No SInE strategy applied
% 0.18/0.51 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.18/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.51 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.18/0.51 % Preprocessing time : 0.003 s
% 0.18/0.51 % Presaturation interreduction done
% 0.18/0.51
% 0.18/0.51 % Proof found!
% 0.18/0.51 % SZS status Unsatisfiable
% 0.18/0.51 % SZS output start CNFRefutation
% See solution above
% 0.18/0.51 % Parsed axioms : 369
% 0.18/0.51 % Removed by relevancy pruning/SinE : 0
% 0.18/0.51 % Initial clauses : 369
% 0.18/0.51 % Removed in clause preprocessing : 7
% 0.18/0.51 % Initial clauses in saturation : 362
% 0.18/0.51 % Processed clauses : 1468
% 0.18/0.51 % ...of these trivial : 65
% 0.18/0.51 % ...subsumed : 94
% 0.18/0.51 % ...remaining for further processing : 1309
% 0.18/0.51 % Other redundant clauses eliminated : 0
% 0.18/0.51 % Clauses deleted for lack of memory : 0
% 0.18/0.51 % Backward-subsumed : 100
% 0.18/0.51 % Backward-rewritten : 348
% 0.18/0.51 % Generated clauses : 2086
% 0.18/0.51 % ...of the previous two non-redundant : 1536
% 0.18/0.51 % ...aggressively subsumed : 0
% 0.18/0.51 % Contextual simplify-reflections : 2
% 0.18/0.51 % Paramodulations : 2086
% 0.18/0.51 % Factorizations : 0
% 0.18/0.51 % NegExts : 0
% 0.18/0.51 % Equation resolutions : 0
% 0.18/0.51 % Disequality decompositions : 0
% 0.18/0.51 % Total rewrite steps : 1466
% 0.18/0.51 % ...of those cached : 1037
% 0.18/0.51 % Propositional unsat checks : 0
% 0.18/0.51 % Propositional check models : 0
% 0.18/0.51 % Propositional check unsatisfiable : 0
% 0.18/0.51 % Propositional clauses : 0
% 0.18/0.51 % Propositional clauses after purity: 0
% 0.18/0.51 % Propositional unsat core size : 0
% 0.18/0.51 % Propositional preprocessing time : 0.000
% 0.18/0.51 % Propositional encoding time : 0.000
% 0.18/0.51 % Propositional solver time : 0.000
% 0.18/0.51 % Success case prop preproc time : 0.000
% 0.18/0.51 % Success case prop encoding time : 0.000
% 0.18/0.51 % Success case prop solver time : 0.000
% 0.18/0.51 % Current number of processed clauses : 533
% 0.18/0.51 % Positive orientable unit clauses : 249
% 0.18/0.51 % Positive unorientable unit clauses: 0
% 0.18/0.51 % Negative unit clauses : 1
% 0.18/0.51 % Non-unit-clauses : 283
% 0.18/0.51 % Current number of unprocessed clauses: 359
% 0.18/0.51 % ...number of literals in the above : 1127
% 0.18/0.51 % Current number of archived formulas : 0
% 0.18/0.51 % Current number of archived clauses : 776
% 0.18/0.51 % Clause-clause subsumption calls (NU) : 62728
% 0.18/0.51 % Rec. Clause-clause subsumption calls : 46690
% 0.18/0.51 % Non-unit clause-clause subsumptions : 184
% 0.18/0.51 % Unit Clause-clause subsumption calls : 6007
% 0.18/0.51 % Rewrite failures with RHS unbound : 0
% 0.18/0.51 % BW rewrite match attempts : 771
% 0.18/0.51 % BW rewrite match successes : 227
% 0.18/0.51 % Condensation attempts : 0
% 0.18/0.51 % Condensation successes : 0
% 0.18/0.51 % Termbank termtop insertions : 37429
% 0.18/0.51 % Search garbage collected termcells : 1461
% 0.18/0.51
% 0.18/0.51 % -------------------------------------------------
% 0.18/0.51 % User time : 0.071 s
% 0.18/0.51 % System time : 0.005 s
% 0.18/0.51 % Total time : 0.076 s
% 0.18/0.51 % Maximum resident set size: 4216 pages
% 0.18/0.51
% 0.18/0.51 % -------------------------------------------------
% 0.18/0.51 % User time : 0.304 s
% 0.18/0.51 % System time : 0.028 s
% 0.18/0.51 % Total time : 0.332 s
% 0.18/0.51 % Maximum resident set size: 5120 pages
% 0.18/0.51 % E exiting
%------------------------------------------------------------------------------