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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC133+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 : n011.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:41:56 EDT 2022

% Result   : Theorem 1.59s 0.57s
% Output   : Refutation 1.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   33 (  13 unt;   0 def)
%            Number of atoms       :  140 (  35 equ)
%            Maximal formula atoms :   16 (   4 avg)
%            Number of connectives :  157 (  50   ~;  24   |;  66   &)
%                                         (   3 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   2 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   41 (  17   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f649,plain,
    $false,
    inference(avatar_sat_refutation,[],[f617,f647]) ).

fof(f647,plain,
    ~ spl57_1,
    inference(avatar_contradiction_clause,[],[f646]) ).

fof(f646,plain,
    ( $false
    | ~ spl57_1 ),
    inference(subsumption_resolution,[],[f645,f447]) ).

fof(f447,plain,
    cyclefreeP(nil),
    inference(cnf_transformation,[],[f60]) ).

fof(f60,axiom,
    cyclefreeP(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax60) ).

fof(f645,plain,
    ( ~ cyclefreeP(nil)
    | ~ spl57_1 ),
    inference(backward_demodulation,[],[f555,f640]) ).

fof(f640,plain,
    ( nil = sK30
    | ~ spl57_1 ),
    inference(subsumption_resolution,[],[f638,f557]) ).

fof(f557,plain,
    ssList(sK30),
    inference(definition_unfolding,[],[f462,f464]) ).

fof(f464,plain,
    sK28 = sK30,
    inference(cnf_transformation,[],[f294]) ).

fof(f294,plain,
    ( ssList(sK27)
    & sK29 = sK27
    & ~ neq(sK30,nil)
    & ~ cyclefreeP(sK28)
    & ssList(sK30)
    & sK28 = sK30
    & ssList(sK29)
    & ssList(sK28) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK27,sK28,sK29,sK30])],[f208,f293,f292,f291,f290]) ).

fof(f290,plain,
    ( ? [X0] :
        ( ssList(X0)
        & ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( X0 = X2
                    & ~ neq(X3,nil)
                    & ~ cyclefreeP(X1)
                    & ssList(X3)
                    & X1 = X3 )
                & ssList(X2) )
            & ssList(X1) ) )
   => ( ssList(sK27)
      & ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( sK27 = X2
                  & ~ neq(X3,nil)
                  & ~ cyclefreeP(X1)
                  & ssList(X3)
                  & X1 = X3 )
              & ssList(X2) )
          & ssList(X1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f291,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( sK27 = X2
                & ~ neq(X3,nil)
                & ~ cyclefreeP(X1)
                & ssList(X3)
                & X1 = X3 )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( sK27 = X2
              & ~ neq(X3,nil)
              & ~ cyclefreeP(sK28)
              & ssList(X3)
              & sK28 = X3 )
          & ssList(X2) )
      & ssList(sK28) ) ),
    introduced(choice_axiom,[]) ).

fof(f292,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( sK27 = X2
            & ~ neq(X3,nil)
            & ~ cyclefreeP(sK28)
            & ssList(X3)
            & sK28 = X3 )
        & ssList(X2) )
   => ( ? [X3] :
          ( sK29 = sK27
          & ~ neq(X3,nil)
          & ~ cyclefreeP(sK28)
          & ssList(X3)
          & sK28 = X3 )
      & ssList(sK29) ) ),
    introduced(choice_axiom,[]) ).

fof(f293,plain,
    ( ? [X3] :
        ( sK29 = sK27
        & ~ neq(X3,nil)
        & ~ cyclefreeP(sK28)
        & ssList(X3)
        & sK28 = X3 )
   => ( sK29 = sK27
      & ~ neq(sK30,nil)
      & ~ cyclefreeP(sK28)
      & ssList(sK30)
      & sK28 = sK30 ) ),
    introduced(choice_axiom,[]) ).

fof(f208,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X0 = X2
                  & ~ neq(X3,nil)
                  & ~ cyclefreeP(X1)
                  & ssList(X3)
                  & X1 = X3 )
              & ssList(X2) )
          & ssList(X1) ) ),
    inference(flattening,[],[f207]) ).

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

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

fof(f462,plain,
    ssList(sK28),
    inference(cnf_transformation,[],[f294]) ).

