↑ Up

E-SAT---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SYN163-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 : n001.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:40 PM UTC 2026

% Result   : Unsatisfiable 0.51s 0.50s
% Output   : CNFRefutation 0.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   46
% Syntax   : Number of clauses     :  184 (  60 unt;   0 nHn; 146 RR)
%            Number of literals    :  399 (   0 equ; 219 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   33 (  32 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :  307 ( 114 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_057,axiom,
    ( ~ r0(X1)
    | n1(X1,X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_057) ).

cnf(rule_001,axiom,
    ( ~ n0(X2,X1)
    | k1(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).

cnf(rule_088,axiom,
    ( ~ l0(a)
    | p1(a,a,a) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_088) ).

cnf(rule_179,axiom,
    ( ~ n1(X1,X1,X2)
    | ~ k1(X2)
    | q2(X1,X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_179) ).

cnf(axiom_13,axiom,
    r0(e),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_13) ).

cnf(axiom_30,axiom,
    n0(e,e),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_30) ).

cnf(rule_082,axiom,
    ( ~ p1(X3,X1,X4)
    | ~ m0(X3,X1,X4)
    | p1(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_082) ).

cnf(axiom_20,axiom,
    l0(a),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_20) ).

cnf(rule_021,axiom,
    ( ~ k0(X2)
    | ~ l0(X1)
    | m1(X1,X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_021) ).

cnf(rule_007,axiom,
    ( ~ r0(X1)
    | ~ p0(X3,X2)
    | m1(X1,X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_007) ).

cnf(rule_255,axiom,
    ( ~ n0(X3,X1)
    | ~ q2(X3,X1,X2)
    | q3(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_255) ).

cnf(rule_085,axiom,
    ( ~ p0(X2,X1)
    | p1(X1,X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_085) ).

cnf(axiom_12,axiom,
    m0(a,X1,a),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_12) ).

cnf(axiom_28,axiom,
    k0(e),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_28) ).

cnf(axiom_14,axiom,
    p0(b,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).

cnf(rule_298,axiom,
    ( ~ p0(X4,X1)
    | ~ q3(X2,X3)
    | ~ n3(X1)
    | r4(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_298) ).

cnf(rule_137,axiom,
    ( ~ p1(X2,X3,X1)
    | n2(X1) ),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_201) ).

cnf(rule_136,axiom,
    ( ~ k1(b)
    | m2(b) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_136) ).

cnf(axiom_11,axiom,
    n0(e,b),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_11) ).

cnf(rule_176,axiom,
    ( ~ m1(X2,X1,X2)
    | p2(X1,X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_176) ).

cnf(rule_236,axiom,
    ( ~ n2(X1)
    | m3(X1,X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_236) ).

cnf(rule_155,axiom,
    ( ~ p2(e,X1,X2)
    | ~ k1(X3)
    | p2(X1,X2,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_155) ).

cnf(rule_126,axiom,
    ( ~ s1(X3)
    | ~ q0(X1,X2)
    | s1(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_126) ).

cnf(rule_125,axiom,
    ( ~ p0(X1,X1)
    | s1(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_125) ).

cnf(rule_286,axiom,
    ( ~ n3(X1)
    | ~ q3(X2,X3)
    | p4(X1,X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_286) ).

cnf(rule_240,axiom,
    ( ~ p2(X2,X3,X1)
    | n3(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_240) ).

cnf(rule_314,axiom,
    ( ~ r4(X1)
    | n5(X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_314) ).

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(axiom_26,axiom,
    n0(d,c),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_26) ).

cnf(axiom_17,axiom,
    q0(X1,d),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_17) ).

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_267,axiom,
    ( ~ p2(X1,X3,X2)
    | r3(X1,X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_267) ).

cnf(rule_100,axiom,
    ( ~ n0(X2,X1)
    | q1(X1,X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_100) ).

cnf(rule_133,axiom,
    ( ~ m0(X4,X3,X1)
    | ~ s1(X3)
    | ~ p0(X2,X2)
    | l2(X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_133) ).

cnf(rule_307,axiom,
    ( ~ n5(X5,X2)
    | ~ p4(X5,X5,X2)
    | ~ n4(X1,X4)
    | ~ q4(X3,X4)
    | n5(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_307) ).

cnf(rule_284,axiom,
    ( ~ m3(X1,X1,X1)
    | ~ k4(X2)
    | n4(X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_284) ).

cnf(rule_276,axiom,
    ( ~ r3(X1,e,X2)
    | ~ q1(a,a,X2)
    | ~ q3(X1,X1)
    | k4(e) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_276) ).

cnf(axiom_37,axiom,
    n0(b,a),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_37) ).

cnf(rule_258,axiom,
    ( ~ l2(X3,X3)
    | ~ s1(X2)
    | ~ r2(X1)
    | q3(X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_258) ).

cnf(axiom_19,axiom,
    m0(X1,d,X2),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_124) ).

cnf(rule_117,axiom,
    ( ~ s0(d)
    | ~ k0(e)
    | q1(d,d,d) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_117) ).

cnf(axiom_1,axiom,
    s0(d),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_1) ).

cnf(prove_this,negated_conjecture,
    ~ n5(e,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(rule_188,axiom,
    ( ~ l0(X1)
    | ~ r1(X1)
    | r2(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_188) ).

cnf(c_0_46,plain,
    ( ~ r0(X1)
    | n1(X1,X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_057]) ).

cnf(c_0_47,plain,
    ( ~ n0(X2,X1)
    | k1(X1) ),
    inference(fof_simplification,[status(thm)],[rule_001]) ).

cnf(c_0_48,plain,
    ( ~ l0(a)
    | p1(a,a,a) ),
    inference(fof_simplification,[status(thm)],[rule_088]) ).

cnf(c_0_49,plain,
    ( ~ n1(X1,X1,X2)
    | ~ k1(X2)
    | q2(X1,X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_179]) ).

cnf(c_0_50,plain,
    ( ~ r0(X1)
    | n1(X1,X1,X1) ),
    c_0_46 ).

cnf(c_0_51,axiom,
    r0(e),
    axiom_13 ).

cnf(c_0_52,plain,
    ( ~ n0(X2,X1)
    | k1(X1) ),
    c_0_47 ).

cnf(c_0_53,axiom,
    n0(e,e),
    axiom_30 ).

cnf(c_0_54,plain,
    ( ~ p1(X3,X1,X4)
    | ~ m0(X3,X1,X4)
    | p1(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[rule_082]) ).

cnf(c_0_55,plain,
    ( ~ l0(a)
    | p1(a,a,a) ),
    c_0_48 ).

cnf(c_0_56,axiom,
    l0(a),
    axiom_20 ).

cnf(c_0_57,plain,
    ( ~ k0(X2)
    | ~ l0(X1)
    | m1(X1,X2,X1) ),
    inference(fof_simplification,[status(thm)],[rule_021]) ).

cnf(c_0_58,plain,
    ( ~ r0(X1)
    | ~ p0(X3,X2)
    | m1(X1,X2,X1) ),
    inference(fof_simplification,[status(thm)],[rule_007]) ).

cnf(c_0_59,plain,
    ( ~ n0(X3,X1)
    | ~ q2(X3,X1,X2)
    | q3(X1,X2) ),
    inference(fof_simplification,[status(thm)],[rule_255]) ).

cnf(c_0_60,plain,
    ( ~ n1(X1,X1,X2)
    | ~ k1(X2)
    | q2(X1,X1,X1) ),
    c_0_49 ).

cnf(c_0_61,plain,
    n1(e,e,e),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_62,plain,
    k1(e),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_63,plain,
    ( ~ p0(X2,X1)
    | p1(X1,X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_085]) ).

cnf(c_0_64,plain,
    ( ~ p1(X3,X1,X4)
    | ~ m0(X3,X1,X4)
    | p1(X1,X2,X3) ),
    c_0_54 ).

cnf(c_0_65,plain,
    p1(a,a,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]) ).

cnf(c_0_66,axiom,
    m0(a,X1,a),
    axiom_12 ).

cnf(c_0_67,plain,
    ( ~ k0(X2)
    | ~ l0(X1)
    | m1(X1,X2,X1) ),
    c_0_57 ).

cnf(c_0_68,axiom,
    k0(e),
    axiom_28 ).

cnf(c_0_69,plain,
    ( ~ r0(X1)
    | ~ p0(X3,X2)
    | m1(X1,X2,X1) ),
    c_0_58 ).

cnf(c_0_70,axiom,
    p0(b,X1),
    axiom_14 ).

cnf(c_0_71,plain,
    ( ~ p0(X4,X1)
    | ~ q3(X2,X3)
    | ~ n3(X1)
    | r4(X1) ),
    inference(fof_simplification,[status(thm)],[rule_298]) ).

cnf(c_0_72,plain,
    ( ~ n0(X3,X1)
    | ~ q2(X3,X1,X2)
    | q3(X1,X2) ),
    c_0_59 ).

cnf(c_0_73,plain,
    q2(e,e,e),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62])]) ).

cnf(c_0_74,plain,
    ( ~ p1(X2,X3,X1)
    | n2(X1) ),
    inference(fof_simplification,[status(thm)],[rule_137]) ).

cnf(c_0_75,plain,
    ( ~ p0(X2,X1)
    | p1(X1,X1,X1) ),
    c_0_63 ).

cnf(c_0_76,plain,
    ( ~ m2(X3)
    | ~ m2(X4)
    | ~ p1(X2,X3,X1)
    | k3(X1,X1,X2) ),
    inference(fof_simplification,[status(thm)],[rule_201]) ).

cnf(c_0_77,plain,
    p1(a,X1,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]) ).

cnf(c_0_78,plain,
    ( ~ k1(b)
    | m2(b) ),
    inference(fof_simplification,[status(thm)],[rule_136]) ).

cnf(c_0_79,axiom,
    n0(e,b),
    axiom_11 ).

cnf(c_0_80,plain,
    ( ~ m1(X2,X1,X2)
    | p2(X1,X2,X1) ),
    inference(fof_simplification,[status(thm)],[rule_176]) ).

cnf(c_0_81,plain,
    ( ~ l0(X1)
    | m1(X1,e,X1) ),
    inference(spm,[status(thm)],[c_0_67,c_0_68]) ).

cnf(c_0_82,plain,
    ( ~ r0(X1)
    | m1(X1,X2,X1) ),
    inference(spm,[status(thm)],[c_0_69,c_0_70]) ).

cnf(c_0_83,plain,
    ( ~ p0(X4,X1)
    | ~ q3(X2,X3)
    | ~ n3(X1)
    | r4(X1) ),
    c_0_71 ).

cnf(c_0_84,plain,
    q3(e,e),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_53])]) ).

cnf(c_0_85,plain,
    ( ~ n2(X1)
    | m3(X1,X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_236]) ).

cnf(c_0_86,plain,
    ( ~ p1(X2,X3,X1)
    | n2(X1) ),
    c_0_74 ).

cnf(c_0_87,plain,
    p1(X1,X1,X1),
    inference(spm,[status(thm)],[c_0_75,c_0_70]) ).

cnf(c_0_88,plain,
    ( ~ m2(X3)
    | ~ m2(X4)
    | ~ p1(X2,X3,X1)
    | k3(X1,X1,X2) ),
    c_0_76 ).

cnf(c_0_89,plain,
    p1(X1,X2,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_77]),c_0_66])]) ).

cnf(c_0_90,plain,
    ( ~ k1(b)
    | m2(b) ),
    c_0_78 ).

cnf(c_0_91,plain,
    k1(b),
    inference(spm,[status(thm)],[c_0_52,c_0_79]) ).

cnf(c_0_92,plain,
    ( ~ p2(e,X1,X2)
    | ~ k1(X3)
    | p2(X1,X2,X2) ),
    inference(fof_simplification,[status(thm)],[rule_155]) ).

cnf(c_0_93,plain,
    ( ~ m1(X2,X1,X2)
    | p2(X1,X2,X1) ),
    c_0_80 ).

cnf(c_0_94,plain,
    m1(a,e,a),
    inference(spm,[status(thm)],[c_0_81,c_0_56]) ).

cnf(c_0_95,plain,
    ( ~ s1(X3)
    | ~ q0(X1,X2)
    | s1(X1) ),
    inference(fof_simplification,[status(thm)],[rule_126]) ).

cnf(c_0_96,plain,
    ( ~ p0(X1,X1)
    | s1(X1) ),
    inference(fof_simplification,[status(thm)],[rule_125]) ).

cnf(c_0_97,plain,
    ( ~ n3(X1)
    | ~ q3(X2,X3)
    | p4(X1,X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_286]) ).

cnf(c_0_98,plain,
    ( ~ p2(X2,X3,X1)
    | n3(X1) ),
    inference(fof_simplification,[status(thm)],[rule_240]) ).

cnf(c_0_99,plain,
    m1(e,X1,e),
    inference(spm,[status(thm)],[c_0_82,c_0_51]) ).

cnf(c_0_100,plain,
    ( ~ r4(X1)
    | n5(X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_314]) ).

cnf(c_0_101,plain,
    ( ~ p0(X2,X1)
    | ~ n3(X1)
    | r4(X1) ),
    inference(spm,[status(thm)],[c_0_83,c_0_84]) ).

cnf(c_0_102,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_103,plain,
    ( ~ n2(X1)
    | m3(X1,X1,X1) ),
    c_0_85 ).

cnf(c_0_104,plain,
    n2(X1),
    inference(spm,[status(thm)],[c_0_86,c_0_87]) ).

cnf(c_0_105,plain,
    ( ~ m2(X3)
    | ~ m2(X2)
    | k3(a,a,X1) ),
    inference(spm,[status(thm)],[c_0_88,c_0_89]) ).

cnf(c_0_106,plain,
    m2(b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_91])]) ).

