TSTP Solution File: SET589+3 by SnakeForV-SAT---1.0

View Problem - Process Solution

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

% Computer : n009.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:00 EDT 2022

% Result   : Theorem 0.20s 0.50s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   30 (   5 unt;   0 def)
%            Number of atoms       :   73 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   73 (  30   ~;  19   |;  16   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   78 (  62   !;  16   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f175,plain,
    $false,
    inference(subsumption_resolution,[],[f174,f37]) ).

fof(f37,plain,
    subset(sK1,sK3),
    inference(cnf_transformation,[],[f26]) ).

fof(f26,plain,
    ( subset(sK1,sK3)
    & subset(sK2,sK4)
    & ~ subset(difference(sK2,sK3),difference(sK4,sK1)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f24,f25]) ).

fof(f25,plain,
    ( ? [X0,X1,X2,X3] :
        ( subset(X0,X2)
        & subset(X1,X3)
        & ~ subset(difference(X1,X2),difference(X3,X0)) )
   => ( subset(sK1,sK3)
      & subset(sK2,sK4)
      & ~ subset(difference(sK2,sK3),difference(sK4,sK1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f24,plain,
    ? [X0,X1,X2,X3] :
      ( subset(X0,X2)
      & subset(X1,X3)
      & ~ subset(difference(X1,X2),difference(X3,X0)) ),
    inference(rectify,[],[f14]) ).

fof(f14,plain,
    ? [X1,X2,X0,X3] :
      ( subset(X1,X0)
      & subset(X2,X3)
      & ~ subset(difference(X2,X0),difference(X3,X1)) ),
    inference(flattening,[],[f13]) ).

fof(f13,plain,
    ? [X1,X0,X3,X2] :
      ( ~ subset(difference(X2,X0),difference(X3,X1))
      & subset(X1,X0)
      & subset(X2,X3) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f9,plain,
    ~ ! [X1,X0,X3,X2] :
        ( ( subset(X1,X0)
          & subset(X2,X3) )
       => subset(difference(X2,X0),difference(X3,X1)) ),
    inference(rectify,[],[f8]) ).

fof(f8,negated_conjecture,
    ~ ! [X3,X2,X0,X1] :
        ( ( subset(X0,X1)
          & subset(X2,X3) )
       => subset(difference(X0,X3),difference(X1,X2)) ),
    inference(negated_conjecture,[],[f7]) ).

fof(f7,conjecture,
    ! [X3,X2,X0,X1] :
      ( ( subset(X0,X1)
        & subset(X2,X3) )
     => subset(difference(X0,X3),difference(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th48) ).

fof(f174,plain,
    ~ subset(sK1,sK3),
    inference(subsumption_resolution,[],[f166,f36]) ).

fof(f36,plain,
    subset(sK2,sK4),
    inference(cnf_transformation,[],[f26]) ).

fof(f166,plain,
    ( ~ subset(sK2,sK4)
    | ~ subset(sK1,sK3) ),
    inference(resolution,[],[f82,f35]) ).

fof(f35,plain,
    ~ subset(difference(sK2,sK3),difference(sK4,sK1)),
    inference(cnf_transformation,[],[f26]) ).

fof(f82,plain,
    ! [X10,X8,X9,X7] :
      ( subset(difference(X7,X8),difference(X9,X10))
      | ~ subset(X7,X9)
      | ~ subset(X10,X8) ),
    inference(resolution,[],[f53,f42]) ).

fof(f42,plain,
    ! [X2,X0,X1] :
      ( subset(difference(X0,X2),difference(X0,X1))
      | ~ subset(X1,X2) ),
    inference(cnf_transformation,[],[f29]) ).

fof(f29,plain,
    ! [X0,X1,X2] :
      ( subset(difference(X0,X2),difference(X0,X1))
      | ~ subset(X1,X2) ),
    inference(rectify,[],[f12]) ).

fof(f12,plain,
    ! [X1,X0,X2] :
      ( subset(difference(X1,X2),difference(X1,X0))
      | ~ subset(X0,X2) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f11,plain,
    ! [X0,X1,X2] :
      ( subset(X0,X2)
     => subset(difference(X1,X2),difference(X1,X0)) ),
    inference(rectify,[],[f3]) ).

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

fof(f53,plain,
    ! [X2,X3,X0,X1] :
      ( ~ subset(X2,difference(X0,X3))
      | subset(X2,difference(X1,X3))
      | ~ subset(X0,X1) ),
    inference(resolution,[],[f34,f43]) ).

fof(f43,plain,
    ! [X2,X0,X1] :
      ( ~ subset(X2,X0)
      | ~ subset(X1,X2)
      | subset(X1,X0) ),
    inference(cnf_transformation,[],[f30]) ).

fof(f30,plain,
    ! [X0,X1,X2] :
      ( ~ subset(X2,X0)
      | subset(X1,X0)
      | ~ subset(X1,X2) ),
    inference(rectify,[],[f18]) ).

fof(f18,plain,
    ! [X2,X0,X1] :
      ( ~ subset(X1,X2)
      | subset(X0,X2)
      | ~ subset(X0,X1) ),
    inference(flattening,[],[f17]) ).

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

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

fof(f34,plain,
    ! [X2,X0,X1] :
      ( subset(difference(X2,X0),difference(X1,X0))
      | ~ subset(X2,X1) ),
    inference(cnf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X0,X1,X2] :
      ( subset(difference(X2,X0),difference(X1,X0))
      | ~ subset(X2,X1) ),
    inference(rectify,[],[f15]) ).

fof(f15,plain,
    ! [X2,X1,X0] :
      ( subset(difference(X0,X2),difference(X1,X2))
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SET589+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_sat --cores 0 -t %d %s
% 0.13/0.34  % Computer : n009.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:00:35 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.48  % (25953)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.20/0.49  % (25945)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.49  % (25945)First to succeed.
% 0.20/0.50  % (25945)Refutation found. Thanks to Tanya!
% 0.20/0.50  % SZS status Theorem for theBenchmark
% 0.20/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50  % (25945)------------------------------
% 0.20/0.50  % (25945)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (25945)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (25945)Termination reason: Refutation
% 0.20/0.50  
% 0.20/0.50  % (25945)Memory used [KB]: 5500
% 0.20/0.50  % (25945)Time elapsed: 0.091 s
% 0.20/0.50  % (25945)Instructions burned: 8 (million)
% 0.20/0.50  % (25945)------------------------------
% 0.20/0.50  % (25945)------------------------------
% 0.20/0.50  % (25923)Success in time 0.151 s
%------------------------------------------------------------------------------