%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : DAT197^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:31 AM UTC 2026
% Result : Theorem 0.30s 0.41s
% Output : Refutation 0.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT197^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n009.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 18:07:45 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.21/0.29 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.30/0.41 % (159819)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.30/0.41 % (159827)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=1745561396:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.30/0.41 % (159824)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3740455183:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.30/0.41 % (159825)lrs+10_16_si=on:nwc=1.5:random_seed=3087731482:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.30/0.41 % (159826)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=4146399191:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.30/0.41 % (159828)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=473456468:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.30/0.41 % (159826)Instruction limit reached!
% 0.30/0.41 % (159826)------------------------------
% 0.30/0.41 % (159826)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.41 % (159826)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.41 % (159826)CaDiCaL version: 2.1.3
% 0.30/0.41 % (159826)Termination reason: Instruction limit
% 0.30/0.41 % (159826)Termination phase: shuffling
% 0.30/0.41 % (159826)Time elapsed: 0.003 s
% 0.30/0.41 % (159826)Peak memory usage: 10 MB
% 0.30/0.41 % (159826)Instructions burned: 5 (million)
% 0.30/0.41 % (159830)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.30/0.41 % (159830)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.30/0.41 % (159829)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3295343307:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.30/0.41 % (159830)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=2236388365:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.30/0.41 % (159825)Instruction limit reached!
% 0.30/0.41 % (159825)------------------------------
% 0.30/0.41 % (159825)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.41 % (159825)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.41 % (159825)CaDiCaL version: 2.1.3
% 0.30/0.41 % (159825)Termination reason: Instruction limit
% 0.30/0.41 % (159825)Termination phase: shuffling
% 0.30/0.41 % (159825)Time elapsed: 0.010 s
% 0.30/0.41 % (159825)Peak memory usage: 10 MB
% 0.30/0.41 % (159825)Instructions burned: 20 (million)
% 0.30/0.41 % (159828)Instruction limit reached!
% 0.30/0.41 % (159828)------------------------------
% 0.30/0.41 % (159828)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.41 % (159828)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.41 % (159828)CaDiCaL version: 2.1.3
% 0.30/0.41 % (159828)Termination reason: Instruction limit
% 0.30/0.41 % (159828)Termination phase: shuffling
% 0.30/0.41 % (159828)Time elapsed: 0.012 s
% 0.30/0.41 % (159828)Peak memory usage: 10 MB
% 0.30/0.41 % (159828)Instructions burned: 26 (million)
% 0.30/0.41 % (159836)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=3815921352:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.30/0.41 % (159836)Instruction limit reached!
% 0.30/0.41 % (159836)------------------------------
% 0.30/0.41 % (159836)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.41 % (159836)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.41 % (159836)CaDiCaL version: 2.1.3
% 0.30/0.41 % (159836)Termination reason: Instruction limit
% 0.30/0.41 % (159836)Termination phase: shuffling
% 0.30/0.41 % (159836)Time elapsed: 0.002 s
% 0.30/0.41 % (159836)Peak memory usage: 10 MB
% 0.30/0.41 % (159836)Instructions burned: 3 (million)
% 0.30/0.41 % (159840)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.30/0.41 % (159839)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=3083325224:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.30/0.41 % (159840)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=2439301323:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.30/0.41 % (159839)Instruction limit reached!
% 0.30/0.41 % (159839)------------------------------
% 0.30/0.41 % (159839)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.41 % (159839)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.41 % (159839)CaDiCaL version: 2.1.3
% 0.30/0.41 % (159839)Termination reason: Instruction limit
% 0.30/0.41 % (159839)Termination phase: shuffling
% 0.30/0.41 % (159839)Time elapsed: 0.003 s
% 0.30/0.41 % (159839)Peak memory usage: 10 MB
% 0.30/0.41 % (159839)Instructions burned: 6 (million)
% 0.30/0.41 % (159840)Instruction limit reached!
% 0.30/0.41 % (159840)------------------------------
% 0.30/0.41 % (159840)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.41 % (159840)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.41 % (159840)CaDiCaL version: 2.1.3
% 0.30/0.41 % (159840)Termination reason: Instruction limit
% 0.30/0.41 % (159840)Termination phase: shuffling
% 0.30/0.41 % (159840)Time elapsed: 0.004 s
% 0.30/0.41 % (159840)Peak memory usage: 10 MB
% 0.30/0.41 % (159840)Instructions burned: 7 (million)
% 0.30/0.41 % (159824)Instruction limit reached!
% 0.30/0.41 % (159824)------------------------------
% 0.30/0.41 % (159824)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.41 % (159824)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.41 % (159824)CaDiCaL version: 2.1.3
% 0.30/0.41 % (159824)Termination reason: Instruction limit
% 0.30/0.41 % (159824)Termination phase: Preprocessing 3
% 0.30/0.41 % (159824)Time elapsed: 0.042 s
% 0.30/0.41 % (159824)Peak memory usage: 12 MB
% 0.30/0.41 % (159824)Instructions burned: 88 (million)
% 0.30/0.41 % (159827) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-159819-159827"...
% 0.30/0.41 % (159829)Instruction limit reached!
% 0.30/0.41 % (159829)------------------------------
% 0.30/0.41 % (159829)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.41 % (159829)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.41 % (159829)CaDiCaL version: 2.1.3
% 0.30/0.41 % (159829)Termination reason: Instruction limit
% 0.30/0.41 % (159829)Termination phase: Preprocessing 3
% 0.30/0.41 % (159829)Time elapsed: 0.035 s
% 0.30/0.41 % (159829)Peak memory usage: 12 MB
% 0.30/0.41 % (159829)Instructions burned: 75 (million)
% 0.30/0.41 % (159827)...printing done.
% 0.30/0.41 % (159842)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=3663946513:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.30/0.41 % (159827)Refutation found. Thanks to Tanya!
% 0.30/0.41 % SZS status Theorem for theBenchmark
% 0.30/0.41 % SZS output start Proof for theBenchmark
% 0.30/0.41 thf(type_def_5, type, coinductive_llist: $tType > $tType).
% 0.30/0.41 thf(type_def_6, type, code_natural: $tType).
% 0.30/0.41 thf(type_def_7, type, extended_enat: $tType).
% 0.30/0.41 thf(type_def_8, type, set: $tType > $tType).
% 0.30/0.41 thf(type_def_9, type, nat: $tType).
% 0.30/0.41 thf(type_def_10, type, itself: $tType > $tType).
% 0.30/0.41 thf(type_def_11, type, b: $tType).
% 0.30/0.41 thf(type_def_12, type, a: $tType).
% 0.30/0.41 thf(type_def_13, type, sTfun: ($tType * $tType) > $tType).
% 0.30/0.41 thf(func_def_0, type, zero: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.30/0.41 thf(func_def_1, type, group_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.30/0.41 thf(func_def_2, type, monoid_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.30/0.41 thf(func_def_3, type, semigroup_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.30/0.41 thf(func_def_4, type, comm_semiring_1: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.30/0.41 thf(func_def_5, type, comm_monoid_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.30/0.41 thf(func_def_6, type, ab_semigroup_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.30/0.41 thf(func_def_7, type, cancel_semigroup_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.30/0.41 thf(func_def_8, type, cancel1352612707id_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.30/0.41 thf(func_def_9, type, linord219039673up_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.30/0.41 thf(func_def_10, type, ordere779506340up_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.30/0.41 thf(func_def_11, type, canoni770627133id_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.30/0.41 thf(func_def_12, type, semiri456707255roduct: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.30/0.41 thf(func_def_13, type, bNF_rel_fun: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:(((X0 > X1 > $o) > (X2 > X3 > $o) > (X0 > X2) > (X1 > X3) > $o))).
% 0.30/0.41 thf(func_def_14, type, code_case_natural: !>[X0: $tType]:((X0 > (code_natural > X0) > code_natural > X0))).
% 0.30/0.41 thf(func_def_15, type, code_rec_natural: !>[X0: $tType]:((X0 > (code_natural > X0 > X0) > code_natural > X0))).
% 0.30/0.41 thf(func_def_16, type, code_size_natural: (code_natural > nat)).
% 0.30/0.41 thf(func_def_17, type, coindu328551480prefix: !>[X0: $tType]:((coinductive_llist @ X0 > coinductive_llist @ X0 > $o))).
% 0.30/0.41 thf(func_def_18, type, coindu246717305length: !>[X0: $tType]:((nat > coinductive_llist @ X0 > extended_enat))).
% 0.30/0.41 thf(func_def_19, type, coinductive_iterates: !>[X0: $tType]:(((X0 > X0) > X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_20, type, coinductive_lappend: !>[X0: $tType]:((coinductive_llist @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_21, type, coinductive_ldrop: !>[X0: $tType]:((extended_enat > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_22, type, coindu218763757pWhile: !>[X0: $tType]:(((X0 > $o) > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_23, type, coinductive_lfilter: !>[X0: $tType]:(((X0 > $o) > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_24, type, coinductive_lfinite: !>[X0: $tType]:((coinductive_llist @ X0 > $o))).
% 0.30/0.41 thf(func_def_25, type, coinductive_llast: !>[X0: $tType]:((coinductive_llist @ X0 > X0))).
% 0.30/0.41 thf(func_def_26, type, coinductive_llcp: !>[X0: $tType]:((coinductive_llist @ X0 > coinductive_llist @ X0 > extended_enat))).
% 0.30/0.41 thf(func_def_27, type, coinductive_llength: !>[X0: $tType]:((coinductive_llist @ X0 > extended_enat))).
% 0.30/0.41 thf(func_def_28, type, coinductive_LCons: !>[X0: $tType]:((X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_29, type, coindu1381640503_llist: !>[X0: $tType, X1: $tType]:((X0 > (X1 > coinductive_llist @ X1 > X0) > coinductive_llist @ X1 > X0))).
% 0.30/0.41 thf(func_def_30, type, coindu1259883913_llist: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X0 > X1) > (X0 > $o) > (X0 > coinductive_llist @ X1) > (X0 > X0) > X0 > coinductive_llist @ X1))).
% 0.30/0.41 thf(func_def_31, type, coindu1486289336t_all2: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > coinductive_llist @ X0 > coinductive_llist @ X1 > $o))).
% 0.30/0.41 thf(func_def_32, type, coinductive_lmap: !>[X0: $tType, X1: $tType]:(((X0 > X1) > coinductive_llist @ X0 > coinductive_llist @ X1))).
% 0.30/0.41 thf(func_def_33, type, coinductive_lset: !>[X0: $tType]:((coinductive_llist @ X0 > set @ X0))).
% 0.30/0.41 thf(func_def_34, type, coindu543516966_llist: !>[X0: $tType]:(((X0 > $o) > coinductive_llist @ X0 > $o))).
% 0.30/0.41 thf(func_def_35, type, coinductive_lmember: !>[X0: $tType]:((X0 > coinductive_llist @ X0 > $o))).
% 0.30/0.41 thf(func_def_36, type, coinductive_lprefix: !>[X0: $tType]:((coinductive_llist @ X0 > coinductive_llist @ X0 > $o))).
% 0.30/0.41 thf(func_def_37, type, coinductive_ltake: !>[X0: $tType]:((extended_enat > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_38, type, coindu501562517eWhile: !>[X0: $tType]:(((X0 > $o) > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_39, type, coindu780009021istsum: !>[X0: $tType]:((coinductive_llist @ X0 > X0))).
% 0.30/0.41 thf(func_def_40, type, coindu1441602521_llist: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X0 > X1) > (X0 > X0) > X0 > coinductive_llist @ X1))).
% 0.30/0.41 thf(func_def_41, type, map_fun: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:(((X0 > X1) > (X2 > X3) > (X1 > X2) > X0 > X3))).
% 0.30/0.41 thf(func_def_42, type, plus_plus: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.30/0.41 thf(func_def_43, type, zero_zero: !>[X0: $tType]:(X0)).
% 0.30/0.41 thf(func_def_44, type, if: !>[X0: $tType]:(($o > X0 > X0 > X0))).
% 0.30/0.41 thf(func_def_45, type, lMirro999291890or_aux: !>[X0: $tType]:((coinductive_llist @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_46, type, case_nat: !>[X0: $tType]:((X0 > (nat > X0) > nat > X0))).
% 0.30/0.41 thf(func_def_47, type, rec_nat: !>[X0: $tType]:((X0 > (nat > X0 > X0) > nat > X0))).
% 0.30/0.41 thf(func_def_48, type, size_size: !>[X0: $tType]:((X0 > nat))).
% 0.30/0.41 thf(func_def_49, type, type: !>[X0: $tType]:(itself @ X0)).
% 0.30/0.41 thf(func_def_50, type, bex1_rel: !>[X0: $tType]:(((X0 > X0 > $o) > (X0 > $o) > $o))).
% 0.30/0.41 thf(func_def_51, type, quotient3: !>[X0: $tType, X1: $tType]:(((X0 > X0 > $o) > (X0 > X1) > (X1 > X0) > $o))).
% 0.30/0.41 thf(func_def_52, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 0.30/0.41 thf(func_def_53, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 0.30/0.41 thf(func_def_54, type, p: (a > b > $o)).
% 0.30/0.41 thf(func_def_55, type, acc_a: coinductive_llist @ b).
% 0.30/0.41 thf(func_def_56, type, acca: coinductive_llist @ a).
% 0.30/0.41 thf(func_def_57, type, xs_a: coinductive_llist @ b).
% 0.30/0.41 thf(func_def_58, type, xsa: coinductive_llist @ a).
% 0.30/0.41 thf(func_def_62, type, db1: !>[X0: $tType]:(X0)).
% 0.30/0.41 thf(func_def_63, type, db0: !>[X0: $tType]:(X0)).
% 0.30/0.41 thf(func_def_64, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.30/0.41 thf(func_def_65, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.30/0.41 thf(func_def_66, type, vAND: ($o > $o > $o)).
% 0.30/0.41 thf(func_def_67, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.30/0.41 thf(func_def_68, type, db4: !>[X0: $tType]:(X0)).
% 0.30/0.41 thf(func_def_69, type, db3: !>[X0: $tType]:(X0)).
% 0.30/0.41 thf(func_def_70, type, db2: !>[X0: $tType]:(X0)).
% 0.30/0.41 thf(func_def_71, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.30/0.41 thf(func_def_72, type, vIMP: ($o > $o > $o)).
% 0.30/0.41 thf(func_def_73, type, vNOT: ($o > $o)).
% 0.30/0.41 thf(func_def_74, type, sK0: !>[X0: $tType]:((coinductive_llist @ X0 > (X0 > $o) > X0))).
% 0.30/0.41 thf(func_def_75, type, sK1: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > coinductive_llist @ X0 > X0))).
% 0.30/0.41 thf(func_def_76, type, sK2: !>[X0: $tType]:(((X0 > $o) > coinductive_llist @ X0 > (X0 > $o) > X0))).
% 0.30/0.41 thf(func_def_77, type, sK3: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > X0 > $o) > (X0 > $o) > X1))).
% 0.30/0.41 thf(func_def_78, type, sK4: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > X0 > $o) > (X0 > $o) > X0))).
% 0.30/0.41 thf(func_def_79, type, sK5: !>[X0: $tType]:((coinductive_llist @ X0 > (X0 > $o) > X0))).
% 0.30/0.41 thf(func_def_80, type, sK6: !>[X0: $tType, X1: $tType]:((coinductive_llist @ X0 > (X1 > X0 > $o) > (X1 > X0 > $o) > coinductive_llist @ X1 > X1))).
% 0.30/0.41 thf(func_def_81, type, sK7: !>[X0: $tType, X1: $tType]:((coinductive_llist @ X0 > (X1 > X0 > $o) > (X1 > X0 > $o) > coinductive_llist @ X1 > X0))).
% 0.30/0.41 thf(func_def_82, type, sK8: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > (X1 > X0 > $o) > X0))).
% 0.30/0.41 thf(func_def_83, type, sK9: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > (X1 > X0 > $o) > X1))).
% 0.30/0.41 thf(func_def_84, type, sK10: !>[X0: $tType]:((coinductive_llist @ X0 > (X0 > $o) > X0))).
% 0.30/0.41 thf(func_def_85, type, sK11: !>[X0: $tType]:((coinductive_llist @ X0 > (X0 > X0 > $o) > X0))).
% 0.30/0.41 thf(func_def_86, type, sK12: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > coinductive_llist @ X1 > coinductive_llist @ X0 > (X1 > X0 > $o) > X0))).
% 0.30/0.41 thf(func_def_87, type, sK13: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > coinductive_llist @ X1 > coinductive_llist @ X0 > (X1 > X0 > $o) > X1))).
% 0.30/0.41 thf(func_def_88, type, sK14: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > coinductive_llist @ X0 > X0))).
% 0.30/0.41 thf(func_def_89, type, sK15: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:(((X3 > X1 > $o) > (X0 > X2 > $o) > (X2 > X1) > (X0 > X3) > X0))).
% 0.30/0.41 thf(func_def_90, type, sK16: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:(((X3 > X1 > $o) > (X0 > X2 > $o) > (X2 > X1) > (X0 > X3) > X2))).
% 0.30/0.41 thf(func_def_91, type, sK17: !>[X0: $tType]:((coinductive_llist @ X0 > X0 > (X0 > $o) > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_92, type, sK18: !>[X0: $tType]:((coinductive_llist @ X0 > X0 > (X0 > $o) > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_93, type, sK19: !>[X0: $tType]:((coinductive_llist @ X0 > coinductive_llist @ X0 > X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_94, type, sK20: !>[X0: $tType, X1: $tType]:((coinductive_llist @ X0 > (X0 > X1 > $o) > X1 > X0))).
% 0.30/0.41 thf(func_def_95, type, sK21: !>[X0: $tType, X1: $tType]:((coinductive_llist @ X1 > X0 > coinductive_llist @ X0 > (X1 > X0 > $o) > coinductive_llist @ X1))).
% 0.30/0.41 thf(func_def_96, type, sK22: !>[X0: $tType, X1: $tType]:((coinductive_llist @ X1 > X0 > coinductive_llist @ X0 > (X1 > X0 > $o) > X1))).
% 0.30/0.41 thf(func_def_97, type, sK23: ((nat > nat > $o) > nat)).
% 0.30/0.41 thf(func_def_98, type, sK24: ((nat > nat > $o) > nat)).
% 0.30/0.41 thf(func_def_99, type, sK25: ((nat > nat > $o) > nat)).
% 0.30/0.41 thf(func_def_100, type, sK26: ((nat > nat > $o) > nat)).
% 0.30/0.41 thf(func_def_101, type, sK27: ((nat > nat > $o) > nat)).
% 0.30/0.41 thf(func_def_102, type, sK28: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.30/0.41 thf(func_def_103, type, sK29: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X0 > X1 > $o) > (X1 > $o) > X0))).
% 0.30/0.41 thf(func_def_104, type, sK30: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X0 > X1 > $o) > (X1 > $o) > X1))).
% 0.30/0.41 thf(func_def_105, type, sK31: !>[X0: $tType, X1: $tType]:(((X0 > X1) > (X0 > X1) > X0))).
% 0.30/0.41 thf(func_def_106, type, sK32: !>[X0: $tType]:((coinductive_llist @ X0 > X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_107, type, sK33: !>[X0: $tType]:((coinductive_llist @ X0 > X0 > X0))).
% 0.30/0.41 thf(func_def_108, type, sK34: !>[X0: $tType]:((coinductive_llist @ X0 > X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_109, type, sK35: !>[X0: $tType]:(((X0 > X0 > $o) > coinductive_llist @ X0 > X0))).
% 0.30/0.41 thf(func_def_110, type, sK36: !>[X0: $tType]:(((X0 > $o) > (X0 > X0 > $o) > (X0 > $o) > X0))).
% 0.30/0.41 thf(func_def_111, type, sK37: !>[X0: $tType]:(((X0 > $o) > (X0 > X0 > $o) > (X0 > $o) > X0))).
% 0.30/0.41 thf(func_def_112, type, sK38: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > coinductive_llist @ X1 > coinductive_llist @ X0 > X1 > X0))).
% 0.30/0.41 thf(func_def_113, type, sK39: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > coinductive_llist @ X1 > coinductive_llist @ X0 > X1 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_114, type, sK40: !>[X0: $tType]:(((X0 > $o) > coinductive_llist @ X0 > (X0 > $o) > X0))).
% 0.30/0.41 thf(func_def_115, type, sK41: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > coinductive_llist @ X1 > X1))).
% 0.30/0.41 thf(func_def_116, type, sK42: !>[X0: $tType]:((coinductive_llist @ X0 > X0 > X0))).
% 0.30/0.41 thf(func_def_117, type, sK43: !>[X0: $tType]:((coinductive_llist @ X0 > X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_118, type, sK44: !>[X0: $tType]:((coinductive_llist @ X0 > X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_119, type, sK45: !>[X0: $tType]:((X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_120, type, sK46: !>[X0: $tType]:((X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_121, type, sK47: !>[X0: $tType, X1: $tType]:(((X0 > X1) > (X1 > X0) > X1))).
% 0.30/0.41 thf(func_def_122, type, sK48: !>[X0: $tType, X1: $tType]:(((X0 > X0 > $o) > (X1 > X0) > X1))).
% 0.30/0.41 thf(func_def_123, type, sK49: !>[X0: $tType, X1: $tType]:(((X0 > X0 > $o) > (X0 > X1) > X0))).
% 0.30/0.41 thf(func_def_124, type, sK50: !>[X0: $tType, X1: $tType]:(((X0 > X0 > $o) > (X0 > X1) > X0))).
% 0.30/0.41 thf(func_def_125, type, sK51: !>[X0: $tType]:(((X0 > $o) > coinductive_llist @ X0 > X0))).
% 0.30/0.41 thf(func_def_126, type, sK52: !>[X0: $tType]:((coinductive_llist @ X0 > X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_127, type, sK53: !>[X0: $tType]:((coinductive_llist @ X0 > X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_128, type, sK54: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > (X1 > X0 > $o) > X0))).
% 0.30/0.41 thf(func_def_129, type, sK55: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > (X1 > X0 > $o) > X1))).
% 0.30/0.41 thf(func_def_130, type, sK56: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > (X0 > X1 > $o) > X0))).
% 0.30/0.41 thf(func_def_131, type, sK57: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > (X0 > X1 > $o) > X1))).
% 0.30/0.41 thf(func_def_132, type, sK58: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > coinductive_llist @ X1 > X1))).
% 0.30/0.41 thf(func_def_133, type, sK59: !>[X0: $tType]:((coinductive_llist @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_134, type, sK60: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > (X0 > X1 > $o) > X0))).
% 0.30/0.41 thf(func_def_135, type, sK61: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > (X0 > X1 > $o) > X1))).
% 0.30/0.41 thf(func_def_136, type, sK62: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > (X0 > X1 > $o) > X1))).
% 0.30/0.41 thf(func_def_137, type, sK63: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > (X0 > X1 > $o) > X0))).
% 0.30/0.41 thf(func_def_138, type, sK64: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X1 > $o) > (X1 > X0 > $o) > X1))).
% 0.30/0.41 thf(func_def_139, type, sK65: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X1 > $o) > (X1 > X0 > $o) > X0))).
% 0.30/0.41 thf(func_def_140, type, sK66: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_141, type, sK67: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > X0 > X0))).
% 0.30/0.41 thf(func_def_142, type, sK68: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_143, type, sK69: !>[X0: $tType]:(((X0 > $o) > coinductive_llist @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_144, type, sK70: !>[X0: $tType]:(((X0 > $o) > coinductive_llist @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.30/0.41 thf(func_def_145, type, sK71: !>[X0: $tType]:(((X0 > X0) > (X0 > coinductive_llist @ X0) > X0))).
% 0.30/0.41 thf(func_def_146, type, sK72: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.30/0.41 thf(func_def_147, type, sK73: !>[X0: $tType]:(((X0 > coinductive_llist @ X0 > $o) > X0))).
% 0.30/0.42 thf(func_def_148, type, sK74: !>[X0: $tType]:(((X0 > coinductive_llist @ X0 > $o) > coinductive_llist @ X0))).
% 0.30/0.42 thf(func_def_149, type, sK75: !>[X0: $tType]:(((X0 > coinductive_llist @ X0 > $o) > coinductive_llist @ X0))).
% 0.30/0.42 thf(func_def_150, type, sK76: !>[X0: $tType]:(((X0 > coinductive_llist @ X0 > $o) > X0))).
% 0.30/0.42 thf(func_def_151, type, sK77: !>[X0: $tType]:(((X0 > coinductive_llist @ X0 > $o) > X0))).
% 0.30/0.42 thf(func_def_152, type, sK78: !>[X0: $tType, X1: $tType]:((X1 > coinductive_llist @ X0 > coinductive_llist @ X1 > (X0 > X1) > X0))).
% 0.30/0.42 thf(func_def_153, type, sK79: !>[X0: $tType, X1: $tType]:((X1 > coinductive_llist @ X0 > coinductive_llist @ X1 > (X0 > X1) > coinductive_llist @ X0))).
% 0.30/0.42 thf(func_def_154, type, sK80: !>[X0: $tType]:(((X0 > $o) > (X0 > X0 > $o) > (X0 > $o) > X0))).
% 0.30/0.42 thf(func_def_155, type, sK81: !>[X0: $tType]:(((X0 > $o) > (X0 > X0 > $o) > (X0 > $o) > X0))).
% 0.30/0.42 thf(func_def_156, type, sK82: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType]:(((X3 > X5 > $o) > (X2 > X0 > $o) > (X1 > X3 > X2) > (X1 > X4 > $o) > (X4 > X5 > X0) > X1))).
% 0.30/0.42 thf(func_def_157, type, sK83: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType]:(((X3 > X5 > $o) > (X2 > X0 > $o) > (X1 > X3 > X2) > (X1 > X4 > $o) > (X4 > X5 > X0) > X4))).
% 0.30/0.42 thf(func_def_158, type, sK84: !>[X0: $tType, X1: $tType]:(((X0 > X0 > $o) > (X1 > X0 > $o) > (X1 > X1 > $o) > X0))).
% 0.30/0.42 thf(func_def_159, type, sK85: !>[X0: $tType, X1: $tType]:(((X0 > X0 > $o) > (X1 > X0 > $o) > (X1 > X1 > $o) > X1))).
% 0.30/0.42 thf(func_def_160, type, sK86: !>[X0: $tType, X1: $tType]:(((X0 > X0 > $o) > (X1 > X0 > $o) > (X1 > X1 > $o) > X0))).
% 0.30/0.42 thf(func_def_161, type, sK87: !>[X0: $tType, X1: $tType]:(((X0 > X0 > $o) > (X1 > X0 > $o) > (X1 > X1 > $o) > X1))).
% 0.30/0.42 thf(func_def_162, type, sK88: !>[X0: $tType]:((X0 > (coinductive_llist @ X0 > $o) > coinductive_llist @ X0))).
% 0.30/0.42 thf(func_def_163, type, sK89: !>[X0: $tType]:((X0 > (coinductive_llist @ X0 > $o) > X0))).
% 0.30/0.42 thf(func_def_164, type, sK90: !>[X0: $tType]:((X0 > (coinductive_llist @ X0 > $o) > coinductive_llist @ X0))).
% 0.30/0.42 thf(func_def_165, type, sK91: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > coinductive_llist @ X0 > X0))).
% 0.30/0.42 thf(func_def_166, type, sK92: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.30/0.42 thf(func_def_167, type, sK93: !>[X0: $tType]:((coinductive_llist @ X0 > (X0 > X0 > $o) > X0))).
% 0.30/0.42 thf(func_def_168, type, sK94: !>[X0: $tType, X1: $tType]:((X1 > coinductive_llist @ X0 > (X1 > X0 > $o) > X0))).
% 0.30/0.42 thf(func_def_169, type, sK95: !>[X0: $tType, X1: $tType]:(((X0 > X1) > coinductive_llist @ X0 > (X0 > X1) > coinductive_llist @ X0 > X0))).
% 0.30/0.42 thf(func_def_170, type, sK96: !>[X0: $tType, X1: $tType]:(((X0 > X1) > coinductive_llist @ X0 > (X0 > X1) > coinductive_llist @ X0 > X0))).
% 0.30/0.42 thf(f1,axiom,(
% 0.30/0.42 (coindu1486289336t_all2 @ a @ b @ p @ acca @ acc_a)),
% 0.30/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_local_OLNil_I2_J)).
% 0.30/0.42 thf(f5,axiom,(
% 0.30/0.42 ! [X0 : $tType,X1 : $tType,X4 : coinductive_llist @ X1,X2 : (X0 > X1 > $o),X3 : coinductive_llist @ X0] : ((coindu1486289336t_all2 @ X0 @ X1 @ X2 @ X3 @ X4) => (((coinductive_llength @ X0 @ X3)) = ((coinductive_llength @ X1 @ X4))))),
% 0.30/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4_llist__all2__llengthD)).
% 0.30/0.42 thf(f286,conjecture,(
% 0.30/0.42 (((coinductive_llength @ a @ acca)) = ((coinductive_llength @ b @ acc_a)))),
% 0.30/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0)).
% 0.30/0.42 thf(f287,negated_conjecture,(
% 0.30/0.42 ~ (((coinductive_llength @ a @ acca)) = ((coinductive_llength @ b @ acc_a)))),
% 0.30/0.42 inference(negated_conjecture,[status(cth)],[f286])).
% 0.30/0.42 thf(f476,plain,(
% 0.30/0.42 ! [X0 : $tType,X1 : $tType,X2 : coinductive_llist @ X1,X3 : (X0 > X1 > $o),X4 : coinductive_llist @ X0] : ((coindu1486289336t_all2 @ X0 @ X1 @ X3 @ X4 @ X2) => (((coinductive_llength @ X1 @ X2)) = ((coinductive_llength @ X0 @ X4))))),
% 0.30/0.42 inference(rectify,[],[f5])).
% 0.30/0.42 thf(f477,plain,(
% 0.30/0.42 ! [X0 : $tType,X1 : $tType,X4 : coinductive_llist @ X0,X3 : (X0 > X1 > $o),X2 : coinductive_llist @ X1] : (($true = ((coindu1486289336t_all2 @ X0 @ X1 @ X3 @ X4 @ X2))) => (((coinductive_llength @ X1 @ X2)) = ((coinductive_llength @ X0 @ X4))))),
% 0.30/0.42 inference(fool_elimination,[],[f476])).
% 0.30/0.42 thf(f490,plain,(
% 0.30/0.42 (coindu1486289336t_all2 @ a @ b @ p @ acca @ acc_a)),
% 0.30/0.42 inference(rectify,[],[f1])).
% 0.30/0.42 thf(f491,plain,(
% 0.30/0.42 (((coindu1486289336t_all2 @ a @ b @ p @ acca @ acc_a)) = $true)),
% 0.30/0.42 inference(fool_elimination,[],[f490])).
% 0.30/0.42 thf(f771,plain,(
% 0.30/0.42 (((coinductive_llength @ a @ acca)) != ((coinductive_llength @ b @ acc_a)))),
% 0.30/0.42 inference(flattening,[],[f287])).
% 0.30/0.42 thf(f913,plain,(
% 0.30/0.42 ! [X1 : $tType,X0 : $tType,X3 : (X0 > X1 > $o),X2 : coinductive_llist @ X1,X4 : coinductive_llist @ X0] : (($true != ((coindu1486289336t_all2 @ X0 @ X1 @ X3 @ X4 @ X2))) | (((coinductive_llength @ X1 @ X2)) = ((coinductive_llength @ X0 @ X4))))),
% 0.30/0.42 inference(ennf_transformation,[],[f477])).
% 0.30/0.42 thf(f1143,plain,(
% 0.30/0.42 ! [X0 : $tType,X1 : $tType,X2 : (X1 > X0 > $o),X3 : coinductive_llist @ X0,X4 : coinductive_llist @ X1] : ((((coindu1486289336t_all2 @ X1 @ X0 @ X2 @ X4 @ X3)) != $true) | (((coinductive_llength @ X0 @ X3)) = ((coinductive_llength @ X1 @ X4))))),
% 0.30/0.42 inference(rectify,[],[f913])).
% 0.30/0.42 thf(f1367,plain,(
% 0.30/0.42 (((coindu1486289336t_all2 @ a @ b @ p @ acca @ acc_a)) = $true)),
% 0.30/0.42 inference(cnf_transformation,[],[f491])).
% 0.30/0.42 thf(f1480,plain,(
% 0.30/0.42 ( ! [X1 : $tType,X0 : $tType,X2 : (X1 > X0 > $o),X3 : coinductive_llist @ X0,X4 : coinductive_llist @ X1] : ((((coindu1486289336t_all2 @ X1 @ X0 @ X2 @ X4 @ X3)) != $true) | (((coinductive_llength @ X0 @ X3)) = ((coinductive_llength @ X1 @ X4)))) )),
% 0.30/0.42 inference(cnf_transformation,[],[f1143])).
% 0.30/0.42 thf(f1562,plain,(
% 0.30/0.42 (((coinductive_llength @ a @ acca)) != ((coinductive_llength @ b @ acc_a)))),
% 0.30/0.42 inference(cnf_transformation,[],[f771])).
% 0.30/0.42 thf(f1902,definition,(
% 0.30/0.42 spl97_11 <=> (((coinductive_llength @ a @ acca)) = ((coinductive_llength @ b @ acc_a)))),
% 0.30/0.42 introduced(definition,[new_symbols(definition,[spl97_11])],[avatar_definition])).
% 0.30/0.42 thf(f1904,plain,(
% 0.30/0.42 (((coinductive_llength @ a @ acca)) != ((coinductive_llength @ b @ acc_a))) | spl97_11),
% 0.30/0.42 inference(avatar_component_clause,[],[f1902])).
% 0.30/0.42 thf(f1905,plain,(
% 0.30/0.42 ~spl97_11),
% 0.30/0.42 inference(avatar_split_clause,[],[f1562,f1902])).
% 0.30/0.42 thf(f2012,definition,(
% 0.30/0.42 spl97_33 <=> (((coindu1486289336t_all2 @ a @ b @ p @ acca @ acc_a)) = $true)),
% 0.30/0.42 introduced(definition,[new_symbols(definition,[spl97_33])],[avatar_definition])).
% 0.30/0.42 thf(f2014,plain,(
% 0.30/0.42 (((coindu1486289336t_all2 @ a @ b @ p @ acca @ acc_a)) = $true) | ~spl97_33),
% 0.30/0.42 inference(avatar_component_clause,[],[f2012])).
% 0.30/0.42 thf(f2015,plain,(
% 0.30/0.42 spl97_33),
% 0.30/0.42 inference(avatar_split_clause,[],[f1367,f2012])).
% 0.30/0.42 thf(f2051,plain,(
% 0.30/0.42 ($true != $true) | (((coinductive_llength @ a @ acca)) = ((coinductive_llength @ b @ acc_a))) | ~spl97_33),
% 0.30/0.42 inference(superposition,[],[f1480,f2014])).
% 0.30/0.42 thf(f2052,plain,(
% 0.30/0.42 (((coinductive_llength @ a @ acca)) = ((coinductive_llength @ b @ acc_a))) | ~spl97_33),
% 0.30/0.42 inference(trivial_inequality_removal,[],[f2051])).
% 0.30/0.42 thf(f2053,plain,(
% 0.30/0.42 $false | (spl97_11 | ~spl97_33)),
% 0.30/0.42 inference(forward_subsumption_resolution,[],[f2052,f1904])).
% 0.30/0.42 thf(f2054,plain,(
% 0.30/0.42 spl97_11 | ~spl97_33),
% 0.30/0.42 inference(avatar_contradiction_clause,[],[f2053])).
% 0.30/0.42 cnf(s11, plain, ~spl97_11, inference(sat_conversion,[],[f1905])).
% 0.30/0.42 cnf(s33, plain, spl97_33, inference(sat_conversion,[],[f2015])).
% 0.30/0.42 cnf(s38, plain, spl97_11 | ~spl97_33, inference(sat_conversion,[],[f2054])).
% 0.30/0.42 cnf(s39, plain, spl97_11, inference(rat,[],[s38,s33])).
% 0.30/0.42 cnf(s40, plain, $false, inference(rat,[],[s11,s39])).
% 0.30/0.42 thf(f2055,plain,(
% 0.30/0.42 $false),
% 0.30/0.42 inference(avatar_sat_refutation,[],[s40])).
% 0.30/0.42 % SZS output end Proof for theBenchmark
% 0.30/0.42 % (159827)------------------------------
% 0.30/0.42 % (159827)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.42 % (159827)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.42 % (159827)CaDiCaL version: 2.1.3
% 0.30/0.42 % (159827)Termination reason: Refutation
% 0.30/0.42 % (159827)Time elapsed: 0.051 s
% 0.30/0.42 % (159827)Peak memory usage: 15 MB
% 0.30/0.42 % (159827)Instructions burned: 194 (million)
% 0.30/0.42 % (159819)Success in time 0.108 s
% 0.30/0.42 % Vampire exiting
%------------------------------------------------------------------------------