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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN144-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 : n021.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:18 EDT 2023

% Result   : Unsatisfiable 0.20s 0.66s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   65
% Syntax   : Number of formulae    :   86 (  17 unt;  53 typ;   0 def)
%            Number of atoms       :   57 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   50 (  26   ~;  24   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 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   :   36 (   9 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_021,axiom,
    ( m1(X1,X2,X1)
    | ~ l0(X1)
    | ~ k0(X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_021) ).

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

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

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

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

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

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

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

cnf(rule_285,axiom,
    ( p4(X1,X1,X2)
    | ~ r0(X1)
    | ~ r3(X2,X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_285) ).

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

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

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

cnf(c_0_12,axiom,
    ( m1(X1,X2,X1)
    | ~ l0(X1)
    | ~ k0(X2) ),
    rule_021 ).

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

cnf(c_0_14,plain,
    ( m1(X1,e,X1)
    | ~ l0(X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

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

cnf(c_0_16,axiom,
    ( p2(X1,X2,X1)
    | ~ m1(X2,X1,X2) ),
    rule_176 ).

cnf(c_0_17,plain,
    m1(a,e,a),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,axiom,
    ( p2(X1,X2,X2)
    | ~ k1(X3)
    | ~ p2(e,X1,X2) ),
    rule_155 ).

cnf(c_0_19,plain,
    p2(e,a,e),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,axiom,
    ( k1(X1)
    | ~ n0(X2,X1) ),
    rule_001 ).

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

cnf(c_0_22,plain,
    ( p2(a,e,e)
    | ~ k1(X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,plain,
    k1(c),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,axiom,
    ( r3(X1,X2,X1)
    | ~ p2(X1,X3,X2) ),
    rule_267 ).

cnf(c_0_25,plain,
    p2(a,e,e),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,axiom,
    ( p4(X1,X1,X2)
    | ~ r0(X1)
    | ~ r3(X2,X1,X2) ),
    rule_285 ).

cnf(c_0_27,plain,
    r3(a,e,a),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

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

cnf(c_0_29,axiom,
    ( m5(X1,X2)
    | ~ r0(X1)
    | ~ p4(X1,X3,X2) ),
    rule_303 ).

cnf(c_0_30,plain,
    p4(e,e,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).

cnf(c_0_31,negated_conjecture,
    ~ m5(e,a),
    prove_this ).

cnf(c_0_32,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_28])]),c_0_31]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SYN144-1 : TPTP v8.1.2. Released v1.1.0.
% 0.13/0.14  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35  % Computer : n021.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sat Aug 26 17:40:42 EDT 2023
% 0.20/0.35  % CPUTime  : 
% 0.20/0.58  start to proof: theBenchmark
% 0.20/0.66  % Version  : CSE_E---1.5
% 0.20/0.66  % Problem  : theBenchmark.p
% 0.20/0.66  % Proof found
% 0.20/0.66  % SZS status Theorem for theBenchmark.p
% 0.20/0.66  % SZS output start Proof
% See solution above
% 0.20/0.66  % Total time : 0.061000 s
% 0.20/0.66  % SZS output end Proof
% 0.20/0.66  % Total time : 0.069000 s
%------------------------------------------------------------------------------