↑ 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  : PLA053_5 : 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 : n020.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:30:11 PM UTC 2026

% Result   : Theorem 0.23s 0.53s
% Output   : Refutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   44 (  12 unt;   0 typ;   3 def)
%            Number of atoms       :  138 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :  140 (  57   ~;  49   |;  21   &)
%                                         (   3 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of FOOLs       :   11 (  11 fml;   0 var)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   9 usr;   5 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   55 (   0 sgn  46   !;   9   ?;  55   :)

% 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' > $i ).

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

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

tff(func_def_5,type,
    sK4: '$ki_world' ).

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

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

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

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

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

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

tff(f2,axiom,
    ! [X0: '$ki_world',X1: $i] : '$ki_exists_in_world_$i'(X0,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','$ki_exists_in_world_$i_const') ).

tff(f6,axiom,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('$ki_local_world',X0)
     => ! [X1: $i] :
          ( '$ki_exists_in_world_$i'(X0,X1)
         => ? [X2: $i] :
              ( '$ki_exists_in_world_$i'(X0,X2)
              & ! [X3: '$ki_world'] :
                  ( '$ki_accessible'(X0,X3)
                 => ( ( bomb(X3,X1)
                      & h(X3,X2) )
                   => defused(X3,X1) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).

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

tff(f8,negated_conjecture,
    ~ ! [X0: '$ki_world'] :
        ( '$ki_accessible'('$ki_local_world',X0)
       => ! [X1: $i] :
            ( '$ki_exists_in_world_$i'(X0,X1)
           => ? [X2: $i] :
                ( '$ki_exists_in_world_$i'(X0,X2)
                & ( ( bomb(X0,X1)
                    & h(X0,X2) )
                 => defused(X0,X1) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f7]) ).

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

tff(f13,plain,
    ! [X0: '$ki_world'] :
      ( ! [X1: $i] :
          ( ? [X2: $i] :
              ( '$ki_exists_in_world_$i'(X0,X2)
              & ! [X3: '$ki_world'] :
                  ( defused(X3,X1)
                  | ~ bomb(X3,X1)
                  | ~ h(X3,X2)
                  | ~ '$ki_accessible'(X0,X3) ) )
          | ~ '$ki_exists_in_world_$i'(X0,X1) )
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(flattening,[],[f12]) ).

tff(f14,plain,
    ? [X0: '$ki_world'] :
      ( ? [X1: $i] :
          ( ! [X2: $i] :
              ( ~ '$ki_exists_in_world_$i'(X0,X2)
              | ( ~ defused(X0,X1)
                & bomb(X0,X1)
                & h(X0,X2) ) )
          & '$ki_exists_in_world_$i'(X0,X1) )
      & '$ki_accessible'('$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f8]) ).

tff(f15,plain,
    ? [X0: '$ki_world'] :
      ( ? [X1: $i] :
          ( ! [X2: $i] :
              ( ~ '$ki_exists_in_world_$i'(X0,X2)
              | ( ~ defused(X0,X1)
                & bomb(X0,X1)
                & h(X0,X2) ) )
          & '$ki_exists_in_world_$i'(X0,X1) )
      & '$ki_accessible'('$ki_local_world',X0) ),
    inference(flattening,[],[f14]) ).

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

tff(f20,plain,
    ( ! [X2: $i] :
        ( ~ '$ki_exists_in_world_$i'(sK4,X2)
        | ( ~ defused(sK4,sK5)
          & bomb(sK4,sK5)
          & h(sK4,X2) ) )
    & '$ki_exists_in_world_$i'(sK4,sK5)
    & '$ki_accessible'('$ki_local_world',sK4) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X0,sK4),skolemize(X1,sK5)],[f15]) ).

tff(f21,plain,
    ! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'(X0,X1),
    inference(cnf_transformation,[],[f1]) ).

tff(f22,plain,
    ! [X0: '$ki_world',X1: $i] : '$ki_exists_in_world_$i'(X0,X1),
    inference(cnf_transformation,[],[f2]) ).

tff(f28,plain,
    ! [X3: '$ki_world',X0: '$ki_world',X1: $i] :
      ( defused(X3,X1)
      | ~ bomb(X3,X1)
      | ~ h(X3,sK3(X0,X1))
      | ~ '$ki_accessible'(X0,X3)
      | ~ '$ki_exists_in_world_$i'(X0,X1)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(cnf_transformation,[],[f19]) ).

tff(f31,plain,
    '$ki_exists_in_world_$i'(sK4,sK5),
    inference(cnf_transformation,[],[f20]) ).

tff(f32,plain,
    ! [X2: $i] :
      ( ~ '$ki_exists_in_world_$i'(sK4,X2)
      | h(sK4,X2) ),
    inference(cnf_transformation,[],[f20]) ).

tff(f33,plain,
    ! [X2: $i] :
      ( ~ '$ki_exists_in_world_$i'(sK4,X2)
      | bomb(sK4,sK5) ),
    inference(cnf_transformation,[],[f20]) ).

tff(f34,plain,
    ! [X2: $i] :
      ( ~ '$ki_exists_in_world_$i'(sK4,X2)
      | ~ defused(sK4,sK5) ),
    inference(cnf_transformation,[],[f20]) ).

tff(f36,definition,
    ( spl6_1
  <=> bomb(sK4,sK5) ),
    introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).

tff(f38,plain,
    ( bomb(sK4,sK5)
    | ~ spl6_1 ),
    inference(avatar_component_clause,[],[f36]) ).

tff(f40,definition,
    ( spl6_2
  <=> ! [X2: $i] : ~ '$ki_exists_in_world_$i'(sK4,X2) ),
    introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).

tff(f41,plain,
    ( ! [X2: $i] : ~ '$ki_exists_in_world_$i'(sK4,X2)
    | ~ spl6_2 ),
    inference(avatar_component_clause,[],[f40]) ).

tff(f42,plain,
    ( spl6_1
    | spl6_2 ),
    inference(avatar_split_clause,[],[f33,f40,f36]) ).

tff(f44,definition,
    ( spl6_3
  <=> defused(sK4,sK5) ),
    introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).

tff(f46,plain,
    ( ~ defused(sK4,sK5)
    | spl6_3 ),
    inference(avatar_component_clause,[],[f44]) ).

tff(f47,plain,
    ( ~ spl6_3
    | spl6_2 ),
    inference(avatar_split_clause,[],[f34,f40,f44]) ).

tff(f48,plain,
    ( $false
    | ~ spl6_2 ),
    inference(resolution,[],[f41,f31]) ).

tff(f49,plain,
    ~ spl6_2,
    inference(avatar_contradiction_clause,[],[f48]) ).

tff(f51,plain,
    ! [X0: $i] : h(sK4,X0),
    inference(resolution,[],[f22,f32]) ).

tff(f60,plain,
    ! [X3: '$ki_world',X0: '$ki_world',X1: $i] :
      ( defused(X3,X1)
      | ~ bomb(X3,X1)
      | ~ h(X3,sK3(X0,X1))
      | ~ '$ki_accessible'(X0,X3)
      | ~ '$ki_exists_in_world_$i'(X0,X1) ),
    inference(forward_subsumption_resolution,[],[f28,f21]) ).

tff(f61,plain,
    ! [X3: '$ki_world',X0: '$ki_world',X1: $i] :
      ( defused(X3,X1)
      | ~ bomb(X3,X1)
      | ~ h(X3,sK3(X0,X1))
      | ~ '$ki_exists_in_world_$i'(X0,X1) ),
    inference(forward_subsumption_resolution,[],[f60,f21]) ).

tff(f62,plain,
    ! [X3: '$ki_world',X0: '$ki_world',X1: $i] :
      ( ~ h(X3,sK3(X0,X1))
      | ~ bomb(X3,X1)
      | defused(X3,X1) ),
    inference(forward_subsumption_resolution,[],[f61,f22]) ).

tff(f64,plain,
    ! [X0: $i] :
      ( ~ bomb(sK4,X0)
      | defused(sK4,X0) ),
    inference(resolution,[],[f62,f51]) ).

tff(f65,plain,
    ( defused(sK4,sK5)
    | ~ spl6_1 ),
    inference(resolution,[],[f64,f38]) ).

tff(f71,plain,
    ( $false
    | ~ spl6_1
    | spl6_3 ),
    inference(forward_subsumption_resolution,[],[f65,f46]) ).

tff(f72,plain,
    ( ~ spl6_1
    | spl6_3 ),
    inference(avatar_contradiction_clause,[],[f71]) ).

cnf(s1,plain,
    ( spl6_1
    | spl6_2 ),
    inference(sat_conversion,[],[f42]) ).

cnf(s2,plain,
    ( spl6_2
    | ~ spl6_3 ),
    inference(sat_conversion,[],[f47]) ).

cnf(s3,plain,
    ~ spl6_2,
    inference(sat_conversion,[],[f49]) ).

cnf(s5,plain,
    ( ~ spl6_1
    | spl6_3 ),
    inference(sat_conversion,[],[f72]) ).

cnf(s6,plain,
    ~ spl6_3,
    inference(rat,[],[s2,s3]) ).

cnf(s7,plain,
    ~ spl6_1,
    inference(rat,[],[s5,s6]) ).

cnf(s8,plain,
    $false,
    inference(rat,[],[s1,s3,s7]) ).

tff(f73,plain,
    $false,
    inference(avatar_sat_refutation,[],[s8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : PLA053_5 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.09  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.18/0.45  % Computer : n020.cluster.edu
% 0.18/0.45  % Model    : x86_64 x86_64
% 0.18/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45  % Memory   : 8046.5625MB
% 0.18/0.45  % OS       : Linux 6.8.0-71-generic
% 0.18/0.46  % CPULimit : 300
% 0.18/0.46  % WCLimit  : 300
% 0.18/0.46  % DateTime : Sun Sep 27 22:16:19 UTC 2026
% 0.18/0.46  % CPUTime  : 
% 0.18/0.46  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.23/0.49  Running first-order model finding
% 0.23/0.49  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.23/0.53  % (3815838)Will run a generic schedule for satisfiability detection.
% 0.23/0.53  % (3815846)dis+10_1_sil=32000:sp=arity:random_seed=2981880114:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.23/0.53  % (3815846) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3815838-3815846"...
% 0.23/0.53  % (3815846)...printing done.
% 0.23/0.53  % (3815846)Refutation found. Thanks to Tanya!
% 0.23/0.53  % SZS status Theorem for theBenchmark
% 0.23/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.53  % (3815846)------------------------------
% 0.23/0.53  % (3815846)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.53  % (3815846)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.53  % (3815846)CaDiCaL version: 2.1.3
% 0.23/0.53  % (3815846)Termination reason: Refutation
% 0.23/0.53  % (3815846)Time elapsed: 0.002 s
% 0.23/0.53  % (3815846)Peak memory usage: 12 MB
% 0.23/0.53  % (3815846)Instructions burned: 2 (million)
% 0.23/0.53  % (3815838)Success in time 0.026 s
% 0.23/0.53  % Vampire exiting
%------------------------------------------------------------------------------