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

View Problem - Process Solution

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

% Computer : n022.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 : Tue May 21 04:49:04 EDT 2024

% Result   : Theorem 0.15s 0.40s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   14 (   5 unt;   0 def)
%            Number of atoms       :  110 (  27 equ)
%            Maximal formula atoms :   18 (   7 avg)
%            Number of connectives :  127 (  31   ~;   8   |;  76   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   8 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   :   32 (   8   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f729,plain,
    $false,
    inference(subsumption_resolution,[],[f443,f728]) ).

fof(f728,plain,
    ~ neq(sK42,nil),
    inference(forward_demodulation,[],[f444,f441]) ).

fof(f441,plain,
    sK42 = sK44,
    inference(cnf_transformation,[],[f288]) ).

fof(f288,plain,
    ( ~ singletonP(sK42)
    & ~ neq(sK44,nil)
    & neq(sK42,nil)
    & sK41 = sK43
    & sK42 = sK44
    & ssList(sK44)
    & ssList(sK43)
    & ssList(sK42)
    & ssList(sK41) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK41,sK42,sK43,sK44])],[f99,f287,f286,f285,f284]) ).

fof(f284,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( ~ singletonP(X1)
                    & ~ neq(X3,nil)
                    & neq(X1,nil)
                    & X0 = X2
                    & X1 = X3
                    & ssList(X3) )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ~ singletonP(X1)
                  & ~ neq(X3,nil)
                  & neq(X1,nil)
                  & sK41 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK41) ) ),
    introduced(choice_axiom,[]) ).

fof(f285,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ~ singletonP(X1)
                & ~ neq(X3,nil)
                & neq(X1,nil)
                & sK41 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ~ singletonP(sK42)
              & ~ neq(X3,nil)
              & neq(sK42,nil)
              & sK41 = X2
              & sK42 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK42) ) ),
    introduced(choice_axiom,[]) ).

fof(f286,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ~ singletonP(sK42)
            & ~ neq(X3,nil)
            & neq(sK42,nil)
            & sK41 = X2
            & sK42 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ~ singletonP(sK42)
          & ~ neq(X3,nil)
          & neq(sK42,nil)
          & sK41 = sK43
          & sK42 = X3
          & ssList(X3) )
      & ssList(sK43) ) ),
    introduced(choice_axiom,[]) ).

fof(f287,plain,
    ( ? [X3] :
        ( ~ singletonP(sK42)
        & ~ neq(X3,nil)
        & neq(sK42,nil)
        & sK41 = sK43
        & sK42 = X3
        & ssList(X3) )
   => ( ~ singletonP(sK42)
      & ~ neq(sK44,nil)
      & neq(sK42,nil)
      & sK41 = sK43
      & sK42 = sK44
      & ssList(sK44) ) ),
    introduced(choice_axiom,[]) ).

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

fof(f98,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ~ singletonP(X1)
                  & ~ neq(X3,nil)
                  & neq(X1,nil)
                  & 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)
                   => ( singletonP(X1)
                      | neq(X3,nil)
                      | ~ neq(X1,nil)
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( singletonP(X1)
                    | neq(X3,nil)
                    | ~ neq(X1,nil)
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(f444,plain,
    ~ neq(sK44,nil),
    inference(cnf_transformation,[],[f288]) ).

fof(f443,plain,
    neq(sK42,nil),
    inference(cnf_transformation,[],[f288]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.14  % Problem    : SWC145+1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.37  % Computer : n022.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   : Sun May 19 03:47:08 EDT 2024
% 0.15/0.37  % CPUTime    : 
% 0.15/0.37  % (20698)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.39  % (20701)WARNING: value z3 for option sas not known
% 0.15/0.39  % (20705)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.15/0.39  % (20702)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.39  % (20703)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.15/0.39  % (20704)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.15/0.39  % (20699)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.39  % (20700)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.39  % (20701)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.15/0.40  % (20705)First to succeed.
% 0.15/0.40  % (20703)Also succeeded, but the first one will report.
% 0.15/0.40  % (20705)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-20698"
% 0.15/0.40  % (20705)Refutation found. Thanks to Tanya!
% 0.15/0.40  % SZS status Theorem for theBenchmark
% 0.15/0.40  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.40  % (20705)------------------------------
% 0.15/0.40  % (20705)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.40  % (20705)Termination reason: Refutation
% 0.15/0.40  
% 0.15/0.40  % (20705)Memory used [KB]: 1296
% 0.15/0.40  % (20705)Time elapsed: 0.010 s
% 0.15/0.40  % (20705)Instructions burned: 18 (million)
% 0.15/0.40  % (20698)Success in time 0.018 s
%------------------------------------------------------------------------------