TSTP Solution File: SEU897^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU897^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 : n012.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:52:06 EDT 2024
% Result : Theorem 0.20s 0.37s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 23
% Syntax : Number of formulae : 69 ( 1 unt; 10 typ; 0 def)
% Number of atoms : 424 ( 145 equ; 0 cnn)
% Maximal formula atoms : 12 ( 7 avg)
% Number of connectives : 464 ( 110 ~; 106 |; 34 &; 189 @)
% ( 12 <=>; 12 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 16 usr; 13 con; 0-2 aty)
% Number of variables : 95 ( 2 ^ 66 !; 26 ?; 95 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
cS: a > $o ).
thf(func_def_2,type,
cR: a > $o ).
thf(func_def_6,type,
sK0: a > a ).
thf(func_def_7,type,
sK1: a ).
thf(func_def_8,type,
sK2: a ).
thf(func_def_9,type,
sK3: a ).
thf(func_def_10,type,
sK4: a > ( a > a ) > a ).
thf(func_def_12,type,
ph6:
!>[X0: $tType] : X0 ).
thf(f96,plain,
$false,
inference(avatar_sat_refutation,[],[f32,f41,f45,f46,f53,f54,f58,f59,f67,f68,f95]) ).
thf(f95,plain,
( spl5_7
| ~ spl5_6
| ~ spl5_8 ),
inference(avatar_split_clause,[],[f93,f56,f48,f51]) ).
thf(f51,plain,
( spl5_7
<=> ! [X9: a] :
( ( $true
!= ( cR @ X9 ) )
| ( ( cS @ X9 )
= $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_7])]) ).
thf(f48,plain,
( spl5_6
<=> ! [X5: a > a,X8: a] :
( ( ( cS @ ( sK4 @ ( X5 @ X8 ) @ X5 ) )
= $true )
| ( $true
!= ( cR @ X8 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_6])]) ).
thf(f56,plain,
( spl5_8
<=> ! [X5: a > a,X8: a] :
( ( $true
!= ( cR @ X8 ) )
| ( ( X5 @ X8 )
= ( X5 @ ( sK4 @ ( X5 @ X8 ) @ X5 ) ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_8])]) ).
thf(f93,plain,
( ! [X0: a] :
( ( ( cR @ X0 )
!= $true )
| ( ( cS @ X0 )
= $true ) )
| ~ spl5_6
| ~ spl5_8 ),
inference(beta_eta_normalization,[],[f92]) ).
thf(f92,plain,
( ! [X0: a] :
( ( ( cR @ X0 )
!= $true )
| ( ( cS
@ ( ^ [Y0: a] : Y0
@ X0 ) )
= $true ) )
| ~ spl5_6
| ~ spl5_8 ),
inference(duplicate_literal_removal,[],[f87]) ).
thf(f87,plain,
( ! [X0: a] :
( ( ( cR @ X0 )
!= $true )
| ( ( cR @ X0 )
!= $true )
| ( ( cS
@ ( ^ [Y0: a] : Y0
@ X0 ) )
= $true ) )
| ~ spl5_6
| ~ spl5_8 ),
inference(superposition,[],[f49,f57]) ).
thf(f57,plain,
( ! [X8: a,X5: a > a] :
( ( ( X5 @ X8 )
= ( X5 @ ( sK4 @ ( X5 @ X8 ) @ X5 ) ) )
| ( $true
!= ( cR @ X8 ) ) )
| ~ spl5_8 ),
inference(avatar_component_clause,[],[f56]) ).
thf(f49,plain,
( ! [X8: a,X5: a > a] :
( ( ( cS @ ( sK4 @ ( X5 @ X8 ) @ X5 ) )
= $true )
| ( $true
!= ( cR @ X8 ) ) )
| ~ spl5_6 ),
inference(avatar_component_clause,[],[f48]) ).
thf(f68,plain,
( ~ spl5_1
| spl5_3
| ~ spl5_7 ),
inference(avatar_split_clause,[],[f64,f51,f34,f25]) ).
thf(f25,plain,
( spl5_1
<=> ( ( cR @ sK3 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
thf(f34,plain,
( spl5_3
<=> ( ( cS @ sK3 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
thf(f64,plain,
( ( ( cR @ sK3 )
!= $true )
| spl5_3
| ~ spl5_7 ),
inference(trivial_inequality_removal,[],[f62]) ).
thf(f62,plain,
( ( ( cR @ sK3 )
!= $true )
| ( $true != $true )
| spl5_3
| ~ spl5_7 ),
inference(superposition,[],[f36,f52]) ).
thf(f52,plain,
( ! [X9: a] :
( ( ( cS @ X9 )
= $true )
| ( $true
!= ( cR @ X9 ) ) )
| ~ spl5_7 ),
inference(avatar_component_clause,[],[f51]) ).
thf(f36,plain,
( ( ( cS @ sK3 )
!= $true )
| spl5_3 ),
inference(avatar_component_clause,[],[f34]) ).
thf(f67,plain,
( ~ spl5_2
| ~ spl5_4
| ~ spl5_5
| ~ spl5_7 ),
inference(avatar_contradiction_clause,[],[f66]) ).
thf(f66,plain,
( $false
| ~ spl5_2
| ~ spl5_4
| ~ spl5_5
| ~ spl5_7 ),
inference(subsumption_resolution,[],[f65,f40]) ).
thf(f40,plain,
( ( ( cR @ sK2 )
= $true )
| ~ spl5_4 ),
inference(avatar_component_clause,[],[f38]) ).
thf(f38,plain,
( spl5_4
<=> ( ( cR @ sK2 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_4])]) ).
thf(f65,plain,
( ( ( cR @ sK2 )
!= $true )
| ~ spl5_2
| ~ spl5_5
| ~ spl5_7 ),
inference(trivial_inequality_removal,[],[f63]) ).
thf(f63,plain,
( ( $true != $true )
| ( ( cR @ sK2 )
!= $true )
| ~ spl5_2
| ~ spl5_5
| ~ spl5_7 ),
inference(superposition,[],[f61,f52]) ).
thf(f61,plain,
( ( ( cS @ sK2 )
!= $true )
| ~ spl5_2
| ~ spl5_5 ),
inference(trivial_inequality_removal,[],[f60]) ).
thf(f60,plain,
( ( sK1 != sK1 )
| ( ( cS @ sK2 )
!= $true )
| ~ spl5_2
| ~ spl5_5 ),
inference(superposition,[],[f44,f31]) ).
thf(f31,plain,
( ( ( sK0 @ sK2 )
= sK1 )
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f29,plain,
( spl5_2
<=> ( ( sK0 @ sK2 )
= sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
thf(f44,plain,
( ! [X2: a] :
( ( sK1
!= ( sK0 @ X2 ) )
| ( ( cS @ X2 )
!= $true ) )
| ~ spl5_5 ),
inference(avatar_component_clause,[],[f43]) ).
thf(f43,plain,
( spl5_5
<=> ! [X2: a] :
( ( ( cS @ X2 )
!= $true )
| ( sK1
!= ( sK0 @ X2 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_5])]) ).
thf(f59,plain,
( spl5_2
| ~ spl5_3 ),
inference(avatar_split_clause,[],[f17,f34,f29]) ).
thf(f17,plain,
( ( ( cS @ sK3 )
!= $true )
| ( ( sK0 @ sK2 )
= sK1 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
( ( ( ! [X2: a] :
( ( sK1
!= ( sK0 @ X2 ) )
| ( ( cS @ X2 )
!= $true ) )
& ( ( cR @ sK2 )
= $true )
& ( ( sK0 @ sK2 )
= sK1 ) )
| ( ( ( cS @ sK3 )
!= $true )
& ( ( cR @ sK3 )
= $true ) ) )
& ( ! [X5: a > a,X6: a] :
( ( ( ( X5 @ ( sK4 @ X6 @ X5 ) )
= X6 )
& ( ( cS @ ( sK4 @ X6 @ X5 ) )
= $true ) )
| ! [X8: a] :
( ( $true
!= ( cR @ X8 ) )
| ( ( X5 @ X8 )
!= X6 ) ) )
| ! [X9: a] :
( ( ( cS @ X9 )
= $true )
| ( $true
!= ( cR @ X9 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f8,f12,f11,f10,f9]) ).
thf(f9,plain,
( ? [X0: a > a,X1: a] :
( ! [X2: a] :
( ( ( X0 @ X2 )
!= X1 )
| ( ( cS @ X2 )
!= $true ) )
& ? [X3: a] :
( ( $true
= ( cR @ X3 ) )
& ( ( X0 @ X3 )
= X1 ) ) )
=> ( ! [X2: a] :
( ( sK1
!= ( sK0 @ X2 ) )
| ( ( cS @ X2 )
!= $true ) )
& ? [X3: a] :
( ( $true
= ( cR @ X3 ) )
& ( sK1
= ( sK0 @ X3 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X3: a] :
( ( $true
= ( cR @ X3 ) )
& ( sK1
= ( sK0 @ X3 ) ) )
=> ( ( ( cR @ sK2 )
= $true )
& ( ( sK0 @ sK2 )
= sK1 ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X4: a] :
( ( ( cS @ X4 )
!= $true )
& ( ( cR @ X4 )
= $true ) )
=> ( ( ( cS @ sK3 )
!= $true )
& ( ( cR @ sK3 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
! [X5: a > a,X6: a] :
( ? [X7: a] :
( ( ( X5 @ X7 )
= X6 )
& ( $true
= ( cS @ X7 ) ) )
=> ( ( ( X5 @ ( sK4 @ X6 @ X5 ) )
= X6 )
& ( ( cS @ ( sK4 @ X6 @ X5 ) )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ( ? [X0: a > a,X1: a] :
( ! [X2: a] :
( ( ( X0 @ X2 )
!= X1 )
| ( ( cS @ X2 )
!= $true ) )
& ? [X3: a] :
( ( $true
= ( cR @ X3 ) )
& ( ( X0 @ X3 )
= X1 ) ) )
| ? [X4: a] :
( ( ( cS @ X4 )
!= $true )
& ( ( cR @ X4 )
= $true ) ) )
& ( ! [X5: a > a,X6: a] :
( ? [X7: a] :
( ( ( X5 @ X7 )
= X6 )
& ( $true
= ( cS @ X7 ) ) )
| ! [X8: a] :
( ( $true
!= ( cR @ X8 ) )
| ( ( X5 @ X8 )
!= X6 ) ) )
| ! [X9: a] :
( ( ( cS @ X9 )
= $true )
| ( $true
!= ( cR @ X9 ) ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
( ( ? [X0: a > a,X1: a] :
( ! [X3: a] :
( ( ( X0 @ X3 )
!= X1 )
| ( $true
!= ( cS @ X3 ) ) )
& ? [X2: a] :
( ( ( cR @ X2 )
= $true )
& ( ( X0 @ X2 )
= X1 ) ) )
| ? [X4: a] :
( ( ( cS @ X4 )
!= $true )
& ( ( cR @ X4 )
= $true ) ) )
& ( ! [X0: a > a,X1: a] :
( ? [X3: a] :
( ( ( X0 @ X3 )
= X1 )
& ( $true
= ( cS @ X3 ) ) )
| ! [X2: a] :
( ( ( cR @ X2 )
!= $true )
| ( ( X0 @ X2 )
!= X1 ) ) )
| ! [X4: a] :
( ( ( cS @ X4 )
= $true )
| ( ( cR @ X4 )
!= $true ) ) ) ),
inference(nnf_transformation,[],[f6]) ).
thf(f6,plain,
( ! [X4: a] :
( ( ( cS @ X4 )
= $true )
| ( ( cR @ X4 )
!= $true ) )
<~> ! [X0: a > a,X1: a] :
( ? [X3: a] :
( ( ( X0 @ X3 )
= X1 )
& ( $true
= ( cS @ X3 ) ) )
| ! [X2: a] :
( ( ( cR @ X2 )
!= $true )
| ( ( X0 @ X2 )
!= X1 ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ! [X4: a] :
( ( ( cR @ X4 )
= $true )
=> ( ( cS @ X4 )
= $true ) )
<=> ! [X1: a,X0: a > a] :
( ? [X2: a] :
( ( ( X0 @ X2 )
= X1 )
& ( ( cR @ X2 )
= $true ) )
=> ? [X3: a] :
( ( ( X0 @ X3 )
= X1 )
& ( $true
= ( cS @ X3 ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ! [X0: a > a,X1: a] :
( ? [X2: a] :
( ( cR @ X2 )
& ( ( X0 @ X2 )
= X1 ) )
=> ? [X3: a] :
( ( ( X0 @ X3 )
= X1 )
& ( cS @ X3 ) ) )
<=> ! [X4: a] :
( ( cR @ X4 )
=> ( cS @ X4 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [X1: a > a,X0: a] :
( ? [X2: a] :
( ( cR @ X2 )
& ( ( X1 @ X2 )
= X0 ) )
=> ? [X2: a] :
( ( ( X1 @ X2 )
= X0 )
& ( cS @ X2 ) ) )
<=> ! [X0: a] :
( ( cR @ X0 )
=> ( cS @ X0 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ! [X1: a > a,X0: a] :
( ? [X2: a] :
( ( cR @ X2 )
& ( ( X1 @ X2 )
= X0 ) )
=> ? [X2: a] :
( ( ( X1 @ X2 )
= X0 )
& ( cS @ X2 ) ) )
<=> ! [X0: a] :
( ( cR @ X0 )
=> ( cS @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM30_pme) ).
thf(f58,plain,
( spl5_8
| spl5_7 ),
inference(avatar_split_clause,[],[f22,f51,f56]) ).
thf(f22,plain,
! [X8: a,X9: a,X5: a > a] :
( ( ( cS @ X9 )
= $true )
| ( $true
!= ( cR @ X8 ) )
| ( ( X5 @ X8 )
= ( X5 @ ( sK4 @ ( X5 @ X8 ) @ X5 ) ) )
| ( $true
!= ( cR @ X9 ) ) ),
inference(equality_resolution,[],[f15]) ).
thf(f15,plain,
! [X8: a,X6: a,X9: a,X5: a > a] :
( ( ( X5 @ ( sK4 @ X6 @ X5 ) )
= X6 )
| ( $true
!= ( cR @ X8 ) )
| ( ( X5 @ X8 )
!= X6 )
| ( ( cS @ X9 )
= $true )
| ( $true
!= ( cR @ X9 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f54,plain,
( spl5_1
| spl5_4 ),
inference(avatar_split_clause,[],[f18,f38,f25]) ).
thf(f18,plain,
( ( ( cR @ sK2 )
= $true )
| ( ( cR @ sK3 )
= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f53,plain,
( spl5_6
| spl5_7 ),
inference(avatar_split_clause,[],[f23,f51,f48]) ).
thf(f23,plain,
! [X8: a,X9: a,X5: a > a] :
( ( ( cS @ ( sK4 @ ( X5 @ X8 ) @ X5 ) )
= $true )
| ( $true
!= ( cR @ X8 ) )
| ( $true
!= ( cR @ X9 ) )
| ( ( cS @ X9 )
= $true ) ),
inference(equality_resolution,[],[f14]) ).
thf(f14,plain,
! [X8: a,X6: a,X9: a,X5: a > a] :
( ( ( cS @ ( sK4 @ X6 @ X5 ) )
= $true )
| ( $true
!= ( cR @ X8 ) )
| ( ( X5 @ X8 )
!= X6 )
| ( ( cS @ X9 )
= $true )
| ( $true
!= ( cR @ X9 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f46,plain,
( spl5_1
| spl5_5 ),
inference(avatar_split_clause,[],[f20,f43,f25]) ).
thf(f20,plain,
! [X2: a] :
( ( ( cS @ X2 )
!= $true )
| ( ( cR @ sK3 )
= $true )
| ( sK1
!= ( sK0 @ X2 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f45,plain,
( spl5_5
| ~ spl5_3 ),
inference(avatar_split_clause,[],[f21,f34,f43]) ).
thf(f21,plain,
! [X2: a] :
( ( ( cS @ sK3 )
!= $true )
| ( ( cS @ X2 )
!= $true )
| ( sK1
!= ( sK0 @ X2 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f41,plain,
( ~ spl5_3
| spl5_4 ),
inference(avatar_split_clause,[],[f19,f38,f34]) ).
thf(f19,plain,
( ( ( cR @ sK2 )
= $true )
| ( ( cS @ sK3 )
!= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f32,plain,
( spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f16,f29,f25]) ).
thf(f16,plain,
( ( ( sK0 @ sK2 )
= sK1 )
| ( ( cR @ sK3 )
= $true ) ),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU897^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % 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.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 15:51:07 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 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/sandbox/benchmark/theBenchmark.p
% 0.20/0.36 % (15551)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.36 % (15550)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.36 % (15556)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.36 % (15553)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.36 % (15555)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.36 % (15552)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.36 % (15554)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.36 % (15557)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.37 % (15553)Instruction limit reached!
% 0.20/0.37 % (15553)------------------------------
% 0.20/0.37 % (15553)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (15553)Termination reason: Unknown
% 0.20/0.37 % (15553)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (15553)Memory used [KB]: 5500
% 0.20/0.37 % (15553)Time elapsed: 0.003 s
% 0.20/0.37 % (15553)Instructions burned: 2 (million)
% 0.20/0.37 % (15553)------------------------------
% 0.20/0.37 % (15553)------------------------------
% 0.20/0.37 % (15551)Instruction limit reached!
% 0.20/0.37 % (15551)------------------------------
% 0.20/0.37 % (15551)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (15551)Termination reason: Unknown
% 0.20/0.37 % (15551)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (15551)Memory used [KB]: 5500
% 0.20/0.37 % (15551)Time elapsed: 0.004 s
% 0.20/0.37 % (15551)Instructions burned: 4 (million)
% 0.20/0.37 % (15551)------------------------------
% 0.20/0.37 % (15551)------------------------------
% 0.20/0.37 % (15554)Instruction limit reached!
% 0.20/0.37 % (15554)------------------------------
% 0.20/0.37 % (15554)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (15554)Termination reason: Unknown
% 0.20/0.37 % (15554)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (15554)Memory used [KB]: 5500
% 0.20/0.37 % (15554)Time elapsed: 0.003 s
% 0.20/0.37 % (15554)Instructions burned: 2 (million)
% 0.20/0.37 % (15554)------------------------------
% 0.20/0.37 % (15554)------------------------------
% 0.20/0.37 % (15557)Instruction limit reached!
% 0.20/0.37 % (15557)------------------------------
% 0.20/0.37 % (15557)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (15557)Termination reason: Unknown
% 0.20/0.37 % (15557)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (15557)Memory used [KB]: 5500
% 0.20/0.37 % (15557)Time elapsed: 0.003 s
% 0.20/0.37 % (15557)Instructions burned: 3 (million)
% 0.20/0.37 % (15557)------------------------------
% 0.20/0.37 % (15557)------------------------------
% 0.20/0.37 % (15550)First to succeed.
% 0.20/0.37 % (15555)Refutation not found, incomplete strategy
% 0.20/0.37 % (15555)------------------------------
% 0.20/0.37 % (15555)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (15555)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 % (15555)Memory used [KB]: 5500
% 0.20/0.37 % (15555)Time elapsed: 0.006 s
% 0.20/0.37 % (15555)Instructions burned: 5 (million)
% 0.20/0.37 % (15555)------------------------------
% 0.20/0.37 % (15555)------------------------------
% 0.20/0.37 % (15552)Refutation not found, incomplete strategy
% 0.20/0.37 % (15552)------------------------------
% 0.20/0.37 % (15552)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (15552)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 % (15552)Memory used [KB]: 5500
% 0.20/0.37 % (15552)Time elapsed: 0.008 s
% 0.20/0.37 % (15552)Instructions burned: 9 (million)
% 0.20/0.37 % (15552)------------------------------
% 0.20/0.37 % (15552)------------------------------
% 0.20/0.37 % (15550)Refutation found. Thanks to Tanya!
% 0.20/0.37 % SZS status Theorem for theBenchmark
% 0.20/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.37 % (15550)------------------------------
% 0.20/0.37 % (15550)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (15550)Termination reason: Refutation
% 0.20/0.37
% 0.20/0.37 % (15550)Memory used [KB]: 5628
% 0.20/0.37 % (15550)Time elapsed: 0.007 s
% 0.20/0.37 % (15550)Instructions burned: 7 (million)
% 0.20/0.37 % (15550)------------------------------
% 0.20/0.37 % (15550)------------------------------
% 0.20/0.37 % (15549)Success in time 0.007 s
% 0.20/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------