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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SET584+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 : n001.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:21:30 EDT 2022

% Result   : Theorem 0.19s 0.52s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   35 (   9 unt;   0 def)
%            Number of atoms       :   92 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   93 (  36   ~;  28   |;  17   &)
%                                         (   5 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   70 (  58   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f77,plain,
    $false,
    inference(subsumption_resolution,[],[f73,f58]) ).

fof(f58,plain,
    ~ member(sK0(union(sK2,sK1),union(sK3,sK1)),sK3),
    inference(resolution,[],[f49,f28]) ).

fof(f28,plain,
    ! [X2,X0,X1] :
      ( member(X0,union(X2,X1))
      | ~ member(X0,X2) ),
    inference(cnf_transformation,[],[f15]) ).

fof(f15,plain,
    ! [X0,X1,X2] :
      ( ( member(X0,X2)
        | member(X0,X1)
        | ~ member(X0,union(X2,X1)) )
      & ( member(X0,union(X2,X1))
        | ( ~ member(X0,X2)
          & ~ member(X0,X1) ) ) ),
    inference(flattening,[],[f14]) ).

fof(f14,plain,
    ! [X0,X1,X2] :
      ( ( member(X0,X2)
        | member(X0,X1)
        | ~ member(X0,union(X2,X1)) )
      & ( member(X0,union(X2,X1))
        | ( ~ member(X0,X2)
          & ~ member(X0,X1) ) ) ),
    inference(nnf_transformation,[],[f10]) ).

fof(f10,plain,
    ! [X0,X1,X2] :
      ( ( member(X0,X2)
        | member(X0,X1) )
    <=> member(X0,union(X2,X1)) ),
    inference(rectify,[],[f1]) ).

fof(f1,axiom,
    ! [X2,X1,X0] :
      ( ( member(X2,X1)
        | member(X2,X0) )
    <=> member(X2,union(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).

fof(f49,plain,
    ~ member(sK0(union(sK2,sK1),union(sK3,sK1)),union(sK3,sK1)),
    inference(resolution,[],[f34,f31]) ).

fof(f31,plain,
    ! [X0,X1] :
      ( ~ member(sK0(X0,X1),X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f19]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( member(sK0(X0,X1),X0)
          & ~ member(sK0(X0,X1),X1) ) )
      & ( ! [X3] :
            ( ~ member(X3,X0)
            | member(X3,X1) )
        | ~ subset(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f17,f18]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( member(X2,X0)
          & ~ member(X2,X1) )
     => ( member(sK0(X0,X1),X0)
        & ~ member(sK0(X0,X1),X1) ) ),
    introduced(choice_axiom,[]) ).

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

fof(f16,plain,
    ! [X1,X0] :
      ( ( subset(X1,X0)
        | ? [X2] :
            ( member(X2,X1)
            & ~ member(X2,X0) ) )
      & ( ! [X2] :
            ( ~ member(X2,X1)
            | member(X2,X0) )
        | ~ subset(X1,X0) ) ),
    inference(nnf_transformation,[],[f13]) ).

fof(f13,plain,
    ! [X1,X0] :
      ( subset(X1,X0)
    <=> ! [X2] :
          ( ~ member(X2,X1)
          | member(X2,X0) ) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f11,plain,
    ! [X1,X0] :
      ( ! [X2] :
          ( member(X2,X1)
         => member(X2,X0) )
    <=> subset(X1,X0) ),
    inference(rectify,[],[f2]) ).

fof(f2,axiom,
    ! [X1,X0] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( member(X2,X0)
         => member(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).

fof(f34,plain,
    ~ subset(union(sK2,sK1),union(sK3,sK1)),
    inference(cnf_transformation,[],[f22]) ).

fof(f22,plain,
    ( ~ subset(union(sK2,sK1),union(sK3,sK1))
    & subset(sK2,sK3) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f20,f21]) ).

fof(f21,plain,
    ( ? [X0,X1,X2] :
        ( ~ subset(union(X1,X0),union(X2,X0))
        & subset(X1,X2) )
   => ( ~ subset(union(sK2,sK1),union(sK3,sK1))
      & subset(sK2,sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f20,plain,
    ? [X0,X1,X2] :
      ( ~ subset(union(X1,X0),union(X2,X0))
      & subset(X1,X2) ),
    inference(rectify,[],[f12]) ).

fof(f12,plain,
    ? [X1,X2,X0] :
      ( ~ subset(union(X2,X1),union(X0,X1))
      & subset(X2,X0) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f9,plain,
    ~ ! [X0,X1,X2] :
        ( subset(X2,X0)
       => subset(union(X2,X1),union(X0,X1)) ),
    inference(rectify,[],[f7]) ).

fof(f7,negated_conjecture,
    ~ ! [X1,X2,X0] :
        ( subset(X0,X1)
       => subset(union(X0,X2),union(X1,X2)) ),
    inference(negated_conjecture,[],[f6]) ).

fof(f6,conjecture,
    ! [X1,X2,X0] :
      ( subset(X0,X1)
     => subset(union(X0,X2),union(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th33) ).

fof(f73,plain,
    member(sK0(union(sK2,sK1),union(sK3,sK1)),sK3),
    inference(resolution,[],[f66,f48]) ).

fof(f48,plain,
    ! [X0] :
      ( ~ member(X0,sK2)
      | member(X0,sK3) ),
    inference(resolution,[],[f33,f30]) ).

fof(f30,plain,
    ! [X3,X0,X1] :
      ( ~ member(X3,X0)
      | ~ subset(X0,X1)
      | member(X3,X1) ),
    inference(cnf_transformation,[],[f19]) ).

fof(f33,plain,
    subset(sK2,sK3),
    inference(cnf_transformation,[],[f22]) ).

fof(f66,plain,
    member(sK0(union(sK2,sK1),union(sK3,sK1)),sK2),
    inference(subsumption_resolution,[],[f62,f57]) ).

fof(f57,plain,
    ~ member(sK0(union(sK2,sK1),union(sK3,sK1)),sK1),
    inference(resolution,[],[f49,f27]) ).

fof(f27,plain,
    ! [X2,X0,X1] :
      ( ~ member(X0,X1)
      | member(X0,union(X2,X1)) ),
    inference(cnf_transformation,[],[f15]) ).

fof(f62,plain,
    ( member(sK0(union(sK2,sK1),union(sK3,sK1)),sK1)
    | member(sK0(union(sK2,sK1),union(sK3,sK1)),sK2) ),
    inference(resolution,[],[f50,f29]) ).

fof(f29,plain,
    ! [X2,X0,X1] :
      ( ~ member(X0,union(X2,X1))
      | member(X0,X2)
      | member(X0,X1) ),
    inference(cnf_transformation,[],[f15]) ).

fof(f50,plain,
    member(sK0(union(sK2,sK1),union(sK3,sK1)),union(sK2,sK1)),
    inference(resolution,[],[f34,f32]) ).

fof(f32,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | member(sK0(X0,X1),X0) ),
    inference(cnf_transformation,[],[f19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SET584+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/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.33  % Computer : n001.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 30 14:23:46 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.19/0.49  % (24995)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  % (24995)Refutation not found, incomplete strategy% (24995)------------------------------
% 0.19/0.49  % (24995)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49  % (24995)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49  % (24995)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.49  
% 0.19/0.49  % (24995)Memory used [KB]: 5884
% 0.19/0.49  % (24995)Time elapsed: 0.118 s
% 0.19/0.49  % (24995)Instructions burned: 2 (million)
% 0.19/0.49  % (24995)------------------------------
% 0.19/0.49  % (24995)------------------------------
% 0.19/0.50  % (25003)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.19/0.50  % (24999)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.51  % (25011)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.52  % (25003)First to succeed.
% 0.19/0.52  % (25003)Refutation found. Thanks to Tanya!
% 0.19/0.52  % SZS status Theorem for theBenchmark
% 0.19/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52  % (25003)------------------------------
% 0.19/0.52  % (25003)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (25003)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (25003)Termination reason: Refutation
% 0.19/0.52  
% 0.19/0.52  % (25003)Memory used [KB]: 5884
% 0.19/0.52  % (25003)Time elapsed: 0.131 s
% 0.19/0.52  % (25003)Instructions burned: 2 (million)
% 0.19/0.52  % (25003)------------------------------
% 0.19/0.52  % (25003)------------------------------
% 0.19/0.52  % (24992)Success in time 0.181 s
%------------------------------------------------------------------------------