%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PLA053_4 : 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 : n001.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:28:31 PM UTC 2026
% Result : Theorem 2.74s 1.38s
% Output : Refutation 2.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 39 ( 14 unt; 0 typ; 2 def)
% Number of atoms : 125 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 134 ( 56 ~; 45 |; 21 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 8 ( 8 fml; 0 var)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn 40 !; 9 ?; 49 :)
% 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' ).
tff(func_def_3,type,
sK2: '$ki_world' > $i ).
tff(func_def_5,type,
sK4: ( '$ki_world' * $i ) > $i ).
tff(func_def_6,type,
sK5: '$ki_world' > $i ).
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'] : '$ki_accessible'(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(f3,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(f7,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(f8,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(f9,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)],[f8]) ).
tff(f10,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,[],[f9]) ).
tff(f11,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,[],[f10]) ).
tff(f17,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,[],[f7]) ).
tff(f18,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,[],[f17]) ).
tff(f19,plain,
( ! [X2: $i] :
( ~ '$ki_exists_in_world_$i'(sK0,X2)
| ( ~ defused(sK0,sK1)
& bomb(sK0,sK1)
& h(sK0,X2) ) )
& '$ki_exists_in_world_$i'(sK0,sK1)
& '$ki_accessible'('$ki_local_world',sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f11]) ).
tff(f22,plain,
! [X0: '$ki_world'] :
( ! [X1: $i] :
( ( '$ki_exists_in_world_$i'(X0,sK4(X0,X1))
& ! [X3: '$ki_world'] :
( defused(X3,X1)
| ~ bomb(X3,X1)
| ~ h(X3,sK4(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,[sK4]),skolemize(X2,sK4(X0,X1))],[f18]) ).
tff(f24,plain,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f19]) ).
tff(f26,plain,
! [X2: $i] :
( ~ '$ki_exists_in_world_$i'(sK0,X2)
| h(sK0,X2) ),
inference(cnf_transformation,[],[f19]) ).
tff(f27,plain,
! [X2: $i] :
( ~ '$ki_exists_in_world_$i'(sK0,X2)
| bomb(sK0,sK1) ),
inference(cnf_transformation,[],[f19]) ).
tff(f28,plain,
! [X2: $i] :
( ~ '$ki_exists_in_world_$i'(sK0,X2)
| ~ defused(sK0,sK1) ),
inference(cnf_transformation,[],[f19]) ).
tff(f32,plain,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
inference(cnf_transformation,[],[f1]) ).
tff(f35,plain,
! [X3: '$ki_world',X0: '$ki_world',X1: $i] :
( ~ h(X3,sK4(X0,X1))
| ~ bomb(X3,X1)
| defused(X3,X1)
| ~ '$ki_accessible'(X0,X3)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f22]) ).
tff(f38,plain,
! [X0: '$ki_world',X1: $i] : '$ki_exists_in_world_$i'(X0,X1),
inference(cnf_transformation,[],[f3]) ).
tff(f39,plain,
! [X2: $i] : h(sK0,X2),
inference(forward_subsumption_resolution,[],[f26,f38]) ).
tff(f40,plain,
bomb(sK0,sK1),
inference(forward_subsumption_resolution,[],[f27,f38]) ).
tff(f41,plain,
~ defused(sK0,sK1),
inference(forward_subsumption_resolution,[],[f28,f38]) ).
tff(f43,plain,
! [X0: $i,X1: '$ki_world'] :
( ~ bomb(sK0,X0)
| defused(sK0,X0)
| ~ '$ki_accessible'(X1,sK0)
| ~ '$ki_exists_in_world_$i'(X1,X0)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(resolution,[],[f39,f35]) ).
tff(f44,plain,
! [X0: $i,X1: '$ki_world'] :
( ~ bomb(sK0,X0)
| defused(sK0,X0)
| ~ '$ki_accessible'(X1,sK0)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(forward_subsumption_resolution,[],[f43,f38]) ).
tff(f46,definition,
( spl6_1
<=> ! [X1: '$ki_world'] :
( ~ '$ki_accessible'(X1,sK0)
| ~ '$ki_accessible'('$ki_local_world',X1) ) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
tff(f47,plain,
( ! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'(X1,sK0) )
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f46]) ).
tff(f49,definition,
( spl6_2
<=> ! [X0: $i] :
( ~ bomb(sK0,X0)
| defused(sK0,X0) ) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
tff(f50,plain,
( ! [X0: $i] :
( ~ bomb(sK0,X0)
| defused(sK0,X0) )
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f49]) ).
tff(f51,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f44,f49,f46]) ).
tff(f53,plain,
( defused(sK0,sK1)
| ~ spl6_2 ),
inference(resolution,[],[f50,f40]) ).
tff(f56,plain,
( $false
| ~ spl6_2 ),
inference(forward_subsumption_resolution,[],[f53,f41]) ).
tff(f57,plain,
~ spl6_2,
inference(avatar_contradiction_clause,[],[f56]) ).
tff(f58,plain,
( ~ '$ki_accessible'(sK0,sK0)
| ~ spl6_1 ),
inference(resolution,[],[f47,f24]) ).
tff(f62,plain,
( $false
| ~ spl6_1 ),
inference(forward_subsumption_resolution,[],[f58,f32]) ).
tff(f63,plain,
~ spl6_1,
inference(avatar_contradiction_clause,[],[f62]) ).
cnf(s1,plain,
( spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f51]) ).
cnf(s2,plain,
~ spl6_2,
inference(sat_conversion,[],[f57]) ).
cnf(s4,plain,
~ spl6_1,
inference(sat_conversion,[],[f63]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s1,s2,s4]) ).
tff(f64,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PLA053_4 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n001.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 22:20:32 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/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
% 2.74/1.38 % (4018505)Detected formulas, will run a generic FOF schedule.
% 2.74/1.38 % (4018593)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=208010967:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.74/1.38 % (4018593)First to succeed.
% 2.74/1.38 % (4018593)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4018505"
% 2.74/1.38 % (4018590)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=2410679352:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.74/1.38 % (4018595)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1637098965:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.74/1.38 % (4018591)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=3685933887:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.74/1.38 % (4018594)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4053780778:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.74/1.38 % (4018596)dis-21_1_sil=8000:lcm=predicate:random_seed=340674782: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.74/1.38 % (4018592)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=2367655344:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.74/1.38 % (4018595)Also succeeded, but the first one will report.
% 2.74/1.38 % (4018594)Also succeeded, but the first one will report.
% 2.74/1.38 % (4018596)Also succeeded, but the first one will report.
% 2.74/1.38 % (4018593)Refutation found. Thanks to Tanya!
% 2.74/1.38 % SZS status Theorem for theBenchmark
% 2.74/1.38 % SZS output start Proof for theBenchmark
% See solution above
% 2.74/1.38 % (4018593)------------------------------
% 2.74/1.38 % (4018593)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.74/1.38 % (4018593)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.74/1.38 % (4018593)CaDiCaL version: 2.1.3
% 2.74/1.38 % (4018593)Termination reason: Refutation
% 2.74/1.38 % (4018593)Time elapsed: 0.002 s
% 2.74/1.38 % (4018593)Peak memory usage: 89 MB
% 2.74/1.38 % (4018593)Instructions burned: 2 (million)
% 2.74/1.38 % (4018593)------------------------------
% 2.74/1.38 % (4018593)------------------------------
% 2.74/1.38 % (4018505)Success in time 0.307 s
% 2.74/1.38 % Vampire exiting
%------------------------------------------------------------------------------