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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SET590+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 : 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:21:31 EDT 2022

% Result   : Theorem 0.19s 0.51s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   24 (   8 unt;   0 def)
%            Number of atoms       :   71 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   79 (  32   ~;  22   |;  16   &)
%                                         (   5 <=>;   4  =>;   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    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   53 (  46   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f33,plain,
    $false,
    inference(unit_resulting_resolution,[],[f28,f27,f21]) ).

fof(f21,plain,
    ! [X2,X0,X1] :
      ( ~ member(X1,difference(X2,X0))
      | member(X1,X2) ),
    inference(cnf_transformation,[],[f14]) ).

fof(f14,plain,
    ! [X0,X1,X2] :
      ( ( member(X1,difference(X2,X0))
        | member(X1,X0)
        | ~ member(X1,X2) )
      & ( ( ~ member(X1,X0)
          & member(X1,X2) )
        | ~ member(X1,difference(X2,X0)) ) ),
    inference(rectify,[],[f13]) ).

fof(f13,plain,
    ! [X0,X2,X1] :
      ( ( member(X2,difference(X1,X0))
        | member(X2,X0)
        | ~ member(X2,X1) )
      & ( ( ~ member(X2,X0)
          & member(X2,X1) )
        | ~ member(X2,difference(X1,X0)) ) ),
    inference(flattening,[],[f12]) ).

fof(f12,plain,
    ! [X0,X2,X1] :
      ( ( member(X2,difference(X1,X0))
        | member(X2,X0)
        | ~ member(X2,X1) )
      & ( ( ~ member(X2,X0)
          & member(X2,X1) )
        | ~ member(X2,difference(X1,X0)) ) ),
    inference(nnf_transformation,[],[f7]) ).

fof(f7,plain,
    ! [X0,X2,X1] :
      ( member(X2,difference(X1,X0))
    <=> ( ~ member(X2,X0)
        & member(X2,X1) ) ),
    inference(rectify,[],[f1]) ).

fof(f1,axiom,
    ! [X1,X0,X2] :
      ( member(X2,difference(X0,X1))
    <=> ( member(X2,X0)
        & ~ member(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).

fof(f27,plain,
    member(sK2(sK0,difference(sK0,sK1)),difference(sK0,sK1)),
    inference(unit_resulting_resolution,[],[f20,f25]) ).

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

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

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

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

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

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

fof(f6,plain,
    ! [X1,X0] :
      ( subset(X1,X0)
    <=> ! [X2] :
          ( member(X2,X1)
         => member(X2,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(f20,plain,
    ~ subset(difference(sK0,sK1),sK0),
    inference(cnf_transformation,[],[f11]) ).

fof(f11,plain,
    ~ subset(difference(sK0,sK1),sK0),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f10]) ).

fof(f10,plain,
    ( ? [X0,X1] : ~ subset(difference(X0,X1),X0)
   => ~ subset(difference(sK0,sK1),sK0) ),
    introduced(choice_axiom,[]) ).

fof(f8,plain,
    ? [X0,X1] : ~ subset(difference(X0,X1),X0),
    inference(ennf_transformation,[],[f5]) ).

fof(f5,negated_conjecture,
    ~ ! [X0,X1] : subset(difference(X0,X1),X0),
    inference(negated_conjecture,[],[f4]) ).

fof(f4,conjecture,
    ! [X0,X1] : subset(difference(X0,X1),X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th49) ).

fof(f28,plain,
    ~ member(sK2(sK0,difference(sK0,sK1)),sK0),
    inference(unit_resulting_resolution,[],[f20,f26]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem    : SET590+3 : TPTP v8.1.0. Released v2.2.0.
% 0.08/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.13/0.34  % Computer : n021.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 13:59:41 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.50  % (1254)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.19/0.50  % (1266)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.19/0.50  % (1267)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.50  % (1267)First to succeed.
% 0.19/0.50  % (1274)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.19/0.51  % (1276)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.19/0.51  % (1259)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.51  % (1267)Refutation found. Thanks to Tanya!
% 0.19/0.51  % SZS status Theorem for theBenchmark
% 0.19/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51  % (1267)------------------------------
% 0.19/0.51  % (1267)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (1267)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (1267)Termination reason: Refutation
% 0.19/0.51  
% 0.19/0.51  % (1267)Memory used [KB]: 5884
% 0.19/0.51  % (1267)Time elapsed: 0.107 s
% 0.19/0.51  % (1267)Instructions burned: 1 (million)
% 0.19/0.51  % (1267)------------------------------
% 0.19/0.51  % (1267)------------------------------
% 0.19/0.51  % (1253)Success in time 0.166 s
%------------------------------------------------------------------------------