%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN060+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/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:49:24 EDT 2023

% Result   : Theorem 0.20s 0.59s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   21 (   7 unt;   5 typ;   0 def)
%            Number of atoms       :   39 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   37 (  14   ~;  11   |;   6   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   11 (   0 sgn;   8   !;   0   ?;   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 > $o ).

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

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

fof(pel30,conjecture,
    ! [X1] : big_i(X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel30) ).

fof(pel30_2,axiom,
    ! [X1] :
      ( ( big_g(X1)
       => ~ big_i(X1) )
     => ( big_f(X1)
        & big_h(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel30_2) ).

fof(pel30_1,axiom,
    ! [X1] :
      ( ( big_f(X1)
        | big_g(X1) )
     => ~ big_h(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel30_1) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1] : big_i(X1),
    inference(assume_negation,[status(cth)],[pel30]) ).

fof(c_0_4,plain,
    ! [X1] :
      ( ( big_g(X1)
       => ~ big_i(X1) )
     => ( big_f(X1)
        & big_h(X1) ) ),
    inference(fof_simplification,[status(thm)],[pel30_2]) ).

fof(c_0_5,plain,
    ! [X1] :
      ( ( big_f(X1)
        | big_g(X1) )
     => ~ big_h(X1) ),
    inference(fof_simplification,[status(thm)],[pel30_1]) ).

fof(c_0_6,negated_conjecture,
    ~ big_i(esk1_0),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

fof(c_0_7,plain,
    ! [X3] :
      ( ( big_f(X3)
        | big_g(X3) )
      & ( big_h(X3)
        | big_g(X3) )
      & ( big_f(X3)
        | big_i(X3) )
      & ( big_h(X3)
        | big_i(X3) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_8,plain,
    ! [X2] :
      ( ( ~ big_f(X2)
        | ~ big_h(X2) )
      & ( ~ big_g(X2)
        | ~ big_h(X2) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

cnf(c_0_9,negated_conjecture,
    ~ big_i(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( big_f(X1)
    | big_i(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( ~ big_f(X1)
    | ~ big_h(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    big_f(esk1_0),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,plain,
    ( big_h(X1)
    | big_i(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_14,negated_conjecture,
    ~ big_h(esk1_0),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_13]),c_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN060+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34  % Computer : n012.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Sat Aug 26 21:09:25 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 0.20/0.57  start to proof: theBenchmark
% 0.20/0.59  % Version  : CSE_E---1.5
% 0.20/0.59  % Problem  : theBenchmark.p
% 0.20/0.59  % Proof found
% 0.20/0.59  % SZS status Theorem for theBenchmark.p
% 0.20/0.59  % SZS output start Proof
% See solution above
% 0.20/0.59  % Total time : 0.005000 s
% 0.20/0.59  % SZS output end Proof
% 0.20/0.59  % Total time : 0.008000 s
%------------------------------------------------------------------------------