TSTP Solution File: SYO503^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO503^1 : TPTP v8.2.0. Released v4.1.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 : 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 09:05:33 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of formulae : 100 ( 10 unt; 4 typ; 0 def)
% Number of atoms : 531 ( 110 equ; 0 cnn)
% Maximal formula atoms : 13 ( 5 avg)
% Number of connectives : 345 ( 130 ~; 144 |; 6 &; 56 @)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 16 usr; 14 con; 0-2 aty)
% Number of variables : 1 ( 0 ^ 0 !; 0 ?; 1 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_3,type,
f: $o > $o ).
thf(func_def_4,type,
g: $o > $o ).
thf(func_def_5,type,
p: ( $o > $o ) > $o ).
thf(func_def_10,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f207,plain,
$false,
inference(avatar_sat_refutation,[],[f25,f34,f61,f86,f102,f103,f138,f140,f148,f156,f163,f179,f187,f202,f203,f206]) ).
thf(f206,plain,
( spl0_3
| spl0_5
| spl0_10 ),
inference(avatar_contradiction_clause,[],[f205]) ).
thf(f205,plain,
( $false
| spl0_3
| spl0_5
| spl0_10 ),
inference(subsumption_resolution,[],[f204,f28]) ).
thf(f28,plain,
( ( b != $false )
| spl0_3 ),
inference(avatar_component_clause,[],[f27]) ).
thf(f27,plain,
( spl0_3
<=> ( b = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
thf(f204,plain,
( ( b = $false )
| spl0_5
| spl0_10 ),
inference(subsumption_resolution,[],[f195,f159]) ).
thf(f159,plain,
( ( sK2 != $false )
| spl0_10 ),
inference(avatar_component_clause,[],[f158]) ).
thf(f158,plain,
( spl0_10
<=> ( sK2 = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_10])]) ).
thf(f195,plain,
( ( sK2 = $false )
| ( b = $false )
| spl0_5 ),
inference(binary_proxy_clausification,[],[f193]) ).
thf(f193,plain,
( ( b != sK2 )
| spl0_5 ),
inference(trivial_inequality_removal,[],[f191]) ).
thf(f191,plain,
( ( $true != $true )
| ( b != sK2 )
| spl0_5 ),
inference(constrained_superposition,[],[f46,f13]) ).
thf(f13,plain,
( ( f @ b )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f7,plain,
( ( ( g @ b )
= $true )
& ( ( f @ b )
= $true )
& ( ( p @ f )
= $true )
& ( a != b )
& ( ( p @ g )
!= $true )
& ( ( g @ a )
= $true )
& ( ( f @ a )
= $true ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ( ( ( p @ g )
= $true )
| ( a = b )
| ( ( f @ a )
!= $true )
| ( ( p @ f )
!= $true )
| ( ( g @ b )
!= $true )
| ( ( f @ b )
!= $true )
| ( ( g @ a )
!= $true ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ( ( ( p @ g )
= $true )
| ( ( f @ b )
!= $true )
| ( ( f @ a )
!= $true )
| ( a = b )
| ( ( g @ b )
!= $true )
| ( ( g @ a )
!= $true )
| ( ( p @ f )
!= $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ( p @ g )
| ~ ( f @ b )
| ~ ( f @ a )
| ( a = b )
| ~ ( g @ b )
| ~ ( g @ a )
| ~ ( p @ f ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( p @ g )
| ~ ( f @ b )
| ~ ( f @ a )
| ( a = b )
| ~ ( g @ b )
| ~ ( g @ a )
| ~ ( p @ f ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( p @ g )
| ~ ( f @ b )
| ~ ( f @ a )
| ( a = b )
| ~ ( g @ b )
| ~ ( g @ a )
| ~ ( p @ f ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',claim) ).
thf(f46,plain,
( ( $true
!= ( f @ sK2 ) )
| spl0_5 ),
inference(avatar_component_clause,[],[f45]) ).
thf(f45,plain,
( spl0_5
<=> ( $true
= ( f @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
thf(f203,plain,
( ~ spl0_9
| ~ spl0_1
| spl0_5 ),
inference(avatar_split_clause,[],[f197,f45,f18,f93]) ).
thf(f93,plain,
( spl0_9
<=> ( $true = sK2 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_9])]) ).
thf(f18,plain,
( spl0_1
<=> ( b = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f197,plain,
( ( $true != sK2 )
| ~ spl0_1
| spl0_5 ),
inference(trivial_inequality_removal,[],[f190]) ).
thf(f190,plain,
( ( $true != sK2 )
| ( $true != $true )
| ~ spl0_1
| spl0_5 ),
inference(constrained_superposition,[],[f46,f151]) ).
thf(f151,plain,
( ( $true
= ( f @ $true ) )
| ~ spl0_1 ),
inference(superposition,[],[f13,f20]) ).
thf(f20,plain,
( ( b = $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f18]) ).
thf(f202,plain,
( spl0_9
| spl0_2
| spl0_5 ),
inference(avatar_split_clause,[],[f201,f45,f22,f93]) ).
thf(f22,plain,
( spl0_2
<=> ( a = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f201,plain,
( ( $true = sK2 )
| spl0_2
| spl0_5 ),
inference(subsumption_resolution,[],[f199,f23]) ).
thf(f23,plain,
( ( a != $true )
| spl0_2 ),
inference(avatar_component_clause,[],[f22]) ).
thf(f199,plain,
( ( $true = sK2 )
| ( a = $true )
| spl0_5 ),
inference(binary_proxy_clausification,[],[f198]) ).
thf(f198,plain,
( ( a != sK2 )
| spl0_5 ),
inference(trivial_inequality_removal,[],[f192]) ).
thf(f192,plain,
( ( a != sK2 )
| ( $true != $true )
| spl0_5 ),
inference(constrained_superposition,[],[f46,f8]) ).
thf(f8,plain,
( ( f @ a )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f187,plain,
( ~ spl0_2
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f186]) ).
thf(f186,plain,
( $false
| ~ spl0_2
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f180]) ).
thf(f180,plain,
( ( $true = $false )
| ~ spl0_2
| ~ spl0_4 ),
inference(superposition,[],[f24,f33]) ).
thf(f33,plain,
( ( a = $false )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f31]) ).
thf(f31,plain,
( spl0_4
<=> ( a = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
thf(f24,plain,
( ( a = $true )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f22]) ).
thf(f179,plain,
( ~ spl0_9
| ~ spl0_10 ),
inference(avatar_contradiction_clause,[],[f178]) ).
thf(f178,plain,
( $false
| ~ spl0_9
| ~ spl0_10 ),
inference(trivial_inequality_removal,[],[f172]) ).
thf(f172,plain,
( ( $true = $false )
| ~ spl0_9
| ~ spl0_10 ),
inference(superposition,[],[f95,f160]) ).
thf(f160,plain,
( ( sK2 = $false )
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f158]) ).
thf(f95,plain,
( ( $true = sK2 )
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f93]) ).
thf(f163,plain,
( spl0_10
| spl0_3
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f162,f58,f27,f158]) ).
thf(f58,plain,
( spl0_8
<=> ( $false
= ( g @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_8])]) ).
thf(f162,plain,
( ( sK2 = $false )
| spl0_3
| ~ spl0_8 ),
inference(subsumption_resolution,[],[f129,f28]) ).
thf(f129,plain,
( ( b = $false )
| ( sK2 = $false )
| ~ spl0_8 ),
inference(binary_proxy_clausification,[],[f127]) ).
thf(f127,plain,
( ( b != sK2 )
| ~ spl0_8 ),
inference(trivial_inequality_removal,[],[f115]) ).
thf(f115,plain,
( ( b != sK2 )
| ( $true = $false )
| ~ spl0_8 ),
inference(constrained_superposition,[],[f60,f14]) ).
thf(f14,plain,
( ( g @ b )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f60,plain,
( ( $false
= ( g @ sK2 ) )
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f58]) ).
thf(f156,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f155]) ).
thf(f155,plain,
( $false
| ~ spl0_1
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f149]) ).
thf(f149,plain,
( ( $true = $false )
| ~ spl0_1
| ~ spl0_3 ),
inference(superposition,[],[f20,f29]) ).
thf(f29,plain,
( ( b = $false )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f27]) ).
thf(f148,plain,
( spl0_9
| spl0_2
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f147,f58,f22,f93]) ).
thf(f147,plain,
( ( $true = sK2 )
| spl0_2
| ~ spl0_8 ),
inference(subsumption_resolution,[],[f125,f23]) ).
thf(f125,plain,
( ( $true = sK2 )
| ( a = $true )
| ~ spl0_8 ),
inference(binary_proxy_clausification,[],[f124]) ).
thf(f124,plain,
( ( a != sK2 )
| ~ spl0_8 ),
inference(trivial_inequality_removal,[],[f120]) ).
thf(f120,plain,
( ( $true = $false )
| ( a != sK2 )
| ~ spl0_8 ),
inference(constrained_superposition,[],[f9,f60]) ).
thf(f9,plain,
( ( g @ a )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f140,plain,
( spl0_9
| spl0_1
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f128,f58,f18,f93]) ).
thf(f128,plain,
( ( $true = sK2 )
| ( b = $true )
| ~ spl0_8 ),
inference(binary_proxy_clausification,[],[f127]) ).
thf(f138,plain,
( ~ spl0_9
| ~ spl0_2
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f134,f58,f22,f93]) ).
thf(f134,plain,
( ( $true != sK2 )
| ~ spl0_2
| ~ spl0_8 ),
inference(trivial_inequality_removal,[],[f114]) ).
thf(f114,plain,
( ( $true != sK2 )
| ( $true = $false )
| ~ spl0_2
| ~ spl0_8 ),
inference(constrained_superposition,[],[f60,f36]) ).
thf(f36,plain,
( ( $true
= ( g @ $true ) )
| ~ spl0_2 ),
inference(superposition,[],[f9,f24]) ).
thf(f103,plain,
( ~ spl0_9
| ~ spl0_2
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f72,f54,f22,f93]) ).
thf(f54,plain,
( spl0_7
<=> ( ( f @ sK2 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_7])]) ).
thf(f72,plain,
( ( $true != sK2 )
| ~ spl0_2
| ~ spl0_7 ),
inference(trivial_inequality_removal,[],[f69]) ).
thf(f69,plain,
( ( $true != sK2 )
| ( $true = $false )
| ~ spl0_2
| ~ spl0_7 ),
inference(constrained_superposition,[],[f35,f56]) ).
thf(f56,plain,
( ( ( f @ sK2 )
= $false )
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f35,plain,
( ( $true
= ( f @ $true ) )
| ~ spl0_2 ),
inference(superposition,[],[f8,f24]) ).
thf(f102,plain,
( spl0_9
| spl0_1
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f74,f54,f18,f93]) ).
thf(f74,plain,
( ( b = $true )
| ( $true = sK2 )
| ~ spl0_7 ),
inference(binary_proxy_clausification,[],[f73]) ).
thf(f73,plain,
( ( b != sK2 )
| ~ spl0_7 ),
inference(trivial_inequality_removal,[],[f70]) ).
thf(f70,plain,
( ( b != sK2 )
| ( $true = $false )
| ~ spl0_7 ),
inference(constrained_superposition,[],[f13,f56]) ).
thf(f86,plain,
( ~ spl0_5
| ~ spl0_7 ),
inference(avatar_contradiction_clause,[],[f85]) ).
thf(f85,plain,
( $false
| ~ spl0_5
| ~ spl0_7 ),
inference(trivial_inequality_removal,[],[f62]) ).
thf(f62,plain,
( ( $true = $false )
| ~ spl0_5
| ~ spl0_7 ),
inference(superposition,[],[f56,f47]) ).
thf(f47,plain,
( ( $true
= ( f @ sK2 ) )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f45]) ).
thf(f61,plain,
( spl0_7
| spl0_8 ),
inference(avatar_split_clause,[],[f43,f58,f54]) ).
thf(f43,plain,
( ( ( f @ sK2 )
= $false )
| ( $false
= ( g @ sK2 ) ) ),
inference(binary_proxy_clausification,[],[f41]) ).
thf(f41,plain,
( ( f @ sK2 )
!= ( g @ sK2 ) ),
inference(negative_extensionality,[],[f40]) ).
thf(f40,plain,
f != g,
inference(trivial_inequality_removal,[],[f39]) ).
thf(f39,plain,
( ( $true != $true )
| ( f != g ) ),
inference(constrained_superposition,[],[f10,f12]) ).
thf(f12,plain,
( ( p @ f )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
( ( p @ g )
!= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f34,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f16,f31,f27]) ).
thf(f16,plain,
( ( a = $false )
| ( b = $false ) ),
inference(binary_proxy_clausification,[],[f11]) ).
thf(f11,plain,
a != b,
inference(cnf_transformation,[],[f7]) ).
thf(f25,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f15,f22,f18]) ).
thf(f15,plain,
( ( b = $true )
| ( a = $true ) ),
inference(binary_proxy_clausification,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO503^1 : TPTP v8.2.0. Released v4.1.0.
% 0.12/0.14 % 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.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 : Mon May 20 09:10:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 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.37 % (5696)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.37 % (5689)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 % (5690)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 % (5691)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.14/0.38 % (5692)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.38 % (5694)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 % (5693)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 % (5695)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 % (5692)Instruction limit reached!
% 0.14/0.38 % (5692)------------------------------
% 0.14/0.38 % (5692)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (5692)Termination reason: Unknown
% 0.14/0.38 % (5696)Refutation not found, incomplete strategy
% 0.14/0.38 % (5696)------------------------------
% 0.14/0.38 % (5696)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (5696)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (5696)Memory used [KB]: 5500
% 0.14/0.38 % (5696)Time elapsed: 0.003 s
% 0.14/0.38 % (5696)Instructions burned: 2 (million)
% 0.14/0.38 % (5696)------------------------------
% 0.14/0.38 % (5696)------------------------------
% 0.14/0.38 % (5693)Instruction limit reached!
% 0.14/0.38 % (5693)------------------------------
% 0.14/0.38 % (5693)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (5693)Termination reason: Unknown
% 0.14/0.38 % (5693)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (5693)Memory used [KB]: 895
% 0.14/0.38 % (5693)Time elapsed: 0.003 s
% 0.14/0.38 % (5693)Instructions burned: 2 (million)
% 0.14/0.38 % (5693)------------------------------
% 0.14/0.38 % (5693)------------------------------
% 0.14/0.38 % (5692)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (5692)Memory used [KB]: 5373
% 0.14/0.38 % (5692)Time elapsed: 0.003 s
% 0.14/0.38 % (5692)Instructions burned: 2 (million)
% 0.14/0.38 % (5692)------------------------------
% 0.14/0.38 % (5692)------------------------------
% 0.14/0.38 % (5691)Refutation not found, incomplete strategy
% 0.14/0.38 % (5691)------------------------------
% 0.14/0.38 % (5691)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (5694)Refutation not found, incomplete strategy
% 0.14/0.38 % (5694)------------------------------
% 0.14/0.38 % (5694)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (5694)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (5694)Memory used [KB]: 5500
% 0.14/0.38 % (5694)Time elapsed: 0.004 s
% 0.14/0.38 % (5694)Instructions burned: 1 (million)
% 0.14/0.38 % (5694)------------------------------
% 0.14/0.38 % (5694)------------------------------
% 0.14/0.38 % (5691)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (5691)Memory used [KB]: 5500
% 0.14/0.38 % (5691)Time elapsed: 0.004 s
% 0.14/0.38 % (5691)Instructions burned: 2 (million)
% 0.14/0.38 % (5691)------------------------------
% 0.14/0.38 % (5691)------------------------------
% 0.14/0.38 % (5690)Refutation not found, incomplete strategy
% 0.14/0.38 % (5690)------------------------------
% 0.14/0.38 % (5690)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (5690)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (5690)Memory used [KB]: 5500
% 0.14/0.38 % (5690)Time elapsed: 0.004 s
% 0.14/0.38 % (5690)Instructions burned: 2 (million)
% 0.14/0.38 % (5690)------------------------------
% 0.14/0.38 % (5690)------------------------------
% 0.14/0.38 % (5695)Refutation not found, incomplete strategy
% 0.14/0.38 % (5695)------------------------------
% 0.14/0.38 % (5695)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (5695)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (5695)Memory used [KB]: 5500
% 0.14/0.38 % (5695)Time elapsed: 0.006 s
% 0.14/0.38 % (5695)Instructions burned: 5 (million)
% 0.14/0.38 % (5695)------------------------------
% 0.14/0.38 % (5695)------------------------------
% 0.14/0.38 % (5689)First to succeed.
% 0.14/0.38 % (5689)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38 % (5689)------------------------------
% 0.14/0.38 % (5689)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (5689)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (5689)Memory used [KB]: 5628
% 0.14/0.38 % (5689)Time elapsed: 0.009 s
% 0.14/0.38 % (5689)Instructions burned: 8 (million)
% 0.14/0.38 % (5689)------------------------------
% 0.14/0.38 % (5689)------------------------------
% 0.14/0.38 % (5688)Success in time 0.009 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------