%------------------------------------------------------------------------------
% File     : PyRes---1.5
% Problem  : SWC262+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n014.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 May  9 17:43:42 EDT 2024

% Result   : Theorem 0.65s 0.84s
% Output   : Refutation 0.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (   6 unt;   0 def)
%            Number of atoms       :   61 (  17 equ)
%            Maximal formula atoms :    8 (   4 avg)
%            Number of connectives :   65 (  19   ~;  13   |;  21   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   24 (   0 sgn  12   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ! [X] :
                  ( ssList(X)
                 => ( V != X
                    | U != W
                    | ~ totalorderedP(W)
                    | totalorderedP(U) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(c23,negated_conjecture,
    ~ ! [U] :
        ( ssList(U)
       => ! [V] :
            ( ssList(V)
           => ! [W] :
                ( ssList(W)
               => ! [X] :
                    ( ssList(X)
                   => ( V != X
                      | U != W
                      | ~ totalorderedP(W)
                      | totalorderedP(U) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c24,negated_conjecture,
    ~ ! [U] :
        ( ssList(U)
       => ! [V] :
            ( ssList(V)
           => ! [W] :
                ( ssList(W)
               => ! [X] :
                    ( ssList(X)
                   => ( V != X
                      | U != W
                      | ~ totalorderedP(W)
                      | totalorderedP(U) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[c23]) ).

fof(c25,negated_conjecture,
    ? [U] :
      ( ssList(U)
      & ? [V] :
          ( ssList(V)
          & ? [W] :
              ( ssList(W)
              & ? [X] :
                  ( ssList(X)
                  & V = X
                  & U = W
                  & totalorderedP(W)
                  & ~ totalorderedP(U) ) ) ) ),
    inference(fof_nnf,[status(thm)],[c24]) ).

fof(c26,negated_conjecture,
    ? [X2] :
      ( ssList(X2)
      & ? [X3] :
          ( ssList(X3)
          & ? [X4] :
              ( ssList(X4)
              & ? [X5] :
                  ( ssList(X5)
                  & X3 = X5
                  & X2 = X4
                  & totalorderedP(X4)
                  & ~ totalorderedP(X2) ) ) ) ),
    inference(variable_rename,[status(thm)],[c25]) ).

fof(c27,negated_conjecture,
    ( ssList(skolem0001)
    & ssList(skolem0002)
    & ssList(skolem0003)
    & ssList(skolem0004)
    & skolem0002 = skolem0004
    & skolem0001 = skolem0003
    & totalorderedP(skolem0003)
    & ~ totalorderedP(skolem0001) ),
    inference(skolemize,[status(esa)],[c26]) ).

cnf(c35,negated_conjecture,
    ~ totalorderedP(skolem0001),
    inference(split_conjunct,[status(thm)],[c27]) ).

cnf(c34,negated_conjecture,
    totalorderedP(skolem0003),
    inference(split_conjunct,[status(thm)],[c27]) ).

cnf(symmetry,axiom,
    ( X252 != X251
    | X251 = X252 ),
    theory(equality) ).

cnf(c33,negated_conjecture,
    skolem0001 = skolem0003,
    inference(split_conjunct,[status(thm)],[c27]) ).

cnf(c516,plain,
    skolem0003 = skolem0001,
    inference(resolution,[status(thm)],[c33,symmetry]) ).

cnf(c17,axiom,
    ( X330 != X331
    | ~ totalorderedP(X330)
    | totalorderedP(X331) ),
    theory(equality) ).

cnf(c632,plain,
    ( ~ totalorderedP(skolem0003)
    | totalorderedP(skolem0001) ),
    inference(resolution,[status(thm)],[c17,c516]) ).

cnf(c641,plain,
    totalorderedP(skolem0001),
    inference(resolution,[status(thm)],[c632,c34]) ).

cnf(c642,plain,
    $false,
    inference(resolution,[status(thm)],[c641,c35]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.15  % Problem  : SWC262+1 : TPTP v8.1.2. Released v2.4.0.
% 0.04/0.15  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.15/0.37  % Computer : n014.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 300
% 0.15/0.37  % DateTime : Thu May  9 02:15:23 EDT 2024
% 0.15/0.37  % CPUTime  : 
% 0.65/0.84  % Version:  1.5
% 0.65/0.84  % SZS status Theorem
% 0.65/0.84  % SZS output start CNFRefutation
% See solution above
% 0.65/0.84  
% 0.65/0.84  % Initial clauses    : 224
% 0.65/0.84  % Processed clauses  : 108
% 0.65/0.84  % Factors computed   : 3
% 0.65/0.84  % Resolvents computed: 135
% 0.65/0.84  % Tautologies deleted: 10
% 0.65/0.84  % Forward subsumed   : 12
% 0.65/0.84  % Backward subsumed  : 1
% 0.65/0.84  % -------- CPU Time ---------
% 0.65/0.84  % User time          : 0.442 s
% 0.65/0.84  % System time        : 0.023 s
% 0.65/0.84  % Total time         : 0.466 s
%------------------------------------------------------------------------------