cnf(c_0_107,plain,
    ( ~ p2(e,X1,X2)
    | ~ k1(X3)
    | p2(X1,X2,X2) ),
    c_0_92 ).

cnf(c_0_108,plain,
    p2(e,a,e),
    inference(spm,[status(thm)],[c_0_93,c_0_94]) ).

cnf(c_0_109,axiom,
    n0(d,c),
    axiom_26 ).

cnf(c_0_110,plain,
    ( ~ s1(X3)
    | ~ q0(X1,X2)
    | s1(X1) ),
    c_0_95 ).

cnf(c_0_111,axiom,
    q0(X1,d),
    axiom_17 ).

cnf(c_0_112,plain,
    ( ~ p0(X1,X1)
    | s1(X1) ),
    c_0_96 ).

cnf(c_0_113,plain,
    ( ~ n3(X1)
    | ~ q3(X2,X3)
    | p4(X1,X1,X1) ),
    c_0_97 ).

cnf(c_0_114,plain,
    ( ~ p2(X2,X3,X1)
    | n3(X1) ),
    c_0_98 ).

cnf(c_0_115,plain,
    p2(X1,e,X1),
    inference(spm,[status(thm)],[c_0_93,c_0_99]) ).

cnf(c_0_116,plain,
    ( ~ r4(X1)
    | n5(X1,X1) ),
    c_0_100 ).

