↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n015.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:50:26 PM UTC 2026

% Result   : Theorem 2.38s 0.82s
% Output   : Refutation 2.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   23 (   7 unt;   2 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   46 (  20   ~;  12   |;   8   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   28 (   0 sgn  22   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ! [X0] : ~ big_r(X0,X0)
   => ? [X1,X2] :
        ( ~ big_r(X1,X2)
        & ( big_q(X2,X1)
         => ! [X3] : big_q(X3,X3) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2132) ).

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

fof(f3,plain,
    ( ! [X1,X2] :
        ( big_r(X1,X2)
        | ( ? [X3] : ~ big_q(X3,X3)
          & big_q(X2,X1) ) )
    & ! [X0] : ~ big_r(X0,X0) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ( ! [X0,X1] :
        ( big_r(X0,X1)
        | ( ? [X2] : ~ big_q(X2,X2)
          & big_q(X1,X0) ) )
    & ! [X3] : ~ big_r(X3,X3) ),
    inference(rectify,[],[f3]) ).

fof(f5,plain,
    ( ! [X0,X1] :
        ( big_r(X0,X1)
        | ( ~ big_q(sK0,sK0)
          & big_q(X1,X0) ) )
    & ! [X3] : ~ big_r(X3,X3) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0)],[f4]) ).

fof(f6,plain,
    ! [X3] : ~ big_r(X3,X3),
    inference(cnf_transformation,[],[f5]) ).

fof(f7,plain,
    ! [X0,X1] :
      ( big_q(X1,X0)
      | big_r(X0,X1) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f8,plain,
    ! [X0,X1] :
      ( big_r(X0,X1)
      | ~ big_q(sK0,sK0) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f10,definition,
    ( spl1_1
  <=> big_q(sK0,sK0) ),
    introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).

fof(f11,plain,
    ( ~ big_q(sK0,sK0)
    | spl1_1 ),
    inference(avatar_component_clause,[],[f10]) ).

fof(f13,definition,
    ( spl1_2
  <=> ! [X0,X1] : big_r(X0,X1) ),
    introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).

fof(f14,plain,
    ( ! [X0,X1] : big_r(X0,X1)
    | ~ spl1_2 ),
    inference(avatar_component_clause,[],[f13]) ).

fof(f15,plain,
    ( ~ spl1_1
    | spl1_2 ),
    inference(avatar_split_clause,[],[f8,f13,f10]) ).

fof(f16,plain,
    ( big_r(sK0,sK0)
    | spl1_1 ),
    inference(resolution,[],[f7,f11]) ).

fof(f17,plain,
    ( $false
    | spl1_1 ),
    inference(resolution,[],[f16,f6]) ).

fof(f18,plain,
    spl1_1,
    inference(avatar_contradiction_clause,[],[f17]) ).

fof(f19,plain,
    ( $false
    | ~ spl1_2 ),
    inference(resolution,[],[f14,f6]) ).

fof(f20,plain,
    ~ spl1_2,
    inference(avatar_contradiction_clause,[],[f19]) ).

cnf(s1,plain,
    ( ~ spl1_1
    | spl1_2 ),
    inference(sat_conversion,[],[f15]) ).

cnf(s2,plain,
    spl1_1,
    inference(sat_conversion,[],[f18]) ).

cnf(s3,plain,
    ~ spl1_2,
    inference(sat_conversion,[],[f20]) ).

cnf(s4,plain,
    $false,
    inference(rat,[],[s1,s3,s2]) ).

fof(f21,plain,
    $false,
    inference(avatar_sat_refutation,[],[s4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN380+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.20  % Computer : n015.cluster.edu
% 0.09/0.20  % Model    : x86_64 x86_64
% 0.09/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20  % Memory   : 8046.5625MB
% 0.09/0.20  % OS       : Linux 6.8.0-71-generic
% 0.09/0.20  % CPULimit : 300
% 0.09/0.20  % WCLimit  : 300
% 0.09/0.20  % DateTime : Mon Sep 28 15:54:32 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23  Running first-order theorem proving
% 0.09/0.23  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.38/0.82  % (2745272)Detected formulas, will run a generic FOF schedule.
% 2.38/0.82  % (2745283)dis-21_1_sil=8000:lcm=predicate:random_seed=4289040247: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.38/0.82  % (2745283)First to succeed.
% 2.38/0.82  % (2745283)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2745272"
% 2.38/0.82  % (2745278)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=775965761:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.38/0.82  % (2745282)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=779272636:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.38/0.82  % (2745277)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=232961726:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.38/0.82  % (2745281)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2539690608:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.38/0.82  % (2745280)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1796528485:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.38/0.82  % (2745279)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=553543253:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.38/0.82  % (2745281)Also succeeded, but the first one will report.
% 2.38/0.82  % (2745280)Also succeeded, but the first one will report.
% 2.38/0.82  % (2745282)Also succeeded, but the first one will report.
% 2.38/0.82  % (2745283)Refutation found. Thanks to Tanya!
% 2.38/0.82  % SZS status Theorem for theBenchmark
% 2.38/0.82  % SZS output start Proof for theBenchmark
% See solution above
% 2.38/0.82  % (2745283)------------------------------
% 2.38/0.82  % (2745283)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.38/0.82  % (2745283)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.38/0.82  % (2745283)CaDiCaL version: 2.1.3
% 2.38/0.82  % (2745283)Termination reason: Refutation
% 2.38/0.82  % (2745283)Time elapsed: 0.001 s
% 2.38/0.82  % (2745283)Peak memory usage: 89 MB
% 2.38/0.82  % (2745283)------------------------------
% 2.38/0.82  % (2745283)------------------------------
% 2.38/0.82  % (2745272)Success in time 0.297 s
% 2.38/0.82  % Vampire exiting
%------------------------------------------------------------------------------