TSTP Solution File: NLP267_17 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NLP267_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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n002.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:03:32 EDT 2024
% Result : Theorem 0.55s 0.74s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of formulae : 29 ( 4 unt; 10 typ; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 50 ( 22 ~; 15 |; 7 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 28 ( 28 fml; 0 var)
% Number of types : 4 ( 2 usr)
% Number of type conns : 9 ( 4 >; 5 *; 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 : 14 ( 12 !; 2 ?; 14 :)
% 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(f44,plain,
$false,
inference(subsumption_resolution,[],[f43,f28]) ).
tff(f28,plain,
'$ki_accessible'('#idx(b_s)','$ki_local_world',sK0),
inference(cnf_transformation,[],[f27]) ).
tff(f27,plain,
( ~ price(sK0,seventy)
& '$ki_accessible'('#idx(b_s)','$ki_local_world',sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f12,f26]) ).
tff(f26,plain,
( ? [X0: '$ki_world'] :
( ~ price(X0,seventy)
& '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) )
=> ( ~ price(sK0,seventy)
& '$ki_accessible'('#idx(b_s)','$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f12,plain,
? [X0: '$ki_world'] :
( ~ price(X0,seventy)
& '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(ennf_transformation,[],[f11]) ).
tff(f11,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(b_s)','$ki_local_world',X0)
=> price(X0,seventy) ),
inference(negated_conjecture,[],[f10]) ).
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(f43,plain,
~ '$ki_accessible'('#idx(b_s)','$ki_local_world',sK0),
inference(resolution,[],[f42,f29]) ).
tff(f29,plain,
~ price(sK0,seventy),
inference(cnf_transformation,[],[f27]) ).
tff(f42,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(subsumption_resolution,[],[f41,f30]) ).
tff(f30,plain,
! [X0: '$ki_world'] :
( dest(X0,paris)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(cnf_transformation,[],[f13]) ).
tff(f13,plain,
! [X0: '$ki_world'] :
( ( class(X0,second)
& dest(X0,paris) )
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(ennf_transformation,[],[f9]) ).
tff(f9,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(b_s)','$ki_local_world',X0)
=> ( class(X0,second)
& dest(X0,paris) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
tff(f41,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ dest(X0,paris)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(subsumption_resolution,[],[f36,f31]) ).
tff(f31,plain,
! [X0: '$ki_world'] :
( class(X0,second)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(cnf_transformation,[],[f13]) ).
tff(f36,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ class(X0,second)
| ~ dest(X0,paris)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(cnf_transformation,[],[f23]) ).
tff(f23,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ class(X0,second)
| ~ dest(X0,paris)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(flattening,[],[f22]) ).
tff(f22,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ class(X0,second)
| ~ dest(X0,paris)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(ennf_transformation,[],[f4]) ).
tff(f4,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(b_s)','$ki_local_world',X0)
=> ( ( class(X0,second)
& dest(X0,paris) )
=> price(X0,seventy) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP267_17 : TPTP v8.2.0. Released v8.2.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n002.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 21:40:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TF0_THM_NEQ_NAR problem
% 0.15/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.74 % (5217)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 theBenchmark for (2996ds/83Mi)
% 0.55/0.74 % (5217)Refutation not found, incomplete strategy% (5217)------------------------------
% 0.55/0.74 % (5217)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (5217)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.74
% 0.55/0.74 % (5217)Memory used [KB]: 952
% 0.55/0.74 % (5217)Time elapsed: 0.002 s
% 0.55/0.74 % (5217)Instructions burned: 2 (million)
% 0.55/0.74 % (5213)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.74 % (5214)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.55/0.74 % (5212)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 theBenchmark for (2996ds/51Mi)
% 0.55/0.74 % (5211)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 theBenchmark for (2996ds/34Mi)
% 0.55/0.74 % (5215)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 theBenchmark for (2996ds/34Mi)
% 0.55/0.74 % (5217)------------------------------
% 0.55/0.74 % (5217)------------------------------
% 0.55/0.74 % (5214)Refutation not found, incomplete strategy% (5214)------------------------------
% 0.55/0.74 % (5214)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (5216)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.55/0.74 % (5214)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.74
% 0.55/0.74 % (5214)Memory used [KB]: 944
% 0.55/0.74 % (5214)Time elapsed: 0.002 s
% 0.55/0.74 % (5214)Instructions burned: 2 (million)
% 0.55/0.74 % (5214)------------------------------
% 0.55/0.74 % (5214)------------------------------
% 0.55/0.74 % (5215)Refutation not found, incomplete strategy% (5215)------------------------------
% 0.55/0.74 % (5215)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (5215)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.74
% 0.55/0.74 % (5215)Memory used [KB]: 953
% 0.55/0.74 % (5216)Refutation not found, incomplete strategy% (5216)------------------------------
% 0.55/0.74 % (5216)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (5216)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.74
% 0.55/0.74 % (5216)Memory used [KB]: 944
% 0.55/0.74 % (5216)Time elapsed: 0.002 s
% 0.55/0.74 % (5216)Instructions burned: 2 (million)
% 0.55/0.74 % (5215)Time elapsed: 0.002 s
% 0.55/0.74 % (5215)Instructions burned: 2 (million)
% 0.55/0.74 % (5213)First to succeed.
% 0.55/0.74 % (5211)Also succeeded, but the first one will report.
% 0.55/0.74 % (5212)Also succeeded, but the first one will report.
% 0.55/0.74 % (5216)------------------------------
% 0.55/0.74 % (5216)------------------------------
% 0.55/0.74 % (5215)------------------------------
% 0.55/0.74 % (5215)------------------------------
% 0.55/0.74 % (5213)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-5210"
% 0.55/0.74 % (5213)Refutation found. Thanks to Tanya!
% 0.55/0.74 % SZS status Theorem for theBenchmark
% 0.55/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.74 % (5213)------------------------------
% 0.55/0.74 % (5213)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (5213)Termination reason: Refutation
% 0.55/0.74
% 0.55/0.74 % (5213)Memory used [KB]: 974
% 0.55/0.74 % (5213)Time elapsed: 0.003 s
% 0.55/0.74 % (5213)Instructions burned: 3 (million)
% 0.55/0.74 % (5210)Success in time 0.374 s
% 0.55/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------