cnf(c_0_117,plain,
    ( ~ n3(X1)
    | r4(X1) ),
    inference(spm,[status(thm)],[c_0_101,c_0_70]) ).

cnf(c_0_118,plain,
    ( ~ m3(X4,X5,X4)
    | ~ q2(X4,X2,X1)
    | ~ k3(X3,X3,X1)
    | q4(X1,X2) ),
    c_0_102 ).

cnf(c_0_119,plain,
    m3(X1,X1,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_104])]) ).

cnf(c_0_120,plain,
    ( ~ m2(X2)
    | k3(a,a,X1) ),
    inference(spm,[status(thm)],[c_0_105,c_0_106]) ).

cnf(c_0_121,plain,
    ( ~ p1(X1,X1,X1)
    | q2(X1,X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_181]) ).

cnf(c_0_122,plain,
    ( ~ p2(X1,X3,X2)
    | r3(X1,X2,X1) ),
    inference(fof_simplification,[status(thm)],[rule_267]) ).

cnf(c_0_123,plain,
    ( ~ k1(X1)
    | p2(a,e,e) ),
    inference(spm,[status(thm)],[c_0_107,c_0_108]) ).

cnf(c_0_124,plain,
    k1(c),
    inference(spm,[status(thm)],[c_0_52,c_0_109]) ).

