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

% Computer : n020.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 21:49:16 EDT 2022

% Result   : Theorem 5.55s 5.77s
% Output   : Refutation 5.55s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named eq_axiom)

% Comments : 
%------------------------------------------------------------------------------
cnf(symmetry,axiom,
    ( X251 != X252
    | X252 = X251 ),
    eq_axiom ).

fof(co1,conjecture,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ! [X] :
                  ( ssList(X)
                 => ( V != X
                    | U != W
                    | ~ neq(V,nil)
                    | ~ segmentP(X,W)
                    | ( ~ singletonP(W)
                      & neq(X,nil) )
                    | ( singletonP(U)
                      & segmentP(V,U) ) ) ) ) ) ),
    input ).

fof(c23,negated_conjecture,
    ~ ! [U] :
        ( ssList(U)
       => ! [V] :
            ( ssList(V)
           => ! [W] :
                ( ssList(W)
               => ! [X] :
                    ( ssList(X)
                   => ( V != X
                      | U != W
                      | ~ neq(V,nil)
                      | ~ segmentP(X,W)
                      | ( ~ singletonP(W)
                        & neq(X,nil) )
                      | ( singletonP(U)
                        & segmentP(V,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
                      | ~ neq(V,nil)
                      | ~ segmentP(X,W)
                      | ( ~ singletonP(W)
                        & neq(X,nil) )
                      | ( singletonP(U)
                        & segmentP(V,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
                  & neq(V,nil)
                  & segmentP(X,W)
                  & ( singletonP(W)
                    | ~ neq(X,nil) )
                  & ( ~ singletonP(U)
                    | ~ segmentP(V,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
                  & neq(X3,nil)
                  & segmentP(X5,X4)
                  & ( singletonP(X4)
                    | ~ neq(X5,nil) )
                  & ( ~ singletonP(X2)
                    | ~ segmentP(X3,X2) ) ) ) ) ),
    inference(variable_rename,status(thm),[c25]) ).

fof(c27,negated_conjecture,
    ( ssList(skolem0001)
    & ssList(skolem0002)
    & ssList(skolem0003)
    & ssList(skolem0004)
    & skolem0002 = skolem0004
    & skolem0001 = skolem0003
    & neq(skolem0002,nil)
    & segmentP(skolem0004,skolem0003)
    & ( singletonP(skolem0003)
      | ~ neq(skolem0004,nil) )
    & ( ~ singletonP(skolem0001)
      | ~ segmentP(skolem0002,skolem0001) ) ),
    inference(skolemize,status(esa),[c26]) ).

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

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

cnf(c8,plain,
    ( X290 != X291
    | ~ singletonP(X290)
    | singletonP(X291) ),
    eq_axiom ).

cnf(c572,plain,
    ( ~ singletonP(skolem0003)
    | singletonP(skolem0001) ),
    inference(resolution,status(thm),[c8,c514]) ).

cnf(c36,negated_conjecture,
    ( singletonP(skolem0003)
    | ~ neq(skolem0004,nil) ),
    inference(split_conjunct,status(thm),[c27]) ).

cnf(c32,negated_conjecture,
    skolem0002 = skolem0004,
    inference(split_conjunct,status(thm),[c27]) ).

cnf(reflexivity,axiom,
    X250 = X250,
    eq_axiom ).

cnf(c34,negated_conjecture,
    neq(skolem0002,nil),
    inference(split_conjunct,status(thm),[c27]) ).

cnf(c5,plain,
    ( X277 != X278
    | X276 != X279
    | ~ neq(X277,X276)
    | neq(X278,X279) ),
    eq_axiom ).

cnf(c554,plain,
    ( skolem0002 != X720
    | nil != X721
    | neq(X720,X721) ),
    inference(resolution,status(thm),[c5,c34]) ).

cnf(c19710,plain,
    ( skolem0002 != X722
    | neq(X722,nil) ),
    inference(resolution,status(thm),[c554,reflexivity]) ).

cnf(c19711,plain,
    neq(skolem0004,nil),
    inference(resolution,status(thm),[c19710,c32]) ).

cnf(c19717,plain,
    singletonP(skolem0003),
    inference(resolution,status(thm),[c19711,c36]) ).

cnf(c19721,plain,
    singletonP(skolem0001),
    inference(resolution,status(thm),[c19717,c572]) ).

cnf(c37,negated_conjecture,
    ( ~ singletonP(skolem0001)
    | ~ segmentP(skolem0002,skolem0001) ),
    inference(split_conjunct,status(thm),[c27]) ).

cnf(c511,plain,
    skolem0004 = skolem0002,
    inference(resolution,status(thm),[c32,symmetry]) ).

cnf(c35,negated_conjecture,
    segmentP(skolem0004,skolem0003),
    inference(split_conjunct,status(thm),[c27]) ).

cnf(c11,plain,
    ( X304 != X305
    | X303 != X306
    | ~ segmentP(X304,X303)
    | segmentP(X305,X306) ),
    eq_axiom ).

cnf(c606,plain,
    ( skolem0004 != X778
    | skolem0003 != X777
    | segmentP(X778,X777) ),
    inference(resolution,status(thm),[c11,c35]) ).

cnf(c20109,plain,
    ( skolem0004 != X817
    | segmentP(X817,skolem0001) ),
    inference(resolution,status(thm),[c606,c514]) ).

cnf(c20328,plain,
    segmentP(skolem0002,skolem0001),
    inference(resolution,status(thm),[c20109,c511]) ).

cnf(c20334,plain,
    ~ singletonP(skolem0001),
    inference(resolution,status(thm),[c20328,c37]) ).

cnf(c20341,plain,
    $false,
    inference(resolution,status(thm),[c20334,c19721]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SWC385+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.33  % Computer : n020.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jun 12 14:24:05 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 5.55/5.77  # Version:  1.3
% 5.55/5.77  # SZS status Theorem
% 5.55/5.77  # SZS output start CNFRefutation
% See solution above
% 5.55/5.77  
% 5.55/5.77  # Initial clauses    : 226
% 5.55/5.77  # Processed clauses  : 953
% 5.55/5.77  # Factors computed   : 0
% 5.55/5.77  # Resolvents computed: 19835
% 5.55/5.77  # Tautologies deleted: 13
% 5.55/5.77  # Forward subsumed   : 324
% 5.55/5.77  # Backward subsumed  : 6
% 5.55/5.77  # -------- CPU Time ---------
% 5.55/5.77  # User time          : 5.378 s
% 5.55/5.77  # System time        : 0.046 s
% 5.55/5.77  # Total time         : 5.424 s
%------------------------------------------------------------------------------