%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT177^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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:49:00 AM UTC 2026
% Result : Theorem 5.30s 1.11s
% Output : Refutation 5.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : DAT177^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24 % Computer : n018.cluster.edu
% 0.09/0.24 % Model : x86_64 x86_64
% 0.09/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.24 % Memory : 8046.5625MB
% 0.09/0.24 % OS : Linux 6.8.0-71-generic
% 0.09/0.24 % CPULimit : 300
% 0.09/0.24 % WCLimit : 300
% 0.09/0.24 % DateTime : Tue Sep 29 18:08:26 UTC 2026
% 0.09/0.24 % CPUTime :
% 0.09/0.24 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.29 Running first-order model finding
% 0.09/0.29 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.30/1.11 % (440398)Will run a generic schedule for satisfiability detection.
% 5.30/1.11 % (440409)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3726337228:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 5.30/1.11 % (440404)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2932950785_2999 on theBenchmark for (2999ds/0Mi)
% 5.30/1.11 % (440405)% WARNING: option uhcvi not known.
% 5.30/1.11 % (440405)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3935033855:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 5.30/1.11 % (440406)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=575001022:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 5.30/1.11 % (440408)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1740949651:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 5.30/1.11 % (440407)dis+10_1_sil=32000:sp=arity:random_seed=631887151:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 5.30/1.11 % (440410)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1247234089:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 5.30/1.11 % (440405)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.30/1.11 % (440408)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.30/1.11 % (440409)Instruction limit reached!
% 5.30/1.11 % (440409)------------------------------
% 5.30/1.11 % (440409)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.30/1.11 % (440409)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.30/1.11 % (440409)CaDiCaL version: 2.1.3
% 5.30/1.11 % (440409)Termination reason: Instruction limit
% 5.30/1.11 % (440409)Termination phase: Saturation
% 5.30/1.11 % (440409)Time elapsed: 0.057 s
% 5.30/1.11 % (440409)Peak memory usage: 13 MB
% 5.30/1.11 % (440409)Instructions burned: 133 (million)
% 5.30/1.11 % Exception at run slice level
% 5.30/1.11 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.30/1.11 % (440405)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 5.30/1.11 % (440423)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=715214285:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 5.30/1.11 % (440424)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3230018240:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 5.30/1.11 % (440407)Instruction limit reached!
% 5.30/1.11 % (440407)------------------------------
% 5.30/1.11 % (440407)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.30/1.11 % (440407)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.30/1.11 % (440407)CaDiCaL version: 2.1.3
% 5.30/1.11 % (440407)Termination reason: Instruction limit
% 5.30/1.11 % (440407)Termination phase: Saturation
% 5.30/1.11 % (440407)Time elapsed: 0.083 s
% 5.30/1.11 % (440407)Peak memory usage: 12 MB
% 5.30/1.11 % (440407)Instructions burned: 103 (million)
% 5.30/1.11 % Exception at run slice level
% 5.30/1.11 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.30/1.11 % (440408)Instruction limit reached!
% 5.30/1.11 % (440408)------------------------------
% 5.30/1.11 % (440408)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.30/1.11 % (440408)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.30/1.11 % (440408)CaDiCaL version: 2.1.3
% 5.30/1.11 % (440408)Termination reason: Instruction limit
% 5.30/1.11 % (440408)Termination phase: Saturation
% 5.30/1.11 % (440408)Time elapsed: 0.096 s
% 5.30/1.11 % (440408)Peak memory usage: 13 MB
% 5.30/1.11 % (440408)Instructions burned: 117 (million)
% 5.30/1.11 % (440436)ott-21_1_sil=16000:fs=off:random_seed=3425525250:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 5.30/1.11 % (440433)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=12957130:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 5.30/1.11 % (440437)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=4209018851:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 5.30/1.11 % (440410)Instruction limit reached!
% 5.30/1.11 % (440410)------------------------------
% 5.30/1.11 % (440410)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.30/1.11 % (440410)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.30/1.11 % (440410)CaDiCaL version: 2.1.3
% 5.30/1.11 % (440410)Termination reason: Instruction limit
% 5.30/1.11 % (440410)Termination phase: Saturation
% 5.30/1.11 % (440410)Time elapsed: 0.135 s
% 5.30/1.11 % (440410)Peak memory usage: 13 MB
% 5.30/1.11 % (440410)Instructions burned: 159 (million)
% 5.30/1.11 % (440433)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.30/1.11 % (440444)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1486713202:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 5.30/1.11 % (440424)Instruction limit reached!
% 5.30/1.11 % (440424)------------------------------
% 5.30/1.11 % (440424)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.30/1.11 % (440424)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.30/1.11 % (440424)CaDiCaL version: 2.1.3
% 5.30/1.11 % (440424)Termination reason: Instruction limit
% 5.30/1.11 % (440424)Termination phase: Saturation
% 5.30/1.11 % (440424)Time elapsed: 0.100 s
% 5.30/1.11 % (440424)Peak memory usage: 13 MB
% 5.30/1.11 % (440424)Instructions burned: 131 (million)
% 5.30/1.11 % (440433)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 5.30/1.11 % (440436)Instruction limit reached!
% 5.30/1.11 % (440436)------------------------------
% 5.30/1.11 % (440436)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.30/1.11 % (440436)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.30/1.11 % (440436)CaDiCaL version: 2.1.3
% 5.30/1.11 % (440436)Termination reason: Instruction limit
% 5.30/1.11 % (440436)Termination phase: Saturation
% 5.30/1.11 % (440436)Time elapsed: 0.078 s
% 5.30/1.11 % (440436)Peak memory usage: 13 MB
% 5.30/1.11 % (440436)Instructions burned: 182 (million)
% 5.30/1.11 % Exception at run slice level
% 5.30/1.11 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.30/1.11 % (440447)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1478242914:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 5.30/1.11 % (440450)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=799443664:i=889:ins=1_2997 on theBenchmark for (2997ds/889Mi)
% 5.30/1.11 % (440452)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=2578489709:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2997 on theBenchmark for (2997ds/692Mi)
% 5.30/1.11 % Exception at run slice level
% 5.30/1.11 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.30/1.11 % (440452)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.30/1.11 % (440456)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1874818206:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 5.30/1.11 % (440456)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.30/1.11 % (440437)Instruction limit reached!
% 5.30/1.11 % (440437)------------------------------
% 5.30/1.11 % (440437)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.30/1.11 % (440437)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.30/1.11 % (440437)CaDiCaL version: 2.1.3
% 5.30/1.11 % (440437)Termination reason: Instruction limit
% 5.30/1.11 % (440437)Termination phase: Saturation
% 5.30/1.11 % (440437)Time elapsed: 0.451 s
% 5.30/1.11 % (440437)Peak memory usage: 14 MB
% 5.30/1.11 % (440437)Instructions burned: 477 (million)
% 5.30/1.11 % (440472)fmb+10_1_sil=64000:random_seed=559952445:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 5.30/1.11 % (440472)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 5.30/1.11 % Exception at run slice level
% 5.30/1.11 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.30/1.11 % (440475)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1323804159:i=9515:nm=5_2992 on theBenchmark for (2992ds/9515Mi)
% 5.30/1.11 % (440433)Instruction limit reached!
% 5.30/1.11 % (440433)------------------------------
% 5.30/1.11 % (440433)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.30/1.11 % (440433)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.30/1.11 % (440433)CaDiCaL version: 2.1.3
% 5.30/1.11 % (440433)Termination reason: Instruction limit
% 5.30/1.11 % (440433)Termination phase: Saturation
% 5.30/1.11 % (440433)Time elapsed: 0.602 s
% 5.30/1.11 % (440433)Peak memory usage: 16 MB
% 5.30/1.11 % (440433)Instructions burned: 684 (million)
% 5.30/1.11 % (440480)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2227838628:fmbsr=1.7:i=920_2992 on theBenchmark for (2992ds/920Mi)
% 5.30/1.11 % (440456)Instruction limit reached!
% 5.30/1.11 % (440456)------------------------------
% 5.30/1.11 % (440456)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.30/1.11 % (440456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.30/1.11 % (440456)CaDiCaL version: 2.1.3
% 5.30/1.11 % (440456)Termination reason: Instruction limit
% 5.30/1.11 % (440456)Termination phase: Saturation
% 5.30/1.11 % (440456)Time elapsed: 0.487 s
% 5.30/1.11 % (440456)Peak memory usage: 18 MB
% 5.30/1.11 % (440456)Instructions burned: 880 (million)
% 5.30/1.11 % (440405) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-440398-440405"...
% 5.30/1.11 % (440405)...printing done.
% 5.30/1.11 % Exception at run slice level
% 5.30/1.11 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.30/1.11 % (440405)Refutation found. Thanks to Tanya!
% 5.30/1.11 % SZS status Theorem for theBenchmark
% 5.30/1.11 % SZS output start Proof for theBenchmark
% 5.30/1.11 thf(type_def_5, type, coinductive_llist: $tType > $tType).
% 5.30/1.11 thf(type_def_6, type, set: $tType > $tType).
% 5.30/1.11 thf(type_def_7, type, itself: $tType > $tType).
% 5.30/1.11 thf(type_def_8, type, a: $tType).
% 5.30/1.11 thf(type_def_9, type, sTfun: ($tType * $tType) > $tType).
% 5.30/1.11 thf(func_def_0, type, bounded_lattice: !>[X0: $tType]:((itself @ X0 > $o))).
% 5.30/1.11 thf(func_def_1, type, type: !>[X0: $tType]:((itself @ X0 > $o))).
% 5.30/1.11 thf(func_def_2, type, bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 5.30/1.11 thf(func_def_3, type, top: !>[X0: $tType]:((itself @ X0 > $o))).
% 5.30/1.11 thf(func_def_4, type, bounded_lattice_bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 5.30/1.11 thf(func_def_5, type, bounded_lattice_top: !>[X0: $tType]:((itself @ X0 > $o))).
% 5.30/1.11 thf(func_def_6, type, topolo890362671_space: !>[X0: $tType]:((itself @ X0 > $o))).
% 5.30/1.11 thf(func_def_7, type, topolo47006728_space: !>[X0: $tType]:((itself @ X0 > $o))).
% 5.30/1.11 thf(func_def_8, type, bounde1561333602nf_top: !>[X0: $tType]:((itself @ X0 > $o))).
% 5.30/1.11 thf(func_def_9, type, bounde1808546759up_bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 5.30/1.11 thf(func_def_10, type, coindu328551480prefix: !>[X0: $tType]:((coinductive_llist @ X0 > coinductive_llist @ X0 > $o))).
% 5.30/1.11 thf(func_def_11, type, coinductive_gen_lset: !>[X0: $tType]:((set @ X0 > coinductive_llist @ X0 > set @ X0))).
% 5.30/1.11 thf(func_def_12, type, coinductive_lSup: !>[X0: $tType]:((set @ coinductive_llist @ X0 > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_13, type, coinductive_lappend: !>[X0: $tType]:((coinductive_llist @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_14, type, coinductive_lfinite: !>[X0: $tType]:((coinductive_llist @ X0 > $o))).
% 5.30/1.11 thf(func_def_15, type, coinductive_llast: !>[X0: $tType]:((coinductive_llist @ X0 > X0))).
% 5.30/1.11 thf(func_def_16, type, coinductive_LCons: !>[X0: $tType]:((X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_17, type, coinductive_LNil: !>[X0: $tType]:(coinductive_llist @ X0)).
% 5.30/1.11 thf(func_def_18, type, coindu1478340336prefix: !>[X0: $tType]:((coinductive_llist @ X0 > coinductive_llist @ X0 > $o))).
% 5.30/1.11 thf(func_def_19, type, minus_minus: !>[X0: $tType]:((X0 > X0 > X0))).
% 5.30/1.11 thf(func_def_20, type, lList2435255213lllsts: !>[X0: $tType]:((set @ X0 > set @ coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_21, type, lList2236698231inlsts: !>[X0: $tType]:((set @ X0 > set @ coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_22, type, lList21916056377ts_rec: !>[X0: $tType, X1: $tType]:((X0 > (X1 > coinductive_llist @ X1 > X0 > X0) > coinductive_llist @ X1 > X0))).
% 5.30/1.11 thf(func_def_23, type, lList22096119349pslsts: !>[X0: $tType]:((set @ X0 > set @ coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_24, type, lList21612149805nflsts: !>[X0: $tType]:((set @ X0 > set @ coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_25, type, lList21148268032oslsts: !>[X0: $tType]:((set @ X0 > set @ coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_26, type, inf_inf: !>[X0: $tType]:((X0 > X0 > X0))).
% 5.30/1.11 thf(func_def_27, type, sup_sup: !>[X0: $tType]:((X0 > X0 > X0))).
% 5.30/1.11 thf(func_def_28, type, bot_bot: !>[X0: $tType]:(X0)).
% 5.30/1.11 thf(func_def_29, type, top_top: !>[X0: $tType]:(X0)).
% 5.30/1.11 thf(func_def_30, type, type2: !>[X0: $tType]:(itself @ X0)).
% 5.30/1.11 thf(func_def_31, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 5.30/1.11 thf(func_def_32, type, insert: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 5.30/1.11 thf(func_def_33, type, is_empty: !>[X0: $tType]:((set @ X0 > $o))).
% 5.30/1.11 thf(func_def_34, type, is_singleton: !>[X0: $tType]:((set @ X0 > $o))).
% 5.30/1.11 thf(func_def_35, type, pairwise: !>[X0: $tType]:(((X0 > X0 > $o) > set @ X0 > $o))).
% 5.30/1.11 thf(func_def_36, type, remove: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 5.30/1.11 thf(func_def_37, type, the_elem: !>[X0: $tType]:((set @ X0 > X0))).
% 5.30/1.11 thf(func_def_38, type, topolo406746546ounded: !>[X0: $tType]:((set @ X0 > $o))).
% 5.30/1.11 thf(func_def_39, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 5.30/1.11 thf(func_def_40, type, a2: set @ a).
% 5.30/1.11 thf(func_def_41, type, l: coinductive_llist @ a).
% 5.30/1.11 thf(func_def_42, type, r: coinductive_llist @ a).
% 5.30/1.11 thf(func_def_43, type, sa: coinductive_llist @ a).
% 5.30/1.11 thf(func_def_47, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 5.30/1.11 thf(func_def_48, type, vAND: ($o > $o > $o)).
% 5.30/1.11 thf(func_def_49, type, vNOT: ($o > $o)).
% 5.30/1.11 thf(func_def_50, type, vOR: ($o > $o > $o)).
% 5.30/1.11 thf(func_def_51, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 5.30/1.11 thf(func_def_52, type, db1: !>[X0: $tType]:(X0)).
% 5.30/1.11 thf(func_def_53, type, db0: !>[X0: $tType]:(X0)).
% 5.30/1.11 thf(func_def_54, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 5.30/1.11 thf(func_def_55, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 5.30/1.11 thf(func_def_56, type, vIMP: ($o > $o > $o)).
% 5.30/1.11 thf(func_def_57, type, db2: !>[X0: $tType]:(X0)).
% 5.30/1.11 thf(func_def_58, type, db3: !>[X0: $tType]:(X0)).
% 5.30/1.11 thf(func_def_59, type, sK0: !>[X0: $tType]:((set @ X0 > coinductive_llist @ X0 > X0))).
% 5.30/1.11 thf(func_def_60, type, sK1: !>[X0: $tType]:((set @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_61, type, sK2: !>[X0: $tType]:((coinductive_llist @ X0 > X0))).
% 5.30/1.11 thf(func_def_62, type, sK3: !>[X0: $tType]:((coinductive_llist @ X0 > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_63, type, sK4: !>[X0: $tType]:((set @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_64, type, sK5: !>[X0: $tType]:((set @ X0 > coinductive_llist @ X0 > X0))).
% 5.30/1.11 thf(func_def_65, type, sK6: !>[X0: $tType]:((set @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_66, type, sK7: !>[X0: $tType]:((set @ X0 > coinductive_llist @ X0 > X0))).
% 5.30/1.11 thf(func_def_67, type, sK8: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_68, type, sK9: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > set @ X0 > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_69, type, sK10: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_70, type, sK11: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > set @ X0 > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_71, type, sK12: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_72, type, sK13: !>[X0: $tType]:((set @ X0 > (coinductive_llist @ X0 > $o) > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_73, type, sK14: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 5.30/1.11 thf(func_def_74, type, sK15: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 5.30/1.11 thf(func_def_75, type, sK16: !>[X0: $tType]:((set @ X0 > X0))).
% 5.30/1.11 thf(func_def_76, type, sK17: !>[X0: $tType]:(X0)).
% 5.30/1.11 thf(func_def_77, type, sK18: !>[X0: $tType]:((set @ X0 > X0))).
% 5.30/1.11 thf(func_def_78, type, sK19: !>[X0: $tType]:((set @ X0 > coinductive_llist @ X0 > X0))).
% 5.30/1.11 thf(func_def_79, type, sK20: !>[X0: $tType]:((set @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_80, type, sK21: !>[X0: $tType]:((set @ X0 > X0 > set @ X0))).
% 5.30/1.11 thf(func_def_81, type, sK22: !>[X0: $tType]:((set @ X0 > X0 > set @ X0))).
% 5.30/1.11 thf(func_def_82, type, sK23: !>[X0: $tType]:((set @ X0 > X0))).
% 5.30/1.11 thf(func_def_83, type, sK24: !>[X0: $tType]:((set @ X0 > X0))).
% 5.30/1.11 thf(func_def_84, type, sK25: !>[X0: $tType]:((set @ X0 > X0))).
% 5.30/1.11 thf(func_def_85, type, sK26: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_86, type, sK27: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_87, type, sK28: !>[X0: $tType]:((coinductive_llist @ X0 > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_88, type, sK29: !>[X0: $tType]:((coinductive_llist @ X0 > X0))).
% 5.30/1.11 thf(func_def_89, type, sK30: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_90, type, sK31: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > X0))).
% 5.30/1.11 thf(func_def_91, type, sK32: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > X0))).
% 5.30/1.11 thf(func_def_92, type, sK33: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_93, type, sK34: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > X0))).
% 5.30/1.11 thf(func_def_94, type, sK35: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_95, type, sK36: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_96, type, sK37: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_97, type, sK38: !>[X0: $tType]:(((X0 > $o) > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_98, type, sK39: !>[X0: $tType]:(((X0 > $o) > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_99, type, sK40: !>[X0: $tType]:((set @ X0 > set @ X0 > (X0 > $o) > X0))).
% 5.30/1.11 thf(func_def_100, type, sK41: !>[X0: $tType]:((set @ X0 > (X0 > $o) > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_101, type, sK42: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 5.30/1.11 thf(func_def_102, type, sK43: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 5.30/1.11 thf(func_def_103, type, sK44: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_104, type, sK45: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_105, type, sK46: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_106, type, sK47: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_107, type, sK48: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_108, type, sK49: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_109, type, sK50: !>[X0: $tType]:(((X0 > X0 > $o) > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_110, type, sK51: !>[X0: $tType]:(((X0 > X0 > $o) > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_111, type, sK52: !>[X0: $tType]:(((X0 > X0 > $o) > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_112, type, sK53: !>[X0: $tType]:(((X0 > X0 > $o) > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_113, type, sK54: !>[X0: $tType]:((X0 > set @ X0 > X0 > set @ X0 > set @ X0))).
% 5.30/1.11 thf(func_def_114, type, sK55: !>[X0: $tType]:((coinductive_llist @ X0 > X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_115, type, sK56: !>[X0: $tType]:((coinductive_llist @ X0 > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_116, type, sK57: !>[X0: $tType]:((coinductive_llist @ X0 > X0))).
% 5.30/1.11 thf(func_def_117, type, sK58: !>[X0: $tType]:((set @ X0 > X0))).
% 5.30/1.11 thf(func_def_118, type, sK59: !>[X0: $tType]:(((X0 > $o) > X0))).
% 5.30/1.11 thf(func_def_119, type, sK60: !>[X0: $tType]:(((X0 > $o) > X0))).
% 5.30/1.11 thf(func_def_120, type, sK61: !>[X0: $tType]:((set @ X0 > X0))).
% 5.30/1.11 thf(func_def_121, type, sK62: !>[X0: $tType]:((coinductive_llist @ X0 > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_122, type, sK63: !>[X0: $tType]:((coinductive_llist @ X0 > set @ X0 > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_123, type, sK64: !>[X0: $tType]:((coinductive_llist @ X0 > set @ X0 > X0))).
% 5.30/1.11 thf(func_def_124, type, sK65: !>[X0: $tType]:((coinductive_llist @ X0 > set @ X0 > coinductive_llist @ X0))).
% 5.30/1.11 thf(func_def_126, type, sK67: !>[X0: $tType]:(((X0 > $o) > X0))).
% 5.30/1.11 thf(f1,axiom,(
% 5.30/1.11 (member @ coinductive_llist @ a @ (coinductive_lappend @ a @ l @ sa) @ (lList21612149805nflsts @ a @ a2))),
% 5.30/1.11 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_LNil__fin_Oprems)).
% 5.30/1.11 thf(f14,axiom,(
% 5.30/1.11 (l = coinductive_LNil @ a)),
% 5.30/1.11 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_13_LNil__fin_Ohyps)).
% 5.30/1.11 thf(f43,axiom,(
% 5.30/1.11 ! [X0 : $tType,X1 : coinductive_llist @ X0] : (((coinductive_lappend @ X0 @ coinductive_LNil @ X0 @ X1)) = X1)),
% 5.30/1.11 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_42_lappend__code_I1_J)).
% 5.30/1.11 thf(f91,axiom,(
% 5.30/1.11 ! [X0 : $tType,X1 : X0] : (top_top @ (X0 > $o) @ X1)),
% 5.30/1.11 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_90_top1I)).
% 5.30/1.11 thf(f125,axiom,(
% 5.30/1.11 ! [X0 : $tType,X1 : $o,X2 : X0] : ((top_top @ (X0 > $o) @ X2) & X1 = X1)),
% 5.30/1.11 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_124_top__conj_I2_J)).
% 5.30/1.11 thf(f145,axiom,(
% 5.30/1.11 ! [X0 : $tType] : (lList21612149805nflsts @ X0 = (^[X1 : set @ X0] : ((minus_minus @ set @ coinductive_llist @ X0 @ (lList2435255213lllsts @ X0 @ X1) @ (lList2236698231inlsts @ X0 @ top_top @ set @ X0)))))),
% 5.30/1.11 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_144_inflsts__def)).
% 5.30/1.11 thf(f154,axiom,(
% 5.30/1.11 ! [X0 : $tType] : (((coinductive_lSup @ X0 @ bot_bot @ set @ coinductive_llist @ X0)) = coinductive_LNil @ X0)),
% 5.30/1.11 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_153_lSup__empty)).
% 5.30/1.11 thf(f278,conjecture,(
% 5.30/1.11 (member @ coinductive_llist @ a @ sa @ (lList21612149805nflsts @ a @ a2))),
% 5.30/1.11 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0)).
% 5.30/1.11 thf(f279,negated_conjecture,(
% 5.30/1.11 ~(member @ coinductive_llist @ a @ sa @ (lList21612149805nflsts @ a @ a2))),
% 5.30/1.11 inference(negated_conjecture,[status(cth)],[f278])).
% 5.30/1.11 thf(f280,plain,(
% 5.30/1.11 (member @ coinductive_llist @ a @ (coinductive_lappend @ a @ l @ sa) @ (lList21612149805nflsts @ a @ a2))),
% 5.30/1.11 inference(rectify,[],[f1])).
% 5.30/1.11 thf(f281,plain,(
% 5.30/1.11 (((member @ coinductive_llist @ a @ (coinductive_lappend @ a @ l @ sa) @ (lList21612149805nflsts @ a @ a2))) = $true)),
% 5.30/1.11 inference(fool_elimination,[],[f280])).
% 5.30/1.11 thf(f410,plain,(
% 5.30/1.11 ! [X0 : $tType,X1 : X0] : (top_top @ (X0 > $o) @ X1)),
% 5.30/1.11 inference(rectify,[],[f91])).
% 5.30/1.11 thf(f411,plain,(
% 5.30/1.11 ! [X0 : $tType,X1 : X0] : (((top_top @ (X0 > $o) @ X1)) = $true)),
% 5.30/1.11 inference(fool_elimination,[],[f410])).
% 5.30/1.11 thf(f452,plain,(
% 5.30/1.11 ! [X0 : $tType,X1 : $o,X2 : X0] : ((top_top @ (X0 > $o) @ X2) & X1 = X1)),
% 5.30/1.11 inference(rectify,[],[f125])).
% 5.30/1.11 thf(f453,plain,(
% 5.30/1.11 ! [X0 : $tType,X1 : $o,X2 : X0] : (((X1 & (top_top @ (X0 > $o) @ X2))) = X1)),
% 5.30/1.11 inference(fool_elimination,[],[f452])).
% 5.30/1.11 thf(f474,plain,(
% 5.30/1.11 ! [X0 : $tType] : (lList21612149805nflsts @ X0 = (^[Y0 : set @ X0]: (minus_minus @ set @ coinductive_llist @ X0 @ (lList2435255213lllsts @ X0 @ Y0) @ (lList2236698231inlsts @ X0 @ top_top @ set @ X0))))),
% 5.30/1.11 inference(fool_elimination,[],[f145])).
% 5.30/1.11 thf(f637,plain,(
% 5.30/1.11 ~(member @ coinductive_llist @ a @ sa @ (lList21612149805nflsts @ a @ a2))),
% 5.30/1.11 inference(rectify,[],[f279])).
% 5.30/1.11 thf(f638,plain,(
% 5.30/1.11 ~ (((member @ coinductive_llist @ a @ sa @ (lList21612149805nflsts @ a @ a2))) = $true)),
% 5.30/1.11 inference(fool_elimination,[],[f637])).
% 5.30/1.11 thf(f670,plain,(
% 5.30/1.11 (((member @ coinductive_llist @ a @ sa @ (lList21612149805nflsts @ a @ a2))) != $true)),
% 5.30/1.11 inference(flattening,[],[f638])).
% 5.30/1.11 thf(f826,plain,(
% 5.30/1.11 (((member @ coinductive_llist @ a @ (coinductive_lappend @ a @ l @ sa) @ (lList21612149805nflsts @ a @ a2))) = $true)),
% 5.30/1.11 inference(cnf_transformation,[],[f281])).
% 5.30/1.11 thf(f841,plain,(
% 5.30/1.11 (l = coinductive_LNil @ a)),
% 5.30/1.11 inference(cnf_transformation,[],[f14])).
% 5.30/1.11 thf(f888,plain,(
% 5.30/1.11 ( ! [X0 : $tType,X1 : coinductive_llist @ X0] : ((((coinductive_lappend @ X0 @ coinductive_LNil @ X0 @ X1)) = X1)) )),
% 5.30/1.12 inference(cnf_transformation,[],[f43])).
% 5.30/1.12 thf(f939,plain,(
% 5.30/1.12 ( ! [X0 : $tType,X1 : X0] : ((((top_top @ (X0 > $o) @ X1)) = $true)) )),
% 5.30/1.12 inference(cnf_transformation,[],[f411])).
% 5.30/1.12 thf(f977,plain,(
% 5.30/1.12 ( ! [X0 : $tType,X2 : X0,X1 : $o] : ((((X1 & (top_top @ (X0 > $o) @ X2))) = X1)) )),
% 5.30/1.12 inference(cnf_transformation,[],[f453])).
% 5.30/1.12 thf(f999,plain,(
% 5.30/1.12 ( ! [X0 : $tType] : ((lList21612149805nflsts @ X0 = (^[Y0 : set @ X0]: (minus_minus @ set @ coinductive_llist @ X0 @ (lList2435255213lllsts @ X0 @ Y0) @ (lList2236698231inlsts @ X0 @ top_top @ set @ X0))))) )),
% 5.30/1.12 inference(cnf_transformation,[],[f474])).
% 5.30/1.12 thf(f1008,plain,(
% 5.30/1.12 ( ! [X0 : $tType] : ((coinductive_LNil @ X0 = ((coinductive_lSup @ X0 @ bot_bot @ set @ coinductive_llist @ X0)))) )),
% 5.30/1.12 inference(cnf_transformation,[],[f154])).
% 5.30/1.12 thf(f1148,plain,(
% 5.30/1.12 (((member @ coinductive_llist @ a @ sa @ (lList21612149805nflsts @ a @ a2))) != $true)),
% 5.30/1.12 inference(cnf_transformation,[],[f670])).
% 5.30/1.12 thf(f1153,plain,(
% 5.30/1.12 ($true = ((member @ coinductive_llist @ a @ (coinductive_lappend @ a @ l @ sa) @ ((^[Y0 : set @ a]: (minus_minus @ set @ coinductive_llist @ a @ (lList2435255213lllsts @ a @ Y0) @ (lList2236698231inlsts @ a @ top_top @ set @ a))) @ a2))))),
% 5.30/1.12 inference(definition_unfolding,[],[f826,f999])).
% 5.30/1.12 thf(f1167,plain,(
% 5.30/1.12 (l = ((coinductive_lSup @ a @ bot_bot @ set @ coinductive_llist @ a)))),
% 5.30/1.12 inference(definition_unfolding,[],[f841,f1008])).
% 5.30/1.12 thf(f1193,plain,(
% 5.30/1.12 ( ! [X0 : $tType,X1 : coinductive_llist @ X0] : ((((coinductive_lappend @ X0 @ (coinductive_lSup @ X0 @ bot_bot @ set @ coinductive_llist @ X0) @ X1)) = X1)) )),
% 5.30/1.12 inference(definition_unfolding,[],[f888,f1008])).
% 5.30/1.12 thf(f1252,plain,(
% 5.30/1.12 ($true != ((member @ coinductive_llist @ a @ sa @ ((^[Y0 : set @ a]: (minus_minus @ set @ coinductive_llist @ a @ (lList2435255213lllsts @ a @ Y0) @ (lList2236698231inlsts @ a @ top_top @ set @ a))) @ a2))))),
% 5.30/1.12 inference(definition_unfolding,[],[f1148,f999])).
% 5.30/1.12 thf(f1257,plain,(
% 5.30/1.12 ($true != ((member @ coinductive_llist @ a @ sa @ (minus_minus @ set @ coinductive_llist @ a @ (lList2435255213lllsts @ a @ a2) @ (lList2236698231inlsts @ a @ top_top @ set @ a)))))),
% 5.30/1.12 inference(beta-eta_normalization,[],[f1252])).
% 5.30/1.12 thf(f1767,plain,(
% 5.30/1.12 ( ! [X0 : $tType,X2 : X0,X1 : $o] : ((((X1 & (top_top @ (X0 > $o) @ X2))) = $false) | ($true = X1)) )),
% 5.30/1.12 inference(iff_proxy_clausification,[],[f977])).
% 5.30/1.12 thf(f1768,plain,(
% 5.30/1.12 ( ! [X0 : $tType,X2 : X0,X1 : $o] : ((((top_top @ (X0 > $o) @ X2)) = $false) | ($true = X1) | ($false = X1)) )),
% 5.30/1.12 inference(and_proxy_clausification,[],[f1767])).
% 5.30/1.12 thf(f2143,plain,(
% 5.30/1.12 ($true = ((member @ coinductive_llist @ a @ (coinductive_lappend @ a @ l @ sa) @ (minus_minus @ set @ coinductive_llist @ a @ (lList2435255213lllsts @ a @ a2) @ (lList2236698231inlsts @ a @ top_top @ set @ a)))))),
% 5.30/1.12 inference(beta-eta_normalization,[],[f1153])).
% 5.30/1.12 thf(f2145,definition,(
% 5.30/1.12 spl66_1 <=> ! [X0 : $tType,X1 : X0] : (((top_top @ (X0 > $o) @ X1)) = $false)),
% 5.30/1.12 introduced(definition,[new_symbols(definition,[spl66_1])],[avatar_definition])).
% 5.30/1.12 thf(f2146,plain,(
% 5.30/1.12 ( ! [X0 : $tType,X1 : X0] : ((((top_top @ (X0 > $o) @ X1)) = $false)) ) | ~spl66_1),
% 5.30/1.12 inference(avatar_component_clause,[],[f2145])).
% 5.30/1.12 thf(f2148,definition,(
% 5.30/1.12 spl66_2 <=> ! [X2 : $o] : (($false = X2) | ($true = X2))),
% 5.30/1.12 introduced(definition,[new_symbols(definition,[spl66_2])],[avatar_definition])).
% 5.30/1.12 thf(f2149,plain,(
% 5.30/1.12 ( ! [X2 : $o] : (($true = X2) | ($false = X2)) ) | ~spl66_2),
% 5.30/1.12 inference(avatar_component_clause,[],[f2148])).
% 5.30/1.12 thf(f2155,definition,(
% 5.30/1.12 spl66_4 <=> ! [X0 : $tType,X1 : X0] : (((top_top @ (X0 > $o) @ X1)) = $true)),
% 5.30/1.12 introduced(definition,[new_symbols(definition,[spl66_4])],[avatar_definition])).
% 5.30/1.12 thf(f2156,plain,(
% 5.30/1.12 ( ! [X0 : $tType,X1 : X0] : ((((top_top @ (X0 > $o) @ X1)) = $true)) ) | ~spl66_4),
% 5.30/1.12 inference(avatar_component_clause,[],[f2155])).
% 5.30/1.12 thf(f2159,plain,(
% 5.30/1.12 spl66_2 | spl66_1),
% 5.30/1.12 inference(avatar_split_clause,[],[f1768,f2145,f2148])).
% 5.30/1.12 thf(f2161,plain,(
% 5.30/1.12 spl66_4),
% 5.30/1.12 inference(avatar_split_clause,[],[f939,f2155])).
% 5.30/1.12 thf(f2169,plain,(
% 5.30/1.12 ($true != $true) | ($false = ((member @ coinductive_llist @ a @ sa @ (minus_minus @ set @ coinductive_llist @ a @ (lList2435255213lllsts @ a @ a2) @ (lList2236698231inlsts @ a @ top_top @ set @ a))))) | ~spl66_2),
% 5.30/1.12 inference(constrained_superposition,[],[f1257,f2149])).
% 5.30/1.12 thf(f2170,plain,(
% 5.30/1.12 ($false = ((member @ coinductive_llist @ a @ sa @ (minus_minus @ set @ coinductive_llist @ a @ (lList2435255213lllsts @ a @ a2) @ (lList2236698231inlsts @ a @ top_top @ set @ a))))) | ~spl66_2),
% 5.30/1.12 inference(trivial_inequality_removal,[],[f2169])).
% 5.30/1.12 thf(f2211,plain,(
% 5.30/1.12 ($true = $false) | (~spl66_1 | ~spl66_4)),
% 5.30/1.12 inference(constrained_superposition,[],[f2146,f2156])).
% 5.30/1.12 thf(f2215,plain,(
% 5.30/1.12 $false | (~spl66_1 | ~spl66_4)),
% 5.30/1.12 inference(trivial_inequality_removal,[],[f2211])).
% 5.30/1.12 thf(f2216,plain,(
% 5.30/1.12 ~spl66_1 | ~spl66_4),
% 5.30/1.12 inference(avatar_contradiction_clause,[],[f2215])).
% 5.30/1.12 thf(f2524,plain,(
% 5.30/1.12 ( ! [X0 : coinductive_llist @ a] : ((((coinductive_lappend @ a @ l @ X0)) = X0)) )),
% 5.30/1.12 inference(constrained_superposition,[],[f1193,f1167])).
% 5.30/1.12 thf(f8582,plain,(
% 5.30/1.12 ($true = ((member @ coinductive_llist @ a @ sa @ (minus_minus @ set @ coinductive_llist @ a @ (lList2435255213lllsts @ a @ a2) @ (lList2236698231inlsts @ a @ top_top @ set @ a)))))),
% 5.30/1.12 inference(forward_demodulation,[],[f2143,f2524])).
% 5.30/1.12 thf(f8583,plain,(
% 5.30/1.12 ($true = $false) | ~spl66_2),
% 5.30/1.12 inference(forward_demodulation,[],[f8582,f2170])).
% 5.30/1.12 thf(f8584,plain,(
% 5.30/1.12 $false | ~spl66_2),
% 5.30/1.12 inference(trivial_inequality_removal,[],[f8583])).
% 5.30/1.12 thf(f8585,plain,(
% 5.30/1.12 ~spl66_2),
% 5.30/1.12 inference(avatar_contradiction_clause,[],[f8584])).
% 5.30/1.12 cnf(s4, plain, spl66_1 | spl66_2, inference(sat_conversion,[],[f2159])).
% 5.30/1.12 cnf(s7, plain, spl66_4, inference(sat_conversion,[],[f2161])).
% 5.30/1.12 cnf(s11, plain, ~spl66_1 | ~spl66_4, inference(sat_conversion,[],[f2216])).
% 5.30/1.12 cnf(s216, plain, ~spl66_2, inference(sat_conversion,[],[f8585])).
% 5.30/1.12 cnf(s244, plain, ~spl66_1, inference(rat,[],[s11,s7])).
% 5.30/1.12 cnf(s255, plain, $false, inference(rat,[],[s4,s216,s244])).
% 5.30/1.12 thf(f8586,plain,(
% 5.30/1.12 $false),
% 5.30/1.12 inference(avatar_sat_refutation,[],[s255])).
% 5.30/1.12 % SZS output end Proof for theBenchmark
% 5.30/1.12 % (440405)------------------------------
% 5.30/1.12 % (440405)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.30/1.12 % (440405)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.30/1.12 % (440405)CaDiCaL version: 2.1.3
% 5.30/1.12 % (440405)Termination reason: Refutation
% 5.30/1.12 % (440405)Time elapsed: 0.761 s
% 5.30/1.12 % (440405)Peak memory usage: 17 MB
% 5.30/1.12 % (440405)Instructions burned: 851 (million)
% 5.30/1.12 % (440398)Success in time 0.816 s
% 5.30/1.12 % Vampire exiting
%------------------------------------------------------------------------------