↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWV385+1 : 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 : n026.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:09:05 PM UTC 2026

% Result   : Theorem 0.21s 1.20s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   32 (  10 unt;   2 def)
%            Number of atoms       :   68 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   73 (  37   ~;  24   |;   6   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-3 aty)
%            Number of variables   :   33 (   0 sgn  27   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f42,axiom,
    ! [X0,X1,X2] :
      ( ~ ok(triple(X0,X1,X2))
     => ~ ok(im_succ_cpq(triple(X0,X1,X2))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l21_li1316) ).

fof(f43,axiom,
    ! [X0,X1,X2] :
      ( ~ check_cpq(triple(X0,X1,X2))
     => ( ~ check_cpq(im_succ_cpq(triple(X0,X1,X2)))
        | ~ ok(im_succ_cpq(triple(X0,X1,X2))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l21_li2225) ).

fof(f44,conjecture,
    ! [X0,X1,X2] :
      ( ( ~ check_cpq(triple(X0,X1,X2))
        | ~ ok(triple(X0,X1,X2)) )
     => ( ~ check_cpq(im_succ_cpq(triple(X0,X1,X2)))
        | ~ ok(im_succ_cpq(triple(X0,X1,X2))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l21_co) ).

fof(f45,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( ~ check_cpq(triple(X0,X1,X2))
          | ~ ok(triple(X0,X1,X2)) )
       => ( ~ check_cpq(im_succ_cpq(triple(X0,X1,X2)))
          | ~ ok(im_succ_cpq(triple(X0,X1,X2))) ) ),
    inference(negated_conjecture,[status(cth)],[f44]) ).

fof(f52,plain,
    ! [X0,X1,X2] :
      ( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
      | ok(triple(X0,X1,X2)) ),
    inference(ennf_transformation,[],[f42]) ).

fof(f53,plain,
    ! [X0,X1,X2] :
      ( ~ check_cpq(im_succ_cpq(triple(X0,X1,X2)))
      | ~ ok(im_succ_cpq(triple(X0,X1,X2)))
      | check_cpq(triple(X0,X1,X2)) ),
    inference(ennf_transformation,[],[f43]) ).

fof(f54,plain,
    ! [X0,X1,X2] :
      ( ~ check_cpq(im_succ_cpq(triple(X0,X1,X2)))
      | ~ ok(im_succ_cpq(triple(X0,X1,X2)))
      | check_cpq(triple(X0,X1,X2)) ),
    inference(flattening,[],[f53]) ).

fof(f55,plain,
    ? [X0,X1,X2] :
      ( check_cpq(im_succ_cpq(triple(X0,X1,X2)))
      & ok(im_succ_cpq(triple(X0,X1,X2)))
      & ( ~ check_cpq(triple(X0,X1,X2))
        | ~ ok(triple(X0,X1,X2)) ) ),
    inference(ennf_transformation,[],[f45]) ).

fof(f56,plain,
    ? [X0,X1,X2] :
      ( check_cpq(im_succ_cpq(triple(X0,X1,X2)))
      & ok(im_succ_cpq(triple(X0,X1,X2)))
      & ( ~ check_cpq(triple(X0,X1,X2))
        | ~ ok(triple(X0,X1,X2)) ) ),
    inference(flattening,[],[f55]) ).

fof(f58,plain,
    ( check_cpq(im_succ_cpq(triple(sK0,sK1,sK2)))
    & ok(im_succ_cpq(triple(sK0,sK1,sK2)))
    & ( ~ check_cpq(triple(sK0,sK1,sK2))
      | ~ ok(triple(sK0,sK1,sK2)) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f56]) ).

fof(f59,plain,
    ! [X2,X0,X1] :
      ( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
      | ok(triple(X0,X1,X2)) ),
    inference(cnf_transformation,[],[f52]) ).

fof(f60,plain,
    ! [X2,X0,X1] :
      ( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
      | ~ check_cpq(im_succ_cpq(triple(X0,X1,X2)))
      | check_cpq(triple(X0,X1,X2)) ),
    inference(cnf_transformation,[],[f54]) ).

fof(f61,plain,
    ( ~ check_cpq(triple(sK0,sK1,sK2))
    | ~ ok(triple(sK0,sK1,sK2)) ),
    inference(cnf_transformation,[],[f58]) ).

fof(f62,plain,
    ok(im_succ_cpq(triple(sK0,sK1,sK2))),
    inference(cnf_transformation,[],[f58]) ).

fof(f63,plain,
    check_cpq(im_succ_cpq(triple(sK0,sK1,sK2))),
    inference(cnf_transformation,[],[f58]) ).

fof(f68,definition,
    ( spl3_1
  <=> ok(triple(sK0,sK1,sK2)) ),
    introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).

fof(f70,plain,
    ( ~ ok(triple(sK0,sK1,sK2))
    | spl3_1 ),
    inference(avatar_component_clause,[],[f68]) ).

fof(f72,definition,
    ( spl3_2
  <=> check_cpq(triple(sK0,sK1,sK2)) ),
    introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).

fof(f74,plain,
    ( ~ check_cpq(triple(sK0,sK1,sK2))
    | spl3_2 ),
    inference(avatar_component_clause,[],[f72]) ).

fof(f75,plain,
    ( ~ spl3_1
    | ~ spl3_2 ),
    inference(avatar_split_clause,[],[f61,f72,f68]) ).

fof(f80,plain,
    ok(triple(sK0,sK1,sK2)),
    inference(resolution,[],[f59,f62]) ).

fof(f84,plain,
    ( $false
    | spl3_1 ),
    inference(forward_subsumption_resolution,[],[f80,f70]) ).

fof(f85,plain,
    spl3_1,
    inference(avatar_contradiction_clause,[],[f84]) ).

fof(f86,plain,
    ( ~ check_cpq(im_succ_cpq(triple(sK0,sK1,sK2)))
    | check_cpq(triple(sK0,sK1,sK2)) ),
    inference(resolution,[],[f60,f62]) ).

fof(f87,plain,
    check_cpq(triple(sK0,sK1,sK2)),
    inference(forward_subsumption_resolution,[],[f86,f63]) ).

fof(f88,plain,
    ( $false
    | spl3_2 ),
    inference(forward_subsumption_resolution,[],[f87,f74]) ).

fof(f89,plain,
    spl3_2,
    inference(avatar_contradiction_clause,[],[f88]) ).

cnf(s1,plain,
    ( ~ spl3_1
    | ~ spl3_2 ),
    inference(sat_conversion,[],[f75]) ).

cnf(s3,plain,
    spl3_1,
    inference(sat_conversion,[],[f85]) ).

cnf(s4,plain,
    spl3_2,
    inference(sat_conversion,[],[f89]) ).

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

fof(f90,plain,
    $false,
    inference(avatar_sat_refutation,[],[s5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV385+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20  % Computer : n026.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 10:50:41 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.24  Running first-order theorem proving
% 0.09/0.24  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
% 0.21/1.20  % (3776436)Detected formulas, will run a generic FOF schedule.
% 0.21/1.20  % (3776540)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2282863796:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.21/1.20  % (3776540)First to succeed.
% 0.21/1.20  % (3776540)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3776436"
% 0.21/1.20  % (3776536)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=102974327:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.21/1.20  % (3776538)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=432095325:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.21/1.20  % (3776534)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=4262446502:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.21/1.20  % (3776542)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4282632035:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.21/1.20  % (3776541)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4121134636:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.21/1.20  % (3776541)Also succeeded, but the first one will report.
% 0.21/1.20  % (3776542)Also succeeded, but the first one will report.
% 0.21/1.20  % (3776543)dis-21_1_sil=8000:lcm=predicate:random_seed=3362559723: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)
% 0.21/1.20  % (3776543)Also succeeded, but the first one will report.
% 0.21/1.20  % (3776540)Refutation found. Thanks to Tanya!
% 0.21/1.20  % SZS status Theorem for theBenchmark
% 0.21/1.20  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/1.20  % (3776540)------------------------------
% 0.21/1.20  % (3776540)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.21/1.20  % (3776540)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/1.20  % (3776540)CaDiCaL version: 2.1.3
% 0.21/1.20  % (3776540)Termination reason: Refutation
% 0.21/1.20  % (3776540)Time elapsed: 0.002 s
% 0.21/1.20  % (3776540)Peak memory usage: 89 MB
% 0.21/1.20  % (3776540)Instructions burned: 2 (million)
% 0.21/1.20  % (3776540)------------------------------
% 0.21/1.20  % (3776540)------------------------------
% 0.21/1.20  % (3776436)Success in time 0.291 s
% 0.21/1.20  % Vampire exiting
%------------------------------------------------------------------------------