%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN939+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 : n002.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:16 EDT 2023

% Result   : Theorem 0.20s 0.58s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   20 (   4 unt;   6 typ;   0 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :   15 (   3 avg)
%            Number of connectives :   63 (  24   ~;  23   |;  10   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 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   :   27 (   9 sgn;   9   !;   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] :
      ( ! [X3] : q(f(X3))
     => ? [X4,X5] :
          ( ( p(f(X5))
           => p(X4) )
          & ( r(X5)
           => ( r(X2)
              & r(X1) ) )
          & q(X4) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

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

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

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

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

cnf(c_0_6,negated_conjecture,
    q(f(X1)),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_7,negated_conjecture,
    ( ~ p(X1)
    | ~ q(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_3,c_0_4]),c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    ( r(X1)
    | p(f(X1)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

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

cnf(c_0_10,negated_conjecture,
    r(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_6])]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYN939+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n002.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:27:18 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.57  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.004000 s
% 0.20/0.58  % SZS output end Proof
% 0.20/0.58  % Total time : 0.006000 s
%------------------------------------------------------------------------------