TSTP Solution File: NLP265_17 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% 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 file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n017.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 : Sun May 5 08:05:09 EDT 2024
% Result : Theorem 0.58s 0.75s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 20
% Syntax : Number of formulae : 28 ( 4 unt; 17 typ; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 17 ( 6 ~; 2 |; 2 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 8 ( 8 fml; 0 var)
% Number of types : 4 ( 2 usr)
% Number of type conns : 12 ( 8 >; 4 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 2 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-1 aty)
% Number of variables : 15 ( 13 !; 2 ?; 15 :)
% 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' ).
tff(func_def_7,type,
sK1: '$ki_world' ).
tff(func_def_8,type,
sK2: '$ki_world' > '$ki_world' ).
tff(func_def_9,type,
sK3: '$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,
sP4: ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_4,type,
sP5: '$ki_world' > $o ).
tff(pred_def_5,type,
sP6: '$ki_world' > $o ).
tff(pred_def_6,type,
sP7: '$ki_world' > $o ).
tff(f39,plain,
$false,
inference(unit_resulting_resolution,[],[f30,f20,f23]) ).
tff(f23,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0)
| bigcity(X0,portland) ),
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/sandbox/tmp/tmp.166SpeuVXu/Vampire---4.8_21346',axiom_2) ).
tff(f20,plain,
~ bigcity(sK1,portland),
inference(cnf_transformation,[],[f14]) ).
tff(f14,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/sandbox/tmp/tmp.166SpeuVXu/Vampire---4.8_21346',verify) ).
tff(f30,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/sandbox/tmp/tmp.166SpeuVXu/Vampire---4.8_21346','mrel_universal_#idx(b_alice)') ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NLP265_17 : TPTP v8.2.0. Released v8.2.0.
% 0.08/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 12:19:21 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TF0_THM_RFO_NEQ_NAR problem
% 0.14/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.166SpeuVXu/Vampire---4.8_21346
% 0.58/0.75 % (21601)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.58/0.75 % (21595)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.58/0.75 % (21601)First to succeed.
% 0.58/0.75 % (21597)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.58/0.75 % (21598)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.58/0.75 % (21599)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.58/0.75 % (21596)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.58/0.75 % (21600)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.58/0.75 % (21601)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-21591"
% 0.58/0.75 % (21601)Refutation found. Thanks to Tanya!
% 0.58/0.75 % SZS status Theorem for Vampire---4
% 0.58/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.75 % (21601)------------------------------
% 0.58/0.75 % (21601)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75 % (21601)Termination reason: Refutation
% 0.58/0.75
% 0.58/0.75 % (21601)Memory used [KB]: 964
% 0.58/0.75 % (21601)Time elapsed: 0.002 s
% 0.58/0.75 % (21601)Instructions burned: 3 (million)
% 0.58/0.75 % (21591)Success in time 0.387 s
% 0.58/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------