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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC349+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 : n010.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:43:19 EDT 2022

% Result   : Theorem 0.19s 0.52s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   20 (   7 unt;   0 def)
%            Number of atoms       :  120 (  42 equ)
%            Maximal formula atoms :   18 (   6 avg)
%            Number of connectives :  125 (  25   ~;  11   |;  76   &)
%                                         (   0 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   7 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   :   36 (  12   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f676,plain,
    $false,
    inference(unit_resulting_resolution,[],[f468,f591,f583]) ).

fof(f583,plain,
    ! [X0] :
      ( frontsegP(X0,sK37)
      | ~ ssList(X0) ),
    inference(definition_unfolding,[],[f418,f466]) ).

fof(f466,plain,
    nil = sK37,
    inference(cnf_transformation,[],[f306]) ).

fof(f306,plain,
    ( ssList(sK35)
    & neq(sK36,nil)
    & ssList(sK38)
    & sK35 = sK37
    & nil = sK37
    & ~ frontsegP(sK36,sK35)
    & sK36 = sK38
    & ssList(sK37)
    & ssList(sK36) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK35,sK36,sK37,sK38])],[f133,f305,f304,f303,f302]) ).

fof(f302,plain,
    ( ? [X0] :
        ( ssList(X0)
        & ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( neq(X1,nil)
                    & ssList(X3)
                    & X0 = X2
                    & nil = X2
                    & ~ frontsegP(X1,X0)
                    & X1 = X3 )
                & ssList(X2) )
            & ssList(X1) ) )
   => ( ssList(sK35)
      & ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( neq(X1,nil)
                  & ssList(X3)
                  & sK35 = X2
                  & nil = X2
                  & ~ frontsegP(X1,sK35)
                  & X1 = X3 )
              & ssList(X2) )
          & ssList(X1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f303,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( neq(X1,nil)
                & ssList(X3)
                & sK35 = X2
                & nil = X2
                & ~ frontsegP(X1,sK35)
                & X1 = X3 )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( neq(sK36,nil)
              & ssList(X3)
              & sK35 = X2
              & nil = X2
              & ~ frontsegP(sK36,sK35)
              & sK36 = X3 )
          & ssList(X2) )
      & ssList(sK36) ) ),
    introduced(choice_axiom,[]) ).

fof(f304,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( neq(sK36,nil)
            & ssList(X3)
            & sK35 = X2
            & nil = X2
            & ~ frontsegP(sK36,sK35)
            & sK36 = X3 )
        & ssList(X2) )
   => ( ? [X3] :
          ( neq(sK36,nil)
          & ssList(X3)
          & sK35 = sK37
          & nil = sK37
          & ~ frontsegP(sK36,sK35)
          & sK36 = X3 )
      & ssList(sK37) ) ),
    introduced(choice_axiom,[]) ).

fof(f305,plain,
    ( ? [X3] :
        ( neq(sK36,nil)
        & ssList(X3)
        & sK35 = sK37
        & nil = sK37
        & ~ frontsegP(sK36,sK35)
        & sK36 = X3 )
   => ( neq(sK36,nil)
      & ssList(sK38)
      & sK35 = sK37
      & nil = sK37
      & ~ frontsegP(sK36,sK35)
      & sK36 = sK38 ) ),
    introduced(choice_axiom,[]) ).

fof(f133,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( neq(X1,nil)
                  & ssList(X3)
                  & X0 = X2
                  & nil = X2
                  & ~ frontsegP(X1,X0)
                  & X1 = X3 )
              & ssList(X2) )
          & ssList(X1) ) ),
    inference(flattening,[],[f132]) ).

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

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

fof(f418,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | frontsegP(X0,nil) ),
    inference(cnf_transformation,[],[f167]) ).

fof(f167,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | frontsegP(X0,nil) ),
    inference(ennf_transformation,[],[f45]) ).

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

fof(f591,plain,
    ~ frontsegP(sK38,sK37),
    inference(definition_unfolding,[],[f465,f464,f467]) ).

fof(f467,plain,
    sK35 = sK37,
    inference(cnf_transformation,[],[f306]) ).

fof(f464,plain,
    sK36 = sK38,
    inference(cnf_transformation,[],[f306]) ).

fof(f465,plain,
    ~ frontsegP(sK36,sK35),
    inference(cnf_transformation,[],[f306]) ).

fof(f468,plain,
    ssList(sK38),
    inference(cnf_transformation,[],[f306]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SWC349+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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 : n010.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:41:58 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.49  % (20426)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.19/0.50  % (20419)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.19/0.50  % (20426)Instruction limit reached!
% 0.19/0.50  % (20426)------------------------------
% 0.19/0.50  % (20426)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (20426)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (20426)Termination reason: Unknown
% 0.19/0.50  % (20426)Termination phase: Unused predicate definition removal
% 0.19/0.50  
% 0.19/0.50  % (20426)Memory used [KB]: 1023
% 0.19/0.50  % (20426)Time elapsed: 0.004 s
% 0.19/0.50  % (20426)Instructions burned: 2 (million)
% 0.19/0.50  % (20426)------------------------------
% 0.19/0.50  % (20426)------------------------------
% 0.19/0.50  % (20441)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.19/0.50  % (20440)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.19/0.51  % (20444)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.19/0.51  % (20429)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.19/0.51  % (20428)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.51  % (20418)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.19/0.51  % (20427)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.19/0.51  % (20433)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.19/0.51  % (20425)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.51  % (20419)First to succeed.
% 0.19/0.52  % (20425)Instruction limit reached!
% 0.19/0.52  % (20425)------------------------------
% 0.19/0.52  % (20425)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (20425)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (20425)Termination reason: Unknown
% 0.19/0.52  % (20425)Termination phase: Function definition elimination
% 0.19/0.52  
% 0.19/0.52  % (20425)Memory used [KB]: 1279
% 0.19/0.52  % (20425)Time elapsed: 0.007 s
% 0.19/0.52  % (20425)Instructions burned: 7 (million)
% 0.19/0.52  % (20425)------------------------------
% 0.19/0.52  % (20425)------------------------------
% 0.19/0.52  % (20419)Refutation found. Thanks to Tanya!
% 0.19/0.52  % SZS status Theorem for theBenchmark
% 0.19/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52  % (20419)------------------------------
% 0.19/0.52  % (20419)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (20419)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (20419)Termination reason: Refutation
% 0.19/0.52  
% 0.19/0.52  % (20419)Memory used [KB]: 5884
% 0.19/0.52  % (20419)Time elapsed: 0.114 s
% 0.19/0.52  % (20419)Instructions burned: 16 (million)
% 0.19/0.52  % (20419)------------------------------
% 0.19/0.52  % (20419)------------------------------
% 0.19/0.52  % (20417)Success in time 0.167 s
%------------------------------------------------------------------------------