TSTP Solution File: SEU129+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SEU129+1 : TPTP v8.1.0. Released v3.3.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 : n002.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:32:02 EDT 2022

% Result   : Theorem 1.51s 0.54s
% Output   : Refutation 1.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   49 (  12 unt;   0 def)
%            Number of atoms       :  173 (  19 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  196 (  72   ~;  72   |;  39   &)
%                                         (   6 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-3 aty)
%            Number of variables   :  105 (  89   !;  16   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f323,plain,
    $false,
    inference(subsumption_resolution,[],[f322,f74]) ).

fof(f74,plain,
    ~ subset(sF7,sF8),
    inference(definition_folding,[],[f65,f73,f72]) ).

fof(f72,plain,
    set_intersection2(sK5,sK4) = sF7,
    introduced(function_definition,[]) ).

fof(f73,plain,
    sF8 = set_intersection2(sK6,sK4),
    introduced(function_definition,[]) ).

fof(f65,plain,
    ~ subset(set_intersection2(sK5,sK4),set_intersection2(sK6,sK4)),
    inference(cnf_transformation,[],[f46]) ).

fof(f46,plain,
    ( subset(sK5,sK6)
    & ~ subset(set_intersection2(sK5,sK4),set_intersection2(sK6,sK4)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f44,f45]) ).

fof(f45,plain,
    ( ? [X0,X1,X2] :
        ( subset(X1,X2)
        & ~ subset(set_intersection2(X1,X0),set_intersection2(X2,X0)) )
   => ( subset(sK5,sK6)
      & ~ subset(set_intersection2(sK5,sK4),set_intersection2(sK6,sK4)) ) ),
    introduced(choice_axiom,[]) ).

fof(f44,plain,
    ? [X0,X1,X2] :
      ( subset(X1,X2)
      & ~ subset(set_intersection2(X1,X0),set_intersection2(X2,X0)) ),
    inference(rectify,[],[f26]) ).

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

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

fof(f13,negated_conjecture,
    ~ ! [X1,X0,X2] :
        ( subset(X0,X1)
       => subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
    inference(negated_conjecture,[],[f12]) ).

fof(f12,conjecture,
    ! [X1,X0,X2] :
      ( subset(X0,X1)
     => subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_xboole_1) ).

fof(f322,plain,
    subset(sF7,sF8),
    inference(duplicate_literal_removal,[],[f317]) ).

fof(f317,plain,
    ( subset(sF7,sF8)
    | subset(sF7,sF8) ),
    inference(resolution,[],[f316,f48]) ).

fof(f48,plain,
    ! [X0,X1] :
      ( ~ in(sK0(X0,X1),X0)
      | subset(X1,X0) ),
    inference(cnf_transformation,[],[f33]) ).

fof(f33,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( ~ in(X2,X1)
            | in(X2,X0) )
        | ~ subset(X1,X0) )
      & ( subset(X1,X0)
        | ( in(sK0(X0,X1),X1)
          & ~ in(sK0(X0,X1),X0) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f31,f32]) ).

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

fof(f31,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( ~ in(X2,X1)
            | in(X2,X0) )
        | ~ subset(X1,X0) )
      & ( subset(X1,X0)
        | ? [X3] :
            ( in(X3,X1)
            & ~ in(X3,X0) ) ) ),
    inference(rectify,[],[f30]) ).

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

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

