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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC134+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 : n014.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:02 EDT 2022

% Result   : Theorem 1.37s 0.54s
% Output   : Refutation 1.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   35 (  12 unt;   0 def)
%            Number of atoms       :  143 (  37 equ)
%            Maximal formula atoms :   16 (   4 avg)
%            Number of connectives :  159 (  51   ~;  24   |;  66   &)
%                                         (   4 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   40 (  16   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f755,plain,
    $false,
    inference(avatar_sat_refutation,[],[f610,f746,f754]) ).

fof(f754,plain,
    ~ spl57_8,
    inference(avatar_contradiction_clause,[],[f753]) ).

fof(f753,plain,
    ( $false
    | ~ spl57_8 ),
    inference(subsumption_resolution,[],[f751,f425]) ).

fof(f425,plain,
    cyclefreeP(nil),
    inference(cnf_transformation,[],[f60]) ).

fof(f60,axiom,
    cyclefreeP(nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax60) ).

fof(f751,plain,
    ( ~ cyclefreeP(nil)
    | ~ spl57_8 ),
    inference(backward_demodulation,[],[f417,f670]) ).

fof(f670,plain,
    ( nil = sK28
    | ~ spl57_8 ),
    inference(avatar_component_clause,[],[f668]) ).

fof(f668,plain,
    ( spl57_8
  <=> nil = sK28 ),
    introduced(avatar_definition,[new_symbols(naming,[spl57_8])]) ).

fof(f417,plain,
    ~ cyclefreeP(sK28),
    inference(cnf_transformation,[],[f278]) ).

fof(f278,plain,
    ( ssList(sK28)
    & ~ neq(sK30,nil)
    & sK29 = sK27
    & sK30 = sK28
    & ~ cyclefreeP(sK28)
    & ssList(sK30)
    & ssList(sK29)
    & ssList(sK27) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK27,sK28,sK29,sK30])],[f143,f277,f276,f275,f274]) ).

fof(f274,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( ? [X3] :
                    ( ~ neq(X3,nil)
                    & X0 = X2
                    & X1 = X3
                    & ~ cyclefreeP(X1)
                    & ssList(X3) )
                & ssList(X2) ) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ~ neq(X3,nil)
                  & sK27 = X2
                  & X1 = X3
                  & ~ cyclefreeP(X1)
                  & ssList(X3) )
              & ssList(X2) ) )
      & ssList(sK27) ) ),
    introduced(choice_axiom,[]) ).

fof(f275,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ? [X3] :
                ( ~ neq(X3,nil)
                & sK27 = X2
                & X1 = X3
                & ~ cyclefreeP(X1)
                & ssList(X3) )
            & ssList(X2) ) )
   => ( ssList(sK28)
      & ? [X2] :
          ( ? [X3] :
              ( ~ neq(X3,nil)
              & sK27 = X2
              & sK28 = X3
              & ~ cyclefreeP(sK28)
              & ssList(X3) )
          & ssList(X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f276,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ~ neq(X3,nil)
            & sK27 = X2
            & sK28 = X3
            & ~ cyclefreeP(sK28)
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ~ neq(X3,nil)
          & sK29 = sK27
          & sK28 = X3
          & ~ cyclefreeP(sK28)
          & ssList(X3) )
      & ssList(sK29) ) ),
    introduced(choice_axiom,[]) ).

fof(f277,plain,
    ( ? [X3] :
        ( ~ neq(X3,nil)
        & sK29 = sK27
        & sK28 = X3
        & ~ cyclefreeP(sK28)
        & ssList(X3) )
   => ( ~ neq(sK30,nil)
      & sK29 = sK27
      & sK30 = sK28
      & ~ cyclefreeP(sK28)
      & ssList(sK30) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f746,plain,
    ( spl57_8
    | ~ spl57_1 ),
    inference(avatar_split_clause,[],[f745,f593,f668]) ).

fof(f593,plain,
    ( spl57_1
  <=> ssList(nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl57_1])]) ).

fof(f745,plain,
    ( nil = sK28
    | ~ spl57_1 ),
    inference(subsumption_resolution,[],[f744,f594]) ).

fof(f594,plain,
    ( ssList(nil)
    | ~ spl57_1 ),
    inference(avatar_component_clause,[],[f593]) ).

