↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SWC206+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

% Computer : n012.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 03:05:40 PM UTC 2026

% Result   : Theorem 55.66s 7.46s
% Output   : Proof 55.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   40
%            Number of leaves      :   20
% Syntax   : Number of formulae    :  167 ( 104 unt;   0 def)
%            Number of atoms       :  458 ( 161 equ)
%            Maximal formula atoms :   19 (   2 avg)
%            Number of connectives :  503 ( 212   ~; 165   |;  75   &)
%                                         (   5 <=>;  46  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   4 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   1 prp; 0-2 aty)
%            Number of functors    :   25 (  25 usr;  10 con; 0-4 aty)
%            Number of variables   :  184 (   2 sgn 103   !;  19   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f14,axiom,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ( neq(U,V)
          <=> U != V ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).

fof(f14_nnf,plain,
    ! [U] :
      ( ! [V] :
          ( ( ( U = V
              | neq(U,V) )
            & ( U != V
              | ~ neq(U,V) ) )
          | ~ ssList(V) )
      | ~ ssList(U) ),
    inference(nnf_transformation,[status(thm)],[f14]) ).

fof(f14_sk,plain,
    ! [U,V] :
      ( ( ( U = V
          | neq(U,V) )
        & ( U != V
          | ~ neq(U,V) ) )
      | ~ ssList(V)
      | ~ ssList(U) ),
    inference(skolemisation,[status(esa)],[f14_nnf]) ).

cnf(c80,plain,
    ( X0 != X1
    | ~ neq(X0,X1)
    | ~ ssList(X1)
    | ~ ssList(X0) ),
    inference(cnf_transformation,[status(esa)],[f14_sk]) ).

cnf(t186,plain,
    ifeq(ssList(X1),true,ifeq(ssList(X2),true,ifeq(neq(X1,X2),true,ifeq(X1,X2,false,true),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c80]) ).

cnf(t400,plain,
    ifeq(ssList(X1),true,ifeq(ssList(X2),true,ifeq(neq(X1,X2),true,ifeq(X1,X2,false,true),true),true),true) = true,
    inference(orient,[status(thm)],[t186]) ).

fof(f95,conjecture,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ! [X] :
                  ( ssList(X)
                 => ( ( neq(X,nil)
                      & ! [Y] :
                          ( ssList(Y)
                         => ( ~ segmentP(W,Y)
                            | ~ segmentP(X,Y)
                            | ~ neq(Y,nil) ) ) )
                    | ( nil = X
                      & nil != W )
                    | neq(U,nil)
                    | ~ neq(V,nil)
                    | U != W
                    | V != X ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(f95_neg,negated_conjecture,
    ~ ! [U] :
        ( ssList(U)
       => ! [V] :
            ( ssList(V)
           => ! [W] :
                ( ssList(W)
               => ! [X] :
                    ( ssList(X)
                   => ( ( neq(X,nil)
                        & ! [Y] :
                            ( ssList(Y)
                           => ( ~ segmentP(W,Y)
                              | ~ segmentP(X,Y)
                              | ~ neq(Y,nil) ) ) )
                      | ( nil = X
                        & nil != W )
                      | neq(U,nil)
                      | ~ neq(V,nil)
                      | U != W
                      | V != X ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f95]) ).

fof(f95_nnf,plain,
    ? [U] :
      ( ? [V] :
          ( ? [W] :
              ( ? [X] :
                  ( ( ~ neq(X,nil)
                    | ? [Y] :
                        ( segmentP(W,Y)
                        & segmentP(X,Y)
                        & neq(Y,nil)
                        & ssList(Y) ) )
                  & ( nil != X
                    | nil = W )
                  & ~ neq(U,nil)
                  & neq(V,nil)
                  & U = W
                  & V = X
                  & ssList(X) )
              & ssList(W) )
          & ssList(V) )
      & ssList(U) ),
    inference(nnf_transformation,[status(thm)],[f95_neg]) ).

fof(f95_sk,plain,
    ( ( ~ neq(sk50,nil)
      | ( segmentP(sk49,sk51)
        & segmentP(sk50,sk51)
        & neq(sk51,nil)
        & ssList(sk51) ) )
    & ( nil != sk50
      | nil = sk49 )
    & ~ neq(sk47,nil)
    & neq(sk48,nil)
    & sk47 = sk49
    & sk48 = sk50
    & ssList(sk50)
    & ssList(sk49)
    & ssList(sk48)
    & ssList(sk47) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk47,sk48,sk49,sk50,sk51])],[f95_nnf]) ).

cnf(c200,plain,
    ( ~ neq(sk50,nil)
    | neq(sk51,nil) ),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(t78,plain,
    ifeq(neq(sk50,nil),true,neq(sk51,nil),true) = true,
    inference(equality_encoding,[status(esa)],[c200]) ).

cnf(t296,plain,
    ifeq(neq(sk50,nil),true,neq(sk51,nil),true) = true,
    inference(orient,[status(thm)],[t78]) ).

cnf(c196,plain,
    neq(sk48,nil),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(t30,plain,
    neq(sk48,nil) = true,
    inference(equality_encoding,[status(esa)],[c196]) ).

cnf(t849,plain,
    neq(sk48,nil) = true,
    inference(orient,[status(thm)],[t30]) ).

cnf(c194,plain,
    sk48 = sk50,
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(t1,plain,
    sk50 = sk48,
    inference(equality_encoding,[status(esa)],[c194]) ).

cnf(t927,plain,
    sk48 = sk50,
    inference(orient,[status(thm)],[t1]) ).

cnf(t13597,plain,
    neq(sk50,nil) = true,
    inference(step,[status(thm)],[t849,t927]) ).

cnf(t928,plain,
    neq(sk50,nil) = true,
    inference(rw,[status(thm)],[t13597]) ).

cnf(t2381,plain,
    neq(sk50,nil) = true,
    inference(orient,[status(thm)],[t928]) ).

cnf(t13602,plain,
    ifeq(true,true,neq(sk51,nil),true) = true,
    inference(step,[status(thm)],[t296,t2381]) ).

cnf(t55,plain,
    ifeq(X1,X1,X2,X3) = X2,
    introduced(definition) ).

cnf(t256,plain,
    ifeq(X1,X1,X2,X3) = X2,
    inference(orient,[status(thm)],[t55]) ).

cnf(t13603,plain,
    neq(sk51,nil) = true,
    inference(step,[status(thm)],[t13602,t256]) ).

cnf(t2388,plain,
    neq(sk51,nil) = true,
    inference(rw,[status(thm)],[t13603]) ).

cnf(t62,plain,
    ifeq(eq(X1,X2),true,X1,X2) = X2,
    introduced(definition) ).

cnf(t257,plain,
    ifeq(eq(X1,X2),true,X1,X2) = X2,
    inference(orient,[status(thm)],[t62]) ).

cnf(c81,plain,
    ( X0 = X1
    | neq(X0,X1)
    | ~ ssList(X1)
    | ~ ssList(X0) ),
    inference(cnf_transformation,[status(esa)],[f14_sk]) ).

cnf(t163,plain,
    ifeq(ssList(X1),true,ifeq(ssList(X2),true,or(neq(X1,X2),eq(X1,X2)),true),true) = true,
    inference(equality_encoding,[status(esa)],[c81]) ).

cnf(t422,plain,
    ifeq(ssList(X1),true,ifeq(ssList(X2),true,or(neq(X1,X2),eq(X1,X2)),true),true) = true,
    inference(orient,[status(thm)],[t163]) ).

cnf(c197,plain,
    ~ neq(sk47,nil),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(t29,plain,
    neq(sk47,nil) = false,
    inference(equality_encoding,[status(esa)],[c197]) ).

cnf(t699,plain,
    neq(sk47,nil) = false,
    inference(orient,[status(thm)],[t29]) ).

cnf(c195,plain,
    sk47 = sk49,
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(t0,plain,
    sk49 = sk47,
    inference(equality_encoding,[status(esa)],[c195]) ).

cnf(t921,plain,
    sk47 = sk49,
    inference(orient,[status(thm)],[t0]) ).

cnf(t13594,plain,
    neq(sk49,nil) = false,
    inference(step,[status(thm)],[t699,t921]) ).

cnf(t925,plain,
    neq(sk49,nil) = false,
    inference(rw,[status(thm)],[t13594]) ).

cnf(t2350,plain,
    neq(sk49,nil) = false,
    inference(orient,[status(thm)],[t925]) ).

cnf(t2351,plain,
    true = ifeq(ssList(sk49),true,ifeq(ssList(nil),true,or(false,eq(sk49,nil)),true),true),
    inference(cp,[status(thm)],[t422,t2350]) ).

cnf(c190,plain,
    ssList(sk47),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(t11,plain,
    ssList(sk47) = true,
    inference(equality_encoding,[status(esa)],[c190]) ).

cnf(t13598,plain,
    ssList(sk49) = true,
    inference(step,[status(thm)],[t11,t921]) ).

cnf(t1415,plain,
    ssList(sk49) = true,
    inference(orient,[status(thm)],[t13598]) ).

cnf(t13620,plain,
    true = ifeq(true,true,ifeq(ssList(nil),true,or(false,eq(sk49,nil)),true),true),
    inference(step,[status(thm)],[t2351,t1415]) ).

cnf(t13621,plain,
    true = ifeq(ssList(nil),true,or(false,eq(sk49,nil)),true),
    inference(step,[status(thm)],[t13620,t256]) ).

fof(f16,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).

fof(f16_nnf,plain,
    ssList(nil),
    inference(nnf_transformation,[status(thm)],[f16]) ).

cnf(c83,plain,
    ssList(nil),
    inference(cnf_transformation,[status(esa)],[f16_nnf]) ).

cnf(t10,plain,
    ssList(nil) = true,
    inference(equality_encoding,[status(esa)],[c83]) ).

cnf(t1244,plain,
    ssList(nil) = true,
    inference(orient,[status(thm)],[t10]) ).

cnf(t13622,plain,
    true = ifeq(true,true,or(false,eq(sk49,nil)),true),
    inference(step,[status(thm)],[t13621,t1244]) ).

cnf(t13623,plain,
    true = or(false,eq(sk49,nil)),
    inference(step,[status(thm)],[t13622,t256]) ).

cnf(t33,plain,
    or(false,X1) = X1,
    introduced(definition) ).

cnf(t289,plain,
    or(false,X1) = X1,
    inference(orient,[status(thm)],[t33]) ).

cnf(t13624,plain,
    true = eq(sk49,nil),
    inference(step,[status(thm)],[t13623,t289]) ).

cnf(t2791,plain,
    eq(sk49,nil) = true,
    inference(orient,[status(thm)],[t13624]) ).

cnf(t2792,plain,
    nil = ifeq(true,true,sk49,nil),
    inference(cp,[status(thm)],[t257,t2791]) ).

cnf(t13625,plain,
    nil = sk49,
    inference(step,[status(thm)],[t2792,t256]) ).

cnf(t2800,plain,
    nil = sk49,
    inference(orient,[status(thm)],[t13625]) ).

cnf(t13731,plain,
    neq(sk51,sk49) = true,
    inference(step,[status(thm)],[t2388,t2800]) ).

cnf(t2910,plain,
    neq(sk51,sk49) = true,
    inference(orient,[status(thm)],[t13731]) ).

cnf(t2911,plain,
    true = ifeq(ssList(sk51),true,ifeq(ssList(sk49),true,ifeq(true,true,ifeq(sk51,sk49,false,true),true),true),true),
    inference(cp,[status(thm)],[t400,t2910]) ).

cnf(c199,plain,
    ( ~ neq(sk50,nil)
    | ssList(sk51) ),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(t65,plain,
    ifeq(neq(sk50,nil),true,ssList(sk51),true) = true,
    inference(equality_encoding,[status(esa)],[c199]) ).

cnf(t297,plain,
    ifeq(neq(sk50,nil),true,ssList(sk51),true) = true,
    inference(orient,[status(thm)],[t65]) ).

cnf(t13600,plain,
    ifeq(true,true,ssList(sk51),true) = true,
    inference(step,[status(thm)],[t297,t2381]) ).

cnf(t13601,plain,
    ssList(sk51) = true,
    inference(step,[status(thm)],[t13600,t256]) ).

cnf(t2387,plain,
    ssList(sk51) = true,
    inference(rw,[status(thm)],[t13601]) ).

cnf(t2391,plain,
    ssList(sk51) = true,
    inference(orient,[status(thm)],[t2387]) ).

cnf(t13879,plain,
    true = ifeq(true,true,ifeq(ssList(sk49),true,ifeq(true,true,ifeq(sk51,sk49,false,true),true),true),true),
    inference(step,[status(thm)],[t2911,t2391]) ).

cnf(t13880,plain,
    true = ifeq(ssList(sk49),true,ifeq(true,true,ifeq(sk51,sk49,false,true),true),true),
    inference(step,[status(thm)],[t13879,t256]) ).

cnf(t13881,plain,
    true = ifeq(true,true,ifeq(true,true,ifeq(sk51,sk49,false,true),true),true),
    inference(step,[status(thm)],[t13880,t1415]) ).

cnf(t13882,plain,
    true = ifeq(true,true,ifeq(sk51,sk49,false,true),true),
    inference(step,[status(thm)],[t13881,t256]) ).

cnf(t13883,plain,
    true = ifeq(sk51,sk49,false,true),
    inference(step,[status(thm)],[t13882,t256]) ).

cnf(t7174,plain,
    ifeq(sk51,sk49,false,true) = true,
    inference(orient,[status(thm)],[t13883]) ).

fof(f53,axiom,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ( ( segmentP(V,U)
              & segmentP(U,V) )
           => U = V ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax54) ).

fof(f53_nnf,plain,
    ! [U] :
      ( ! [V] :
          ( U = V
          | ~ segmentP(V,U)
          | ~ segmentP(U,V)
          | ~ ssList(V) )
      | ~ ssList(U) ),
    inference(nnf_transformation,[status(thm)],[f53]) ).

fof(f53_sk,plain,
    ! [U,V] :
      ( U = V
      | ~ segmentP(V,U)
      | ~ segmentP(U,V)
      | ~ ssList(V)
      | ~ ssList(U) ),
    inference(skolemisation,[status(esa)],[f53_nnf]) ).

cnf(c133,plain,
    ( X0 = X1
    | ~ segmentP(X1,X0)
    | ~ segmentP(X0,X1)
    | ~ ssList(X1)
    | ~ ssList(X0) ),
    inference(cnf_transformation,[status(esa)],[f53_sk]) ).

cnf(t200,plain,
    ifeq(ssList(X1),true,ifeq(ssList(X2),true,ifeq(segmentP(X1,X2),true,ifeq(segmentP(X2,X1),true,X1,X2),X2),X2),X2) = X2,
    inference(equality_encoding,[status(esa)],[c133]) ).

cnf(t268,plain,
    ifeq(ssList(X1),true,ifeq(ssList(X2),true,ifeq(segmentP(X1,X2),true,ifeq(segmentP(X2,X1),true,X1,X2),X2),X2),X2) = X2,
    inference(orient,[status(thm)],[t200]) ).

fof(f56,axiom,
    ! [U] :
      ( ssList(U)
     => segmentP(U,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax57) ).

fof(f56_nnf,plain,
    ! [U] :
      ( segmentP(U,nil)
      | ~ ssList(U) ),
    inference(nnf_transformation,[status(thm)],[f56]) ).

fof(f56_sk,plain,
    ! [U] :
      ( segmentP(U,nil)
      | ~ ssList(U) ),
    inference(skolemisation,[status(esa)],[f56_nnf]) ).

cnf(c136,plain,
    ( segmentP(X0,nil)
    | ~ ssList(X0) ),
    inference(cnf_transformation,[status(esa)],[f56_sk]) ).

cnf(t75,plain,
    ifeq(ssList(X1),true,segmentP(X1,nil),true) = true,
    inference(equality_encoding,[status(esa)],[c136]) ).

cnf(t489,plain,
    ifeq(ssList(X1),true,segmentP(X1,nil),true) = true,
    inference(orient,[status(thm)],[t75]) ).

cnf(t13670,plain,
    ifeq(ssList(X1),true,segmentP(X1,sk49),true) = true,
    inference(step,[status(thm)],[t489,t2800]) ).

cnf(t2837,plain,
    ifeq(ssList(X1),true,segmentP(X1,sk49),true) = true,
    inference(rw,[status(thm)],[t13670]) ).

cnf(t13357,plain,
    ifeq(ssList(X1),true,segmentP(X1,sk49),true) = true,
    inference(orient,[status(thm)],[t2837]) ).

cnf(t13400,plain,
    true = ifeq(true,true,segmentP(sk51,sk49),true),
    inference(cp,[status(thm)],[t13357,t2391]) ).

cnf(t14430,plain,
    true = segmentP(sk51,sk49),
    inference(step,[status(thm)],[t13400,t256]) ).

cnf(t13402,plain,
    segmentP(sk51,sk49) = true,
    inference(orient,[status(thm)],[t14430]) ).

cnf(t13405,plain,
    sk49 = ifeq(ssList(sk51),true,ifeq(ssList(sk49),true,ifeq(true,true,ifeq(segmentP(sk49,sk51),true,sk51,sk49),sk49),sk49),sk49),
    inference(cp,[status(thm)],[t268,t13402]) ).

cnf(t14435,plain,
    sk49 = ifeq(true,true,ifeq(ssList(sk49),true,ifeq(true,true,ifeq(segmentP(sk49,sk51),true,sk51,sk49),sk49),sk49),sk49),
    inference(step,[status(thm)],[t13405,t2391]) ).

cnf(t14436,plain,
    sk49 = ifeq(ssList(sk49),true,ifeq(true,true,ifeq(segmentP(sk49,sk51),true,sk51,sk49),sk49),sk49),
    inference(step,[status(thm)],[t14435,t256]) ).

cnf(t14437,plain,
    sk49 = ifeq(true,true,ifeq(true,true,ifeq(segmentP(sk49,sk51),true,sk51,sk49),sk49),sk49),
    inference(step,[status(thm)],[t14436,t1415]) ).

cnf(t14438,plain,
    sk49 = ifeq(true,true,ifeq(segmentP(sk49,sk51),true,sk51,sk49),sk49),
    inference(step,[status(thm)],[t14437,t256]) ).

cnf(t14439,plain,
    sk49 = ifeq(segmentP(sk49,sk51),true,sk51,sk49),
    inference(step,[status(thm)],[t14438,t256]) ).

cnf(c202,plain,
    ( ~ neq(sk50,nil)
    | segmentP(sk49,sk51) ),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(t79,plain,
    ifeq(neq(sk50,nil),true,segmentP(sk49,sk51),true) = true,
    inference(equality_encoding,[status(esa)],[c202]) ).

cnf(t294,plain,
    ifeq(neq(sk50,nil),true,segmentP(sk49,sk51),true) = true,
    inference(orient,[status(thm)],[t79]) ).

cnf(t13606,plain,
    ifeq(true,true,segmentP(sk49,sk51),true) = true,
    inference(step,[status(thm)],[t294,t2381]) ).

cnf(t13607,plain,
    segmentP(sk49,sk51) = true,
    inference(step,[status(thm)],[t13606,t256]) ).

cnf(t2390,plain,
    segmentP(sk49,sk51) = true,
    inference(rw,[status(thm)],[t13607]) ).

cnf(t2927,plain,
    segmentP(sk49,sk51) = true,
    inference(orient,[status(thm)],[t2390]) ).

cnf(t14440,plain,
    sk49 = ifeq(true,true,sk51,sk49),
    inference(step,[status(thm)],[t14439,t2927]) ).

cnf(t14441,plain,
    sk49 = sk51,
    inference(step,[status(thm)],[t14440,t256]) ).

cnf(t13415,plain,
    sk49 = sk51,
    inference(orient,[status(thm)],[t14441]) ).

cnf(t14451,plain,
    ifeq(sk51,sk51,false,true) = true,
    inference(step,[status(thm)],[t7174,t13415]) ).

cnf(t14452,plain,
    false = true,
    inference(step,[status(thm)],[t14451,t256]) ).

cnf(t13423,plain,
    false = true,
    inference(rw,[status(thm)],[t14452]) ).

cnf(t13560,plain,
    false = true,
    inference(orient,[status(thm)],[t13423]) ).

fof(f0,axiom,
    ! [U] :
      ( ssItem(U)
     => ! [V] :
          ( ssItem(V)
         => ( neq(U,V)
          <=> U != V ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).

fof(f0_nnf,plain,
    ! [U] :
      ( ! [V] :
          ( ( ( U = V
              | neq(U,V) )
            & ( U != V
              | ~ neq(U,V) ) )
          | ~ ssItem(V) )
      | ~ ssItem(U) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [U,V] :
      ( ( ( U = V
          | neq(U,V) )
        & ( U != V
          | ~ neq(U,V) ) )
      | ~ ssItem(V)
      | ~ ssItem(U) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( X0 != X1
    | ~ neq(X0,X1)
    | ~ ssItem(X1)
    | ~ ssItem(X0) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

fof(f1,axiom,
    ? [U] :
      ( ? [V] :
          ( U != V
          & ssItem(V) )
      & ssItem(U) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).

fof(f1_nnf,plain,
    ? [U] :
      ( ? [V] :
          ( U != V
          & ssItem(V) )
      & ssItem(U) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ( sk0 != sk1
    & ssItem(sk1)
    & ssItem(sk0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f1_nnf]) ).

cnf(c4,plain,
    sk0 != sk1,
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

fof(f7,axiom,
    ! [U] :
      ( ssList(U)
     => ( cyclefreeP(U)
      <=> ! [V] :
            ( ssItem(V)
           => ! [W] :
                ( ssItem(W)
               => ! [X] :
                    ( ssList(X)
                   => ! [Y] :
                        ( ssList(Y)
                       => ! [Z] :
                            ( ssList(Z)
                           => ( app(app(X,cons(V,Y)),cons(W,Z)) = U
                             => ~ ( leq(W,V)
                                  & leq(V,W) ) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax8) ).

fof(f7_nnf,plain,
    ! [U] :
      ( ( ( ? [V] :
              ( ? [W] :
                  ( ? [X] :
                      ( ? [Y] :
                          ( ? [Z] :
                              ( leq(W,V)
                              & leq(V,W)
                              & app(app(X,cons(V,Y)),cons(W,Z)) = U
                              & ssList(Z) )
                          & ssList(Y) )
                      & ssList(X) )
                  & ssItem(W) )
              & ssItem(V) )
          | cyclefreeP(U) )
        & ( ! [V] :
              ( ! [W] :
                  ( ! [X] :
                      ( ! [Y] :
                          ( ! [Z] :
                              ( ~ leq(W,V)
                              | ~ leq(V,W)
                              | app(app(X,cons(V,Y)),cons(W,Z)) != U
                              | ~ ssList(Z) )
                          | ~ ssList(Y) )
                      | ~ ssList(X) )
                  | ~ ssItem(W) )
              | ~ ssItem(V) )
          | ~ cyclefreeP(U) ) )
      | ~ ssList(U) ),
    inference(nnf_transformation,[status(thm)],[f7]) ).

fof(f7_sk,plain,
    ! [U,V,W,X,Y,Z] :
      ( ( ( ( leq(sk10(U),sk9(U))
            & leq(sk9(U),sk10(U))
            & app(app(sk11(U),cons(sk9(U),sk12(U))),cons(sk10(U),sk13(U))) = U
            & ssList(sk13(U))
            & ssList(sk12(U))
            & ssList(sk11(U))
            & ssItem(sk10(U))
            & ssItem(sk9(U)) )
          | cyclefreeP(U) )
        & ( ~ leq(W,V)
          | ~ leq(V,W)
          | app(app(X,cons(V,Y)),cons(W,Z)) != U
          | ~ ssList(Z)
          | ~ ssList(Y)
          | ~ ssList(X)
          | ~ ssItem(W)
          | ~ ssItem(V)
          | ~ cyclefreeP(U) ) )
      | ~ ssList(U) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk9,sk10,sk11,sk12,sk13])],[f7_nnf]) ).

cnf(c22,plain,
    ( ~ leq(X2,X1)
    | ~ leq(X1,X2)
    | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ cyclefreeP(X0)
    | ~ ssList(X0) ),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

fof(f12,axiom,
    ! [U] :
      ( ssList(U)
     => ( duplicatefreeP(U)
      <=> ! [V] :
            ( ssItem(V)
           => ! [W] :
                ( ssItem(W)
               => ! [X] :
                    ( ssList(X)
                   => ! [Y] :
                        ( ssList(Y)
                       => ! [Z] :
                            ( ssList(Z)
                           => ( app(app(X,cons(V,Y)),cons(W,Z)) = U
                             => V != W ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax13) ).

fof(f12_nnf,plain,
    ! [U] :
      ( ( ( ? [V] :
              ( ? [W] :
                  ( ? [X] :
                      ( ? [Y] :
                          ( ? [Z] :
                              ( V = W
                              & app(app(X,cons(V,Y)),cons(W,Z)) = U
                              & ssList(Z) )
                          & ssList(Y) )
                      & ssList(X) )
                  & ssItem(W) )
              & ssItem(V) )
          | duplicatefreeP(U) )
        & ( ! [V] :
              ( ! [W] :
                  ( ! [X] :
                      ( ! [Y] :
                          ( ! [Z] :
                              ( V != W
                              | app(app(X,cons(V,Y)),cons(W,Z)) != U
                              | ~ ssList(Z) )
                          | ~ ssList(Y) )
                      | ~ ssList(X) )
                  | ~ ssItem(W) )
              | ~ ssItem(V) )
          | ~ duplicatefreeP(U) ) )
      | ~ ssList(U) ),
    inference(nnf_transformation,[status(thm)],[f12]) ).

fof(f12_sk,plain,
    ! [U,V,W,X,Y,Z] :
      ( ( ( ( sk34(U) = sk35(U)
            & app(app(sk36(U),cons(sk34(U),sk37(U))),cons(sk35(U),sk38(U))) = U
            & ssList(sk38(U))
            & ssList(sk37(U))
            & ssList(sk36(U))
            & ssItem(sk35(U))
            & ssItem(sk34(U)) )
          | duplicatefreeP(U) )
        & ( V != W
          | app(app(X,cons(V,Y)),cons(W,Z)) != U
          | ~ ssList(Z)
          | ~ ssList(Y)
          | ~ ssList(X)
          | ~ ssItem(W)
          | ~ ssItem(V)
          | ~ duplicatefreeP(U) ) )
      | ~ ssList(U) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk34,sk35,sk36,sk37,sk38])],[f12_nnf]) ).

cnf(c65,plain,
    ( X1 != X2
    | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ duplicatefreeP(X0)
    | ~ ssList(X0) ),
    inference(cnf_transformation,[status(esa)],[f12_sk]) ).

fof(f17,axiom,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssItem(V)
         => cons(V,U) != U ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax18) ).

fof(f17_nnf,plain,
    ! [U] :
      ( ! [V] :
          ( cons(V,U) != U
          | ~ ssItem(V) )
      | ~ ssList(U) ),
    inference(nnf_transformation,[status(thm)],[f17]) ).

fof(f17_sk,plain,
    ! [U,V] :
      ( cons(V,U) != U
      | ~ ssItem(V)
      | ~ ssList(U) ),
    inference(skolemisation,[status(esa)],[f17_nnf]) ).

cnf(c84,plain,
    ( cons(X1,X0) != X0
    | ~ ssItem(X1)
    | ~ ssList(X0) ),
    inference(cnf_transformation,[status(esa)],[f17_sk]) ).

fof(f20,axiom,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssItem(V)
         => nil != cons(V,U) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax21) ).

fof(f20_nnf,plain,
    ! [U] :
      ( ! [V] :
          ( nil != cons(V,U)
          | ~ ssItem(V) )
      | ~ ssList(U) ),
    inference(nnf_transformation,[status(thm)],[f20]) ).

fof(f20_sk,plain,
    ! [U,V] :
      ( nil != cons(V,U)
      | ~ ssItem(V)
      | ~ ssList(U) ),
    inference(skolemisation,[status(esa)],[f20_nnf]) ).

cnf(c90,plain,
    ( nil != cons(X1,X0)
    | ~ ssItem(X1)
    | ~ ssList(X0) ),
    inference(cnf_transformation,[status(esa)],[f20_sk]) ).

fof(f32,axiom,
    ! [U] :
      ( ssItem(U)
     => ! [V] :
          ( ssItem(V)
         => ( lt(U,V)
           => ~ lt(V,U) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax33) ).

fof(f32_nnf,plain,
    ! [U] :
      ( ! [V] :
          ( ~ lt(V,U)
          | ~ lt(U,V)
          | ~ ssItem(V) )
      | ~ ssItem(U) ),
    inference(nnf_transformation,[status(thm)],[f32]) ).

fof(f32_sk,plain,
    ! [U,V] :
      ( ~ lt(V,U)
      | ~ lt(U,V)
      | ~ ssItem(V)
      | ~ ssItem(U) ),
    inference(skolemisation,[status(esa)],[f32_nnf]) ).

cnf(c103,plain,
    ( ~ lt(X1,X0)
    | ~ lt(X0,X1)
    | ~ ssItem(X1)
    | ~ ssItem(X0) ),
    inference(cnf_transformation,[status(esa)],[f32_sk]) ).

fof(f37,axiom,
    ! [U] :
      ( ssItem(U)
     => ~ memberP(nil,U) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).

fof(f37_nnf,plain,
    ! [U] :
      ( ~ memberP(nil,U)
      | ~ ssItem(U) ),
    inference(nnf_transformation,[status(thm)],[f37]) ).

fof(f37_sk,plain,
    ! [U] :
      ( ~ memberP(nil,U)
      | ~ ssItem(U) ),
    inference(skolemisation,[status(esa)],[f37_nnf]) ).

cnf(c113,plain,
    ( ~ memberP(nil,X0)
    | ~ ssItem(X0) ),
    inference(cnf_transformation,[status(esa)],[f37_sk]) ).

fof(f38,axiom,
    ~ singletonP(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax39) ).

fof(f38_nnf,plain,
    ~ singletonP(nil),
    inference(nnf_transformation,[status(thm)],[f38]) ).

fof(f38_sk,plain,
    ~ singletonP(nil),
    inference(skolemisation,[status(esa)],[f38_nnf]) ).

cnf(c114,plain,
    ~ singletonP(nil),
    inference(cnf_transformation,[status(esa)],[f38_sk]) ).

fof(f89,axiom,
    ! [U] :
      ( ssItem(U)
     => ~ lt(U,U) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax90) ).

fof(f89_nnf,plain,
    ! [U] :
      ( ~ lt(U,U)
      | ~ ssItem(U) ),
    inference(nnf_transformation,[status(thm)],[f89]) ).

fof(f89_sk,plain,
    ! [U] :
      ( ~ lt(U,U)
      | ~ ssItem(U) ),
    inference(skolemisation,[status(esa)],[f89_nnf]) ).

cnf(c182,plain,
    ( ~ lt(X0,X0)
    | ~ ssItem(X0) ),
    inference(cnf_transformation,[status(esa)],[f89_sk]) ).

fof(f92,axiom,
    ! [U] :
      ( ssItem(U)
     => ! [V] :
          ( ssItem(V)
         => ( lt(U,V)
          <=> ( leq(U,V)
              & U != V ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax93) ).

fof(f92_nnf,plain,
    ! [U] :
      ( ! [V] :
          ( ( ( ~ leq(U,V)
              | U = V
              | lt(U,V) )
            & ( ( leq(U,V)
                & U != V )
              | ~ lt(U,V) ) )
          | ~ ssItem(V) )
      | ~ ssItem(U) ),
    inference(nnf_transformation,[status(thm)],[f92]) ).

fof(f92_sk,plain,
    ! [U,V] :
      ( ( ( ~ leq(U,V)
          | U = V
          | lt(U,V) )
        & ( ( leq(U,V)
            & U != V )
          | ~ lt(U,V) ) )
      | ~ ssItem(V)
      | ~ ssItem(U) ),
    inference(skolemisation,[status(esa)],[f92_nnf]) ).

cnf(c185,plain,
    ( X0 != X1
    | ~ lt(X0,X1)
    | ~ ssItem(X1)
    | ~ ssItem(X0) ),
    inference(cnf_transformation,[status(esa)],[f92_sk]) ).

fof(f93,axiom,
    ! [U] :
      ( ssItem(U)
     => ! [V] :
          ( ssItem(V)
         => ( gt(U,V)
           => ~ gt(V,U) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax94) ).

fof(f93_nnf,plain,
    ! [U] :
      ( ! [V] :
          ( ~ gt(V,U)
          | ~ gt(U,V)
          | ~ ssItem(V) )
      | ~ ssItem(U) ),
    inference(nnf_transformation,[status(thm)],[f93]) ).

fof(f93_sk,plain,
    ! [U,V] :
      ( ~ gt(V,U)
      | ~ gt(U,V)
      | ~ ssItem(V)
      | ~ ssItem(U) ),
    inference(skolemisation,[status(esa)],[f93_nnf]) ).

cnf(c188,plain,
    ( ~ gt(X1,X0)
    | ~ gt(X0,X1)
    | ~ ssItem(X1)
    | ~ ssItem(X0) ),
    inference(cnf_transformation,[status(esa)],[f93_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c0,c4,c22,c65,c80,c84,c90,c103,c113,c114,c182,c185,c188,c197]) ).

cnf(g0_0,plain,
    true != true,
    inference(rw,[status(thm)],[goal_0,t13560]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SWC206+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.04/0.30  % Computer : n012.cluster.edu
% 0.04/0.30  % Model    : x86_64 x86_64
% 0.04/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30  % Memory   : 8046.5625MB
% 0.04/0.30  % OS       : Linux 6.8.0-71-generic
% 0.04/0.30  % CPULimit : 300
% 0.04/0.30  % WCLimit  : 300
% 0.04/0.30  % DateTime : Thu Sep 24 16:58:20 UTC 2026
% 0.04/0.30  % CPUTime  : 
% 0.04/0.30  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 55.66/7.46  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 55.66/7.46  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------