%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN980+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 : n027.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:27 EDT 2023

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

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

tff(decl_23,type,
    f: $i > $i ).

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

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

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

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

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

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

cnf(c_0_4,negated_conjecture,
    ( r(esk1_0)
    | p(f(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

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

cnf(c_0_7,negated_conjecture,
    ( q(f(esk1_0),esk1_0)
    | r(esk1_0) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    ( q(f(esk1_0),esk1_0)
    | ~ r(X1) ),
    inference(spm,[status(thm)],[c_0_3,c_0_5]) ).

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

cnf(c_0_10,negated_conjecture,
    q(f(esk1_0),esk1_0),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

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

cnf(c_0_12,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_5]),c_0_9])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SYN980+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.14  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35  % Computer : n027.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sat Aug 26 17:46:20 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.20/0.59  start to proof: theBenchmark
% 0.20/0.61  % Version  : CSE_E---1.5
% 0.20/0.61  % Problem  : theBenchmark.p
% 0.20/0.61  % Proof found
% 0.20/0.61  % SZS status Theorem for theBenchmark.p
% 0.20/0.61  % SZS output start Proof
% See solution above
% 0.20/0.61  % Total time : 0.004000 s
% 0.20/0.61  % SZS output end Proof
% 0.20/0.61  % Total time : 0.006000 s
%------------------------------------------------------------------------------