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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWV413+1 : TPTP v8.1.0. Released v3.3.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:56:46 EDT 2022

% Result   : Theorem 0.18s 0.54s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   21 (   4 unt;   0 def)
%            Number of atoms       :   74 (   0 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :   83 (  30   ~;  18   |;  29   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   64 (  45   !;  19   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f152,plain,
    $false,
    inference(subsumption_resolution,[],[f151,f81]) ).

fof(f81,plain,
    less_than(sK1,sK2),
    inference(cnf_transformation,[],[f56]) ).

fof(f56,plain,
    ( less_than(sK1,sK2)
    & ! [X4] :
        ( ~ less_than(sK1,X4)
        | ~ pair_in_list(update_slb(sK3,sK1),sK0,X4) )
    & pair_in_list(sK3,sK0,sK2)
    & strictly_less_than(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f54,f55]) ).

fof(f55,plain,
    ( ? [X0,X1,X2,X3] :
        ( less_than(X1,X2)
        & ! [X4] :
            ( ~ less_than(X1,X4)
            | ~ pair_in_list(update_slb(X3,X1),X0,X4) )
        & pair_in_list(X3,X0,X2)
        & strictly_less_than(X0,X1) )
   => ( less_than(sK1,sK2)
      & ! [X4] :
          ( ~ less_than(sK1,X4)
          | ~ pair_in_list(update_slb(sK3,sK1),sK0,X4) )
      & pair_in_list(sK3,sK0,sK2)
      & strictly_less_than(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f54,plain,
    ? [X0,X1,X2,X3] :
      ( less_than(X1,X2)
      & ! [X4] :
          ( ~ less_than(X1,X4)
          | ~ pair_in_list(update_slb(X3,X1),X0,X4) )
      & pair_in_list(X3,X0,X2)
      & strictly_less_than(X0,X1) ),
    inference(rectify,[],[f42]) ).

fof(f42,plain,
    ? [X0,X2,X1,X3] :
      ( less_than(X2,X1)
      & ! [X4] :
          ( ~ less_than(X2,X4)
          | ~ pair_in_list(update_slb(X3,X2),X0,X4) )
      & pair_in_list(X3,X0,X1)
      & strictly_less_than(X0,X2) ),
    inference(flattening,[],[f41]) ).

fof(f41,plain,
    ? [X3,X2,X1,X0] :
      ( ! [X4] :
          ( ~ less_than(X2,X4)
          | ~ pair_in_list(update_slb(X3,X2),X0,X4) )
      & pair_in_list(X3,X0,X1)
      & strictly_less_than(X0,X2)
      & less_than(X2,X1) ),
    inference(ennf_transformation,[],[f34]) ).

fof(f34,plain,
    ~ ! [X3,X2,X1,X0] :
        ( ( pair_in_list(X3,X0,X1)
          & strictly_less_than(X0,X2)
          & less_than(X2,X1) )
       => ? [X4] :
            ( pair_in_list(update_slb(X3,X2),X0,X4)
            & less_than(X2,X4) ) ),
    inference(rectify,[],[f21]) ).

fof(f21,negated_conjecture,
    ~ ! [X1,X2,X3,X0] :
        ( ( strictly_less_than(X1,X3)
          & less_than(X3,X2)
          & pair_in_list(X0,X1,X2) )
       => ? [X4] :
            ( pair_in_list(update_slb(X0,X3),X1,X4)
            & less_than(X3,X4) ) ),
    inference(negated_conjecture,[],[f20]) ).

fof(f20,conjecture,
    ! [X1,X2,X3,X0] :
      ( ( strictly_less_than(X1,X3)
        & less_than(X3,X2)
        & pair_in_list(X0,X1,X2) )
     => ? [X4] :
          ( pair_in_list(update_slb(X0,X3),X1,X4)
          & less_than(X3,X4) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l49_co) ).

fof(f151,plain,
    ~ less_than(sK1,sK2),
    inference(resolution,[],[f135,f79]) ).

fof(f79,plain,
    pair_in_list(sK3,sK0,sK2),
    inference(cnf_transformation,[],[f56]) ).

fof(f135,plain,
    ! [X0] :
      ( ~ pair_in_list(sK3,sK0,X0)
      | ~ less_than(sK1,X0) ),
    inference(duplicate_literal_removal,[],[f134]) ).

fof(f134,plain,
    ! [X0] :
      ( ~ pair_in_list(sK3,sK0,X0)
      | ~ less_than(sK1,X0)
      | ~ less_than(sK1,X0) ),
    inference(resolution,[],[f83,f80]) ).

fof(f80,plain,
    ! [X4] :
      ( ~ pair_in_list(update_slb(sK3,sK1),sK0,X4)
      | ~ less_than(sK1,X4) ),
    inference(cnf_transformation,[],[f56]) ).

fof(f83,plain,
    ! [X2,X3,X0,X1] :
      ( pair_in_list(update_slb(X2,X0),X1,X3)
      | ~ less_than(X0,X3)
      | ~ pair_in_list(X2,X1,X3) ),
    inference(cnf_transformation,[],[f57]) ).

fof(f57,plain,
    ! [X0,X1,X2,X3] :
      ( pair_in_list(update_slb(X2,X0),X1,X3)
      | ~ pair_in_list(X2,X1,X3)
      | ~ less_than(X0,X3) ),
    inference(rectify,[],[f40]) ).

fof(f40,plain,
    ! [X1,X0,X3,X2] :
      ( pair_in_list(update_slb(X3,X1),X0,X2)
      | ~ pair_in_list(X3,X0,X2)
      | ~ less_than(X1,X2) ),
    inference(flattening,[],[f39]) ).

fof(f39,plain,
    ! [X1,X0,X3,X2] :
      ( pair_in_list(update_slb(X3,X1),X0,X2)
      | ~ pair_in_list(X3,X0,X2)
      | ~ less_than(X1,X2) ),
    inference(ennf_transformation,[],[f26]) ).

fof(f26,plain,
    ! [X1,X0,X3,X2] :
      ( ( pair_in_list(X3,X0,X2)
        & less_than(X1,X2) )
     => pair_in_list(update_slb(X3,X1),X0,X2) ),
    inference(rectify,[],[f19]) ).

fof(f19,axiom,
    ! [X1,X3,X2,X0] :
      ( ( pair_in_list(X0,X1,X2)
        & less_than(X3,X2) )
     => pair_in_list(update_slb(X0,X3),X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l49_li3637) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SWV413+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34  % Computer : n010.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 19:15:58 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.18/0.50  % (20817)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.51  % (20815)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.18/0.51  % (20813)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.52  % (20833)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.18/0.52  % (20816)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.18/0.52  % (20832)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.18/0.52  % (20826)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.18/0.52  % (20834)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.18/0.52  % (20817)Instruction limit reached!
% 0.18/0.52  % (20817)------------------------------
% 0.18/0.52  % (20817)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52  % (20818)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.18/0.52  % (20825)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.18/0.52  % (20817)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52  % (20817)Termination reason: Unknown
% 0.18/0.52  % (20817)Termination phase: Saturation
% 0.18/0.52  
% 0.18/0.52  % (20817)Memory used [KB]: 5500
% 0.18/0.52  % (20817)Time elapsed: 0.113 s
% 0.18/0.52  % (20817)Instructions burned: 7 (million)
% 0.18/0.52  % (20817)------------------------------
% 0.18/0.52  % (20817)------------------------------
% 0.18/0.52  % (20824)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.18/0.53  % (20833)First to succeed.
% 0.18/0.53  % (20814)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.53  % (20810)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.18/0.53  % (20832)Also succeeded, but the first one will report.
% 0.18/0.54  % (20833)Refutation found. Thanks to Tanya!
% 0.18/0.54  % SZS status Theorem for theBenchmark
% 0.18/0.54  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.54  % (20833)------------------------------
% 0.18/0.54  % (20833)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.54  % (20833)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.54  % (20833)Termination reason: Refutation
% 0.18/0.54  
% 0.18/0.54  % (20833)Memory used [KB]: 5500
% 0.18/0.54  % (20833)Time elapsed: 0.124 s
% 0.18/0.54  % (20833)Instructions burned: 5 (million)
% 0.18/0.54  % (20833)------------------------------
% 0.18/0.54  % (20833)------------------------------
% 0.18/0.54  % (20809)Success in time 0.183 s
%------------------------------------------------------------------------------