%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT334_19 : 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 : n017.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 09:48:31 AM UTC 2026
% Result : Theorem 0.11s 0.26s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 110 ( 0 equ)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 71 ( 29 ~; 21 |; 17 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 41 ( 41 fml; 0 var)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 15 ( 14 usr; 7 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 39 ( 33 !; 6 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'$ki_world': $tType ).
tff(func_def_0,type,
'$ki_local_world': '$ki_world' ).
tff(func_def_7,type,
sK0: '$ki_world' > $i ).
tff(func_def_8,type,
sK1: '$ki_world' > $i ).
tff(func_def_9,type,
sK2: '$ki_world' ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
teach: ( '$ki_world' * $i * $i ) > $o ).
tff(pred_def_3,type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff(pred_def_5,type,
sP4: '$ki_world' > $o ).
tff(pred_def_6,type,
sP5: '$ki_world' > $o ).
tff(pred_def_7,type,
sP6: '$ki_world' > $o ).
tff(pred_def_8,type,
sP7: '$ki_world' > $o ).
tff(pred_def_9,type,
sP8: '$ki_world' > $o ).
tff(f1,axiom,
! [X0: '$ki_world',X1: '$ki_world',X2: $i] :
( ( '$ki_exists_in_world_$i'(X0,X2)
& '$ki_accessible'(X1,X0) )
=> '$ki_exists_in_world_$i'(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$ki_exists_in_world_$i_decr') ).
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_nonempty') ).
tff(f3,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( teach(X0,john,math)
& ? [X1: $i] :
( '$ki_exists_in_world_$i'(X0,X1)
& teach(X0,X1,cs) )
& teach(X0,mary,psych)
& teach(X0,sue,psych) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',db) ).
tff(f4,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X1: $i] :
( '$ki_exists_in_world_$i'(X0,X1)
& teach(X0,X1,cs) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f5,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X1: $i] :
( '$ki_exists_in_world_$i'(X0,X1)
& teach(X0,X1,cs) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
tff(f6,plain,
! [X0: '$ki_world',X1: '$ki_world',X2: $i] :
( '$ki_exists_in_world_$i'(X1,X2)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X1,X0) ),
inference(ennf_transformation,[],[f1]) ).
tff(f7,plain,
! [X0: '$ki_world',X1: '$ki_world',X2: $i] :
( '$ki_exists_in_world_$i'(X1,X2)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X1,X0) ),
inference(flattening,[],[f6]) ).
tff(f8,plain,
! [X0: '$ki_world'] :
( ( teach(X0,john,math)
& ? [X1: $i] :
( '$ki_exists_in_world_$i'(X0,X1)
& teach(X0,X1,cs) )
& teach(X0,mary,psych)
& teach(X0,sue,psych) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f3]) ).
tff(f9,plain,
? [X0: '$ki_world'] :
( ! [X1: $i] :
( ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ teach(X0,X1,cs) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f5]) ).
tff(f10,plain,
! [X0: '$ki_world'] : '$ki_exists_in_world_$i'(X0,sK0(X0)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f2]) ).
tff(f11,plain,
! [X0: '$ki_world'] :
( ( teach(X0,john,math)
& '$ki_exists_in_world_$i'(X0,sK1(X0))
& teach(X0,sK1(X0),cs)
& teach(X0,mary,psych)
& teach(X0,sue,psych) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f8]) ).
tff(f12,plain,
( ! [X1: $i] :
( ~ '$ki_exists_in_world_$i'(sK2,X1)
| ~ teach(sK2,X1,cs) )
& '$ki_accessible'('$ki_local_world',sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f9]) ).
tff(f13,plain,
! [X2: '$ki_world',X0: '$ki_world',X1: $i] :
( '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| ~ '$ki_accessible'(X0,X2) ),
inference(cnf_transformation,[],[f7]) ).
tff(f14,plain,
! [X0: '$ki_world'] : '$ki_exists_in_world_$i'(X0,sK0(X0)),
inference(cnf_transformation,[],[f10]) ).
tff(f15,plain,
! [X0: '$ki_world'] :
( teach(X0,sue,psych)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f11]) ).
tff(f16,plain,
! [X0: '$ki_world'] :
( teach(X0,mary,psych)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f11]) ).
tff(f17,plain,
! [X0: '$ki_world'] :
( teach(X0,sK1(X0),cs)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f11]) ).
tff(f18,plain,
! [X0: '$ki_world'] :
( '$ki_exists_in_world_$i'(X0,sK1(X0))
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f11]) ).
tff(f19,plain,
! [X0: '$ki_world'] :
( teach(X0,john,math)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f11]) ).
tff(f20,plain,
'$ki_accessible'('$ki_local_world',sK2),
inference(cnf_transformation,[],[f12]) ).
tff(f21,plain,
! [X1: $i] :
( ~ '$ki_exists_in_world_$i'(sK2,X1)
| ~ teach(sK2,X1,cs) ),
inference(cnf_transformation,[],[f12]) ).
tff(f22,plain,
! [X0: '$ki_world'] :
( ~ teach(X0,john,math)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(consistent_polarity_flipping,[],[f19]) ).
tff(f23,plain,
! [X0: '$ki_world'] :
( ~ teach(X0,sK1(X0),cs)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(consistent_polarity_flipping,[],[f17]) ).
tff(f24,plain,
! [X0: '$ki_world'] :
( ~ teach(X0,mary,psych)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(consistent_polarity_flipping,[],[f16]) ).
tff(f25,plain,
! [X0: '$ki_world'] :
( ~ teach(X0,sue,psych)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(consistent_polarity_flipping,[],[f15]) ).
tff(f26,plain,
! [X1: $i] :
( ~ '$ki_exists_in_world_$i'(sK2,X1)
| teach(sK2,X1,cs) ),
inference(consistent_polarity_flipping,[],[f21]) ).
tff(f47,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f13,f14,f22,f18,f23,f24,f25,f26,f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : DAT334_19 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.17 % Computer : n017.cluster.edu
% 0.11/0.17 % Model : x86_64 x86_64
% 0.11/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.17 % Memory : 8046.5625MB
% 0.11/0.17 % OS : Linux 6.8.0-71-generic
% 0.11/0.17 % CPULimit : 300
% 0.11/0.17 % WCLimit : 300
% 0.11/0.17 % DateTime : Tue Sep 29 00:15:21 UTC 2026
% 0.11/0.17 % CPUTime :
% 0.11/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.20 Running first-order model finding
% 0.11/0.20 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.11/0.26 % (4193280)Will run a generic schedule for satisfiability detection.
% 0.11/0.26 % (4193296)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=14081784_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.26 % TRYING [1]
% 0.11/0.26 % TRYING [2]
% 0.11/0.26 % TRYING [3]
% 0.11/0.26 % TRYING [4]
% 0.11/0.26 % TRYING [5]
% 0.11/0.26 % TRYING [6]
% 0.11/0.26 % TRYING [7]
% 0.11/0.26 % (4193297)% WARNING: option uhcvi not known.
% 0.11/0.26 % TRYING [8]
% 0.11/0.26 % (4193296) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4193280-4193296"...
% 0.11/0.26 % (4193296)...printing done.
% 0.11/0.26 % (4193297)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3196738701:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.26 % (4193300)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3561476284:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.26 % (4193298)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3768042520:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.26 % (4193296)Refutation found. Thanks to Tanya!
% 0.11/0.26 % SZS status Theorem for theBenchmark
% 0.11/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.26 % (4193296)------------------------------
% 0.11/0.26 % (4193296)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.26 % (4193296)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.26 % (4193296)CaDiCaL version: 2.1.3
% 0.11/0.26 % (4193296)Termination reason: Refutation
% 0.11/0.26 % (4193296)Time elapsed: 0.004 s
% 0.11/0.26 % (4193296)Peak memory usage: 11 MB
% 0.11/0.26 % (4193296)Instructions burned: 12 (million)
% 0.11/0.26 % (4193280)Success in time 0.045 s
% 0.11/0.26 % Vampire exiting
%------------------------------------------------------------------------------