%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT154^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 07:48:58 AM UTC 2026
% Result : Theorem 2.17s 0.61s
% Output : Refutation 2.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT154^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.22 % Computer : n007.cluster.edu
% 0.10/0.22 % Model : x86_64 x86_64
% 0.10/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.22 % Memory : 8046.5625MB
% 0.10/0.22 % OS : Linux 6.8.0-71-generic
% 0.10/0.22 % CPULimit : 300
% 0.10/0.22 % WCLimit : 300
% 0.10/0.22 % DateTime : Tue Sep 29 18:00:26 UTC 2026
% 0.10/0.22 % CPUTime :
% 0.10/0.22 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.26/0.27 Running first-order model finding
% 0.26/0.28 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.17/0.61 % (3730713)Will run a generic schedule for satisfiability detection.
% 2.17/0.61 % (3730719)% WARNING: option uhcvi not known.
% 2.17/0.61 % (3730719)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2541413765:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.17/0.61 % (3730718)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2069993192_2999 on theBenchmark for (2999ds/0Mi)
% 2.17/0.61 % (3730722)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=923630157:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.17/0.61 % (3730721)dis+10_1_sil=32000:sp=arity:random_seed=128686062:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.17/0.61 % (3730723)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3525575913:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.17/0.61 % (3730724)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3938438116:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.17/0.61 % (3730720)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1045682657:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.17/0.61 % (3730719)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.17/0.61 % (3730719)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.17/0.61 % (3730722)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.17/0.61 % Exception at run slice level
% 2.17/0.61 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.17/0.61 % (3730721)Instruction limit reached!
% 2.17/0.61 % (3730721)------------------------------
% 2.17/0.61 % (3730721)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.17/0.61 % (3730721)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.17/0.61 % (3730721)CaDiCaL version: 2.1.3
% 2.17/0.61 % (3730721)Termination reason: Instruction limit
% 2.17/0.61 % (3730721)Termination phase: Saturation
% 2.17/0.61 % (3730721)Time elapsed: 0.085 s
% 2.17/0.61 % (3730721)Peak memory usage: 12 MB
% 2.17/0.61 % (3730721)Instructions burned: 103 (million)
% 2.17/0.61 % (3730732)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3212876145:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 2.17/0.61 % (3730722)Instruction limit reached!
% 2.17/0.61 % (3730722)------------------------------
% 2.17/0.61 % (3730722)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.17/0.61 % (3730722)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.17/0.61 % (3730722)CaDiCaL version: 2.1.3
% 2.17/0.61 % (3730722)Termination reason: Instruction limit
% 2.17/0.61 % (3730722)Termination phase: Saturation
% 2.17/0.61 % (3730722)Time elapsed: 0.096 s
% 2.17/0.61 % (3730722)Peak memory usage: 12 MB
% 2.17/0.61 % (3730722)Instructions burned: 116 (million)
% 2.17/0.61 % (3730723)Instruction limit reached!
% 2.17/0.61 % (3730723)------------------------------
% 2.17/0.61 % (3730723)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.17/0.61 % (3730723)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.17/0.61 % (3730723)CaDiCaL version: 2.1.3
% 2.17/0.61 % (3730723)Termination reason: Instruction limit
% 2.17/0.61 % (3730723)Termination phase: Saturation
% 2.17/0.61 % (3730723)Time elapsed: 0.110 s
% 2.17/0.61 % (3730723)Peak memory usage: 13 MB
% 2.17/0.61 % (3730723)Instructions burned: 132 (million)
% 2.17/0.61 % (3730733)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3070263704:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.17/0.61 % (3730735)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2601145900:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.17/0.61 % (3730724)Instruction limit reached!
% 2.17/0.61 % (3730724)------------------------------
% 2.17/0.61 % (3730724)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.17/0.61 % (3730724)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.17/0.61 % (3730724)CaDiCaL version: 2.1.3
% 2.17/0.61 % (3730724)Termination reason: Instruction limit
% 2.17/0.61 % (3730724)Termination phase: Saturation
% 2.17/0.61 % (3730724)Time elapsed: 0.135 s
% 2.17/0.61 % (3730724)Peak memory usage: 13 MB
% 2.17/0.61 % (3730724)Instructions burned: 160 (million)
% 2.17/0.61 % (3730736)ott-21_1_sil=16000:fs=off:random_seed=589389398:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.17/0.61 % (3730735)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.17/0.61 % (3730739)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3519550248:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.17/0.61 % Exception at run slice level
% 2.17/0.61 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.17/0.61 % (3730742)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1013324930:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.17/0.61 % (3730735)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.17/0.61 % (3730733)Instruction limit reached!
% 2.17/0.61 % (3730733)------------------------------
% 2.17/0.61 % (3730733)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.17/0.61 % (3730733)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.17/0.61 % (3730733)CaDiCaL version: 2.1.3
% 2.17/0.61 % (3730733)Termination reason: Instruction limit
% 2.17/0.61 % (3730733)Termination phase: Saturation
% 2.17/0.61 % (3730733)Time elapsed: 0.110 s
% 2.17/0.61 % (3730733)Peak memory usage: 13 MB
% 2.17/0.61 % (3730733)Instructions burned: 131 (million)
% 2.17/0.61 % (3730744)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3154187148:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.17/0.61 % (3730735) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3730713-3730735"...
% 2.17/0.61 % (3730719) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3730713-3730719"...
% 2.17/0.61 % (3730719)...printing done.
% 2.17/0.61 % (3730735)...printing done.
% 2.17/0.61 % (3730719)Refutation found. Thanks to Tanya!
% 2.17/0.61 % SZS status Theorem for theBenchmark
% 2.17/0.61 % SZS output start Proof for theBenchmark
% 2.17/0.61 thf(type_def_5, type, coinductive_llist: $tType > $tType).
% 2.17/0.61 thf(type_def_6, type, list: $tType > $tType).
% 2.17/0.61 thf(type_def_7, type, set: $tType > $tType).
% 2.17/0.61 thf(type_def_8, type, itself: $tType > $tType).
% 2.17/0.61 thf(type_def_9, type, a: $tType).
% 2.17/0.61 thf(type_def_10, type, sTfun: ($tType * $tType) > $tType).
% 2.17/0.61 thf(func_def_0, type, type: !>[X0: $tType]:((itself @ X0 > $o))).
% 2.17/0.61 thf(func_def_1, type, ord: !>[X0: $tType]:((itself @ X0 > $o))).
% 2.17/0.61 thf(func_def_2, type, lattice: !>[X0: $tType]:((itself @ X0 > $o))).
% 2.17/0.61 thf(func_def_3, type, semilattice_inf: !>[X0: $tType]:((itself @ X0 > $o))).
% 2.17/0.61 thf(func_def_4, type, bNF_Greatest_Shift: !>[X0: $tType]:((set @ list @ X0 > X0 > set @ list @ X0))).
% 2.17/0.61 thf(func_def_5, type, bNF_Greatest_Succ: !>[X0: $tType]:((set @ list @ X0 > list @ X0 > set @ X0))).
% 2.17/0.61 thf(func_def_6, type, bNF_Greatest_shift: !>[X0: $tType, X1: $tType]:(((list @ X0 > X1) > X0 > list @ X0 > X1))).
% 2.17/0.61 thf(func_def_7, type, coindu1384447384of_aux: !>[X0: $tType]:((list @ X0 > coinductive_llist @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_8, type, coinductive_LNil: !>[X0: $tType]:(coinductive_llist @ X0)).
% 2.17/0.61 thf(func_def_9, type, coinductive_lnull: !>[X0: $tType]:((coinductive_llist @ X0 > $o))).
% 2.17/0.61 thf(func_def_10, type, coinductive_lsorted: !>[X0: $tType]:(((X0 > X0 > $o) > coinductive_llist @ X0 > $o))).
% 2.17/0.61 thf(func_def_11, type, hammin1328233080lmerge: !>[X0: $tType]:(((X0 > X0 > $o) > coinductive_llist @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 2.17/0.61 thf(func_def_12, type, hammin1138290136lmerge: !>[X0: $tType]:((coinductive_llist @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 2.17/0.61 thf(func_def_13, type, inf_inf: !>[X0: $tType]:((X0 > X0 > X0))).
% 2.17/0.61 thf(func_def_14, type, append: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_15, type, bind: !>[X0: $tType, X1: $tType]:((list @ X0 > (X0 > list @ X1) > list @ X1))).
% 2.17/0.61 thf(func_def_16, type, butlast: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_17, type, insert: !>[X0: $tType]:((X0 > list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_18, type, last: !>[X0: $tType]:((list @ X0 > X0))).
% 2.17/0.61 thf(func_def_19, type, cons: !>[X0: $tType]:((X0 > list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_20, type, nil: !>[X0: $tType]:(list @ X0)).
% 2.17/0.61 thf(func_def_21, type, hd: !>[X0: $tType]:((list @ X0 > X0))).
% 2.17/0.61 thf(func_def_22, type, map: !>[X0: $tType, X1: $tType]:(((X0 > X1) > list @ X0 > list @ X1))).
% 2.17/0.61 thf(func_def_23, type, list_ex1: !>[X0: $tType]:(((X0 > $o) > list @ X0 > $o))).
% 2.17/0.61 thf(func_def_24, type, map_tailrec: !>[X0: $tType, X1: $tType]:(((X0 > X1) > list @ X0 > list @ X1))).
% 2.17/0.61 thf(func_def_25, type, map_tailrec_rev: !>[X0: $tType, X1: $tType]:(((X0 > X1) > list @ X0 > list @ X1 > list @ X1))).
% 2.17/0.61 thf(func_def_26, type, maps: !>[X0: $tType, X1: $tType]:(((X0 > list @ X1) > list @ X0 > list @ X1))).
% 2.17/0.61 thf(func_def_27, type, lexordp: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > list @ X0 > $o))).
% 2.17/0.61 thf(func_def_28, type, lexordp_eq: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > list @ X0 > $o))).
% 2.17/0.61 thf(func_def_29, type, product_lists: !>[X0: $tType]:((list @ list @ X0 > list @ list @ X0))).
% 2.17/0.61 thf(func_def_30, type, rev: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_31, type, rotate1: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_32, type, sublists: !>[X0: $tType]:((list @ X0 > list @ list @ X0))).
% 2.17/0.61 thf(func_def_33, type, max: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > X0 > X0))).
% 2.17/0.61 thf(func_def_34, type, min: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > X0 > X0))).
% 2.17/0.61 thf(func_def_35, type, type2: !>[X0: $tType]:(itself @ X0)).
% 2.17/0.61 thf(func_def_36, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 2.17/0.61 thf(func_def_37, type, set_atLeast: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0))).
% 2.17/0.61 thf(func_def_38, type, set_atLeastAtMost: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > X0 > set @ X0))).
% 2.17/0.61 thf(func_def_39, type, set_atLeastLessThan: !>[X0: $tType]:(((X0 > X0 > $o) > (X0 > X0 > $o) > X0 > X0 > set @ X0))).
% 2.17/0.61 thf(func_def_40, type, set_atMost: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0))).
% 2.17/0.61 thf(func_def_41, type, set_greaterThan: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0))).
% 2.17/0.61 thf(func_def_42, type, set_gr323396891AtMost: !>[X0: $tType]:(((X0 > X0 > $o) > (X0 > X0 > $o) > X0 > X0 > set @ X0))).
% 2.17/0.61 thf(func_def_43, type, set_gr1161524159ssThan: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > X0 > set @ X0))).
% 2.17/0.61 thf(func_def_44, type, set_lessThan: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0))).
% 2.17/0.61 thf(func_def_45, type, prefixes: !>[X0: $tType]:((list @ X0 > list @ list @ X0))).
% 2.17/0.61 thf(func_def_46, type, prefixes_rel: !>[X0: $tType]:((list @ X0 > list @ X0 > $o))).
% 2.17/0.61 thf(func_def_47, type, strict_suffix: !>[X0: $tType]:((list @ X0 > list @ X0 > $o))).
% 2.17/0.61 thf(func_def_48, type, accp: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > $o))).
% 2.17/0.61 thf(func_def_49, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 2.17/0.61 thf(func_def_50, type, less: (a > a > $o)).
% 2.17/0.61 thf(func_def_51, type, less_eq: (a > a > $o)).
% 2.17/0.61 thf(func_def_52, type, xs: coinductive_llist @ a).
% 2.17/0.61 thf(func_def_53, type, ys: coinductive_llist @ a).
% 2.17/0.61 thf(func_def_57, type, vNOT: ($o > $o)).
% 2.17/0.61 thf(func_def_58, type, vAND: ($o > $o > $o)).
% 2.17/0.61 thf(func_def_59, type, vOR: ($o > $o > $o)).
% 2.17/0.61 thf(func_def_60, type, db0: !>[X0: $tType]:(X0)).
% 2.17/0.61 thf(func_def_61, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 2.17/0.61 thf(func_def_62, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 2.17/0.61 thf(func_def_63, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 2.17/0.61 thf(func_def_64, type, db1: !>[X0: $tType]:(X0)).
% 2.17/0.61 thf(func_def_65, type, db2: !>[X0: $tType]:(X0)).
% 2.17/0.61 thf(func_def_66, type, db3: !>[X0: $tType]:(X0)).
% 2.17/0.61 thf(func_def_67, type, db5: !>[X0: $tType]:(X0)).
% 2.17/0.61 thf(func_def_68, type, db4: !>[X0: $tType]:(X0)).
% 2.17/0.61 thf(func_def_69, type, db6: !>[X0: $tType]:(X0)).
% 2.17/0.61 thf(func_def_70, type, sP0: (list @ a > list @ a > $o)).
% 2.17/0.61 thf(func_def_71, type, sP1: ((list @ a > list @ a > $o) > $o)).
% 2.17/0.61 thf(func_def_72, type, sP2: (list @ a > list @ a > $o)).
% 2.17/0.61 thf(func_def_73, type, sP3: ((list @ a > list @ a > $o) > $o)).
% 2.17/0.61 thf(func_def_74, type, sP4: !>[X0: $tType]:((list @ X0 > list @ X0 > (X0 > X0 > $o) > $o))).
% 2.17/0.61 thf(func_def_75, type, sP5: !>[X0: $tType]:(((X0 > X0 > $o) > (list @ X0 > list @ X0 > $o) > $o))).
% 2.17/0.61 thf(func_def_76, type, sP6: !>[X0: $tType]:((list @ X0 > list @ X0 > (X0 > X0 > $o) > $o))).
% 2.17/0.61 thf(func_def_77, type, sP7: !>[X0: $tType]:(((X0 > X0 > $o) > (list @ X0 > list @ X0 > $o) > $o))).
% 2.17/0.61 thf(func_def_78, type, sP8: !>[X0: $tType]:((list @ X0 > list @ list @ X0 > $o))).
% 2.17/0.61 thf(func_def_79, type, sK9: a).
% 2.17/0.61 thf(func_def_80, type, sK10: a).
% 2.17/0.61 thf(func_def_81, type, sK11: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_82, type, sK12: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 2.17/0.61 thf(func_def_83, type, sK13: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_84, type, sK14: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_85, type, sK15: (list @ a > list @ a > list @ a)).
% 2.17/0.61 thf(func_def_86, type, sK16: (list @ a > list @ a > list @ a)).
% 2.17/0.61 thf(func_def_87, type, sK17: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_88, type, sK18: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_89, type, sK19: (list @ a > list @ a > list @ a)).
% 2.17/0.61 thf(func_def_90, type, sK20: (list @ a > list @ a > list @ a)).
% 2.17/0.61 thf(func_def_91, type, sK21: (list @ a > a)).
% 2.17/0.61 thf(func_def_92, type, sK22: (list @ a > list @ a)).
% 2.17/0.61 thf(func_def_93, type, sK23: ((list @ a > list @ a > $o) > a)).
% 2.17/0.61 thf(func_def_94, type, sK24: ((list @ a > list @ a > $o) > a)).
% 2.17/0.61 thf(func_def_95, type, sK25: ((list @ a > list @ a > $o) > list @ a)).
% 2.17/0.61 thf(func_def_96, type, sK26: ((list @ a > list @ a > $o) > list @ a)).
% 2.17/0.61 thf(func_def_97, type, sK27: ((list @ a > list @ a > $o) > a)).
% 2.17/0.61 thf(func_def_98, type, sK28: ((list @ a > list @ a > $o) > a)).
% 2.17/0.61 thf(func_def_99, type, sK29: ((list @ a > list @ a > $o) > list @ a)).
% 2.17/0.61 thf(func_def_100, type, sK30: ((list @ a > list @ a > $o) > list @ a)).
% 2.17/0.61 thf(func_def_101, type, sK31: ((list @ a > list @ a > $o) > a)).
% 2.17/0.61 thf(func_def_102, type, sK32: ((list @ a > list @ a > $o) > list @ a)).
% 2.17/0.61 thf(func_def_103, type, sK33: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_104, type, sK34: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_105, type, sK35: (list @ a > list @ a > list @ a)).
% 2.17/0.61 thf(func_def_106, type, sK36: (list @ a > list @ a > list @ a)).
% 2.17/0.61 thf(func_def_107, type, sK37: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_108, type, sK38: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_109, type, sK39: (list @ a > list @ a > list @ a)).
% 2.17/0.61 thf(func_def_110, type, sK40: (list @ a > list @ a > list @ a)).
% 2.17/0.61 thf(func_def_111, type, sK41: (list @ a > list @ a)).
% 2.17/0.61 thf(func_def_112, type, sK42: ((list @ a > list @ a > $o) > a)).
% 2.17/0.61 thf(func_def_113, type, sK43: ((list @ a > list @ a > $o) > a)).
% 2.17/0.61 thf(func_def_114, type, sK44: ((list @ a > list @ a > $o) > list @ a)).
% 2.17/0.61 thf(func_def_115, type, sK45: ((list @ a > list @ a > $o) > list @ a)).
% 2.17/0.61 thf(func_def_116, type, sK46: ((list @ a > list @ a > $o) > a)).
% 2.17/0.61 thf(func_def_117, type, sK47: ((list @ a > list @ a > $o) > a)).
% 2.17/0.61 thf(func_def_118, type, sK48: ((list @ a > list @ a > $o) > list @ a)).
% 2.17/0.61 thf(func_def_119, type, sK49: ((list @ a > list @ a > $o) > list @ a)).
% 2.17/0.61 thf(func_def_120, type, sK50: ((list @ a > list @ a > $o) > list @ a)).
% 2.17/0.61 thf(func_def_121, type, sK51: !>[X0: $tType]:((list @ X0 > list @ X0 > (X0 > X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_122, type, sK52: !>[X0: $tType]:((list @ X0 > list @ X0 > (X0 > X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_123, type, sK53: !>[X0: $tType]:((list @ X0 > list @ X0 > (X0 > X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_124, type, sK54: !>[X0: $tType]:((list @ X0 > list @ X0 > (X0 > X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_125, type, sK55: !>[X0: $tType]:((list @ X0 > list @ X0 > (X0 > X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_126, type, sK56: !>[X0: $tType]:((list @ X0 > list @ X0 > (X0 > X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_127, type, sK57: !>[X0: $tType]:((list @ X0 > list @ X0 > (X0 > X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_128, type, sK58: !>[X0: $tType]:((list @ X0 > list @ X0 > (X0 > X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_129, type, sK59: !>[X0: $tType]:((list @ X0 > X0))).
% 2.17/0.61 thf(func_def_130, type, sK60: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_131, type, sK61: !>[X0: $tType]:(((X0 > X0 > $o) > (list @ X0 > list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_132, type, sK62: !>[X0: $tType]:(((X0 > X0 > $o) > (list @ X0 > list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_133, type, sK63: !>[X0: $tType]:(((X0 > X0 > $o) > (list @ X0 > list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_134, type, sK64: !>[X0: $tType]:(((X0 > X0 > $o) > (list @ X0 > list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_135, type, sK65: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > (X0 > X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_136, type, sK66: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > (X0 > X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_137, type, sK67: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > (X0 > X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_138, type, sK68: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > (X0 > X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_139, type, sK69: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_140, type, sK70: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_141, type, sK71: !>[X0: $tType]:((list @ X0 > list @ X0 > (X0 > X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_142, type, sK72: !>[X0: $tType]:((list @ X0 > list @ X0 > (X0 > X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_143, type, sK73: !>[X0: $tType]:((list @ X0 > list @ X0 > (X0 > X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_144, type, sK74: !>[X0: $tType]:((list @ X0 > list @ X0 > (X0 > X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_145, type, sK75: !>[X0: $tType]:((list @ X0 > list @ X0 > (X0 > X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_146, type, sK76: !>[X0: $tType]:((list @ X0 > list @ X0 > (X0 > X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_147, type, sK77: !>[X0: $tType]:((list @ X0 > list @ X0 > (X0 > X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_148, type, sK78: !>[X0: $tType]:((list @ X0 > list @ X0 > (X0 > X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_149, type, sK79: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_150, type, sK80: !>[X0: $tType]:(((X0 > X0 > $o) > (list @ X0 > list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_151, type, sK81: !>[X0: $tType]:(((X0 > X0 > $o) > (list @ X0 > list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_152, type, sK82: !>[X0: $tType]:(((X0 > X0 > $o) > (list @ X0 > list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_153, type, sK83: !>[X0: $tType]:(((X0 > X0 > $o) > (list @ X0 > list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_154, type, sK84: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > (X0 > X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_155, type, sK85: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > (X0 > X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_156, type, sK86: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > (X0 > X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_157, type, sK87: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > (X0 > X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_158, type, sK88: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_159, type, sK89: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > list @ X1 > $o) > X0 > X1))).
% 2.17/0.61 thf(func_def_160, type, sK90: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > list @ X1 > $o) > X0))).
% 2.17/0.61 thf(func_def_161, type, sK91: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > list @ X1 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_162, type, sK92: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > list @ X1 > $o) > list @ X1))).
% 2.17/0.61 thf(func_def_163, type, sK93: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > list @ X1 > $o) > X0 > X1))).
% 2.17/0.61 thf(func_def_164, type, sK94: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > list @ X1 > $o) > list @ X1))).
% 2.17/0.61 thf(func_def_165, type, sK95: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_166, type, sK96: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_167, type, sK97: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_168, type, sK98: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_169, type, sK99: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_170, type, sK100: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_171, type, sK101: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_172, type, sK102: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_173, type, sK103: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_174, type, sK104: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_175, type, sK105: !>[X0: $tType]:((list @ X0 > X0))).
% 2.17/0.61 thf(func_def_176, type, sK106: !>[X0: $tType]:((list @ X0 > X0))).
% 2.17/0.61 thf(func_def_177, type, sK107: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_178, type, sK108: !>[X0: $tType]:((list @ X0 > X0))).
% 2.17/0.61 thf(func_def_179, type, sK109: !>[X0: $tType]:((list @ list @ X0 > X0))).
% 2.17/0.61 thf(func_def_180, type, sK110: !>[X0: $tType]:((list @ list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_181, type, sK111: !>[X0: $tType]:((list @ list @ X0 > list @ list @ X0))).
% 2.17/0.61 thf(func_def_182, type, sK112: !>[X0: $tType]:((list @ list @ X0 > list @ list @ X0))).
% 2.17/0.61 thf(func_def_183, type, sK113: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_184, type, sK114: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_185, type, sK115: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_186, type, sK116: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_187, type, sK117: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_188, type, sK118: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_189, type, sK119: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_190, type, sK120: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > X0))).
% 2.17/0.61 thf(func_def_191, type, sK121: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_192, type, sK122: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > X1))).
% 2.17/0.61 thf(func_def_193, type, sK123: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X1))).
% 2.17/0.61 thf(func_def_194, type, sK124: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > X1))).
% 2.17/0.61 thf(func_def_195, type, sK125: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X1))).
% 2.17/0.61 thf(func_def_196, type, sK126: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > X0))).
% 2.17/0.61 thf(func_def_197, type, sK127: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_198, type, sK128: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_199, type, sK129: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_200, type, sK130: !>[X0: $tType]:((list @ X0 > X0))).
% 2.17/0.61 thf(func_def_201, type, sK131: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_202, type, sK132: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_203, type, sK133: !>[X0: $tType]:((list @ X0 > X0))).
% 2.17/0.61 thf(func_def_204, type, sK134: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_205, type, sK135: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_206, type, sK136: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_207, type, sK137: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_208, type, sK138: !>[X0: $tType]:((list @ X0 > X0))).
% 2.17/0.61 thf(func_def_209, type, sK139: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_210, type, sK140: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_211, type, sK141: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_212, type, sK142: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_213, type, sK143: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_214, type, sK144: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_215, type, sK145: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_216, type, sK146: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 2.17/0.61 thf(func_def_217, type, sK147: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 2.17/0.61 thf(func_def_218, type, sK148: !>[X0: $tType]:((list @ list @ X0 > list @ X0 > X0))).
% 2.17/0.61 thf(func_def_219, type, sK149: !>[X0: $tType]:((list @ list @ X0 > list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_220, type, sK150: !>[X0: $tType, X1: $tType]:((list @ X1 > (X1 > X0) > list @ X0 > X0 > X1))).
% 2.17/0.61 thf(func_def_221, type, sK151: !>[X0: $tType, X1: $tType]:((list @ X1 > (X1 > X0) > list @ X0 > X0 > list @ X1))).
% 2.17/0.61 thf(func_def_222, type, sK152: !>[X0: $tType, X1: $tType]:((list @ X1 > X1 > list @ X0 > (X0 > X1) > X0))).
% 2.17/0.61 thf(func_def_223, type, sK153: !>[X0: $tType, X1: $tType]:((list @ X1 > X1 > list @ X0 > (X0 > X1) > list @ X0))).
% 2.17/0.61 thf(func_def_224, type, sK154: !>[X0: $tType]:((list @ list @ X0 > list @ X0 > X0))).
% 2.17/0.61 thf(func_def_225, type, sK155: !>[X0: $tType]:((list @ list @ X0 > list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_226, type, sK156: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_227, type, sK157: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_228, type, sK158: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_229, type, sK159: !>[X0: $tType, X1: $tType]:((list @ X1 > list @ X1 > list @ X0 > (X0 > X1) > X0))).
% 2.17/0.61 thf(func_def_230, type, sK160: !>[X0: $tType, X1: $tType]:((list @ X1 > list @ X1 > list @ X0 > (X0 > X1) > list @ X0))).
% 2.17/0.61 thf(func_def_231, type, sK161: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_232, type, sK162: !>[X0: $tType, X1: $tType]:(((X1 > X0) > list @ X1 > X0 > list @ X0 > list @ X1))).
% 2.17/0.61 thf(func_def_233, type, sK163: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > X0 > (X1 > X0) > X1))).
% 2.17/0.61 thf(func_def_234, type, sK164: !>[X0: $tType, X1: $tType]:((list @ X1 > (X1 > X0) > list @ X0 > X0 > list @ X1))).
% 2.17/0.61 thf(func_def_235, type, sK165: !>[X0: $tType, X1: $tType]:((list @ X1 > (X1 > X0) > list @ X0 > X0 > X1))).
% 2.17/0.61 thf(func_def_236, type, sK166: !>[X0: $tType]:((list @ X0 > list @ list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_237, type, sK167: !>[X0: $tType]:((list @ X0 > list @ list @ X0 > X0))).
% 2.17/0.61 thf(func_def_238, type, sK168: !>[X0: $tType]:((list @ X0 > list @ list @ X0 > X0))).
% 2.17/0.61 thf(func_def_239, type, sK169: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_240, type, sK170: !>[X0: $tType]:((list @ X0 > X0))).
% 2.17/0.61 thf(func_def_241, type, sK171: !>[X0: $tType]:((X0 > list @ X0 > list @ X0 > list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_242, type, sK172: !>[X0: $tType]:((list @ X0 > X0 > list @ X0 > list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_243, type, sK173: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0 > list @ X0 > list @ X0))).
% 2.17/0.61 thf(func_def_244, type, sK174: (list @ a > list @ a > list @ a)).
% 2.17/0.61 thf(func_def_245, type, sK175: (list @ a > list @ a > list @ a)).
% 2.17/0.61 thf(func_def_246, type, sK176: (list @ a > list @ a > list @ a)).
% 2.17/0.61 thf(func_def_247, type, sK177: (list @ a > list @ a > list @ a)).
% 2.17/0.61 thf(func_def_248, type, sK178: (list @ a > list @ a > list @ a)).
% 2.17/0.61 thf(func_def_249, type, sK179: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_250, type, sK180: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_251, type, sK181: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_252, type, sK182: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_253, type, sK183: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_254, type, sK184: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_255, type, sK185: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_256, type, sK186: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_257, type, sK187: (list @ a > list @ a > list @ a)).
% 2.17/0.61 thf(func_def_258, type, sK188: (list @ a > list @ a > list @ a)).
% 2.17/0.61 thf(func_def_259, type, sK189: (list @ a > list @ a > list @ a)).
% 2.17/0.61 thf(func_def_260, type, sK190: (list @ a > list @ a > list @ a)).
% 2.17/0.61 thf(func_def_261, type, sK191: (list @ a > list @ a > list @ a)).
% 2.17/0.61 thf(func_def_262, type, sK192: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_263, type, sK193: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_264, type, sK194: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_265, type, sK195: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_266, type, sK196: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_267, type, sK197: (list @ a > list @ a > a)).
% 2.17/0.61 thf(func_def_268, type, sK198: (list @ a > list @ a > a)).
% 2.17/0.61 thf(f8,axiom,(
% 2.17/0.61 ! [X0 : $tType,X1 : coinductive_llist @ X0,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o)] : (~(coinductive_lnull @ X0 @ X1) => (~(coinductive_lnull @ X0 @ X2) => ~(coinductive_lnull @ X0 @ (hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2))))),
% 2.17/0.61 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_7_ord_Olmerge_Odisc_I2_J)).
% 2.17/0.61 thf(f22,axiom,(
% 2.17/0.61 ! [X0 : $tType,X1 : coinductive_llist @ X0,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o)] : (((coinductive_lnull @ X0 @ X2) | (coinductive_lnull @ X0 @ X1)) => (((hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2)) = coinductive_LNil @ X0))),
% 2.17/0.61 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_21_ord_Olmerge_Octr_I1_J)).
% 2.17/0.61 thf(f25,axiom,(
% 2.17/0.61 ! [X0 : $tType] : (coinductive_lnull @ X0 = (^[X1 : coinductive_llist @ X0] : ((X1 = coinductive_LNil @ X0))))),
% 2.17/0.61 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_24_lnull__def)).
% 2.17/0.61 thf(f263,conjecture,(
% 2.17/0.61 (((coinductive_lnull @ a @ (hammin1328233080lmerge @ a @ less @ xs @ ys))) = (coinductive_lnull @ a @ ys) | (coinductive_lnull @ a @ xs))),
% 2.17/0.61 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0)).
% 2.17/0.61 thf(f264,negated_conjecture,(
% 2.17/0.61 ~ (((coinductive_lnull @ a @ (hammin1328233080lmerge @ a @ less @ xs @ ys))) = (coinductive_lnull @ a @ ys) | (coinductive_lnull @ a @ xs))),
% 2.17/0.61 inference(negated_conjecture,[status(cth)],[f263])).
% 2.17/0.61 thf(f279,plain,(
% 2.17/0.61 ! [X0 : $tType,X1 : coinductive_llist @ X0,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o)] : (~(coinductive_lnull @ X0 @ X1) => (~(coinductive_lnull @ X0 @ X2) => ~(coinductive_lnull @ X0 @ (hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2))))),
% 2.17/0.61 inference(rectify,[],[f8])).
% 2.17/0.61 thf(f280,plain,(
% 2.17/0.61 ! [X0 : $tType,X1 : coinductive_llist @ X0,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o)] : (~ (((coinductive_lnull @ X0 @ X1)) = $true) => (~ (((coinductive_lnull @ X0 @ X2)) = $true) => ~ (((coinductive_lnull @ X0 @ (hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2))) = $true)))),
% 2.17/0.61 inference(fool_elimination,[],[f279])).
% 2.17/0.61 thf(f303,plain,(
% 2.17/0.61 ! [X0 : $tType,X1 : coinductive_llist @ X0,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o)] : (((coinductive_lnull @ X0 @ X2) | (coinductive_lnull @ X0 @ X1)) => (((hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2)) = coinductive_LNil @ X0))),
% 2.17/0.61 inference(rectify,[],[f22])).
% 2.17/0.61 thf(f304,plain,(
% 2.17/0.61 ! [X0 : $tType,X1 : coinductive_llist @ X0,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o)] : (((((coinductive_lnull @ X0 @ X2)) = $true) | (((coinductive_lnull @ X0 @ X1)) = $true)) => (((hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2)) = coinductive_LNil @ X0))),
% 2.17/0.61 inference(fool_elimination,[],[f303])).
% 2.17/0.61 thf(f309,plain,(
% 2.17/0.61 ! [X0 : $tType] : (coinductive_lnull @ X0 = (^[Y0 : coinductive_llist @ X0]: (coinductive_LNil @ X0 = Y0)))),
% 2.17/0.61 inference(fool_elimination,[],[f25])).
% 2.17/0.61 thf(f583,plain,(
% 2.17/0.61 ~ (((coinductive_lnull @ a @ (hammin1328233080lmerge @ a @ less @ xs @ ys))) = (coinductive_lnull @ a @ ys) | (coinductive_lnull @ a @ xs))),
% 2.17/0.61 inference(rectify,[],[f264])).
% 2.17/0.61 thf(f584,plain,(
% 2.17/0.61 ~ (((coinductive_lnull @ a @ (hammin1328233080lmerge @ a @ less @ xs @ ys))) = (((coinductive_lnull @ a @ xs) | (coinductive_lnull @ a @ ys))))),
% 2.17/0.61 inference(fool_elimination,[],[f583])).
% 2.17/0.61 thf(f587,plain,(
% 2.17/0.61 ! [X0 : $tType,X1 : coinductive_llist @ X0,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o)] : ((((coinductive_lnull @ X0 @ X1)) != $true) => ((((coinductive_lnull @ X0 @ X2)) != $true) => (((coinductive_lnull @ X0 @ (hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2))) != $true)))),
% 2.17/0.61 inference(flattening,[],[f280])).
% 2.17/0.61 thf(f620,plain,(
% 2.17/0.61 (((coinductive_lnull @ a @ (hammin1328233080lmerge @ a @ less @ xs @ ys))) != (((coinductive_lnull @ a @ xs) | (coinductive_lnull @ a @ ys))))),
% 2.17/0.61 inference(flattening,[],[f584])).
% 2.17/0.61 thf(f630,plain,(
% 2.17/0.61 ! [X0 : $tType,X1 : coinductive_llist @ X0,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o)] : (((((coinductive_lnull @ X0 @ (hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2))) != $true) | (((coinductive_lnull @ X0 @ X2)) = $true)) | (((coinductive_lnull @ X0 @ X1)) = $true))),
% 2.17/0.61 inference(ennf_transformation,[],[f587])).
% 2.17/0.61 thf(f631,plain,(
% 2.17/0.61 ! [X0 : $tType,X1 : coinductive_llist @ X0,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o)] : ((((coinductive_lnull @ X0 @ (hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2))) != $true) | (((coinductive_lnull @ X0 @ X2)) = $true) | (((coinductive_lnull @ X0 @ X1)) = $true))),
% 2.17/0.61 inference(flattening,[],[f630])).
% 2.17/0.61 thf(f643,plain,(
% 2.17/0.61 ! [X0 : $tType,X1 : coinductive_llist @ X0,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o)] : ((((hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2)) = coinductive_LNil @ X0) | ((((coinductive_lnull @ X0 @ X2)) != $true) & (((coinductive_lnull @ X0 @ X1)) != $true)))),
% 2.17/0.61 inference(ennf_transformation,[],[f304])).
% 2.17/0.61 thf(f892,plain,(
% 2.17/0.61 ( ! [X0 : $tType,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o),X1 : coinductive_llist @ X0] : ((((coinductive_lnull @ X0 @ (hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2))) != $true) | (((coinductive_lnull @ X0 @ X2)) = $true) | (((coinductive_lnull @ X0 @ X1)) = $true)) )),
% 2.17/0.61 inference(cnf_transformation,[],[f631])).
% 2.17/0.61 thf(f912,plain,(
% 2.17/0.61 ( ! [X0 : $tType,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o),X1 : coinductive_llist @ X0] : ((((hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2)) = coinductive_LNil @ X0) | (((coinductive_lnull @ X0 @ X1)) != $true)) )),
% 2.17/0.61 inference(cnf_transformation,[],[f643])).
% 2.17/0.61 thf(f913,plain,(
% 2.17/0.61 ( ! [X0 : $tType,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o),X1 : coinductive_llist @ X0] : ((((hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2)) = coinductive_LNil @ X0) | (((coinductive_lnull @ X0 @ X2)) != $true)) )),
% 2.17/0.61 inference(cnf_transformation,[],[f643])).
% 2.17/0.61 thf(f916,plain,(
% 2.17/0.61 ( ! [X0 : $tType] : ((coinductive_lnull @ X0 = (^[Y0 : coinductive_llist @ X0]: (coinductive_LNil @ X0 = Y0)))) )),
% 2.17/0.61 inference(cnf_transformation,[],[f309])).
% 2.17/0.61 thf(f1257,plain,(
% 2.17/0.61 (((coinductive_lnull @ a @ (hammin1328233080lmerge @ a @ less @ xs @ ys))) != (((coinductive_lnull @ a @ xs) | (coinductive_lnull @ a @ ys))))),
% 2.17/0.61 inference(cnf_transformation,[],[f620])).
% 2.17/0.61 thf(f1269,plain,(
% 2.17/0.61 ( ! [X0 : $tType,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o),X1 : coinductive_llist @ X0] : (($true != (((^[Y0 : coinductive_llist @ X0]: (coinductive_LNil @ X0 = Y0)) @ (hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2)))) | ($true = (((^[Y0 : coinductive_llist @ X0]: (coinductive_LNil @ X0 = Y0)) @ X2))) | ($true = (((^[Y0 : coinductive_llist @ X0]: (coinductive_LNil @ X0 = Y0)) @ X1)))) )),
% 2.17/0.61 inference(definition_unfolding,[],[f892,f916,f916,f916])).
% 2.17/0.61 thf(f1285,plain,(
% 2.17/0.61 ( ! [X0 : $tType,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o),X1 : coinductive_llist @ X0] : ((((hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2)) = coinductive_LNil @ X0) | ($true != (((^[Y0 : coinductive_llist @ X0]: (coinductive_LNil @ X0 = Y0)) @ X2)))) )),
% 2.17/0.61 inference(definition_unfolding,[],[f913,f916])).
% 2.17/0.61 thf(f1286,plain,(
% 2.17/0.61 ( ! [X0 : $tType,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o),X1 : coinductive_llist @ X0] : ((((hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2)) = coinductive_LNil @ X0) | ($true != (((^[Y0 : coinductive_llist @ X0]: (coinductive_LNil @ X0 = Y0)) @ X1)))) )),
% 2.17/0.61 inference(definition_unfolding,[],[f912,f916])).
% 2.17/0.61 thf(f1332,plain,(
% 2.17/0.61 ((((^[Y0 : coinductive_llist @ a]: (coinductive_LNil @ a = Y0)) @ (hammin1328233080lmerge @ a @ less @ xs @ ys))) != ((((^[Y0 : coinductive_llist @ a]: (coinductive_LNil @ a = Y0)) @ xs) | ((^[Y0 : coinductive_llist @ a]: (coinductive_LNil @ a = Y0)) @ ys))))),
% 2.17/0.61 inference(definition_unfolding,[],[f1257,f916,f916,f916])).
% 2.17/0.61 thf(f1361,plain,(
% 2.17/0.61 ($true = (((^[Y0 : coinductive_llist @ a]: (coinductive_LNil @ a = Y0)) @ (hammin1328233080lmerge @ a @ less @ xs @ ys)))) | ($true = ((((^[Y0 : coinductive_llist @ a]: (coinductive_LNil @ a = Y0)) @ xs) | ((^[Y0 : coinductive_llist @ a]: (coinductive_LNil @ a = Y0)) @ ys))))),
% 2.17/0.61 inference(xor_proxy_clausification,[],[f1332])).
% 2.17/0.61 thf(f1362,plain,(
% 2.17/0.61 ($false = (((^[Y0 : coinductive_llist @ a]: (coinductive_LNil @ a = Y0)) @ (hammin1328233080lmerge @ a @ less @ xs @ ys)))) | ($false = ((((^[Y0 : coinductive_llist @ a]: (coinductive_LNil @ a = Y0)) @ xs) | ((^[Y0 : coinductive_llist @ a]: (coinductive_LNil @ a = Y0)) @ ys))))),
% 2.17/0.61 inference(xor_proxy_clausification,[],[f1332])).
% 2.17/0.61 thf(f1363,plain,(
% 2.17/0.61 ($false = (((^[Y0 : coinductive_llist @ a]: (coinductive_LNil @ a = Y0)) @ (hammin1328233080lmerge @ a @ less @ xs @ ys)))) | ($false = (((^[Y0 : coinductive_llist @ a]: (coinductive_LNil @ a = Y0)) @ ys)))),
% 2.17/0.61 inference(or_proxy_clausification,[],[f1362])).
% 2.17/0.61 thf(f1364,plain,(
% 2.17/0.61 ($false = (((^[Y0 : coinductive_llist @ a]: (coinductive_LNil @ a = Y0)) @ (hammin1328233080lmerge @ a @ less @ xs @ ys)))) | ($false = (((^[Y0 : coinductive_llist @ a]: (coinductive_LNil @ a = Y0)) @ xs)))),
% 2.17/0.61 inference(or_proxy_clausification,[],[f1362])).
% 2.17/0.61 thf(f1365,plain,(
% 2.17/0.61 ($false = ((coinductive_LNil @ a = (hammin1328233080lmerge @ a @ less @ xs @ ys)))) | ($false = ((coinductive_LNil @ a = xs)))),
% 2.17/0.61 inference(beta-eta_normalization,[],[f1364])).
% 2.17/0.61 thf(f1366,plain,(
% 2.17/0.61 (coinductive_LNil @ a != ((hammin1328233080lmerge @ a @ less @ xs @ ys))) | ($false = ((coinductive_LNil @ a = xs)))),
% 2.17/0.61 inference(equality_proxy_clausification,[],[f1365])).
% 2.17/0.61 thf(f1367,plain,(
% 2.17/0.61 (coinductive_LNil @ a != ((hammin1328233080lmerge @ a @ less @ xs @ ys))) | (coinductive_LNil @ a != xs)),
% 2.17/0.61 inference(equality_proxy_clausification,[],[f1366])).
% 2.17/0.61 thf(f1368,plain,(
% 2.17/0.61 ($false = ((coinductive_LNil @ a = (hammin1328233080lmerge @ a @ less @ xs @ ys)))) | ($false = ((coinductive_LNil @ a = ys)))),
% 2.17/0.61 inference(beta-eta_normalization,[],[f1363])).
% 2.17/0.61 thf(f1369,plain,(
% 2.17/0.61 (coinductive_LNil @ a != ((hammin1328233080lmerge @ a @ less @ xs @ ys))) | ($false = ((coinductive_LNil @ a = ys)))),
% 2.17/0.61 inference(equality_proxy_clausification,[],[f1368])).
% 2.17/0.61 thf(f1370,plain,(
% 2.17/0.61 (coinductive_LNil @ a != ((hammin1328233080lmerge @ a @ less @ xs @ ys))) | (coinductive_LNil @ a != ys)),
% 2.17/0.61 inference(equality_proxy_clausification,[],[f1369])).
% 2.17/0.61 thf(f1371,plain,(
% 2.17/0.61 ($true = (((^[Y0 : coinductive_llist @ a]: (coinductive_LNil @ a = Y0)) @ (hammin1328233080lmerge @ a @ less @ xs @ ys)))) | ($true = (((^[Y0 : coinductive_llist @ a]: (coinductive_LNil @ a = Y0)) @ ys))) | ($true = (((^[Y0 : coinductive_llist @ a]: (coinductive_LNil @ a = Y0)) @ xs)))),
% 2.17/0.61 inference(or_proxy_clausification,[],[f1361])).
% 2.17/0.61 thf(f1372,plain,(
% 2.17/0.61 ($true = ((coinductive_LNil @ a = (hammin1328233080lmerge @ a @ less @ xs @ ys)))) | ($true = ((coinductive_LNil @ a = ys))) | ($true = ((coinductive_LNil @ a = xs)))),
% 2.17/0.61 inference(beta-eta_normalization,[],[f1371])).
% 2.17/0.61 thf(f1373,plain,(
% 2.17/0.61 (coinductive_LNil @ a = ((hammin1328233080lmerge @ a @ less @ xs @ ys))) | ($true = ((coinductive_LNil @ a = ys))) | ($true = ((coinductive_LNil @ a = xs)))),
% 2.17/0.61 inference(equality_proxy_clausification,[],[f1372])).
% 2.17/0.61 thf(f1374,plain,(
% 2.17/0.61 (coinductive_LNil @ a = ((hammin1328233080lmerge @ a @ less @ xs @ ys))) | (coinductive_LNil @ a = ys) | ($true = ((coinductive_LNil @ a = xs)))),
% 2.17/0.61 inference(equality_proxy_clausification,[],[f1373])).
% 2.17/0.61 thf(f1375,plain,(
% 2.17/0.61 (coinductive_LNil @ a = ((hammin1328233080lmerge @ a @ less @ xs @ ys))) | (coinductive_LNil @ a = ys) | (coinductive_LNil @ a = xs)),
% 2.17/0.61 inference(equality_proxy_clausification,[],[f1374])).
% 2.17/0.61 thf(f2278,plain,(
% 2.17/0.61 ( ! [X0 : $tType,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o),X1 : coinductive_llist @ X0] : ((((hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2)) = coinductive_LNil @ X0) | ($true != ((coinductive_LNil @ X0 = X1)))) )),
% 2.17/0.61 inference(beta-eta_normalization,[],[f1286])).
% 2.17/0.61 thf(f2279,plain,(
% 2.17/0.61 ( ! [X0 : $tType,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o),X1 : coinductive_llist @ X0] : ((coinductive_LNil @ X0 != X1) | (((hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2)) = coinductive_LNil @ X0)) )),
% 2.17/0.61 inference(equality_proxy_clausification,[],[f2278])).
% 2.17/0.61 thf(f2280,plain,(
% 2.17/0.61 ( ! [X0 : $tType,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o),X1 : coinductive_llist @ X0] : ((((hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2)) = coinductive_LNil @ X0) | ($true != ((coinductive_LNil @ X0 = X2)))) )),
% 2.17/0.61 inference(beta-eta_normalization,[],[f1285])).
% 2.17/0.61 thf(f2281,plain,(
% 2.17/0.61 ( ! [X0 : $tType,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o),X1 : coinductive_llist @ X0] : ((coinductive_LNil @ X0 != X2) | (((hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2)) = coinductive_LNil @ X0)) )),
% 2.17/0.61 inference(equality_proxy_clausification,[],[f2280])).
% 2.17/0.61 thf(f2340,plain,(
% 2.17/0.61 ( ! [X0 : $tType,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o),X1 : coinductive_llist @ X0] : (($true != ((coinductive_LNil @ X0 = (hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2)))) | ($true = ((coinductive_LNil @ X0 = X2))) | ($true = ((coinductive_LNil @ X0 = X1)))) )),
% 2.17/0.61 inference(beta-eta_normalization,[],[f1269])).
% 2.17/0.61 thf(f2341,plain,(
% 2.17/0.61 ( ! [X0 : $tType,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o),X1 : coinductive_llist @ X0] : ((((hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2)) != coinductive_LNil @ X0) | ($true = ((coinductive_LNil @ X0 = X2))) | ($true = ((coinductive_LNil @ X0 = X1)))) )),
% 2.17/0.61 inference(equality_proxy_clausification,[],[f2340])).
% 2.17/0.61 thf(f2342,plain,(
% 2.17/0.61 ( ! [X0 : $tType,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o),X1 : coinductive_llist @ X0] : ((((hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2)) != coinductive_LNil @ X0) | (coinductive_LNil @ X0 = X2) | ($true = ((coinductive_LNil @ X0 = X1)))) )),
% 2.17/0.61 inference(equality_proxy_clausification,[],[f2341])).
% 2.17/0.61 thf(f2343,plain,(
% 2.17/0.61 ( ! [X0 : $tType,X2 : coinductive_llist @ X0,X3 : (X0 > X0 > $o),X1 : coinductive_llist @ X0] : ((((hammin1328233080lmerge @ X0 @ X3 @ X1 @ X2)) != coinductive_LNil @ X0) | (coinductive_LNil @ X0 = X2) | (coinductive_LNil @ X0 = X1)) )),
% 2.17/0.61 inference(equality_proxy_clausification,[],[f2342])).
% 2.17/0.61 thf(f2392,definition,(
% 2.17/0.61 spl199_1 <=> (coinductive_LNil @ a = xs)),
% 2.17/0.61 introduced(definition,[new_symbols(definition,[spl199_1])],[avatar_definition])).
% 2.17/0.61 thf(f2393,plain,(
% 2.17/0.61 (coinductive_LNil @ a = xs) | ~spl199_1),
% 2.17/0.61 inference(avatar_component_clause,[],[f2392])).
% 2.17/0.61 thf(f2394,plain,(
% 2.17/0.61 (coinductive_LNil @ a != xs) | spl199_1),
% 2.17/0.61 inference(avatar_component_clause,[],[f2392])).
% 2.17/0.61 thf(f2396,definition,(
% 2.17/0.61 spl199_2 <=> (coinductive_LNil @ a = ((hammin1328233080lmerge @ a @ less @ xs @ ys)))),
% 2.17/0.61 introduced(definition,[new_symbols(definition,[spl199_2])],[avatar_definition])).
% 2.17/0.61 thf(f2397,plain,(
% 2.17/0.61 (coinductive_LNil @ a = ((hammin1328233080lmerge @ a @ less @ xs @ ys))) | ~spl199_2),
% 2.17/0.61 inference(avatar_component_clause,[],[f2396])).
% 2.17/0.61 thf(f2398,plain,(
% 2.17/0.61 (coinductive_LNil @ a != ((hammin1328233080lmerge @ a @ less @ xs @ ys))) | spl199_2),
% 2.17/0.61 inference(avatar_component_clause,[],[f2396])).
% 2.17/0.61 thf(f2399,plain,(
% 2.17/0.61 ~spl199_1 | ~spl199_2),
% 2.17/0.61 inference(avatar_split_clause,[],[f1367,f2396,f2392])).
% 2.17/0.61 thf(f2401,definition,(
% 2.17/0.61 spl199_3 <=> (coinductive_LNil @ a = ys)),
% 2.17/0.61 introduced(definition,[new_symbols(definition,[spl199_3])],[avatar_definition])).
% 2.17/0.61 thf(f2402,plain,(
% 2.17/0.61 (coinductive_LNil @ a = ys) | ~spl199_3),
% 2.17/0.61 inference(avatar_component_clause,[],[f2401])).
% 2.17/0.61 thf(f2403,plain,(
% 2.17/0.61 (coinductive_LNil @ a != ys) | spl199_3),
% 2.17/0.61 inference(avatar_component_clause,[],[f2401])).
% 2.17/0.61 thf(f2404,plain,(
% 2.17/0.61 ~spl199_3 | ~spl199_2),
% 2.17/0.61 inference(avatar_split_clause,[],[f1370,f2396,f2401])).
% 2.17/0.61 thf(f2405,plain,(
% 2.17/0.61 spl199_1 | spl199_3 | spl199_2),
% 2.17/0.61 inference(avatar_split_clause,[],[f1375,f2396,f2401,f2392])).
% 2.17/0.61 thf(f4136,plain,(
% 2.17/0.61 (coinductive_LNil @ a != coinductive_LNil @ a) | (coinductive_LNil @ a = ys) | (coinductive_LNil @ a = xs) | ~spl199_2),
% 2.17/0.61 inference(constrained_superposition,[],[f2343,f2397])).
% 2.17/0.61 thf(f4137,plain,(
% 2.17/0.61 (coinductive_LNil @ a = ys) | (coinductive_LNil @ a = xs) | ~spl199_2),
% 2.17/0.61 inference(trivial_inequality_removal,[],[f4136])).
% 2.17/0.61 thf(f4138,plain,(
% 2.17/0.61 (coinductive_LNil @ a = xs) | (~spl199_2 | spl199_3)),
% 2.17/0.61 inference(forward_subsumption_resolution,[],[f4137,f2403])).
% 2.17/0.61 thf(f4139,plain,(
% 2.17/0.61 $false | (spl199_1 | ~spl199_2 | spl199_3)),
% 2.17/0.61 inference(forward_subsumption_resolution,[],[f4138,f2394])).
% 2.17/0.61 thf(f4140,plain,(
% 2.17/0.61 spl199_1 | ~spl199_2 | spl199_3),
% 2.17/0.61 inference(avatar_contradiction_clause,[],[f4139])).
% 2.17/0.61 thf(f4172,plain,(
% 2.17/0.61 ( ! [X2 : coinductive_llist @ a,X0 : coinductive_llist @ a,X1 : (a > a > $o)] : ((ys != X0) | (ys = ((hammin1328233080lmerge @ a @ X1 @ X2 @ X0)))) ) | ~spl199_3),
% 2.17/0.61 inference(constrained_superposition,[],[f2281,f2402])).
% 2.17/0.61 thf(f4626,plain,(
% 2.17/0.61 (ys != ((hammin1328233080lmerge @ a @ less @ xs @ ys))) | (spl199_2 | ~spl199_3)),
% 2.17/0.61 inference(forward_demodulation,[],[f2398,f2402])).
% 2.17/0.61 thf(f4883,plain,(
% 2.17/0.61 ( ! [X0 : (a > a > $o),X1 : coinductive_llist @ a] : ((ys = ((hammin1328233080lmerge @ a @ X0 @ X1 @ ys)))) ) | ~spl199_3),
% 2.17/0.61 inference(equality_resolution,[],[f4172])).
% 2.17/0.61 thf(f5062,plain,(
% 2.17/0.61 $false | (spl199_2 | ~spl199_3)),
% 2.17/0.61 inference(backward_subsumption_resolution,[],[f4626,f4883])).
% 2.17/0.61 thf(f5064,plain,(
% 2.17/0.61 spl199_2 | ~spl199_3),
% 2.17/0.61 inference(avatar_contradiction_clause,[],[f5062])).
% 2.17/0.61 thf(f5647,plain,(
% 2.17/0.61 ( ! [X2 : coinductive_llist @ a,X0 : coinductive_llist @ a,X1 : (a > a > $o)] : ((xs != X0) | (xs = ((hammin1328233080lmerge @ a @ X1 @ X0 @ X2)))) ) | ~spl199_1),
% 2.17/0.61 inference(constrained_superposition,[],[f2279,f2393])).
% 2.17/0.61 thf(f5858,plain,(
% 2.17/0.61 (xs != ((hammin1328233080lmerge @ a @ less @ xs @ ys))) | (~spl199_1 | spl199_2)),
% 2.17/0.61 inference(forward_demodulation,[],[f2398,f2393])).
% 2.17/0.61 thf(f5876,plain,(
% 2.17/0.61 ( ! [X0 : (a > a > $o),X1 : coinductive_llist @ a] : ((xs = ((hammin1328233080lmerge @ a @ X0 @ xs @ X1)))) ) | ~spl199_1),
% 2.17/0.61 inference(equality_resolution,[],[f5647])).
% 2.17/0.61 thf(f5877,plain,(
% 2.17/0.61 $false | (~spl199_1 | spl199_2)),
% 2.17/0.61 inference(backward_subsumption_resolution,[],[f5858,f5876])).
% 2.17/0.61 thf(f5879,plain,(
% 2.17/0.61 ~spl199_1 | spl199_2),
% 2.17/0.61 inference(avatar_contradiction_clause,[],[f5877])).
% 2.17/0.61 cnf(s1, plain, ~spl199_1 | ~spl199_2, inference(sat_conversion,[],[f2399])).
% 2.17/0.61 cnf(s2, plain, ~spl199_2 | ~spl199_3, inference(sat_conversion,[],[f2404])).
% 2.17/0.61 cnf(s3, plain, spl199_1 | spl199_2 | spl199_3, inference(sat_conversion,[],[f2405])).
% 2.17/0.61 cnf(s59, plain, spl199_1 | ~spl199_2 | spl199_3, inference(sat_conversion,[],[f4140])).
% 2.17/0.61 cnf(s72, plain, spl199_2 | ~spl199_3, inference(sat_conversion,[],[f5064])).
% 2.17/0.61 cnf(s85, plain, ~spl199_1 | spl199_2, inference(sat_conversion,[],[f5879])).
% 2.17/0.61 cnf(s122, plain, spl199_2 | spl199_1, inference(rat,[],[s3,s72])).
% 2.17/0.61 cnf(s123, plain, spl199_1, inference(rat,[],[s59,s2,s122])).
% 2.17/0.61 cnf(s124, plain, spl199_2, inference(rat,[],[s85,s123])).
% 2.17/0.61 cnf(s125, plain, $false, inference(rat,[],[s1,s124,s123])).
% 2.17/0.61 thf(f5880,plain,(
% 2.17/0.61 $false),
% 2.17/0.61 inference(avatar_sat_refutation,[],[s125])).
% 2.17/0.61 % SZS output end Proof for theBenchmark
% 2.17/0.61 % (3730719)------------------------------
% 2.17/0.61 % (3730719)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.17/0.61 % (3730719)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.17/0.61 % (3730719)CaDiCaL version: 2.1.3
% 2.17/0.61 % (3730719)Termination reason: Refutation
% 2.17/0.61 % (3730719)Time elapsed: 0.279 s
% 2.17/0.61 % (3730719)Peak memory usage: 16 MB
% 2.17/0.61 % (3730719)Instructions burned: 610 (million)
% 2.17/0.61 % (3730713)Success in time 0.323 s
% 2.17/0.61 % Vampire exiting
%------------------------------------------------------------------------------