TSTP Solution File: SET063+4 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SET063+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_sat --cores 0 -t %d %s

% Computer : n018.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:23:27 EDT 2022

% Result   : Theorem 0.21s 0.51s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   38 (  15 unt;   0 def)
%            Number of atoms       :   98 (   1 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  103 (  43   ~;  31   |;  18   &)
%                                         (   6 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   67 (  62   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f120,plain,
    $false,
    inference(subsumption_resolution,[],[f117,f91]) ).

fof(f91,plain,
    ~ equal_set(sF4,empty_set),
    inference(definition_folding,[],[f80,f90]) ).

fof(f90,plain,
    sF4 = intersection(sK2,empty_set),
    introduced(function_definition,[]) ).

fof(f80,plain,
    ~ equal_set(intersection(sK2,empty_set),empty_set),
    inference(cnf_transformation,[],[f51]) ).

fof(f51,plain,
    ~ equal_set(intersection(sK2,empty_set),empty_set),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f27,f50]) ).

fof(f50,plain,
    ( ? [X0] : ~ equal_set(intersection(X0,empty_set),empty_set)
   => ~ equal_set(intersection(sK2,empty_set),empty_set) ),
    introduced(choice_axiom,[]) ).

fof(f27,plain,
    ? [X0] : ~ equal_set(intersection(X0,empty_set),empty_set),
    inference(ennf_transformation,[],[f13]) ).

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

fof(f12,conjecture,
    ! [X0] : equal_set(intersection(X0,empty_set),empty_set),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI17) ).

fof(f117,plain,
    equal_set(sF4,empty_set),
    inference(resolution,[],[f112,f100]) ).

fof(f100,plain,
    ! [X8] : subset(empty_set,X8),
    inference(resolution,[],[f71,f79]) ).

fof(f79,plain,
    ! [X0] : ~ member(X0,empty_set),
    inference(cnf_transformation,[],[f17]) ).

fof(f17,plain,
    ! [X0] : ~ member(X0,empty_set),
    inference(rectify,[],[f6]) ).

fof(f6,axiom,
    ! [X2] : ~ member(X2,empty_set),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set) ).

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

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

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

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

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

fof(f25,plain,
    ! [X1,X0] :
      ( ! [X2] :
          ( member(X2,X0)
          | ~ member(X2,X1) )
    <=> subset(X1,X0) ),
    inference(ennf_transformation,[],[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(f112,plain,
    ! [X2] :
      ( ~ subset(X2,sF4)
      | equal_set(sF4,X2) ),
    inference(resolution,[],[f67,f104]) ).

fof(f104,plain,
    ! [X17] : subset(sF4,X17),
    inference(resolution,[],[f71,f95]) ).

fof(f95,plain,
    ! [X0] : ~ member(X0,sF4),
    inference(subsumption_resolution,[],[f94,f79]) ).

fof(f94,plain,
    ! [X0] :
      ( ~ member(X0,sF4)
      | member(X0,empty_set) ),
    inference(superposition,[],[f65,f90]) ).

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

fof(f35,plain,
    ! [X0,X1,X2] :
      ( ( ( member(X2,X1)
          & member(X2,X0) )
        | ~ member(X2,intersection(X1,X0)) )
      & ( member(X2,intersection(X1,X0))
        | ~ member(X2,X1)
        | ~ member(X2,X0) ) ),
    inference(rectify,[],[f34]) ).

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

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

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

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

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

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

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

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

fof(f24,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) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SET063+4 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.34  % Computer : n018.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:09:55 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.21/0.50  % (8711)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.21/0.50  % (8724)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.21/0.51  % (8732)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.21/0.51  % (8722)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.51  % (8713)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.51  % (8722)First to succeed.
% 0.21/0.51  % (8722)Refutation found. Thanks to Tanya!
% 0.21/0.51  % SZS status Theorem for theBenchmark
% 0.21/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51  % (8722)------------------------------
% 0.21/0.51  % (8722)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51  % (8722)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51  % (8722)Termination reason: Refutation
% 0.21/0.51  
% 0.21/0.51  % (8722)Memory used [KB]: 5500
% 0.21/0.51  % (8722)Time elapsed: 0.112 s
% 0.21/0.51  % (8722)Instructions burned: 3 (million)
% 0.21/0.51  % (8722)------------------------------
% 0.21/0.51  % (8722)------------------------------
% 0.21/0.51  % (8708)Success in time 0.16 s
%------------------------------------------------------------------------------