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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SET689+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 : n001.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:25:21 EDT 2022

% Result   : Theorem 0.19s 0.51s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   37 (   7 unt;   0 def)
%            Number of atoms       :  111 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  113 (  39   ~;  28   |;  34   &)
%                                         (   4 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   67 (  52   !;  15   ?)

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

fof(f111,plain,
    ~ subset(sK3,sK5),
    inference(subsumption_resolution,[],[f110,f92]) ).

fof(f92,plain,
    subset(sK5,sK3),
    inference(cnf_transformation,[],[f61]) ).

fof(f61,plain,
    ( subset(sK5,sK3)
    & subset(sK3,sK4)
    & subset(sK4,sK5)
    & ~ equal_set(sK3,sK5) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f59,f60]) ).

fof(f60,plain,
    ( ? [X0,X1,X2] :
        ( subset(X2,X0)
        & subset(X0,X1)
        & subset(X1,X2)
        & ~ equal_set(X0,X2) )
   => ( subset(sK5,sK3)
      & subset(sK3,sK4)
      & subset(sK4,sK5)
      & ~ equal_set(sK3,sK5) ) ),
    introduced(choice_axiom,[]) ).

fof(f59,plain,
    ? [X0,X1,X2] :
      ( subset(X2,X0)
      & subset(X0,X1)
      & subset(X1,X2)
      & ~ equal_set(X0,X2) ),
    inference(rectify,[],[f27]) ).

fof(f27,plain,
    ? [X2,X1,X0] :
      ( subset(X0,X2)
      & subset(X2,X1)
      & subset(X1,X0)
      & ~ equal_set(X2,X0) ),
    inference(flattening,[],[f26]) ).

fof(f26,plain,
    ? [X1,X2,X0] :
      ( ~ equal_set(X2,X0)
      & subset(X0,X2)
      & subset(X2,X1)
      & subset(X1,X0) ),
    inference(ennf_transformation,[],[f14]) ).

fof(f14,plain,
    ~ ! [X1,X2,X0] :
        ( ( subset(X0,X2)
          & subset(X2,X1)
          & subset(X1,X0) )
       => equal_set(X2,X0) ),
    inference(rectify,[],[f13]) ).

fof(f13,negated_conjecture,
    ~ ! [X5,X1,X0] :
        ( ( subset(X5,X0)
          & subset(X0,X1)
          & subset(X1,X5) )
       => equal_set(X0,X5) ),
    inference(negated_conjecture,[],[f12]) ).

fof(f12,conjecture,
    ! [X5,X1,X0] :
      ( ( subset(X5,X0)
        & subset(X0,X1)
        & subset(X1,X5) )
     => equal_set(X0,X5) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI05) ).

fof(f110,plain,
    ( ~ subset(sK3,sK5)
    | ~ subset(sK5,sK3) ),
    inference(resolution,[],[f62,f89]) ).

fof(f89,plain,
    ~ equal_set(sK3,sK5),
    inference(cnf_transformation,[],[f61]) ).

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

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

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

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

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

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

fof(f168,plain,
    subset(sK3,sK5),
    inference(duplicate_literal_removal,[],[f167]) ).

fof(f167,plain,
    ( subset(sK3,sK5)
    | subset(sK3,sK5) ),
    inference(resolution,[],[f126,f67]) ).

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

fof(f39,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ member(sK0(X0,X1),X1)
          & member(sK0(X0,X1),X0) ) )
      & ( ! [X3] :
            ( member(X3,X1)
            | ~ member(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f37,f38]) ).

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

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

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

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

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

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

fof(f126,plain,
    ! [X0] :
      ( ~ member(sK0(X0,sK5),sK3)
      | subset(X0,sK5) ),
    inference(resolution,[],[f118,f114]) ).

fof(f114,plain,
    ! [X4] :
      ( member(X4,sK4)
      | ~ member(X4,sK3) ),
    inference(resolution,[],[f66,f91]) ).

fof(f91,plain,
    subset(sK3,sK4),
    inference(cnf_transformation,[],[f61]) ).

fof(f66,plain,
    ! [X3,X0,X1] :
      ( ~ subset(X0,X1)
      | ~ member(X3,X0)
      | member(X3,X1) ),
    inference(cnf_transformation,[],[f39]) ).

fof(f118,plain,
    ! [X0] :
      ( ~ member(sK0(X0,sK5),sK4)
      | subset(X0,sK5) ),
    inference(resolution,[],[f115,f68]) ).

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

fof(f115,plain,
    ! [X5] :
      ( member(X5,sK5)
      | ~ member(X5,sK4) ),
    inference(resolution,[],[f66,f90]) ).

fof(f90,plain,
    subset(sK4,sK5),
    inference(cnf_transformation,[],[f61]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SET689+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.13/0.34  % Computer : n001.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 14:35:31 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.49  % (31578)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.19/0.50  % (31601)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.19/0.50  TRYING [1]
% 0.19/0.50  % (31593)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.19/0.50  % (31593)First to succeed.
% 0.19/0.50  TRYING [2]
% 0.19/0.50  TRYING [3]
% 0.19/0.51  % (31589)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.51  % (31587)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.51  % (31590)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.51  TRYING [4]
% 0.19/0.51  % (31593)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  % (31593)------------------------------
% 0.19/0.51  % (31593)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (31593)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (31593)Termination reason: Refutation
% 0.19/0.51  
% 0.19/0.51  % (31593)Memory used [KB]: 1023
% 0.19/0.51  % (31593)Time elapsed: 0.114 s
% 0.19/0.51  % (31593)Instructions burned: 4 (million)
% 0.19/0.51  % (31593)------------------------------
% 0.19/0.51  % (31593)------------------------------
% 0.19/0.51  % (31577)Success in time 0.162 s
%------------------------------------------------------------------------------