fof(f3,axiom,
    ! [X0,X1] :
      ( ! [X2] :
          ( in(X2,X0)
         => in(X2,X1) )
    <=> subset(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).

fof(f316,plain,
    ! [X2] :
      ( in(sK0(X2,sF7),sF8)
      | subset(sF7,X2) ),
    inference(subsumption_resolution,[],[f309,f125]) ).

fof(f125,plain,
    ! [X0] :
      ( in(sK0(X0,sF7),sK4)
      | subset(sF7,X0) ),
    inference(resolution,[],[f108,f49]) ).

fof(f49,plain,
    ! [X0,X1] :
      ( in(sK0(X0,X1),X1)
      | subset(X1,X0) ),
    inference(cnf_transformation,[],[f33]) ).

fof(f108,plain,
    ! [X12] :
      ( ~ in(X12,sF7)
      | in(X12,sK4) ),
    inference(superposition,[],[f69,f82]) ).

fof(f82,plain,
    sF7 = set_intersection2(sK4,sK5),
    inference(superposition,[],[f64,f72]) ).

fof(f64,plain,
    ! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    inference(cnf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    inference(rectify,[],[f2]) ).

fof(f2,axiom,
    ! [X1,X0] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).

fof(f69,plain,
    ! [X2,X3,X0] :
      ( ~ in(X3,set_intersection2(X2,X0))
      | in(X3,X2) ),
    inference(equality_resolution,[],[f59]) ).

fof(f59,plain,
    ! [X2,X3,X0,X1] :
      ( in(X3,X2)
      | ~ in(X3,X1)
      | set_intersection2(X2,X0) != X1 ),
    inference(cnf_transformation,[],[f40]) ).

fof(f40,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3] :
            ( ( ( in(X3,X2)
                & in(X3,X0) )
              | ~ in(X3,X1) )
            & ( in(X3,X1)
              | ~ in(X3,X2)
              | ~ in(X3,X0) ) )
        | set_intersection2(X2,X0) != X1 )
      & ( set_intersection2(X2,X0) = X1
        | ( ( ~ in(sK2(X0,X1,X2),X1)
            | ~ in(sK2(X0,X1,X2),X2)
            | ~ in(sK2(X0,X1,X2),X0) )
          & ( in(sK2(X0,X1,X2),X1)
            | ( in(sK2(X0,X1,X2),X2)
              & in(sK2(X0,X1,X2),X0) ) ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f38,f39]) ).

fof(f39,plain,
    ! [X0,X1,X2] :
      ( ? [X4] :
          ( ( ~ in(X4,X1)
            | ~ in(X4,X2)
            | ~ in(X4,X0) )
          & ( in(X4,X1)
            | ( in(X4,X2)
              & in(X4,X0) ) ) )
     => ( ( ~ in(sK2(X0,X1,X2),X1)
          | ~ in(sK2(X0,X1,X2),X2)
          | ~ in(sK2(X0,X1,X2),X0) )
        & ( in(sK2(X0,X1,X2),X1)
          | ( in(sK2(X0,X1,X2),X2)
            & in(sK2(X0,X1,X2),X0) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f38,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3] :
            ( ( ( in(X3,X2)
                & in(X3,X0) )
              | ~ in(X3,X1) )
            & ( in(X3,X1)
              | ~ in(X3,X2)
              | ~ in(X3,X0) ) )
        | set_intersection2(X2,X0) != X1 )
      & ( set_intersection2(X2,X0) = X1
        | ? [X4] :
            ( ( ~ in(X4,X1)
              | ~ in(X4,X2)
              | ~ in(X4,X0) )
            & ( in(X4,X1)
              | ( in(X4,X2)
                & in(X4,X0) ) ) ) ) ),
    inference(rectify,[],[f37]) ).

fof(f37,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3] :
            ( ( ( in(X3,X2)
                & in(X3,X0) )
              | ~ in(X3,X1) )
            & ( in(X3,X1)
              | ~ in(X3,X2)
              | ~ in(X3,X0) ) )
        | set_intersection2(X2,X0) != X1 )
      & ( set_intersection2(X2,X0) = X1
        | ? [X3] :
            ( ( ~ in(X3,X1)
              | ~ in(X3,X2)
              | ~ in(X3,X0) )
            & ( in(X3,X1)
              | ( in(X3,X2)
                & in(X3,X0) ) ) ) ) ),
    inference(flattening,[],[f36]) ).

fof(f36,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3] :
            ( ( ( in(X3,X2)
                & in(X3,X0) )
              | ~ in(X3,X1) )
            & ( in(X3,X1)
              | ~ in(X3,X2)
              | ~ in(X3,X0) ) )
        | set_intersection2(X2,X0) != X1 )
      & ( set_intersection2(X2,X0) = X1
        | ? [X3] :
            ( ( ~ in(X3,X1)
              | ~ in(X3,X2)
              | ~ in(X3,X0) )
            & ( in(X3,X1)
              | ( in(X3,X2)
                & in(X3,X0) ) ) ) ) ),
    inference(nnf_transformation,[],[f20]) ).

fof(f20,plain,
    ! [X0,X1,X2] :
      ( ! [X3] :
          ( ( in(X3,X2)
            & in(X3,X0) )
        <=> in(X3,X1) )
    <=> set_intersection2(X2,X0) = X1 ),
    inference(rectify,[],[f4]) ).

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

fof(f309,plain,
    ! [X2] :
      ( subset(sF7,X2)
      | in(sK0(X2,sF7),sF8)
      | ~ in(sK0(X2,sF7),sK4) ),
    inference(resolution,[],[f156,f173]) ).

fof(f173,plain,
    ! [X0] :
      ( in(sK0(X0,sF7),sK6)
      | subset(sF7,X0) ),
    inference(resolution,[],[f123,f139]) ).