cnf(c_0_125,plain,
    ( ~ n0(X2,X1)
    | q1(X1,X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_100]) ).

cnf(c_0_126,plain,
    ( ~ m0(X4,X3,X1)
    | ~ s1(X3)
    | ~ p0(X2,X2)
    | l2(X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_133]) ).

cnf(c_0_127,plain,
    ( ~ s1(X2)
    | s1(X1) ),
    inference(spm,[status(thm)],[c_0_110,c_0_111]) ).

cnf(c_0_128,plain,
    s1(b),
    inference(spm,[status(thm)],[c_0_112,c_0_70]) ).

cnf(c_0_129,plain,
    ( ~ n5(X5,X2)
    | ~ p4(X5,X5,X2)
    | ~ n4(X1,X4)
    | ~ q4(X3,X4)
    | n5(X1,X2) ),
    inference(fof_simplification,[status(thm)],[rule_307]) ).

cnf(c_0_130,plain,
    ( ~ n3(X1)
    | p4(X1,X1,X1) ),
    inference(spm,[status(thm)],[c_0_113,c_0_84]) ).

cnf(c_0_131,plain,
    n3(X1),
    inference(spm,[status(thm)],[c_0_114,c_0_115]) ).

cnf(c_0_132,plain,
    ( ~ n3(X1)
    | n5(X1,X1) ),
    inference(spm,[status(thm)],[c_0_116,c_0_117]) ).

