%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN406+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 : 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 : Fri Sep  1 01:51:38 EDT 2023

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

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

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

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

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

fof(kalish240,conjecture,
    ( ( ! [X1] :
          ( f(X1)
         => g(X1) )
      & ? [X2] :
          ( f(X2)
          & h(X2) ) )
   => ? [X3] :
        ( g(X3)
        & h(X3) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish240) ).

fof(c_0_1,negated_conjecture,
    ~ ( ( ! [X1] :
            ( f(X1)
           => g(X1) )
        & ? [X2] :
            ( f(X2)
            & h(X2) ) )
     => ? [X3] :
          ( g(X3)
          & h(X3) ) ),
    inference(assume_negation,[status(cth)],[kalish240]) ).

fof(c_0_2,negated_conjecture,
    ! [X4,X6] :
      ( ( ~ f(X4)
        | g(X4) )
      & f(esk1_0)
      & h(esk1_0)
      & ( ~ g(X6)
        | ~ h(X6) ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).

cnf(c_0_3,negated_conjecture,
    ( ~ g(X1)
    | ~ h(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( g(X1)
    | ~ f(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ( ~ h(X1)
    | ~ f(X1) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_6,negated_conjecture,
    h(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_7,negated_conjecture,
    f(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem    : SYN406+1 : TPTP v8.1.2. Released v2.0.0.
% 0.02/0.10  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.09/0.31  % Computer : n023.cluster.edu
% 0.09/0.31  % Model    : x86_64 x86_64
% 0.09/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31  % Memory   : 8042.1875MB
% 0.09/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31  % CPULimit   : 300
% 0.09/0.31  % WCLimit    : 300
% 0.09/0.31  % DateTime   : Sat Aug 26 18:08:26 EDT 2023
% 0.09/0.31  % CPUTime  : 
% 0.15/0.46  start to proof: theBenchmark
% 0.15/0.48  % Version  : CSE_E---1.5
% 0.15/0.48  % Problem  : theBenchmark.p
% 0.15/0.48  % Proof found
% 0.15/0.48  % SZS status Theorem for theBenchmark.p
% 0.15/0.48  % SZS output start Proof
% See solution above
% 0.15/0.48  % Total time : 0.003000 s
% 0.15/0.48  % SZS output end Proof
% 0.15/0.48  % Total time : 0.005000 s
%------------------------------------------------------------------------------