↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SYN951+1 : TPTP v9.3.1. Released v3.1.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 02:06:03 PM UTC 2026

% Result   : Theorem 2.72s 1.15s
% Output   : Refutation 2.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   18 (   3 unt;   0 def)
%            Number of atoms       :   68 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   79 (  29   ~;  22   |;  17   &)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   4 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   21 (  11   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ? [X0] : p(X0)
   => ( ? [X0] : p(X0)
      & ( a
       => ( ( b
            | ~ b )
          & ( q
           => q ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f2,negated_conjecture,
    ~ ( ? [X0] : p(X0)
     => ( ? [X0] : p(X0)
        & ( a
         => ( ( b
              | ~ b )
            & ( q
             => q ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ~ ( ? [X0] : p(X0)
     => ( ? [X1] : p(X1)
        & ( a
         => ( ( b
              | ~ b )
            & ( q
             => q ) ) ) ) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ~ ( ? [X0] : p(X0)
     => ( ( b
          | ~ b )
        & ( q
         => q )
        & ? [X1] : p(X1) ) ),
    inference(pure_predicate_removal,[],[f3]) ).

fof(f5,plain,
    ( ( ( ~ b
        & b )
      | ( ~ q
        & q )
      | ! [X1] : ~ p(X1) )
    & ? [X0] : p(X0) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f6,plain,
    ( ( ( ~ b
        & b )
      | ( ~ q
        & q )
      | ! [X0] : ~ p(X0) )
    & ? [X1] : p(X1) ),
    inference(rectify,[],[f5]) ).

fof(f7,plain,
    ( ( ( ~ b
        & b )
      | ( ~ q
        & q )
      | ! [X0] : ~ p(X0) )
    & p(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0)],[f6]) ).

fof(f8,plain,
    p(sK0),
    inference(cnf_transformation,[],[f7]) ).

fof(f9,plain,
    ! [X0] :
      ( ~ p(X0)
      | q
      | b ),
    inference(cnf_transformation,[],[f7]) ).

fof(f10,plain,
    ! [X0] :
      ( b
      | ~ q
      | ~ p(X0) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f11,plain,
    ! [X0] :
      ( ~ b
      | q
      | ~ p(X0) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f12,plain,
    ! [X0] :
      ( ~ b
      | ~ q
      | ~ p(X0) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f13,plain,
    ( q
    | b ),
    inference(resolution,[],[f9,f8]) ).

fof(f14,plain,
    ! [X0] :
      ( ~ p(X0)
      | b ),
    inference(forward_subsumption_resolution,[],[f10,f13]) ).

fof(f16,plain,
    ! [X0] :
      ( ~ p(X0)
      | q ),
    inference(forward_subsumption_resolution,[],[f11,f14]) ).

fof(f18,plain,
    ! [X0] :
      ( ~ q
      | ~ p(X0) ),
    inference(forward_subsumption_resolution,[],[f12,f14]) ).

fof(f19,plain,
    ! [X0] : ~ p(X0),
    inference(forward_subsumption_resolution,[],[f18,f16]) ).

fof(f20,plain,
    $false,
    inference(resolution,[],[f19,f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN951+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18  % Computer : n007.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Mon Sep 28 17:14:25 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  Running first-order theorem proving
% 0.08/0.22  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
% 2.72/1.15  % (2571960)Detected formulas, will run a generic FOF schedule.
% 2.72/1.15  % (2571969)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3460374247:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.72/1.15  % (2571969)First to succeed.
% 2.72/1.15  % (2571969)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2571960"
% 2.72/1.15  % (2571968)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3557842293:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.72/1.15  % (2571966)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=1273288771:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.72/1.15  % (2571967)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=3085704573:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.72/1.15  % (2571965)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=3993211643:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.72/1.15  % (2571968)Also succeeded, but the first one will report.
% 2.72/1.15  % (2571971)dis-21_1_sil=8000:lcm=predicate:random_seed=3740466951: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)
% 2.72/1.15  % (2571970)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1436875156:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.72/1.15  % (2571971)Also succeeded, but the first one will report.
% 2.72/1.15  % (2571970)Also succeeded, but the first one will report.
% 2.72/1.15  % (2571969)Refutation found. Thanks to Tanya!
% 2.72/1.15  % SZS status Theorem for theBenchmark
% 2.72/1.15  % SZS output start Proof for theBenchmark
% See solution above
% 2.72/1.15  % (2571969)------------------------------
% 2.72/1.15  % (2571969)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.72/1.15  % (2571969)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.72/1.15  % (2571969)CaDiCaL version: 2.1.3
% 2.72/1.15  % (2571969)Termination reason: Refutation
% 2.72/1.15  % (2571969)Time elapsed: 0.001 s
% 2.72/1.15  % (2571969)Peak memory usage: 88 MB
% 2.72/1.15  % (2571969)------------------------------
% 2.72/1.15  % (2571969)------------------------------
% 2.72/1.15  % (2571960)Success in time 0.291 s
% 2.72/1.15  % Vampire exiting
%------------------------------------------------------------------------------