TSTP Solution File: SWW469_1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWW469_1 : TPTP v8.1.0. Released v5.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 : n026.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 19:19:28 EDT 2022

% Result   : Theorem 0.19s 0.49s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   22 (  11 unt;   4 typ;   0 def)
%            Number of atoms       :   25 (  17 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   24 (  17   ~;   3   |;   0   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    1 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   2 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   21 (  11   !;  10   ?;  21   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    state: $tType ).

tff(func_def_0,type,
    sK0: state ).

tff(func_def_1,type,
    sK1: state ).

tff(func_def_2,type,
    sK2: state ).

tff(f24,plain,
    $false,
    inference(subsumption_resolution,[],[f23,f20]) ).

tff(f20,plain,
    ! [X1: state] : ( sK0 = X1 ),
    inference(cnf_transformation,[],[f16]) ).

tff(f16,plain,
    ! [X1: state] : ( sK0 = X1 ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f13,f15]) ).

tff(f15,plain,
    ( ? [X0: state] :
      ! [X1: state] : ( X0 = X1 )
   => ! [X1: state] : ( sK0 = X1 ) ),
    introduced(choice_axiom,[]) ).

tff(f13,plain,
    ? [X0: state] :
    ! [X1: state] : ( X0 = X1 ),
    inference(ennf_transformation,[],[f8]) ).

tff(f8,plain,
    ~ ! [X0: state] :
        ~ ! [X1: state] : ( X0 = X1 ),
    inference(rectify,[],[f7]) ).

tff(f7,negated_conjecture,
    ~ ! [X1: state] :
        ~ ! [X0: state] : ( X0 = X1 ),
    inference(negated_conjecture,[],[f6]) ).

tff(f6,conjecture,
    ! [X1: state] :
      ~ ! [X0: state] : ( X0 = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).

tff(f23,plain,
    sK0 != sK2,
    inference(forward_demodulation,[],[f22,f20]) ).

tff(f22,plain,
    sK2 != sK1,
    inference(subsumption_resolution,[],[f21,f19]) ).

tff(f19,plain,
    hoare_1310879719gleton,
    inference(cnf_transformation,[],[f5]) ).

tff(f5,axiom,
    hoare_1310879719gleton,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(f21,plain,
    ( ( sK2 != sK1 )
    | ~ hoare_1310879719gleton ),
    inference(cnf_transformation,[],[f18]) ).

tff(f18,plain,
    ( ~ hoare_1310879719gleton
    | ( sK2 != sK1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f14,f17]) ).

tff(f17,plain,
    ( ? [X0: state,X1: state] : ( X0 != X1 )
   => ( sK2 != sK1 ) ),
    introduced(choice_axiom,[]) ).

tff(f14,plain,
    ( ~ hoare_1310879719gleton
    | ? [X0: state,X1: state] : ( X0 != X1 ) ),
    inference(ennf_transformation,[],[f9]) ).

tff(f9,plain,
    ( hoare_1310879719gleton
   => ? [X0: state,X1: state] : ( X0 != X1 ) ),
    inference(unused_predicate_definition_removal,[],[f1]) ).

tff(f1,axiom,
    ( ? [X0: state,X1: state] : ( X0 != X1 )
  <=> hoare_1310879719gleton ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_state__not__singleton__def) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : SWW469_1 : TPTP v8.1.0. Released v5.3.0.
% 0.06/0.12  % 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.33  % Computer : n026.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Tue Aug 30 20:54:51 EDT 2022
% 0.13/0.33  % CPUTime    : 
% 0.19/0.48  % (14875)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/101Mi)
% 0.19/0.49  % (14882)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.19/0.49  % (14882)First to succeed.
% 0.19/0.49  % (14882)Refutation found. Thanks to Tanya!
% 0.19/0.49  % SZS status Theorem for theBenchmark
% 0.19/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49  % (14882)------------------------------
% 0.19/0.49  % (14882)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49  % (14882)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49  % (14882)Termination reason: Refutation
% 0.19/0.49  
% 0.19/0.49  % (14882)Memory used [KB]: 895
% 0.19/0.49  % (14882)Time elapsed: 0.002 s
% 0.19/0.49  % (14882)Instructions burned: 1 (million)
% 0.19/0.49  % (14882)------------------------------
% 0.19/0.49  % (14882)------------------------------
% 0.19/0.49  % (14862)Success in time 0.147 s
%------------------------------------------------------------------------------