%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SWC269+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s

% Computer : n025.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  : 600s
% DateTime : Tue Jul 19 20:30:44 EDT 2022

% Result   : Theorem 0.20s 0.39s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    8 (   5 unt;   0 def)
%            Number of atoms       :   47 (   7 equ)
%            Maximal formula atoms :   14 (   5 avg)
%            Number of connectives :   56 (  17   ~;  14   |;  17   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   8 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   11 (   0 sgn   9   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ~ frontsegP(X4,X3)
                    | ~ totalorderedP(X3)
                    | ? [X5] :
                        ( ssList(X5)
                        & neq(X3,X5)
                        & frontsegP(X4,X5)
                        & segmentP(X5,X3)
                        & totalorderedP(X5) )
                    | totalorderedP(X1) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(c_0_1,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ~ frontsegP(X4,X3)
                      | ~ totalorderedP(X3)
                      | ? [X5] :
                          ( ssList(X5)
                          & neq(X3,X5)
                          & frontsegP(X4,X5)
                          & segmentP(X5,X3)
                          & totalorderedP(X5) )
                      | totalorderedP(X1) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_2,negated_conjecture,
    ! [X255] :
      ( ssList(esk48_0)
      & ssList(esk49_0)
      & ssList(esk50_0)
      & ssList(esk51_0)
      & esk49_0 = esk51_0
      & esk48_0 = esk50_0
      & frontsegP(esk51_0,esk50_0)
      & totalorderedP(esk50_0)
      & ( ~ ssList(X255)
        | ~ neq(esk50_0,X255)
        | ~ frontsegP(esk51_0,X255)
        | ~ segmentP(X255,esk50_0)
        | ~ totalorderedP(X255) )
      & ~ totalorderedP(esk48_0) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])])])])]) ).

cnf(c_0_3,negated_conjecture,
    ~ totalorderedP(esk48_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    esk48_0 = esk50_0,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    totalorderedP(esk50_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    ~ totalorderedP(esk50_0),
    inference(rw,[status(thm)],[c_0_3,c_0_4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWC269+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.35  % Computer : n025.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  : 600
% 0.13/0.35  % DateTime : Sun Jun 12 03:54:07 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.39  # No SInE strategy applied
% 0.20/0.39  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4c
% 0.20/0.39  # and selection function SelectCQPrecWNTNp.
% 0.20/0.39  #
% 0.20/0.39  # Presaturation interreduction done
% 0.20/0.39  
% 0.20/0.39  # Proof found!
% 0.20/0.39  # SZS status Theorem
% 0.20/0.39  # SZS output start CNFRefutation
% See solution above
% 0.20/0.39  # Training examples: 0 positive, 0 negative
%------------------------------------------------------------------------------