TSTP Solution File: SEV227^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV227^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n013.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 04:12:27 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 19
% Syntax : Number of formulae : 87 ( 9 unt; 9 typ; 0 def)
% Number of atoms : 495 ( 157 equ; 0 cnn)
% Maximal formula atoms : 4 ( 6 avg)
% Number of connectives : 370 ( 68 ~; 139 |; 18 &; 127 @)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 41 ( 41 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 16 usr; 15 con; 0-2 aty)
% ( 0 !!; 9 ??; 0 @@+; 0 @@-)
% Number of variables : 48 ( 26 ^ 18 !; 3 ?; 48 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
y: a > $o ).
thf(func_def_2,type,
x: a > $o ).
thf(func_def_15,type,
ph1:
!>[X0: $tType] : X0 ).
thf(func_def_16,type,
sK2: a ).
thf(func_def_17,type,
sK3: a > $o ).
thf(func_def_18,type,
sK4: a ).
thf(func_def_19,type,
sK5: a ).
thf(f175,plain,
$false,
inference(avatar_sat_refutation,[],[f49,f58,f66,f76,f78,f81,f84,f87,f110,f174]) ).
thf(f174,plain,
( ~ spl0_2
| ~ spl0_5
| ~ spl0_7 ),
inference(avatar_contradiction_clause,[],[f173]) ).
thf(f173,plain,
( $false
| ~ spl0_2
| ~ spl0_5
| ~ spl0_7 ),
inference(trivial_inequality_removal,[],[f172]) ).
thf(f172,plain,
( ( $true = $false )
| ~ spl0_2
| ~ spl0_5
| ~ spl0_7 ),
inference(backward_demodulation,[],[f44,f171]) ).
thf(f171,plain,
( ( ( sK3 @ sK2 )
= $false )
| ~ spl0_5
| ~ spl0_7 ),
inference(trivial_inequality_removal,[],[f169]) ).
thf(f169,plain,
( ( ( sK3 @ sK2 )
= $false )
| ( $true = $false )
| ~ spl0_5
| ~ spl0_7 ),
inference(superposition,[],[f65,f135]) ).
thf(f135,plain,
( ! [X1: a] :
( ( $true
= ( x @ X1 ) )
| ( $false
= ( sK3 @ X1 ) ) )
| ~ spl0_5 ),
inference(binary_proxy_clausification,[],[f132]) ).
thf(f132,plain,
( ! [X1: a] :
( ( x @ X1 )
= ( sK3 @ X1 ) )
| ~ spl0_5 ),
inference(argument_congruence,[],[f57]) ).
thf(f57,plain,
( ( x = sK3 )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f55]) ).
thf(f55,plain,
( spl0_5
<=> ( x = sK3 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
thf(f65,plain,
( ( $false
= ( x @ sK2 ) )
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f63]) ).
thf(f63,plain,
( spl0_7
<=> ( $false
= ( x @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_7])]) ).
thf(f44,plain,
( ( ( sK3 @ sK2 )
= $true )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f42]) ).
thf(f42,plain,
( spl0_2
<=> ( ( sK3 @ sK2 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f110,plain,
( ~ spl0_2
| ~ spl0_4
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f109]) ).
thf(f109,plain,
( $false
| ~ spl0_2
| ~ spl0_4
| ~ spl0_9 ),
inference(trivial_inequality_removal,[],[f108]) ).
thf(f108,plain,
( ( $true = $false )
| ~ spl0_2
| ~ spl0_4
| ~ spl0_9 ),
inference(backward_demodulation,[],[f44,f107]) ).
thf(f107,plain,
( ( ( sK3 @ sK2 )
= $false )
| ~ spl0_4
| ~ spl0_9 ),
inference(trivial_inequality_removal,[],[f105]) ).
thf(f105,plain,
( ( ( sK3 @ sK2 )
= $false )
| ( $true = $false )
| ~ spl0_4
| ~ spl0_9 ),
inference(superposition,[],[f74,f92]) ).
thf(f92,plain,
( ! [X1: a] :
( ( $true
= ( y @ X1 ) )
| ( $false
= ( sK3 @ X1 ) ) )
| ~ spl0_4 ),
inference(binary_proxy_clausification,[],[f89]) ).
thf(f89,plain,
( ! [X1: a] :
( ( y @ X1 )
= ( sK3 @ X1 ) )
| ~ spl0_4 ),
inference(argument_congruence,[],[f53]) ).
thf(f53,plain,
( ( y = sK3 )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f51]) ).
thf(f51,plain,
( spl0_4
<=> ( y = sK3 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
thf(f74,plain,
( ( $false
= ( y @ sK2 ) )
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f72]) ).
thf(f72,plain,
( spl0_9
<=> ( $false
= ( y @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_9])]) ).
thf(f87,plain,
( ~ spl0_1
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f86]) ).
thf(f86,plain,
( $false
| ~ spl0_1
| ~ spl0_9 ),
inference(trivial_inequality_removal,[],[f85]) ).
thf(f85,plain,
( ( $true = $false )
| ~ spl0_1
| ~ spl0_9 ),
inference(backward_demodulation,[],[f40,f74]) ).
thf(f40,plain,
( ( $true
= ( y @ sK2 ) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f38]) ).
thf(f38,plain,
( spl0_1
<=> ( $true
= ( y @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f84,plain,
( spl0_9
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f83,f68,f72]) ).
thf(f68,plain,
( spl0_8
<=> ! [X1: a > $o] :
( ( $false
= ( X1 @ sK2 ) )
| ( y != X1 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_8])]) ).
thf(f83,plain,
( ( $false
= ( y @ sK2 ) )
| ~ spl0_8 ),
inference(equality_resolution,[],[f69]) ).
thf(f69,plain,
( ! [X1: a > $o] :
( ( y != X1 )
| ( $false
= ( X1 @ sK2 ) ) )
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f68]) ).
thf(f81,plain,
( ~ spl0_3
| ~ spl0_7 ),
inference(avatar_contradiction_clause,[],[f80]) ).
thf(f80,plain,
( $false
| ~ spl0_3
| ~ spl0_7 ),
inference(trivial_inequality_removal,[],[f79]) ).
thf(f79,plain,
( ( $true = $false )
| ~ spl0_3
| ~ spl0_7 ),
inference(backward_demodulation,[],[f48,f65]) ).
thf(f48,plain,
( ( $true
= ( x @ sK2 ) )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f46]) ).
thf(f46,plain,
( spl0_3
<=> ( $true
= ( x @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
thf(f78,plain,
( spl0_7
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f77,f60,f63]) ).
thf(f60,plain,
( spl0_6
<=> ! [X1: a > $o] :
( ( $false
= ( X1 @ sK2 ) )
| ( x != X1 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).
thf(f77,plain,
( ( $false
= ( x @ sK2 ) )
| ~ spl0_6 ),
inference(equality_resolution,[],[f61]) ).
thf(f61,plain,
( ! [X1: a > $o] :
( ( x != X1 )
| ( $false
= ( X1 @ sK2 ) ) )
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f60]) ).
thf(f76,plain,
( spl0_9
| spl0_8 ),
inference(avatar_split_clause,[],[f19,f68,f72]) ).
thf(f19,plain,
! [X1: a > $o] :
( ( y != X1 )
| ( $false
= ( y @ sK2 ) )
| ( $false
= ( X1 @ sK2 ) ) ),
inference(equality_proxy_clausification,[],[f18]) ).
thf(f18,plain,
! [X1: a > $o] :
( ( $false
= ( X1 @ sK2 ) )
| ( $false
= ( y @ sK2 ) )
| ( $false
= ( y = X1 ) ) ),
inference(binary_proxy_clausification,[],[f16]) ).
thf(f16,plain,
! [X1: a > $o] :
( ( $false
= ( ( y = X1 )
| ( x = X1 ) ) )
| ( $false
= ( X1 @ sK2 ) )
| ( $false
= ( y @ sK2 ) ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f15,plain,
! [X1: a > $o] :
( ( $false
= ( y @ sK2 ) )
| ( ( ( ( y = X1 )
| ( x = X1 ) )
& ( X1 @ sK2 ) )
= $false ) ),
inference(beta_eta_normalization,[],[f14]) ).
thf(f14,plain,
! [X1: a > $o] :
( ( $false
= ( ^ [Y0: a > $o] :
( ( ( y = Y0 )
| ( x = Y0 ) )
& ( Y0 @ sK2 ) )
@ X1 ) )
| ( $false
= ( y @ sK2 ) ) ),
inference(pi_clausification,[],[f13]) ).
thf(f13,plain,
( ( $false
= ( ?? @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( ( y = Y0 )
| ( x = Y0 ) )
& ( Y0 @ sK2 ) ) ) )
| ( $false
= ( y @ sK2 ) ) ),
inference(binary_proxy_clausification,[],[f11]) ).
thf(f11,plain,
( ( $false
= ( ( y @ sK2 )
| ( x @ sK2 ) ) )
| ( $false
= ( ?? @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( ( y = Y0 )
| ( x = Y0 ) )
& ( Y0 @ sK2 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f9]) ).
thf(f9,plain,
( ( ( y @ sK2 )
| ( x @ sK2 ) )
!= ( ?? @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( ( y = Y0 )
| ( x = Y0 ) )
& ( Y0 @ sK2 ) ) ) ),
inference(beta_eta_normalization,[],[f8]) ).
thf(f8,plain,
( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( ( y = Y1 )
| ( x = Y1 ) )
& ( Y1 @ Y0 ) ) )
@ sK2 )
!= ( ^ [Y0: a] :
( ( y @ Y0 )
| ( x @ Y0 ) )
@ sK2 ) ),
inference(negative_extensionality,[],[f7]) ).
thf(f7,plain,
( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( ( y = Y1 )
| ( x = Y1 ) )
& ( Y1 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( y @ Y0 )
| ( x @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f6,plain,
( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( ( y = Y1 )
| ( x = Y1 ) )
& ( Y1 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( y @ Y0 )
| ( x @ Y0 ) ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( ( y = Y1 )
| ( x = Y1 ) )
& ( Y1 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( y @ Y0 )
| ( x @ Y0 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
( ( ^ [X0: a] :
( ( x @ X0 )
| ( y @ X0 ) ) )
!= ( ^ [X1: a] :
? [X2: a > $o] :
( ( X2 @ X1 )
& ( ( x = X2 )
| ( y = X2 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
( ( ^ [X0: a] :
( ( x @ X0 )
| ( y @ X0 ) ) )
!= ( ^ [X1: a] :
? [X2: a > $o] :
( ( X2 @ X1 )
& ( ( x = X2 )
| ( y = X2 ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ^ [X0: a] :
( ( x @ X0 )
| ( y @ X0 ) ) )
= ( ^ [X1: a] :
? [X2: a > $o] :
( ( X2 @ X1 )
& ( ( x = X2 )
| ( y = X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX5200_pme) ).
thf(f66,plain,
( spl0_6
| spl0_7 ),
inference(avatar_split_clause,[],[f27,f63,f60]) ).
thf(f27,plain,
! [X1: a > $o] :
( ( $false
= ( x @ sK2 ) )
| ( $false
= ( X1 @ sK2 ) )
| ( x != X1 ) ),
inference(equality_proxy_clausification,[],[f24]) ).
thf(f24,plain,
! [X1: a > $o] :
( ( $false
= ( x = X1 ) )
| ( $false
= ( x @ sK2 ) )
| ( $false
= ( X1 @ sK2 ) ) ),
inference(binary_proxy_clausification,[],[f23]) ).
thf(f23,plain,
! [X1: a > $o] :
( ( $false
= ( ( y = X1 )
| ( x = X1 ) ) )
| ( $false
= ( x @ sK2 ) )
| ( $false
= ( X1 @ sK2 ) ) ),
inference(binary_proxy_clausification,[],[f22]) ).
thf(f22,plain,
! [X1: a > $o] :
( ( $false
= ( x @ sK2 ) )
| ( ( ( ( y = X1 )
| ( x = X1 ) )
& ( X1 @ sK2 ) )
= $false ) ),
inference(beta_eta_normalization,[],[f21]) ).
thf(f21,plain,
! [X1: a > $o] :
( ( $false
= ( ^ [Y0: a > $o] :
( ( ( y = Y0 )
| ( x = Y0 ) )
& ( Y0 @ sK2 ) )
@ X1 ) )
| ( $false
= ( x @ sK2 ) ) ),
inference(pi_clausification,[],[f12]) ).
thf(f12,plain,
( ( $false
= ( x @ sK2 ) )
| ( $false
= ( ?? @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( ( y = Y0 )
| ( x = Y0 ) )
& ( Y0 @ sK2 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f11]) ).
thf(f58,plain,
( spl0_4
| spl0_5
| spl0_3
| spl0_1 ),
inference(avatar_split_clause,[],[f35,f38,f46,f55,f51]) ).
thf(f35,plain,
( ( $true
= ( y @ sK2 ) )
| ( x = sK3 )
| ( y = sK3 )
| ( $true
= ( x @ sK2 ) ) ),
inference(equality_proxy_clausification,[],[f34]) ).
thf(f34,plain,
( ( $true
= ( y @ sK2 ) )
| ( $true
= ( y = sK3 ) )
| ( x = sK3 )
| ( $true
= ( x @ sK2 ) ) ),
inference(equality_proxy_clausification,[],[f33]) ).
thf(f33,plain,
( ( $true
= ( x = sK3 ) )
| ( $true
= ( y @ sK2 ) )
| ( $true
= ( x @ sK2 ) )
| ( $true
= ( y = sK3 ) ) ),
inference(binary_proxy_clausification,[],[f32]) ).
thf(f32,plain,
( ( $true
= ( y @ sK2 ) )
| ( $true
= ( x @ sK2 ) )
| ( $true
= ( ( y = sK3 )
| ( x = sK3 ) ) ) ),
inference(binary_proxy_clausification,[],[f31]) ).
thf(f31,plain,
( ( $true
= ( ( y @ sK2 )
| ( x @ sK2 ) ) )
| ( $true
= ( ( y = sK3 )
| ( x = sK3 ) ) ) ),
inference(binary_proxy_clausification,[],[f29]) ).
thf(f29,plain,
( ( $true
= ( ( ( y = sK3 )
| ( x = sK3 ) )
& ( sK3 @ sK2 ) ) )
| ( $true
= ( ( y @ sK2 )
| ( x @ sK2 ) ) ) ),
inference(beta_eta_normalization,[],[f28]) ).
thf(f28,plain,
( ( $true
= ( ( y @ sK2 )
| ( x @ sK2 ) ) )
| ( $true
= ( ^ [Y0: a > $o] :
( ( ( y = Y0 )
| ( x = Y0 ) )
& ( Y0 @ sK2 ) )
@ sK3 ) ) ),
inference(sigma_clausification,[],[f10]) ).
thf(f10,plain,
( ( $true
= ( ?? @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( ( y = Y0 )
| ( x = Y0 ) )
& ( Y0 @ sK2 ) ) ) )
| ( $true
= ( ( y @ sK2 )
| ( x @ sK2 ) ) ) ),
inference(binary_proxy_clausification,[],[f9]) ).
thf(f49,plain,
( spl0_1
| spl0_2
| spl0_3 ),
inference(avatar_split_clause,[],[f36,f46,f42,f38]) ).
thf(f36,plain,
( ( $true
= ( y @ sK2 ) )
| ( ( sK3 @ sK2 )
= $true )
| ( $true
= ( x @ sK2 ) ) ),
inference(binary_proxy_clausification,[],[f30]) ).
thf(f30,plain,
( ( ( sK3 @ sK2 )
= $true )
| ( $true
= ( ( y @ sK2 )
| ( x @ sK2 ) ) ) ),
inference(binary_proxy_clausification,[],[f29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.14 % Problem : SEV227^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/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.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 19:10:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/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/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 % (28349)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.14/0.38 % (28351)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.38 % (28353)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.14/0.38 % (28354)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.38 % (28355)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.14/0.38 % (28351)Instruction limit reached!
% 0.14/0.38 % (28351)------------------------------
% 0.14/0.38 % (28351)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (28351)Termination reason: Unknown
% 0.14/0.38 % (28351)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (28351)Memory used [KB]: 5373
% 0.14/0.38 % (28351)Time elapsed: 0.003 s
% 0.14/0.38 % (28351)Instructions burned: 2 (million)
% 0.14/0.38 % (28351)------------------------------
% 0.14/0.38 % (28351)------------------------------
% 0.14/0.38 % (28355)Refutation not found, incomplete strategy
% 0.14/0.38 % (28355)------------------------------
% 0.14/0.38 % (28355)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (28355)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (28355)Memory used [KB]: 5500
% 0.14/0.38 % (28355)Time elapsed: 0.003 s
% 0.14/0.38 % (28355)Instructions burned: 1 (million)
% 0.14/0.38 % (28355)------------------------------
% 0.14/0.38 % (28355)------------------------------
% 0.14/0.38 % (28352)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.14/0.38 % (28349)Instruction limit reached!
% 0.14/0.38 % (28349)------------------------------
% 0.14/0.38 % (28349)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (28349)Termination reason: Unknown
% 0.14/0.38 % (28349)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (28349)Memory used [KB]: 5500
% 0.14/0.38 % (28349)Time elapsed: 0.005 s
% 0.14/0.38 % (28349)Instructions burned: 4 (million)
% 0.14/0.38 % (28349)------------------------------
% 0.14/0.38 % (28349)------------------------------
% 0.14/0.38 % (28348)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.14/0.38 % (28352)Refutation not found, incomplete strategy
% 0.14/0.38 % (28352)------------------------------
% 0.14/0.38 % (28352)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (28352)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (28352)Memory used [KB]: 5500
% 0.14/0.38 % (28352)Time elapsed: 0.003 s
% 0.14/0.38 % (28352)Instructions burned: 1 (million)
% 0.14/0.38 % (28352)------------------------------
% 0.14/0.38 % (28352)------------------------------
% 0.14/0.39 % (28354)First to succeed.
% 0.14/0.39 % (28353)Also succeeded, but the first one will report.
% 0.14/0.39 % (28354)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.39 % (28354)------------------------------
% 0.14/0.39 % (28354)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (28354)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (28354)Memory used [KB]: 5628
% 0.14/0.39 % (28354)Time elapsed: 0.008 s
% 0.14/0.39 % (28354)Instructions burned: 8 (million)
% 0.14/0.39 % (28354)------------------------------
% 0.14/0.39 % (28354)------------------------------
% 0.14/0.39 % (28347)Success in time 0.018 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------