↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : NLP265_17 : TPTP v9.3.1. Released v8.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/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 12:08:16 PM UTC 2026

% Result   : Theorem 0.17s 1.50s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   12 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   32 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   17 (   6   ~;   2   |;   4   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :    9 (   9 fml;   0 var)
%            Number of types       :    4 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   2 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-1 aty)
%            Number of variables   :   14 (  12   !;   2   ?;  14   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    '$ki_world': $tType ).

tff(type_def_6,type,
    '$ki_index': $tType ).

tff(func_def_0,type,
    '$ki_local_world': '$ki_world' ).

tff(func_def_1,type,
    '#idx(b_alice)': '$ki_index' ).

tff(func_def_2,type,
    '#idx(b_bob)': '$ki_index' ).

tff(func_def_3,type,
    '#idx(i_bob)': '$ki_index' ).

tff(func_def_4,type,
    '#idx(i_alice)': '$ki_index' ).

tff(func_def_6,type,
    sK0: '$ki_world' ).

tff(func_def_7,type,
    sK1: '$ki_world' ).

tff(func_def_8,type,
    sK2: '$ki_world' > '$ki_world' ).

tff(func_def_9,type,
    sK3: '$ki_world' > '$ki_world' ).

tff(pred_def_1,type,
    '$ki_accessible': ( '$ki_index' * '$ki_world' * '$ki_world' ) > $o ).

tff(pred_def_2,type,
    bigcity: ( '$ki_world' * $i ) > $o ).

tff(f1,axiom,
    ! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_alice)',X0,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','mrel_universal_#idx(b_alice)') ).

tff(f7,axiom,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0)
     => bigcity(X0,portland) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

tff(f9,conjecture,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('#idx(i_alice)','$ki_local_world',X0)
     => ! [X1: '$ki_world'] :
          ( '$ki_accessible'('#idx(b_bob)',X0,X1)
         => bigcity(X1,portland) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).

tff(f10,negated_conjecture,
    ~ ! [X0: '$ki_world'] :
        ( '$ki_accessible'('#idx(i_alice)','$ki_local_world',X0)
       => ! [X1: '$ki_world'] :
            ( '$ki_accessible'('#idx(b_bob)',X0,X1)
           => bigcity(X1,portland) ) ),
    inference(negated_conjecture,[status(cth)],[f9]) ).

tff(f12,plain,
    ? [X0: '$ki_world'] :
      ( ? [X1: '$ki_world'] :
          ( ~ bigcity(X1,portland)
          & '$ki_accessible'('#idx(b_bob)',X0,X1) )
      & '$ki_accessible'('#idx(i_alice)','$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f10]) ).

tff(f14,plain,
    ! [X0: '$ki_world'] :
      ( bigcity(X0,portland)
      | ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f7]) ).

tff(f17,plain,
    ( ~ bigcity(sK1,portland)
    & '$ki_accessible'('#idx(b_bob)',sK0,sK1)
    & '$ki_accessible'('#idx(i_alice)','$ki_local_world',sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f12]) ).

tff(f22,plain,
    ~ bigcity(sK1,portland),
    inference(cnf_transformation,[],[f17]) ).

tff(f24,plain,
    ! [X0: '$ki_world'] :
      ( bigcity(X0,portland)
      | ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0) ),
    inference(cnf_transformation,[],[f14]) ).

tff(f30,plain,
    ! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_alice)',X0,X1),
    inference(cnf_transformation,[],[f1]) ).

tff(f31,plain,
    ! [X0: '$ki_world'] : bigcity(X0,portland),
    inference(forward_subsumption_resolution,[],[f24,f30]) ).

tff(f32,plain,
    $false,
    inference(resolution,[],[f31,f22]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NLP265_17 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.40  % Computer : n009.cluster.edu
% 0.12/0.40  % Model    : x86_64 x86_64
% 0.12/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40  % Memory   : 8046.5625MB
% 0.12/0.40  % OS       : Linux 6.8.0-71-generic
% 0.12/0.40  % CPULimit : 300
% 0.12/0.40  % WCLimit  : 300
% 0.12/0.40  % DateTime : Sun Sep 27 18:38:15 UTC 2026
% 0.12/0.41  % CPUTime  : 
% 0.12/0.41  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43  Running first-order theorem proving
% 0.12/0.43  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.17/1.50  % (2320483)Detected formulas, will run a generic FOF schedule.
% 0.17/1.50  % (2320491)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3048138013:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.17/1.50  % (2320491)Refutation not found, incomplete strategy
% 0.17/1.50  % (2320491)------------------------------
% 0.17/1.50  % (2320491)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/1.50  % (2320491)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/1.50  % (2320491)CaDiCaL version: 2.1.3
% 0.17/1.50  % (2320491)Termination reason: Refutation not found, incomplete strategy
% 0.17/1.50  % (2320491)Time elapsed: 0.001 s
% 0.17/1.50  % (2320491)Peak memory usage: 87 MB
% 0.17/1.50  % (2320491)Instructions burned: 1 (million)
% 0.17/1.50  % (2320494)dis-21_1_sil=8000:lcm=predicate:random_seed=463079971: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.17/1.50  % (2320489)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=2959310132:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.17/1.50  % (2320492)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3591254977:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.17/1.50  % (2320488)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=546715927:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.17/1.50  % (2320490)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=1077072998:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.17/1.50  % (2320493)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=239866770:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.17/1.50  % (2320492)First to succeed.
% 0.17/1.50  % (2320494)Also succeeded, but the first one will report.
% 0.17/1.50  % (2320493)Also succeeded, but the first one will report.
% 0.17/1.50  % (2320492)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2320483"
% 0.17/1.50  % (2320491)------------------------------
% 0.17/1.50  % (2320491)------------------------------
% 0.17/1.50  % (2320502)lrs+10_1_sil=8000:sp=occurrence:random_seed=3466117208:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 0.17/1.50  % (2320502)Also succeeded, but the first one will report.
% 0.17/1.50  % (2320492)Refutation found. Thanks to Tanya!
% 0.17/1.50  % SZS status Theorem for theBenchmark
% 0.17/1.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/1.50  % (2320492)------------------------------
% 0.17/1.50  % (2320492)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/1.50  % (2320492)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/1.50  % (2320492)CaDiCaL version: 2.1.3
% 0.17/1.50  % (2320492)Termination reason: Refutation
% 0.17/1.50  % (2320492)Time elapsed: 0.002 s
% 0.17/1.50  % (2320492)Peak memory usage: 88 MB
% 0.17/1.50  % (2320492)Instructions burned: 1 (million)
% 0.17/1.50  % (2320492)------------------------------
% 0.17/1.50  % (2320492)------------------------------
% 0.17/1.50  % (2320483)Success in time 0.435 s
% 0.17/1.50  % Vampire exiting
%------------------------------------------------------------------------------