TSTP Solution File: NLP267_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NLP267_1 : 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 : n010.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:33 EDT 2024
% Result : Theorem 0.58s 0.74s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 28 ( 4 unt; 7 typ; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 51 ( 23 ~; 16 |; 5 &)
% ( 0 <=>; 7 =>; 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 : 3 ( 1 usr)
% Number of type conns : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 16 ( 14 !; 2 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'$ki_world': $tType ).
tff(func_def_0,type,
'$ki_local_world': '$ki_world' ).
tff(func_def_6,type,
sK0: '$ki_world' ).
tff(pred_def_1,type,
'$ki_accessible': ( '$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(f34,plain,
$false,
inference(subsumption_resolution,[],[f33,f22]) ).
tff(f22,plain,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f21]) ).
tff(f21,plain,
( ~ price(sK0,seventy)
& '$ki_accessible'('$ki_local_world',sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f20]) ).
tff(f20,plain,
( ? [X0: '$ki_world'] :
( ~ price(X0,seventy)
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ~ price(sK0,seventy)
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f9,plain,
? [X0: '$ki_world'] :
( ~ price(X0,seventy)
& '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f8]) ).
tff(f8,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> price(X0,seventy) ),
inference(negated_conjecture,[],[f7]) ).
tff(f7,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> price(X0,seventy) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f33,plain,
~ '$ki_accessible'('$ki_local_world',sK0),
inference(resolution,[],[f32,f23]) ).
tff(f23,plain,
~ price(sK0,seventy),
inference(cnf_transformation,[],[f21]) ).
tff(f32,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(subsumption_resolution,[],[f31,f25]) ).
tff(f25,plain,
! [X0: '$ki_world'] :
( dest(X0,paris)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f11]) ).
tff(f11,plain,
! [X0: '$ki_world'] :
( dest(X0,paris)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f5]) ).
tff(f5,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> dest(X0,paris) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',belief1) ).
tff(f31,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ dest(X0,paris)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(subsumption_resolution,[],[f28,f24]) ).
tff(f24,plain,
! [X0: '$ki_world'] :
( class(X0,second)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f10]) ).
tff(f10,plain,
! [X0: '$ki_world'] :
( class(X0,second)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f6]) ).
tff(f6,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> class(X0,second) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',belief2) ).
tff(f28,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ class(X0,second)
| ~ dest(X0,paris)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f17]) ).
tff(f17,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ class(X0,second)
| ~ dest(X0,paris)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(flattening,[],[f16]) ).
tff(f16,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ class(X0,second)
| ~ dest(X0,paris)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f2]) ).
tff(f2,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ( class(X0,second)
& dest(X0,paris) )
=> price(X0,seventy) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',law2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP267_1 : 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n010.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:18:52 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TF0_THM_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/benchmark/theBenchmark.p
% 0.58/0.74 % (13811)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.58/0.74 % (13811)Refutation not found, incomplete strategy% (13811)------------------------------
% 0.58/0.74 % (13811)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74 % (13811)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.74
% 0.58/0.74 % (13811)Memory used [KB]: 947
% 0.58/0.74 % (13811)Time elapsed: 0.002 s
% 0.58/0.74 % (13811)Instructions burned: 2 (million)
% 0.58/0.74 % (13811)------------------------------
% 0.58/0.74 % (13811)------------------------------
% 0.58/0.74 % (13804)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.58/0.74 % (13806)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.58/0.74 % (13805)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.58/0.74 % (13807)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.58/0.74 % (13807)Refutation not found, incomplete strategy% (13807)------------------------------
% 0.58/0.74 % (13807)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74 % (13807)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.74
% 0.58/0.74 % (13807)Memory used [KB]: 943
% 0.58/0.74 % (13807)Time elapsed: 0.002 s
% 0.58/0.74 % (13807)Instructions burned: 2 (million)
% 0.58/0.74 % (13807)------------------------------
% 0.58/0.74 % (13807)------------------------------
% 0.58/0.74 % (13806)First to succeed.
% 0.58/0.74 % (13804)Also succeeded, but the first one will report.
% 0.58/0.74 % (13805)Also succeeded, but the first one will report.
% 0.58/0.74 % (13806)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-13798"
% 0.58/0.74 % (13806)Refutation found. Thanks to Tanya!
% 0.58/0.74 % SZS status Theorem for theBenchmark
% 0.58/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.74 % (13806)------------------------------
% 0.58/0.74 % (13806)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74 % (13806)Termination reason: Refutation
% 0.58/0.74
% 0.58/0.74 % (13806)Memory used [KB]: 972
% 0.58/0.74 % (13806)Time elapsed: 0.003 s
% 0.58/0.74 % (13806)Instructions burned: 3 (million)
% 0.58/0.74 % (13798)Success in time 0.376 s
% 0.58/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------