%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NLP267_17 : 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 : n005.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 12:09:46 PM UTC 2026
% Result : Theorem 0.10s 0.42s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 89 ( 0 equ)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 60 ( 30 ~; 20 |; 5 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 35 ( 35 fml; 0 var)
% Number of types : 4 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 4 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 22 ( 21 !; 1 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'$ki_world': $tType ).
tff(type_def_6,type,
'$ki_index': $tType ).
tff(func_def_0,type,
'$ki_local_world': '$ki_world' ).
tff(func_def_1,type,
'#idx(b_s)': '$ki_index' ).
tff(func_def_2,type,
'#idx(b_u)': '$ki_index' ).
tff(func_def_8,type,
sK0: '$ki_world' ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_index' * '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
price: ( '$ki_world' * $i ) > $o ).
tff(pred_def_3,type,
dest: ( '$ki_world' * $i ) > $o ).
tff(pred_def_4,type,
class: ( '$ki_world' * $i ) > $o ).
tff(f1,axiom,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_s)',X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','mrel_universal_#idx(b_s)') ).
tff(f4,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(b_s)','$ki_local_world',X0)
=> ( ( dest(X0,paris)
& class(X0,second) )
=> price(X0,seventy) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
tff(f9,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(b_s)','$ki_local_world',X0)
=> ( dest(X0,paris)
& class(X0,second) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
tff(f10,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(b_s)','$ki_local_world',X0)
=> price(X0,seventy) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f11,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(b_s)','$ki_local_world',X0)
=> price(X0,seventy) ),
inference(negated_conjecture,[status(cth)],[f10]) ).
tff(f14,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ dest(X0,paris)
| ~ class(X0,second)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(ennf_transformation,[],[f4]) ).
tff(f15,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ dest(X0,paris)
| ~ class(X0,second)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(flattening,[],[f14]) ).
tff(f24,plain,
! [X0: '$ki_world'] :
( ( dest(X0,paris)
& class(X0,second) )
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(ennf_transformation,[],[f9]) ).
tff(f25,plain,
? [X0: '$ki_world'] :
( ~ price(X0,seventy)
& '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(ennf_transformation,[],[f11]) ).
tff(f26,plain,
( ~ price(sK0,seventy)
& '$ki_accessible'('#idx(b_s)','$ki_local_world',sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f25]) ).
tff(f27,plain,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_s)',X0,X1),
inference(cnf_transformation,[],[f1]) ).
tff(f30,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ dest(X0,paris)
| ~ class(X0,second)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(cnf_transformation,[],[f15]) ).
tff(f35,plain,
! [X0: '$ki_world'] :
( class(X0,second)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(cnf_transformation,[],[f24]) ).
tff(f36,plain,
! [X0: '$ki_world'] :
( dest(X0,paris)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(cnf_transformation,[],[f24]) ).
tff(f38,plain,
~ price(sK0,seventy),
inference(cnf_transformation,[],[f26]) ).
tff(f40,plain,
! [X0: '$ki_world'] :
( dest(X0,paris)
| ~ price(X0,seventy)
| ~ class(X0,second)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(consistent_polarity_flipping,[],[f30]) ).
tff(f43,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0)
| ~ dest(X0,paris) ),
inference(consistent_polarity_flipping,[],[f36]) ).
tff(f44,plain,
price(sK0,seventy),
inference(consistent_polarity_flipping,[],[f38]) ).
tff(f45,plain,
! [X0: '$ki_world'] : ~ dest(X0,paris),
inference(resolution,[],[f43,f27]) ).
tff(f50,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0)
| ~ class(X0,second)
| ~ price(X0,seventy) ),
inference(resolution,[],[f40,f45]) ).
tff(f51,plain,
! [X0: '$ki_world'] :
( ~ class(X0,second)
| ~ price(X0,seventy) ),
inference(resolution,[],[f50,f27]) ).
tff(f52,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0)
| ~ price(X0,seventy) ),
inference(resolution,[],[f51,f35]) ).
tff(f53,plain,
! [X0: '$ki_world'] : ~ price(X0,seventy),
inference(resolution,[],[f52,f27]) ).
tff(f54,plain,
$false,
inference(resolution,[],[f53,f44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NLP267_17 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n005.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 18:38:32 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 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.10/0.42 % (94289)Will run a generic schedule for satisfiability detection.
% 0.10/0.42 % (94300)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3103073213:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.10/0.42 % (94300) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-94289-94300"...
% 0.10/0.42 % (94300)...printing done.
% 0.10/0.42 % (94300)Refutation found. Thanks to Tanya!
% 0.10/0.42 % SZS status Theorem for theBenchmark
% 0.10/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.42 % (94300)------------------------------
% 0.10/0.42 % (94300)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.42 % (94300)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.42 % (94300)CaDiCaL version: 2.1.3
% 0.10/0.42 % (94300)Termination reason: Refutation
% 0.10/0.42 % (94300)Time elapsed: 0.001 s
% 0.10/0.42 % (94300)Peak memory usage: 11 MB
% 0.10/0.42 % (94300)Instructions burned: 1 (million)
% 0.10/0.42 % (94289)Success in time 0.016 s
% 0.10/0.42 % Vampire exiting
%------------------------------------------------------------------------------