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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC140+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 : 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:39:04 EDT 2022

% Result   : Theorem 0.20s 0.53s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    9 (   5 unt;   0 def)
%            Number of atoms       :   37 (   9 equ)
%            Maximal formula atoms :    8 (   4 avg)
%            Number of connectives :   39 (  11   ~;   6   |;  14   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   7 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   16 (   8   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f127,plain,
    $false,
    inference(subsumption_resolution,[],[f120,f102]) ).

fof(f102,plain,
    neq(sK1,nil),
    inference(cnf_transformation,[],[f101]) ).

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

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

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

fof(f120,plain,
    ~ neq(sK1,nil),
    inference(definition_unfolding,[],[f105,f103]) ).

fof(f103,plain,
    sK3 = sK1,
    inference(cnf_transformation,[],[f101]) ).

fof(f105,plain,
    ~ neq(sK3,nil),
    inference(cnf_transformation,[],[f101]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SWC140+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_uns --cores 0 -t %d %s
% 0.12/0.35  % Computer : n011.cluster.edu
% 0.12/0.35  % Model    : x86_64 x86_64
% 0.12/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35  % Memory   : 8042.1875MB
% 0.12/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35  % CPULimit   : 300
% 0.12/0.35  % WCLimit    : 300
% 0.12/0.35  % DateTime   : Tue Aug 30 18:23:10 EDT 2022
% 0.12/0.35  % CPUTime    : 
% 0.20/0.51  % (8658)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.20/0.51  % (8670)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.52  % (8662)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.52  % (8653)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.52  % (8653)First to succeed.
% 0.20/0.53  % (8653)Refutation found. Thanks to Tanya!
% 0.20/0.53  % SZS status Theorem for theBenchmark
% 0.20/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53  % (8653)------------------------------
% 0.20/0.53  % (8653)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (8653)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (8653)Termination reason: Refutation
% 0.20/0.53  
% 0.20/0.53  % (8653)Memory used [KB]: 6012
% 0.20/0.53  % (8653)Time elapsed: 0.102 s
% 0.20/0.53  % (8653)Instructions burned: 2 (million)
% 0.20/0.53  % (8653)------------------------------
% 0.20/0.53  % (8653)------------------------------
% 0.20/0.53  % (8644)Success in time 0.169 s
%------------------------------------------------------------------------------