TSTP Solution File: SYN193-10 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN193-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n012.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:31 EDT 2023

% Result   : Unsatisfiable 0.20s 0.63s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   67
% Syntax   : Number of formulae    :   89 (  34 unt;  55 typ;   0 def)
%            Number of atoms       :   34 (  33 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :   94 (  49   >;  45   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   55 (  55 usr;   6 con; 0-4 aty)
%            Number of variables   :   55 (  25 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    ifeq: ( $i * $i * $i * $i ) > $i ).

tff(decl_23,type,
    d: $i ).

tff(decl_24,type,
    s0: $i > $i ).

tff(decl_25,type,
    true: $i ).

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

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

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

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

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

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

tff(decl_32,type,
    r0: $i > $i ).

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

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

tff(decl_35,type,
    l0: $i > $i ).

tff(decl_36,type,
    k0: $i > $i ).

tff(decl_37,type,
    k1: $i > $i ).

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

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

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

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

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

tff(decl_43,type,
    r1: $i > $i ).

tff(decl_44,type,
    s1: $i > $i ).

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

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

tff(decl_47,type,
    m2: $i > $i ).

tff(decl_48,type,
    n2: $i > $i ).

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

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

tff(decl_51,type,
    r2: $i > $i ).

tff(decl_52,type,
    s2: $i > $i ).

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

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

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

tff(decl_56,type,
    n3: $i > $i ).

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

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

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

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

tff(decl_61,type,
    k4: $i > $i ).

tff(decl_62,type,
    l4: $i > $i ).

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

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

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

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

tff(decl_67,type,
    r4: $i > $i ).

tff(decl_68,type,
    s4: $i > $i ).

tff(decl_69,type,
    k5: $i > $i ).

tff(decl_70,type,
    l5: $i > $i ).

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

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

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

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

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

tff(decl_76,type,
    s5: $i > $i ).

cnf(rule_029,axiom,
    ifeq(p0(X1,X2),true,ifeq(s0(X1),true,m1(X1,X2,X1),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_029) ).

cnf(axiom_5,axiom,
    s0(b) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).

cnf(axiom_14,axiom,
    p0(b,X1) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_14) ).

cnf(ifeq_axiom,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).

cnf(rule_176,axiom,
    ifeq(m1(X1,X2,X1),true,p2(X2,X1,X2),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_176) ).

cnf(rule_240,axiom,
    ifeq(p2(X1,X2,X3),true,n3(X3),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_240) ).

cnf(rule_002,axiom,
    ifeq(n0(X1,X2),true,l1(X2,X2),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_002) ).

cnf(axiom_30,axiom,
    n0(e,e) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_30) ).

cnf(rule_298,axiom,
    ifeq(q3(X1,X2),true,ifeq(n3(X3),true,ifeq(p0(X4,X3),true,r4(X3),true),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_298) ).

cnf(rule_186,axiom,
    ifeq(l1(X1,X2),true,q2(X2,X2,X1),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_186) ).

cnf(rule_255,axiom,
    ifeq(q2(X1,X2,X3),true,ifeq(n0(X1,X2),true,q3(X2,X3),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_255) ).

cnf(prove_this,negated_conjecture,
    r4(b) != true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(c_0_12,axiom,
    ifeq(p0(X1,X2),true,ifeq(s0(X1),true,m1(X1,X2,X1),true),true) = true,
    rule_029 ).

cnf(c_0_13,axiom,
    s0(b) = true,
    axiom_5 ).

cnf(c_0_14,axiom,
    p0(b,X1) = true,
    axiom_14 ).

cnf(c_0_15,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    ifeq_axiom ).

cnf(c_0_16,axiom,
    ifeq(m1(X1,X2,X1),true,p2(X2,X1,X2),true) = true,
    rule_176 ).

cnf(c_0_17,plain,
    m1(b,X1,b) = true,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_15]) ).

cnf(c_0_18,axiom,
    ifeq(p2(X1,X2,X3),true,n3(X3),true) = true,
    rule_240 ).

cnf(c_0_19,plain,
    p2(X1,b,X1) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15]) ).

cnf(c_0_20,axiom,
    ifeq(n0(X1,X2),true,l1(X2,X2),true) = true,
    rule_002 ).

cnf(c_0_21,axiom,
    n0(e,e) = true,
    axiom_30 ).

cnf(c_0_22,axiom,
    ifeq(q3(X1,X2),true,ifeq(n3(X3),true,ifeq(p0(X4,X3),true,r4(X3),true),true),true) = true,
    rule_298 ).

cnf(c_0_23,plain,
    n3(X1) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_15]) ).

cnf(c_0_24,axiom,
    ifeq(l1(X1,X2),true,q2(X2,X2,X1),true) = true,
    rule_186 ).

cnf(c_0_25,plain,
    l1(e,e) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15]) ).

cnf(c_0_26,plain,
    ifeq(q3(X1,X2),true,ifeq(p0(X3,X4),true,r4(X4),true),true) = true,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_15]) ).

cnf(c_0_27,axiom,
    ifeq(q2(X1,X2,X3),true,ifeq(n0(X1,X2),true,q3(X2,X3),true),true) = true,
    rule_255 ).

cnf(c_0_28,plain,
    q2(e,e,e) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15]) ).

cnf(c_0_29,plain,
    ifeq(q3(X1,X2),true,r4(X3),true) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_14]),c_0_15]) ).

cnf(c_0_30,plain,
    q3(e,e) = true,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_21]),c_0_15]),c_0_15]) ).

cnf(c_0_31,negated_conjecture,
    r4(b) != true,
    prove_this ).

cnf(c_0_32,plain,
    r4(X1) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_15]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN193-10 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n012.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sat Aug 26 17:54:55 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.57  start to proof: theBenchmark
% 0.20/0.63  % Version  : CSE_E---1.5
% 0.20/0.63  % Problem  : theBenchmark.p
% 0.20/0.63  % Proof found
% 0.20/0.63  % SZS status Theorem for theBenchmark.p
% 0.20/0.63  % SZS output start Proof
% See solution above
% 0.20/0.64  % Total time : 0.052000 s
% 0.20/0.64  % SZS output end Proof
% 0.20/0.64  % Total time : 0.061000 s
%------------------------------------------------------------------------------