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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SET586+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 : n020.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:24:59 EDT 2022

% Result   : Theorem 1.46s 0.54s
% Output   : Refutation 1.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   43 (  11 unt;   0 def)
%            Number of atoms       :  110 (   6 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  109 (  42   ~;  38   |;  20   &)
%                                         (   3 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   78 (  66   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f106,plain,
    $false,
    inference(subsumption_resolution,[],[f105,f45]) ).

fof(f45,plain,
    ~ subset(sF5,sF6),
    inference(definition_folding,[],[f29,f44,f43]) ).

fof(f43,plain,
    intersection(sK2,sK1) = sF5,
    introduced(function_definition,[]) ).

fof(f44,plain,
    intersection(sK0,sK1) = sF6,
    introduced(function_definition,[]) ).

fof(f29,plain,
    ~ subset(intersection(sK2,sK1),intersection(sK0,sK1)),
    inference(cnf_transformation,[],[f15]) ).

fof(f15,plain,
    ( subset(sK2,sK0)
    & ~ subset(intersection(sK2,sK1),intersection(sK0,sK1)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f13,f14]) ).

fof(f14,plain,
    ( ? [X0,X1,X2] :
        ( subset(X2,X0)
        & ~ subset(intersection(X2,X1),intersection(X0,X1)) )
   => ( subset(sK2,sK0)
      & ~ subset(intersection(sK2,sK1),intersection(sK0,sK1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f13,plain,
    ? [X0,X1,X2] :
      ( subset(X2,X0)
      & ~ subset(intersection(X2,X1),intersection(X0,X1)) ),
    inference(rectify,[],[f10]) ).

fof(f10,plain,
    ? [X2,X0,X1] :
      ( subset(X1,X2)
      & ~ subset(intersection(X1,X0),intersection(X2,X0)) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f9,plain,
    ~ ! [X2,X0,X1] :
        ( subset(X1,X2)
       => subset(intersection(X1,X0),intersection(X2,X0)) ),
    inference(rectify,[],[f7]) ).

fof(f7,negated_conjecture,
    ~ ! [X2,X0,X1] :
        ( subset(X0,X1)
       => subset(intersection(X0,X2),intersection(X1,X2)) ),
    inference(negated_conjecture,[],[f6]) ).

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

fof(f105,plain,
    subset(sF5,sF6),
    inference(duplicate_literal_removal,[],[f102]) ).

fof(f102,plain,
    ( subset(sF5,sF6)
    | subset(sF5,sF6) ),
    inference(resolution,[],[f101,f39]) ).

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

fof(f26,plain,
    ! [X0,X1] :
      ( ( subset(X1,X0)
        | ( member(sK4(X0,X1),X1)
          & ~ member(sK4(X0,X1),X0) ) )
      & ( ! [X3] :
            ( ~ member(X3,X1)
            | member(X3,X0) )
        | ~ subset(X1,X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f24,f25]) ).

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

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

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

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

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

fof(f101,plain,
    ! [X1] :
      ( member(sK4(X1,sF5),sF6)
      | subset(sF5,X1) ),
    inference(subsumption_resolution,[],[f99,f82]) ).

fof(f82,plain,
    ! [X0] :
      ( member(sK4(X0,sF5),sK0)
      | subset(sF5,X0) ),
    inference(resolution,[],[f77,f64]) ).

fof(f64,plain,
    ! [X8] :
      ( member(sK4(X8,sF5),sK2)
      | subset(sF5,X8) ),
    inference(resolution,[],[f40,f50]) ).

fof(f50,plain,
    ! [X0] :
      ( ~ member(X0,sF5)
      | member(X0,sK2) ),
    inference(superposition,[],[f32,f43]) ).

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

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

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

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

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

fof(f40,plain,
    ! [X0,X1] :
      ( member(sK4(X0,X1),X1)
      | subset(X1,X0) ),
    inference(cnf_transformation,[],[f26]) ).

fof(f77,plain,
    ! [X2] :
      ( ~ member(X2,sK2)
      | member(X2,sK0) ),
    inference(resolution,[],[f38,f30]) ).

fof(f30,plain,
    subset(sK2,sK0),
    inference(cnf_transformation,[],[f15]) ).

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

fof(f99,plain,
    ! [X1] :
      ( member(sK4(X1,sF5),sF6)
      | subset(sF5,X1)
      | ~ member(sK4(X1,sF5),sK0) ),
    inference(resolution,[],[f94,f63]) ).

fof(f63,plain,
    ! [X7] :
      ( member(sK4(X7,sF5),sK1)
      | subset(sF5,X7) ),
    inference(resolution,[],[f40,f54]) ).

fof(f54,plain,
    ! [X8] :
      ( ~ member(X8,sF5)
      | member(X8,sK1) ),
    inference(superposition,[],[f32,f47]) ).

fof(f47,plain,
    sF5 = intersection(sK1,sK2),
    inference(superposition,[],[f27,f43]) ).

fof(f27,plain,
    ! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
    inference(cnf_transformation,[],[f12]) ).

fof(f12,plain,
    ! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
    inference(rectify,[],[f3]) ).

fof(f3,axiom,
    ! [X1,X0] : intersection(X0,X1) = intersection(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection) ).

fof(f94,plain,
    ! [X1] :
      ( ~ member(X1,sK1)
      | ~ member(X1,sK0)
      | member(X1,sF6) ),
    inference(superposition,[],[f31,f44]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SET586+3 : 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 : n020.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:05:15 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.46  % (23902)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 (3000ds/191324Mi)
% 0.20/0.47  % (23918)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 (3000ds/99Mi)
% 0.20/0.47  TRYING [1]
% 0.20/0.47  TRYING [2]
% 0.20/0.47  TRYING [3]
% 0.20/0.48  TRYING [4]
% 0.20/0.48  TRYING [5]
% 1.26/0.52  % (23922)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/176Mi)
% 1.26/0.52  TRYING [6]
% 1.26/0.52  % (23906)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 1.26/0.52  % (23908)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 1.26/0.52  TRYING [1]
% 1.26/0.52  TRYING [2]
% 1.26/0.53  % (23914)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/101Mi)
% 1.26/0.53  % (23907)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 (3000ds/48Mi)
% 1.26/0.53  % (23903)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 1.26/0.53  % (23914)First to succeed.
% 1.26/0.53  % (23903)Refutation not found, incomplete strategy% (23903)------------------------------
% 1.26/0.53  % (23903)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.26/0.53  % (23903)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.26/0.53  % (23903)Termination reason: Refutation not found, incomplete strategy
% 1.26/0.53  
% 1.26/0.53  % (23903)Memory used [KB]: 5373
% 1.26/0.53  % (23903)Time elapsed: 0.129 s
% 1.26/0.53  % (23903)Instructions burned: 2 (million)
% 1.26/0.53  % (23903)------------------------------
% 1.26/0.53  % (23903)------------------------------
% 1.26/0.53  % (23930)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/439Mi)
% 1.26/0.53  % (23929)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/177Mi)
% 1.26/0.53  % (23924)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 (3000ds/498Mi)
% 1.26/0.53  % (23919)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/59Mi)
% 1.26/0.53  % (23920)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 1.26/0.53  % (23927)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/500Mi)
% 1.26/0.53  % (23905)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 1.26/0.53  % (23911)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 (3000ds/51Mi)
% 1.26/0.54  TRYING [1]
% 1.26/0.54  % (23931)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 (3000ds/355Mi)
% 1.46/0.54  % (23910)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 1.46/0.54  % (23925)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 (3000ds/467Mi)
% 1.46/0.54  % (23910)Instruction limit reached!
% 1.46/0.54  % (23910)------------------------------
% 1.46/0.54  % (23910)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.46/0.54  % (23910)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.46/0.54  % (23910)Termination reason: Unknown
% 1.46/0.54  % (23910)Termination phase: Saturation
% 1.46/0.54  
% 1.46/0.54  % (23910)Memory used [KB]: 5373
% 1.46/0.54  % (23910)Time elapsed: 0.140 s
% 1.46/0.54  % (23910)Instructions burned: 2 (million)
% 1.46/0.54  % (23910)------------------------------
% 1.46/0.54  % (23910)------------------------------
% 1.46/0.54  TRYING [2]
% 1.46/0.54  TRYING [3]
% 1.46/0.54  TRYING [3]
% 1.46/0.54  % (23927)Also succeeded, but the first one will report.
% 1.46/0.54  % (23914)Refutation found. Thanks to Tanya!
% 1.46/0.54  % SZS status Theorem for theBenchmark
% 1.46/0.54  % SZS output start Proof for theBenchmark
% See solution above
% 1.46/0.54  % (23914)------------------------------
% 1.46/0.54  % (23914)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.46/0.54  % (23914)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.46/0.54  % (23914)Termination reason: Refutation
% 1.46/0.54  
% 1.46/0.54  % (23914)Memory used [KB]: 5500
% 1.46/0.54  % (23914)Time elapsed: 0.135 s
% 1.46/0.54  % (23914)Instructions burned: 3 (million)
% 1.46/0.54  % (23914)------------------------------
% 1.46/0.54  % (23914)------------------------------
% 1.46/0.54  % (23899)Success in time 0.183 s
%------------------------------------------------------------------------------