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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWV405+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 : n004.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:44 EDT 2022

% Result   : Theorem 0.22s 0.51s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   21 (  10 unt;   0 def)
%            Number of atoms       :   36 (   1 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  11   ~;   6   |;   0   &)
%                                         (   5 <=>;   3  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-3 aty)
%            Number of variables   :   26 (  24   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f186,plain,
    $false,
    inference(avatar_sat_refutation,[],[f173,f181,f185]) ).

fof(f185,plain,
    ~ spl5_2,
    inference(avatar_contradiction_clause,[],[f184]) ).

fof(f184,plain,
    ( $false
    | ~ spl5_2 ),
    inference(resolution,[],[f172,f109]) ).

fof(f109,plain,
    ! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
    inference(cnf_transformation,[],[f10]) ).

fof(f10,axiom,
    ! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax22) ).

fof(f172,plain,
    ( pair_in_list(create_slb,sK3,sK2)
    | ~ spl5_2 ),
    inference(avatar_component_clause,[],[f170]) ).

fof(f170,plain,
    ( spl5_2
  <=> pair_in_list(create_slb,sK3,sK2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).

fof(f181,plain,
    spl5_1,
    inference(avatar_split_clause,[],[f180,f166]) ).

fof(f166,plain,
    ( spl5_1
  <=> check_cpq(sF4) ),
    introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).

fof(f180,plain,
    check_cpq(sF4),
    inference(superposition,[],[f150,f161]) ).

fof(f161,plain,
    triple(sK1,create_slb,sK0) = sF4,
    introduced(function_definition,[]) ).

fof(f150,plain,
    ! [X0,X1] : check_cpq(triple(X1,create_slb,X0)),
    inference(cnf_transformation,[],[f61]) ).

fof(f61,plain,
    ! [X0,X1] : check_cpq(triple(X1,create_slb,X0)),
    inference(rectify,[],[f24]) ).

fof(f24,axiom,
    ! [X1,X0] : check_cpq(triple(X0,create_slb,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax36) ).

fof(f173,plain,
    ( ~ spl5_1
    | spl5_2 ),
    inference(avatar_split_clause,[],[f163,f170,f166]) ).

fof(f163,plain,
    ( pair_in_list(create_slb,sK3,sK2)
    | ~ check_cpq(sF4) ),
    inference(definition_folding,[],[f111,f161]) ).

fof(f111,plain,
    ( pair_in_list(create_slb,sK3,sK2)
    | ~ check_cpq(triple(sK1,create_slb,sK0)) ),
    inference(cnf_transformation,[],[f85]) ).

fof(f85,plain,
    ? [X0,X1] :
      ( check_cpq(triple(X1,create_slb,X0))
    <~> ! [X3,X2] :
          ( ~ pair_in_list(create_slb,X2,X3)
          | less_than(X3,X2) ) ),
    inference(ennf_transformation,[],[f70]) ).

fof(f70,plain,
    ~ ! [X0,X1] :
        ( ! [X3,X2] :
            ( pair_in_list(create_slb,X2,X3)
           => less_than(X3,X2) )
      <=> check_cpq(triple(X1,create_slb,X0)) ),
    inference(rectify,[],[f43]) ).

fof(f43,negated_conjecture,
    ~ ! [X1,X0] :
        ( check_cpq(triple(X0,create_slb,X1))
      <=> ! [X3,X2] :
            ( pair_in_list(create_slb,X2,X3)
           => less_than(X3,X2) ) ),
    inference(negated_conjecture,[],[f42]) ).

fof(f42,conjecture,
    ! [X1,X0] :
      ( check_cpq(triple(X0,create_slb,X1))
    <=> ! [X3,X2] :
          ( pair_in_list(create_slb,X2,X3)
         => less_than(X3,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l41_co) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SWV405+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.35  % Computer : n004.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 30 19:19:35 EDT 2022
% 0.13/0.36  % CPUTime    : 
% 0.22/0.50  % (14686)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.22/0.50  % (14686)First to succeed.
% 0.22/0.51  % (14689)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.22/0.51  % (14686)Refutation found. Thanks to Tanya!
% 0.22/0.51  % SZS status Theorem for theBenchmark
% 0.22/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.51  % (14686)------------------------------
% 0.22/0.51  % (14686)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.51  % (14686)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.51  % (14686)Termination reason: Refutation
% 0.22/0.51  
% 0.22/0.51  % (14686)Memory used [KB]: 5500
% 0.22/0.51  % (14686)Time elapsed: 0.068 s
% 0.22/0.51  % (14686)Instructions burned: 4 (million)
% 0.22/0.51  % (14686)------------------------------
% 0.22/0.51  % (14686)------------------------------
% 0.22/0.51  % (14674)Success in time 0.148 s
%------------------------------------------------------------------------------