TSTP Solution File: SYN190-1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN190-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n023.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep  1 01:50:30 EDT 2023

% Result   : Unsatisfiable 0.54s 0.73s
% Output   : CNFRefutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   78
% Syntax   : Number of formulae    :  131 (  35 unt;  53 typ;   0 def)
%            Number of atoms       :  162 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  171 (  87   ~;  84   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   90 (  48   >;  42   *;   0   +;   0  <<)
%            Number of predicates  :   49 (  48 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :  103 (  37 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    d: $i ).

tff(decl_23,type,
    s0: $i > $o ).

tff(decl_24,type,
    e: $i ).

tff(decl_25,type,
    q0: ( $i * $i ) > $o ).

tff(decl_26,type,
    n0: ( $i * $i ) > $o ).

tff(decl_27,type,
    a: $i ).

tff(decl_28,type,
    m0: ( $i * $i * $i ) > $o ).

tff(decl_29,type,
    b: $i ).

tff(decl_30,type,
    r0: $i > $o ).

tff(decl_31,type,
    p0: ( $i * $i ) > $o ).

tff(decl_32,type,
    c: $i ).

tff(decl_33,type,
    l0: $i > $o ).

tff(decl_34,type,
    k0: $i > $o ).

tff(decl_35,type,
    k1: $i > $o ).

tff(decl_36,type,
    l1: ( $i * $i ) > $o ).

tff(decl_37,type,
    m1: ( $i * $i * $i ) > $o ).

tff(decl_38,type,
    n1: ( $i * $i * $i ) > $o ).

tff(decl_39,type,
    p1: ( $i * $i * $i ) > $o ).

tff(decl_40,type,
    q1: ( $i * $i * $i ) > $o ).

tff(decl_41,type,
    r1: $i > $o ).

tff(decl_42,type,
    s1: $i > $o ).

tff(decl_43,type,
    k2: ( $i * $i ) > $o ).

tff(decl_44,type,
    l2: ( $i * $i ) > $o ).

tff(decl_45,type,
    m2: $i > $o ).

tff(decl_46,type,
    n2: $i > $o ).

tff(decl_47,type,
    p2: ( $i * $i * $i ) > $o ).

tff(decl_48,type,
    q2: ( $i * $i * $i ) > $o ).

tff(decl_49,type,
    r2: $i > $o ).

tff(decl_50,type,
    s2: $i > $o ).

tff(decl_51,type,
    k3: ( $i * $i * $i ) > $o ).

tff(decl_52,type,
    l3: ( $i * $i ) > $o ).

tff(decl_53,type,
    m3: ( $i * $i * $i ) > $o ).

tff(decl_54,type,
    n3: $i > $o ).

tff(decl_55,type,
    p3: ( $i * $i * $i ) > $o ).

tff(decl_56,type,
    q3: ( $i * $i ) > $o ).

tff(decl_57,type,
    r3: ( $i * $i * $i ) > $o ).

tff(decl_58,type,
    s3: ( $i * $i ) > $o ).

tff(decl_59,type,
    k4: $i > $o ).

tff(decl_60,type,
    l4: $i > $o ).

tff(decl_61,type,
    m4: ( $i * $i ) > $o ).

tff(decl_62,type,
    n4: ( $i * $i ) > $o ).

tff(decl_63,type,
    p4: ( $i * $i * $i ) > $o ).

tff(decl_64,type,
    q4: ( $i * $i ) > $o ).

tff(decl_65,type,
    r4: $i > $o ).

tff(decl_66,type,
    s4: $i > $o ).

tff(decl_67,type,
    k5: $i > $o ).

tff(decl_68,type,
    l5: $i > $o ).

tff(decl_69,type,
    m5: ( $i * $i ) > $o ).

tff(decl_70,type,
    n5: ( $i * $i ) > $o ).

tff(decl_71,type,
    p5: ( $i * $i * $i ) > $o ).

tff(decl_72,type,
    q5: ( $i * $i ) > $o ).

tff(decl_73,type,
    r5: ( $i * $i ) > $o ).

tff(decl_74,type,
    s5: $i > $o ).

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

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

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

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

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

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

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

cnf(rule_190,axiom,
    ( s2(d)
    | ~ s1(a)
    | ~ s0(d) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_190) ).

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

cnf(rule_260,axiom,
    ( r3(X1,X2,X2)
    | ~ s2(X2)
    | ~ l2(c,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_260) ).

cnf(rule_124,axiom,
    ( r1(X1)
    | ~ q0(X1,X2)
    | ~ s0(d)
    | ~ q1(d,X2,d) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_124) ).

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

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

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

cnf(rule_272,axiom,
    ( r3(X1,X2,X3)
    | ~ k2(X2,X3)
    | ~ r2(X3)
    | ~ r3(X3,X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_272) ).

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

cnf(rule_107,axiom,
    ( q1(e,X1,X1)
    | ~ m0(X1,d,X1)
    | ~ m0(e,d,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_107) ).

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

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

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

cnf(rule_268,axiom,
    ( r3(X1,X1,X2)
    | ~ m2(X2)
    | ~ m3(X3,b,X1)
    | ~ r3(X2,X4,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_268) ).

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

cnf(axiom_34,axiom,
    n0(c,d),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_34) ).

cnf(prove_this,negated_conjecture,
    ~ r3(a,X1,d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(rule_135,axiom,
    ( m2(X1)
    | ~ s0(X1)
    | ~ l1(X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_135) ).

cnf(c_0_25,axiom,
    ( s1(X1)
    | ~ q0(X1,X2)
    | ~ s1(X3) ),
    rule_126 ).

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

cnf(c_0_27,axiom,
    ( s1(X1)
    | ~ p0(X1,X1) ),
    rule_125 ).

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

cnf(c_0_29,plain,
    ( s1(X1)
    | ~ s1(X2) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,plain,
    s1(b),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,axiom,
    ( l2(X1,X1)
    | ~ p0(X2,X2)
    | ~ s1(X3)
    | ~ m0(X4,X3,X1) ),
    rule_133 ).

cnf(c_0_32,plain,
    s1(X1),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,plain,
    ( l2(X1,X1)
    | ~ p0(X2,X2)
    | ~ m0(X3,X4,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).

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

cnf(c_0_35,axiom,
    q0(a,b),
    axiom_36 ).

cnf(c_0_36,plain,
    ( l2(X1,X1)
    | ~ p0(X2,X2) ),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_37,axiom,
    ( s2(d)
    | ~ s1(a)
    | ~ s0(d) ),
    rule_190 ).

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

cnf(c_0_39,plain,
    ( s1(a)
    | ~ s1(X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_35]) ).

cnf(c_0_40,axiom,
    ( r3(X1,X2,X2)
    | ~ s2(X2)
    | ~ l2(c,X1) ),
    rule_260 ).

cnf(c_0_41,plain,
    l2(X1,X1),
    inference(spm,[status(thm)],[c_0_36,c_0_28]) ).

cnf(c_0_42,plain,
    ( s2(d)
    | ~ s1(a) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).

cnf(c_0_43,plain,
    s1(a),
    inference(spm,[status(thm)],[c_0_39,c_0_30]) ).

cnf(c_0_44,axiom,
    ( r1(X1)
    | ~ q0(X1,X2)
    | ~ s0(d)
    | ~ q1(d,X2,d) ),
    rule_124 ).

cnf(c_0_45,axiom,
    ( q1(d,d,d)
    | ~ k0(e)
    | ~ s0(d) ),
    rule_117 ).

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

cnf(c_0_47,plain,
    ( r3(c,X1,X1)
    | ~ s2(X1) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_48,plain,
    s2(d),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).

cnf(c_0_49,plain,
    ( r1(X1)
    | ~ q1(d,X2,d)
    | ~ q0(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_38])]) ).

cnf(c_0_50,plain,
    q1(d,d,d),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_38]),c_0_46])]) ).

cnf(c_0_51,axiom,
    ( m3(X1,X2,X1)
    | ~ m0(X3,X3,X2)
    | ~ l2(X4,X1)
    | ~ m0(X1,X4,X4)
    | ~ s2(X3) ),
    rule_225 ).

cnf(c_0_52,axiom,
    ( r3(X1,X2,X3)
    | ~ k2(X2,X3)
    | ~ r2(X3)
    | ~ r3(X3,X1,X1) ),
    rule_272 ).

cnf(c_0_53,plain,
    r3(c,d,d),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_54,axiom,
    ( r2(X1)
    | ~ r1(X1)
    | ~ l0(X1) ),
    rule_188 ).

cnf(c_0_55,plain,
    r1(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_26]),c_0_50])]) ).

