↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n014.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:18 PM UTC 2026

% Result   : Theorem 2.07s 0.99s
% Output   : Refutation 2.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   71 (   0 equ)
%            Maximal formula atoms :    4 (   3 avg)
%            Number of connectives :   46 (  21   ~;  16   |;   3   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   26 (  26 fml;   0 var)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   7 usr;   4 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   15 (  14   !;   1   ?;  15   :)

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

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

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

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

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

tff(pred_def_3,type,
    dest: ( '$ki_world' * $i ) > $o ).

tff(pred_def_4,type,
    class: ( '$ki_world' * $i ) > $o ).

tff(f3,axiom,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('$ki_local_world',X0)
     => ( ( dest(X0,paris)
          & class(X0,second) )
       => price(X0,seventy) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',law2) ).

tff(f6,axiom,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('$ki_local_world',X0)
     => dest(X0,paris) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',belief1) ).

tff(f7,axiom,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('$ki_local_world',X0)
     => class(X0,second) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',belief2) ).

tff(f8,conjecture,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('$ki_local_world',X0)
     => price(X0,seventy) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).

tff(f9,negated_conjecture,
    ~ ! [X0: '$ki_world'] :
        ( '$ki_accessible'('$ki_local_world',X0)
       => price(X0,seventy) ),
    inference(negated_conjecture,[status(cth)],[f8]) ).

tff(f12,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ dest(X0,paris)
      | ~ class(X0,second)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f13,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ dest(X0,paris)
      | ~ class(X0,second)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(flattening,[],[f12]) ).

tff(f18,plain,
    ! [X0: '$ki_world'] :
      ( dest(X0,paris)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f6]) ).

tff(f19,plain,
    ! [X0: '$ki_world'] :
      ( class(X0,second)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f7]) ).

tff(f20,plain,
    ? [X0: '$ki_world'] :
      ( ~ price(X0,seventy)
      & '$ki_accessible'('$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f9]) ).

tff(f21,plain,
    ( ~ price(sK0,seventy)
    & '$ki_accessible'('$ki_local_world',sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f20]) ).

tff(f24,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ dest(X0,paris)
      | ~ class(X0,second)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(cnf_transformation,[],[f13]) ).

tff(f27,plain,
    ! [X0: '$ki_world'] :
      ( dest(X0,paris)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(cnf_transformation,[],[f18]) ).

tff(f28,plain,
    ! [X0: '$ki_world'] :
      ( class(X0,second)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(cnf_transformation,[],[f19]) ).

tff(f29,plain,
    '$ki_accessible'('$ki_local_world',sK0),
    inference(cnf_transformation,[],[f21]) ).

tff(f30,plain,
    ~ price(sK0,seventy),
    inference(cnf_transformation,[],[f21]) ).

tff(f32,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ class(X0,second)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(forward_subsumption_resolution,[],[f24,f27]) ).

tff(f33,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(forward_subsumption_resolution,[],[f32,f28]) ).

tff(f34,plain,
    ~ '$ki_accessible'('$ki_local_world',sK0),
    inference(resolution,[],[f33,f30]) ).

tff(f35,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f34,f29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NLP267_2 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.04  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n014.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sun Sep 27 18:39:01 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.39  Running first-order theorem proving
% 0.10/0.39  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.07/0.99  % (1094623)Detected formulas, will run a generic FOF schedule.
% 2.07/0.99  % (1094633)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4261226124:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.07/0.99  % (1094633)First to succeed.
% 2.07/0.99  % (1094633)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1094623"
% 2.07/0.99  % (1094629)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=2539889763:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.07/0.99  % (1094632)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1321053272:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.07/0.99  % (1094634)dis-21_1_sil=8000:lcm=predicate:random_seed=3193908649: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.07/0.99  % (1094630)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=1325870441:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.07/0.99  % (1094628)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=4270639624:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.07/0.99  % (1094631)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4267006955:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.07/0.99  % (1094631)Refutation not found, incomplete strategy
% 2.07/0.99  % (1094631)------------------------------
% 2.07/0.99  % (1094631)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.07/0.99  % (1094631)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.07/0.99  % (1094631)CaDiCaL version: 2.1.3
% 2.07/0.99  % (1094631)Termination reason: Refutation not found, incomplete strategy
% 2.07/0.99  % (1094631)Time elapsed: 0.001 s
% 2.07/0.99  % (1094631)Peak memory usage: 87 MB
% 2.07/0.99  % (1094632)Also succeeded, but the first one will report.
% 2.07/0.99  % (1094634)Also succeeded, but the first one will report.
% 2.07/0.99  % (1094633)Refutation found. Thanks to Tanya!
% 2.07/0.99  % SZS status Theorem for theBenchmark
% 2.07/0.99  % SZS output start Proof for theBenchmark
% See solution above
% 2.07/0.99  % (1094633)------------------------------
% 2.07/0.99  % (1094633)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.07/0.99  % (1094633)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.07/0.99  % (1094633)CaDiCaL version: 2.1.3
% 2.07/0.99  % (1094633)Termination reason: Refutation
% 2.07/0.99  % (1094633)Time elapsed: 0.001 s
% 2.07/0.99  % (1094633)Peak memory usage: 88 MB
% 2.07/0.99  % (1094633)Instructions burned: 1 (million)
% 2.07/0.99  % (1094633)------------------------------
% 2.07/0.99  % (1094633)------------------------------
% 2.07/0.99  % (1094623)Success in time 0.306 s
% 2.07/0.99  % Vampire exiting
%------------------------------------------------------------------------------