fof(f638,plain,
    ( ~ ssList(sK30)
    | nil = sK30
    | ~ spl57_1 ),
    inference(resolution,[],[f635,f467]) ).

fof(f467,plain,
    ~ neq(sK30,nil),
    inference(cnf_transformation,[],[f294]) ).

fof(f635,plain,
    ( ! [X0] :
        ( neq(X0,nil)
        | ~ ssList(X0)
        | nil = X0 )
    | ~ spl57_1 ),
    inference(resolution,[],[f594,f369]) ).

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

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

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

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

fof(f594,plain,
    ( ssList(nil)
    | ~ spl57_1 ),
    inference(avatar_component_clause,[],[f593]) ).

fof(f593,plain,
    ( spl57_1
  <=> ssList(nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl57_1])]) ).

fof(f555,plain,
    ~ cyclefreeP(sK30),
    inference(definition_unfolding,[],[f466,f464]) ).

fof(f466,plain,
    ~ cyclefreeP(sK28),
    inference(cnf_transformation,[],[f294]) ).

fof(f617,plain,
    spl57_1,
    inference(avatar_split_clause,[],[f476,f593]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SWC133+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34  % Computer : n011.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 18:19:10 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.52  % (32067)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.20/0.52  % (32077)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.20/0.52  % (32069)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.52  % (32069)Instruction limit reached!
% 0.20/0.52  % (32069)------------------------------
% 0.20/0.52  % (32069)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (32069)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (32069)Termination reason: Unknown
% 0.20/0.52  % (32069)Termination phase: Naming
% 0.20/0.52  
% 0.20/0.52  % (32069)Memory used [KB]: 1023
% 0.20/0.52  % (32069)Time elapsed: 0.002 s
% 0.20/0.52  % (32069)Instructions burned: 3 (million)
% 0.20/0.52  % (32069)------------------------------
% 0.20/0.52  % (32069)------------------------------
% 0.20/0.53  % (32085)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.53  % (32084)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.20/0.53  % (32062)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.20/0.53  % (32083)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.20/0.54  % (32075)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.20/0.54  % (32086)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.54  % (32066)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.20/0.54  % (32068)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.54  % (32076)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.20/0.55  % (32070)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.20/0.55  % (32068)Instruction limit reached!
% 0.20/0.55  % (32068)------------------------------
% 0.20/0.55  % (32068)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55  % (32064)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.20/0.55  % (32073)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.20/0.55  % (32090)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.20/0.55  % (32072)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.20/0.56  % (32065)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.56  % (32062)Refutation not found, incomplete strategy% (32062)------------------------------
% 0.20/0.56  % (32062)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56  TRYING [1]
% 0.20/0.56  TRYING [2]
% 0.20/0.56  % (32068)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56  % (32068)Termination reason: Unknown
% 0.20/0.56  % (32068)Termination phase: Property scanning
% 0.20/0.56  
% 0.20/0.56  % (32068)Memory used [KB]: 1279
% 0.20/0.56  % (32068)Time elapsed: 0.006 s
% 0.20/0.56  % (32068)Instructions burned: 9 (million)
% 0.20/0.56  % (32068)------------------------------
% 0.20/0.56  % (32068)------------------------------
% 0.20/0.56  % (32078)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.59/0.57  % (32080)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.59/0.57  % (32063)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 1.59/0.57  % (32084)First to succeed.
% 1.59/0.57  % (32081)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 1.59/0.57  % (32075)Also succeeded, but the first one will report.
% 1.59/0.57  % (32084)Refutation found. Thanks to Tanya!
% 1.59/0.57  % SZS status Theorem for theBenchmark
% 1.59/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 1.59/0.57  % (32084)------------------------------
% 1.59/0.57  % (32084)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.57  % (32084)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.57  % (32084)Termination reason: Refutation
% 1.59/0.57  
% 1.59/0.57  % (32084)Memory used [KB]: 5884
% 1.59/0.57  % (32084)Time elapsed: 0.134 s
% 1.59/0.57  % (32084)Instructions burned: 17 (million)
% 1.59/0.57  % (32084)------------------------------
% 1.59/0.57  % (32084)------------------------------
% 1.59/0.57  % (32060)Success in time 0.218 s
%------------------------------------------------------------------------------