↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SEU139+2 : 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 : n008.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:22 PM UTC 2026

% Result   : Theorem 3.02s 1.36s
% Output   : Refutation 3.02s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   21 (   7 unt;   0 def)
%            Number of atoms       :   54 (  14 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   56 (  23   ~;  17   |;  14   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   25 (  23   !;   2   ?)

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

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

fof(f50,conjecture,
    ! [X0,X1] :
      ~ ( subset(X0,X1)
        & proper_subset(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t60_xboole_1) ).

fof(f51,negated_conjecture,
    ~ ! [X0,X1] :
        ~ ( subset(X0,X1)
          & proper_subset(X1,X0) ),
    inference(negated_conjecture,[status(cth)],[f50]) ).

fof(f75,plain,
    ? [X0,X1] :
      ( subset(X0,X1)
      & proper_subset(X1,X0) ),
    inference(ennf_transformation,[],[f51]) ).

fof(f87,plain,
    ( subset(sK2,sK3)
    & proper_subset(sK3,sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f75]) ).

fof(f88,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ~ subset(X0,X1)
        | ~ subset(X1,X0) )
      & ( ( subset(X0,X1)
          & subset(X1,X0) )
        | X0 != X1 ) ),
    inference(nnf_transformation,[],[f5]) ).

fof(f89,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ~ subset(X0,X1)
        | ~ subset(X1,X0) )
      & ( ( subset(X0,X1)
          & subset(X1,X0) )
        | X0 != X1 ) ),
    inference(flattening,[],[f88]) ).

fof(f111,plain,
    ! [X0,X1] :
      ( ( proper_subset(X0,X1)
        | ~ subset(X0,X1)
        | X0 = X1 )
      & ( ( subset(X0,X1)
          & X0 != X1 )
        | ~ proper_subset(X0,X1) ) ),
    inference(nnf_transformation,[],[f12]) ).

fof(f112,plain,
    ! [X0,X1] :
      ( ( proper_subset(X0,X1)
        | ~ subset(X0,X1)
        | X0 = X1 )
      & ( ( subset(X0,X1)
          & X0 != X1 )
        | ~ proper_subset(X0,X1) ) ),
    inference(flattening,[],[f111]) ).

fof(f136,plain,
    proper_subset(sK3,sK2),
    inference(cnf_transformation,[],[f87]) ).

fof(f137,plain,
    subset(sK2,sK3),
    inference(cnf_transformation,[],[f87]) ).

fof(f144,plain,
    ! [X0,X1] :
      ( ~ subset(X1,X0)
      | ~ subset(X0,X1)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f89]) ).

fof(f182,plain,
    ! [X0,X1] :
      ( X0 != X1
      | ~ proper_subset(X0,X1) ),
    inference(cnf_transformation,[],[f112]) ).

fof(f183,plain,
    ! [X0,X1] :
      ( ~ proper_subset(X0,X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f112]) ).

fof(f222,plain,
    ! [X1] : ~ proper_subset(X1,X1),
    inference(equality_resolution,[],[f182]) ).

fof(f225,plain,
    subset(sK3,sK2),
    inference(resolution,[],[f136,f183]) ).

fof(f228,plain,
    ( ~ subset(sK3,sK2)
    | sK2 = sK3 ),
    inference(resolution,[],[f137,f144]) ).

fof(f229,plain,
    sK2 = sK3,
    inference(forward_subsumption_resolution,[],[f228,f225]) ).

fof(f238,plain,
    proper_subset(sK2,sK2),
    inference(superposition,[],[f136,f229]) ).

fof(f239,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f238,f222]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU139+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37  % Computer : n008.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 28 03:42:54 UTC 2026
% 0.09/0.38  % CPUTime  : 
% 0.09/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41  Running first-order theorem proving
% 0.14/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.02/1.36  % (1846375)Detected formulas, will run a generic FOF schedule.
% 3.02/1.36  % (1846386)dis-21_1_sil=8000:lcm=predicate:random_seed=2161411791: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.02/1.36  % (1846383)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2098382984:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.02/1.36  % (1846382)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=2943834878:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.02/1.36  % (1846380)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=2231139697:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.02/1.36  % (1846381)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=3786397282:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.02/1.36  % (1846384)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3125796832:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.02/1.36  % (1846386)Instruction limit reached! 
% 3.02/1.36  % (1846386)------------------------------
% 3.02/1.36  % (1846386)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.02/1.36  % (1846386)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.02/1.36  % (1846386)CaDiCaL version: 2.1.3
% 3.02/1.36  % (1846386)Termination reason: Instruction limit
% 3.02/1.36  % (1846386)Termination phase: Saturation
% 3.02/1.36  % (1846386)Time elapsed: 0.042 s
% 3.02/1.36  % (1846386)Peak memory usage: 89 MB
% 3.02/1.36  % (1846386)Instructions burned: 129 (million)
% 3.02/1.36  % (1846383)First to succeed.
% 3.02/1.36  % (1846383)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1846375"
% 3.02/1.36  % (1846384)Also succeeded, but the first one will report.
% 3.02/1.36  % (1846385)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1132668334:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.02/1.36  % (1846385)Also succeeded, but the first one will report.
% 3.02/1.36  % (1846383)Refutation found. Thanks to Tanya!
% 3.02/1.36  % SZS status Theorem for theBenchmark
% 3.02/1.36  % SZS output start Proof for theBenchmark
% See solution above
% 3.02/1.36  % (1846383)------------------------------
% 3.02/1.36  % (1846383)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.02/1.36  % (1846383)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.02/1.36  % (1846383)CaDiCaL version: 2.1.3
% 3.02/1.36  % (1846383)Termination reason: Refutation
% 3.02/1.36  % (1846383)Time elapsed: 0.004 s
% 3.02/1.36  % (1846383)Peak memory usage: 89 MB
% 3.02/1.36  % (1846383)Instructions burned: 5 (million)
% 3.02/1.36  % (1846383)------------------------------
% 3.02/1.36  % (1846383)------------------------------
% 3.02/1.36  % (1846375)Success in time 0.355 s
% 3.02/1.36  % Vampire exiting
%------------------------------------------------------------------------------