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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SET585+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 : n016.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.20s 0.51s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   36 (  15 unt;   0 def)
%            Number of atoms       :   98 (   3 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  102 (  40   ~;  31   |;  20   &)
%                                         (   7 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   81 (  69   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f130,plain,
    $false,
    inference(subsumption_resolution,[],[f121,f111]) ).

fof(f111,plain,
    ~ member(sK0(intersection(sK1,sK2),union(sK2,sK3)),sK2),
    inference(unit_resulting_resolution,[],[f65,f54]) ).

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

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

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

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

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

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

fof(f65,plain,
    ~ member(sK0(intersection(sK1,sK2),union(sK2,sK3)),union(sK2,sK3)),
    inference(unit_resulting_resolution,[],[f64,f46]) ).

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

fof(f30,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( ~ member(X2,X0)
            | member(X2,X1) )
        | ~ subset(X0,X1) )
      & ( subset(X0,X1)
        | ( member(sK0(X0,X1),X0)
          & ~ member(sK0(X0,X1),X1) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f28,f29]) ).

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

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

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

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

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

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

fof(f64,plain,
    ~ subset(intersection(sK1,sK2),union(sK2,sK3)),
    inference(forward_demodulation,[],[f50,f52]) ).

fof(f52,plain,
    ! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
    inference(cnf_transformation,[],[f20]) ).

fof(f20,plain,
    ! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
    inference(rectify,[],[f8]) ).

fof(f8,axiom,
    ! [X1,X0] : intersection(X0,X1) = intersection(X1,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection) ).

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

fof(f34,plain,
    ~ subset(intersection(sK2,sK1),union(sK2,sK3)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f32,f33]) ).

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

fof(f32,plain,
    ? [X0,X1,X2] : ~ subset(intersection(X1,X0),union(X1,X2)),
    inference(rectify,[],[f23]) ).

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

fof(f12,negated_conjecture,
    ~ ! [X2,X1,X0] : subset(intersection(X0,X1),union(X0,X2)),
    inference(negated_conjecture,[],[f11]) ).

fof(f11,conjecture,
    ! [X2,X1,X0] : subset(intersection(X0,X1),union(X0,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_subset_of_union) ).

fof(f121,plain,
    member(sK0(intersection(sK1,sK2),union(sK2,sK3)),sK2),
    inference(unit_resulting_resolution,[],[f72,f44]) ).

fof(f44,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,intersection(X1,X0))
      | member(X2,X0) ),
    inference(cnf_transformation,[],[f26]) ).

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

fof(f25,plain,
    ! [X0,X1,X2] :
      ( ( ( member(X2,X0)
          & member(X2,X1) )
        | ~ member(X2,intersection(X1,X0)) )
      & ( member(X2,intersection(X1,X0))
        | ~ member(X2,X0)
        | ~ member(X2,X1) ) ),
    inference(nnf_transformation,[],[f19]) ).

fof(f19,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,X0)
        & member(X2,X1) )
    <=> member(X2,intersection(X1,X0)) ),
    inference(rectify,[],[f5]) ).

fof(f5,axiom,
    ! [X1,X0,X2] :
      ( member(X2,intersection(X0,X1))
    <=> ( member(X2,X1)
        & member(X2,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).

fof(f72,plain,
    member(sK0(intersection(sK1,sK2),union(sK2,sK3)),intersection(sK1,sK2)),
    inference(unit_resulting_resolution,[],[f64,f47]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SET585+3 : TPTP v8.1.0. Released v2.2.0.
% 0.10/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.14/0.34  % Computer : n016.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Tue Aug 30 14:25:31 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.20/0.50  % (26117)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.20/0.50  % (26124)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.20/0.51  % (26124)First to succeed.
% 0.20/0.51  % (26117)Instruction limit reached!
% 0.20/0.51  % (26117)------------------------------
% 0.20/0.51  % (26117)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (26126)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.20/0.51  % (26124)Refutation found. Thanks to Tanya!
% 0.20/0.51  % SZS status Theorem for theBenchmark
% 0.20/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51  % (26124)------------------------------
% 0.20/0.51  % (26124)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (26124)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (26124)Termination reason: Refutation
% 0.20/0.51  
% 0.20/0.51  % (26124)Memory used [KB]: 6012
% 0.20/0.51  % (26124)Time elapsed: 0.106 s
% 0.20/0.51  % (26124)Instructions burned: 4 (million)
% 0.20/0.51  % (26124)------------------------------
% 0.20/0.51  % (26124)------------------------------
% 0.20/0.51  % (26114)Success in time 0.159 s
%------------------------------------------------------------------------------