↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

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

% Computer : n013.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 02:32:50 PM UTC 2026

% Result   : Theorem 0.11s 0.25s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   19 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   67 (   0 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   63 (  22   ~;  15   |;  16   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :    7 (   7 fml;   0 var)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   2 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   37 (  27   !;  10   ?;  37   :)

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

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

tff(func_def_1,type,
    sK0: '$ki_world' > '$ki_world' ).

tff(func_def_2,type,
    sK1: '$ki_world' > $i ).

tff(func_def_4,type,
    sK3: '$ki_world' ).

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

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

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

tff(f2,axiom,
    ! [X0: '$ki_world',X1: '$ki_world',X2: $i] :
      ( ( '$ki_exists_in_world_$i'(X0,X2)
        & '$ki_accessible'(X0,X1) )
     => '$ki_exists_in_world_$i'(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','$ki_exists_in_world_$i_cumul') ).

tff(f4,conjecture,
    ( ? [X0: '$ki_world'] :
        ( '$ki_accessible'('$ki_local_world',X0)
        & ! [X1: $i] :
            ( '$ki_exists_in_world_$i'(X0,X1)
           => f(X0,X1) ) )
   => ! [X1: $i] :
        ( '$ki_exists_in_world_$i'('$ki_local_world',X1)
       => ? [X0: '$ki_world'] :
            ( '$ki_accessible'('$ki_local_world',X0)
            & f(X0,X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).

tff(f5,negated_conjecture,
    ~ ( ? [X0: '$ki_world'] :
          ( '$ki_accessible'('$ki_local_world',X0)
          & ! [X1: $i] :
              ( '$ki_exists_in_world_$i'(X0,X1)
             => f(X0,X1) ) )
     => ! [X1: $i] :
          ( '$ki_exists_in_world_$i'('$ki_local_world',X1)
         => ? [X0: '$ki_world'] :
              ( '$ki_accessible'('$ki_local_world',X0)
              & f(X0,X1) ) ) ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

tff(f6,plain,
    ~ ( ? [X0: '$ki_world'] :
          ( '$ki_accessible'('$ki_local_world',X0)
          & ! [X1: $i] :
              ( '$ki_exists_in_world_$i'(X0,X1)
             => f(X0,X1) ) )
     => ! [X2: $i] :
          ( '$ki_exists_in_world_$i'('$ki_local_world',X2)
         => ? [X3: '$ki_world'] :
              ( '$ki_accessible'('$ki_local_world',X3)
              & f(X3,X2) ) ) ),
    inference(rectify,[],[f5]) ).

tff(f7,plain,
    ! [X0: '$ki_world',X1: '$ki_world',X2: $i] :
      ( '$ki_exists_in_world_$i'(X1,X2)
      | ~ '$ki_exists_in_world_$i'(X0,X2)
      | ~ '$ki_accessible'(X0,X1) ),
    inference(ennf_transformation,[],[f2]) ).

tff(f8,plain,
    ! [X0: '$ki_world',X1: '$ki_world',X2: $i] :
      ( '$ki_exists_in_world_$i'(X1,X2)
      | ~ '$ki_exists_in_world_$i'(X0,X2)
      | ~ '$ki_accessible'(X0,X1) ),
    inference(flattening,[],[f7]) ).

tff(f9,plain,
    ( ? [X2: $i] :
        ( ! [X3: '$ki_world'] :
            ( ~ '$ki_accessible'('$ki_local_world',X3)
            | ~ f(X3,X2) )
        & '$ki_exists_in_world_$i'('$ki_local_world',X2) )
    & ? [X0: '$ki_world'] :
        ( '$ki_accessible'('$ki_local_world',X0)
        & ! [X1: $i] :
            ( f(X0,X1)
            | ~ '$ki_exists_in_world_$i'(X0,X1) ) ) ),
    inference(ennf_transformation,[],[f6]) ).

tff(f12,plain,
    ( ? [X0: $i] :
        ( ! [X1: '$ki_world'] :
            ( ~ '$ki_accessible'('$ki_local_world',X1)
            | ~ f(X1,X0) )
        & '$ki_exists_in_world_$i'('$ki_local_world',X0) )
    & ? [X2: '$ki_world'] :
        ( '$ki_accessible'('$ki_local_world',X2)
        & ! [X3: $i] :
            ( f(X2,X3)
            | ~ '$ki_exists_in_world_$i'(X2,X3) ) ) ),
    inference(rectify,[],[f9]) ).

tff(f13,plain,
    ( ! [X1: '$ki_world'] :
        ( ~ '$ki_accessible'('$ki_local_world',X1)
        | ~ f(X1,sK2) )
    & '$ki_exists_in_world_$i'('$ki_local_world',sK2)
    & '$ki_accessible'('$ki_local_world',sK3)
    & ! [X3: $i] :
        ( f(sK3,X3)
        | ~ '$ki_exists_in_world_$i'(sK3,X3) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X2,sK3)],[f12]) ).

tff(f15,plain,
    ! [X2: $i,X0: '$ki_world',X1: '$ki_world'] :
      ( ~ '$ki_exists_in_world_$i'(X0,X2)
      | '$ki_exists_in_world_$i'(X1,X2)
      | ~ '$ki_accessible'(X0,X1) ),
    inference(cnf_transformation,[],[f8]) ).

tff(f17,plain,
    ! [X3: $i] :
      ( ~ '$ki_exists_in_world_$i'(sK3,X3)
      | f(sK3,X3) ),
    inference(cnf_transformation,[],[f13]) ).

tff(f18,plain,
    '$ki_accessible'('$ki_local_world',sK3),
    inference(cnf_transformation,[],[f13]) ).

tff(f19,plain,
    '$ki_exists_in_world_$i'('$ki_local_world',sK2),
    inference(cnf_transformation,[],[f13]) ).

tff(f20,plain,
    ! [X1: '$ki_world'] :
      ( ~ f(X1,sK2)
      | ~ '$ki_accessible'('$ki_local_world',X1) ),
    inference(cnf_transformation,[],[f13]) ).

tff(f22,plain,
    ! [X0: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X0)
      | '$ki_exists_in_world_$i'(X0,sK2) ),
    inference(resolution,[],[f15,f19]) ).

tff(f24,plain,
    '$ki_exists_in_world_$i'(sK3,sK2),
    inference(resolution,[],[f22,f18]) ).

tff(f28,plain,
    f(sK3,sK2),
    inference(resolution,[],[f24,f17]) ).

tff(f31,plain,
    ~ '$ki_accessible'('$ki_local_world',sK3),
    inference(resolution,[],[f28,f20]) ).

tff(f32,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f31,f18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO892_15 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.17  % Computer : n013.cluster.edu
% 0.11/0.17  % Model    : x86_64 x86_64
% 0.11/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.17  % Memory   : 8046.5625MB
% 0.11/0.17  % OS       : Linux 6.8.0-71-generic
% 0.11/0.17  % CPULimit : 300
% 0.11/0.17  % WCLimit  : 300
% 0.11/0.17  % DateTime : Mon Sep 28 18:39:21 UTC 2026
% 0.11/0.17  % CPUTime  : 
% 0.11/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.21  Running first-order model finding
% 0.11/0.21  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.25  % (1421888)Will run a generic schedule for satisfiability detection.
% 0.11/0.25  % (1421898)% WARNING: option uhcvi not known.
% 0.11/0.25  % (1421900)dis+10_1_sil=32000:sp=arity:random_seed=1064157314:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.25  % (1421898)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=55204564:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.25  % (1421900) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1421888-1421900"...
% 0.11/0.25  % (1421902)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4140259247:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.25  % (1421897)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2685345609_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.25  % (1421900)...printing done.
% 0.11/0.25  % (1421902) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1421888-1421902"...
% 0.11/0.25  % (1421898) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1421888-1421898"...
% 0.11/0.25  % TRYING [1]
% 0.11/0.25  % TRYING [2]
% 0.11/0.25  % (1421900)Refutation found. Thanks to Tanya!
% 0.11/0.25  % SZS status Theorem for theBenchmark
% 0.11/0.25  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.25  % (1421900)------------------------------
% 0.11/0.25  % (1421900)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.25  % (1421900)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.25  % (1421900)CaDiCaL version: 2.1.3
% 0.11/0.25  % (1421900)Termination reason: Refutation
% 0.11/0.25  % (1421900)Time elapsed: 0.002 s
% 0.11/0.25  % (1421900)Peak memory usage: 11 MB
% 0.11/0.25  % (1421900)Instructions burned: 1 (million)
% 0.11/0.25  % (1421888)Success in time 0.036 s
% 0.11/0.25  % Vampire exiting
%------------------------------------------------------------------------------