TSTP Solution File: SEV398^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV398^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 : n023.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:13:39 EDT 2024
% Result : Theorem 0.20s 0.39s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 16
% Syntax : Number of formulae : 61 ( 2 unt; 9 typ; 0 def)
% Number of atoms : 473 ( 106 equ; 0 cnn)
% Maximal formula atoms : 10 ( 9 avg)
% Number of connectives : 547 ( 86 ~; 82 |; 26 &; 320 @)
% ( 7 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 57 ( 57 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 94 ( 0 ^ 80 !; 12 ?; 94 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
cF: ( a > $o ) > a > $o ).
thf(func_def_2,type,
cG: ( a > $o ) > a > $o ).
thf(func_def_4,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_7,type,
sK0: a ).
thf(func_def_8,type,
sK1: a > $o ).
thf(func_def_9,type,
sK2: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_11,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f155,plain,
$false,
inference(avatar_sat_refutation,[],[f27,f36,f114,f131,f143,f154]) ).
thf(f154,plain,
( ~ spl3_1
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f153]) ).
thf(f153,plain,
( $false
| ~ spl3_1
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f152]) ).
thf(f152,plain,
( ( $true = $false )
| ~ spl3_1
| ~ spl3_4 ),
inference(forward_demodulation,[],[f149,f35]) ).
thf(f35,plain,
( ( ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK0 )
= $false )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f33]) ).
thf(f33,plain,
( spl3_4
<=> ( ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK0 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
thf(f149,plain,
( ( $true
= ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK0 ) )
| ~ spl3_1 ),
inference(trivial_inequality_removal,[],[f148]) ).
thf(f148,plain,
( ( $true
= ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK0 ) )
| ( $true != $true )
| ~ spl3_1 ),
inference(superposition,[],[f14,f22]) ).
thf(f22,plain,
( ( $true
= ( cF @ sK1 @ sK0 ) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f20]) ).
thf(f20,plain,
( spl3_1
<=> ( $true
= ( cF @ sK1 @ sK0 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f14,plain,
! [X2: a > $o,X4: a] :
( ( $true
!= ( X2 @ X4 ) )
| ( $true
= ( cF @ ( cG @ X2 ) @ X4 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ( ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK0 )
!= ( cF @ sK1 @ sK0 ) )
& ! [X2: a > $o] :
( ! [X3: a] :
( ( $true
= ( cG @ ( cF @ X2 ) @ X3 ) )
| ( $true
!= ( X2 @ X3 ) ) )
& ! [X4: a] :
( ( $true
!= ( X2 @ X4 ) )
| ( $true
= ( cF @ ( cG @ X2 ) @ X4 ) ) ) )
& ! [X5: a > $o,X6: a > $o] :
( ! [X7: a] :
( ( ( cF @ X5 @ X7 )
= $true )
| ( ( cF @ X6 @ X7 )
!= $true ) )
| ( ( $true
= ( X5 @ ( sK2 @ X6 @ X5 ) ) )
& ( $true
!= ( X6 @ ( sK2 @ X6 @ X5 ) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f10,f9]) ).
thf(f9,plain,
( ? [X0: a,X1: a > $o] :
( ( cF @ X1 @ X0 )
!= ( cF @ ( cG @ ( cF @ X1 ) ) @ X0 ) )
=> ( ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK0 )
!= ( cF @ sK1 @ sK0 ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
! [X5: a > $o,X6: a > $o] :
( ? [X8: a] :
( ( ( X5 @ X8 )
= $true )
& ( $true
!= ( X6 @ X8 ) ) )
=> ( ( $true
= ( X5 @ ( sK2 @ X6 @ X5 ) ) )
& ( $true
!= ( X6 @ ( sK2 @ X6 @ X5 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ? [X0: a,X1: a > $o] :
( ( cF @ X1 @ X0 )
!= ( cF @ ( cG @ ( cF @ X1 ) ) @ X0 ) )
& ! [X2: a > $o] :
( ! [X3: a] :
( ( $true
= ( cG @ ( cF @ X2 ) @ X3 ) )
| ( $true
!= ( X2 @ X3 ) ) )
& ! [X4: a] :
( ( $true
!= ( X2 @ X4 ) )
| ( $true
= ( cF @ ( cG @ X2 ) @ X4 ) ) ) )
& ! [X5: a > $o,X6: a > $o] :
( ! [X7: a] :
( ( ( cF @ X5 @ X7 )
= $true )
| ( ( cF @ X6 @ X7 )
!= $true ) )
| ? [X8: a] :
( ( ( X5 @ X8 )
= $true )
& ( $true
!= ( X6 @ X8 ) ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
( ? [X8: a,X7: a > $o] :
( ( cF @ ( cG @ ( cF @ X7 ) ) @ X8 )
!= ( cF @ X7 @ X8 ) )
& ! [X0: a > $o] :
( ! [X1: a] :
( ( $true
= ( cG @ ( cF @ X0 ) @ X1 ) )
| ( $true
!= ( X0 @ X1 ) ) )
& ! [X2: a] :
( ( ( X0 @ X2 )
!= $true )
| ( ( cF @ ( cG @ X0 ) @ X2 )
= $true ) ) )
& ! [X4: a > $o,X3: a > $o] :
( ! [X6: a] :
( ( $true
= ( cF @ X4 @ X6 ) )
| ( $true
!= ( cF @ X3 @ X6 ) ) )
| ? [X5: a] :
( ( $true
= ( X4 @ X5 ) )
& ( $true
!= ( X3 @ X5 ) ) ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
( ? [X8: a,X7: a > $o] :
( ( cF @ ( cG @ ( cF @ X7 ) ) @ X8 )
!= ( cF @ X7 @ X8 ) )
& ! [X0: a > $o] :
( ! [X1: a] :
( ( $true
= ( cG @ ( cF @ X0 ) @ X1 ) )
| ( $true
!= ( X0 @ X1 ) ) )
& ! [X2: a] :
( ( ( X0 @ X2 )
!= $true )
| ( ( cF @ ( cG @ X0 ) @ X2 )
= $true ) ) )
& ! [X4: a > $o,X3: a > $o] :
( ! [X6: a] :
( ( $true
= ( cF @ X4 @ X6 ) )
| ( $true
!= ( cF @ X3 @ X6 ) ) )
| ? [X5: a] :
( ( $true
= ( X4 @ X5 ) )
& ( $true
!= ( X3 @ X5 ) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ( ! [X0: a > $o] :
( ! [X1: a] :
( ( $true
= ( X0 @ X1 ) )
=> ( $true
= ( cG @ ( cF @ X0 ) @ X1 ) ) )
& ! [X2: a] :
( ( ( X0 @ X2 )
= $true )
=> ( ( cF @ ( cG @ X0 ) @ X2 )
= $true ) ) )
& ! [X4: a > $o,X3: a > $o] :
( ! [X5: a] :
( ( $true
= ( X4 @ X5 ) )
=> ( $true
= ( X3 @ X5 ) ) )
=> ! [X6: a] :
( ( $true
= ( cF @ X3 @ X6 ) )
=> ( $true
= ( cF @ X4 @ X6 ) ) ) ) )
=> ! [X7: a > $o,X8: a] :
( ( cF @ ( cG @ ( cF @ X7 ) ) @ X8 )
= ( cF @ X7 @ X8 ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ( ! [X0: a > $o] :
( ! [X1: a] :
( ( X0 @ X1 )
=> ( cG @ ( cF @ X0 ) @ X1 ) )
& ! [X2: a] :
( ( X0 @ X2 )
=> ( cF @ ( cG @ X0 ) @ X2 ) ) )
& ! [X3: a > $o,X4: a > $o] :
( ! [X5: a] :
( ( X4 @ X5 )
=> ( X3 @ X5 ) )
=> ! [X6: a] :
( ( cF @ X3 @ X6 )
=> ( cF @ X4 @ X6 ) ) ) )
=> ! [X7: a > $o,X8: a] :
( ( cF @ ( cG @ ( cF @ X7 ) ) @ X8 )
<=> ( cF @ X7 @ X8 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ! [X0: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( cG @ ( cF @ X0 ) @ X2 ) )
& ! [X2: a] :
( ( X0 @ X2 )
=> ( cF @ ( cG @ X0 ) @ X2 ) ) )
& ! [X1: a > $o,X0: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) )
=> ! [X2: a] :
( ( cF @ X1 @ X2 )
=> ( cF @ X0 @ X2 ) ) ) )
=> ! [X0: a > $o,X2: a] :
( ( cF @ ( cG @ ( cF @ X0 ) ) @ X2 )
<=> ( cF @ X0 @ X2 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ! [X0: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( cG @ ( cF @ X0 ) @ X2 ) )
& ! [X2: a] :
( ( X0 @ X2 )
=> ( cF @ ( cG @ X0 ) @ X2 ) ) )
& ! [X1: a > $o,X0: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) )
=> ! [X2: a] :
( ( cF @ X1 @ X2 )
=> ( cF @ X0 @ X2 ) ) ) )
=> ! [X0: a > $o,X2: a] :
( ( cF @ ( cG @ ( cF @ X0 ) ) @ X2 )
<=> ( cF @ X0 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM67A_pme) ).
thf(f143,plain,
( ~ spl3_2
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f142]) ).
thf(f142,plain,
( $false
| ~ spl3_2
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f138]) ).
thf(f138,plain,
( ( $true = $false )
| ~ spl3_2
| ~ spl3_4 ),
inference(backward_demodulation,[],[f26,f35]) ).
thf(f26,plain,
( ( $true
= ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK0 ) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f24]) ).
thf(f24,plain,
( spl3_2
<=> ( $true
= ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK0 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f131,plain,
( ~ spl3_1
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f130]) ).
thf(f130,plain,
( $false
| ~ spl3_1
| ~ spl3_3 ),
inference(trivial_inequality_removal,[],[f129]) ).
thf(f129,plain,
( ( $true = $false )
| ~ spl3_1
| ~ spl3_3 ),
inference(forward_demodulation,[],[f22,f31]) ).
thf(f31,plain,
( ( $false
= ( cF @ sK1 @ sK0 ) )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f29,plain,
( spl3_3
<=> ( $false
= ( cF @ sK1 @ sK0 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
thf(f114,plain,
( ~ spl3_2
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f113]) ).
thf(f113,plain,
( $false
| ~ spl3_2
| ~ spl3_3 ),
inference(trivial_inequality_removal,[],[f112]) ).
thf(f112,plain,
( ( $true = $false )
| ~ spl3_2
| ~ spl3_3 ),
inference(forward_demodulation,[],[f111,f31]) ).
thf(f111,plain,
( ( $true
= ( cF @ sK1 @ sK0 ) )
| ~ spl3_2
| ~ spl3_3 ),
inference(trivial_inequality_removal,[],[f104]) ).
thf(f104,plain,
( ( $true != $true )
| ( $true
= ( cF @ sK1 @ sK0 ) )
| ~ spl3_2
| ~ spl3_3 ),
inference(superposition,[],[f97,f26]) ).
thf(f97,plain,
( ! [X0: a] :
( ( $true
!= ( cF @ ( cG @ ( cF @ sK1 ) ) @ X0 ) )
| ( ( cF @ sK1 @ X0 )
= $true ) )
| ~ spl3_2
| ~ spl3_3 ),
inference(trivial_inequality_removal,[],[f96]) ).
thf(f96,plain,
( ! [X0: a] :
( ( $true = $false )
| ( ( cF @ sK1 @ X0 )
= $true )
| ( $true
!= ( cF @ ( cG @ ( cF @ sK1 ) ) @ X0 ) ) )
| ~ spl3_2
| ~ spl3_3 ),
inference(forward_demodulation,[],[f94,f31]) ).
thf(f94,plain,
( ! [X0: a] :
( ( $true
= ( cF @ sK1 @ sK0 ) )
| ( ( cF @ sK1 @ X0 )
= $true )
| ( $true
!= ( cF @ ( cG @ ( cF @ sK1 ) ) @ X0 ) ) )
| ~ spl3_2 ),
inference(trivial_inequality_removal,[],[f90]) ).
thf(f90,plain,
( ! [X0: a] :
( ( $true
!= ( cF @ ( cG @ ( cF @ sK1 ) ) @ X0 ) )
| ( $true != $true )
| ( ( cF @ sK1 @ X0 )
= $true )
| ( $true
= ( cF @ sK1 @ sK0 ) ) )
| ~ spl3_2 ),
inference(superposition,[],[f12,f74]) ).
thf(f74,plain,
( ! [X0: a > $o] :
( ( $true
= ( cG @ ( cF @ X0 ) @ ( sK2 @ ( cG @ ( cF @ sK1 ) ) @ X0 ) ) )
| ( $true
= ( cF @ X0 @ sK0 ) ) )
| ~ spl3_2 ),
inference(trivial_inequality_removal,[],[f71]) ).
thf(f71,plain,
( ! [X0: a > $o] :
( ( $true
= ( cG @ ( cF @ X0 ) @ ( sK2 @ ( cG @ ( cF @ sK1 ) ) @ X0 ) ) )
| ( $true
= ( cF @ X0 @ sK0 ) )
| ( $true != $true ) )
| ~ spl3_2 ),
inference(superposition,[],[f15,f65]) ).
thf(f65,plain,
( ! [X0: a > $o] :
( ( ( X0 @ ( sK2 @ ( cG @ ( cF @ sK1 ) ) @ X0 ) )
= $true )
| ( $true
= ( cF @ X0 @ sK0 ) ) )
| ~ spl3_2 ),
inference(trivial_inequality_removal,[],[f61]) ).
thf(f61,plain,
( ! [X0: a > $o] :
( ( $true
= ( cF @ X0 @ sK0 ) )
| ( $true != $true )
| ( ( X0 @ ( sK2 @ ( cG @ ( cF @ sK1 ) ) @ X0 ) )
= $true ) )
| ~ spl3_2 ),
inference(superposition,[],[f13,f26]) ).
thf(f13,plain,
! [X6: a > $o,X7: a,X5: a > $o] :
( ( ( cF @ X6 @ X7 )
!= $true )
| ( $true
= ( X5 @ ( sK2 @ X6 @ X5 ) ) )
| ( ( cF @ X5 @ X7 )
= $true ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f15,plain,
! [X2: a > $o,X3: a] :
( ( $true
!= ( X2 @ X3 ) )
| ( $true
= ( cG @ ( cF @ X2 ) @ X3 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f12,plain,
! [X6: a > $o,X7: a,X5: a > $o] :
( ( $true
!= ( X6 @ ( sK2 @ X6 @ X5 ) ) )
| ( ( cF @ X5 @ X7 )
= $true )
| ( ( cF @ X6 @ X7 )
!= $true ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f36,plain,
( spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f18,f33,f29]) ).
thf(f18,plain,
( ( $false
= ( cF @ sK1 @ sK0 ) )
| ( ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK0 )
= $false ) ),
inference(binary_proxy_clausification,[],[f16]) ).
thf(f16,plain,
( ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK0 )
!= ( cF @ sK1 @ sK0 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f27,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f17,f24,f20]) ).
thf(f17,plain,
( ( $true
= ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK0 ) )
| ( $true
= ( cF @ sK1 @ sK0 ) ) ),
inference(binary_proxy_clausification,[],[f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV398^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/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.14/0.35 % Computer : n023.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 19:19:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.14/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.20/0.37 % (6853)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.20/0.37 % (6851)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.20/0.37 % (6850)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.20/0.37 % (6855)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.20/0.37 % (6856)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.20/0.37 % (6855)Instruction limit reached!
% 0.20/0.37 % (6855)------------------------------
% 0.20/0.37 % (6855)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (6855)Termination reason: Unknown
% 0.20/0.37 % (6855)Termination phase: Property scanning
% 0.20/0.37
% 0.20/0.37 % (6855)Memory used [KB]: 895
% 0.20/0.37 % (6855)Time elapsed: 0.003 s
% 0.20/0.37 % (6855)Instructions burned: 2 (million)
% 0.20/0.37 % (6855)------------------------------
% 0.20/0.37 % (6855)------------------------------
% 0.20/0.37 % (6851)Instruction limit reached!
% 0.20/0.37 % (6851)------------------------------
% 0.20/0.37 % (6851)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (6851)Termination reason: Unknown
% 0.20/0.37 % (6851)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (6851)Memory used [KB]: 5500
% 0.20/0.37 % (6851)Time elapsed: 0.005 s
% 0.20/0.37 % (6851)Instructions burned: 4 (million)
% 0.20/0.37 % (6851)------------------------------
% 0.20/0.37 % (6851)------------------------------
% 0.20/0.37 % (6854)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.37 % (6854)Instruction limit reached!
% 0.20/0.37 % (6854)------------------------------
% 0.20/0.37 % (6854)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (6854)Termination reason: Unknown
% 0.20/0.37 % (6854)Termination phase: Saturation
% 0.20/0.38
% 0.20/0.38 % (6854)Memory used [KB]: 895
% 0.20/0.38 % (6854)Time elapsed: 0.003 s
% 0.20/0.38 % (6854)Instructions burned: 2 (million)
% 0.20/0.38 % (6854)------------------------------
% 0.20/0.38 % (6854)------------------------------
% 0.20/0.38 % (6858)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.20/0.38 % (6858)Instruction limit reached!
% 0.20/0.38 % (6858)------------------------------
% 0.20/0.38 % (6858)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (6858)Termination reason: Unknown
% 0.20/0.38 % (6858)Termination phase: Saturation
% 0.20/0.38
% 0.20/0.38 % (6858)Memory used [KB]: 5500
% 0.20/0.38 % (6858)Time elapsed: 0.004 s
% 0.20/0.38 % (6858)Instructions burned: 4 (million)
% 0.20/0.38 % (6858)------------------------------
% 0.20/0.38 % (6858)------------------------------
% 0.20/0.38 % (6857)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.20/0.38 % (6853)First to succeed.
% 0.20/0.39 % (6859)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.39 % (6853)Refutation found. Thanks to Tanya!
% 0.20/0.39 % SZS status Theorem for theBenchmark
% 0.20/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.39 % (6853)------------------------------
% 0.20/0.39 % (6853)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39 % (6853)Termination reason: Refutation
% 0.20/0.39
% 0.20/0.39 % (6853)Memory used [KB]: 5628
% 0.20/0.39 % (6853)Time elapsed: 0.017 s
% 0.20/0.39 % (6853)Instructions burned: 21 (million)
% 0.20/0.39 % (6853)------------------------------
% 0.20/0.39 % (6853)------------------------------
% 0.20/0.39 % (6849)Success in time 0.018 s
% 0.20/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------