%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO898_9 : 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 : n004.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:51 PM UTC 2026
% Result : Theorem 0.19s 0.26s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 30 ( 10 ~; 4 |; 5 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 16 ( 11 !; 5 ?; 16 :)
% 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(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
p: '$ki_world' > $o ).
tff(pred_def_3,type,
q: '$ki_world' > $o ).
tff(f1,axiom,
! [X0: '$ki_world'] :
? [X1: '$ki_world'] : '$ki_accessible'(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_serial) ).
tff(f2,conjecture,
( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
=> ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ( q(X0)
=> p(X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f3,negated_conjecture,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
=> ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ( q(X0)
=> p(X0) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
tff(f4,plain,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
=> ? [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
& ( q(X1)
=> p(X1) ) ) ),
inference(rectify,[],[f3]) ).
tff(f5,plain,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
=> ? [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
& p(X1) ) ),
inference(pure_predicate_removal,[],[f4]) ).
tff(f6,plain,
( ! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ p(X1) )
& ! [X0: '$ki_world'] :
( p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) ) ),
inference(ennf_transformation,[],[f5]) ).
tff(f7,plain,
! [X0: '$ki_world'] : '$ki_accessible'(X0,sK0(X0)),
inference(cnf_transformation,[],[f1]) ).
tff(f8,plain,
! [X1: '$ki_world'] :
( ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(cnf_transformation,[],[f6]) ).
tff(f9,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| p(X0) ),
inference(cnf_transformation,[],[f6]) ).
tff(f10,plain,
! [X0: '$ki_world'] : ~ '$ki_accessible'('$ki_local_world',X0),
inference(forward_subsumption_resolution,[],[f9,f8]) ).
tff(f11,plain,
$false,
inference(resolution,[],[f7,f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO898_9 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n004.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 18:40:22 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/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.19/0.26 % (630252)Will run a generic schedule for satisfiability detection.
% 0.19/0.26 % (630269)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1127370678:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.26 % (630269) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-630252-630269"...
% 0.19/0.26 % (630269)...printing done.
% 0.19/0.26 % (630269)Refutation found. Thanks to Tanya!
% 0.19/0.26 % SZS status Theorem for theBenchmark
% 0.19/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.26 % (630269)------------------------------
% 0.19/0.26 % (630269)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.26 % (630269)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.26 % (630269)CaDiCaL version: 2.1.3
% 0.19/0.26 % (630269)Termination reason: Refutation
% 0.19/0.26 % (630269)Time elapsed: 0.0000 s
% 0.19/0.26 % (630269)Peak memory usage: 11 MB
% 0.19/0.26 % (630252)Success in time 0.032 s
% 0.19/0.26 % Vampire exiting
%------------------------------------------------------------------------------