↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n007.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:39:41 PM UTC 2026

% Result   : Theorem 3.54s 1.39s
% Output   : Refutation 3.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   23 (   5 unt;   0 def)
%            Number of atoms       :   67 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   74 (  30   ~;  25   |;  14   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   50 (  42   !;   8   ?)

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

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

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

fof(f14,plain,
    ? [X0,X1,X2] :
      ( ~ subset(X0,X2)
      & subset(X0,X1)
      & subset(X1,X2) ),
    inference(ennf_transformation,[],[f13]) ).

fof(f15,plain,
    ? [X0,X1,X2] :
      ( ~ subset(X0,X2)
      & subset(X0,X1)
      & subset(X1,X2) ),
    inference(flattening,[],[f14]) ).

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

fof(f17,plain,
    ( ~ subset(sK0,sK2)
    & subset(sK0,sK1)
    & subset(sK1,sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f15]) ).

fof(f18,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(f19,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,[],[f18]) ).

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

fof(f21,plain,
    subset(sK1,sK2),
    inference(cnf_transformation,[],[f17]) ).

fof(f22,plain,
    subset(sK0,sK1),
    inference(cnf_transformation,[],[f17]) ).

fof(f23,plain,
    ~ subset(sK0,sK2),
    inference(cnf_transformation,[],[f17]) ).

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

fof(f25,plain,
    ! [X0,X1] :
      ( member(sK3(X0,X1),X0)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f20]) ).

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

fof(f29,plain,
    ! [X2,X0,X1] :
      ( ~ member(sK3(X0,X1),X2)
      | ~ subset(X2,X1)
      | subset(X0,X1) ),
    inference(resolution,[],[f24,f26]) ).

fof(f31,plain,
    ! [X2,X3,X0,X1] :
      ( ~ member(sK3(X2,X1),X3)
      | subset(X2,X1)
      | ~ subset(X0,X1)
      | ~ subset(X3,X0) ),
    inference(resolution,[],[f29,f24]) ).

fof(f33,plain,
    ! [X2,X0,X1] :
      ( subset(X0,X1)
      | ~ subset(X2,X1)
      | ~ subset(X0,X2)
      | subset(X0,X1) ),
    inference(resolution,[],[f31,f25]) ).

fof(f35,plain,
    ! [X2,X0,X1] :
      ( subset(X0,X1)
      | ~ subset(X2,X1)
      | ~ subset(X0,X2) ),
    inference(duplicate_literal_removal,[],[f33]) ).

fof(f36,plain,
    ! [X0] :
      ( ~ subset(sK0,X0)
      | ~ subset(X0,sK2) ),
    inference(resolution,[],[f35,f23]) ).

fof(f37,plain,
    ~ subset(sK1,sK2),
    inference(resolution,[],[f36,f22]) ).

fof(f40,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f37,f21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET027+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.37  % Computer : n007.cluster.edu
% 0.13/0.37  % Model    : x86_64 x86_64
% 0.13/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37  % Memory   : 8046.5625MB
% 0.13/0.37  % OS       : Linux 6.8.0-71-generic
% 0.13/0.37  % CPULimit : 300
% 0.13/0.37  % WCLimit  : 300
% 0.13/0.37  % DateTime : Mon Sep 28 00:11:40 UTC 2026
% 0.13/0.38  % CPUTime  : 
% 0.13/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41  Running first-order theorem proving
% 0.13/0.41  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.54/1.39  % (1915129)Detected formulas, will run a generic FOF schedule.
% 3.54/1.39  % (1915136)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=3489379613:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.54/1.39  % (1915134)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=150030761:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.54/1.39  % (1915138)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=471162851:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.54/1.39  % (1915140)dis-21_1_sil=8000:lcm=predicate:random_seed=3630307160: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.54/1.39  % (1915135)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=2632399034:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.54/1.39  % (1915137)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=939504838:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.54/1.39  % (1915139)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2367685444:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.54/1.39  % (1915137)Refutation not found, incomplete strategy
% 3.54/1.39  % (1915137)------------------------------
% 3.54/1.39  % (1915137)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.54/1.39  % (1915137)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.54/1.39  % (1915137)CaDiCaL version: 2.1.3
% 3.54/1.39  % (1915137)Termination reason: Refutation not found, incomplete strategy
% 3.54/1.39  % (1915137)Time elapsed: 0.001 s
% 3.54/1.39  % (1915137)Peak memory usage: 88 MB
% 3.54/1.39  % (1915138)First to succeed.
% 3.54/1.39  % (1915138)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1915129"
% 3.54/1.39  % (1915139)Also succeeded, but the first one will report.
% 3.54/1.39  % (1915140)Also succeeded, but the first one will report.
% 3.54/1.39  % (1915137)------------------------------
% 3.54/1.39  % (1915137)------------------------------
% 3.54/1.39  % (1915138)Refutation found. Thanks to Tanya!
% 3.54/1.39  % SZS status Theorem for theBenchmark
% 3.54/1.39  % SZS output start Proof for theBenchmark
% See solution above
% 3.54/1.39  % (1915138)------------------------------
% 3.54/1.39  % (1915138)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.54/1.39  % (1915138)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.54/1.39  % (1915138)CaDiCaL version: 2.1.3
% 3.54/1.39  % (1915138)Termination reason: Refutation
% 3.54/1.39  % (1915138)Time elapsed: 0.002 s
% 3.54/1.39  % (1915138)Peak memory usage: 88 MB
% 3.54/1.39  % (1915138)Instructions burned: 1 (million)
% 3.54/1.39  % (1915138)------------------------------
% 3.54/1.39  % (1915138)------------------------------
% 3.54/1.39  % (1915129)Success in time 0.433 s
% 3.54/1.39  % Vampire exiting
%------------------------------------------------------------------------------