%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO895_9 : 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 : n016.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.08s 0.26s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 9 unt; 0 typ; 2 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 84 ( 32 ~; 20 |; 18 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 24 ( 0 sgn 21 !; 3 ?; 24 :)
% 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' ).
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(f2,conjecture,
( ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
& ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> q(X0) ) )
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( p(X0)
& q(X0) ) ) ),
file('/export/starexec/sandbox/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) ) )
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( p(X0)
& q(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) ) )
=> ! [X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X2)
=> ( p(X2)
& q(X2) ) ) ),
inference(rectify,[],[f3]) ).
tff(f5,plain,
( ? [X2: '$ki_world'] :
( ( ~ p(X2)
| ~ q(X2) )
& '$ki_accessible'('$ki_local_world',X2) )
& ! [X0: '$ki_world'] :
( p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f6,plain,
( ? [X2: '$ki_world'] :
( ( ~ p(X2)
| ~ q(X2) )
& '$ki_accessible'('$ki_local_world',X2) )
& ! [X0: '$ki_world'] :
( p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ) ),
inference(flattening,[],[f5]) ).
tff(f8,plain,
( ? [X0: '$ki_world'] :
( ( ~ p(X0)
| ~ q(X0) )
& '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& ! [X2: '$ki_world'] :
( q(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) ) ),
inference(rectify,[],[f6]) ).
tff(f9,plain,
( ( ~ p(sK1)
| ~ q(sK1) )
& '$ki_accessible'('$ki_local_world',sK1)
& ! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& ! [X2: '$ki_world'] :
( q(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f8]) ).
tff(f11,plain,
! [X2: '$ki_world'] :
( q(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) ),
inference(cnf_transformation,[],[f9]) ).
tff(f12,plain,
! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(cnf_transformation,[],[f9]) ).
tff(f13,plain,
'$ki_accessible'('$ki_local_world',sK1),
inference(cnf_transformation,[],[f9]) ).
tff(f14,plain,
( ~ p(sK1)
| ~ q(sK1) ),
inference(cnf_transformation,[],[f9]) ).
tff(f15,plain,
( p(sK1)
| q(sK1) ),
inference(consistent_polarity_flipping,[],[f14]) ).
tff(f16,plain,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ p(X1) ),
inference(consistent_polarity_flipping,[],[f12]) ).
tff(f17,plain,
! [X2: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X2)
| ~ q(X2) ),
inference(consistent_polarity_flipping,[],[f11]) ).
tff(f19,definition,
( spl2_1
<=> q(sK1) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
tff(f23,definition,
( spl2_2
<=> p(sK1) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
tff(f26,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f15,f23,f19]) ).
tff(f27,plain,
~ p(sK1),
inference(resolution,[],[f16,f13]) ).
tff(f28,plain,
~ spl2_2,
inference(avatar_split_clause,[],[f27,f23]) ).
tff(f29,plain,
~ q(sK1),
inference(resolution,[],[f17,f13]) ).
tff(f30,plain,
~ spl2_1,
inference(avatar_split_clause,[],[f29,f19]) ).
cnf(s1,plain,
( spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f26]) ).
cnf(s2,plain,
~ spl2_2,
inference(sat_conversion,[],[f28]) ).
cnf(s3,plain,
~ spl2_1,
inference(sat_conversion,[],[f30]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
tff(f31,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO895_9 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n016.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 18:45:18 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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.08/0.26 % (3864320)Will run a generic schedule for satisfiability detection.
% 0.08/0.26 % (3864336)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1675068972:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.26 % (3864336) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3864320-3864336"...
% 0.08/0.26 % (3864336)...printing done.
% 0.08/0.26 % (3864336)Refutation found. Thanks to Tanya!
% 0.08/0.26 % SZS status Theorem for theBenchmark
% 0.08/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.26 % (3864336)------------------------------
% 0.08/0.26 % (3864336)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26 % (3864336)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26 % (3864336)CaDiCaL version: 2.1.3
% 0.08/0.26 % (3864336)Termination reason: Refutation
% 0.08/0.26 % (3864336)Time elapsed: 0.001 s
% 0.08/0.26 % (3864336)Peak memory usage: 12 MB
% 0.08/0.26 % (3864336)Instructions burned: 1 (million)
% 0.08/0.26 % (3864320)Success in time 0.029 s
% 0.08/0.26 % Vampire exiting
%------------------------------------------------------------------------------