%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN941+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 : n029.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.20s 0.58s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   19 (   5 unt;   6 typ;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :   48 (  19   ~;  14   |;   9   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   21 (   8 sgn;   6   !;   4   ?;   0   :)

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

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

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

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

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

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

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

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

fof(c_0_2,negated_conjecture,
    ! [X7,X8] :
      ( q(f(esk1_0))
      & ( p(f(X8))
        | ~ q(X7) )
      & ( r(X8)
        | ~ p(X7)
        | ~ q(X7) )
      & ( ~ r(esk1_0)
        | ~ r(esk2_0)
        | ~ p(X7)
        | ~ q(X7) ) ),
    inference(distribute,[status(thm)],[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(f(X1))
    | ~ q(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

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

cnf(c_0_6,negated_conjecture,
    p(f(X1)),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ( r(X1)
    | ~ q(f(X2)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,negated_conjecture,
    ( ~ r(esk1_0)
    | ~ r(esk2_0)
    | ~ p(X1)
    | ~ q(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_9,negated_conjecture,
    r(X1),
    inference(spm,[status(thm)],[c_0_7,c_0_4]) ).

cnf(c_0_10,negated_conjecture,
    ( ~ p(X1)
    | ~ q(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_9])]) ).

cnf(c_0_11,negated_conjecture,
    ~ q(f(X1)),
    inference(spm,[status(thm)],[c_0_10,c_0_6]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_4,c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN941+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n029.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   : Sat Aug 26 21:29:25 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.56  start to proof: theBenchmark
% 0.20/0.58  % Version  : CSE_E---1.5
% 0.20/0.58  % Problem  : theBenchmark.p
% 0.20/0.58  % Proof found
% 0.20/0.58  % SZS status Theorem for theBenchmark.p
% 0.20/0.58  % SZS output start Proof
% See solution above
% 0.20/0.58  % Total time : 0.003000 s
% 0.20/0.58  % SZS output end Proof
% 0.20/0.58  % Total time : 0.006000 s
%------------------------------------------------------------------------------