%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : LCL664+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n021.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 : Thu Aug 31 06:58:33 EDT 2023

% Result   : Theorem 0.20s 0.60s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   19 (   3 unt;  12 typ;   0 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :   16 (   7 avg)
%            Number of connectives :   85 (  39   ~;  35   |;  11   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   8 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    8 (   7   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   23 (   0 sgn;  20   !;   2   ?;   0   :)

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

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

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

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

tff(decl_26,type,
    p15: $i > $o ).

tff(decl_27,type,
    p13: $i > $o ).

tff(decl_28,type,
    p11: $i > $o ).

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

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

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

tff(decl_32,type,
    esk4_0: $i ).

tff(decl_33,type,
    esk5_0: $i ).

fof(main,conjecture,
    ~ ? [X1] :
        ~ ( ~ ! [X2] :
                ( ~ r1(X1,X2)
                | p16(X2) )
          | ~ ! [X2] :
                ( ~ r1(X1,X2)
                | p12(X2) )
          | ~ ! [X2] :
                ( ~ r1(X1,X2)
                | p14(X2) )
          | ~ ! [X2] :
                ( ~ r1(X1,X2)
                | p12(X2) )
          | ! [X2] :
              ( ~ r1(X1,X2)
              | p15(X2) )
          | ! [X2] :
              ( ~ r1(X1,X2)
              | p13(X2) )
          | ! [X2] :
              ( ~ r1(X1,X2)
              | p12(X2) )
          | ! [X2] :
              ( ~ r1(X1,X2)
              | p11(X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

fof(c_0_1,negated_conjecture,
    ~ ~ ? [X1] :
          ~ ( ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | p16(X2) )
            | ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | p12(X2) )
            | ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | p14(X2) )
            | ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | p12(X2) )
            | ! [X2] :
                ( ~ r1(X1,X2)
                | p15(X2) )
            | ! [X2] :
                ( ~ r1(X1,X2)
                | p13(X2) )
            | ! [X2] :
                ( ~ r1(X1,X2)
                | p12(X2) )
            | ! [X2] :
                ( ~ r1(X1,X2)
                | p11(X2) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[main])]) ).

fof(c_0_2,negated_conjecture,
    ! [X5,X6,X7,X8] :
      ( ( ~ r1(esk1_0,X5)
        | p16(X5) )
      & ( ~ r1(esk1_0,X6)
        | p12(X6) )
      & ( ~ r1(esk1_0,X7)
        | p14(X7) )
      & ( ~ r1(esk1_0,X8)
        | p12(X8) )
      & r1(esk1_0,esk2_0)
      & ~ p15(esk2_0)
      & r1(esk1_0,esk3_0)
      & ~ p13(esk3_0)
      & r1(esk1_0,esk4_0)
      & ~ p12(esk4_0)
      & r1(esk1_0,esk5_0)
      & ~ p11(esk5_0) ),
    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,
    ~ p12(esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( p12(X1)
    | ~ r1(esk1_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    r1(esk1_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : LCL664+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35  % Computer : n021.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Fri Aug 25 05:06:25 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.58  start to proof: theBenchmark
% 0.20/0.60  % Version  : CSE_E---1.5
% 0.20/0.60  % Problem  : theBenchmark.p
% 0.20/0.60  % Proof found
% 0.20/0.60  % SZS status Theorem for theBenchmark.p
% 0.20/0.60  % SZS output start Proof
% See solution above
% 0.20/0.60  % Total time : 0.004000 s
% 0.20/0.60  % SZS output end Proof
% 0.20/0.60  % Total time : 0.007000 s
%------------------------------------------------------------------------------