cnf(c_0_133,plain,
    ( ~ q2(X4,X2,X1)
    | ~ k3(X3,X3,X1)
    | q4(X1,X2) ),
    inference(spm,[status(thm)],[c_0_118,c_0_119]) ).

cnf(c_0_134,plain,
    k3(a,a,X1),
    inference(spm,[status(thm)],[c_0_120,c_0_106]) ).

cnf(c_0_135,plain,
    ( ~ p1(X1,X1,X1)
    | q2(X1,X1,X1) ),
    c_0_121 ).

cnf(c_0_136,plain,
    ( ~ m3(X1,X1,X1)
    | ~ k4(X2)
    | n4(X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_284]) ).

cnf(c_0_137,plain,
    ( ~ r3(X1,e,X2)
    | ~ q1(a,a,X2)
    | ~ q3(X1,X1)
    | k4(e) ),
    inference(fof_simplification,[status(thm)],[rule_276]) ).

cnf(c_0_138,plain,
    ( ~ p2(X1,X3,X2)
    | r3(X1,X2,X1) ),
    c_0_122 ).

cnf(c_0_139,plain,
    p2(a,e,e),
    inference(spm,[status(thm)],[c_0_123,c_0_124]) ).

cnf(c_0_140,plain,
    ( ~ n0(X2,X1)
    | q1(X1,X1,X1) ),
    c_0_125 ).

cnf(c_0_141,axiom,
    n0(b,a),
    axiom_37 ).

cnf(c_0_142,plain,
    ( ~ m0(X4,X3,X1)
    | ~ s1(X3)
    | ~ p0(X2,X2)
    | l2(X1,X1) ),
    c_0_126 ).

cnf(c_0_143,plain,
    s1(X1),
    inference(spm,[status(thm)],[c_0_127,c_0_128]) ).

cnf(c_0_144,plain,
    ( ~ n5(X5,X2)
    | ~ p4(X5,X5,X2)
    | ~ n4(X1,X4)
    | ~ q4(X3,X4)
    | n5(X1,X2) ),
    c_0_129 ).

