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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC385+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 : n003.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:31 EDT 2022

% Result   : Theorem 0.16s 0.52s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   20 (   8 unt;   0 def)
%            Number of atoms       :  158 (  28 equ)
%            Maximal formula atoms :   24 (   7 avg)
%            Number of connectives :  188 (  50   ~;  35   |;  91   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   7 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 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(f597,plain,
    $false,
    inference(subsumption_resolution,[],[f596,f409]) ).

fof(f409,plain,
    segmentP(sK24,sK23),
    inference(cnf_transformation,[],[f267]) ).

fof(f267,plain,
    ( ( singletonP(sK23)
      | ~ neq(sK24,nil) )
    & neq(sK22,nil)
    & segmentP(sK24,sK23)
    & sK21 = sK23
    & ( ~ segmentP(sK22,sK21)
      | ~ singletonP(sK21) )
    & sK22 = sK24
    & ssList(sK24)
    & ssList(sK23)
    & ssList(sK22)
    & ssList(sK21) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK21,sK22,sK23,sK24])],[f191,f266,f265,f264,f263]) ).

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

fof(f264,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ( singletonP(X2)
                  | ~ neq(X3,nil) )
                & neq(X1,nil)
                & segmentP(X3,X2)
                & sK21 = X2
                & ( ~ segmentP(X1,sK21)
                  | ~ singletonP(sK21) )
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ( singletonP(X2)
                | ~ neq(X3,nil) )
              & neq(sK22,nil)
              & segmentP(X3,X2)
              & sK21 = X2
              & ( ~ segmentP(sK22,sK21)
                | ~ singletonP(sK21) )
              & sK22 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK22) ) ),
    introduced(choice_axiom,[]) ).

fof(f265,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( singletonP(X2)
              | ~ neq(X3,nil) )
            & neq(sK22,nil)
            & segmentP(X3,X2)
            & sK21 = X2
            & ( ~ segmentP(sK22,sK21)
              | ~ singletonP(sK21) )
            & sK22 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( singletonP(sK23)
            | ~ neq(X3,nil) )
          & neq(sK22,nil)
          & segmentP(X3,sK23)
          & sK21 = sK23
          & ( ~ segmentP(sK22,sK21)
            | ~ singletonP(sK21) )
          & sK22 = X3
          & ssList(X3) )
      & ssList(sK23) ) ),
    introduced(choice_axiom,[]) ).

fof(f266,plain,
    ( ? [X3] :
        ( ( singletonP(sK23)
          | ~ neq(X3,nil) )
        & neq(sK22,nil)
        & segmentP(X3,sK23)
        & sK21 = sK23
        & ( ~ segmentP(sK22,sK21)
          | ~ singletonP(sK21) )
        & sK22 = X3
        & ssList(X3) )
   => ( ( singletonP(sK23)
        | ~ neq(sK24,nil) )
      & neq(sK22,nil)
      & segmentP(sK24,sK23)
      & sK21 = sK23
      & ( ~ segmentP(sK22,sK21)
        | ~ singletonP(sK21) )
      & sK22 = sK24
      & ssList(sK24) ) ),
    introduced(choice_axiom,[]) ).

fof(f191,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( singletonP(X2)
                    | ~ neq(X3,nil) )
                  & neq(X1,nil)
                  & segmentP(X3,X2)
                  & X0 = X2
                  & ( ~ segmentP(X1,X0)
                    | ~ singletonP(X0) )
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f190]) ).

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

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

fof(f596,plain,
    ~ segmentP(sK24,sK23),
    inference(subsumption_resolution,[],[f558,f595]) ).

fof(f595,plain,
    singletonP(sK23),
    inference(subsumption_resolution,[],[f411,f557]) ).

fof(f557,plain,
    neq(sK24,nil),
    inference(definition_unfolding,[],[f410,f406]) ).

fof(f406,plain,
    sK22 = sK24,
    inference(cnf_transformation,[],[f267]) ).

fof(f410,plain,
    neq(sK22,nil),
    inference(cnf_transformation,[],[f267]) ).

fof(f411,plain,
    ( singletonP(sK23)
    | ~ neq(sK24,nil) ),
    inference(cnf_transformation,[],[f267]) ).

fof(f558,plain,
    ( ~ singletonP(sK23)
    | ~ segmentP(sK24,sK23) ),
    inference(definition_unfolding,[],[f407,f406,f408,f408]) ).

fof(f408,plain,
    sK21 = sK23,
    inference(cnf_transformation,[],[f267]) ).

fof(f407,plain,
    ( ~ segmentP(sK22,sK21)
    | ~ singletonP(sK21) ),
    inference(cnf_transformation,[],[f267]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWC385+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.11/0.32  % Computer : n003.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Tue Aug 30 18:52:37 EDT 2022
% 0.11/0.33  % CPUTime    : 
% 0.16/0.48  % (11882)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.16/0.49  % (11890)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.16/0.49  % (11883)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.16/0.50  % (11883)Instruction limit reached!
% 0.16/0.50  % (11883)------------------------------
% 0.16/0.50  % (11883)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.50  % (11898)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.16/0.50  % (11891)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.16/0.50  % (11899)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.16/0.50  % (11883)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.50  % (11883)Termination reason: Unknown
% 0.16/0.50  % (11883)Termination phase: Equality resolution with deletion
% 0.16/0.50  
% 0.16/0.50  % (11883)Memory used [KB]: 1279
% 0.16/0.50  % (11883)Time elapsed: 0.008 s
% 0.16/0.50  % (11883)Instructions burned: 8 (million)
% 0.16/0.50  % (11883)------------------------------
% 0.16/0.50  % (11883)------------------------------
% 0.16/0.51  % (11898)First to succeed.
% 0.16/0.52  % (11888)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.16/0.52  % (11898)Refutation found. Thanks to Tanya!
% 0.16/0.52  % SZS status Theorem for theBenchmark
% 0.16/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.52  % (11898)------------------------------
% 0.16/0.52  % (11898)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.52  % (11898)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.52  % (11898)Termination reason: Refutation
% 0.16/0.52  
% 0.16/0.52  % (11898)Memory used [KB]: 1279
% 0.16/0.52  % (11898)Time elapsed: 0.126 s
% 0.16/0.52  % (11898)Instructions burned: 12 (million)
% 0.16/0.52  % (11898)------------------------------
% 0.16/0.52  % (11898)------------------------------
% 0.16/0.52  % (11875)Success in time 0.187 s
%------------------------------------------------------------------------------