cnf(c_0_56,axiom,
    ( q1(e,X1,X1)
    | ~ m0(X1,d,X1)
    | ~ m0(e,d,X1) ),
    rule_107 ).

cnf(c_0_57,plain,
    ( m3(X1,X2,X1)
    | ~ l2(X3,X1)
    | ~ m0(X1,X3,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_34]),c_0_48])]) ).

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

cnf(c_0_59,plain,
    ( r3(d,X1,c)
    | ~ r2(c)
    | ~ k2(X1,c) ),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_60,plain,
    ( r2(X1)
    | ~ l0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]) ).

cnf(c_0_61,axiom,
    l0(c),
    axiom_24 ).

cnf(c_0_62,axiom,
    ( k2(X1,X1)
    | ~ q1(X2,X1,X1) ),
    rule_129 ).

cnf(c_0_63,plain,
    q1(e,X1,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_34]),c_0_34])]) ).

cnf(c_0_64,axiom,
    ( r3(X1,X1,X2)
    | ~ m2(X2)
    | ~ m3(X3,b,X1)
    | ~ r3(X2,X4,X4) ),
    rule_268 ).

cnf(c_0_65,plain,
    m3(a,X1,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_41])]) ).

cnf(c_0_66,plain,
    ( r3(d,X1,c)
    | ~ k2(X1,c) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]) ).