cnf(c_0_145,plain,
    p4(X1,X1,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_130,c_0_131])]) ).

cnf(c_0_146,plain,
    n5(X1,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_132,c_0_131])]) ).

cnf(c_0_147,plain,
    ( ~ q2(X3,X2,X1)
    | q4(X1,X2) ),
    inference(spm,[status(thm)],[c_0_133,c_0_134]) ).

cnf(c_0_148,plain,
    q2(X1,X1,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_135,c_0_87])]) ).

cnf(c_0_149,plain,
    ( ~ m3(X1,X1,X1)
    | ~ k4(X2)
    | n4(X1,X1) ),
    c_0_136 ).

cnf(c_0_150,plain,
    ( ~ r3(X1,e,X2)
    | ~ q1(a,a,X2)
    | ~ q3(X1,X1)
    | k4(e) ),
    c_0_137 ).

cnf(c_0_151,plain,
    r3(a,e,a),
    inference(spm,[status(thm)],[c_0_138,c_0_139]) ).

cnf(c_0_152,plain,
    q1(a,a,a),
    inference(spm,[status(thm)],[c_0_140,c_0_141]) ).

cnf(c_0_153,plain,
    ( ~ l2(X3,X3)
    | ~ s1(X2)
    | ~ r2(X1)
    | q3(X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_258]) ).

cnf(c_0_154,plain,
    ( ~ m0(X3,X4,X1)
    | ~ p0(X2,X2)
    | l2(X1,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_142,c_0_143])]) ).

cnf(c_0_155,axiom,
    m0(X1,d,X2),
    axiom_19 ).

cnf(c_0_156,plain,
    ( ~ n4(X1,X4)
    | ~ q4(X3,X4)
    | n5(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_145]),c_0_146])]) ).

cnf(c_0_157,plain,
    q4(X1,X1),
    inference(spm,[status(thm)],[c_0_147,c_0_148]) ).

cnf(c_0_158,plain,
    ( ~ k4(X2)
    | n4(X1,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_149,c_0_119])]) ).

cnf(c_0_159,plain,
    ( ~ q3(a,a)
    | k4(e) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_151]),c_0_152])]) ).

cnf(c_0_160,plain,
    ( ~ l2(X3,X3)
    | ~ s1(X2)
    | ~ r2(X1)
    | q3(X1,X1) ),
    c_0_153 ).

cnf(c_0_161,plain,
    ( ~ p0(X2,X2)
    | l2(X1,X1) ),
    inference(spm,[status(thm)],[c_0_154,c_0_155]) ).

cnf(c_0_162,plain,
    ( ~ q1(d,X2,d)
    | ~ s0(d)
    | ~ q0(X1,X2)
    | r1(X1) ),
    inference(fof_simplification,[status(thm)],[rule_124]) ).

cnf(c_0_163,plain,
    ( ~ s0(d)
    | ~ k0(e)
    | q1(d,d,d) ),
    inference(fof_simplification,[status(thm)],[rule_117]) ).

cnf(c_0_164,plain,
    ( ~ n4(X1,X3)
    | n5(X1,X2) ),
    inference(spm,[status(thm)],[c_0_156,c_0_157]) ).

cnf(c_0_165,plain,
    ( ~ q3(a,a)
    | n4(X1,X1) ),
    inference(spm,[status(thm)],[c_0_158,c_0_159]) ).

cnf(c_0_166,plain,
    ( ~ l2(X2,X2)
    | ~ r2(X1)
    | q3(X1,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_160,c_0_143])]) ).

cnf(c_0_167,plain,
    l2(X1,X1),
    inference(spm,[status(thm)],[c_0_161,c_0_70]) ).

cnf(c_0_168,plain,
    ( ~ q1(d,X2,d)
    | ~ s0(d)
    | ~ q0(X1,X2)
    | r1(X1) ),
    c_0_162 ).

cnf(c_0_169,axiom,
    s0(d),
    axiom_1 ).

