%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NLP267_17 : TPTP v9.3.1. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:08:17 PM UTC 2026
% Result : Theorem 2.61s 1.12s
% Output : Refutation 2.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 44 ( 19 ~; 15 |; 5 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 29 ( 29 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 : 20 ( 19 !; 1 ?; 20 :)
% 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/sandbox/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/sandbox/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/sandbox/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/sandbox/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(f39,plain,
! [X0: '$ki_world'] : class(X0,second),
inference(forward_subsumption_resolution,[],[f35,f27]) ).
tff(f40,plain,
! [X0: '$ki_world'] : dest(X0,paris),
inference(forward_subsumption_resolution,[],[f36,f27]) ).
tff(f44,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ class(X0,second)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(forward_subsumption_resolution,[],[f30,f40]) ).
tff(f45,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(forward_subsumption_resolution,[],[f44,f39]) ).
tff(f46,plain,
! [X0: '$ki_world'] : price(X0,seventy),
inference(forward_subsumption_resolution,[],[f45,f27]) ).
tff(f47,plain,
$false,
inference(resolution,[],[f46,f38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP267_17 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 % Computer : n001.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 27 18:44:31 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.61/1.12 % (3883147)Detected formulas, will run a generic FOF schedule.
% 2.61/1.12 % (3883182)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1108449202:i=119:av=off:ss=axioms_3000 on theBenchmark for (3000ds/119Mi)
% 2.61/1.12 % (3883180)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=63009074:i=109:sd=1:ins=1:gsp=on:ss=axioms_3000 on theBenchmark for (3000ds/109Mi)
% 2.61/1.12 % (3883185)dis-21_1_sil=8000:lcm=predicate:random_seed=2160719050:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_3000 on theBenchmark for (3000ds/129Mi)
% 2.61/1.12 % (3883183)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3886045344:s2a=on:i=139:gtg=position_3000 on theBenchmark for (3000ds/139Mi)
% 2.61/1.12 % (3883177)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=590291791:i=141193_3000 on theBenchmark for (3000ds/141193Mi)
% 2.61/1.12 % (3883179)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1769561848:i=141695:sd=1:nm=32:gsp=on:ss=included_3000 on theBenchmark for (3000ds/141695Mi)
% 2.61/1.12 % (3883178)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3241064366:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_3000 on theBenchmark for (3000ds/134677Mi)
% 2.61/1.12 % (3883182)Refutation not found, incomplete strategy
% 2.61/1.12 % (3883182)------------------------------
% 2.61/1.12 % (3883182)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.61/1.12 % (3883182)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.61/1.12 % (3883182)CaDiCaL version: 2.1.3
% 2.61/1.12 % (3883182)Termination reason: Refutation not found, incomplete strategy
% 2.61/1.12 % (3883182)Time elapsed: 0.0000 s
% 2.61/1.12 % (3883180)Refutation not found, incomplete strategy
% 2.61/1.12 % (3883180)------------------------------
% 2.61/1.12 % (3883180)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.61/1.12 % (3883182)Peak memory usage: 86 MB
% 2.61/1.12 % (3883180)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.61/1.12 % (3883180)CaDiCaL version: 2.1.3
% 2.61/1.12 % (3883180)Termination reason: Refutation not found, incomplete strategy
% 2.61/1.12 % (3883180)Time elapsed: 0.0000 s
% 2.61/1.12 % (3883180)Peak memory usage: 86 MB
% 2.61/1.12 % (3883183)First to succeed.
% 2.61/1.12 % (3883185)Also succeeded, but the first one will report.
% 2.61/1.12 % (3883183)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3883147"
% 2.61/1.12 % (3883183)Refutation found. Thanks to Tanya!
% 2.61/1.12 % SZS status Theorem for theBenchmark
% 2.61/1.12 % SZS output start Proof for theBenchmark
% See solution above
% 2.61/1.12 % (3883183)------------------------------
% 2.61/1.12 % (3883183)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.61/1.12 % (3883183)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.61/1.12 % (3883183)CaDiCaL version: 2.1.3
% 2.61/1.12 % (3883183)Termination reason: Refutation
% 2.61/1.12 % (3883183)Time elapsed: 0.002 s
% 2.61/1.12 % (3883183)Peak memory usage: 88 MB
% 2.61/1.12 % (3883183)Instructions burned: 1 (million)
% 2.61/1.12 % (3883183)------------------------------
% 2.61/1.12 % (3883183)------------------------------
% 2.61/1.12 % (3883147)Success in time 0.315 s
% 2.61/1.12 % Vampire exiting
%------------------------------------------------------------------------------