fof(f744,plain,
    ( ~ ssList(nil)
    | nil = sK28 ),
    inference(subsumption_resolution,[],[f739,f421]) ).

fof(f421,plain,
    ssList(sK28),
    inference(cnf_transformation,[],[f278]) ).

fof(f739,plain,
    ( ~ ssList(sK28)
    | ~ ssList(nil)
    | nil = sK28 ),
    inference(resolution,[],[f532,f555]) ).

fof(f555,plain,
    ~ neq(sK28,nil),
    inference(definition_unfolding,[],[f420,f418]) ).

fof(f418,plain,
    sK30 = sK28,
    inference(cnf_transformation,[],[f278]) ).

fof(f420,plain,
    ~ neq(sK30,nil),
    inference(cnf_transformation,[],[f278]) ).

fof(f532,plain,
    ! [X0,X1] :
      ( neq(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f335]) ).

fof(f335,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ~ ssList(X1)
          | ( ( X0 != X1
              | ~ neq(X0,X1) )
            & ( neq(X0,X1)
              | X0 = X1 ) ) ) ),
    inference(nnf_transformation,[],[f114]) ).

fof(f114,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ~ ssList(X1)
          | ( X0 != X1
          <=> neq(X0,X1) ) ) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( X0 != X1
          <=> neq(X0,X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).

fof(f610,plain,
    spl57_1,
    inference(avatar_split_clause,[],[f520,f593]) ).

fof(f520,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f17]) ).

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : SWC134+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35  % Computer : n014.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 30 18:23:48 EDT 2022
% 0.14/0.36  % CPUTime    : 
% 0.21/0.52  % (16713)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 1.20/0.52  % (16704)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 1.20/0.53  % (16711)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.20/0.53  % (16719)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.20/0.53  % (16729)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 1.20/0.53  % (16706)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)
% 1.20/0.53  % (16719)Instruction limit reached!
% 1.20/0.53  % (16719)------------------------------
% 1.20/0.53  % (16719)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.20/0.53  % (16706)Instruction limit reached!
% 1.20/0.53  % (16706)------------------------------
% 1.20/0.53  % (16706)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.20/0.53  % (16706)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.20/0.53  % (16706)Termination reason: Unknown
% 1.20/0.53  % (16706)Termination phase: Preprocessing 3
% 1.20/0.53  
% 1.20/0.53  % (16706)Memory used [KB]: 1535
% 1.20/0.53  % (16706)Time elapsed: 0.002 s
% 1.20/0.53  % (16706)Instructions burned: 3 (million)
% 1.20/0.53  % (16706)------------------------------
% 1.20/0.53  % (16706)------------------------------
% 1.20/0.53  % (16719)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.20/0.53  % (16719)Termination reason: Unknown
% 1.20/0.53  % (16719)Termination phase: Function definition elimination
% 1.20/0.53  
% 1.20/0.53  % (16719)Memory used [KB]: 1791
% 1.20/0.53  % (16719)Time elapsed: 0.006 s
% 1.20/0.53  % (16719)Instructions burned: 7 (million)
% 1.20/0.53  % (16719)------------------------------
% 1.20/0.53  % (16719)------------------------------
% 1.20/0.54  % (16708)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 1.20/0.54  % (16712)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)
% 1.37/0.54  % (16714)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 1.37/0.54  % (16704)First to succeed.
% 1.37/0.54  % (16704)Refutation found. Thanks to Tanya!
% 1.37/0.54  % SZS status Theorem for theBenchmark
% 1.37/0.54  % SZS output start Proof for theBenchmark
% See solution above
% 1.37/0.54  % (16704)------------------------------
% 1.37/0.54  % (16704)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.37/0.54  % (16704)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.37/0.54  % (16704)Termination reason: Refutation
% 1.37/0.54  
% 1.37/0.54  % (16704)Memory used [KB]: 6396
% 1.37/0.54  % (16704)Time elapsed: 0.107 s
% 1.37/0.54  % (16704)Instructions burned: 18 (million)
% 1.37/0.54  % (16704)------------------------------
% 1.37/0.54  % (16704)------------------------------
% 1.37/0.54  % (16703)Success in time 0.176 s
%------------------------------------------------------------------------------