TSTP Solution File: SYO543^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO543^1 : TPTP v8.2.0. Released v5.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/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 09:06:09 EDT 2024
% Result : Theorem 0.13s 0.38s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 55 ( 15 unt; 5 typ; 0 def)
% Number of atoms : 407 ( 213 equ; 0 cnn)
% Maximal formula atoms : 4 ( 8 avg)
% Number of connectives : 384 ( 90 ~; 100 |; 118 &; 72 @)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 98 ( 98 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 6 con; 0-4 aty)
% Number of variables : 97 ( 60 ^ 31 !; 4 ?; 97 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
epsii: ( ( $i > $i ) > $o ) > $i > $i ).
thf(func_def_2,type,
if: $o > ( $i > $i ) > ( $i > $i ) > $i > $i ).
thf(func_def_3,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_16,type,
sK1: $i > $i ).
thf(func_def_18,type,
ph3:
!>[X0: $tType] : X0 ).
thf(f208,plain,
$false,
inference(avatar_sat_refutation,[],[f85,f199,f205,f207]) ).
thf(f207,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f206]) ).
thf(f206,plain,
( $false
| ~ spl2_1 ),
inference(equality_resolution,[],[f69]) ).
thf(f69,plain,
( ! [X1: $i > $i] : ( sK1 != X1 )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f68]) ).
thf(f68,plain,
( spl2_1
<=> ! [X1: $i > $i] : ( sK1 != X1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
thf(f205,plain,
( spl2_1
| spl2_4
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f204,f71,f80,f68]) ).
thf(f80,plain,
( spl2_4
<=> ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
thf(f71,plain,
( spl2_2
<=> ( sK0 = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
thf(f204,plain,
( ! [X1: $i > $i] :
( ( sK1 != X1 )
| ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) ) )
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f203]) ).
thf(f203,plain,
( ! [X1: $i > $i] :
( ( $false = $true )
| ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
| ( sK1 != X1 ) )
| ~ spl2_2 ),
inference(forward_demodulation,[],[f164,f73]) ).
thf(f73,plain,
( ( sK0 = $false )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f71]) ).
thf(f164,plain,
! [X1: $i > $i] :
( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
| ( sK1 != X1 )
| ( sK0 = $true ) ),
inference(not_proxy_clausification,[],[f163]) ).
thf(f163,plain,
! [X1: $i > $i] :
( ( $false = ~ sK0 )
| ( sK1 != X1 )
| ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) ) ),
inference(equality_proxy_clausification,[],[f162]) ).
thf(f162,plain,
! [X1: $i > $i] :
( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
= $true )
| ( $false = ~ sK0 )
| ( sK1 != X1 ) ),
inference(equality_proxy_clausification,[],[f161]) ).
thf(f161,plain,
! [X1: $i > $i] :
( ( ( sK1 = X1 )
= $false )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
= $true )
| ( $false = ~ sK0 ) ),
inference(binary_proxy_clausification,[],[f160]) ).
thf(f160,plain,
! [X1: $i > $i] :
( ( $false
= ( ( sK1 = X1 )
& ~ sK0 ) )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
= $true ) ),
inference(duplicate_literal_removal,[],[f159]) ).
thf(f159,plain,
! [X1: $i > $i] :
( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
= $true )
| ( $false
= ( ( sK1 = X1 )
& ~ sK0 ) )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f157]) ).
thf(f157,plain,
! [X1: $i > $i] :
( ( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
& sK0 )
= $true )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
= $true )
| ( $false
= ( ( sK1 = X1 )
& ~ sK0 ) ) ),
inference(binary_proxy_clausification,[],[f155]) ).
thf(f155,plain,
! [X1: $i > $i] :
( ( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
& ~ sK0 )
= $true )
| ( $false
= ( ( sK1 = X1 )
& ~ sK0 ) )
| ( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
& sK0 )
= $true ) ),
inference(binary_proxy_clausification,[],[f154]) ).
thf(f154,plain,
! [X1: $i > $i] :
( ( ( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
& ~ sK0 )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
& sK0 ) )
= $true )
| ( $false
= ( ( sK1 = X1 )
& ~ sK0 ) ) ),
inference(binary_proxy_clausification,[],[f152]) ).
thf(f152,plain,
! [X1: $i > $i] :
( ( $false
= ( ( ( sK1 = X1 )
& ~ sK0 )
| ( ( sK1 = X1 )
& sK0 ) ) )
| ( ( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
& ~ sK0 )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
& sK0 ) )
= $true ) ),
inference(beta_eta_normalization,[],[f149]) ).
thf(f149,plain,
! [X1: $i > $i] :
( ( ( ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) )
@ X1 )
= $false )
| ( $true
= ( ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) )
@ ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f199,plain,
~ spl2_4,
inference(avatar_contradiction_clause,[],[f198]) ).
thf(f198,plain,
( $false
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f151]) ).
thf(f151,plain,
( ( sK1 != sK1 )
| ~ spl2_4 ),
inference(superposition,[],[f19,f82]) ).
thf(f82,plain,
( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f80]) ).
thf(f19,plain,
( sK1
!= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) ),
inference(beta_eta_normalization,[],[f18]) ).
thf(f18,plain,
( ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
( epsii
@ ^ [Y3: $i > $i] :
( ( ( Y2 = Y3 )
& ~ Y0 )
| ( ( Y1 = Y3 )
& Y0 ) ) )
@ sK0
@ sK1
@ sK1 )
!= sK1 ),
inference(definition_unfolding,[],[f16,f17]) ).
thf(f17,plain,
( if
= ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
( epsii
@ ^ [Y3: $i > $i] :
( ( ( Y2 = Y3 )
& ~ Y0 )
| ( ( Y1 = Y3 )
& Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f7,plain,
( if
= ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
( epsii
@ ^ [Y3: $i > $i] :
( ( ( Y2 = Y3 )
& ~ Y0 )
| ( ( Y1 = Y3 )
& Y0 ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f6,plain,
( ( ^ [X0: $o,X1: $i > $i,X2: $i > $i] :
( epsii
@ ^ [X3: $i > $i] :
( ( X0
& ( X1 = X3 ) )
| ( ~ X0
& ( X2 = X3 ) ) ) ) )
= if ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
( ( ^ [X2: $o,X1: $i > $i,X3: $i > $i] :
( epsii
@ ^ [X4: $i > $i] :
( ( X2
& ( X1 = X4 ) )
| ( ~ X2
& ( X3 = X4 ) ) ) ) )
= if ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifd) ).
thf(f16,plain,
( ( if @ sK0 @ sK1 @ sK1 )
!= sK1 ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( ( if @ sK0 @ sK1 @ sK1 )
!= sK1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f11,f13]) ).
thf(f13,plain,
( ? [X0: $o,X1: $i > $i] :
( ( if @ X0 @ X1 @ X1 )
!= X1 )
=> ( ( if @ sK0 @ sK1 @ sK1 )
!= sK1 ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
? [X0: $o,X1: $i > $i] :
( ( if @ X0 @ X1 @ X1 )
!= X1 ),
inference(ennf_transformation,[],[f10]) ).
thf(f10,plain,
~ ! [X0: $o,X1: $i > $i] :
( ( if @ X0 @ X1 @ X1 )
= X1 ),
inference(rectify,[],[f4]) ).
thf(f4,negated_conjecture,
~ ! [X2: $o,X1: $i > $i] :
( ( if @ X2 @ X1 @ X1 )
= X1 ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
! [X2: $o,X1: $i > $i] :
( ( if @ X2 @ X1 @ X1 )
= X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(f85,plain,
( spl2_2
| spl2_1
| spl2_4 ),
inference(avatar_split_clause,[],[f53,f80,f68,f71]) ).
thf(f53,plain,
! [X1: $i > $i] :
( ( sK1 != X1 )
| ( sK0 = $false )
| ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) ) ),
inference(equality_proxy_clausification,[],[f52]) ).
thf(f52,plain,
! [X1: $i > $i] :
( ( ( sK1 = X1 )
= $false )
| ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
| ( sK0 = $false ) ),
inference(equality_proxy_clausification,[],[f51]) ).
thf(f51,plain,
! [X1: $i > $i] :
( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
= $true )
| ( ( sK1 = X1 )
= $false )
| ( sK0 = $false ) ),
inference(binary_proxy_clausification,[],[f50]) ).
thf(f50,plain,
! [X1: $i > $i] :
( ( $false
= ( ( sK1 = X1 )
& sK0 ) )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
= $true ) ),
inference(duplicate_literal_removal,[],[f49]) ).
thf(f49,plain,
! [X1: $i > $i] :
( ( $false
= ( ( sK1 = X1 )
& sK0 ) )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
= $true )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f47]) ).
thf(f47,plain,
! [X1: $i > $i] :
( ( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
& sK0 )
= $true )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
= $true )
| ( $false
= ( ( sK1 = X1 )
& sK0 ) ) ),
inference(binary_proxy_clausification,[],[f45]) ).
thf(f45,plain,
! [X1: $i > $i] :
( ( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
& ~ sK0 )
= $true )
| ( $false
= ( ( sK1 = X1 )
& sK0 ) )
| ( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
& sK0 )
= $true ) ),
inference(binary_proxy_clausification,[],[f23]) ).
thf(f23,plain,
! [X1: $i > $i] :
( ( ( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
& ~ sK0 )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
& sK0 ) )
= $true )
| ( $false
= ( ( sK1 = X1 )
& sK0 ) ) ),
inference(binary_proxy_clausification,[],[f22]) ).
thf(f22,plain,
! [X1: $i > $i] :
( ( $false
= ( ( ( sK1 = X1 )
& ~ sK0 )
| ( ( sK1 = X1 )
& sK0 ) ) )
| ( ( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
& ~ sK0 )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) )
& sK0 ) )
= $true ) ),
inference(beta_eta_normalization,[],[f20]) ).
thf(f20,plain,
! [X1: $i > $i] :
( ( $true
= ( ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) )
@ ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) ) ) ) )
| ( ( ^ [Y0: $i > $i] :
( ( ( sK1 = Y0 )
& ~ sK0 )
| ( ( sK1 = Y0 )
& sK0 ) )
@ X1 )
= $false ) ),
introduced(choice_axiom,[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO543^1 : TPTP v8.2.0. Released v5.2.0.
% 0.12/0.14 % 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.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 08:48:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_EQU_NAR problem
% 0.13/0.35 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.13/0.37 % (16350)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.13/0.37 % (16352)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.13/0.37 % (16353)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.13/0.37 % (16351)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.13/0.37 % (16353)Instruction limit reached!
% 0.13/0.37 % (16353)------------------------------
% 0.13/0.37 % (16353)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (16353)Termination reason: Unknown
% 0.13/0.37 % (16353)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (16353)Memory used [KB]: 5500
% 0.13/0.37 % (16353)Time elapsed: 0.004 s
% 0.13/0.37 % (16353)Instructions burned: 2 (million)
% 0.13/0.37 % (16353)------------------------------
% 0.13/0.37 % (16353)------------------------------
% 0.13/0.37 % (16351)Instruction limit reached!
% 0.13/0.37 % (16351)------------------------------
% 0.13/0.37 % (16351)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (16351)Termination reason: Unknown
% 0.13/0.37 % (16351)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (16351)Memory used [KB]: 5500
% 0.13/0.37 % (16351)Time elapsed: 0.005 s
% 0.13/0.37 % (16351)Instructions burned: 4 (million)
% 0.13/0.37 % (16351)------------------------------
% 0.13/0.37 % (16351)------------------------------
% 0.13/0.38 % (16352)First to succeed.
% 0.13/0.38 % (16354)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.13/0.38 % (16354)Instruction limit reached!
% 0.13/0.38 % (16354)------------------------------
% 0.13/0.38 % (16354)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (16354)Termination reason: Unknown
% 0.13/0.38 % (16354)Termination phase: Function definition elimination
% 0.13/0.38
% 0.13/0.38 % (16354)Memory used [KB]: 895
% 0.13/0.38 % (16354)Time elapsed: 0.003 s
% 0.13/0.38 % (16354)Instructions burned: 2 (million)
% 0.13/0.38 % (16354)------------------------------
% 0.13/0.38 % (16354)------------------------------
% 0.13/0.38 % (16352)Refutation found. Thanks to Tanya!
% 0.13/0.38 % SZS status Theorem for theBenchmark
% 0.13/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.38 % (16352)------------------------------
% 0.13/0.38 % (16352)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (16352)Termination reason: Refutation
% 0.13/0.38
% 0.13/0.38 % (16352)Memory used [KB]: 5500
% 0.13/0.38 % (16352)Time elapsed: 0.011 s
% 0.13/0.38 % (16352)Instructions burned: 11 (million)
% 0.13/0.38 % (16352)------------------------------
% 0.13/0.38 % (16352)------------------------------
% 0.13/0.38 % (16349)Success in time 0.023 s
% 0.13/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------