%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO886_6 : 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 : n015.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:48 PM UTC 2026
% Result : Theorem 0.22s 0.28s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 34 ( 11 ~; 5 |; 3 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 3 ( 3 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 : 22 ( 20 !; 2 ?; 22 :)
% 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_3,type,
sK2: '$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: $i] : '$ki_exists_in_world_$i'(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$ki_exists_in_world_$i_const') ).
tff(f4,conjecture,
( ! [X0: $i] :
( '$ki_exists_in_world_$i'('$ki_local_world',X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> 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/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f5,negated_conjecture,
~ ( ! [X0: $i] :
( '$ki_exists_in_world_$i'('$ki_local_world',X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> 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)],[f4]) ).
tff(f6,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(rectify,[],[f5]) ).
tff(f7,plain,
( ? [X2: '$ki_world'] :
( ? [X3: $i] :
( ~ f(X2,X3)
& '$ki_exists_in_world_$i'(X2,X3) )
& '$ki_accessible'('$ki_local_world',X2) )
& ! [X0: $i] :
( ! [X1: '$ki_world'] :
( f(X1,X0)
| ~ '$ki_accessible'('$ki_local_world',X1) )
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) ) ),
inference(ennf_transformation,[],[f6]) ).
tff(f9,plain,
! [X0: '$ki_world',X1: $i] : '$ki_exists_in_world_$i'(X0,X1),
inference(cnf_transformation,[],[f2]) ).
tff(f12,plain,
~ f(sK2,sK3),
inference(cnf_transformation,[],[f7]) ).
tff(f13,plain,
! [X0: $i,X1: '$ki_world'] :
( f(X1,X0)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f7]) ).
tff(f14,plain,
'$ki_accessible'('$ki_local_world',sK2),
inference(cnf_transformation,[],[f7]) ).
tff(f15,plain,
( ~ '$ki_accessible'('$ki_local_world',sK2)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',sK3) ),
inference(resolution,[],[f13,f12]) ).
tff(f16,plain,
~ '$ki_exists_in_world_$i'('$ki_local_world',sK3),
inference(forward_subsumption_resolution,[],[f15,f14]) ).
tff(f17,plain,
$false,
inference(forward_subsumption_resolution,[],[f16,f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO886_6 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n015.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 18:43:02 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24 Running first-order model finding
% 0.09/0.24 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.22/0.28 % (2878764)Will run a generic schedule for satisfiability detection.
% 0.22/0.28 % (2878773)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3890995510:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.22/0.28 % (2878773) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2878764-2878773"...
% 0.22/0.28 % (2878773)...printing done.
% 0.22/0.28 % (2878773)Refutation found. Thanks to Tanya!
% 0.22/0.28 % SZS status Theorem for theBenchmark
% 0.22/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.28 % (2878773)------------------------------
% 0.22/0.28 % (2878773)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.28 % (2878773)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.28 % (2878773)CaDiCaL version: 2.1.3
% 0.22/0.28 % (2878773)Termination reason: Refutation
% 0.22/0.28 % (2878773)Time elapsed: 0.001 s
% 0.22/0.28 % (2878773)Peak memory usage: 11 MB
% 0.22/0.28 % (2878764)Success in time 0.029 s
% 0.22/0.28 % Vampire exiting
%------------------------------------------------------------------------------