TSTP Solution File: SWC146+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC146+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n028.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 : Wed Aug 31 18:42:00 EDT 2022

% Result   : Theorem 0.18s 0.52s
% Output   : Refutation 0.18s
% 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 (   9 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(f618,plain,
    $false,
    inference(resolution,[],[f556,f486]) ).

fof(f486,plain,
    neq(sK37,nil),
    inference(cnf_transformation,[],[f305]) ).

fof(f305,plain,
    ( ~ neq(sK39,nil)
    & sK39 = sK37
    & neq(sK37,nil)
    & sK38 = sK36
    & ~ singletonP(sK37)
    & ssList(sK39)
    & ssList(sK38)
    & ssList(sK37)
    & ssList(sK36) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK36,sK37,sK38,sK39])],[f175,f304,f303,f302,f301]) ).

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

fof(f302,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ~ neq(X3,nil)
                & X1 = X3
                & neq(X1,nil)
                & sK36 = X2
                & ~ singletonP(X1)
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ~ neq(X3,nil)
              & sK37 = X3
              & neq(sK37,nil)
              & sK36 = X2
              & ~ singletonP(sK37)
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK37) ) ),
    introduced(choice_axiom,[]) ).

fof(f303,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ~ neq(X3,nil)
            & sK37 = X3
            & neq(sK37,nil)
            & sK36 = X2
            & ~ singletonP(sK37)
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ~ neq(X3,nil)
          & sK37 = X3
          & neq(sK37,nil)
          & sK38 = sK36
          & ~ singletonP(sK37)
          & ssList(X3) )
      & ssList(sK38) ) ),
    introduced(choice_axiom,[]) ).

fof(f304,plain,
    ( ? [X3] :
        ( ~ neq(X3,nil)
        & sK37 = X3
        & neq(sK37,nil)
        & sK38 = sK36
        & ~ singletonP(sK37)
        & ssList(X3) )
   => ( ~ neq(sK39,nil)
      & sK39 = sK37
      & neq(sK37,nil)
      & sK38 = sK36
      & ~ singletonP(sK37)
      & ssList(sK39) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f556,plain,
    ~ neq(sK37,nil),
    inference(definition_unfolding,[],[f488,f487]) ).

fof(f487,plain,
    sK39 = sK37,
    inference(cnf_transformation,[],[f305]) ).

fof(f488,plain,
    ~ neq(sK39,nil),
    inference(cnf_transformation,[],[f305]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : SWC146+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33  % Computer : n028.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    : 300
% 0.12/0.33  % DateTime   : Tue Aug 30 18:36:03 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.18/0.48  % (1584)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.18/0.48  % (1593)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.18/0.49  % (1585)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.18/0.49  % (1580)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.18/0.50  % (1581)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.18/0.50  % (1573)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.50  % (1579)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.50  % (1576)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.50  % (1572)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.50  % (1580)First to succeed.
% 0.18/0.51  % (1569)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.18/0.51  % (1592)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.18/0.51  % (1587)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.18/0.51  % (1599)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.18/0.51  % (1586)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.18/0.51  % (1570)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.18/0.51  % (1576)Instruction limit reached!
% 0.18/0.51  % (1576)------------------------------
% 0.18/0.51  % (1576)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.51  % (1576)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.51  % (1576)Termination reason: Unknown
% 0.18/0.51  % (1576)Termination phase: Property scanning
% 0.18/0.51  
% 0.18/0.51  % (1576)Memory used [KB]: 1279
% 0.18/0.51  % (1576)Time elapsed: 0.007 s
% 0.18/0.51  % (1576)Instructions burned: 7 (million)
% 0.18/0.51  % (1576)------------------------------
% 0.18/0.51  % (1576)------------------------------
% 0.18/0.51  % (1574)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.18/0.52  % (1591)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.18/0.52  % (1575)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.52  % (1588)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.18/0.52  % (1583)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.18/0.52  % (1582)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.18/0.52  % (1573)Also succeeded, but the first one will report.
% 0.18/0.52  % (1580)Refutation found. Thanks to Tanya!
% 0.18/0.52  % SZS status Theorem for theBenchmark
% 0.18/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.52  % (1580)------------------------------
% 0.18/0.52  % (1580)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52  % (1580)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52  % (1580)Termination reason: Refutation
% 0.18/0.52  
% 0.18/0.52  % (1580)Memory used [KB]: 5884
% 0.18/0.52  % (1580)Time elapsed: 0.112 s
% 0.18/0.52  % (1580)Instructions burned: 14 (million)
% 0.18/0.52  % (1580)------------------------------
% 0.18/0.52  % (1580)------------------------------
% 0.18/0.52  % (1566)Success in time 0.184 s
%------------------------------------------------------------------------------