↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SET696+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 12:41:40 PM UTC 2026

% Result   : Theorem 3.42s 1.52s
% Output   : Refutation 3.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   36 (   7 unt;   0 def)
%            Number of atoms       :  102 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  109 (  43   ~;  37   |;  20   &)
%                                         (   5 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   81 (  77   !;   4   ?)

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

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

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

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

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

fof(f12,conjecture,
    ! [X0,X1] :
      ( subset(X0,X1)
     => equal_set(intersection(difference(X1,X0),X0),empty_set) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI28) ).

fof(f13,negated_conjecture,
    ~ ! [X0,X1] :
        ( subset(X0,X1)
       => equal_set(intersection(difference(X1,X0),X0),empty_set) ),
    inference(negated_conjecture,[status(cth)],[f12]) ).

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

fof(f15,plain,
    ? [X0,X1] :
      ( ~ equal_set(intersection(difference(X1,X0),X0),empty_set)
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f13]) ).

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

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

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

fof(f19,plain,
    ( ~ equal_set(intersection(difference(sK1,sK0),sK0),empty_set)
    & subset(sK0,sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f15]) ).

fof(f20,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,[],[f16]) ).

fof(f21,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,[],[f20]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ member(sK2(X0,X1),X1)
          & member(sK2(X0,X1),X0) ) )
      & ( ! [X3] :
            ( member(X3,X1)
            | ~ member(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f21]) ).

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

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

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

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

fof(f28,plain,
    ~ equal_set(intersection(difference(sK1,sK0),sK0),empty_set),
    inference(cnf_transformation,[],[f19]) ).

fof(f30,plain,
    ! [X0,X1] :
      ( member(sK2(X0,X1),X0)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f22]) ).

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

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

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

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

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

fof(f40,plain,
    ! [X0] : subset(empty_set,X0),
    inference(resolution,[],[f30,f36]) ).

fof(f43,plain,
    ! [X2,X0,X1] :
      ( member(sK2(intersection(X0,X1),X2),X1)
      | subset(intersection(X0,X1),X2) ),
    inference(resolution,[],[f32,f30]) ).

fof(f44,plain,
    ! [X2,X0,X1] :
      ( member(sK2(intersection(X0,X1),X2),X0)
      | subset(intersection(X0,X1),X2) ),
    inference(resolution,[],[f33,f30]) ).

fof(f55,plain,
    ( ~ subset(intersection(difference(sK1,sK0),sK0),empty_set)
    | ~ subset(empty_set,intersection(difference(sK1,sK0),sK0)) ),
    inference(resolution,[],[f35,f28]) ).

fof(f56,plain,
    ~ subset(intersection(difference(sK1,sK0),sK0),empty_set),
    inference(forward_subsumption_resolution,[],[f55,f40]) ).

fof(f118,plain,
    ! [X2,X3,X0,X1] :
      ( ~ member(sK2(intersection(difference(X0,X1),X2),X3),X1)
      | subset(intersection(difference(X0,X1),X2),X3) ),
    inference(resolution,[],[f44,f37]) ).

fof(f647,plain,
    ! [X2,X0,X1] :
      ( subset(intersection(difference(X0,X1),X1),X2)
      | subset(intersection(difference(X0,X1),X1),X2) ),
    inference(resolution,[],[f118,f43]) ).

fof(f659,plain,
    ! [X2,X0,X1] : subset(intersection(difference(X0,X1),X1),X2),
    inference(duplicate_literal_removal,[],[f647]) ).

fof(f1814,plain,
    $false,
    inference(resolution,[],[f659,f56]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET696+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n018.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Mon Sep 28 02:35:54 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.42/1.52  % (2938028)Detected formulas, will run a generic FOF schedule.
% 3.42/1.52  % (2938133)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=723720079:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.42/1.52  % (2938133)First to succeed.
% 3.42/1.52  % (2938133)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2938028"
% 3.42/1.52  % (2938131)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1936170888:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.42/1.52  % (2938130)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2375535925:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.42/1.52  % (2938132)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2903705767:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.42/1.52  % (2938129)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3879723859:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.42/1.52  % (2938132)Refutation not found, incomplete strategy
% 3.42/1.52  % (2938132)------------------------------
% 3.42/1.52  % (2938132)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.42/1.52  % (2938132)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.42/1.52  % (2938132)CaDiCaL version: 2.1.3
% 3.42/1.52  % (2938132)Termination reason: Refutation not found, incomplete strategy
% 3.42/1.52  % (2938132)Time elapsed: 0.002 s
% 3.42/1.52  % (2938132)Peak memory usage: 88 MB
% 3.42/1.52  % (2938132)Instructions burned: 1 (million)
% 3.42/1.52  % (2938135)dis-21_1_sil=8000:lcm=predicate:random_seed=1892639824:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.42/1.52  % (2938135)Also succeeded, but the first one will report.
% 3.42/1.52  % (2938134)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=730272447:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.42/1.52  % (2938134)Also succeeded, but the first one will report.
% 3.42/1.52  % (2938133)Refutation found. Thanks to Tanya!
% 3.42/1.52  % SZS status Theorem for theBenchmark
% 3.42/1.52  % SZS output start Proof for theBenchmark
% See solution above
% 3.42/1.52  % (2938133)------------------------------
% 3.42/1.52  % (2938133)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.42/1.52  % (2938133)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.42/1.52  % (2938133)CaDiCaL version: 2.1.3
% 3.42/1.52  % (2938133)Termination reason: Refutation
% 3.42/1.52  % (2938133)Time elapsed: 0.013 s
% 3.42/1.52  % (2938133)Peak memory usage: 88 MB
% 3.42/1.52  % (2938133)Instructions burned: 37 (million)
% 3.42/1.52  % (2938133)------------------------------
% 3.42/1.52  % (2938133)------------------------------
% 3.42/1.52  % (2938028)Success in time 0.387 s
% 3.42/1.52  % Vampire exiting
%------------------------------------------------------------------------------