TSTP Solution File: SET600^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET600^5 : TPTP v8.2.0. Released v4.0.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 : n009.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 03:12:19 EDT 2024
% Result : Theorem 0.12s 0.36s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 64 ( 1 unt; 8 typ; 0 def)
% Number of atoms : 337 ( 93 equ; 0 cnn)
% Maximal formula atoms : 12 ( 6 avg)
% Number of connectives : 296 ( 73 ~; 115 |; 15 &; 84 @)
% ( 7 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 116 ( 89 ^ 18 !; 8 ?; 116 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_7,type,
sK0: a > $o ).
thf(func_def_8,type,
sK1: a > $o ).
thf(func_def_10,type,
ph3:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
sK4: a ).
thf(func_def_12,type,
sK5: a ).
thf(func_def_13,type,
sK6: a ).
thf(f70,plain,
$false,
inference(avatar_sat_refutation,[],[f22,f27,f28,f37,f41,f69]) ).
thf(f69,plain,
( ~ spl2_1
| spl2_2
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f68]) ).
thf(f68,plain,
( $false
| ~ spl2_1
| spl2_2
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f65]) ).
thf(f65,plain,
( ( $false = $true )
| ~ spl2_1
| spl2_2
| ~ spl2_3 ),
inference(superposition,[],[f59,f63]) ).
thf(f63,plain,
( ! [X0: a] :
( ( sK1 @ X0 )
= $false )
| ~ spl2_1
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f61]) ).
thf(f61,plain,
( ! [X0: a] :
( ( $false = $true )
| ( ( sK1 @ X0 )
= $false ) )
| ~ spl2_1
| ~ spl2_3 ),
inference(superposition,[],[f48,f45]) ).
thf(f45,plain,
( ! [X1: a] :
( ( $true
= ( sK0 @ X1 ) )
| ( $false
= ( sK1 @ X1 ) ) )
| ~ spl2_1
| ~ spl2_3 ),
inference(binary_proxy_clausification,[],[f44]) ).
thf(f44,plain,
( ! [X1: a] :
( ( sK0 @ X1 )
= ( sK1 @ X1 ) )
| ~ spl2_1
| ~ spl2_3 ),
inference(argument_congruence,[],[f43]) ).
thf(f43,plain,
( ( sK0 = sK1 )
| ~ spl2_1
| ~ spl2_3 ),
inference(forward_demodulation,[],[f17,f25]) ).
thf(f25,plain,
( ( sK0
= ( ^ [Y0: a] : $false ) )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f24]) ).
thf(f24,plain,
( spl2_3
<=> ( sK0
= ( ^ [Y0: a] : $false ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
thf(f17,plain,
( ( ( ^ [Y0: a] : $false )
= sK1 )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f15]) ).
thf(f15,plain,
( spl2_1
<=> ( ( ^ [Y0: a] : $false )
= sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
thf(f48,plain,
( ! [X1: a] :
( $false
= ( sK0 @ X1 ) )
| ~ spl2_3 ),
inference(beta_eta_normalization,[],[f47]) ).
thf(f47,plain,
( ! [X1: a] :
( ( sK0 @ X1 )
= ( ^ [Y0: a] : $false
@ X1 ) )
| ~ spl2_3 ),
inference(argument_congruence,[],[f25]) ).
thf(f59,plain,
( ( $true
= ( sK1 @ sK6 ) )
| spl2_2
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f58]) ).
thf(f58,plain,
( ( $false = $true )
| ( $true
= ( sK1 @ sK6 ) )
| spl2_2
| ~ spl2_3 ),
inference(forward_demodulation,[],[f57,f48]) ).
thf(f57,plain,
( ( $true
= ( sK1 @ sK6 ) )
| ( ( sK0 @ sK6 )
= $true )
| spl2_2
| ~ spl2_3 ),
inference(duplicate_literal_removal,[],[f56]) ).
thf(f56,plain,
( ( ( sK0 @ sK6 )
= $true )
| ( $true
= ( sK1 @ sK6 ) )
| ( ( sK0 @ sK6 )
= $true )
| spl2_2
| ~ spl2_3 ),
inference(binary_proxy_clausification,[],[f51]) ).
thf(f51,plain,
( ( ( sK0 @ sK6 )
= $true )
| ( $true
= ( ( sK1 @ sK6 )
| ( sK0 @ sK6 ) ) )
| spl2_2
| ~ spl2_3 ),
inference(binary_proxy_clausification,[],[f50]) ).
thf(f50,plain,
( ( ( sK0 @ sK6 )
!= ( ( sK1 @ sK6 )
| ( sK0 @ sK6 ) ) )
| spl2_2
| ~ spl2_3 ),
inference(beta_eta_normalization,[],[f49]) ).
thf(f49,plain,
( ( ( sK0 @ sK6 )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) )
@ sK6 ) )
| spl2_2
| ~ spl2_3 ),
inference(negative_extensionality,[],[f42]) ).
thf(f42,plain,
( ( sK0
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) )
| spl2_2
| ~ spl2_3 ),
inference(forward_demodulation,[],[f20,f25]) ).
thf(f20,plain,
( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) )
| spl2_2 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f19,plain,
( spl2_2
<=> ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
thf(f41,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_contradiction_clause,[],[f40]) ).
thf(f40,plain,
( $false
| spl2_1
| ~ spl2_2 ),
inference(subsumption_resolution,[],[f39,f34]) ).
thf(f34,plain,
( ! [X1: a] :
( $false
= ( sK1 @ X1 ) )
| ~ spl2_2 ),
inference(binary_proxy_clausification,[],[f32]) ).
thf(f32,plain,
( ! [X1: a] :
( $false
= ( ( sK1 @ X1 )
| ( sK0 @ X1 ) ) )
| ~ spl2_2 ),
inference(beta_eta_normalization,[],[f31]) ).
thf(f31,plain,
( ! [X1: a] :
( ( ^ [Y0: a] : $false
@ X1 )
= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) )
@ X1 ) )
| ~ spl2_2 ),
inference(argument_congruence,[],[f21]) ).
thf(f21,plain,
( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f39,plain,
( ( $false
!= ( sK1 @ sK5 ) )
| spl2_1 ),
inference(beta_eta_normalization,[],[f38]) ).
thf(f38,plain,
( ( ( sK1 @ sK5 )
!= ( ^ [Y0: a] : $false
@ sK5 ) )
| spl2_1 ),
inference(negative_extensionality,[],[f16]) ).
thf(f16,plain,
( ( ( ^ [Y0: a] : $false )
!= sK1 )
| spl2_1 ),
inference(avatar_component_clause,[],[f15]) ).
thf(f37,plain,
( ~ spl2_2
| spl2_3 ),
inference(avatar_contradiction_clause,[],[f36]) ).
thf(f36,plain,
( $false
| ~ spl2_2
| spl2_3 ),
inference(trivial_inequality_removal,[],[f35]) ).
thf(f35,plain,
( ( $false != $false )
| ~ spl2_2
| spl2_3 ),
inference(superposition,[],[f30,f33]) ).
thf(f33,plain,
( ! [X1: a] :
( $false
= ( sK0 @ X1 ) )
| ~ spl2_2 ),
inference(binary_proxy_clausification,[],[f32]) ).
thf(f30,plain,
( ( $false
!= ( sK0 @ sK4 ) )
| spl2_3 ),
inference(beta_eta_normalization,[],[f29]) ).
thf(f29,plain,
( ( ( ^ [Y0: a] : $false
@ sK4 )
!= ( sK0 @ sK4 ) )
| spl2_3 ),
inference(negative_extensionality,[],[f26]) ).
thf(f26,plain,
( ( sK0
!= ( ^ [Y0: a] : $false ) )
| spl2_3 ),
inference(avatar_component_clause,[],[f24]) ).
thf(f28,plain,
( spl2_3
| spl2_2 ),
inference(avatar_split_clause,[],[f12,f19,f24]) ).
thf(f12,plain,
( ( sK0
= ( ^ [Y0: a] : $false ) )
| ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) )
| ( sK0
!= ( ^ [Y0: a] : $false ) )
| ( ( ^ [Y0: a] : $false )
!= sK1 ) )
& ( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) )
| ( ( sK0
= ( ^ [Y0: a] : $false ) )
& ( ( ^ [Y0: a] : $false )
= sK1 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f9]) ).
thf(f9,plain,
( ? [X0: a > $o,X1: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) )
| ( ( ^ [Y0: a] : $false )
!= X0 )
| ( ( ^ [Y0: a] : $false )
!= X1 ) )
& ( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) )
| ( ( ( ^ [Y0: a] : $false )
= X0 )
& ( ( ^ [Y0: a] : $false )
= X1 ) ) ) )
=> ( ( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) )
| ( sK0
!= ( ^ [Y0: a] : $false ) )
| ( ( ^ [Y0: a] : $false )
!= sK1 ) )
& ( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) )
| ( ( sK0
= ( ^ [Y0: a] : $false ) )
& ( ( ^ [Y0: a] : $false )
= sK1 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) )
| ( ( ^ [Y0: a] : $false )
!= X0 )
| ( ( ^ [Y0: a] : $false )
!= X1 ) )
& ( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) )
| ( ( ( ^ [Y0: a] : $false )
= X0 )
& ( ( ^ [Y0: a] : $false )
= X1 ) ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) )
| ( ( ^ [Y0: a] : $false )
!= X0 )
| ( ( ^ [Y0: a] : $false )
!= X1 ) )
& ( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) )
| ( ( ( ^ [Y0: a] : $false )
= X0 )
& ( ( ^ [Y0: a] : $false )
= X1 ) ) ) ),
inference(nnf_transformation,[],[f6]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
= X0 )
& ( ( ^ [Y0: a] : $false )
= X1 ) )
<~> ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) )
<=> ( ( ( ^ [Y0: a] : $false )
= X0 )
& ( ( ^ [Y0: a] : $false )
= X1 ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ( ^ [X2: a] : $false )
= ( ^ [X3: a] :
( ( X0 @ X3 )
| ( X1 @ X3 ) ) ) )
<=> ( ( X1
= ( ^ [X4: a] : $false ) )
& ( X0
= ( ^ [X5: a] : $false ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o] :
( ( ( ^ [X3: a] : $false )
= ( ^ [X2: a] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) )
<=> ( ( X1
= ( ^ [X3: a] : $false ) )
& ( X0
= ( ^ [X3: a] : $false ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o] :
( ( ( ^ [X3: a] : $false )
= ( ^ [X2: a] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) )
<=> ( ( X1
= ( ^ [X3: a] : $false ) )
& ( X0
= ( ^ [X3: a] : $false ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_59_pme) ).
thf(f27,plain,
( ~ spl2_2
| ~ spl2_3
| ~ spl2_1 ),
inference(avatar_split_clause,[],[f13,f15,f24,f19]) ).
thf(f13,plain,
( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) )
| ( sK0
!= ( ^ [Y0: a] : $false ) )
| ( ( ^ [Y0: a] : $false )
!= sK1 ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f22,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f11,f19,f15]) ).
thf(f11,plain,
( ( ( ^ [Y0: a] : $false )
= sK1 )
| ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET600^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % 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.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 11:31:23 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 This is a TH0_THM_EQU_NAR problem
% 0.12/0.34 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.12/0.36 % (8655)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.12/0.36 % (8649)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.12/0.36 % (8651)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 (3000ds/27Mi)
% 0.12/0.36 % (8650)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 (3000ds/4Mi)
% 0.12/0.36 % (8656)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.12/0.36 % (8654)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 (3000ds/275Mi)
% 0.12/0.36 % (8652)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.12/0.36 % (8652)Instruction limit reached!
% 0.12/0.36 % (8652)------------------------------
% 0.12/0.36 % (8652)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36 % (8652)Termination reason: Unknown
% 0.12/0.36 % (8652)Termination phase: Saturation
% 0.12/0.36
% 0.12/0.36 % (8652)Memory used [KB]: 895
% 0.12/0.36 % (8652)Time elapsed: 0.003 s
% 0.12/0.36 % (8652)Instructions burned: 2 (million)
% 0.12/0.36 % (8652)------------------------------
% 0.12/0.36 % (8652)------------------------------
% 0.12/0.36 % (8653)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 (3000ds/2Mi)
% 0.12/0.36 % (8656)Refutation not found, incomplete strategy
% 0.12/0.36 % (8656)------------------------------
% 0.12/0.36 % (8656)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36 % (8656)Termination reason: Refutation not found, incomplete strategy
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 % (8656)Memory used [KB]: 5500
% 0.12/0.36 % (8656)Time elapsed: 0.003 s
% 0.12/0.36 % (8656)Instructions burned: 2 (million)
% 0.12/0.36 % (8656)------------------------------
% 0.12/0.36 % (8656)------------------------------
% 0.12/0.36 % (8650)Instruction limit reached!
% 0.12/0.36 % (8650)------------------------------
% 0.12/0.36 % (8650)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36 % (8650)Termination reason: Unknown
% 0.12/0.36 % (8650)Termination phase: Saturation
% 0.12/0.36
% 0.12/0.36 % (8650)Memory used [KB]: 5500
% 0.12/0.36 % (8650)Time elapsed: 0.005 s
% 0.12/0.36 % (8654)First to succeed.
% 0.12/0.36 % (8650)Instructions burned: 4 (million)
% 0.12/0.36 % (8650)------------------------------
% 0.12/0.36 % (8650)------------------------------
% 0.12/0.36 % (8653)Instruction limit reached!
% 0.12/0.36 % (8653)------------------------------
% 0.12/0.36 % (8653)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36 % (8653)Termination reason: Unknown
% 0.12/0.36 % (8653)Termination phase: Saturation
% 0.12/0.36
% 0.12/0.36 % (8653)Memory used [KB]: 5500
% 0.12/0.36 % (8653)Time elapsed: 0.003 s
% 0.12/0.36 % (8653)Instructions burned: 2 (million)
% 0.12/0.36 % (8653)------------------------------
% 0.12/0.36 % (8653)------------------------------
% 0.12/0.36 % (8649)Also succeeded, but the first one will report.
% 0.12/0.36 % (8655)Also succeeded, but the first one will report.
% 0.12/0.36 % (8654)Refutation found. Thanks to Tanya!
% 0.12/0.36 % SZS status Theorem for theBenchmark
% 0.12/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.36 % (8654)------------------------------
% 0.12/0.36 % (8654)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36 % (8654)Termination reason: Refutation
% 0.12/0.36
% 0.12/0.36 % (8654)Memory used [KB]: 5500
% 0.12/0.36 % (8654)Time elapsed: 0.006 s
% 0.12/0.36 % (8654)Instructions burned: 3 (million)
% 0.12/0.36 % (8654)------------------------------
% 0.12/0.36 % (8654)------------------------------
% 0.12/0.36 % (8648)Success in time 0.007 s
% 0.12/0.36 % Vampire---4.8 exiting
%------------------------------------------------------------------------------