%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO890_16 : 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 : n006.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:49 PM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 60 ( 20 ~; 12 |; 15 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 5 ( 5 fml; 0 var)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 35 ( 25 !; 10 ?; 35 :)
% 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_3,type,
sK2: '$ki_world' ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
e: ( '$ki_world' * $i ) > $o ).
tff(pred_def_3,type,
f: ( '$ki_world' * $i ) > $o ).
tff(pred_def_4,type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff(f3,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/sandbox2/benchmark/theBenchmark.p','$ki_exists_in_world_$i_cumul') ).
tff(f5,conjecture,
( ? [X0: $i] :
( '$ki_exists_in_world_$i'('$ki_local_world',X0)
& ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( e(X1,X0)
& f(X1,X0) ) ) )
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X0: $i] :
( '$ki_exists_in_world_$i'(X1,X0)
& f(X1,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f6,negated_conjecture,
~ ( ? [X0: $i] :
( '$ki_exists_in_world_$i'('$ki_local_world',X0)
& ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( e(X1,X0)
& f(X1,X0) ) ) )
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X0: $i] :
( '$ki_exists_in_world_$i'(X1,X0)
& f(X1,X0) ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
tff(f7,plain,
~ ( ? [X0: $i] :
( '$ki_exists_in_world_$i'('$ki_local_world',X0)
& ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( e(X1,X0)
& f(X1,X0) ) ) )
=> ! [X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X2)
=> ? [X3: $i] :
( '$ki_exists_in_world_$i'(X2,X3)
& f(X2,X3) ) ) ),
inference(rectify,[],[f6]) ).
tff(f8,plain,
~ ( ? [X0: $i] :
( '$ki_exists_in_world_$i'('$ki_local_world',X0)
& ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> f(X1,X0) ) )
=> ! [X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X2)
=> ? [X3: $i] :
( '$ki_exists_in_world_$i'(X2,X3)
& f(X2,X3) ) ) ),
inference(pure_predicate_removal,[],[f7]) ).
tff(f11,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,[],[f3]) ).
tff(f12,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,[],[f11]) ).
tff(f13,plain,
( ? [X2: '$ki_world'] :
( ! [X3: $i] :
( ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ f(X2,X3) )
& '$ki_accessible'('$ki_local_world',X2) )
& ? [X0: $i] :
( '$ki_exists_in_world_$i'('$ki_local_world',X0)
& ! [X1: '$ki_world'] :
( f(X1,X0)
| ~ '$ki_accessible'('$ki_local_world',X1) ) ) ),
inference(ennf_transformation,[],[f8]) ).
tff(f16,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,[],[f12]) ).
tff(f18,plain,
! [X3: $i] :
( ~ f(sK2,X3)
| ~ '$ki_exists_in_world_$i'(sK2,X3) ),
inference(cnf_transformation,[],[f13]) ).
tff(f19,plain,
! [X1: '$ki_world'] :
( f(X1,sK1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(cnf_transformation,[],[f13]) ).
tff(f20,plain,
'$ki_accessible'('$ki_local_world',sK2),
inference(cnf_transformation,[],[f13]) ).
tff(f21,plain,
'$ki_exists_in_world_$i'('$ki_local_world',sK1),
inference(cnf_transformation,[],[f13]) ).
tff(f22,plain,
( ~ '$ki_accessible'('$ki_local_world',sK2)
| ~ '$ki_exists_in_world_$i'(sK2,sK1) ),
inference(resolution,[],[f19,f18]) ).
tff(f23,plain,
~ '$ki_exists_in_world_$i'(sK2,sK1),
inference(forward_subsumption_resolution,[],[f22,f20]) ).
tff(f33,plain,
! [X0: '$ki_world'] :
( '$ki_exists_in_world_$i'(X0,sK1)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(resolution,[],[f16,f21]) ).
tff(f38,plain,
~ '$ki_accessible'('$ki_local_world',sK2),
inference(resolution,[],[f33,f23]) ).
tff(f40,plain,
$false,
inference(forward_subsumption_resolution,[],[f38,f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO890_16 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n006.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 18:39:55 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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.09/0.25 % (33265)Will run a generic schedule for satisfiability detection.
% 0.09/0.25 % (33278)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=333780965:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.09/0.25 % (33278) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-33265-33278"...
% 0.09/0.25 % (33278)...printing done.
% 0.09/0.25 % (33275)% WARNING: option uhcvi not known.
% 0.09/0.25 % (33278)Refutation found. Thanks to Tanya!
% 0.09/0.25 % SZS status Theorem for theBenchmark
% 0.09/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25 % (33278)------------------------------
% 0.09/0.25 % (33278)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25 % (33278)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25 % (33278)CaDiCaL version: 2.1.3
% 0.09/0.25 % (33278)Termination reason: Refutation
% 0.09/0.25 % (33278)Time elapsed: 0.001 s
% 0.09/0.25 % (33278)Peak memory usage: 11 MB
% 0.09/0.25 % (33278)Instructions burned: 1 (million)
% 0.09/0.25 % (33265)Success in time 0.019 s
% 0.09/0.25 % Vampire exiting
%------------------------------------------------------------------------------