TSTP Solution File: SET159+4 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SET159+4 : 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 : n021.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:19:35 EDT 2022

% Result   : Theorem 0.20s 0.57s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   54 (   9 unt;   0 def)
%            Number of atoms       :  125 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  119 (  48   ~;  47   |;  12   &)
%                                         (   6 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    6 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   67 (  59   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f204,plain,
    $false,
    inference(avatar_sat_refutation,[],[f45,f140,f203]) ).

fof(f203,plain,
    spl4_2,
    inference(avatar_contradiction_clause,[],[f202]) ).

fof(f202,plain,
    ( $false
    | spl4_2 ),
    inference(subsumption_resolution,[],[f199,f187]) ).

fof(f187,plain,
    ( member(sK0(union(sK1,union(sK2,sK3)),union(union(sK1,sK2),sK3)),union(sK2,sK3))
    | spl4_2 ),
    inference(unit_resulting_resolution,[],[f145,f162,f33]) ).

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

fof(f28,plain,
    ! [X0,X1,X2] :
      ( ( member(X1,union(X0,X2))
        | ( ~ member(X1,X0)
          & ~ member(X1,X2) ) )
      & ( member(X1,X0)
        | member(X1,X2)
        | ~ member(X1,union(X0,X2)) ) ),
    inference(rectify,[],[f27]) ).

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

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

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

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

fof(f162,plain,
    ( ~ member(sK0(union(sK1,union(sK2,sK3)),union(union(sK1,sK2),sK3)),sK1)
    | spl4_2 ),
    inference(unit_resulting_resolution,[],[f152,f35]) ).

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

fof(f152,plain,
    ( ~ member(sK0(union(sK1,union(sK2,sK3)),union(union(sK1,sK2),sK3)),union(sK1,sK2))
    | spl4_2 ),
    inference(resolution,[],[f144,f35]) ).

fof(f144,plain,
    ( ~ member(sK0(union(sK1,union(sK2,sK3)),union(union(sK1,sK2),sK3)),union(union(sK1,sK2),sK3))
    | spl4_2 ),
    inference(unit_resulting_resolution,[],[f44,f29]) ).

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

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

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

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

fof(f17,plain,
    ! [X1,X0] :
      ( ! [X2] :
          ( member(X2,X0)
         => member(X2,X1) )
     => subset(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f1]) ).

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

fof(f44,plain,
    ( ~ subset(union(sK1,union(sK2,sK3)),union(union(sK1,sK2),sK3))
    | spl4_2 ),
    inference(avatar_component_clause,[],[f42]) ).

fof(f42,plain,
    ( spl4_2
  <=> subset(union(sK1,union(sK2,sK3)),union(union(sK1,sK2),sK3)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).

fof(f145,plain,
    ( member(sK0(union(sK1,union(sK2,sK3)),union(union(sK1,sK2),sK3)),union(sK1,union(sK2,sK3)))
    | spl4_2 ),
    inference(unit_resulting_resolution,[],[f44,f30]) ).

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

fof(f199,plain,
    ( ~ member(sK0(union(sK1,union(sK2,sK3)),union(union(sK1,sK2),sK3)),union(sK2,sK3))
    | spl4_2 ),
    inference(unit_resulting_resolution,[],[f153,f163,f33]) ).

fof(f163,plain,
    ( ~ member(sK0(union(sK1,union(sK2,sK3)),union(union(sK1,sK2),sK3)),sK2)
    | spl4_2 ),
    inference(unit_resulting_resolution,[],[f152,f34]) ).

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

fof(f153,plain,
    ( ~ member(sK0(union(sK1,union(sK2,sK3)),union(union(sK1,sK2),sK3)),sK3)
    | spl4_2 ),
    inference(resolution,[],[f144,f34]) ).

fof(f140,plain,
    spl4_1,
    inference(avatar_contradiction_clause,[],[f139]) ).

fof(f139,plain,
    ( $false
    | spl4_1 ),
    inference(subsumption_resolution,[],[f128,f89]) ).

fof(f89,plain,
    ( ~ member(sK0(union(union(sK1,sK2),sK3),union(sK1,union(sK2,sK3))),union(sK1,sK2))
    | spl4_1 ),
    inference(unit_resulting_resolution,[],[f50,f69,f33]) ).

fof(f69,plain,
    ( ~ member(sK0(union(union(sK1,sK2),sK3),union(sK1,union(sK2,sK3))),sK2)
    | spl4_1 ),
    inference(unit_resulting_resolution,[],[f51,f35]) ).

fof(f51,plain,
    ( ~ member(sK0(union(union(sK1,sK2),sK3),union(sK1,union(sK2,sK3))),union(sK2,sK3))
    | spl4_1 ),
    inference(unit_resulting_resolution,[],[f46,f34]) ).

fof(f46,plain,
    ( ~ member(sK0(union(union(sK1,sK2),sK3),union(sK1,union(sK2,sK3))),union(sK1,union(sK2,sK3)))
    | spl4_1 ),
    inference(unit_resulting_resolution,[],[f40,f29]) ).

fof(f40,plain,
    ( ~ subset(union(union(sK1,sK2),sK3),union(sK1,union(sK2,sK3)))
    | spl4_1 ),
    inference(avatar_component_clause,[],[f38]) ).

fof(f38,plain,
    ( spl4_1
  <=> subset(union(union(sK1,sK2),sK3),union(sK1,union(sK2,sK3))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).

fof(f50,plain,
    ( ~ member(sK0(union(union(sK1,sK2),sK3),union(sK1,union(sK2,sK3))),sK1)
    | spl4_1 ),
    inference(unit_resulting_resolution,[],[f46,f35]) ).

fof(f128,plain,
    ( member(sK0(union(union(sK1,sK2),sK3),union(sK1,union(sK2,sK3))),union(sK1,sK2))
    | spl4_1 ),
    inference(unit_resulting_resolution,[],[f47,f70,f33]) ).

fof(f70,plain,
    ( ~ member(sK0(union(union(sK1,sK2),sK3),union(sK1,union(sK2,sK3))),sK3)
    | spl4_1 ),
    inference(unit_resulting_resolution,[],[f51,f34]) ).

fof(f47,plain,
    ( member(sK0(union(union(sK1,sK2),sK3),union(sK1,union(sK2,sK3))),union(union(sK1,sK2),sK3))
    | spl4_1 ),
    inference(unit_resulting_resolution,[],[f40,f30]) ).

fof(f45,plain,
    ( ~ spl4_1
    | ~ spl4_2 ),
    inference(avatar_split_clause,[],[f36,f42,f38]) ).

fof(f36,plain,
    ( ~ subset(union(sK1,union(sK2,sK3)),union(union(sK1,sK2),sK3))
    | ~ subset(union(union(sK1,sK2),sK3),union(sK1,union(sK2,sK3))) ),
    inference(resolution,[],[f32,f31]) ).

fof(f31,plain,
    ! [X0,X1] :
      ( equal_set(X0,X1)
      | ~ subset(X1,X0)
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f20]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( equal_set(X0,X1)
      | ~ subset(X1,X0)
      | ~ subset(X0,X1) ),
    inference(flattening,[],[f19]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( equal_set(X0,X1)
      | ~ subset(X1,X0)
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( ( subset(X1,X0)
        & subset(X0,X1) )
     => equal_set(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f2]) ).

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

fof(f32,plain,
    ~ equal_set(union(union(sK1,sK2),sK3),union(sK1,union(sK2,sK3))),
    inference(cnf_transformation,[],[f25]) ).

fof(f25,plain,
    ~ equal_set(union(union(sK1,sK2),sK3),union(sK1,union(sK2,sK3))),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f21,f24]) ).

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

fof(f21,plain,
    ? [X0,X1,X2] : ~ equal_set(union(union(X0,X1),X2),union(X0,union(X1,X2))),
    inference(ennf_transformation,[],[f14]) ).

fof(f14,plain,
    ~ ! [X2,X0,X1] : equal_set(union(union(X0,X1),X2),union(X0,union(X1,X2))),
    inference(rectify,[],[f13]) ).

fof(f13,negated_conjecture,
    ~ ! [X0,X1,X5] : equal_set(union(union(X0,X1),X5),union(X0,union(X1,X5))),
    inference(negated_conjecture,[],[f12]) ).

fof(f12,conjecture,
    ! [X0,X1,X5] : equal_set(union(union(X0,X1),X5),union(X0,union(X1,X5))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI09) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SET159+4 : TPTP v8.1.0. Released v2.2.0.
% 0.12/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 : n021.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 13:20:26 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.20/0.54  % (7555)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.20/0.55  % (7572)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.55  % (7554)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.20/0.56  % (7563)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.56  % (7562)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.56  % (7564)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.56  % (7556)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.56  % (7555)First to succeed.
% 0.20/0.56  % (7571)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.56  % (7556)Refutation not found, incomplete strategy% (7556)------------------------------
% 0.20/0.56  % (7556)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56  % (7556)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56  % (7556)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.56  
% 0.20/0.56  % (7556)Memory used [KB]: 5884
% 0.20/0.56  % (7556)Time elapsed: 0.141 s
% 0.20/0.56  % (7556)Instructions burned: 2 (million)
% 0.20/0.56  % (7556)------------------------------
% 0.20/0.56  % (7556)------------------------------
% 0.20/0.56  % (7571)Refutation not found, incomplete strategy% (7571)------------------------------
% 0.20/0.56  % (7571)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56  % (7571)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56  % (7571)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.56  
% 0.20/0.56  % (7571)Memory used [KB]: 1407
% 0.20/0.56  % (7571)Time elapsed: 0.146 s
% 0.20/0.56  % (7571)Instructions burned: 1 (million)
% 0.20/0.56  % (7571)------------------------------
% 0.20/0.56  % (7571)------------------------------
% 0.20/0.57  % (7555)Refutation found. Thanks to Tanya!
% 0.20/0.57  % SZS status Theorem for theBenchmark
% 0.20/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.57  % (7555)------------------------------
% 0.20/0.57  % (7555)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.57  % (7555)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57  % (7555)Termination reason: Refutation
% 0.20/0.57  
% 0.20/0.57  % (7555)Memory used [KB]: 6012
% 0.20/0.57  % (7555)Time elapsed: 0.139 s
% 0.20/0.57  % (7555)Instructions burned: 6 (million)
% 0.20/0.57  % (7555)------------------------------
% 0.20/0.57  % (7555)------------------------------
% 0.20/0.57  % (7547)Success in time 0.219 s
%------------------------------------------------------------------------------