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.1.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 : n004.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:29 EDT 2024
% Result : ContradictoryAxioms 0.15s 0.41s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 32
% Syntax : Number of formulae : 74 ( 35 unt; 25 typ; 0 def)
% Number of atoms : 239 ( 53 equ; 0 cnn)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 299 ( 12 ~; 13 |; 0 &; 244 @)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Number of types : 4 ( 2 usr)
% Number of type conns : 59 ( 59 >; 0 *; 0 +; 0 <<)
% Number of symbols : 26 ( 22 usr; 11 con; 0-3 aty)
% ( 11 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 76 ( 50 ^ 26 !; 0 ?; 76 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
mindex: $tType ).
thf(type_def_6,type,
mworld: $tType ).
thf(func_def_0,type,
mworld: $tType ).
thf(func_def_1,type,
mindex: $tType ).
thf(func_def_2,type,
mrel: mindex > mworld > mworld > $o ).
thf(func_def_3,type,
'#i_alice': mindex ).
thf(func_def_4,type,
'#i_bob': mindex ).
thf(func_def_5,type,
'#b_alice': mindex ).
thf(func_def_6,type,
'#b_bob': mindex ).
thf(func_def_7,type,
mactual: mworld ).
thf(func_def_8,type,
mlocal: ( mworld > $o ) > $o ).
thf(func_def_10,type,
mnot: ( mworld > $o ) > mworld > $o ).
thf(func_def_11,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_12,type,
mor: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_13,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_14,type,
mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_15,type,
mbox: mindex > ( mworld > $o ) > mworld > $o ).
thf(func_def_16,type,
mdia: mindex > ( mworld > $o ) > mworld > $o ).
thf(func_def_18,type,
bigcity: $i > mworld > $o ).
thf(func_def_34,type,
sK1: mworld > mworld ).
thf(func_def_35,type,
sK2: mworld > mworld ).
thf(func_def_36,type,
sK3: mworld > mworld ).
thf(func_def_37,type,
sK4: mworld > mworld ).
thf(func_def_38,type,
sK5: mworld ).
thf(func_def_39,type,
sK6: mworld ).
thf(f191,plain,
$false,
inference(trivial_inequality_removal,[],[f190]) ).
thf(f190,plain,
$true = $false,
inference(superposition,[],[f176,f188]) ).
thf(f188,plain,
( $false
= ( bigcity @ portland @ mactual ) ),
inference(trivial_inequality_removal,[],[f186]) ).
thf(f186,plain,
( ( $false
= ( bigcity @ portland @ mactual ) )
| ( $true = $false ) ),
inference(superposition,[],[f85,f183]) ).
thf(f183,plain,
! [X0: mworld] :
( ( ( mrel @ '#b_alice' @ mactual @ X0 )
= $false )
| ( ( bigcity @ portland @ X0 )
= $false ) ),
inference(trivial_inequality_removal,[],[f179]) ).
thf(f179,plain,
! [X0: mworld] :
( ( ( mrel @ '#b_alice' @ mactual @ X0 )
= $false )
| ( ( bigcity @ portland @ X0 )
= $false )
| ( $true = $false ) ),
inference(superposition,[],[f82,f172]) ).
thf(f172,plain,
! [X2: mworld,X1: mworld] :
( ( $false
= ( mrel @ '#b_bob' @ X1 @ X2 ) )
| ( ( mrel @ '#b_alice' @ mactual @ X1 )
= $false )
| ( $false
= ( bigcity @ portland @ X2 ) ) ),
inference(not_proxy_clausification,[],[f171]) ).
thf(f171,plain,
! [X2: mworld,X1: mworld] :
( ( ( mrel @ '#b_alice' @ mactual @ X1 )
= $false )
| ( $false
= ( mrel @ '#b_bob' @ X1 @ X2 ) )
| ( $true
= ( ~ ( bigcity @ portland @ X2 ) ) ) ),
inference(binary_proxy_clausification,[],[f170]) ).
thf(f170,plain,
! [X2: mworld,X1: mworld] :
( ( $true
= ( ( mrel @ '#b_bob' @ X1 @ X2 )
=> ~ ( bigcity @ portland @ X2 ) ) )
| ( ( mrel @ '#b_alice' @ mactual @ X1 )
= $false ) ),
inference(beta_eta_normalization,[],[f169]) ).
thf(f169,plain,
! [X2: mworld,X1: mworld] :
( ( ( ^ [Y0: mworld] :
( ( mrel @ '#b_bob' @ X1 @ Y0 )
=> ~ ( bigcity @ portland @ Y0 ) )
@ X2 )
= $true )
| ( ( mrel @ '#b_alice' @ mactual @ X1 )
= $false ) ),
inference(pi_clausification,[],[f168]) ).
thf(f168,plain,
! [X1: mworld] :
( ( ( mrel @ '#b_alice' @ mactual @ X1 )
= $false )
| ( $true
= ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ '#b_bob' @ X1 @ Y0 )
=> ~ ( bigcity @ portland @ Y0 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f167]) ).
thf(f167,plain,
! [X1: mworld] :
( $true
= ( ( mrel @ '#b_alice' @ mactual @ X1 )
=> ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ '#b_bob' @ X1 @ Y0 )
=> ~ ( bigcity @ portland @ Y0 ) ) ) ) ),
inference(beta_eta_normalization,[],[f166]) ).
thf(f166,plain,
! [X1: mworld] :
( $true
= ( ^ [Y0: mworld] :
( ( mrel @ '#b_alice' @ mactual @ Y0 )
=> ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ '#b_bob' @ Y0 @ Y1 )
=> ~ ( bigcity @ portland @ Y1 ) ) ) )
@ X1 ) ),
inference(pi_clausification,[],[f165]) ).
thf(f165,plain,
( ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ '#b_alice' @ mactual @ Y0 )
=> ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ '#b_bob' @ Y0 @ Y1 )
=> ~ ( bigcity @ portland @ Y1 ) ) ) ) )
= $true ),
inference(beta_eta_normalization,[],[f96]) ).
thf(f96,plain,
( ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: mindex,Y1: mworld > $o,Y2: mworld] :
( !! @ mworld
@ ^ [Y3: mworld] :
( ( mrel @ Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) )
@ '#b_alice'
@ ( ^ [Y0: mindex,Y1: mworld > $o,Y2: mworld] :
( !! @ mworld
@ ^ [Y3: mworld] :
( ( mrel @ Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) )
@ '#b_bob'
@ ( ^ [Y0: mworld > $o,Y1: mworld] :
~ ( Y0 @ Y1 )
@ ( bigcity @ portland ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f77,f87,f75,f75,f94]) ).
thf(f94,plain,
( mnot
= ( ^ [Y0: mworld > $o,Y1: mworld] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f40]) ).
thf(f40,plain,
( mnot
= ( ^ [Y0: mworld > $o,Y1: mworld] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f39]) ).
thf(f39,plain,
( mnot
= ( ^ [X0: mworld > $o,X1: mworld] :
~ ( X0 @ X1 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
( mnot
= ( ^ [X1: mworld > $o,X2: mworld] :
~ ( X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot_def) ).
thf(f75,plain,
( mbox
= ( ^ [Y0: mindex,Y1: mworld > $o,Y2: mworld] :
( !! @ mworld
@ ^ [Y3: mworld] :
( ( mrel @ Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f29,plain,
( mbox
= ( ^ [Y0: mindex,Y1: mworld > $o,Y2: mworld] :
( !! @ mworld
@ ^ [Y3: mworld] :
( ( mrel @ Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(fool_elimination,[],[f28]) ).
thf(f28,plain,
( mbox
= ( ^ [X0: mindex,X1: mworld > $o,X2: mworld] :
! [X3: mworld] :
( ( mrel @ X0 @ X2 @ X3 )
=> ( X1 @ X3 ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,axiom,
( mbox
= ( ^ [X4: mindex,X0: mworld > $o,X2: mworld] :
! [X5: mworld] :
( ( mrel @ X4 @ X2 @ X5 )
=> ( X0 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox_def) ).
thf(f87,plain,
( mlocal
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual ) ) ),
inference(cnf_transformation,[],[f30]) ).
thf(f30,plain,
( mlocal
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual ) ) ),
inference(fool_elimination,[],[f1]) ).
thf(f1,axiom,
( ( ^ [X0: mworld > $o] : ( X0 @ mactual ) )
= mlocal ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mlocal_def) ).
thf(f77,plain,
( ( mlocal @ ( mbox @ '#b_alice' @ ( mbox @ '#b_bob' @ ( mnot @ ( bigcity @ portland ) ) ) ) )
= $true ),
inference(cnf_transformation,[],[f25]) ).
thf(f25,plain,
( ( mlocal @ ( mbox @ '#b_alice' @ ( mbox @ '#b_bob' @ ( mnot @ ( bigcity @ portland ) ) ) ) )
= $true ),
inference(fool_elimination,[],[f24]) ).
thf(f24,plain,
mlocal @ ( mbox @ '#b_alice' @ ( mbox @ '#b_bob' @ ( mnot @ ( bigcity @ portland ) ) ) ),
inference(rectify,[],[f20]) ).
thf(f20,axiom,
mlocal @ ( mbox @ '#b_alice' @ ( mbox @ '#b_bob' @ ( mnot @ ( bigcity @ portland ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
thf(f82,plain,
! [X0: mworld] :
( ( mrel @ '#b_bob' @ X0 @ X0 )
= $true ),
inference(cnf_transformation,[],[f38]) ).
thf(f38,plain,
! [X0: mworld] :
( ( mrel @ '#b_bob' @ X0 @ X0 )
= $true ),
inference(fool_elimination,[],[f37]) ).
thf(f37,plain,
! [X0: mworld] : ( mrel @ '#b_bob' @ X0 @ X0 ),
inference(rectify,[],[f15]) ).
thf(f15,axiom,
! [X2: mworld] : ( mrel @ '#b_bob' @ X2 @ X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','mrel_#b_bob_reflexive') ).
thf(f85,plain,
! [X0: mworld] :
( ( mrel @ '#b_alice' @ X0 @ X0 )
= $true ),
inference(cnf_transformation,[],[f64]) ).
thf(f64,plain,
! [X0: mworld] :
( ( mrel @ '#b_alice' @ X0 @ X0 )
= $true ),
inference(fool_elimination,[],[f63]) ).
thf(f63,plain,
! [X0: mworld] : ( mrel @ '#b_alice' @ X0 @ X0 ),
inference(rectify,[],[f13]) ).
thf(f13,axiom,
! [X2: mworld] : ( mrel @ '#b_alice' @ X2 @ X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','mrel_#b_alice_reflexive') ).
thf(f176,plain,
( $true
= ( bigcity @ portland @ mactual ) ),
inference(trivial_inequality_removal,[],[f173]) ).
thf(f173,plain,
( ( $true = $false )
| ( $true
= ( bigcity @ portland @ mactual ) ) ),
inference(superposition,[],[f164,f85]) ).
thf(f164,plain,
! [X1: mworld] :
( ( ( mrel @ '#b_alice' @ mactual @ X1 )
= $false )
| ( ( bigcity @ portland @ X1 )
= $true ) ),
inference(binary_proxy_clausification,[],[f163]) ).
thf(f163,plain,
! [X1: mworld] :
( $true
= ( ( mrel @ '#b_alice' @ mactual @ X1 )
=> ( bigcity @ portland @ X1 ) ) ),
inference(beta_eta_normalization,[],[f162]) ).
thf(f162,plain,
! [X1: mworld] :
( ( ^ [Y0: mworld] :
( ( mrel @ '#b_alice' @ mactual @ Y0 )
=> ( bigcity @ portland @ Y0 ) )
@ X1 )
= $true ),
inference(pi_clausification,[],[f161]) ).
thf(f161,plain,
( $true
= ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ '#b_alice' @ mactual @ Y0 )
=> ( bigcity @ portland @ Y0 ) ) ) ),
inference(beta_eta_normalization,[],[f99]) ).
thf(f99,plain,
( ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: mindex,Y1: mworld > $o,Y2: mworld] :
( !! @ mworld
@ ^ [Y3: mworld] :
( ( mrel @ Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) )
@ '#b_alice'
@ ( bigcity @ portland ) ) )
= $true ),
inference(definition_unfolding,[],[f91,f87,f75]) ).
thf(f91,plain,
( ( mlocal @ ( mbox @ '#b_alice' @ ( bigcity @ portland ) ) )
= $true ),
inference(cnf_transformation,[],[f48]) ).
thf(f48,plain,
( ( mlocal @ ( mbox @ '#b_alice' @ ( bigcity @ portland ) ) )
= $true ),
inference(fool_elimination,[],[f47]) ).
thf(f47,plain,
mlocal @ ( mbox @ '#b_alice' @ ( bigcity @ portland ) ),
inference(rectify,[],[f19]) ).
thf(f19,axiom,
mlocal @ ( mbox @ '#b_alice' @ ( bigcity @ portland ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NLP265^17 : TPTP v8.2.0. Released v8.1.0.
% 0.14/0.15 % 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.36 % Computer : n004.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 21:35:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_CAX_EQU_NAR problem
% 0.15/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.38 % (6381)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.39 % (6380)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.15/0.39 % (6378)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.39 % (6375)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.15/0.39 % (6377)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.15/0.39 % (6376)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.15/0.39 % (6378)Instruction limit reached!
% 0.15/0.39 % (6378)------------------------------
% 0.15/0.39 % (6378)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (6378)Termination reason: Unknown
% 0.15/0.39 % (6378)Termination phase: shuffling
% 0.15/0.39
% 0.15/0.39 % (6378)Memory used [KB]: 895
% 0.15/0.39 % (6378)Time elapsed: 0.004 s
% 0.15/0.39 % (6378)Instructions burned: 2 (million)
% 0.15/0.39 % (6378)------------------------------
% 0.15/0.39 % (6378)------------------------------
% 0.15/0.39 % (6381)Instruction limit reached!
% 0.15/0.39 % (6381)------------------------------
% 0.15/0.39 % (6381)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (6381)Termination reason: Unknown
% 0.15/0.39 % (6381)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (6381)Memory used [KB]: 5628
% 0.15/0.39 % (6381)Time elapsed: 0.013 s
% 0.15/0.39 % (6381)Instructions burned: 18 (million)
% 0.15/0.39 % (6381)------------------------------
% 0.15/0.39 % (6381)------------------------------
% 0.15/0.39 % (6376)Instruction limit reached!
% 0.15/0.39 % (6376)------------------------------
% 0.15/0.39 % (6376)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (6376)Termination reason: Unknown
% 0.15/0.39 % (6376)Termination phase: Property scanning
% 0.15/0.39
% 0.15/0.39 % (6376)Memory used [KB]: 1023
% 0.15/0.39 % (6376)Time elapsed: 0.006 s
% 0.15/0.39 % (6376)Instructions burned: 4 (million)
% 0.15/0.39 % (6376)------------------------------
% 0.15/0.39 % (6376)------------------------------
% 0.15/0.39 % (6380)Refutation not found, incomplete strategy
% 0.15/0.39 % (6380)------------------------------
% 0.15/0.39 % (6380)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (6380)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.39
% 0.15/0.39
% 0.15/0.39 % (6380)Memory used [KB]: 5500
% 0.15/0.39 % (6380)Time elapsed: 0.007 s
% 0.15/0.39 % (6380)Instructions burned: 5 (million)
% 0.15/0.39 % (6380)------------------------------
% 0.15/0.39 % (6380)------------------------------
% 0.15/0.39 % (6379)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.39 % (6379)Instruction limit reached!
% 0.15/0.39 % (6379)------------------------------
% 0.15/0.39 % (6379)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (6379)Termination reason: Unknown
% 0.15/0.39 % (6379)Termination phase: shuffling
% 0.15/0.39
% 0.15/0.39 % (6379)Memory used [KB]: 1023
% 0.15/0.39 % (6379)Time elapsed: 0.004 s
% 0.15/0.39 % (6379)Instructions burned: 2 (million)
% 0.15/0.39 % (6379)------------------------------
% 0.15/0.39 % (6379)------------------------------
% 0.15/0.40 % (6382)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.15/0.40 % (6382)Instruction limit reached!
% 0.15/0.40 % (6382)------------------------------
% 0.15/0.40 % (6382)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (6382)Termination reason: Unknown
% 0.15/0.40 % (6382)Termination phase: Property scanning
% 0.15/0.40
% 0.15/0.40 % (6382)Memory used [KB]: 1023
% 0.15/0.40 % (6382)Time elapsed: 0.005 s
% 0.15/0.40 % (6382)Instructions burned: 4 (million)
% 0.15/0.40 % (6382)------------------------------
% 0.15/0.40 % (6382)------------------------------
% 0.15/0.41 % (6375)First to succeed.
% 0.15/0.41 % (6377)Also succeeded, but the first one will report.
% 0.15/0.41 % (6375)Refutation found. Thanks to Tanya!
% 0.15/0.41 % SZS status ContradictoryAxioms for theBenchmark
% 0.15/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.41 % (6375)------------------------------
% 0.15/0.41 % (6375)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.41 % (6375)Termination reason: Refutation
% 0.15/0.41
% 0.15/0.41 % (6375)Memory used [KB]: 5628
% 0.15/0.41 % (6375)Time elapsed: 0.022 s
% 0.15/0.41 % (6375)Instructions burned: 18 (million)
% 0.15/0.41 % (6375)------------------------------
% 0.15/0.41 % (6375)------------------------------
% 0.15/0.41 % (6371)Success in time 0.03 s
% 0.15/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------