TSTP Solution File: SWC019+1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SWC019+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n013.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 : Sun May  5 09:51:37 EDT 2024

% Result   : Theorem 0.19s 0.39s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   39 (  13 unt;   0 def)
%            Number of atoms       :  227 (  87 equ)
%            Maximal formula atoms :   26 (   5 avg)
%            Number of connectives :  303 ( 115   ~;  86   |;  85   &)
%                                         (   2 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   61 (  35   !;  26   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f925,plain,
    $false,
    inference(trivial_inequality_removal,[],[f924]) ).

fof(f924,plain,
    nil != nil,
    inference(superposition,[],[f642,f912]) ).

fof(f912,plain,
    nil = sK18,
    inference(resolution,[],[f911,f391]) ).

fof(f391,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f17]) ).

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

fof(f911,plain,
    ( ~ ssList(nil)
    | nil = sK18 ),
    inference(resolution,[],[f910,f638]) ).

fof(f638,plain,
    ssList(sK18),
    inference(forward_demodulation,[],[f377,f634]) ).

fof(f634,plain,
    sK18 = sK21,
    inference(backward_demodulation,[],[f380,f379]) ).

fof(f379,plain,
    sK18 = sK20,
    inference(cnf_transformation,[],[f254]) ).

fof(f254,plain,
    ( ( nil != sK18
      | nil != sK19 )
    & ! [X4] :
        ( ~ frontsegP(sK18,X4)
        | ~ frontsegP(sK19,X4)
        | ~ neq(X4,nil)
        | ~ ssList(X4) )
    & sK20 = sK21
    & sK18 = sK20
    & sK19 = sK21
    & ssList(sK21)
    & ssList(sK20)
    & ssList(sK19)
    & ssList(sK18) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21])],[f99,f253,f252,f251,f250]) ).

fof(f250,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( ( nil != X0
                      | nil != X1 )
                    & ! [X4] :
                        ( ~ frontsegP(X0,X4)
                        | ~ frontsegP(X1,X4)
                        | ~ neq(X4,nil)
                        | ~ ssList(X4) )
                    & X2 = X3
                    & X0 = X2
                    & X1 = X3
                    & ssList(X3) )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( nil != sK18
                    | nil != X1 )
                  & ! [X4] :
                      ( ~ frontsegP(sK18,X4)
                      | ~ frontsegP(X1,X4)
                      | ~ neq(X4,nil)
                      | ~ ssList(X4) )
                  & X2 = X3
                  & sK18 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK18) ) ),
    introduced(choice_axiom,[]) ).

fof(f251,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ( nil != sK18
                  | nil != X1 )
                & ! [X4] :
                    ( ~ frontsegP(sK18,X4)
                    | ~ frontsegP(X1,X4)
                    | ~ neq(X4,nil)
                    | ~ ssList(X4) )
                & X2 = X3
                & sK18 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ( nil != sK18
                | nil != sK19 )
              & ! [X4] :
                  ( ~ frontsegP(sK18,X4)
                  | ~ frontsegP(sK19,X4)
                  | ~ neq(X4,nil)
                  | ~ ssList(X4) )
              & X2 = X3
              & sK18 = X2
              & sK19 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK19) ) ),
    introduced(choice_axiom,[]) ).

fof(f252,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( nil != sK18
              | nil != sK19 )
            & ! [X4] :
                ( ~ frontsegP(sK18,X4)
                | ~ frontsegP(sK19,X4)
                | ~ neq(X4,nil)
                | ~ ssList(X4) )
            & X2 = X3
            & sK18 = X2
            & sK19 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( nil != sK18
            | nil != sK19 )
          & ! [X4] :
              ( ~ frontsegP(sK18,X4)
              | ~ frontsegP(sK19,X4)
              | ~ neq(X4,nil)
              | ~ ssList(X4) )
          & sK20 = X3
          & sK18 = sK20
          & sK19 = X3
          & ssList(X3) )
      & ssList(sK20) ) ),
    introduced(choice_axiom,[]) ).

fof(f253,plain,
    ( ? [X3] :
        ( ( nil != sK18
          | nil != sK19 )
        & ! [X4] :
            ( ~ frontsegP(sK18,X4)
            | ~ frontsegP(sK19,X4)
            | ~ neq(X4,nil)
            | ~ ssList(X4) )
        & sK20 = X3
        & sK18 = sK20
        & sK19 = X3
        & ssList(X3) )
   => ( ( nil != sK18
        | nil != sK19 )
      & ! [X4] :
          ( ~ frontsegP(sK18,X4)
          | ~ frontsegP(sK19,X4)
          | ~ neq(X4,nil)
          | ~ ssList(X4) )
      & sK20 = sK21
      & sK18 = sK20
      & sK19 = sK21
      & ssList(sK21) ) ),
    introduced(choice_axiom,[]) ).

fof(f99,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( nil != X0
                    | nil != X1 )
                  & ! [X4] :
                      ( ~ frontsegP(X0,X4)
                      | ~ frontsegP(X1,X4)
                      | ~ neq(X4,nil)
                      | ~ ssList(X4) )
                  & X2 = X3
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f98]) ).

