TSTP Solution File: ITP100^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ITP100^1 : 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 : 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 : Mon May 20 22:33:37 EDT 2024
% Result : Theorem 0.21s 0.43s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 174
% Syntax : Number of formulae : 184 ( 13 unt; 171 typ; 0 def)
% Number of atoms : 13 ( 12 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 105 ( 5 ~; 0 |; 0 &; 100 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 10 ( 9 usr)
% Number of type conns : 403 ( 403 >; 0 *; 0 +; 0 <<)
% Number of symbols : 155 ( 153 usr; 8 con; 0-4 aty)
% Number of variables : 16 ( 0 ^ 15 !; 0 ?; 16 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
set_list_list_a: $tType ).
thf(type_def_6,type,
list_a: $tType ).
thf(type_def_8,type,
set_list_a: $tType ).
thf(type_def_9,type,
a: $tType ).
thf(type_def_10,type,
list_list_a: $tType ).
thf(type_def_11,type,
set_a: $tType ).
thf(type_def_12,type,
nat: $tType ).
thf(type_def_13,type,
list_nat: $tType ).
thf(type_def_14,type,
list_list_list_a: $tType ).
thf(func_def_0,type,
list_list_list_a: $tType ).
thf(func_def_1,type,
set_list_list_a: $tType ).
thf(func_def_2,type,
list_list_a: $tType ).
thf(func_def_3,type,
set_list_a: $tType ).
thf(func_def_4,type,
list_nat: $tType ).
thf(func_def_5,type,
list_a: $tType ).
thf(func_def_6,type,
set_a: $tType ).
thf(func_def_7,type,
nat: $tType ).
thf(func_def_8,type,
a: $tType ).
thf(func_def_9,type,
bNF_Gr1972240547list_a: set_list_list_a > list_a > set_list_list_a ).
thf(func_def_10,type,
bNF_Greatest_Shift_a: set_list_a > a > set_list_a ).
thf(func_def_11,type,
bNF_Gr1046450207list_a: set_list_list_a > list_list_a > set_list_a ).
thf(func_def_12,type,
bNF_Greatest_Succ_a: set_list_a > list_a > set_a ).
thf(func_def_13,type,
if_list_a: $o > list_a > list_a > list_a ).
thf(func_def_14,type,
list_ord_nat: ( nat > nat > $o ) > list_nat > $o ).
thf(func_def_15,type,
list_strict_asc_nat: list_nat > $o ).
thf(func_def_16,type,
map2_a_a_a: ( a > a > a ) > list_a > list_a > list_a ).
thf(func_def_17,type,
listIn1753026346list_a: list_list_a > ( nat > list_a ) > nat > list_a ).
thf(func_def_18,type,
listIn1312259492pend_a: list_a > ( nat > a ) > nat > a ).
thf(func_def_19,type,
append_list_list_a: list_list_list_a > list_list_list_a > list_list_list_a ).
thf(func_def_20,type,
append_list_a: list_list_a > list_list_a > list_list_a ).
thf(func_def_21,type,
append_nat: list_nat > list_nat > list_nat ).
thf(func_def_22,type,
append_a: list_a > list_a > list_a ).
thf(func_def_23,type,
bind_list_a_list_a: list_list_a > ( list_a > list_list_a ) > list_list_a ).
thf(func_def_24,type,
bind_list_a_a: list_list_a > ( list_a > list_a ) > list_a ).
thf(func_def_25,type,
bind_a_list_a: list_a > ( a > list_list_a ) > list_list_a ).
thf(func_def_26,type,
bind_a_a: list_a > ( a > list_a ) > list_a ).
thf(func_def_27,type,
butlast_list_a: list_list_a > list_list_a ).
thf(func_def_28,type,
butlast_a: list_a > list_a ).
thf(func_def_29,type,
concat_list_a: list_list_list_a > list_list_a ).
thf(func_def_30,type,
concat_a: list_list_a > list_a ).
thf(func_def_31,type,
distinct_adj_list_a: list_list_a > $o ).
thf(func_def_32,type,
distinct_adj_a: list_a > $o ).
thf(func_def_33,type,
foldr_769741863list_a: ( list_list_a > list_list_a > list_list_a ) > list_list_list_a > list_list_a > list_list_a ).
thf(func_def_34,type,
foldr_list_a_list_a: ( list_a > list_a > list_a ) > list_list_a > list_a > list_a ).
thf(func_def_35,type,
insert_list_a: list_a > list_list_a > list_list_a ).
thf(func_def_36,type,
insert_a: a > list_a > list_a ).
thf(func_def_37,type,
last_list_a: list_list_a > list_a ).
thf(func_def_38,type,
last_a: list_a > a ).
thf(func_def_39,type,
cons_list_list_a: list_list_a > list_list_list_a > list_list_list_a ).
thf(func_def_40,type,
cons_list_a: list_a > list_list_a > list_list_a ).
thf(func_def_41,type,
cons_nat: nat > list_nat > list_nat ).
thf(func_def_42,type,
cons_a: a > list_a > list_a ).
thf(func_def_43,type,
nil_list_list_a: list_list_list_a ).
thf(func_def_44,type,
nil_list_a: list_list_a ).
thf(func_def_45,type,
nil_nat: list_nat ).
thf(func_def_46,type,
nil_a: list_a ).
thf(func_def_47,type,
hd_list_list_a: list_list_list_a > list_list_a ).
thf(func_def_48,type,
hd_list_a: list_list_a > list_a ).
thf(func_def_49,type,
hd_a: list_a > a ).
thf(func_def_50,type,
tl_list_a: list_list_a > list_list_a ).
thf(func_def_51,type,
tl_a: list_a > list_a ).
thf(func_def_52,type,
list_ex1_list_a: ( list_a > $o ) > list_list_a > $o ).
thf(func_def_53,type,
list_ex1_a: ( a > $o ) > list_a > $o ).
thf(func_def_54,type,
listre1221556159list_a: ( list_a > list_a > $o ) > list_list_a > list_list_a > $o ).
thf(func_def_55,type,
listrelp_list_a_a: ( list_a > a > $o ) > list_list_a > list_a > $o ).
thf(func_def_56,type,
listrelp_a_list_a: ( a > list_a > $o ) > list_a > list_list_a > $o ).
thf(func_def_57,type,
listrelp_a_a: ( a > a > $o ) > list_a > list_a > $o ).
thf(func_def_58,type,
map_ta982122357list_a: ( list_a > list_a ) > list_list_a > list_list_a > list_list_a ).
thf(func_def_59,type,
map_ta2002079599st_a_a: ( list_a > a ) > list_list_a > list_a > list_a ).
thf(func_def_60,type,
map_ta41997947list_a: ( a > list_a ) > list_a > list_list_a > list_list_a ).
thf(func_def_61,type,
map_tailrec_rev_a_a: ( a > a ) > list_a > list_a > list_a ).
thf(func_def_62,type,
maps_list_a_list_a: ( list_a > list_list_a ) > list_list_a > list_list_a ).
thf(func_def_63,type,
maps_list_a_a: ( list_a > list_a ) > list_list_a > list_a ).
thf(func_def_64,type,
maps_a_list_a: ( a > list_list_a ) > list_a > list_list_a ).
thf(func_def_65,type,
maps_a_a: ( a > list_a ) > list_a > list_a ).
thf(func_def_66,type,
member_list_a: list_list_a > list_a > $o ).
thf(func_def_67,type,
member_a: list_a > a > $o ).
thf(func_def_68,type,
lexordp_eq_list_a: ( list_a > list_a > $o ) > list_list_a > list_list_a > $o ).
thf(func_def_69,type,
lexordp_eq_a: ( a > a > $o ) > list_a > list_a > $o ).
thf(func_def_70,type,
ord_lexordp_nat: list_nat > list_nat > $o ).
thf(func_def_71,type,
ord_lexordp_eq_nat: list_nat > list_nat > $o ).
thf(func_def_72,type,
product_lists_list_a: list_list_list_a > list_list_list_a ).
thf(func_def_73,type,
product_lists_a: list_list_a > list_list_a ).
thf(func_def_74,type,
remdups_adj_a: list_a > list_a ).
thf(func_def_75,type,
rotate1_list_a: list_list_a > list_list_a ).
thf(func_def_76,type,
rotate1_a: list_a > list_a ).
thf(func_def_77,type,
shuffles_a: list_a > list_a > set_list_a ).
thf(func_def_78,type,
splice_list_a: list_list_a > list_list_a > list_list_a ).
thf(func_def_79,type,
splice_a: list_a > list_a > list_a ).
thf(func_def_80,type,
subseqs_list_a: list_list_a > list_list_list_a ).
thf(func_def_81,type,
subseqs_a: list_a > list_list_a ).
thf(func_def_82,type,
successively_list_a: ( list_a > list_a > $o ) > list_list_a > $o ).
thf(func_def_83,type,
successively_a: ( a > a > $o ) > list_a > $o ).
thf(func_def_84,type,
size_size_list_a: list_a > nat ).
thf(func_def_85,type,
ord_less_nat: nat > nat > $o ).
thf(func_def_86,type,
collect_list_a: ( list_a > $o ) > set_list_a ).
thf(func_def_87,type,
collect_a: ( a > $o ) > set_a ).
thf(func_def_88,type,
member_list_list_a: list_list_a > set_list_list_a > $o ).
thf(func_def_89,type,
member_list_a2: list_a > set_list_a > $o ).
thf(func_def_90,type,
member_a2: a > set_a > $o ).
thf(func_def_91,type,
f: nat > a ).
thf(func_def_92,type,
x: a ).
thf(func_def_93,type,
xs: list_a ).
thf(func_def_110,type,
sK0: ( list_a > $o ) > a ).
thf(func_def_111,type,
sK1: ( list_a > $o ) > a ).
thf(func_def_112,type,
sK2: ( list_a > $o ) > a ).
thf(func_def_113,type,
sK3: ( list_a > $o ) > list_a ).
thf(func_def_114,type,
sK4: ( list_a > $o ) > a ).
thf(func_def_115,type,
sK5: ( list_a > $o ) > a ).
thf(func_def_116,type,
sK6: ( list_a > $o ) > list_a ).
thf(func_def_117,type,
sK7: ( list_a > list_a > $o ) > list_a ).
thf(func_def_118,type,
sK8: ( list_a > list_a > $o ) > a ).
thf(func_def_119,type,
sK9: ( list_a > list_a > $o ) > a ).
thf(func_def_120,type,
sK10: ( list_a > list_a > $o ) > list_a ).
thf(func_def_121,type,
sK11: ( list_a > list_a > $o ) > a ).
thf(func_def_122,type,
sK12: ( list_a > list_a > $o ) > list_a ).
thf(func_def_123,type,
sK13: ( list_a > list_a > $o ) > a ).
thf(func_def_124,type,
sK14: ( list_a > list_a > $o ) > list_a ).
thf(func_def_125,type,
sK15: list_a > list_a > list_a > list_a > list_a ).
thf(func_def_126,type,
sK16: ( list_a > $o ) > a ).
thf(func_def_127,type,
sK17: ( list_a > $o ) > list_a ).
thf(func_def_128,type,
sK18: ( list_a > $o ) > a ).
thf(func_def_129,type,
sK19: list_a > a ).
thf(func_def_130,type,
sK20: list_a > list_a ).
thf(func_def_131,type,
sK21: list_a > a > list_a > list_a > list_a ).
thf(func_def_132,type,
sK22: ( list_a > $o ) > a ).
thf(func_def_133,type,
sK23: ( list_a > $o ) > list_a ).
thf(func_def_134,type,
sK24: ( list_a > $o ) > a ).
thf(func_def_135,type,
sK25: ( list_a > $o ) > list_a ).
thf(func_def_136,type,
sK26: ( list_a > $o ) > a ).
thf(func_def_137,type,
sK27: ( list_a > $o ) > a ).
thf(func_def_138,type,
sK28: ( ( a > a ) > list_a > list_a > $o ) > a ).
thf(func_def_139,type,
sK29: ( ( a > a ) > list_a > list_a > $o ) > a > a ).
thf(func_def_140,type,
sK30: ( ( a > a ) > list_a > list_a > $o ) > list_a ).
thf(func_def_141,type,
sK31: ( ( a > a ) > list_a > list_a > $o ) > list_a ).
thf(func_def_142,type,
sK32: ( ( a > a ) > list_a > list_a > $o ) > a > a ).
thf(func_def_143,type,
sK33: ( ( a > a ) > list_a > list_a > $o ) > list_a ).
thf(func_def_144,type,
sK34: list_a > a > list_a > list_a > list_a ).
thf(func_def_145,type,
sK35: list_a > a ).
thf(func_def_146,type,
sK36: list_a > list_a ).
thf(func_def_147,type,
sK37: ( list_a > list_a > $o ) > list_a ).
thf(func_def_148,type,
sK38: ( list_a > list_a > $o ) > list_a ).
thf(func_def_149,type,
sK39: ( list_a > list_a > $o ) > a ).
thf(func_def_150,type,
sK40: ( list_a > list_a > $o ) > a ).
thf(func_def_151,type,
sK41: ( list_a > list_a > $o ) > list_a ).
thf(func_def_152,type,
sK42: ( list_a > list_a > $o ) > list_a ).
thf(func_def_153,type,
sK43: ( list_a > $o ) > list_a ).
thf(func_def_154,type,
sK44: ( list_a > $o ) > a ).
thf(func_def_155,type,
sK45: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_156,type,
sK46: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_157,type,
sK47: ( ( a > a > $o ) > list_a > $o ) > a ).
thf(func_def_158,type,
sK48: ( ( a > a > $o ) > list_a > $o ) > list_a ).
thf(func_def_159,type,
sK49: ( ( a > a > $o ) > list_a > $o ) > a ).
thf(func_def_160,type,
sK50: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_161,type,
sK51: ( ( a > a > $o ) > list_a > $o ) > a ).
thf(func_def_162,type,
sK52: ( list_a > list_a > $o ) > a ).
thf(func_def_163,type,
sK53: ( list_a > list_a > $o ) > list_a ).
thf(func_def_164,type,
sK54: ( list_a > list_a > $o ) > list_a ).
thf(func_def_165,type,
sK55: ( list_a > list_a > $o ) > list_a ).
thf(func_def_166,type,
sK56: list_a > a ).
thf(func_def_167,type,
sK57: list_a > list_a ).
thf(func_def_168,type,
sK58: list_a > a ).
thf(func_def_169,type,
sK59: list_a > a ).
thf(func_def_170,type,
sK60: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_171,type,
sK61: ( ( a > a > $o ) > list_a > $o ) > list_a ).
thf(func_def_172,type,
sK62: ( ( a > a > $o ) > list_a > $o ) > a ).
thf(func_def_173,type,
sK63: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_174,type,
sK64: list_a > a ).
thf(func_def_175,type,
sK65: list_a > list_a ).
thf(func_def_177,type,
ph67:
!>[X0: $tType] : X0 ).
thf(func_def_178,type,
sK68: nat ).
thf(f1014,plain,
$false,
inference(trivial_inequality_removal,[],[f1013]) ).
thf(f1013,plain,
( ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f )
!= ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f ) ),
inference(forward_demodulation,[],[f1012,f924]) ).
thf(f924,plain,
! [X0: list_a,X1: a] :
( ( append_a @ ( cons_a @ X1 @ nil_a ) @ X0 )
= ( cons_a @ X1 @ X0 ) ),
inference(cnf_transformation,[],[f762]) ).
thf(f762,plain,
! [X0: list_a,X1: a] :
( ( append_a @ ( cons_a @ X1 @ nil_a ) @ X0 )
= ( cons_a @ X1 @ X0 ) ),
inference(rectify,[],[f187]) ).
thf(f187,axiom,
! [X12: list_a,X24: a] :
( ( cons_a @ X24 @ X12 )
= ( append_a @ ( cons_a @ X24 @ nil_a ) @ X12 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_186_append__eq__Cons) ).
thf(f1012,plain,
( ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f )
!= ( listIn1312259492pend_a @ ( append_a @ ( cons_a @ x @ nil_a ) @ xs ) @ f ) ),
inference(superposition,[],[f964,f953]) ).
thf(f953,plain,
! [X2: nat > a,X0: list_a,X1: list_a] :
( ( listIn1312259492pend_a @ ( append_a @ X0 @ X1 ) @ X2 )
= ( listIn1312259492pend_a @ X0 @ ( listIn1312259492pend_a @ X1 @ X2 ) ) ),
inference(cnf_transformation,[],[f748]) ).
thf(f748,plain,
! [X0: list_a,X1: list_a,X2: nat > a] :
( ( listIn1312259492pend_a @ ( append_a @ X0 @ X1 ) @ X2 )
= ( listIn1312259492pend_a @ X0 @ ( listIn1312259492pend_a @ X1 @ X2 ) ) ),
inference(rectify,[],[f152]) ).
thf(f152,axiom,
! [X12: list_a,X15: list_a,X0: nat > a] :
( ( listIn1312259492pend_a @ X12 @ ( listIn1312259492pend_a @ X15 @ X0 ) )
= ( listIn1312259492pend_a @ ( append_a @ X12 @ X15 ) @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_151_i__append__assoc) ).
thf(f964,plain,
( ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f )
!= ( listIn1312259492pend_a @ ( cons_a @ x @ nil_a ) @ ( listIn1312259492pend_a @ xs @ f ) ) ),
inference(cnf_transformation,[],[f747]) ).
thf(f747,plain,
( ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f )
!= ( listIn1312259492pend_a @ ( cons_a @ x @ nil_a ) @ ( listIn1312259492pend_a @ xs @ f ) ) ),
inference(flattening,[],[f357]) ).
thf(f357,negated_conjecture,
( ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f )
!= ( listIn1312259492pend_a @ ( cons_a @ x @ nil_a ) @ ( listIn1312259492pend_a @ xs @ f ) ) ),
inference(negated_conjecture,[],[f356]) ).
thf(f356,conjecture,
( ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f )
= ( listIn1312259492pend_a @ ( cons_a @ x @ nil_a ) @ ( listIn1312259492pend_a @ xs @ f ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ITP100^1 : 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.13/0.35 % Computer : n012.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 : Sat May 18 18:07:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 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/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 % (32618)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.13/0.39 % (32611)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.13/0.39 % (32614)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.39 % (32613)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.13/0.39 % (32615)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.13/0.39 % (32616)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.13/0.39 % (32614)Instruction limit reached!
% 0.13/0.39 % (32614)------------------------------
% 0.13/0.39 % (32614)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.39 % (32614)Termination reason: Unknown
% 0.13/0.39 % (32615)Instruction limit reached!
% 0.13/0.39 % (32615)------------------------------
% 0.13/0.39 % (32615)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.39 % (32615)Termination reason: Unknown
% 0.13/0.39 % (32615)Termination phase: shuffling
% 0.13/0.39
% 0.13/0.39 % (32615)Memory used [KB]: 1535
% 0.13/0.39 % (32615)Time elapsed: 0.004 s
% 0.13/0.39 % (32615)Instructions burned: 2 (million)
% 0.13/0.39 % (32615)------------------------------
% 0.13/0.39 % (32615)------------------------------
% 0.13/0.39 % (32614)Termination phase: shuffling
% 0.13/0.39
% 0.13/0.39 % (32614)Memory used [KB]: 1535
% 0.13/0.39 % (32614)Time elapsed: 0.004 s
% 0.13/0.39 % (32614)Instructions burned: 2 (million)
% 0.13/0.39 % (32614)------------------------------
% 0.13/0.39 % (32614)------------------------------
% 0.13/0.39 % (32618)Instruction limit reached!
% 0.13/0.39 % (32618)------------------------------
% 0.13/0.39 % (32618)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.39 % (32618)Termination reason: Unknown
% 0.13/0.39 % (32618)Termination phase: shuffling
% 0.13/0.39
% 0.13/0.39 % (32618)Memory used [KB]: 1535
% 0.13/0.39 % (32618)Time elapsed: 0.005 s
% 0.13/0.39 % (32618)Instructions burned: 4 (million)
% 0.13/0.39 % (32618)------------------------------
% 0.13/0.39 % (32618)------------------------------
% 0.13/0.39 % (32617)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.39 % (32612)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.40 % (32612)Instruction limit reached!
% 0.21/0.40 % (32612)------------------------------
% 0.21/0.40 % (32612)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (32612)Termination reason: Unknown
% 0.21/0.40 % (32612)Termination phase: shuffling
% 0.21/0.40
% 0.21/0.40 % (32612)Memory used [KB]: 1535
% 0.21/0.40 % (32612)Time elapsed: 0.005 s
% 0.21/0.40 % (32612)Instructions burned: 5 (million)
% 0.21/0.40 % (32612)------------------------------
% 0.21/0.40 % (32612)------------------------------
% 0.21/0.40 % (32617)Instruction limit reached!
% 0.21/0.40 % (32617)------------------------------
% 0.21/0.40 % (32617)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (32617)Termination reason: Unknown
% 0.21/0.40 % (32617)Termination phase: shuffling
% 0.21/0.40
% 0.21/0.40 % (32617)Memory used [KB]: 1791
% 0.21/0.40 % (32617)Time elapsed: 0.014 s
% 0.21/0.40 % (32617)Instructions burned: 18 (million)
% 0.21/0.40 % (32617)------------------------------
% 0.21/0.40 % (32617)------------------------------
% 0.21/0.40 % (32613)Instruction limit reached!
% 0.21/0.40 % (32613)------------------------------
% 0.21/0.40 % (32613)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (32619)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.40 % (32613)Termination reason: Unknown
% 0.21/0.40 % (32613)Termination phase: shuffling
% 0.21/0.40
% 0.21/0.40 % (32613)Memory used [KB]: 2046
% 0.21/0.40 % (32613)Time elapsed: 0.019 s
% 0.21/0.40 % (32613)Instructions burned: 27 (million)
% 0.21/0.40 % (32613)------------------------------
% 0.21/0.40 % (32613)------------------------------
% 0.21/0.40 % (32621)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.40 % (32620)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.41 % (32621)Instruction limit reached!
% 0.21/0.41 % (32621)------------------------------
% 0.21/0.41 % (32621)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41 % (32621)Termination reason: Unknown
% 0.21/0.41 % (32621)Termination phase: shuffling
% 0.21/0.41
% 0.21/0.41 % (32621)Memory used [KB]: 1535
% 0.21/0.41 % (32621)Time elapsed: 0.004 s
% 0.21/0.41 % (32621)Instructions burned: 3 (million)
% 0.21/0.41 % (32621)------------------------------
% 0.21/0.41 % (32621)------------------------------
% 0.21/0.41 % (32622)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.41 % (32620)Instruction limit reached!
% 0.21/0.41 % (32620)------------------------------
% 0.21/0.41 % (32620)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41 % (32620)Termination reason: Unknown
% 0.21/0.41 % (32620)Termination phase: shuffling
% 0.21/0.41
% 0.21/0.41 % (32620)Memory used [KB]: 1791
% 0.21/0.41 % (32620)Time elapsed: 0.012 s
% 0.21/0.41 % (32620)Instructions burned: 15 (million)
% 0.21/0.41 % (32620)------------------------------
% 0.21/0.41 % (32620)------------------------------
% 0.21/0.42 % (32623)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.42 % (32624)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.21/0.42 % (32623)Instruction limit reached!
% 0.21/0.42 % (32623)------------------------------
% 0.21/0.42 % (32623)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (32623)Termination reason: Unknown
% 0.21/0.42 % (32623)Termination phase: shuffling
% 0.21/0.42
% 0.21/0.42 % (32623)Memory used [KB]: 1663
% 0.21/0.42 % (32623)Time elapsed: 0.007 s
% 0.21/0.42 % (32623)Instructions burned: 7 (million)
% 0.21/0.42 % (32623)------------------------------
% 0.21/0.42 % (32623)------------------------------
% 0.21/0.42 % (32625)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.42 % (32625)Instruction limit reached!
% 0.21/0.42 % (32625)------------------------------
% 0.21/0.42 % (32625)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (32625)Termination reason: Unknown
% 0.21/0.42 % (32625)Termination phase: shuffling
% 0.21/0.42
% 0.21/0.42 % (32619)Instruction limit reached!
% 0.21/0.42 % (32619)------------------------------
% 0.21/0.42 % (32619)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (32619)Termination reason: Unknown
% 0.21/0.42 % (32619)Termination phase: shuffling
% 0.21/0.42
% 0.21/0.42 % (32619)Memory used [KB]: 2174
% 0.21/0.42 % (32619)Time elapsed: 0.021 s
% 0.21/0.42 % (32619)Instructions burned: 37 (million)
% 0.21/0.42 % (32619)------------------------------
% 0.21/0.42 % (32619)------------------------------
% 0.21/0.42 % (32625)Memory used [KB]: 1535
% 0.21/0.42 % (32625)Time elapsed: 0.004 s
% 0.21/0.42 % (32625)Instructions burned: 3 (million)
% 0.21/0.42 % (32625)------------------------------
% 0.21/0.42 % (32625)------------------------------
% 0.21/0.43 % (32616)First to succeed.
% 0.21/0.43 % (32624)Instruction limit reached!
% 0.21/0.43 % (32624)------------------------------
% 0.21/0.43 % (32624)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.43 % (32624)Termination reason: Unknown
% 0.21/0.43 % (32624)Termination phase: shuffling
% 0.21/0.43
% 0.21/0.43 % (32624)Memory used [KB]: 1791
% 0.21/0.43 % (32624)Time elapsed: 0.012 s
% 0.21/0.43 % (32624)Instructions burned: 16 (million)
% 0.21/0.43 % (32624)------------------------------
% 0.21/0.43 % (32624)------------------------------
% 0.21/0.43 % (32626)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.43 % (32616)Refutation found. Thanks to Tanya!
% 0.21/0.43 % SZS status Theorem for theBenchmark
% 0.21/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.43 % (32616)------------------------------
% 0.21/0.43 % (32616)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.43 % (32616)Termination reason: Refutation
% 0.21/0.43
% 0.21/0.43 % (32616)Memory used [KB]: 6908
% 0.21/0.43 % (32616)Time elapsed: 0.043 s
% 0.21/0.43 % (32616)Instructions burned: 68 (million)
% 0.21/0.43 % (32616)------------------------------
% 0.21/0.43 % (32616)------------------------------
% 0.21/0.43 % (32610)Success in time 0.069 s
% 0.21/0.43 % Vampire---4.8 exiting
%------------------------------------------------------------------------------