cnf(c_0_170,plain,
    ( ~ s0(d)
    | ~ k0(e)
    | q1(d,d,d) ),
    c_0_163 ).

cnf(c_0_171,negated_conjecture,
    ~ n5(e,a),
    inference(fof_simplification,[status(thm)],[prove_this]) ).

cnf(c_0_172,plain,
    ( ~ q3(a,a)
    | n5(X1,X2) ),
    inference(spm,[status(thm)],[c_0_164,c_0_165]) ).

cnf(c_0_173,plain,
    ( ~ r2(X1)
    | q3(X1,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_166,c_0_167])]) ).

cnf(c_0_174,plain,
    ( ~ l0(X1)
    | ~ r1(X1)
    | r2(X1) ),
    inference(fof_simplification,[status(thm)],[rule_188]) ).

cnf(c_0_175,plain,
    ( ~ q0(X1,X2)
    | ~ q1(d,X2,d)
    | r1(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_168,c_0_169])]) ).

cnf(c_0_176,plain,
    q1(d,d,d),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_170,c_0_169]),c_0_68])]) ).

cnf(c_0_177,negated_conjecture,
    ~ n5(e,a),
    c_0_171 ).

cnf(c_0_178,plain,
    ( ~ r2(a)
    | n5(X1,X2) ),
    inference(spm,[status(thm)],[c_0_172,c_0_173]) ).

cnf(c_0_179,plain,
    ( ~ l0(X1)
    | ~ r1(X1)
    | r2(X1) ),
    c_0_174 ).

cnf(c_0_180,plain,
    r1(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_175,c_0_111]),c_0_176])]) ).

cnf(c_0_181,negated_conjecture,
    ~ r2(a),
    inference(spm,[status(thm)],[c_0_177,c_0_178]) ).

cnf(c_0_182,plain,
    ( ~ l0(X1)
    | r2(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_179,c_0_180])]) ).

