TSTP Solution File: ITP196^2 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : ITP196^2 : TPTP v8.2.0. Released v7.5.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 : n017.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 : Mon May 20 22:34:28 EDT 2024

% Result   : Theorem 0.21s 0.43s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : ITP196^2 : TPTP v8.2.0. Released v7.5.0.
% 0.07/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.36  % Computer : n017.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Sat May 18 15:24:08 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  This is a TH1_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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.41  % (28068)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.14/0.41  % (28072)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 (2999ds/2Mi)
% 0.14/0.41  % (28070)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 (2999ds/27Mi)
% 0.14/0.41  % (28073)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 (2999ds/275Mi)
% 0.14/0.41  % (28072)Instruction limit reached!
% 0.14/0.41  % (28072)------------------------------
% 0.14/0.41  % (28072)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.41  % (28075)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.41  % (28072)Termination reason: Unknown
% 0.14/0.41  % (28072)Termination phase: shuffling
% 0.14/0.41  
% 0.14/0.41  % (28072)Memory used [KB]: 1407
% 0.14/0.41  % (28072)Time elapsed: 0.003 s
% 0.14/0.41  % (28072)Instructions burned: 2 (million)
% 0.14/0.41  % (28072)------------------------------
% 0.14/0.41  % (28072)------------------------------
% 0.14/0.41  % (28069)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 (2999ds/4Mi)
% 0.21/0.41  % (28075)Instruction limit reached!
% 0.21/0.41  % (28075)------------------------------
% 0.21/0.41  % (28075)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41  % (28075)Termination reason: Unknown
% 0.21/0.41  % (28075)Termination phase: shuffling
% 0.21/0.41  % (28071)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.41  
% 0.21/0.41  % (28075)Memory used [KB]: 1407
% 0.21/0.41  % (28075)Time elapsed: 0.003 s
% 0.21/0.41  % (28075)Instructions burned: 3 (million)
% 0.21/0.41  % (28075)------------------------------
% 0.21/0.41  % (28075)------------------------------
% 0.21/0.41  % (28074)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.41  % (28069)Instruction limit reached!
% 0.21/0.41  % (28069)------------------------------
% 0.21/0.41  % (28069)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41  % (28069)Termination reason: Unknown
% 0.21/0.41  % (28069)Termination phase: shuffling
% 0.21/0.41  
% 0.21/0.41  % (28069)Memory used [KB]: 1407
% 0.21/0.41  % (28069)Time elapsed: 0.004 s
% 0.21/0.41  % (28069)Instructions burned: 4 (million)
% 0.21/0.41  % (28069)------------------------------
% 0.21/0.41  % (28069)------------------------------
% 0.21/0.41  % (28071)Instruction limit reached!
% 0.21/0.41  % (28071)------------------------------
% 0.21/0.41  % (28071)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41  % (28071)Termination reason: Unknown
% 0.21/0.41  % (28071)Termination phase: shuffling
% 0.21/0.41  
% 0.21/0.41  % (28071)Memory used [KB]: 1407
% 0.21/0.41  % (28071)Time elapsed: 0.004 s
% 0.21/0.41  % (28071)Instructions burned: 3 (million)
% 0.21/0.41  % (28071)------------------------------
% 0.21/0.41  % (28071)------------------------------
% 0.21/0.42  % (28074)Instruction limit reached!
% 0.21/0.42  % (28074)------------------------------
% 0.21/0.42  % (28074)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42  % (28074)Termination reason: Unknown
% 0.21/0.42  % (28074)Termination phase: shuffling
% 0.21/0.42  
% 0.21/0.42  % (28074)Memory used [KB]: 1791
% 0.21/0.42  % (28074)Time elapsed: 0.012 s
% 0.21/0.42  % (28074)Instructions burned: 18 (million)
% 0.21/0.42  % (28074)------------------------------
% 0.21/0.42  % (28074)------------------------------
% 0.21/0.42  % (28070)Instruction limit reached!
% 0.21/0.42  % (28070)------------------------------
% 0.21/0.42  % (28070)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42  % (28070)Termination reason: Unknown
% 0.21/0.42  % (28070)Termination phase: Property scanning
% 0.21/0.42  
% 0.21/0.42  % (28070)Memory used [KB]: 1918
% 0.21/0.42  % (28070)Time elapsed: 0.017 s
% 0.21/0.42  % (28070)Instructions burned: 28 (million)
% 0.21/0.42  % (28070)------------------------------
% 0.21/0.42  % (28070)------------------------------
% 0.21/0.42  % (28077)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.21/0.42  % (28076)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.21/0.42  % (28078)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.42  % (28080)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.21/0.43  % (28078)Instruction limit reached!
% 0.21/0.43  % (28078)------------------------------
% 0.21/0.43  % (28078)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.43  % (28078)Termination reason: Unknown
% 0.21/0.43  % (28078)Termination phase: shuffling
% 0.21/0.43  
% 0.21/0.43  % (28078)Memory used [KB]: 1407
% 0.21/0.43  % (28078)Time elapsed: 0.004 s
% 0.21/0.43  % (28078)Instructions burned: 4 (million)
% 0.21/0.43  % (28078)------------------------------
% 0.21/0.43  % (28078)------------------------------
% 0.21/0.43  % (28073)First to succeed.
% 0.21/0.43  % (28073)Refutation found. Thanks to Tanya!
% 0.21/0.43  % SZS status Theorem for theBenchmark
% 0.21/0.43  % SZS output start Proof for theBenchmark
% 0.21/0.43  thf(type_def_5, type, list: ($tType) > $tType).
% 0.21/0.43  thf(type_def_6, type, set: ($tType) > $tType).
% 0.21/0.43  thf(type_def_8, type, nat: $tType).
% 0.21/0.43  thf(type_def_9, type, product_prod: ($tType * $tType) > $tType).
% 0.21/0.43  thf(type_def_10, type, option: ($tType) > $tType).
% 0.21/0.43  thf(type_def_11, type, real: $tType).
% 0.21/0.43  thf(type_def_12, type, poly: ($tType) > $tType).
% 0.21/0.43  thf(func_def_0, type, product_prod: ($tType * $tType) > $tType).
% 0.21/0.43  thf(func_def_1, type, poly: ($tType) > $tType).
% 0.21/0.43  thf(func_def_2, type, option: ($tType) > $tType).
% 0.21/0.43  thf(func_def_3, type, real: $tType).
% 0.21/0.43  thf(func_def_4, type, list: ($tType) > $tType).
% 0.21/0.43  thf(func_def_5, type, set: ($tType) > $tType).
% 0.21/0.43  thf(func_def_6, type, nat: $tType).
% 0.21/0.43  thf(func_def_7, type, ab_group_add: !>[X0: $tType]:($o)).
% 0.21/0.43  thf(func_def_8, type, linordered_idom: !>[X0: $tType]:($o)).
% 0.21/0.43  thf(func_def_9, type, comm_semiring_0: !>[X0: $tType]:($o)).
% 0.21/0.43  thf(func_def_10, type, type: !>[X0: $tType]:($o)).
% 0.21/0.43  thf(func_def_11, type, size: !>[X0: $tType]:($o)).
% 0.21/0.43  thf(func_def_12, type, ord: !>[X0: $tType]:($o)).
% 0.21/0.43  thf(func_def_13, type, group_add: !>[X0: $tType]:($o)).
% 0.21/0.43  thf(func_def_14, type, linorder: !>[X0: $tType]:($o)).
% 0.21/0.43  thf(func_def_15, type, comm_semiring_1: !>[X0: $tType]:($o)).
% 0.21/0.43  thf(func_def_16, type, comm_monoid_add: !>[X0: $tType]:($o)).
% 0.21/0.43  thf(func_def_17, type, semiri1193490041visors: !>[X0: $tType]:($o)).
% 0.21/0.43  thf(func_def_18, type, bNF_Greatest_Shift: !>[X0: $tType]:(set @ list @ X0 > X0 > set @ list @ X0)).
% 0.21/0.43  thf(func_def_19, type, bNF_Greatest_Succ: !>[X0: $tType]:(set @ list @ X0 > list @ X0 > set @ X0)).
% 0.21/0.43  thf(func_def_20, type, bNF_Greatest_shift: !>[X0: $tType, X1: $tType]:((list @ X0 > X1) > X0 > list @ X0 > X1)).
% 0.21/0.43  thf(func_def_21, type, times_times: !>[X0: $tType]:(X0 > X0 > X0)).
% 0.21/0.43  thf(func_def_22, type, append: !>[X0: $tType]:(list @ X0 > list @ X0 > list @ X0)).
% 0.21/0.43  thf(func_def_23, type, arg_min_list: !>[X0: $tType, X1: $tType]:((X0 > X1) > list @ X0 > X0)).
% 0.21/0.43  thf(func_def_24, type, bind: !>[X0: $tType, X1: $tType]:(list @ X0 > (X0 > list @ X1) > list @ X1)).
% 0.21/0.43  thf(func_def_25, type, butlast: !>[X0: $tType]:(list @ X0 > list @ X0)).
% 0.21/0.43  thf(func_def_26, type, concat: !>[X0: $tType]:(list @ list @ X0 > list @ X0)).
% 0.21/0.43  thf(func_def_27, type, enumerate: !>[X0: $tType]:(nat > list @ X0 > list @ product_prod @ nat @ X0)).
% 0.21/0.43  thf(func_def_28, type, foldr: !>[X0: $tType, X1: $tType]:((X0 > X1 > X1) > list @ X0 > X1 > X1)).
% 0.21/0.43  thf(func_def_29, type, gen_length: !>[X0: $tType]:(nat > list @ X0 > nat)).
% 0.21/0.43  thf(func_def_30, type, insert: !>[X0: $tType]:(X0 > list @ X0 > list @ X0)).
% 0.21/0.43  thf(func_def_31, type, last: !>[X0: $tType]:(list @ X0 > X0)).
% 0.21/0.43  thf(func_def_32, type, lenlex: !>[X0: $tType]:(set @ product_prod @ X0 @ X0 > set @ product_prod @ list @ X0 @ list @ X0)).
% 0.21/0.43  thf(func_def_33, type, lex: !>[X0: $tType]:(set @ product_prod @ X0 @ X0 > set @ product_prod @ list @ X0 @ list @ X0)).
% 0.21/0.43  thf(func_def_34, type, lexord: !>[X0: $tType]:(set @ product_prod @ X0 @ X0 > set @ product_prod @ list @ X0 @ list @ X0)).
% 0.21/0.43  thf(func_def_35, type, cons: !>[X0: $tType]:(X0 > list @ X0 > list @ X0)).
% 0.21/0.43  thf(func_def_36, type, nil: !>[X0: $tType]:(list @ X0)).
% 0.21/0.43  thf(func_def_37, type, map: !>[X0: $tType, X1: $tType]:((X0 > X1) > list @ X0 > list @ X1)).
% 0.21/0.43  thf(func_def_38, type, rec_list: !>[X0: $tType, X1: $tType]:(X0 > (X1 > list @ X1 > X0 > X0) > list @ X1 > X0)).
% 0.21/0.43  thf(func_def_39, type, list_ex: !>[X0: $tType]:((X0 > $o) > list @ X0 > $o)).
% 0.21/0.43  thf(func_def_40, type, list_ex1: !>[X0: $tType]:((X0 > $o) > list @ X0 > $o)).
% 0.21/0.43  thf(func_def_41, type, listrel: !>[X0: $tType, X1: $tType]:(set @ product_prod @ X0 @ X1 > set @ product_prod @ list @ X0 @ list @ X1)).
% 0.21/0.43  thf(func_def_42, type, listrel1: !>[X0: $tType]:(set @ product_prod @ X0 @ X0 > set @ product_prod @ list @ X0 @ list @ X0)).
% 0.21/0.43  thf(func_def_43, type, listrelp: !>[X0: $tType, X1: $tType]:((X0 > X1 > $o) > list @ X0 > list @ X1 > $o)).
% 0.21/0.43  thf(func_def_44, type, map_filter: !>[X0: $tType, X1: $tType]:((X0 > option @ X1) > list @ X0 > list @ X1)).
% 0.21/0.43  thf(func_def_45, type, map_tailrec_rev: !>[X0: $tType, X1: $tType]:((X0 > X1) > list @ X0 > list @ X1 > list @ X1)).
% 0.21/0.43  thf(func_def_46, type, map_tailrec_rev_rel: !>[X0: $tType, X1: $tType]:(product_prod @ (X0 > X1) @ product_prod @ list @ X0 @ list @ X1 > product_prod @ (X0 > X1) @ product_prod @ list @ X0 @ list @ X1 > $o)).
% 0.21/0.43  thf(func_def_47, type, maps: !>[X0: $tType, X1: $tType]:((X0 > list @ X1) > list @ X0 > list @ X1)).
% 0.21/0.43  thf(func_def_48, type, member: !>[X0: $tType]:(list @ X0 > X0 > $o)).
% 0.21/0.43  thf(func_def_49, type, null: !>[X0: $tType]:(list @ X0 > $o)).
% 0.21/0.43  thf(func_def_50, type, lexordp_eq: !>[X0: $tType]:((X0 > X0 > $o) > list @ X0 > list @ X0 > $o)).
% 0.21/0.43  thf(func_def_51, type, ord_lexordp_eq: !>[X0: $tType]:(list @ X0 > list @ X0 > $o)).
% 0.21/0.43  thf(func_def_52, type, product: !>[X0: $tType, X1: $tType]:(list @ X0 > list @ X1 > list @ product_prod @ X0 @ X1)).
% 0.21/0.43  thf(func_def_53, type, product_lists: !>[X0: $tType]:(list @ list @ X0 > list @ list @ X0)).
% 0.21/0.43  thf(func_def_54, type, rotate: !>[X0: $tType]:(nat > list @ X0 > list @ X0)).
% 0.21/0.43  thf(func_def_55, type, rotate1: !>[X0: $tType]:(list @ X0 > list @ X0)).
% 0.21/0.43  thf(func_def_56, type, splice: !>[X0: $tType]:(list @ X0 > list @ X0 > list @ X0)).
% 0.21/0.43  thf(func_def_57, type, subseqs: !>[X0: $tType]:(list @ X0 > list @ list @ X0)).
% 0.21/0.43  thf(func_def_58, type, zip: !>[X0: $tType, X1: $tType]:(list @ X0 > list @ X1 > list @ product_prod @ X0 @ X1)).
% 0.21/0.43  thf(func_def_59, type, linorder_part: !>[X0: $tType, X1: $tType]:((X0 > X1) > X1 > list @ X0 > product_prod @ list @ X0 @ product_prod @ list @ X0 @ list @ X0)).
% 0.21/0.43  thf(func_def_60, type, suc: nat > nat).
% 0.21/0.43  thf(func_def_61, type, size_size: !>[X0: $tType]:(X0 > nat)).
% 0.21/0.43  thf(func_def_62, type, ord_less: !>[X0: $tType]:(X0 > X0 > $o)).
% 0.21/0.43  thf(func_def_63, type, plus_coeffs: !>[X0: $tType]:(list @ X0 > list @ X0 > list @ X0)).
% 0.21/0.43  thf(func_def_64, type, product_Pair: !>[X0: $tType, X1: $tType]:(X0 > X1 > product_prod @ X0 @ X1)).
% 0.21/0.43  thf(func_def_65, type, irrefl: !>[X0: $tType]:(set @ product_prod @ X0 @ X0 > $o)).
% 0.21/0.43  thf(func_def_66, type, collect: !>[X0: $tType]:((X0 > $o) > set @ X0)).
% 0.21/0.43  thf(func_def_67, type, sturm_2060350619rm_seq: list @ poly @ real > $o).
% 0.21/0.43  thf(func_def_68, type, sturm_801371416rm_seq: list @ poly @ real > poly @ real > $o).
% 0.21/0.43  thf(func_def_69, type, sturm_1585582267axioms: list @ poly @ real > poly @ real > $o).
% 0.21/0.43  thf(func_def_70, type, accp: !>[X0: $tType]:((X0 > X0 > $o) > X0 > $o)).
% 0.21/0.43  thf(func_def_71, type, member2: !>[X0: $tType]:(X0 > set @ X0 > $o)).
% 0.21/0.43  thf(func_def_88, type, sK0: !>[X0: $tType, X1: $tType]:((X1 > X0) > (X1 > X0) > X1)).
% 0.21/0.43  thf(func_def_89, type, sK1: poly @ real > list @ poly @ real > poly @ real).
% 0.21/0.43  thf(func_def_90, type, sK2: poly @ real > list @ poly @ real > list @ poly @ real).
% 0.21/0.43  thf(f691,plain,(
% 0.21/0.43    $false),
% 0.21/0.43    inference(subsumption_resolution,[],[f685,f690])).
% 0.21/0.43  thf(f690,plain,(
% 0.21/0.43    ((sturm_2060350619rm_seq @ nil @ poly @ real) != $true)),
% 0.21/0.43    inference(equality_resolution,[],[f689])).
% 0.21/0.43  thf(f689,plain,(
% 0.21/0.43    ( ! [X0 : list @ poly @ real] : ((nil @ poly @ real != X0) | ((sturm_2060350619rm_seq @ X0) != $true)) )),
% 0.21/0.43    inference(cnf_transformation,[],[f678])).
% 0.21/0.43  thf(f678,plain,(
% 0.21/0.43    ! [X0 : list @ poly @ real] : ((nil @ poly @ real != X0) | ((sturm_2060350619rm_seq @ X0) != $true))),
% 0.21/0.43    inference(ennf_transformation,[],[f362])).
% 0.21/0.43  thf(f362,plain,(
% 0.21/0.43    ! [X0 : list @ poly @ real] : (((sturm_2060350619rm_seq @ X0) = $true) => (nil @ poly @ real != X0))),
% 0.21/0.43    inference(fool_elimination,[],[f361])).
% 0.21/0.43  thf(f361,plain,(
% 0.21/0.43    ! [X0 : list @ poly @ real] : ((sturm_2060350619rm_seq @ X0) => (nil @ poly @ real != X0))),
% 0.21/0.43    inference(rectify,[],[f1])).
% 0.21/0.43  thf(f1,axiom,(
% 0.21/0.43    ! [X4 : list @ poly @ real] : ((sturm_2060350619rm_seq @ X4) => (nil @ poly @ real != X4))),
% 0.21/0.43    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_quasi__sturm__seq_Ops__not__Nil)).
% 0.21/0.43  thf(f685,plain,(
% 0.21/0.43    ((sturm_2060350619rm_seq @ nil @ poly @ real) = $true)),
% 0.21/0.43    inference(cnf_transformation,[],[f675])).
% 0.21/0.43  thf(f675,plain,(
% 0.21/0.43    ((sturm_2060350619rm_seq @ nil @ poly @ real) = $true)),
% 0.21/0.43    inference(flattening,[],[f594])).
% 0.21/0.43  thf(f594,plain,(
% 0.21/0.43    ~~((sturm_2060350619rm_seq @ nil @ poly @ real) = $true)),
% 0.21/0.43    inference(fool_elimination,[],[f593])).
% 0.21/0.43  thf(f593,plain,(
% 0.21/0.43    ~~(sturm_2060350619rm_seq @ nil @ poly @ real)),
% 0.21/0.43    inference(rectify,[],[f287])).
% 0.21/0.43  thf(f287,negated_conjecture,(
% 0.21/0.43    ~~(sturm_2060350619rm_seq @ nil @ poly @ real)),
% 0.21/0.43    inference(negated_conjecture,[],[f286])).
% 0.21/0.43  thf(f286,conjecture,(
% 0.21/0.43    ~(sturm_2060350619rm_seq @ nil @ poly @ real)),
% 0.21/0.43    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0)).
% 0.21/0.43  % SZS output end Proof for theBenchmark
% 0.21/0.43  % (28073)------------------------------
% 0.21/0.43  % (28073)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.43  % (28073)Termination reason: Refutation
% 0.21/0.43  
% 0.21/0.43  % (28073)Memory used [KB]: 6524
% 0.21/0.43  % (28073)Time elapsed: 0.026 s
% 0.21/0.43  % (28073)Instructions burned: 44 (million)
% 0.21/0.43  % (28073)------------------------------
% 0.21/0.43  % (28073)------------------------------
% 0.21/0.43  % (28064)Success in time 0.061 s
% 0.21/0.43  % Vampire---4.8 exiting
%------------------------------------------------------------------------------