↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SYN940+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 : n009.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:01 PM UTC 2026

% Result   : Theorem 3.63s 1.29s
% Output   : Refutation 3.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   3 unt;   0 def)
%            Number of atoms       :   54 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   68 (  28   ~;  19   |;  15   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   7 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   34 (  26   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ! [X0,X1] :
      ( ! [X2] : q(f(X2))
     => ? [X3,X4] :
          ( ( p(f(X4))
           => ( p(X3)
              & ( r(X4)
               => ( r(X0)
                  & r(X1) ) ) ) )
          & q(X3) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f2,negated_conjecture,
    ~ ! [X0,X1] :
        ( ! [X2] : q(f(X2))
       => ? [X3,X4] :
            ( ( p(f(X4))
             => ( p(X3)
                & ( r(X4)
                 => ( r(X0)
                    & r(X1) ) ) ) )
            & q(X3) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ? [X0,X1] :
      ( ! [X3,X4] :
          ( ( ( ~ p(X3)
              | ( ( ~ r(X0)
                  | ~ r(X1) )
                & r(X4) ) )
            & p(f(X4)) )
          | ~ q(X3) )
      & ! [X2] : q(f(X2)) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ? [X0,X1] :
      ( ! [X2,X3] :
          ( ( ( ~ p(X2)
              | ( ( ~ r(X0)
                  | ~ r(X1) )
                & r(X3) ) )
            & p(f(X3)) )
          | ~ q(X2) )
      & ! [X4] : q(f(X4)) ),
    inference(rectify,[],[f3]) ).

fof(f5,plain,
    ( ! [X2,X3] :
        ( ( ( ~ p(X2)
            | ( ( ~ r(sK0)
                | ~ r(sK1) )
              & r(X3) ) )
          & p(f(X3)) )
        | ~ q(X2) )
    & ! [X4] : q(f(X4)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f4]) ).

fof(f6,plain,
    ! [X4] : q(f(X4)),
    inference(cnf_transformation,[],[f5]) ).

fof(f7,plain,
    ! [X2,X3] :
      ( p(f(X3))
      | ~ q(X2) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f8,plain,
    ! [X2,X3] :
      ( r(X3)
      | ~ p(X2)
      | ~ q(X2) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f9,plain,
    ! [X2] :
      ( ~ p(X2)
      | ~ r(sK0)
      | ~ r(sK1)
      | ~ q(X2) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f10,plain,
    ! [X2] :
      ( ~ p(X2)
      | ~ r(sK1)
      | ~ q(X2) ),
    inference(forward_subsumption_resolution,[],[f9,f8]) ).

fof(f11,plain,
    ! [X2] :
      ( ~ p(X2)
      | ~ q(X2) ),
    inference(forward_subsumption_resolution,[],[f10,f8]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( ~ q(f(X0))
      | ~ q(X1) ),
    inference(resolution,[],[f11,f7]) ).

fof(f13,plain,
    ! [X1] : ~ q(X1),
    inference(forward_subsumption_resolution,[],[f12,f6]) ).

fof(f14,plain,
    $false,
    inference(resolution,[],[f13,f6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN940+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.19  % Computer : n009.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Mon Sep 28 17:14:15 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
% 3.63/1.29  % (3224290)Detected formulas, will run a generic FOF schedule.
% 3.63/1.29  % (3224296)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=3767010658:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.63/1.29  % (3224299)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1583998240:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.63/1.29  % (3224301)dis-21_1_sil=8000:lcm=predicate:random_seed=4141741354: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.63/1.29  % (3224298)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1742826539:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.63/1.29  % (3224300)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1827602719:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.63/1.29  % (3224295)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=1728290642:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.63/1.29  % (3224297)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=597920579:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.63/1.29  % (3224299)First to succeed.
% 3.63/1.29  % (3224299)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3224290"
% 3.63/1.29  % (3224301)Also succeeded, but the first one will report.
% 3.63/1.29  % (3224300)Also succeeded, but the first one will report.
% 3.63/1.29  % (3224298)Also succeeded, but the first one will report.
% 3.63/1.29  % (3224299)Refutation found. Thanks to Tanya!
% 3.63/1.29  % SZS status Theorem for theBenchmark
% 3.63/1.29  % SZS output start Proof for theBenchmark
% See solution above
% 3.63/1.29  % (3224299)------------------------------
% 3.63/1.29  % (3224299)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.63/1.29  % (3224299)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.63/1.29  % (3224299)CaDiCaL version: 2.1.3
% 3.63/1.29  % (3224299)Termination reason: Refutation
% 3.63/1.29  % (3224299)Time elapsed: 0.002 s
% 3.63/1.29  % (3224299)Peak memory usage: 88 MB
% 3.63/1.29  % (3224299)------------------------------
% 3.63/1.29  % (3224299)------------------------------
% 3.63/1.29  % (3224290)Success in time 0.429 s
% 3.63/1.29  % Vampire exiting
%------------------------------------------------------------------------------