TSTP Solution File: GEO499+1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : GEO499+1 : TPTP v8.1.2. Released v7.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/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 : Wed Aug 30 22:48:26 EDT 2023

% Result   : Theorem 0.53s 0.76s
% Output   : CNFRefutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   32
% Syntax   : Number of formulae    :   48 (   9 unt;  28 typ;   0 def)
%            Number of atoms       :   31 (   3 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   24 (  13   ~;  10   |;   1   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   92 (  20   >;  72   *;   0   +;   0  <<)
%            Number of predicates  :   13 (  11 usr;   1 prp; 0-8 aty)
%            Number of functors    :   17 (  17 usr;   8 con; 0-6 aty)
%            Number of variables   :   43 (   0 sgn;  33   !;   0   ?;   0   :)

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

tff(decl_23,type,
    ext: ( $i * $i * $i * $i ) > $i ).

tff(decl_24,type,
    s_t: ( $i * $i * $i ) > $o ).

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

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

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

tff(decl_28,type,
    gamma: $i ).

tff(decl_29,type,
    crossbar: ( $i * $i * $i * $i * $i * $i ) > $i ).

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

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

tff(decl_32,type,
    s_e3: ( $i * $i * $i * $i * $i * $i ) > $o ).

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

tff(decl_34,type,
    insert5: ( $i * $i * $i * $i * $i ) > $i ).

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

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

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

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

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

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

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

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

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

tff(decl_44,type,
    xb: $i ).

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

tff(decl_46,type,
    esk1_0: $i ).

tff(decl_47,type,
    esk2_0: $i ).

tff(decl_48,type,
    esk3_0: $i ).

tff(decl_49,type,
    esk4_0: $i ).

fof(aSatz3_2,axiom,
    ! [X12,X15,X14] :
      ( ~ s_t(X12,X15,X14)
      | s_t(X14,X15,X12) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz3_2) ).

fof(aSatz7_15b,conjecture,
    ! [X13,X16,X27,X12] :
      ( s_t(X13,X16,X27)
      | ~ s_t(s(X12,X13),s(X12,X16),s(X12,X27)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_15b) ).

fof(aSatz7_15a,axiom,
    ! [X13,X16,X27,X12] :
      ( ~ s_t(X13,X16,X27)
      | s_t(s(X12,X13),s(X12,X16),s(X12,X27)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_15a) ).

fof(aSatz7_7,axiom,
    ! [X12,X13] : s(X12,s(X12,X13)) = X13,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_7) ).

fof(c_0_4,plain,
    ! [X12,X15,X14] :
      ( ~ s_t(X12,X15,X14)
      | s_t(X14,X15,X12) ),
    inference(fof_simplification,[status(thm)],[aSatz3_2]) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X13,X16,X27,X12] :
        ( s_t(X13,X16,X27)
        | ~ s_t(s(X12,X13),s(X12,X16),s(X12,X27)) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[aSatz7_15b])]) ).

fof(c_0_6,plain,
    ! [X13,X16,X27,X12] :
      ( ~ s_t(X13,X16,X27)
      | s_t(s(X12,X13),s(X12,X16),s(X12,X27)) ),
    inference(fof_simplification,[status(thm)],[aSatz7_15a]) ).

fof(c_0_7,plain,
    ! [X118,X119,X120] :
      ( ~ s_t(X118,X119,X120)
      | s_t(X120,X119,X118) ),
    inference(variable_rename,[status(thm)],[c_0_4]) ).

fof(c_0_8,negated_conjecture,
    ( ~ s_t(esk1_0,esk2_0,esk3_0)
    & s_t(s(esk4_0,esk1_0),s(esk4_0,esk2_0),s(esk4_0,esk3_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

fof(c_0_9,plain,
    ! [X423,X424,X425,X426] :
      ( ~ s_t(X423,X424,X425)
      | s_t(s(X426,X423),s(X426,X424),s(X426,X425)) ),
    inference(variable_rename,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( s_t(X3,X2,X1)
    | ~ s_t(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    s_t(s(esk4_0,esk1_0),s(esk4_0,esk2_0),s(esk4_0,esk3_0)),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,plain,
    ( s_t(s(X4,X1),s(X4,X2),s(X4,X3))
    | ~ s_t(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    s_t(s(esk4_0,esk3_0),s(esk4_0,esk2_0),s(esk4_0,esk1_0)),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

fof(c_0_14,plain,
    ! [X407,X408] : s(X407,s(X407,X408)) = X408,
    inference(variable_rename,[status(thm)],[aSatz7_7]) ).

cnf(c_0_15,negated_conjecture,
    s_t(s(X1,s(esk4_0,esk3_0)),s(X1,s(esk4_0,esk2_0)),s(X1,s(esk4_0,esk1_0))),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,plain,
    s(X1,s(X1,X2)) = X2,
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    s_t(esk3_0,esk2_0,esk1_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_16]),c_0_16]) ).

cnf(c_0_18,negated_conjecture,
    ~ s_t(esk1_0,esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_17]),c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : GEO499+1 : TPTP v8.1.2. Released v7.0.0.
% 0.12/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n023.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   : Tue Aug 29 22:48:54 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.56  start to proof: theBenchmark
% 0.53/0.76  % Version  : CSE_E---1.5
% 0.53/0.76  % Problem  : theBenchmark.p
% 0.53/0.76  % Proof found
% 0.53/0.76  % SZS status Theorem for theBenchmark.p
% 0.53/0.76  % SZS output start Proof
% See solution above
% 0.54/0.77  % Total time : 0.194000 s
% 0.54/0.77  % SZS output end Proof
% 0.54/0.77  % Total time : 0.201000 s
%------------------------------------------------------------------------------