TSTP Solution File: NLP265_17 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : NLP265_17 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n024.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 : Mon May 22 15:39:54 EDT 2023
% Result : Theorem 0.21s 0.51s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 20
% Syntax : Number of formulae : 41 ( 10 unt; 13 typ; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 48 ( 25 ~; 15 |; 0 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 13 ( 13 fml; 0 var)
% Number of types : 4 ( 2 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 5 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-1 aty)
% Number of variables : 32 (; 32 !; 0 ?; 32 :)
% 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,
sK0: '$ki_world' > '$ki_world' ).
tff(func_def_7,type,
sK1: '$ki_world' > '$ki_world' ).
tff(func_def_8,type,
sK2: '$ki_world' ).
tff(func_def_9,type,
sK3: '$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(f69,plain,
$false,
inference(avatar_sat_refutation,[],[f62,f64,f66,f68]) ).
tff(f68,plain,
~ spl4_5,
inference(avatar_contradiction_clause,[],[f67]) ).
tff(f67,plain,
( $false
| ~ spl4_5 ),
inference(subsumption_resolution,[],[f61,f36]) ).
tff(f36,plain,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_alice)',X1,X0),
inference(cnf_transformation,[],[f15]) ).
tff(f15,plain,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_alice)',X1,X0),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
! [X1: '$ki_world',X0: '$ki_world'] : '$ki_accessible'('#idx(b_alice)',X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','mrel_universal_#idx(b_alice)') ).
tff(f61,plain,
( ! [X0: '$ki_world'] : ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0)
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f60]) ).
tff(f60,plain,
( spl4_5
<=> ! [X0: '$ki_world'] : ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_5])]) ).
tff(f66,plain,
( ~ spl4_1
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[],[f65]) ).
tff(f65,plain,
( $false
| ~ spl4_1
| ~ spl4_4 ),
inference(subsumption_resolution,[],[f44,f58]) ).
tff(f58,plain,
( ! [X1: '$ki_world'] : ~ bigcity(X1,portland)
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f57]) ).
tff(f57,plain,
( spl4_4
<=> ! [X1: '$ki_world'] : ~ bigcity(X1,portland) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
tff(f44,plain,
( ! [X2: '$ki_world'] : bigcity(X2,portland)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f43]) ).
tff(f43,plain,
( spl4_1
<=> ! [X2: '$ki_world'] : bigcity(X2,portland) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
tff(f64,plain,
spl4_1,
inference(avatar_split_clause,[],[f63,f43]) ).
tff(f63,plain,
! [X0: '$ki_world'] : bigcity(X0,portland),
inference(subsumption_resolution,[],[f37,f36]) ).
tff(f37,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0)
| bigcity(X0,portland) ),
inference(cnf_transformation,[],[f20]) ).
tff(f20,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) ).
tff(f62,plain,
( spl4_4
| spl4_5 ),
inference(avatar_split_clause,[],[f55,f60,f57]) ).
tff(f55,plain,
! [X0: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0)
| ~ bigcity(X1,portland) ),
inference(subsumption_resolution,[],[f38,f39]) ).
tff(f39,plain,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_bob)',X1,X0),
inference(cnf_transformation,[],[f13]) ).
tff(f13,plain,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_bob)',X1,X0),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X1: '$ki_world',X0: '$ki_world'] : '$ki_accessible'('#idx(b_bob)',X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','mrel_universal_#idx(b_bob)') ).
tff(f38,plain,
! [X0: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0)
| ~ '$ki_accessible'('#idx(b_bob)',X0,X1)
| ~ bigcity(X1,portland) ),
inference(cnf_transformation,[],[f18]) ).
tff(f18,plain,
! [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( ~ '$ki_accessible'('#idx(b_bob)',X0,X1)
| ~ bigcity(X1,portland) )
| ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0) ),
inference(ennf_transformation,[],[f12]) ).
tff(f12,plain,
! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(b_bob)',X0,X1)
=> ~ bigcity(X1,portland) ) ),
inference(rectify,[],[f8]) ).
tff(f8,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(b_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',axiom_3) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP265_17 : TPTP v8.2.0. Released v8.2.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 22 12:07:20 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.50 % (22994)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.50 % (23011)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.21/0.50 % (22994)First to succeed.
% 0.21/0.50 % (23013)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.21/0.51 % (23014)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.21/0.51 % (22994)Refutation found. Thanks to Tanya!
% 0.21/0.51 % SZS status Theorem for theBenchmark
% 0.21/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51 % (22994)------------------------------
% 0.21/0.51 % (22994)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (22994)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (22994)Termination reason: Refutation
% 0.21/0.51
% 0.21/0.51 % (22994)Memory used [KB]: 5884
% 0.21/0.51 % (22994)Time elapsed: 0.004 s
% 0.21/0.51 % (22994)Instructions burned: 1 (million)
% 0.21/0.51 % (22994)------------------------------
% 0.21/0.51 % (22994)------------------------------
% 0.21/0.51 % (22988)Success in time 0.156 s
%------------------------------------------------------------------------------