↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n003.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 01:49:07 PM UTC 2026

% Result   : Theorem 3.61s 1.27s
% Output   : Refutation 3.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   5 unt;   0 def)
%            Number of atoms       :   54 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   60 (  20   ~;  11   |;  20   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :   54 (  39   !;  15   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ! [X0,X1] :
      ? [X2] :
      ! [X3] :
        ( ( big_p(X0)
          & big_q(X1) )
       => ( big_r(X2)
          & big_s(X3) ) )
   => ? [X4,X5] :
        ( ( big_p(X4)
          & big_q(X5) )
       => ? [X6] : big_r(X6) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel20) ).

fof(f2,negated_conjecture,
    ~ ( ! [X0,X1] :
        ? [X2] :
        ! [X3] :
          ( ( big_p(X0)
            & big_q(X1) )
         => ( big_r(X2)
            & big_s(X3) ) )
     => ? [X4,X5] :
          ( ( big_p(X4)
            & big_q(X5) )
         => ? [X6] : big_r(X6) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ~ ( ! [X0,X1] :
        ? [X2] :
        ! [X3] :
          ( ( big_p(X0)
            & big_q(X1) )
         => big_r(X2) )
     => ? [X4,X5] :
          ( ( big_p(X4)
            & big_q(X5) )
         => ? [X6] : big_r(X6) ) ),
    inference(pure_predicate_removal,[],[f2]) ).

fof(f4,plain,
    ( ! [X4,X5] :
        ( ! [X6] : ~ big_r(X6)
        & big_p(X4)
        & big_q(X5) )
    & ! [X0,X1] :
      ? [X2] :
      ! [X3] :
        ( big_r(X2)
        | ~ big_p(X0)
        | ~ big_q(X1) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f5,plain,
    ( ! [X4,X5] :
        ( ! [X6] : ~ big_r(X6)
        & big_p(X4)
        & big_q(X5) )
    & ! [X0,X1] :
      ? [X2] :
      ! [X3] :
        ( big_r(X2)
        | ~ big_p(X0)
        | ~ big_q(X1) ) ),
    inference(flattening,[],[f4]) ).

fof(f6,plain,
    ( ! [X0,X1] :
        ( ! [X2] : ~ big_r(X2)
        & big_p(X0)
        & big_q(X1) )
    & ! [X3,X4] :
      ? [X5] :
        ( big_r(X5)
        | ~ big_p(X3)
        | ~ big_q(X4) ) ),
    inference(rectify,[],[f5]) ).

fof(f7,plain,
    ( ! [X0,X1] :
        ( ! [X2] : ~ big_r(X2)
        & big_p(X0)
        & big_q(X1) )
    & ! [X3,X4] :
        ( big_r(sK0(X3,X4))
        | ~ big_p(X3)
        | ~ big_q(X4) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X5,sK0(X3,X4))],[f6]) ).

fof(f8,plain,
    ! [X3,X4] :
      ( big_r(sK0(X3,X4))
      | ~ big_p(X3)
      | ~ big_q(X4) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f9,plain,
    ! [X1] : big_q(X1),
    inference(cnf_transformation,[],[f7]) ).

fof(f10,plain,
    ! [X0] : big_p(X0),
    inference(cnf_transformation,[],[f7]) ).

fof(f11,plain,
    ! [X2] : ~ big_r(X2),
    inference(cnf_transformation,[],[f7]) ).

fof(f12,plain,
    ! [X3,X4] :
      ( ~ big_p(X3)
      | ~ big_q(X4) ),
    inference(forward_subsumption_resolution,[],[f8,f11]) ).

fof(f13,plain,
    ! [X4] : ~ big_q(X4),
    inference(forward_subsumption_resolution,[],[f12,f10]) ).

fof(f14,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f13,f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN050+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18  % Computer : n003.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Mon Sep 28 15:28:27 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.21  Running first-order theorem proving
% 0.07/0.21  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.61/1.27  % (1699955)Detected formulas, will run a generic FOF schedule.
% 3.61/1.27  % (1699962)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=4196794390:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.61/1.27  % (1699965)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1871934217:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.61/1.27  % (1699963)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1231254305:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.61/1.27  % (1699961)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=2261615954:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.61/1.27  % (1699960)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=2144311742:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.61/1.27  % (1699964)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2441016262:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.61/1.27  % (1699966)dis-21_1_sil=8000:lcm=predicate:random_seed=336689096: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.61/1.27  % (1699965)Also succeeded, but the first one will report.
% 3.61/1.27  % (1699964)First to succeed.
% 3.61/1.27  % (1699963)Also succeeded, but the first one will report.
% 3.61/1.27  % (1699966)Also succeeded, but the first one will report.
% 3.61/1.27  % (1699964)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1699955"
% 3.61/1.27  % (1699964)Refutation found. Thanks to Tanya!
% 3.61/1.27  % SZS status Theorem for theBenchmark
% 3.61/1.27  % SZS output start Proof for theBenchmark
% See solution above
% 3.61/1.27  % (1699964)------------------------------
% 3.61/1.27  % (1699964)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.27  % (1699964)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.27  % (1699964)CaDiCaL version: 2.1.3
% 3.61/1.27  % (1699964)Termination reason: Refutation
% 3.61/1.27  % (1699964)Time elapsed: 0.001 s
% 3.61/1.27  % (1699964)Peak memory usage: 88 MB
% 3.61/1.27  % (1699964)------------------------------
% 3.61/1.27  % (1699964)------------------------------
% 3.61/1.27  % (1699955)Success in time 0.43 s
% 3.61/1.27  % Vampire exiting
%------------------------------------------------------------------------------