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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SET629+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:09 EDT 2022

% Result   : Theorem 0.19s 0.52s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   43 (  15 unt;   0 def)
%            Number of atoms       :  114 (   2 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  120 (  49   ~;  36   |;  25   &)
%                                         (   7 <=>;   3  =>;   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    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   81 (  73   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f90,plain,
    $false,
    inference(subsumption_resolution,[],[f88,f83]) ).

fof(f83,plain,
    ~ member(sK1(sF4,sF5),sF5),
    inference(resolution,[],[f78,f65]) ).

fof(f65,plain,
    ! [X0] :
      ( ~ member(X0,sK2)
      | ~ member(X0,sF5) ),
    inference(superposition,[],[f51,f57]) ).

fof(f57,plain,
    difference(sK3,sK2) = sF5,
    introduced(function_definition,[]) ).

fof(f51,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,difference(X1,X0))
      | ~ member(X2,X0) ),
    inference(cnf_transformation,[],[f33]) ).

fof(f33,plain,
    ! [X0,X1,X2] :
      ( ( ( ~ member(X2,X0)
          & member(X2,X1) )
        | ~ member(X2,difference(X1,X0)) )
      & ( member(X2,difference(X1,X0))
        | member(X2,X0)
        | ~ member(X2,X1) ) ),
    inference(rectify,[],[f32]) ).

fof(f32,plain,
    ! [X1,X2,X0] :
      ( ( ( ~ member(X0,X1)
          & member(X0,X2) )
        | ~ member(X0,difference(X2,X1)) )
      & ( member(X0,difference(X2,X1))
        | member(X0,X1)
        | ~ member(X0,X2) ) ),
    inference(flattening,[],[f31]) ).

fof(f31,plain,
    ! [X1,X2,X0] :
      ( ( ( ~ member(X0,X1)
          & member(X0,X2) )
        | ~ member(X0,difference(X2,X1)) )
      & ( member(X0,difference(X2,X1))
        | member(X0,X1)
        | ~ member(X0,X2) ) ),
    inference(nnf_transformation,[],[f14]) ).

fof(f14,plain,
    ! [X1,X2,X0] :
      ( ( ~ member(X0,X1)
        & member(X0,X2) )
    <=> member(X0,difference(X2,X1)) ),
    inference(rectify,[],[f2]) ).

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

fof(f78,plain,
    member(sK1(sF4,sF5),sK2),
    inference(resolution,[],[f76,f62]) ).

fof(f62,plain,
    ! [X0] :
      ( ~ member(X0,sF4)
      | member(X0,sK2) ),
    inference(superposition,[],[f39,f56]) ).

fof(f56,plain,
    intersection(sK3,sK2) = sF4,
    introduced(function_definition,[]) ).

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

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

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

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

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

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

fof(f76,plain,
    member(sK1(sF4,sF5),sF4),
    inference(resolution,[],[f46,f59]) ).

fof(f59,plain,
    intersect(sF4,sF5),
    inference(resolution,[],[f48,f58]) ).

fof(f58,plain,
    ~ disjoint(sF4,sF5),
    inference(definition_folding,[],[f53,f57,f56]) ).

fof(f53,plain,
    ~ disjoint(intersection(sK3,sK2),difference(sK3,sK2)),
    inference(cnf_transformation,[],[f36]) ).

fof(f36,plain,
    ~ disjoint(intersection(sK3,sK2),difference(sK3,sK2)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f18,f35]) ).

fof(f35,plain,
    ( ? [X0,X1] : ~ disjoint(intersection(X1,X0),difference(X1,X0))
   => ~ disjoint(intersection(sK3,sK2),difference(sK3,sK2)) ),
    introduced(choice_axiom,[]) ).

fof(f18,plain,
    ? [X0,X1] : ~ disjoint(intersection(X1,X0),difference(X1,X0)),
    inference(ennf_transformation,[],[f13]) ).

fof(f13,plain,
    ~ ! [X1,X0] : disjoint(intersection(X1,X0),difference(X1,X0)),
    inference(rectify,[],[f9]) ).

fof(f9,negated_conjecture,
    ~ ! [X1,X0] : disjoint(intersection(X0,X1),difference(X0,X1)),
    inference(negated_conjecture,[],[f8]) ).

