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

% Computer : n017.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 02:00:17 EDT 2023

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

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

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

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

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

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

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

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

fof(prove_this,conjecture,
    ! [X1,X2,X3] :
      ( ( s(X1)
        & s(X2)
        & r(X2,X3)
        & ! [X4] :
            ( s(X4)
           => p(X4) )
        & ! [X4,X5] :
            ( r(X4,X5)
           => q(X4,X5) ) )
     => ? [X4,X5] :
          ( p(X4)
          & q(X4,X5) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(c_0_1,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ( s(X1)
          & s(X2)
          & r(X2,X3)
          & ! [X4] :
              ( s(X4)
             => p(X4) )
          & ! [X4,X5] :
              ( r(X4,X5)
             => q(X4,X5) ) )
       => ? [X4,X5] :
            ( p(X4)
            & q(X4,X5) ) ),
    inference(assume_negation,[status(cth)],[prove_this]) ).

fof(c_0_2,negated_conjecture,
    ! [X9,X10,X11,X12,X13] :
      ( s(esk1_0)
      & s(esk2_0)
      & r(esk2_0,esk3_0)
      & ( ~ s(X9)
        | p(X9) )
      & ( ~ r(X10,X11)
        | q(X10,X11) )
      & ( ~ p(X12)
        | ~ q(X12,X13) ) ),
    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,
    ( ~ p(X1)
    | ~ q(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( q(X1,X2)
    | ~ r(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ( ~ p(X1)
    | ~ r(X1,X2) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_6,negated_conjecture,
    r(esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_7,negated_conjecture,
    ~ p(esk2_0),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,negated_conjecture,
    ( p(X1)
    | ~ s(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_9,negated_conjecture,
    s(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN944+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n017.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.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sat Aug 26 21:17:11 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.21/0.61  start to proof: theBenchmark
% 0.21/0.63  % Version  : CSE_E---1.5
% 0.21/0.63  % Problem  : theBenchmark.p
% 0.21/0.63  % Proof found
% 0.21/0.63  % SZS status Theorem for theBenchmark.p
% 0.21/0.63  % SZS output start Proof
% See solution above
% 0.21/0.63  % Total time : 0.004000 s
% 0.21/0.63  % SZS output end Proof
% 0.21/0.63  % Total time : 0.007000 s
%------------------------------------------------------------------------------