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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC289+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:42:55 EDT 2022

% Result   : Theorem 0.15s 0.49s
% 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       :   97 (  27 equ)
%            Maximal formula atoms :   16 (   6 avg)
%            Number of connectives :  102 (  19   ~;   6   |;  65   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   8 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   32 (   8   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f769,plain,
    $false,
    inference(subsumption_resolution,[],[f535,f556]) ).

fof(f556,plain,
    strictorderedP(sK50),
    inference(definition_unfolding,[],[f531,f534]) ).

fof(f534,plain,
    sK52 = sK50,
    inference(cnf_transformation,[],[f334]) ).

fof(f334,plain,
    ( ~ strictorderedP(sK50)
    & sK52 = sK50
    & ssList(sK53)
    & sK53 = sK51
    & strictorderedP(sK52)
    & ssList(sK52)
    & ssList(sK51)
    & ssList(sK50) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK50,sK51,sK52,sK53])],[f161,f333,f332,f331,f330]) ).

fof(f330,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( ~ strictorderedP(X0)
                    & X0 = X2
                    & ssList(X3)
                    & X1 = X3
                    & strictorderedP(X2) )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ~ strictorderedP(sK50)
                  & sK50 = X2
                  & ssList(X3)
                  & X1 = X3
                  & strictorderedP(X2) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK50) ) ),
    introduced(choice_axiom,[]) ).

fof(f331,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ~ strictorderedP(sK50)
                & sK50 = X2
                & ssList(X3)
                & X1 = X3
                & strictorderedP(X2) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ~ strictorderedP(sK50)
              & sK50 = X2
              & ssList(X3)
              & sK51 = X3
              & strictorderedP(X2) )
          & ssList(X2) )
      & ssList(sK51) ) ),
    introduced(choice_axiom,[]) ).

fof(f332,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ~ strictorderedP(sK50)
            & sK50 = X2
            & ssList(X3)
            & sK51 = X3
            & strictorderedP(X2) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ~ strictorderedP(sK50)
          & sK52 = sK50
          & ssList(X3)
          & sK51 = X3
          & strictorderedP(sK52) )
      & ssList(sK52) ) ),
    introduced(choice_axiom,[]) ).

fof(f333,plain,
    ( ? [X3] :
        ( ~ strictorderedP(sK50)
        & sK52 = sK50
        & ssList(X3)
        & sK51 = X3
        & strictorderedP(sK52) )
   => ( ~ strictorderedP(sK50)
      & sK52 = sK50
      & ssList(sK53)
      & sK53 = sK51
      & strictorderedP(sK52) ) ),
    introduced(choice_axiom,[]) ).

fof(f161,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ~ strictorderedP(X0)
                  & X0 = X2
                  & ssList(X3)
                  & X1 = X3
                  & strictorderedP(X2) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f160]) ).

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

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

fof(f531,plain,
    strictorderedP(sK52),
    inference(cnf_transformation,[],[f334]) ).

fof(f535,plain,
    ~ strictorderedP(sK50),
    inference(cnf_transformation,[],[f334]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : SWC289+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.10  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.10/0.30  % Computer : n010.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 300
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Tue Aug 30 18:36:44 EDT 2022
% 0.10/0.30  % CPUTime    : 
% 0.15/0.46  % (5678)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.15/0.46  % (5677)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.15/0.46  % (5689)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)
% 0.15/0.47  % (5685)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.15/0.47  % (5686)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.15/0.47  % (5678)Instruction limit reached!
% 0.15/0.47  % (5678)------------------------------
% 0.15/0.47  % (5678)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.47  % (5678)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.47  % (5678)Termination reason: Unknown
% 0.15/0.47  % (5678)Termination phase: shuffling
% 0.15/0.47  
% 0.15/0.47  % (5678)Memory used [KB]: 895
% 0.15/0.47  % (5678)Time elapsed: 0.004 s
% 0.15/0.47  % (5678)Instructions burned: 2 (million)
% 0.15/0.47  % (5678)------------------------------
% 0.15/0.47  % (5678)------------------------------
% 0.15/0.47  % (5694)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.15/0.47  % (5695)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.15/0.48  % (5677)Instruction limit reached!
% 0.15/0.48  % (5677)------------------------------
% 0.15/0.48  % (5677)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.48  % (5677)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.48  % (5677)Termination reason: Unknown
% 0.15/0.48  % (5677)Termination phase: shuffling
% 0.15/0.48  
% 0.15/0.48  % (5677)Memory used [KB]: 1279
% 0.15/0.48  % (5677)Time elapsed: 0.008 s
% 0.15/0.48  % (5677)Instructions burned: 8 (million)
% 0.15/0.48  % (5677)------------------------------
% 0.15/0.48  % (5677)------------------------------
% 0.15/0.48  % (5689)First to succeed.
% 0.15/0.48  % (5681)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.15/0.49  % (5697)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.15/0.49  % (5689)Refutation found. Thanks to Tanya!
% 0.15/0.49  % SZS status Theorem for theBenchmark
% 0.15/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.49  % (5689)------------------------------
% 0.15/0.49  % (5689)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.49  % (5689)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.49  % (5689)Termination reason: Refutation
% 0.15/0.49  
% 0.15/0.49  % (5689)Memory used [KB]: 1407
% 0.15/0.49  % (5689)Time elapsed: 0.012 s
% 0.15/0.49  % (5689)Instructions burned: 13 (million)
% 0.15/0.49  % (5689)------------------------------
% 0.15/0.49  % (5689)------------------------------
% 0.15/0.49  % (5669)Success in time 0.183 s
%------------------------------------------------------------------------------