TSTP Solution File: SWC262+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC262+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_uns --cores 0 -t %d %s

% Computer : n015.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:39:57 EDT 2022

% Result   : Theorem 0.16s 0.46s
% Output   : Refutation 0.16s
% 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(f604,plain,
    $false,
    inference(resolution,[],[f535,f400]) ).

fof(f400,plain,
    ~ totalorderedP(sK18),
    inference(cnf_transformation,[],[f268]) ).

fof(f268,plain,
    ( ssList(sK19)
    & ssList(sK21)
    & totalorderedP(sK20)
    & sK19 = sK21
    & sK20 = sK18
    & ~ totalorderedP(sK18)
    & ssList(sK20)
    & ssList(sK18) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21])],[f119,f267,f266,f265,f264]) ).

fof(f264,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( ? [X3] :
                    ( ssList(X3)
                    & totalorderedP(X2)
                    & X1 = X3
                    & X0 = X2
                    & ~ totalorderedP(X0) )
                & ssList(X2) ) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ssList(X3)
                  & totalorderedP(X2)
                  & X1 = X3
                  & sK18 = X2
                  & ~ totalorderedP(sK18) )
              & ssList(X2) ) )
      & ssList(sK18) ) ),
    introduced(choice_axiom,[]) ).

fof(f265,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ? [X3] :
                ( ssList(X3)
                & totalorderedP(X2)
                & X1 = X3
                & sK18 = X2
                & ~ totalorderedP(sK18) )
            & ssList(X2) ) )
   => ( ssList(sK19)
      & ? [X2] :
          ( ? [X3] :
              ( ssList(X3)
              & totalorderedP(X2)
              & sK19 = X3
              & sK18 = X2
              & ~ totalorderedP(sK18) )
          & ssList(X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f266,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ssList(X3)
            & totalorderedP(X2)
            & sK19 = X3
            & sK18 = X2
            & ~ totalorderedP(sK18) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ssList(X3)
          & totalorderedP(sK20)
          & sK19 = X3
          & sK20 = sK18
          & ~ totalorderedP(sK18) )
      & ssList(sK20) ) ),
    introduced(choice_axiom,[]) ).

fof(f267,plain,
    ( ? [X3] :
        ( ssList(X3)
        & totalorderedP(sK20)
        & sK19 = X3
        & sK20 = sK18
        & ~ totalorderedP(sK18) )
   => ( ssList(sK21)
      & totalorderedP(sK20)
      & sK19 = sK21
      & sK20 = sK18
      & ~ totalorderedP(sK18) ) ),
    introduced(choice_axiom,[]) ).

fof(f119,plain,
    ? [X0] :
      ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ssList(X3)
                  & totalorderedP(X2)
                  & X1 = X3
                  & X0 = X2
                  & ~ totalorderedP(X0) )
              & ssList(X2) ) )
      & ssList(X0) ),
    inference(flattening,[],[f118]) ).

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

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

fof(f535,plain,
    totalorderedP(sK18),
    inference(definition_unfolding,[],[f403,f401]) ).

fof(f401,plain,
    sK20 = sK18,
    inference(cnf_transformation,[],[f268]) ).

fof(f403,plain,
    totalorderedP(sK20),
    inference(cnf_transformation,[],[f268]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem    : SWC262+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.10/0.31  % Computer : n015.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Tue Aug 30 18:52:21 EDT 2022
% 0.16/0.31  % CPUTime    : 
% 0.16/0.44  % (14579)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.16/0.44  % (14579)Instruction limit reached!
% 0.16/0.44  % (14579)------------------------------
% 0.16/0.44  % (14579)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.44  % (14579)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.44  % (14579)Termination reason: Unknown
% 0.16/0.44  % (14579)Termination phase: Preprocessing 3
% 0.16/0.44  
% 0.16/0.44  % (14579)Memory used [KB]: 1663
% 0.16/0.44  % (14579)Time elapsed: 0.005 s
% 0.16/0.44  % (14579)Instructions burned: 4 (million)
% 0.16/0.44  % (14579)------------------------------
% 0.16/0.44  % (14579)------------------------------
% 0.16/0.45  % (14587)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.16/0.46  % (14578)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.16/0.46  % (14587)First to succeed.
% 0.16/0.46  % (14568)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.16/0.46  % (14567)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.16/0.46  % (14587)Refutation found. Thanks to Tanya!
% 0.16/0.46  % SZS status Theorem for theBenchmark
% 0.16/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.46  % (14587)------------------------------
% 0.16/0.46  % (14587)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.46  % (14587)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.46  % (14587)Termination reason: Refutation
% 0.16/0.46  
% 0.16/0.46  % (14587)Memory used [KB]: 6268
% 0.16/0.46  % (14587)Time elapsed: 0.093 s
% 0.16/0.46  % (14587)Instructions burned: 11 (million)
% 0.16/0.46  % (14587)------------------------------
% 0.16/0.46  % (14587)------------------------------
% 0.16/0.46  % (14564)Success in time 0.145 s
%------------------------------------------------------------------------------