↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n013.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:47:33 PM UTC 2026

% Result   : Theorem 3.60s 1.48s
% Output   : Refutation 3.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   31 (   9 unt;   0 def)
%            Number of atoms       :  115 (   8 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  129 (  45   ~;  45   |;  24   &)
%                                         (   8 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   59 (  52   !;   7   ?)

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

fof(f3,axiom,
    ! [X0,X1] :
      ( ( ~ empty(X0)
       => ( element(X1,X0)
        <=> in(X1,X0) ) )
      & ( empty(X0)
       => ( element(X1,X0)
        <=> empty(X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_subset_1) ).

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

fof(f9,axiom,
    ! [X0] : ~ empty(powerset(X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_subset_1) ).

fof(f11,conjecture,
    ! [X0,X1] :
      ( element(X1,powerset(X0))
     => ! [X2] :
          ( in(X2,X1)
         => in(X2,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l3_subset_1) ).

fof(f12,negated_conjecture,
    ~ ! [X0,X1] :
        ( element(X1,powerset(X0))
       => ! [X2] :
            ( in(X2,X1)
           => in(X2,X0) ) ),
    inference(negated_conjecture,[status(cth)],[f11]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( ( ( element(X1,X0)
        <=> in(X1,X0) )
        | empty(X0) )
      & ( ( element(X1,X0)
        <=> empty(X1) )
        | ~ empty(X0) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X1)
          | ~ in(X2,X0) ) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f24,plain,
    ? [X0,X1] :
      ( ? [X2] :
          ( ~ in(X2,X0)
          & in(X2,X1) )
      & element(X1,powerset(X0)) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( ( X1 = powerset(X0)
        | ? [X2] :
            ( ( ~ subset(X2,X0)
              | ~ in(X2,X1) )
            & ( subset(X2,X0)
              | in(X2,X1) ) ) )
      & ( ! [X2] :
            ( ( in(X2,X1)
              | ~ subset(X2,X0) )
            & ( subset(X2,X0)
              | ~ in(X2,X1) ) )
        | powerset(X0) != X1 ) ),
    inference(nnf_transformation,[],[f2]) ).

fof(f30,plain,
    ! [X0,X1] :
      ( ( X1 = powerset(X0)
        | ? [X2] :
            ( ( ~ subset(X2,X0)
              | ~ in(X2,X1) )
            & ( subset(X2,X0)
              | in(X2,X1) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X1)
              | ~ subset(X3,X0) )
            & ( subset(X3,X0)
              | ~ in(X3,X1) ) )
        | powerset(X0) != X1 ) ),
    inference(rectify,[],[f29]) ).

fof(f31,plain,
    ! [X0,X1] :
      ( ( X1 = powerset(X0)
        | ( ( ~ subset(sK0(X0,X1),X0)
            | ~ in(sK0(X0,X1),X1) )
          & ( subset(sK0(X0,X1),X0)
            | in(sK0(X0,X1),X1) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X1)
              | ~ subset(X3,X0) )
            & ( subset(X3,X0)
              | ~ in(X3,X1) ) )
        | powerset(X0) != X1 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f30]) ).

fof(f32,plain,
    ! [X0,X1] :
      ( ( ( ( element(X1,X0)
            | ~ in(X1,X0) )
          & ( in(X1,X0)
            | ~ element(X1,X0) ) )
        | empty(X0) )
      & ( ( ( element(X1,X0)
            | ~ empty(X1) )
          & ( empty(X1)
            | ~ element(X1,X0) ) )
        | ~ empty(X0) ) ),
    inference(nnf_transformation,[],[f22]) ).

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

fof(f34,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ in(X2,X1)
            & in(X2,X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(rectify,[],[f33]) ).

fof(f35,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ in(sK1(X0,X1),X1)
          & in(sK1(X0,X1),X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f34]) ).

fof(f37,plain,
    ( ~ in(sK5,sK3)
    & in(sK5,sK4)
    & element(sK4,powerset(sK3)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5)],[f24]) ).

fof(f42,plain,
    ! [X3,X0,X1] :
      ( subset(X3,X0)
      | ~ in(X3,X1)
      | powerset(X0) != X1 ),
    inference(cnf_transformation,[],[f31]) ).

fof(f48,plain,
    ! [X0,X1] :
      ( ~ element(X1,X0)
      | in(X1,X0)
      | empty(X0) ),
    inference(cnf_transformation,[],[f32]) ).

fof(f50,plain,
    ! [X3,X0,X1] :
      ( ~ subset(X0,X1)
      | ~ in(X3,X0)
      | in(X3,X1) ),
    inference(cnf_transformation,[],[f35]) ).

fof(f54,plain,
    ! [X0] : ~ empty(powerset(X0)),
    inference(cnf_transformation,[],[f9]) ).

fof(f56,plain,
    element(sK4,powerset(sK3)),
    inference(cnf_transformation,[],[f37]) ).

fof(f57,plain,
    in(sK5,sK4),
    inference(cnf_transformation,[],[f37]) ).

fof(f58,plain,
    ~ in(sK5,sK3),
    inference(cnf_transformation,[],[f37]) ).

fof(f68,plain,
    ! [X3,X0] :
      ( ~ in(X3,powerset(X0))
      | subset(X3,X0) ),
    inference(equality_resolution,[],[f42]) ).

fof(f83,plain,
    ( in(sK4,powerset(sK3))
    | empty(powerset(sK3)) ),
    inference(resolution,[],[f48,f56]) ).

fof(f86,plain,
    in(sK4,powerset(sK3)),
    inference(forward_subsumption_resolution,[],[f83,f54]) ).

fof(f87,plain,
    subset(sK4,sK3),
    inference(resolution,[],[f86,f68]) ).

fof(f99,plain,
    ! [X0] :
      ( ~ in(X0,sK4)
      | in(X0,sK3) ),
    inference(resolution,[],[f50,f87]) ).

fof(f100,plain,
    in(sK5,sK3),
    inference(resolution,[],[f99,f57]) ).

fof(f101,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f100,f58]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU169+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n013.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 03:51:21 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.42  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.60/1.48  % (784662)Detected formulas, will run a generic FOF schedule.
% 3.60/1.48  % (784667)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=785594344:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.60/1.48  % (784673)dis-21_1_sil=8000:lcm=predicate:random_seed=3922935662: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.60/1.48  % (784671)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2946928164:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.60/1.48  % (784670)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2290453059:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.60/1.48  % (784669)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=200947507:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.60/1.48  % (784668)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=1352941028:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.60/1.48  % (784672)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2807391978:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.60/1.48  % (784670)Refutation not found, incomplete strategy
% 3.60/1.48  % (784670)------------------------------
% 3.60/1.48  % (784670)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/1.48  % (784670)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/1.48  % (784670)CaDiCaL version: 2.1.3
% 3.60/1.48  % (784670)Termination reason: Refutation not found, incomplete strategy
% 3.60/1.48  % (784670)Time elapsed: 0.001 s
% 3.60/1.48  % (784670)Peak memory usage: 88 MB
% 3.60/1.48  % (784671)Refutation not found, incomplete strategy
% 3.60/1.48  % (784671)------------------------------
% 3.60/1.48  % (784671)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/1.48  % (784671)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/1.48  % (784671)CaDiCaL version: 2.1.3
% 3.60/1.48  % (784671)Termination reason: Refutation not found, incomplete strategy
% 3.60/1.48  % (784671)Time elapsed: 0.002 s
% 3.60/1.48  % (784671)Peak memory usage: 88 MB
% 3.60/1.48  % (784671)Instructions burned: 1 (million)
% 3.60/1.48  % (784672)First to succeed.
% 3.60/1.48  % (784672)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-784662"
% 3.60/1.48  % (784673)Also succeeded, but the first one will report.
% 3.60/1.48  % (784670)------------------------------
% 3.60/1.48  % (784670)------------------------------
% 3.60/1.48  % (784671)------------------------------
% 3.60/1.48  % (784671)------------------------------
% 3.60/1.48  % (784672)Refutation found. Thanks to Tanya!
% 3.60/1.48  % SZS status Theorem for theBenchmark
% 3.60/1.48  % SZS output start Proof for theBenchmark
% See solution above
% 3.60/1.48  % (784672)------------------------------
% 3.60/1.48  % (784672)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/1.48  % (784672)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/1.48  % (784672)CaDiCaL version: 2.1.3
% 3.60/1.48  % (784672)Termination reason: Refutation
% 3.60/1.48  % (784672)Time elapsed: 0.004 s
% 3.60/1.48  % (784672)Peak memory usage: 89 MB
% 3.60/1.48  % (784672)Instructions burned: 3 (million)
% 3.60/1.48  % (784672)------------------------------
% 3.60/1.48  % (784672)------------------------------
% 3.60/1.48  % (784662)Success in time 0.429 s
% 3.60/1.48  % Vampire exiting
%------------------------------------------------------------------------------