TSTP Solution File: SET063+3 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SET063+3 : TPTP v8.1.0. Released v2.2.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 : 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 18:18:51 EDT 2022

% Result   : Theorem 0.19s 0.49s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   18 (   6 unt;   0 def)
%            Number of atoms       :   47 (  17 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   48 (  19   ~;  12   |;  12   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   18 (  16   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f37,plain,
    $false,
    inference(subsumption_resolution,[],[f36,f29]) ).

fof(f29,plain,
    ! [X0] : subset(empty_set,X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f1,axiom,
    ! [X0] : subset(empty_set,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_subset) ).

fof(f36,plain,
    ~ subset(empty_set,sK0),
    inference(subsumption_resolution,[],[f35,f22]) ).

fof(f22,plain,
    empty_set != sK0,
    inference(cnf_transformation,[],[f14]) ).

fof(f14,plain,
    ( subset(sK0,empty_set)
    & empty_set != sK0 ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f12,f13]) ).

fof(f13,plain,
    ( ? [X0] :
        ( subset(X0,empty_set)
        & empty_set != X0 )
   => ( subset(sK0,empty_set)
      & empty_set != sK0 ) ),
    introduced(choice_axiom,[]) ).

fof(f12,plain,
    ? [X0] :
      ( subset(X0,empty_set)
      & empty_set != X0 ),
    inference(ennf_transformation,[],[f8]) ).

fof(f8,negated_conjecture,
    ~ ! [X0] :
        ( subset(X0,empty_set)
       => empty_set = X0 ),
    inference(negated_conjecture,[],[f7]) ).

fof(f7,conjecture,
    ! [X0] :
      ( subset(X0,empty_set)
     => empty_set = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subset_of_empty_set_is_empty_set) ).

fof(f35,plain,
    ( empty_set = sK0
    | ~ subset(empty_set,sK0) ),
    inference(resolution,[],[f23,f24]) ).

fof(f24,plain,
    ! [X0,X1] :
      ( ~ subset(X1,X0)
      | ~ subset(X0,X1)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f17]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( ( ( subset(X1,X0)
          & subset(X0,X1) )
        | X0 != X1 )
      & ( X0 = X1
        | ~ subset(X1,X0)
        | ~ subset(X0,X1) ) ),
    inference(rectify,[],[f16]) ).

fof(f16,plain,
    ! [X1,X0] :
      ( ( ( subset(X0,X1)
          & subset(X1,X0) )
        | X0 != X1 )
      & ( X0 = X1
        | ~ subset(X0,X1)
        | ~ subset(X1,X0) ) ),
    inference(flattening,[],[f15]) ).

fof(f15,plain,
    ! [X1,X0] :
      ( ( ( subset(X0,X1)
          & subset(X1,X0) )
        | X0 != X1 )
      & ( X0 = X1
        | ~ subset(X0,X1)
        | ~ subset(X1,X0) ) ),
    inference(nnf_transformation,[],[f10]) ).

fof(f10,plain,
    ! [X1,X0] :
      ( ( subset(X0,X1)
        & subset(X1,X0) )
    <=> X0 = X1 ),
    inference(rectify,[],[f4]) ).

fof(f4,axiom,
    ! [X1,X0] :
      ( X0 = X1
    <=> ( subset(X0,X1)
        & subset(X1,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).

fof(f23,plain,
    subset(sK0,empty_set),
    inference(cnf_transformation,[],[f14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : SET063+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --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 13:19:36 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.48  % (28678)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.49  % (28669)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)
% 0.19/0.49  % (28669)First to succeed.
% 0.19/0.49  % (28693)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.49  % (28688)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.49  % (28669)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  % (28669)------------------------------
% 0.19/0.49  % (28669)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49  % (28669)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49  % (28669)Termination reason: Refutation
% 0.19/0.49  
% 0.19/0.49  % (28669)Memory used [KB]: 5884
% 0.19/0.49  % (28669)Time elapsed: 0.086 s
% 0.19/0.49  % (28669)Instructions burned: 2 (million)
% 0.19/0.49  % (28669)------------------------------
% 0.19/0.49  % (28669)------------------------------
% 0.19/0.49  % (28666)Success in time 0.151 s
%------------------------------------------------------------------------------