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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n012.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:12 EDT 2024
% Result : Theorem 0.65s 0.80s
% Output : Refutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 32 ( 7 unt; 10 typ; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 49 ( 21 ~; 15 |; 7 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 31 ( 31 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 : 21 ( 19 !; 2 ?; 21 :)
% 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(f48,plain,
$false,
inference(resolution,[],[f47,f29]) ).
tff(f29,plain,
~ price(sK0,seventy),
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/sandbox/tmp/tmp.FjopG1r5tg/Vampire---4.8_23694',verify) ).
tff(f47,plain,
! [X0: '$ki_world'] : price(X0,seventy),
inference(subsumption_resolution,[],[f46,f38]) ).
tff(f38,plain,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_s)',X0,X1),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_s)',X0,X1),
file('/export/starexec/sandbox/tmp/tmp.FjopG1r5tg/Vampire---4.8_23694','mrel_universal_#idx(b_s)') ).
tff(f46,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(subsumption_resolution,[],[f45,f39]) ).
tff(f39,plain,
! [X0: '$ki_world'] : dest(X0,paris),
inference(subsumption_resolution,[],[f30,f38]) ).
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/sandbox/tmp/tmp.FjopG1r5tg/Vampire---4.8_23694',axiom_5) ).
tff(f45,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ dest(X0,paris)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(subsumption_resolution,[],[f36,f40]) ).
tff(f40,plain,
! [X0: '$ki_world'] : class(X0,second),
inference(subsumption_resolution,[],[f31,f38]) ).
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/sandbox/tmp/tmp.FjopG1r5tg/Vampire---4.8_23694',axiom_2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NLP267_17 : TPTP v8.2.0. Released v8.2.0.
% 0.07/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.15/0.37 % Computer : n012.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri May 3 12:29:10 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TF0_THM_RFO_NEQ_NAR problem
% 0.15/0.37 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.FjopG1r5tg/Vampire---4.8_23694
% 0.65/0.80 % (23807)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.65/0.80 % (23807)Refutation not found, incomplete strategy% (23807)------------------------------
% 0.65/0.80 % (23807)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.65/0.80 % (23807)Termination reason: Refutation not found, incomplete strategy
% 0.65/0.80
% 0.65/0.80 % (23807)Memory used [KB]: 944
% 0.65/0.80 % (23807)Time elapsed: 0.001 s
% 0.65/0.80 % (23807)Instructions burned: 2 (million)
% 0.65/0.80 % (23807)------------------------------
% 0.65/0.80 % (23807)------------------------------
% 0.65/0.80 % (23802)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 (2995ds/34Mi)
% 0.65/0.80 % (23804)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.65/0.80 % (23804)Also succeeded, but the first one will report.
% 0.65/0.80 % (23802)First to succeed.
% 0.65/0.80 % (23802)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-23801"
% 0.65/0.80 % (23806)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 (2995ds/34Mi)
% 0.65/0.80 % (23809)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.65/0.80 % (23802)Refutation found. Thanks to Tanya!
% 0.65/0.80 % SZS status Theorem for Vampire---4
% 0.65/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.65/0.80 % (23802)------------------------------
% 0.65/0.80 % (23802)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.65/0.80 % (23802)Termination reason: Refutation
% 0.65/0.80
% 0.65/0.80 % (23802)Memory used [KB]: 962
% 0.65/0.80 % (23802)Time elapsed: 0.003 s
% 0.65/0.80 % (23802)Instructions burned: 3 (million)
% 0.65/0.80 % (23801)Success in time 0.427 s
% 0.65/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------