cnf(c_0_67,plain,
    k2(X1,X1),
    inference(spm,[status(thm)],[c_0_62,c_0_63]) ).

cnf(c_0_68,axiom,
    ( l1(X1,X1)
    | ~ n0(X2,X1) ),
    rule_002 ).

cnf(c_0_69,axiom,
    n0(c,d),
    axiom_34 ).

cnf(c_0_70,plain,
    ( r3(a,a,X1)
    | ~ r3(X1,X2,X2)
    | ~ m2(X1) ),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_71,plain,
    r3(d,c,c),
    inference(spm,[status(thm)],[c_0_66,c_0_67]) ).

cnf(c_0_72,negated_conjecture,
    ~ r3(a,X1,d),
    prove_this ).

cnf(c_0_73,axiom,
    ( m2(X1)
    | ~ s0(X1)
    | ~ l1(X2,X3) ),
    rule_135 ).

cnf(c_0_74,plain,
    l1(d,d),
    inference(spm,[status(thm)],[c_0_68,c_0_69]) ).

cnf(c_0_75,plain,
    ~ m2(d),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]) ).

cnf(c_0_76,plain,
    ( m2(X1)
    | ~ s0(X1) ),
    inference(spm,[status(thm)],[c_0_73,c_0_74]) ).

cnf(c_0_77,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_38])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN190-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33  % Computer : n023.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Sat Aug 26 19:06:56 EDT 2023
% 0.13/0.33  % CPUTime  : 
% 0.19/0.57  start to proof: theBenchmark
% 0.54/0.73  % Version  : CSE_E---1.5
% 0.54/0.73  % Problem  : theBenchmark.p
% 0.54/0.73  % Proof found
% 0.54/0.73  % SZS status Theorem for theBenchmark.p
% 0.54/0.73  % SZS output start Proof
% See solution above
% 0.54/0.74  % Total time : 0.137000 s
% 0.54/0.74  % SZS output end Proof
% 0.54/0.74  % Total time : 0.147000 s
%------------------------------------------------------------------------------