%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NLP265_17 : TPTP v9.3.1. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 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:09:44 PM UTC 2026
% Result : Theorem 0.21s 0.51s
% Output : Refutation 0.21s
% 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 : 11 ( 11 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' > '$ki_world' ).
tff(func_def_7,type,
sK1: '$ki_world' > '$ki_world' ).
tff(func_def_8,type,
sK2: '$ki_world' > '$ki_world' ).
tff(func_def_9,type,
sK3: '$ki_world' > '$ki_world' ).
tff(func_def_10,type,
sK4: '$ki_world' ).
tff(func_def_11,type,
sK5: '$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/sandbox2/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/sandbox2/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/sandbox2/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(f17,plain,
! [X0: '$ki_world'] :
( bigcity(X0,portland)
| ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0) ),
inference(ennf_transformation,[],[f7]) ).
tff(f19,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(f24,plain,
( ~ bigcity(sK5,portland)
& '$ki_accessible'('#idx(b_bob)',sK4,sK5)
& '$ki_accessible'('#idx(i_alice)','$ki_local_world',sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X0,sK4),skolemize(X1,sK5)],[f19]) ).
tff(f25,plain,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_alice)',X0,X1),
inference(cnf_transformation,[],[f1]) ).
tff(f35,plain,
! [X0: '$ki_world'] :
( bigcity(X0,portland)
| ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0) ),
inference(cnf_transformation,[],[f17]) ).
tff(f39,plain,
~ bigcity(sK5,portland),
inference(cnf_transformation,[],[f24]) ).
tff(f40,plain,
! [X0: '$ki_world'] : bigcity(X0,portland),
inference(forward_subsumption_resolution,[],[f35,f25]) ).
tff(f41,plain,
$false,
inference(resolution,[],[f40,f39]) ).
%------------------------------------------------------------------------------
%----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/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 % Computer : n001.cluster.edu
% 0.12/0.41 % Model : x86_64 x86_64
% 0.12/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.41 % Memory : 8046.5625MB
% 0.12/0.41 % OS : Linux 6.8.0-71-generic
% 0.12/0.41 % CPULimit : 300
% 0.12/0.41 % WCLimit : 300
% 0.12/0.41 % DateTime : Sun Sep 27 18:44:01 UTC 2026
% 0.12/0.42 % CPUTime :
% 0.12/0.42 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.47 Running first-order model finding
% 0.12/0.47 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.51 % (3881882)Will run a generic schedule for satisfiability detection.
% 0.21/0.51 % (3881890)dis+10_1_sil=32000:sp=arity:random_seed=1349736987:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.51 % (3881890) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3881882-3881890"...
% 0.21/0.51 % (3881890)...printing done.
% 0.21/0.51 % (3881890)Refutation found. Thanks to Tanya!
% 0.21/0.51 % SZS status Theorem for theBenchmark
% 0.21/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51 % (3881890)------------------------------
% 0.21/0.51 % (3881890)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.51 % (3881890)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.51 % (3881890)CaDiCaL version: 2.1.3
% 0.21/0.51 % (3881890)Termination reason: Refutation
% 0.21/0.51 % (3881890)Time elapsed: 0.001 s
% 0.21/0.51 % (3881890)Peak memory usage: 11 MB
% 0.21/0.51 % (3881890)Instructions burned: 1 (million)
% 0.21/0.51 % (3881882)Success in time 0.027 s
% 0.21/0.51 % Vampire exiting
%------------------------------------------------------------------------------