TSTP Solution File: SET063+4 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SET063+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n025.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 : Sun May  5 09:10:51 EDT 2024

% Result   : Theorem 0.18s 0.39s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   32 (  12 unt;   0 def)
%            Number of atoms       :   83 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   88 (  37   ~;  26   |;  16   &)
%                                         (   5 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   60 (  55   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1183,plain,
    $false,
    inference(resolution,[],[f1167,f109]) ).

fof(f109,plain,
    ~ subset(intersection(sK0,empty_set),empty_set),
    inference(subsumption_resolution,[],[f108,f86]) ).

fof(f86,plain,
    ! [X0] : subset(empty_set,X0),
    inference(resolution,[],[f56,f54]) ).

fof(f54,plain,
    ! [X0] : ~ member(X0,empty_set),
    inference(cnf_transformation,[],[f14]) ).

fof(f14,plain,
    ! [X0] : ~ member(X0,empty_set),
    inference(rectify,[],[f6]) ).

fof(f6,axiom,
    ! [X2] : ~ member(X2,empty_set),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set) ).

fof(f56,plain,
    ! [X0,X1] :
      ( member(sK1(X0,X1),X0)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f34]) ).

fof(f34,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ member(sK1(X0,X1),X1)
          & member(sK1(X0,X1),X0) ) )
      & ( ! [X3] :
            ( member(X3,X1)
            | ~ member(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f32,f33]) ).

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

fof(f32,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,[],[f31]) ).

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

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

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

fof(f108,plain,
    ( ~ subset(empty_set,intersection(sK0,empty_set))
    | ~ subset(intersection(sK0,empty_set),empty_set) ),
    inference(resolution,[],[f58,f53]) ).

fof(f53,plain,
    ~ equal_set(intersection(sK0,empty_set),empty_set),
    inference(cnf_transformation,[],[f30]) ).

fof(f30,plain,
    ~ equal_set(intersection(sK0,empty_set),empty_set),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f24,f29]) ).

fof(f29,plain,
    ( ? [X0] : ~ equal_set(intersection(X0,empty_set),empty_set)
   => ~ equal_set(intersection(sK0,empty_set),empty_set) ),
    introduced(choice_axiom,[]) ).

fof(f24,plain,
    ? [X0] : ~ equal_set(intersection(X0,empty_set),empty_set),
    inference(ennf_transformation,[],[f13]) ).

fof(f13,negated_conjecture,
    ~ ! [X0] : equal_set(intersection(X0,empty_set),empty_set),
    inference(negated_conjecture,[],[f12]) ).

fof(f12,conjecture,
    ! [X0] : equal_set(intersection(X0,empty_set),empty_set),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI17) ).

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

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

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

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

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

fof(f1167,plain,
    ! [X0,X1] : subset(intersection(X0,empty_set),X1),
    inference(resolution,[],[f97,f54]) ).

fof(f97,plain,
    ! [X2,X0,X1] :
      ( member(sK1(intersection(X0,X1),X2),X1)
      | subset(intersection(X0,X1),X2) ),
    inference(resolution,[],[f79,f56]) ).

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET063+4 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35  % Computer : n025.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Fri May  3 16:37:38 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  % (22957)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.36  % (22960)WARNING: value z3 for option sas not known
% 0.13/0.37  % (22960)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.37  % (22962)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.13/0.37  % (22964)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.13/0.37  % (22961)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.37  % (22963)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.13/0.37  % (22959)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.37  TRYING [1]
% 0.13/0.37  TRYING [2]
% 0.13/0.37  % (22958)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.37  TRYING [3]
% 0.18/0.37  TRYING [4]
% 0.18/0.38  TRYING [1]
% 0.18/0.38  TRYING [2]
% 0.18/0.38  TRYING [5]
% 0.18/0.39  TRYING [1]
% 0.18/0.39  TRYING [2]
% 0.18/0.39  % (22960)First to succeed.
% 0.18/0.39  TRYING [3]
% 0.18/0.39  % (22960)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-22957"
% 0.18/0.39  TRYING [3]
% 0.18/0.39  % (22960)Refutation found. Thanks to Tanya!
% 0.18/0.39  % SZS status Theorem for theBenchmark
% 0.18/0.39  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.39  % (22960)------------------------------
% 0.18/0.39  % (22960)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.18/0.39  % (22960)Termination reason: Refutation
% 0.18/0.39  
% 0.18/0.39  % (22960)Memory used [KB]: 1317
% 0.18/0.39  % (22960)Time elapsed: 0.027 s
% 0.18/0.39  % (22960)Instructions burned: 46 (million)
% 0.18/0.39  % (22957)Success in time 0.04 s
%------------------------------------------------------------------------------