cnf(c_0_183,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_181,c_0_182]),c_0_56])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN163-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35  % Computer : n001.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep 21 10:50:29 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.39  Running first-order theorem proving
% 0.09/0.39  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.51/0.50  % Version: 3.5.1
% 0.51/0.50  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.51/0.50  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.50  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.51/0.50  % Starting new_bool_3 with 300s (1) cores
% 0.51/0.50  % Starting new_bool_1 with 300s (1) cores
% 0.51/0.50  % Starting sh5l with 300s (1) cores
% 0.51/0.50  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2929100 completed with status 0
% 0.51/0.50  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.51/0.50  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.51/0.50  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.50  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.51/0.50  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.51/0.50  % No SInE strategy applied
% 0.51/0.50  % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.51/0.50  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.51/0.50  % Starting SubtermCWHack with 136s (1) cores
% 0.51/0.50  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.51/0.50  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.51/0.50  % Starting new_bool_3 with 136s (1) cores
% 0.51/0.50  % Starting new_bool_1 with 136s (1) cores
% 0.51/0.50  % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2929107 completed with status 0
% 0.51/0.50  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.51/0.50  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.51/0.50  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.50  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.51/0.50  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.51/0.50  % No SInE strategy applied
% 0.51/0.50  % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.51/0.50  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.51/0.50  % Starting SubtermCWHack with 136s (1) cores
% 0.51/0.50  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.51/0.50  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.51/0.50  % Preprocessing time       : 0.003 s
% 0.51/0.50  % Presaturation interreduction done
% 0.51/0.50  
% 0.51/0.50  % Proof found!
% 0.51/0.50  % SZS status Unsatisfiable
% 0.51/0.50  % SZS output start CNFRefutation
% See solution above
% 0.51/0.50  % Parsed axioms                        : 369
% 0.51/0.50  % Removed by relevancy pruning/SinE    : 0
% 0.51/0.50  % Initial clauses                      : 369
% 0.51/0.50  % Removed in clause preprocessing      : 7
% 0.51/0.50  % Initial clauses in saturation        : 362
% 0.51/0.50  % Processed clauses                    : 1550
% 0.51/0.50  % ...of these trivial                  : 73
% 0.51/0.50  % ...subsumed                          : 116
% 0.51/0.50  % ...remaining for further processing  : 1361
% 0.51/0.50  % Other redundant clauses eliminated   : 0
% 0.51/0.50  % Clauses deleted for lack of memory   : 0
% 0.51/0.50  % Backward-subsumed                    : 115
% 0.51/0.50  % Backward-rewritten                   : 368
% 0.51/0.50  % Generated clauses                    : 2284
% 0.51/0.50  % ...of the previous two non-redundant : 1727
% 0.51/0.50  % ...aggressively subsumed             : 0
% 0.51/0.50  % Contextual simplify-reflections      : 3
% 0.51/0.50  % Paramodulations                      : 2284
% 0.51/0.50  % Factorizations                       : 0
% 0.51/0.50  % NegExts                              : 0
% 0.51/0.50  % Equation resolutions                 : 0
% 0.51/0.50  % Disequality decompositions           : 0
% 0.51/0.50  % Total rewrite steps                  : 1514
% 0.51/0.50  % ...of those cached                   : 1095
% 0.51/0.50  % Propositional unsat checks           : 0
% 0.51/0.50  %    Propositional check models        : 0
% 0.51/0.50  %    Propositional check unsatisfiable : 0
% 0.51/0.50  %    Propositional clauses             : 0
% 0.51/0.50  %    Propositional clauses after purity: 0
% 0.51/0.50  %    Propositional unsat core size     : 0
% 0.51/0.50  %    Propositional preprocessing time  : 0.000
% 0.51/0.50  %    Propositional encoding time       : 0.000
% 0.51/0.50  %    Propositional solver time         : 0.000
% 0.51/0.50  %    Success case prop preproc time    : 0.000
% 0.51/0.50  %    Success case prop encoding time   : 0.000
% 0.51/0.50  %    Success case prop solver time     : 0.000
% 0.51/0.50  % Current number of processed clauses  : 550
% 0.51/0.50  %    Positive orientable unit clauses  : 242
% 0.51/0.50  %    Positive unorientable unit clauses: 0
% 0.51/0.50  %    Negative unit clauses             : 2
% 0.51/0.50  %    Non-unit-clauses                  : 306
% 0.51/0.50  % Current number of unprocessed clauses: 393
% 0.51/0.50  % ...number of literals in the above   : 1228
% 0.51/0.50  % Current number of archived formulas  : 0
% 0.51/0.50  % Current number of archived clauses   : 811
% 0.51/0.50  % Clause-clause subsumption calls (NU) : 64947
% 0.51/0.50  % Rec. Clause-clause subsumption calls : 48748
% 0.51/0.50  % Non-unit clause-clause subsumptions  : 214
% 0.51/0.50  % Unit Clause-clause subsumption calls : 5947
% 0.51/0.50  % Rewrite failures with RHS unbound    : 0
% 0.51/0.50  % BW rewrite match attempts            : 810
% 0.51/0.50  % BW rewrite match successes           : 246
% 0.51/0.50  % Condensation attempts                : 0
% 0.51/0.50  % Condensation successes               : 0
% 0.51/0.50  % Termbank termtop insertions          : 38907
% 0.51/0.50  % Search garbage collected termcells   : 1461
% 0.51/0.50  
% 0.51/0.50  % -------------------------------------------------
% 0.51/0.50  % User time                : 0.073 s
% 0.51/0.50  % System time              : 0.005 s
% 0.51/0.50  % Total time               : 0.078 s
% 0.51/0.50  % Maximum resident set size: 4472 pages
% 0.51/0.50  
% 0.51/0.50  % -------------------------------------------------
% 0.51/0.50  % User time                : 0.273 s
% 0.51/0.50  % System time              : 0.031 s
% 0.51/0.50  % Total time               : 0.304 s
% 0.51/0.50  % Maximum resident set size: 5120 pages
% 0.51/0.50  % E exiting
%------------------------------------------------------------------------------