TSTP Solution File: NLP265_17 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : NLP265_17 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 01:05:43 EDT 2024
% Result : Theorem 0.14s 0.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 22
% Syntax : Number of formulae : 32 ( 5 unt; 17 typ; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 32 ( 11 ~; 2 |; 10 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 14 ( 14 fml; 0 var)
% Number of types : 4 ( 2 usr)
% Number of type conns : 11 ( 8 >; 3 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-1 aty)
% Number of variables : 20 ( 14 !; 6 ?; 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_alice)': '$ki_index' ).
tff(func_def_2,type,
'#idx(b_bob)': '$ki_index' ).
tff(func_def_3,type,
'#idx(i_bob)': '$ki_index' ).
tff(func_def_4,type,
'#idx(i_alice)': '$ki_index' ).
tff(func_def_6,type,
sK2: '$ki_world' ).
tff(func_def_7,type,
sK3: '$ki_world' ).
tff(func_def_8,type,
sK4: '$ki_world' > '$ki_world' ).
tff(func_def_9,type,
sK5: '$ki_world' > '$ki_world' ).
tff(func_def_10,type,
sK6: '$ki_world' > '$ki_world' ).
tff(func_def_11,type,
sK7: '$ki_world' > '$ki_world' ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_index' * '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
bigcity: ( '$ki_world' * $i ) > $o ).
tff(pred_def_3,type,
sP0: '$ki_world' > $o ).
tff(pred_def_4,type,
sP1: '$ki_world' > $o ).
tff(f61,plain,
$false,
inference(resolution,[],[f60,f45]) ).
tff(f45,plain,
~ bigcity(sK3,portland),
inference(cnf_transformation,[],[f28]) ).
tff(f28,plain,
( ~ bigcity(sK3,portland)
& '$ki_accessible'('#idx(b_bob)',sK2,sK3)
& '$ki_accessible'('#idx(i_alice)','$ki_local_world',sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f15,f27,f26]) ).
tff(f26,plain,
( ? [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( ~ bigcity(X1,portland)
& '$ki_accessible'('#idx(b_bob)',X0,X1) )
& '$ki_accessible'('#idx(i_alice)','$ki_local_world',X0) )
=> ( ? [X1: '$ki_world'] :
( ~ bigcity(X1,portland)
& '$ki_accessible'('#idx(b_bob)',sK2,X1) )
& '$ki_accessible'('#idx(i_alice)','$ki_local_world',sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f27,plain,
( ? [X1: '$ki_world'] :
( ~ bigcity(X1,portland)
& '$ki_accessible'('#idx(b_bob)',sK2,X1) )
=> ( ~ bigcity(sK3,portland)
& '$ki_accessible'('#idx(b_bob)',sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
tff(f15,plain,
? [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( ~ bigcity(X1,portland)
& '$ki_accessible'('#idx(b_bob)',X0,X1) )
& '$ki_accessible'('#idx(i_alice)','$ki_local_world',X0) ),
inference(ennf_transformation,[],[f11]) ).
tff(f11,plain,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(i_alice)','$ki_local_world',X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(b_bob)',X0,X1)
=> bigcity(X1,portland) ) ),
inference(rectify,[],[f10]) ).
tff(f10,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(i_alice)','$ki_local_world',X0)
=> ! [X2: '$ki_world'] :
( '$ki_accessible'('#idx(b_bob)',X0,X2)
=> bigcity(X2,portland) ) ),
inference(negated_conjecture,[],[f9]) ).
tff(f9,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(i_alice)','$ki_local_world',X0)
=> ! [X2: '$ki_world'] :
( '$ki_accessible'('#idx(b_bob)',X0,X2)
=> bigcity(X2,portland) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f60,plain,
! [X0: '$ki_world'] : bigcity(X0,portland),
inference(subsumption_resolution,[],[f46,f59]) ).
tff(f59,plain,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_alice)',X0,X1),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_alice)',X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','mrel_universal_#idx(b_alice)') ).
tff(f46,plain,
! [X0: '$ki_world'] :
( bigcity(X0,portland)
| ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0) ),
inference(cnf_transformation,[],[f16]) ).
tff(f16,plain,
! [X0: '$ki_world'] :
( bigcity(X0,portland)
| ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0) ),
inference(ennf_transformation,[],[f7]) ).
tff(f7,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0)
=> bigcity(X0,portland) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NLP265_17 : TPTP v8.2.0. Released v8.2.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 22:45:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % (20743)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (20745)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.37 % (20744)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.37 % (20746)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.14/0.37 % (20747)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.14/0.37 % (20748)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.37 % (20749)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.37 % (20750)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.37 % (20749)Also succeeded, but the first one will report.
% 0.14/0.37 % (20748)First to succeed.
% 0.14/0.37 % (20748)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-20743"
% 0.14/0.37 % (20746)Also succeeded, but the first one will report.
% 0.14/0.37 Detected minimum model sizes of [1,1,1]
% 0.14/0.37 Detected maximum model sizes of [max,4,1]
% 0.14/0.37 % (20748)Refutation found. Thanks to Tanya!
% 0.14/0.37 % SZS status Theorem for theBenchmark
% 0.14/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.37 % (20748)------------------------------
% 0.14/0.37 % (20748)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.37 % (20748)Termination reason: Refutation
% 0.14/0.37
% 0.14/0.37 % (20748)Memory used [KB]: 738
% 0.14/0.37 % (20748)Time elapsed: 0.003 s
% 0.14/0.37 % (20748)Instructions burned: 3 (million)
% 0.14/0.37 % (20743)Success in time 0.007 s
%------------------------------------------------------------------------------