fof(f8,conjecture,
    ! [X1,X0] : disjoint(intersection(X0,X1),difference(X0,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_intersection_and_difference_disjoint) ).

fof(f48,plain,
    ! [X0,X1] :
      ( disjoint(X0,X1)
      | intersect(X0,X1) ),
    inference(cnf_transformation,[],[f30]) ).

fof(f30,plain,
    ! [X0,X1] :
      ( intersect(X0,X1)
      | disjoint(X0,X1) ),
    inference(rectify,[],[f17]) ).

fof(f17,plain,
    ! [X1,X0] :
      ( intersect(X1,X0)
      | disjoint(X1,X0) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f15,plain,
    ! [X1,X0] :
      ( ~ intersect(X1,X0)
     => disjoint(X1,X0) ),
    inference(unused_predicate_definition_removal,[],[f11]) ).

fof(f11,plain,
    ! [X1,X0] :
      ( disjoint(X1,X0)
    <=> ~ intersect(X1,X0) ),
    inference(rectify,[],[f4]) ).

fof(f4,axiom,
    ! [X1,X0] :
      ( ~ intersect(X0,X1)
    <=> disjoint(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint_defn) ).

fof(f46,plain,
    ! [X0,X1] :
      ( ~ intersect(X0,X1)
      | member(sK1(X0,X1),X0) ),
    inference(cnf_transformation,[],[f29]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( ( ( member(sK1(X0,X1),X1)
          & member(sK1(X0,X1),X0) )
        | ~ intersect(X0,X1) )
      & ( intersect(X0,X1)
        | ! [X3] :
            ( ~ member(X3,X1)
            | ~ member(X3,X0) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f27,f28]) ).

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

fof(f27,plain,
    ! [X0,X1] :
      ( ( ? [X2] :
            ( member(X2,X1)
            & member(X2,X0) )
        | ~ intersect(X0,X1) )
      & ( intersect(X0,X1)
        | ! [X3] :
            ( ~ member(X3,X1)
            | ~ member(X3,X0) ) ) ),
    inference(rectify,[],[f26]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( ( ? [X2] :
            ( member(X2,X1)
            & member(X2,X0) )
        | ~ intersect(X0,X1) )
      & ( intersect(X0,X1)
        | ! [X2] :
            ( ~ member(X2,X1)
            | ~ member(X2,X0) ) ) ),
    inference(nnf_transformation,[],[f3]) ).

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

fof(f88,plain,
    member(sK1(sF4,sF5),sF5),
    inference(resolution,[],[f47,f59]) ).

fof(f47,plain,
    ! [X0,X1] :
      ( ~ intersect(X0,X1)
      | member(sK1(X0,X1),X1) ),
    inference(cnf_transformation,[],[f29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SET629+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.33  % Computer : n009.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Tue Aug 30 14:03:50 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.48  % (7028)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.19/0.48  % (7013)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)
% 0.19/0.48  % (7013)Refutation not found, incomplete strategy% (7013)------------------------------
% 0.19/0.48  % (7013)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48  % (7013)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48  % (7013)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.48  
% 0.19/0.48  % (7013)Memory used [KB]: 5373
% 0.19/0.48  % (7013)Time elapsed: 0.086 s
% 0.19/0.48  % (7013)Instructions burned: 2 (million)
% 0.19/0.48  % (7013)------------------------------
% 0.19/0.48  % (7013)------------------------------
% 0.19/0.50  % (7016)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.19/0.51  % (7023)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.19/0.52  % (7031)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.19/0.52  % (7040)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/439Mi)
% 0.19/0.52  % (7029)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/59Mi)
% 0.19/0.52  % (7038)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 (3000ds/68Mi)
% 0.19/0.52  % (7040)First to succeed.
% 0.19/0.52  % (7034)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)
% 0.19/0.52  % (7041)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)
% 0.19/0.52  TRYING [1]
% 0.19/0.52  TRYING [2]
% 0.19/0.52  TRYING [3]
% 0.19/0.52  % (7040)Refutation found. Thanks to Tanya!
% 0.19/0.52  % SZS status Theorem for theBenchmark
% 0.19/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52  % (7040)------------------------------
% 0.19/0.52  % (7040)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (7040)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (7040)Termination reason: Refutation
% 0.19/0.52  
% 0.19/0.52  % (7040)Memory used [KB]: 5373
% 0.19/0.52  % (7040)Time elapsed: 0.131 s
% 0.19/0.52  % (7040)Instructions burned: 2 (million)
% 0.19/0.52  % (7040)------------------------------
% 0.19/0.52  % (7040)------------------------------
% 0.19/0.52  % (7011)Success in time 0.173 s
%------------------------------------------------------------------------------