%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN382+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/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:30 EDT 2023

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

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

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

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

tff(decl_25,type,
    esk2_1: $i > $i ).

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

fof(x2134,conjecture,
    ( ! [X1] :
      ? [X2] :
        ( ! [X3] : big_p(X2,X3)
        | big_q(X2,X1) )
   => ! [X3] :
      ? [X2] :
        ( big_p(X2,X3)
        | big_q(X2,X3) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2134) ).

fof(c_0_1,negated_conjecture,
    ~ ( ! [X1] :
        ? [X2] :
          ( ! [X3] : big_p(X2,X3)
          | big_q(X2,X1) )
     => ! [X3] :
        ? [X2] :
          ( big_p(X2,X3)
          | big_q(X2,X3) ) ),
    inference(assume_negation,[status(cth)],[x2134]) ).

fof(c_0_2,negated_conjecture,
    ! [X5,X6,X9] :
      ( ( big_p(esk1_0,X5)
        | big_q(esk2_1(X6),X6) )
      & ~ big_p(X9,esk3_0)
      & ~ big_q(X9,esk3_0) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).

cnf(c_0_3,negated_conjecture,
    ~ big_q(X1,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( big_p(esk1_0,X1)
    | big_q(esk2_1(X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ~ big_p(X1,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

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

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