fof(f139,plain,
    ! [X0] :
      ( ~ in(X0,sK5)
      | in(X0,sK6) ),
    inference(resolution,[],[f50,f66]) ).

fof(f66,plain,
    subset(sK5,sK6),
    inference(cnf_transformation,[],[f46]) ).

fof(f50,plain,
    ! [X2,X0,X1] :
      ( ~ subset(X1,X0)
      | in(X2,X0)
      | ~ in(X2,X1) ),
    inference(cnf_transformation,[],[f33]) ).

fof(f123,plain,
    ! [X0] :
      ( in(sK0(X0,sF7),sK5)
      | subset(sF7,X0) ),
    inference(resolution,[],[f110,f49]) ).

fof(f110,plain,
    ! [X14] :
      ( ~ in(X14,sF7)
      | in(X14,sK5) ),
    inference(superposition,[],[f69,f72]) ).

fof(f156,plain,
    ! [X13] :
      ( ~ in(X13,sK6)
      | in(X13,sF8)
      | ~ in(X13,sK4) ),
    inference(superposition,[],[f71,f86]) ).

fof(f86,plain,
    sF8 = set_intersection2(sK4,sK6),
    inference(superposition,[],[f64,f73]) ).

fof(f71,plain,
    ! [X2,X3,X0] :
      ( in(X3,set_intersection2(X2,X0))
      | ~ in(X3,X2)
      | ~ in(X3,X0) ),
    inference(equality_resolution,[],[f57]) ).

fof(f57,plain,
    ! [X2,X3,X0,X1] :
      ( in(X3,X1)
      | ~ in(X3,X2)
      | ~ in(X3,X0)
      | set_intersection2(X2,X0) != X1 ),
    inference(cnf_transformation,[],[f40]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SEU129+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/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.14/0.34  % Computer : n002.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:53:29 EDT 2022
% 0.14/0.34  % CPUTime    : 
% 0.20/0.50  % (13416)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.50  % (13397)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.50  % (13403)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.20/0.51  % (13405)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.51  % (13408)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.51  % (13400)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.20/0.51  % (13392)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.52  % (13413)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.52  % (13420)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.52  % (13394)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52  % (13416)First to succeed.
% 0.20/0.52  % (13406)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.20/0.52  TRYING [1]
% 0.20/0.52  TRYING [2]
% 0.20/0.52  TRYING [3]
% 0.20/0.52  % (13412)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.52  % (13395)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52  % (13414)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.20/0.53  % (13393)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.20/0.53  TRYING [4]
% 0.20/0.53  % (13392)Refutation not found, incomplete strategy% (13392)------------------------------
% 0.20/0.53  % (13392)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (13392)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (13392)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.53  
% 0.20/0.53  % (13392)Memory used [KB]: 5500
% 0.20/0.53  % (13392)Time elapsed: 0.127 s
% 0.20/0.53  % (13392)Instructions burned: 3 (million)
% 0.20/0.53  % (13392)------------------------------
% 0.20/0.53  % (13392)------------------------------
% 0.20/0.53  % (13391)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.20/0.53  % (13401)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.53  % (13402)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.20/0.53  TRYING [1]
% 0.20/0.53  TRYING [2]
% 0.20/0.53  TRYING [3]
% 0.20/0.53  TRYING [1]
% 0.20/0.53  TRYING [2]
% 0.20/0.53  TRYING [3]
% 0.20/0.53  TRYING [4]
% 0.20/0.53  % (13415)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.53  TRYING [4]
% 0.20/0.54  % (13396)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.54  % (13404)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.54  % (13407)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.54  % (13417)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.54  % (13419)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.54  % (13399)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.51/0.54  % (13416)Refutation found. Thanks to Tanya!
% 1.51/0.54  % SZS status Theorem for theBenchmark
% 1.51/0.54  % SZS output start Proof for theBenchmark
% See solution above
% 1.51/0.54  % (13416)------------------------------
% 1.51/0.54  % (13416)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.51/0.54  % (13416)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.51/0.54  % (13416)Termination reason: Refutation
% 1.51/0.54  
% 1.51/0.54  % (13416)Memory used [KB]: 5500
% 1.51/0.54  % (13416)Time elapsed: 0.122 s
% 1.51/0.54  % (13416)Instructions burned: 11 (million)
% 1.51/0.54  % (13416)------------------------------
% 1.51/0.54  % (13416)------------------------------
% 1.51/0.54  % (13390)Success in time 0.192 s
%------------------------------------------------------------------------------