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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN069+1 : TPTP v8.1.2. Released v2.0.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:49:54 EDT 2023

% Result   : Theorem 0.22s 0.61s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   33 (   5 unt;   9 typ;   0 def)
%            Number of atoms       :   89 (   0 equ)
%            Maximal formula atoms :   27 (   3 avg)
%            Number of connectives :  102 (  37   ~;  38   |;  23   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   10 (   8   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   34 (   7 sgn;  13   !;   6   ?;   0   :)

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

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

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

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

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

tff(decl_27,type,
    big_l: $i > $o ).

tff(decl_28,type,
    esk1_1: $i > $i ).

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

tff(decl_30,type,
    esk3_1: $i > $i ).

fof(pel45_1,axiom,
    ! [X1] :
      ( ( big_f(X1)
        & ! [X2] :
            ( ( big_g(X2)
              & big_h(X1,X2) )
           => big_j(X1,X2) ) )
     => ! [X3] :
          ( big_g(X3)
          & big_h(X1,X3)
          & big_k(X3) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel45_1) ).

fof(pel45_3,axiom,
    ? [X1] :
      ( big_f(X1)
      & ! [X2] :
          ( big_h(X1,X2)
         => big_l(X2) )
      & ! [X3] :
          ( ( big_g(X3)
            & big_h(X1,X3) )
         => big_j(X1,X3) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel45_3) ).

fof(pel45_2,axiom,
    ~ ? [X2] :
        ( big_l(X2)
        & big_k(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel45_2) ).

fof(pel45,conjecture,
    ? [X1] :
      ( big_f(X1)
      & ~ ? [X2] :
            ( big_g(X2)
            & big_h(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel45) ).

fof(c_0_4,plain,
    ! [X4,X6,X7,X8] :
      ( ( big_g(X6)
        | big_g(esk1_1(X4))
        | ~ big_f(X4) )
      & ( big_h(X4,X7)
        | big_g(esk1_1(X4))
        | ~ big_f(X4) )
      & ( big_k(X8)
        | big_g(esk1_1(X4))
        | ~ big_f(X4) )
      & ( big_g(X6)
        | big_h(X4,esk1_1(X4))
        | ~ big_f(X4) )
      & ( big_h(X4,X7)
        | big_h(X4,esk1_1(X4))
        | ~ big_f(X4) )
      & ( big_k(X8)
        | big_h(X4,esk1_1(X4))
        | ~ big_f(X4) )
      & ( big_g(X6)
        | ~ big_j(X4,esk1_1(X4))
        | ~ big_f(X4) )
      & ( big_h(X4,X7)
        | ~ big_j(X4,esk1_1(X4))
        | ~ big_f(X4) )
      & ( big_k(X8)
        | ~ big_j(X4,esk1_1(X4))
        | ~ big_f(X4) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[pel45_1])])])])])]) ).

fof(c_0_5,plain,
    ! [X11,X12] :
      ( big_f(esk2_0)
      & ( ~ big_h(esk2_0,X11)
        | big_l(X11) )
      & ( ~ big_g(X12)
        | ~ big_h(esk2_0,X12)
        | big_j(esk2_0,X12) ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel45_3])])])]) ).

cnf(c_0_6,plain,
    ( big_g(X1)
    | big_g(esk1_1(X2))
    | ~ big_f(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    big_f(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    ( big_g(esk1_1(esk2_0))
    | big_g(X1) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

fof(c_0_9,plain,
    ! [X9] :
      ( ~ big_l(X9)
      | ~ big_k(X9) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel45_2])]) ).

cnf(c_0_10,plain,
    ( big_k(X1)
    | ~ big_j(X2,esk1_1(X2))
    | ~ big_f(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_11,plain,
    ( big_j(esk2_0,X1)
    | ~ big_g(X1)
    | ~ big_h(esk2_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_12,plain,
    big_g(esk1_1(esk2_0)),
    inference(ef,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( ~ big_l(X1)
    | ~ big_k(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    ( big_l(X1)
    | ~ big_h(esk2_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_15,plain,
    ( big_k(X1)
    | big_h(X2,esk1_1(X2))
    | ~ big_f(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_16,plain,
    ( big_k(X1)
    | ~ big_h(esk2_0,esk1_1(esk2_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_7]),c_0_12])]) ).

fof(c_0_17,negated_conjecture,
    ~ ? [X1] :
        ( big_f(X1)
        & ~ ? [X2] :
              ( big_g(X2)
              & big_h(X1,X2) ) ),
    inference(assume_negation,[status(cth)],[pel45]) ).

cnf(c_0_18,plain,
    ( ~ big_k(X1)
    | ~ big_h(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,plain,
    big_k(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_7]),c_0_16]) ).

fof(c_0_20,negated_conjecture,
    ! [X13] :
      ( ( big_g(esk3_1(X13))
        | ~ big_f(X13) )
      & ( big_h(X13,esk3_1(X13))
        | ~ big_f(X13) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).

cnf(c_0_21,plain,
    ~ big_h(esk2_0,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).

cnf(c_0_22,negated_conjecture,
    ( big_h(X1,esk3_1(X1))
    | ~ big_f(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem    : SYN069+1 : TPTP v8.1.2. Released v2.0.0.
% 0.14/0.15  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.15/0.36  % Computer : n021.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Sat Aug 26 18:22:57 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 0.22/0.59  start to proof: theBenchmark
% 0.22/0.61  % Version  : CSE_E---1.5
% 0.22/0.61  % Problem  : theBenchmark.p
% 0.22/0.61  % Proof found
% 0.22/0.61  % SZS status Theorem for theBenchmark.p
% 0.22/0.61  % SZS output start Proof
% See solution above
% 0.22/0.61  % Total time : 0.008000 s
% 0.22/0.61  % SZS output end Proof
% 0.22/0.61  % Total time : 0.011000 s
%------------------------------------------------------------------------------