%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO899_8 : 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 : n013.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:52 PM UTC 2026
% Result : Theorem 0.23s 0.35s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 87 ( 31 ~; 23 |; 18 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 34 ( 25 !; 9 ?; 34 :)
% 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' ).
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'] : '$ki_accessible'(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(f2,conjecture,
( ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ( p(X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> q(X1) ) ) )
=> ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
=> ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& q(X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f3,negated_conjecture,
~ ( ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ( p(X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> q(X1) ) ) )
=> ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
=> ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',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'(X0,X1)
=> q(X1) ) ) )
=> ( ! [X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X2)
=> p(X2) )
=> ? [X3: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X3)
& q(X3) ) ) ),
inference(rectify,[],[f3]) ).
tff(f5,plain,
( ! [X3: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X3)
| ~ q(X3) )
& ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) )
& ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ( ! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'(X0,X1) )
| ~ p(X0) ) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f6,plain,
( ! [X3: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X3)
| ~ q(X3) )
& ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) )
& ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ( ! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'(X0,X1) )
| ~ p(X0) ) ) ),
inference(flattening,[],[f5]) ).
tff(f7,plain,
( ! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ q(X0) )
& ! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& ? [X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X2)
& ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(X2,X3) )
| ~ p(X2) ) ) ),
inference(rectify,[],[f6]) ).
tff(f8,plain,
( ! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ q(X0) )
& ! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& '$ki_accessible'('$ki_local_world',sK0)
& ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(sK0,X3) )
| ~ p(sK0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0)],[f7]) ).
tff(f9,plain,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
inference(cnf_transformation,[],[f1]) ).
tff(f10,plain,
! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(sK0,X3)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f8]) ).
tff(f11,plain,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f8]) ).
tff(f12,plain,
! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(cnf_transformation,[],[f8]) ).
tff(f13,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ q(X0) ),
inference(cnf_transformation,[],[f8]) ).
tff(f14,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| q(X0) ),
inference(consistent_polarity_flipping,[],[f13]) ).
tff(f15,plain,
! [X3: '$ki_world'] :
( ~ q(X3)
| ~ '$ki_accessible'(sK0,X3)
| ~ p(sK0) ),
inference(consistent_polarity_flipping,[],[f10]) ).
tff(f22,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f9,f14,f12,f11,f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYO899_8 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.23/0.27 % Computer : n013.cluster.edu
% 0.23/0.27 % Model : x86_64 x86_64
% 0.23/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.23/0.27 % Memory : 8046.5625MB
% 0.23/0.27 % OS : Linux 6.8.0-71-generic
% 0.23/0.27 % CPULimit : 300
% 0.23/0.27 % WCLimit : 300
% 0.23/0.27 % DateTime : Mon Sep 28 18:39:51 UTC 2026
% 0.23/0.28 % CPUTime :
% 0.23/0.28 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.23/0.31 Running first-order model finding
% 0.23/0.31 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.23/0.35 % (1423813)Will run a generic schedule for satisfiability detection.
% 0.23/0.35 % (1423818)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1798163366_2999 on theBenchmark for (2999ds/0Mi)
% 0.23/0.35 % (1423819)% WARNING: option uhcvi not known.
% 0.23/0.35 % Detected minimum model sizes of [1]
% 0.23/0.35 % Detected maximum model sizes of [2]
% 0.23/0.35 % TRYING [1]
% 0.23/0.35 % TRYING [2]
% 0.23/0.35 % (1423818) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1423813-1423818"...
% 0.23/0.35 % (1423818)...printing done.
% 0.23/0.35 % (1423818)Refutation found. Thanks to Tanya!
% 0.23/0.35 % SZS status Theorem for theBenchmark
% 0.23/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.35 % (1423818)------------------------------
% 0.23/0.35 % (1423818)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.35 % (1423818)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.35 % (1423818)CaDiCaL version: 2.1.3
% 0.23/0.35 % (1423818)Termination reason: Refutation
% 0.23/0.35 % (1423818)Time elapsed: 0.001 s
% 0.23/0.35 % (1423818)Peak memory usage: 11 MB
% 0.23/0.35 % (1423818)Instructions burned: 1 (million)
% 0.23/0.35 % (1423813)Success in time 0.025 s
% 0.23/0.35 % Vampire exiting
%------------------------------------------------------------------------------