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

View Problem - Process Solution

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

% Computer : n015.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:14 EDT 2023

% Result   : Unsatisfiable 0.21s 0.64s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   55
% Syntax   : Number of formulae    :   58 (   5 unt;  53 typ;   0 def)
%            Number of atoms       :    5 (   0 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    :    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   :    4 (   4 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(prove_this,negated_conjecture,
    ~ m0(X1,e,a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

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

cnf(c_0_2,negated_conjecture,
    ~ m0(X1,e,a),
    prove_this ).

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

cnf(c_0_4,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_2,c_0_3]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SYN132-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.14  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.36  % Computer : n015.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Sat Aug 26 21:05:53 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 0.21/0.59  start to proof: theBenchmark
% 0.21/0.64  % Version  : CSE_E---1.5
% 0.21/0.64  % Problem  : theBenchmark.p
% 0.21/0.64  % Proof found
% 0.21/0.64  % SZS status Theorem for theBenchmark.p
% 0.21/0.64  % SZS output start Proof
% See solution above
% 0.21/0.64  % Total time : 0.036000 s
% 0.21/0.64  % SZS output end Proof
% 0.21/0.64  % Total time : 0.044000 s
%------------------------------------------------------------------------------