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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SET015+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 : n029.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:23 EDT 2022

% Result   : Theorem 0.20s 0.59s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   40 (   9 unt;   0 def)
%            Number of atoms       :  102 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   98 (  36   ~;  37   |;  13   &)
%                                         (   5 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   93 (  86   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f206,plain,
    $false,
    inference(resolution,[],[f205,f32]) ).

fof(f32,plain,
    ~ equal_set(union(sK1,sK0),union(sK0,sK1)),
    inference(cnf_transformation,[],[f24]) ).

fof(f24,plain,
    ~ equal_set(union(sK1,sK0),union(sK0,sK1)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f19,f23]) ).

fof(f23,plain,
    ( ? [X0,X1] : ~ equal_set(union(X1,X0),union(X0,X1))
   => ~ equal_set(union(sK1,sK0),union(sK0,sK1)) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

fof(f205,plain,
    ! [X2,X3] : equal_set(union(X3,X2),union(X2,X3)),
    inference(subsumption_resolution,[],[f204,f200]) ).

fof(f200,plain,
    ! [X8,X7] : subset(union(X7,X8),union(X8,X7)),
    inference(duplicate_literal_removal,[],[f190]) ).

fof(f190,plain,
    ! [X8,X7] :
      ( subset(union(X7,X8),union(X8,X7))
      | subset(union(X7,X8),union(X8,X7)) ),
    inference(resolution,[],[f91,f41]) ).

fof(f41,plain,
    ! [X2,X0,X1] :
      ( ~ member(sK2(X0,union(X1,X2)),X2)
      | subset(X0,union(X1,X2)) ),
    inference(resolution,[],[f36,f34]) ).

fof(f34,plain,
    ! [X0,X1] :
      ( ~ member(sK2(X0,X1),X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f27]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | ( ~ member(sK2(X0,X1),X1)
        & member(sK2(X0,X1),X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f25,f26]) ).

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

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

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

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

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

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

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

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

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

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

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

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

fof(f91,plain,
    ! [X2,X3,X4] :
      ( member(sK2(union(X2,X3),union(X3,X4)),X2)
      | subset(union(X2,X3),union(X3,X4)) ),
    inference(duplicate_literal_removal,[],[f79]) ).

fof(f79,plain,
    ! [X2,X3,X4] :
      ( subset(union(X2,X3),union(X3,X4))
      | member(sK2(union(X2,X3),union(X3,X4)),X2)
      | subset(union(X2,X3),union(X3,X4)) ),
    inference(resolution,[],[f45,f42]) ).

fof(f42,plain,
    ! [X2,X0,X1] :
      ( ~ member(sK2(X0,union(X1,X2)),X1)
      | subset(X0,union(X1,X2)) ),
    inference(resolution,[],[f37,f34]) ).

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

fof(f45,plain,
    ! [X2,X0,X1] :
      ( member(sK2(union(X0,X1),X2),X1)
      | member(sK2(union(X0,X1),X2),X0)
      | subset(union(X0,X1),X2) ),
    inference(resolution,[],[f38,f33]) ).

fof(f33,plain,
    ! [X0,X1] :
      ( member(sK2(X0,X1),X0)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f27]) ).

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

fof(f204,plain,
    ! [X2,X3] :
      ( ~ subset(union(X2,X3),union(X3,X2))
      | equal_set(union(X3,X2),union(X2,X3)) ),
    inference(resolution,[],[f200,f35]) ).

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

fof(f28,plain,
    ! [X0,X1] :
      ( equal_set(X1,X0)
      | ~ subset(X0,X1)
      | ~ subset(X1,X0) ),
    inference(rectify,[],[f21]) ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SET015+4 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35  % Computer : n029.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 30 13:03:27 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.20/0.57  % (17662)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.57  % (17663)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.57  % (17654)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.57  % (17655)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.58  % (17646)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.58  % (17663)Refutation not found, incomplete strategy% (17663)------------------------------
% 0.20/0.58  % (17663)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.58  % (17663)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.58  % (17663)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.58  
% 0.20/0.58  % (17663)Memory used [KB]: 1407
% 0.20/0.58  % (17663)Time elapsed: 0.084 s
% 0.20/0.58  % (17663)Instructions burned: 2 (million)
% 0.20/0.58  % (17663)------------------------------
% 0.20/0.58  % (17663)------------------------------
% 0.20/0.58  % (17646)First to succeed.
% 0.20/0.58  % (17647)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.58  % (17654)Instruction limit reached!
% 0.20/0.58  % (17654)------------------------------
% 0.20/0.58  % (17654)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.59  % (17655)Instruction limit reached!
% 0.20/0.59  % (17655)------------------------------
% 0.20/0.59  % (17655)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.59  % (17655)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.59  % (17655)Termination reason: Unknown
% 0.20/0.59  % (17655)Termination phase: Saturation
% 0.20/0.59  
% 0.20/0.59  % (17655)Memory used [KB]: 6012
% 0.20/0.59  % (17655)Time elapsed: 0.088 s
% 0.20/0.59  % (17655)Instructions burned: 7 (million)
% 0.20/0.59  % (17655)------------------------------
% 0.20/0.59  % (17655)------------------------------
% 0.20/0.59  % (17647)Also succeeded, but the first one will report.
% 0.20/0.59  % (17646)Refutation found. Thanks to Tanya!
% 0.20/0.59  % SZS status Theorem for theBenchmark
% 0.20/0.59  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.59  % (17646)------------------------------
% 0.20/0.59  % (17646)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.59  % (17646)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.59  % (17646)Termination reason: Refutation
% 0.20/0.59  
% 0.20/0.59  % (17646)Memory used [KB]: 6012
% 0.20/0.59  % (17646)Time elapsed: 0.146 s
% 0.20/0.59  % (17646)Instructions burned: 6 (million)
% 0.20/0.59  % (17646)------------------------------
% 0.20/0.59  % (17646)------------------------------
% 0.20/0.59  % (17639)Success in time 0.229 s
%------------------------------------------------------------------------------