TSTP Solution File: SYO026^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO026^1 : TPTP v8.2.0. Released v3.7.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 : n003.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:02:16 EDT 2024
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 15
% Syntax : Number of formulae : 100 ( 18 unt; 3 typ; 0 def)
% Number of atoms : 516 ( 115 equ; 3 cnn)
% Maximal formula atoms : 7 ( 5 avg)
% Number of connectives : 347 ( 129 ~; 99 |; 27 &; 76 @)
% ( 10 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 21 ( 17 usr; 17 con; 0-2 aty)
% Number of variables : 54 ( 45 ^ 5 !; 3 ?; 54 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
p: ( $o > $o ) > $o ).
thf(func_def_7,type,
sK0: $o > $o ).
thf(func_def_9,type,
ph2:
!>[X0: $tType] : X0 ).
thf(f207,plain,
$false,
inference(avatar_sat_refutation,[],[f32,f41,f57,f66,f94,f103,f131,f135,f152,f167,f203,f206]) ).
thf(f206,plain,
( ~ spl1_1
| spl1_2
| spl1_8
| ~ spl1_9 ),
inference(avatar_contradiction_clause,[],[f205]) ).
thf(f205,plain,
( $false
| ~ spl1_1
| spl1_2
| spl1_8
| ~ spl1_9 ),
inference(subsumption_resolution,[],[f204,f97]) ).
thf(f97,plain,
( ( $false != sK6 )
| spl1_8 ),
inference(avatar_component_clause,[],[f96]) ).
thf(f96,plain,
( spl1_8
<=> ( $false = sK6 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_8])]) ).
thf(f204,plain,
( ( $false = sK6 )
| ~ spl1_1
| spl1_2
| ~ spl1_9 ),
inference(subsumption_resolution,[],[f182,f30]) ).
thf(f30,plain,
( ( $false != sK3 )
| spl1_2 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f29,plain,
( spl1_2
<=> ( $false = sK3 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
thf(f182,plain,
( ( $false = sK3 )
| ( $false = sK6 )
| ~ spl1_1
| ~ spl1_9 ),
inference(binary_proxy_clausification,[],[f180]) ).
thf(f180,plain,
( ( sK6 != sK3 )
| ~ spl1_1
| ~ spl1_9 ),
inference(trivial_inequality_removal,[],[f175]) ).
thf(f175,plain,
( ( $false = $true )
| ( sK6 != sK3 )
| ~ spl1_1
| ~ spl1_9 ),
inference(constrained_superposition,[],[f27,f102]) ).
thf(f102,plain,
( ( $false
= ( sK0 @ sK6 ) )
| ~ spl1_9 ),
inference(avatar_component_clause,[],[f100]) ).
thf(f100,plain,
( spl1_9
<=> ( $false
= ( sK0 @ sK6 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_9])]) ).
thf(f27,plain,
( ( ( sK0 @ sK3 )
= $true )
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f25]) ).
thf(f25,plain,
( spl1_1
<=> ( ( sK0 @ sK3 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
thf(f203,plain,
( ~ spl1_5
| ~ spl1_7
| ~ spl1_9 ),
inference(avatar_contradiction_clause,[],[f202]) ).
thf(f202,plain,
( $false
| ~ spl1_5
| ~ spl1_7
| ~ spl1_9 ),
inference(subsumption_resolution,[],[f172,f69]) ).
thf(f69,plain,
( ( ( sK0 @ $true )
!= $false )
| ~ spl1_5 ),
inference(superposition,[],[f46,f56]) ).
thf(f56,plain,
( ( sK4 = $true )
| ~ spl1_5 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f54,plain,
( spl1_5
<=> ( sK4 = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_5])]) ).
thf(f46,plain,
( $false
!= ( sK0 @ sK4 ) ),
inference(beta_eta_normalization,[],[f45]) ).
thf(f45,plain,
( ( ^ [Y0: $o] : $false
@ sK4 )
!= ( sK0 @ sK4 ) ),
inference(negative_extensionality,[],[f44]) ).
thf(f44,plain,
( sK0
!= ( ^ [Y0: $o] : $false ) ),
inference(trivial_inequality_removal,[],[f43]) ).
thf(f43,plain,
( ( sK0
!= ( ^ [Y0: $o] : $false ) )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f15,f12]) ).
thf(f12,plain,
( ( p
@ ^ [Y0: $o] : $false )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ( ( p @ sK0 )
!= $true )
& ( ( p
@ ^ [Y0: $o] : Y0 )
= $true )
& ( ( p
@ ^ [Y0: $o] : $true )
= $true )
& ( ( p
@ ^ [Y0: $o] : $false )
= $true )
& ( ( p
@ ^ [Y0: $o] : ~ Y0 )
= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9]) ).
thf(f9,plain,
( ? [X0: $o > $o] :
( $true
!= ( p @ X0 ) )
=> ( ( p @ sK0 )
!= $true ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ? [X0: $o > $o] :
( $true
!= ( p @ X0 ) )
& ( ( p
@ ^ [Y0: $o] : Y0 )
= $true )
& ( ( p
@ ^ [Y0: $o] : $true )
= $true )
& ( ( p
@ ^ [Y0: $o] : $false )
= $true )
& ( ( p
@ ^ [Y0: $o] : ~ Y0 )
= $true ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
( ? [X0: $o > $o] :
( $true
!= ( p @ X0 ) )
& ( ( p
@ ^ [Y0: $o] : $false )
= $true )
& ( ( p
@ ^ [Y0: $o] : $true )
= $true )
& ( ( p
@ ^ [Y0: $o] : Y0 )
= $true )
& ( ( p
@ ^ [Y0: $o] : ~ Y0 )
= $true ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ( ( ( ( p
@ ^ [Y0: $o] : $false )
= $true )
& ( ( p
@ ^ [Y0: $o] : $true )
= $true )
& ( ( p
@ ^ [Y0: $o] : Y0 )
= $true )
& ( ( p
@ ^ [Y0: $o] : ~ Y0 )
= $true ) )
=> ! [X0: $o > $o] :
( $true
= ( p @ X0 ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,plain,
~ ( ( ( ( p
@ ^ [Y0: $o] : $false )
= $true )
& ( ( p
@ ^ [Y0: $o] : $true )
= $true )
& ( ( p
@ ^ [Y0: $o] : Y0 )
= $true )
& ( ( p
@ ^ [Y0: $o] : ~ Y0 )
= $true ) )
=> ! [X4: $o > $o] :
( ( p @ X4 )
= $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ( ( p
@ ^ [X0: $o] : X0 )
& ( p
@ ^ [X1: $o] : $true )
& ( p
@ ^ [X2: $o] : ~ X2 )
& ( p
@ ^ [X3: $o] : $false ) )
=> ! [X4: $o > $o] : ( p @ X4 ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ( p
@ ^ [X0: $o] : X0 )
& ( p
@ ^ [X0: $o] : $true )
& ( p
@ ^ [X0: $o] : ~ X0 )
& ( p
@ ^ [X0: $o] : $false ) )
=> ! [X1: $o > $o] : ( p @ X1 ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ( p
@ ^ [X0: $o] : X0 )
& ( p
@ ^ [X0: $o] : $true )
& ( p
@ ^ [X0: $o] : ~ X0 )
& ( p
@ ^ [X0: $o] : $false ) )
=> ! [X1: $o > $o] : ( p @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(f15,plain,
( ( p @ sK0 )
!= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f172,plain,
( ( ( sK0 @ $true )
= $false )
| ~ spl1_7
| ~ spl1_9 ),
inference(superposition,[],[f102,f93]) ).
thf(f93,plain,
( ( sK6 = $true )
| ~ spl1_7 ),
inference(avatar_component_clause,[],[f91]) ).
thf(f91,plain,
( spl1_7
<=> ( sK6 = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_7])]) ).
thf(f167,plain,
( ~ spl1_1
| ~ spl1_4
| ~ spl1_10 ),
inference(avatar_contradiction_clause,[],[f166]) ).
thf(f166,plain,
( $false
| ~ spl1_1
| ~ spl1_4
| ~ spl1_10 ),
inference(subsumption_resolution,[],[f155,f154]) ).
thf(f154,plain,
( ( ( sK0 @ $true )
!= $true )
| ~ spl1_10 ),
inference(superposition,[],[f75,f130]) ).
thf(f130,plain,
( ( sK5 = $true )
| ~ spl1_10 ),
inference(avatar_component_clause,[],[f128]) ).
thf(f128,plain,
( spl1_10
<=> ( sK5 = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_10])]) ).
thf(f75,plain,
( ( sK0 @ sK5 )
!= $true ),
inference(beta_eta_normalization,[],[f74]) ).
thf(f74,plain,
( ( sK0 @ sK5 )
!= ( ^ [Y0: $o] : $true
@ sK5 ) ),
inference(negative_extensionality,[],[f59]) ).
thf(f59,plain,
( sK0
!= ( ^ [Y0: $o] : $true ) ),
inference(trivial_inequality_removal,[],[f58]) ).
thf(f58,plain,
( ( $true != $true )
| ( sK0
!= ( ^ [Y0: $o] : $true ) ) ),
inference(constrained_superposition,[],[f15,f13]) ).
thf(f13,plain,
( ( p
@ ^ [Y0: $o] : $true )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f155,plain,
( ( ( sK0 @ $true )
= $true )
| ~ spl1_1
| ~ spl1_4 ),
inference(superposition,[],[f27,f40]) ).
thf(f40,plain,
( ( sK3 = $true )
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f38]) ).
thf(f38,plain,
( spl1_4
<=> ( sK3 = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_4])]) ).
thf(f152,plain,
( ~ spl1_7
| ~ spl1_8 ),
inference(avatar_contradiction_clause,[],[f151]) ).
thf(f151,plain,
( $false
| ~ spl1_7
| ~ spl1_8 ),
inference(trivial_inequality_removal,[],[f146]) ).
thf(f146,plain,
( ( $false = $true )
| ~ spl1_7
| ~ spl1_8 ),
inference(superposition,[],[f98,f93]) ).
thf(f98,plain,
( ( $false = sK6 )
| ~ spl1_8 ),
inference(avatar_component_clause,[],[f96]) ).
thf(f135,plain,
( spl1_7
| ~ spl1_3
| spl1_4
| ~ spl1_6 ),
inference(avatar_split_clause,[],[f134,f87,f38,f34,f91]) ).
thf(f34,plain,
( spl1_3
<=> ( ( sK0 @ sK3 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).
thf(f87,plain,
( spl1_6
<=> ( ( sK0 @ sK6 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_6])]) ).
thf(f134,plain,
( ( sK6 = $true )
| ~ spl1_3
| spl1_4
| ~ spl1_6 ),
inference(subsumption_resolution,[],[f114,f39]) ).
thf(f39,plain,
( ( sK3 != $true )
| spl1_4 ),
inference(avatar_component_clause,[],[f38]) ).
thf(f114,plain,
( ( sK3 = $true )
| ( sK6 = $true )
| ~ spl1_3
| ~ spl1_6 ),
inference(binary_proxy_clausification,[],[f113]) ).
thf(f113,plain,
( ( sK6 != sK3 )
| ~ spl1_3
| ~ spl1_6 ),
inference(trivial_inequality_removal,[],[f106]) ).
thf(f106,plain,
( ( sK6 != sK3 )
| ( $false = $true )
| ~ spl1_3
| ~ spl1_6 ),
inference(constrained_superposition,[],[f89,f36]) ).
thf(f36,plain,
( ( ( sK0 @ sK3 )
= $false )
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f34]) ).
thf(f89,plain,
( ( ( sK0 @ sK6 )
= $true )
| ~ spl1_6 ),
inference(avatar_component_clause,[],[f87]) ).
thf(f131,plain,
( spl1_10
| spl1_7
| ~ spl1_6 ),
inference(avatar_split_clause,[],[f122,f87,f91,f128]) ).
thf(f122,plain,
( ( sK6 = $true )
| ( sK5 = $true )
| ~ spl1_6 ),
inference(binary_proxy_clausification,[],[f121]) ).
thf(f121,plain,
( ( sK6 != sK5 )
| ~ spl1_6 ),
inference(trivial_inequality_removal,[],[f107]) ).
thf(f107,plain,
( ( $true != $true )
| ( sK6 != sK5 )
| ~ spl1_6 ),
inference(constrained_superposition,[],[f75,f89]) ).
thf(f103,plain,
( spl1_8
| spl1_9 ),
inference(avatar_split_clause,[],[f85,f100,f96]) ).
thf(f85,plain,
( ( $false = sK6 )
| ( $false
= ( sK0 @ sK6 ) ) ),
inference(binary_proxy_clausification,[],[f83]) ).
thf(f83,plain,
( sK6
!= ( sK0 @ sK6 ) ),
inference(beta_eta_normalization,[],[f82]) ).
thf(f82,plain,
( ( ^ [Y0: $o] : Y0
@ sK6 )
!= ( sK0 @ sK6 ) ),
inference(negative_extensionality,[],[f81]) ).
thf(f81,plain,
( sK0
!= ( ^ [Y0: $o] : Y0 ) ),
inference(trivial_inequality_removal,[],[f80]) ).
thf(f80,plain,
( ( $true != $true )
| ( sK0
!= ( ^ [Y0: $o] : Y0 ) ) ),
inference(constrained_superposition,[],[f15,f14]) ).
thf(f14,plain,
( ( p
@ ^ [Y0: $o] : Y0 )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f94,plain,
( spl1_6
| spl1_7 ),
inference(avatar_split_clause,[],[f84,f91,f87]) ).
thf(f84,plain,
( ( sK6 = $true )
| ( ( sK0 @ sK6 )
= $true ) ),
inference(binary_proxy_clausification,[],[f83]) ).
thf(f66,plain,
( ~ spl1_2
| ~ spl1_4 ),
inference(avatar_contradiction_clause,[],[f65]) ).
thf(f65,plain,
( $false
| ~ spl1_2
| ~ spl1_4 ),
inference(trivial_inequality_removal,[],[f60]) ).
thf(f60,plain,
( ( $false = $true )
| ~ spl1_2
| ~ spl1_4 ),
inference(superposition,[],[f40,f31]) ).
thf(f31,plain,
( ( $false = sK3 )
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f57,plain,
( spl1_5
| spl1_4
| ~ spl1_3 ),
inference(avatar_split_clause,[],[f51,f34,f38,f54]) ).
thf(f51,plain,
( ( sK3 = $true )
| ( sK4 = $true )
| ~ spl1_3 ),
inference(binary_proxy_clausification,[],[f50]) ).
thf(f50,plain,
( ( sK4 != sK3 )
| ~ spl1_3 ),
inference(trivial_inequality_removal,[],[f48]) ).
thf(f48,plain,
( ( $false != $false )
| ( sK4 != sK3 )
| ~ spl1_3 ),
inference(constrained_superposition,[],[f46,f36]) ).
thf(f41,plain,
( spl1_3
| spl1_4 ),
inference(avatar_split_clause,[],[f22,f38,f34]) ).
thf(f22,plain,
( ( ( sK0 @ sK3 )
= $false )
| ( sK3 = $true ) ),
inference(not_proxy_clausification,[],[f21]) ).
thf(f21,plain,
( ( ~ sK3 = $false )
| ( ( sK0 @ sK3 )
= $false ) ),
inference(binary_proxy_clausification,[],[f19]) ).
thf(f19,plain,
( ~ sK3
!= ( sK0 @ sK3 ) ),
inference(negative_extensionality,[],[f18]) ).
thf(f18,plain,
sK0 != (~),
inference(trivial_inequality_removal,[],[f17]) ).
thf(f17,plain,
( ( $true != $true )
| ( sK0 != (~) ) ),
inference(constrained_superposition,[],[f15,f16]) ).
thf(f16,plain,
( ( p @ (~) )
= $true ),
inference(beta_eta_normalization,[],[f11]) ).
thf(f11,plain,
( ( p
@ ^ [Y0: $o] : ~ Y0 )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f32,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f23,f29,f25]) ).
thf(f23,plain,
( ( ( sK0 @ sK3 )
= $true )
| ( $false = sK3 ) ),
inference(not_proxy_clausification,[],[f20]) ).
thf(f20,plain,
( ( ( sK0 @ sK3 )
= $true )
| ( ~ sK3 = $true ) ),
inference(binary_proxy_clausification,[],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO026^1 : TPTP v8.2.0. Released v3.7.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.13/0.35 % Computer : n003.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 10:34:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.20/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 % (21863)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 % (21863)Refutation not found, incomplete strategy
% 0.20/0.37 % (21863)------------------------------
% 0.20/0.37 % (21863)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (21863)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 % (21863)Memory used [KB]: 5500
% 0.20/0.37 % (21863)Time elapsed: 0.003 s
% 0.20/0.37 % (21863)Instructions burned: 2 (million)
% 0.20/0.37 % (21863)------------------------------
% 0.20/0.37 % (21863)------------------------------
% 0.20/0.37 % (21862)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 % (21866)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.37 % (21864)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 % (21867)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 % (21868)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 % (21869)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.37 % (21866)Refutation not found, incomplete strategy
% 0.20/0.37 % (21866)------------------------------
% 0.20/0.37 % (21866)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (21866)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 % (21867)Instruction limit reached!
% 0.20/0.37 % (21867)------------------------------
% 0.20/0.37 % (21867)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (21867)Termination reason: Unknown
% 0.20/0.37 % (21867)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (21864)Refutation not found, incomplete strategy
% 0.20/0.37 % (21864)------------------------------
% 0.20/0.37 % (21864)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (21867)Memory used [KB]: 5500
% 0.20/0.37 % (21864)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 % (21867)Time elapsed: 0.004 s
% 0.20/0.37 % (21867)Instructions burned: 2 (million)
% 0.20/0.37 % (21864)Memory used [KB]: 5500
% 0.20/0.37 % (21867)------------------------------
% 0.20/0.37 % (21867)------------------------------
% 0.20/0.37 % (21864)Time elapsed: 0.004 s
% 0.20/0.37 % (21864)Instructions burned: 2 (million)
% 0.20/0.37 % (21864)------------------------------
% 0.20/0.37 % (21864)------------------------------
% 0.20/0.37 % (21868)Refutation not found, incomplete strategy
% 0.20/0.37 % (21868)------------------------------
% 0.20/0.37 % (21868)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (21868)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 % (21868)Memory used [KB]: 5500
% 0.20/0.37 % (21868)Time elapsed: 0.004 s
% 0.20/0.37 % (21868)Instructions burned: 1 (million)
% 0.20/0.37 % (21868)------------------------------
% 0.20/0.37 % (21868)------------------------------
% 0.20/0.37 % (21866)Memory used [KB]: 5500
% 0.20/0.37 % (21866)Time elapsed: 0.004 s
% 0.20/0.37 % (21866)Instructions burned: 1 (million)
% 0.20/0.37 % (21866)------------------------------
% 0.20/0.37 % (21866)------------------------------
% 0.20/0.38 % (21869)Refutation not found, incomplete strategy
% 0.20/0.38 % (21869)------------------------------
% 0.20/0.38 % (21869)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (21869)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 % (21869)Memory used [KB]: 5500
% 0.20/0.38 % (21869)Time elapsed: 0.006 s
% 0.20/0.38 % (21869)Instructions burned: 4 (million)
% 0.20/0.38 % (21869)------------------------------
% 0.20/0.38 % (21869)------------------------------
% 0.20/0.38 % (21871)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.38 % (21862)First to succeed.
% 0.20/0.38 % (21870)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 % (21871)Refutation not found, incomplete strategy
% 0.20/0.38 % (21871)------------------------------
% 0.20/0.38 % (21871)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (21871)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 % (21871)Memory used [KB]: 5500
% 0.20/0.38 % (21871)Time elapsed: 0.005 s
% 0.20/0.38 % (21871)Instructions burned: 8 (million)
% 0.20/0.38 % (21871)------------------------------
% 0.20/0.38 % (21871)------------------------------
% 0.20/0.38 % (21862)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for theBenchmark
% 0.20/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.38 % (21862)------------------------------
% 0.20/0.38 % (21862)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (21862)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (21862)Memory used [KB]: 5628
% 0.20/0.38 % (21862)Time elapsed: 0.011 s
% 0.20/0.38 % (21862)Instructions burned: 7 (million)
% 0.20/0.38 % (21862)------------------------------
% 0.20/0.38 % (21862)------------------------------
% 0.20/0.38 % (21859)Success in time 0.012 s
% 0.20/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------