fof(f98,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( nil != X0
                    | nil != X1 )
                  & ! [X4] :
                      ( ~ frontsegP(X0,X4)
                      | ~ frontsegP(X1,X4)
                      | ~ neq(X4,nil)
                      | ~ ssList(X4) )
                  & X2 = X3
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ( nil = X0
                        & nil = X1 )
                      | ? [X4] :
                          ( frontsegP(X0,X4)
                          & frontsegP(X1,X4)
                          & neq(X4,nil)
                          & ssList(X4) )
                      | X2 != X3
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ( nil = X0
                      & nil = X1 )
                    | ? [X4] :
                        ( frontsegP(X0,X4)
                        & frontsegP(X1,X4)
                        & neq(X4,nil)
                        & ssList(X4) )
                    | X2 != X3
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(f380,plain,
    sK20 = sK21,
    inference(cnf_transformation,[],[f254]) ).

fof(f377,plain,
    ssList(sK21),
    inference(cnf_transformation,[],[f254]) ).

fof(f910,plain,
    ( ~ ssList(sK18)
    | ~ ssList(nil)
    | nil = sK18 ),
    inference(duplicate_literal_removal,[],[f907]) ).

fof(f907,plain,
    ( ~ ssList(nil)
    | ~ ssList(sK18)
    | nil = sK18
    | ~ ssList(sK18) ),
    inference(resolution,[],[f906,f449]) ).

fof(f449,plain,
    ! [X0] :
      ( frontsegP(X0,X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f142]) ).

fof(f142,plain,
    ! [X0] :
      ( frontsegP(X0,X0)
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f42]) ).

fof(f42,axiom,
    ! [X0] :
      ( ssList(X0)
     => frontsegP(X0,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax42) ).

fof(f906,plain,
    ! [X0] :
      ( ~ frontsegP(sK18,X0)
      | ~ ssList(nil)
      | ~ ssList(X0)
      | nil = X0 ),
    inference(duplicate_literal_removal,[],[f901]) ).

fof(f901,plain,
    ! [X0] :
      ( nil = X0
      | ~ ssList(nil)
      | ~ ssList(X0)
      | ~ frontsegP(sK18,X0)
      | ~ ssList(X0) ),
    inference(resolution,[],[f571,f637]) ).

fof(f637,plain,
    ! [X4] :
      ( ~ neq(X4,nil)
      | ~ frontsegP(sK18,X4)
      | ~ ssList(X4) ),
    inference(duplicate_literal_removal,[],[f636]) ).

fof(f636,plain,
    ! [X4] :
      ( ~ frontsegP(sK18,X4)
      | ~ frontsegP(sK18,X4)
      | ~ neq(X4,nil)
      | ~ ssList(X4) ),
    inference(forward_demodulation,[],[f381,f635]) ).

fof(f635,plain,
    sK18 = sK19,
    inference(forward_demodulation,[],[f378,f634]) ).

fof(f378,plain,
    sK19 = sK21,
    inference(cnf_transformation,[],[f254]) ).

fof(f381,plain,
    ! [X4] :
      ( ~ frontsegP(sK18,X4)
      | ~ frontsegP(sK19,X4)
      | ~ neq(X4,nil)
      | ~ ssList(X4) ),
    inference(cnf_transformation,[],[f254]) ).

fof(f571,plain,
    ! [X0,X1] :
      ( neq(X0,X1)
      | X0 = X1
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f355]) ).

fof(f355,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( neq(X0,X1)
              | X0 = X1 )
            & ( X0 != X1
              | ~ neq(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f198]) ).

fof(f198,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( neq(X0,X1)
          <=> X0 != X1 )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).

fof(f642,plain,
    nil != sK18,
    inference(duplicate_literal_removal,[],[f641]) ).

fof(f641,plain,
    ( nil != sK18
    | nil != sK18 ),
    inference(superposition,[],[f382,f635]) ).

fof(f382,plain,
    ( nil != sK19
    | nil != sK18 ),
    inference(cnf_transformation,[],[f254]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWC019+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35  % Computer : n013.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 May  3 20:35:38 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  % (882)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.37  % (885)WARNING: value z3 for option sas not known
% 0.19/0.37  % (887)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.19/0.37  % (884)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.19/0.37  % (886)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.19/0.37  % (890)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.19/0.37  % (889)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.19/0.37  % (885)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.19/0.37  % (883)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.19/0.38  TRYING [1]
% 0.19/0.39  TRYING [2]
% 0.19/0.39  TRYING [1]
% 0.19/0.39  % (889)First to succeed.
% 0.19/0.39  % (889)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-882"
% 0.19/0.39  TRYING [2]
% 0.19/0.39  % (889)Refutation found. Thanks to Tanya!
% 0.19/0.39  % SZS status Theorem for theBenchmark
% 0.19/0.39  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.39  % (889)------------------------------
% 0.19/0.39  % (889)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.19/0.39  % (889)Termination reason: Refutation
% 0.19/0.39  
% 0.19/0.39  % (889)Memory used [KB]: 1504
% 0.19/0.39  % (889)Time elapsed: 0.020 s
% 0.19/0.39  % (889)Instructions burned: 38 (million)
% 0.19/0.39  % (882)Success in time 0.039 s
%------------------------------------------------------------------------------