%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO902_8 : 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 : n020.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:53 PM UTC 2026
% Result : Theorem 0.13s 0.26s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 67 ( 23 ~; 17 |; 21 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 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 : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 39 ( 23 !; 16 ?; 39 :)
% 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(func_def_2,type,
sK1: '$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,
sP2: '$ki_world' > $o ).
tff(pred_def_4,type,
sP3: '$ki_world' > $o ).
tff(pred_def_5,type,
sP4: '$ki_world' > $o ).
tff(f1,axiom,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(f2,conjecture,
( ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> ? [X2: '$ki_world'] :
( '$ki_accessible'(X1,X2)
& p(X2) ) ) )
=> ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ? [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
& p(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f3,negated_conjecture,
~ ( ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> ? [X2: '$ki_world'] :
( '$ki_accessible'(X1,X2)
& p(X2) ) ) )
=> ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ? [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
& p(X1) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
tff(f4,plain,
~ ( ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> ? [X2: '$ki_world'] :
( '$ki_accessible'(X1,X2)
& p(X2) ) ) )
=> ? [X3: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X3)
& ? [X4: '$ki_world'] :
( '$ki_accessible'(X3,X4)
& p(X4) ) ) ),
inference(rectify,[],[f3]) ).
tff(f5,plain,
( ! [X3: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X3)
| ! [X4: '$ki_world'] :
( ~ '$ki_accessible'(X3,X4)
| ~ p(X4) ) )
& ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ! [X1: '$ki_world'] :
( ? [X2: '$ki_world'] :
( '$ki_accessible'(X1,X2)
& p(X2) )
| ~ '$ki_accessible'(X0,X1) ) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f6,plain,
( ! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| ! [X1: '$ki_world'] :
( ~ '$ki_accessible'(X0,X1)
| ~ p(X1) ) )
& ? [X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X2)
& ! [X3: '$ki_world'] :
( ? [X4: '$ki_world'] :
( '$ki_accessible'(X3,X4)
& p(X4) )
| ~ '$ki_accessible'(X2,X3) ) ) ),
inference(rectify,[],[f5]) ).
tff(f7,plain,
( ! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| ! [X1: '$ki_world'] :
( ~ '$ki_accessible'(X0,X1)
| ~ p(X1) ) )
& '$ki_accessible'('$ki_local_world',sK0)
& ! [X3: '$ki_world'] :
( ( '$ki_accessible'(X3,sK1(X3))
& p(sK1(X3)) )
| ~ '$ki_accessible'(sK0,X3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0),skolemize(X4,sK1(X3))],[f6]) ).
tff(f8,plain,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
inference(cnf_transformation,[],[f1]) ).
tff(f9,plain,
! [X3: '$ki_world'] :
( p(sK1(X3))
| ~ '$ki_accessible'(sK0,X3) ),
inference(cnf_transformation,[],[f7]) ).
tff(f10,plain,
! [X3: '$ki_world'] :
( '$ki_accessible'(X3,sK1(X3))
| ~ '$ki_accessible'(sK0,X3) ),
inference(cnf_transformation,[],[f7]) ).
tff(f11,plain,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f7]) ).
tff(f12,plain,
! [X0: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X0,X1)
| ~ p(X1) ),
inference(cnf_transformation,[],[f7]) ).
tff(f13,plain,
! [X0: '$ki_world'] : ~ '$ki_accessible'(X0,X0),
inference(consistent_polarity_flipping,[],[f8]) ).
tff(f14,plain,
! [X0: '$ki_world',X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
| '$ki_accessible'(X0,X1)
| ~ p(X1) ),
inference(consistent_polarity_flipping,[],[f12]) ).
tff(f15,plain,
~ '$ki_accessible'('$ki_local_world',sK0),
inference(consistent_polarity_flipping,[],[f11]) ).
tff(f16,plain,
! [X3: '$ki_world'] :
( ~ '$ki_accessible'(X3,sK1(X3))
| '$ki_accessible'(sK0,X3) ),
inference(consistent_polarity_flipping,[],[f10]) ).
tff(f17,plain,
! [X3: '$ki_world'] :
( p(sK1(X3))
| '$ki_accessible'(sK0,X3) ),
inference(consistent_polarity_flipping,[],[f9]) ).
tff(f28,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f13,f14,f15,f16,f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO902_8 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.18 % Computer : n020.cluster.edu
% 0.13/0.18 % Model : x86_64 x86_64
% 0.13/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.18 % Memory : 8046.5625MB
% 0.13/0.18 % OS : Linux 6.8.0-71-generic
% 0.13/0.18 % CPULimit : 300
% 0.13/0.18 % WCLimit : 300
% 0.13/0.18 % DateTime : Mon Sep 28 18:41:34 UTC 2026
% 0.13/0.18 % CPUTime :
% 0.13/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.21 Running first-order model finding
% 0.13/0.21 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.13/0.26 % (407646)Will run a generic schedule for satisfiability detection.
% 0.13/0.26 % (407651)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=814877004_2999 on theBenchmark for (2999ds/0Mi)
% 0.13/0.26 % TRYING [1]
% 0.13/0.26 % TRYING [2]
% 0.13/0.26 % TRYING [3]
% 0.13/0.26 % TRYING [4]
% 0.13/0.26 % (407651) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-407646-407651"...
% 0.13/0.26 % (407651)...printing done.
% 0.13/0.26 % (407652)% WARNING: option uhcvi not known.
% 0.13/0.26 % (407651)Refutation found. Thanks to Tanya!
% 0.13/0.26 % SZS status Theorem for theBenchmark
% 0.13/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.26 % (407651)------------------------------
% 0.13/0.26 % (407651)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.26 % (407651)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.26 % (407651)CaDiCaL version: 2.1.3
% 0.13/0.26 % (407651)Termination reason: Refutation
% 0.13/0.26 % (407651)Time elapsed: 0.001 s
% 0.13/0.26 % (407651)Peak memory usage: 11 MB
% 0.13/0.26 % (407651)Instructions burned: 2 (million)
% 0.13/0.26 % (407646)Success in time 0.038 s
% 0.13/0.26 % Vampire exiting
%------------------------------------------------------------------------------