TSTP Solution File: SEU152+2 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SEU152+2 : 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_uns --cores 0 -t %d %s

% Computer : n011.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:26:56 EDT 2022

% Result   : Theorem 0.19s 0.47s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   18 (   5 unt;   0 def)
%            Number of atoms       :   37 (  11 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   34 (  15   ~;   8   |;   6   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   24 (  20   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f582,plain,
    $false,
    inference(subsumption_resolution,[],[f579,f561]) ).

fof(f561,plain,
    subset(singleton(sK8),sK9),
    inference(unit_resulting_resolution,[],[f302,f250]) ).

fof(f250,plain,
    ! [X0,X1] :
      ( subset(singleton(X1),X0)
      | ~ in(X1,X0) ),
    inference(cnf_transformation,[],[f164]) ).

fof(f164,plain,
    ! [X0,X1] :
      ( ( in(X1,X0)
        | ~ subset(singleton(X1),X0) )
      & ( subset(singleton(X1),X0)
        | ~ in(X1,X0) ) ),
    inference(rectify,[],[f163]) ).

fof(f163,plain,
    ! [X1,X0] :
      ( ( in(X0,X1)
        | ~ subset(singleton(X0),X1) )
      & ( subset(singleton(X0),X1)
        | ~ in(X0,X1) ) ),
    inference(nnf_transformation,[],[f33]) ).

fof(f33,axiom,
    ! [X1,X0] :
      ( in(X0,X1)
    <=> subset(singleton(X0),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).

fof(f302,plain,
    in(sK8,sK9),
    inference(cnf_transformation,[],[f204]) ).

fof(f204,plain,
    ( in(sK8,sK9)
    & sK9 != set_union2(singleton(sK8),sK9) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9])],[f128,f203]) ).

fof(f203,plain,
    ( ? [X0,X1] :
        ( in(X0,X1)
        & set_union2(singleton(X0),X1) != X1 )
   => ( in(sK8,sK9)
      & sK9 != set_union2(singleton(sK8),sK9) ) ),
    introduced(choice_axiom,[]) ).

fof(f128,plain,
    ? [X0,X1] :
      ( in(X0,X1)
      & set_union2(singleton(X0),X1) != X1 ),
    inference(ennf_transformation,[],[f32]) ).

fof(f32,negated_conjecture,
    ~ ! [X1,X0] :
        ( in(X0,X1)
       => set_union2(singleton(X0),X1) = X1 ),
    inference(negated_conjecture,[],[f31]) ).

fof(f31,conjecture,
    ! [X1,X0] :
      ( in(X0,X1)
     => set_union2(singleton(X0),X1) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l23_zfmisc_1) ).

fof(f579,plain,
    ~ subset(singleton(sK8),sK9),
    inference(unit_resulting_resolution,[],[f301,f226]) ).

fof(f226,plain,
    ! [X0,X1] :
      ( ~ subset(X1,X0)
      | set_union2(X1,X0) = X0 ),
    inference(cnf_transformation,[],[f143]) ).

fof(f143,plain,
    ! [X0,X1] :
      ( set_union2(X1,X0) = X0
      | ~ subset(X1,X0) ),
    inference(rectify,[],[f125]) ).

fof(f125,plain,
    ! [X1,X0] :
      ( set_union2(X0,X1) = X1
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f42]) ).

fof(f42,axiom,
    ! [X1,X0] :
      ( subset(X0,X1)
     => set_union2(X0,X1) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).

fof(f301,plain,
    sK9 != set_union2(singleton(sK8),sK9),
    inference(cnf_transformation,[],[f204]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SEU152+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.34  % Computer : n011.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 30 14:56:25 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.43  % (23403)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)
% 0.19/0.45  % (23399)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.46  % (23399)First to succeed.
% 0.19/0.47  % (23413)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.47  % (23413)Instruction limit reached!
% 0.19/0.47  % (23413)------------------------------
% 0.19/0.47  % (23413)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47  % (23399)Refutation found. Thanks to Tanya!
% 0.19/0.47  % SZS status Theorem for theBenchmark
% 0.19/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.47  % (23399)------------------------------
% 0.19/0.47  % (23399)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47  % (23399)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.47  % (23399)Termination reason: Refutation
% 0.19/0.47  
% 0.19/0.47  % (23399)Memory used [KB]: 6268
% 0.19/0.47  % (23399)Time elapsed: 0.080 s
% 0.19/0.47  % (23399)Instructions burned: 13 (million)
% 0.19/0.47  % (23399)------------------------------
% 0.19/0.47  % (23399)------------------------------
% 0.19/0.47  % (23395)Success in time 0.122 s
%------------------------------------------------------------------------------