%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ARI757_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 : n012.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 : Tue Sep 29 09:35:12 AM UTC 2026
% Result : Unsatisfiable 2.80s 0.60s
% Output : Refutation 2.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : ARI757_1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Mon Sep 28 21:02:04 UTC 2026
% 0.00/0.10 % CPUTime :
% 0.00/0.10 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.12 Running first-order model finding
% 0.09/0.12 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
% 2.80/0.59 % (3760575)Will run a generic schedule for satisfiability detection.
% 2.80/0.59 % (3760594)% WARNING: option uhcvi not known.
% 2.80/0.59 % (3760592)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1115863912_2999 on theBenchmark for (2999ds/0Mi)
% 2.80/0.59 % (3760598)dis+10_1_sil=32000:sp=arity:random_seed=928020363:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.80/0.59 % (3760596)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2667107574:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.80/0.59 % (3760594)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=157086305:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.80/0.59 % (3760600)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4286350956:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.80/0.59 % (3760602)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1263591982:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.80/0.59 % (3760601)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=53305204:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.80/0.59 % (3760592)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 2.80/0.59 % (3760592)Terminated due to inappropriate strategy.
% 2.80/0.59 % (3760592)------------------------------
% 2.80/0.59 % (3760592)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.59 % (3760592)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.59 % (3760592)CaDiCaL version: 2.1.3
% 2.80/0.59 % (3760592)Termination reason: Inappropriate
% 2.80/0.59 % (3760592)Time elapsed: 0.011 s
% 2.80/0.59 % (3760592)Peak memory usage: 12 MB
% 2.80/0.59 % (3760592)Instructions burned: 41 (million)
% 2.80/0.59 % (3760592)------------------------------
% 2.80/0.59 % (3760592)------------------------------
% 2.80/0.59 % (3760614)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2491521599:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.80/0.59 % (3760614)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 2.80/0.59 % (3760614)Terminated due to inappropriate strategy.
% 2.80/0.59 % (3760614)------------------------------
% 2.80/0.59 % (3760614)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.59 % (3760614)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.59 % (3760614)CaDiCaL version: 2.1.3
% 2.80/0.59 % (3760614)Termination reason: Inappropriate
% 2.80/0.59 % (3760614)Time elapsed: 0.010 s
% 2.80/0.59 % (3760614)Peak memory usage: 12 MB
% 2.80/0.59 % (3760614)Instructions burned: 38 (million)
% 2.80/0.59 % (3760614)------------------------------
% 2.80/0.59 % (3760614)------------------------------
% 2.80/0.59 % (3760600)Instruction limit reached!
% 2.80/0.59 % (3760600)------------------------------
% 2.80/0.59 % (3760600)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.59 % (3760600)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.59 % (3760600)CaDiCaL version: 2.1.3
% 2.80/0.59 % (3760600)Termination reason: Instruction limit
% 2.80/0.59 % (3760600)Termination phase: Saturation
% 2.80/0.59 % (3760600)Time elapsed: 0.036 s
% 2.80/0.59 % (3760600)Peak memory usage: 14 MB
% 2.80/0.59 % (3760600)Instructions burned: 119 (million)
% 2.80/0.59 % (3760601)Instruction limit reached!
% 2.80/0.59 % (3760601)------------------------------
% 2.80/0.59 % (3760601)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.59 % (3760601)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.59 % (3760601)CaDiCaL version: 2.1.3
% 2.80/0.59 % (3760601)Termination reason: Instruction limit
% 2.80/0.59 % (3760601)Termination phase: Saturation
% 2.80/0.59 % (3760601)Time elapsed: 0.039 s
% 2.80/0.59 % (3760601)Peak memory usage: 14 MB
% 2.80/0.59 % (3760601)Instructions burned: 133 (million)
% 2.80/0.59 % (3760598)Instruction limit reached!
% 2.80/0.59 % (3760598)------------------------------
% 2.80/0.59 % (3760598)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.59 % (3760598)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.59 % (3760598)CaDiCaL version: 2.1.3
% 2.80/0.59 % (3760598)Termination reason: Instruction limit
% 2.80/0.59 % (3760598)Termination phase: Saturation
% 2.80/0.59 % (3760598)Time elapsed: 0.044 s
% 2.80/0.59 % (3760598)Peak memory usage: 13 MB
% 2.80/0.59 % (3760598)Instructions burned: 105 (million)
% 2.80/0.59 % (3760623)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2679743810:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.80/0.59 % (3760626)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=1694006064:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 2.80/0.59 % (3760629)ott-21_1_sil=16000:fs=off:random_seed=2524859071:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 2.80/0.59 % (3760632)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2455640582:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 2.80/0.59 % (3760602)Instruction limit reached!
% 2.80/0.59 % (3760602)------------------------------
% 2.80/0.59 % (3760602)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.59 % (3760602)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.59 % (3760602)CaDiCaL version: 2.1.3
% 2.80/0.59 % (3760602)Termination reason: Instruction limit
% 2.80/0.59 % (3760602)Termination phase: Saturation
% 2.80/0.59 % (3760602)Time elapsed: 0.058 s
% 2.80/0.59 % (3760602)Peak memory usage: 14 MB
% 2.80/0.59 % (3760602)Instructions burned: 160 (million)
% 2.80/0.59 % (3760639)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2461533599:fmbsr=1.3:i=865:ins=25_2999 on theBenchmark for (2999ds/865Mi)
% 2.80/0.59 % (3760639)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 2.80/0.59 % (3760639)Terminated due to inappropriate strategy.
% 2.80/0.59 % (3760639)------------------------------
% 2.80/0.59 % (3760639)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.59 % (3760639)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.59 % (3760639)CaDiCaL version: 2.1.3
% 2.80/0.59 % (3760639)Termination reason: Inappropriate
% 2.80/0.59 % (3760639)Time elapsed: 0.013 s
% 2.80/0.59 % (3760639)Peak memory usage: 11 MB
% 2.80/0.59 % (3760639)Instructions burned: 39 (million)
% 2.80/0.59 % (3760639)------------------------------
% 2.80/0.59 % (3760639)------------------------------
% 2.80/0.59 % (3760623)Instruction limit reached!
% 2.80/0.59 % (3760623)------------------------------
% 2.80/0.59 % (3760623)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.59 % (3760623)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.59 % (3760623)CaDiCaL version: 2.1.3
% 2.80/0.59 % (3760623)Termination reason: Instruction limit
% 2.80/0.59 % (3760623)Termination phase: Saturation
% 2.80/0.59 % (3760623)Time elapsed: 0.050 s
% 2.80/0.59 % (3760623)Peak memory usage: 14 MB
% 2.80/0.59 % (3760623)Instructions burned: 132 (million)
% 2.80/0.59 % (3760656)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3977437783:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 2.80/0.59 % (3760629)Instruction limit reached!
% 2.80/0.59 % (3760629)------------------------------
% 2.80/0.59 % (3760629)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.59 % (3760629)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.59 % (3760629)CaDiCaL version: 2.1.3
% 2.80/0.59 % (3760629)Termination reason: Instruction limit
% 2.80/0.59 % (3760629)Termination phase: Saturation
% 2.80/0.59 % (3760629)Time elapsed: 0.057 s
% 2.80/0.59 % (3760629)Peak memory usage: 14 MB
% 2.80/0.59 % (3760629)Instructions burned: 180 (million)
% 2.80/0.59 % (3760664)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1522028294:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 2.80/0.59 % (3760667)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=2183209421:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2998 on theBenchmark for (2998ds/692Mi)
% 2.80/0.59 % (3760664)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 2.80/0.59 % (3760664)Terminated due to inappropriate strategy.
% 2.80/0.59 % (3760664)------------------------------
% 2.80/0.59 % (3760664)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.59 % (3760664)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.59 % (3760664)CaDiCaL version: 2.1.3
% 2.80/0.59 % (3760664)Termination reason: Inappropriate
% 2.80/0.59 % (3760664)Time elapsed: 0.018 s
% 2.80/0.59 % (3760664)Peak memory usage: 11 MB
% 2.80/0.59 % (3760664)Instructions burned: 38 (million)
% 2.80/0.59 % (3760664)------------------------------
% 2.80/0.59 % (3760664)------------------------------
% 2.80/0.59 % (3760673)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3007643481:i=879:kws=inv_precedence:fsr=off_2998 on theBenchmark for (2998ds/879Mi)
% 2.80/0.59 % (3760632)Instruction limit reached!
% 2.80/0.59 % (3760632)------------------------------
% 2.80/0.59 % (3760632)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.59 % (3760632)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.59 % (3760632)CaDiCaL version: 2.1.3
% 2.80/0.59 % (3760632)Termination reason: Instruction limit
% 2.80/0.59 % (3760632)Termination phase: Saturation
% 2.80/0.59 % (3760632)Time elapsed: 0.267 s
% 2.80/0.59 % (3760632)Peak memory usage: 15 MB
% 2.80/0.59 % (3760632)Instructions burned: 477 (million)
% 2.80/0.59 % (3760691)fmb+10_1_sil=64000:random_seed=4273249931:i=22061:nm=2:gsp=on_2996 on theBenchmark for (2996ds/22061Mi)
% 2.80/0.59 % (3760691)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 2.80/0.59 % (3760691)Terminated due to inappropriate strategy.
% 2.80/0.59 % (3760691)------------------------------
% 2.80/0.59 % (3760691)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.59 % (3760691)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.59 % (3760691)CaDiCaL version: 2.1.3
% 2.80/0.59 % (3760691)Termination reason: Inappropriate
% 2.80/0.59 % (3760691)Time elapsed: 0.012 s
% 2.80/0.59 % (3760691)Peak memory usage: 12 MB
% 2.80/0.59 % (3760691)Instructions burned: 40 (million)
% 2.80/0.59 % (3760691)------------------------------
% 2.80/0.59 % (3760691)------------------------------
% 2.80/0.59 % (3760693)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3022194973:i=9515:nm=5_2996 on theBenchmark for (2996ds/9515Mi)
% 2.80/0.59 % (3760693)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 2.80/0.59 % (3760693)Terminated due to inappropriate strategy.
% 2.80/0.59 % (3760693)------------------------------
% 2.80/0.59 % (3760693)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.59 % (3760693)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.60 % (3760693)CaDiCaL version: 2.1.3
% 2.80/0.60 % (3760693)Termination reason: Inappropriate
% 2.80/0.60 % (3760693)Time elapsed: 0.019 s
% 2.80/0.60 % (3760693)Peak memory usage: 11 MB
% 2.80/0.60 % (3760693)Instructions burned: 38 (million)
% 2.80/0.60 % (3760693)------------------------------
% 2.80/0.60 % (3760693)------------------------------
% 2.80/0.60 % (3760626)Instruction limit reached!
% 2.80/0.60 % (3760626)------------------------------
% 2.80/0.60 % (3760626)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.60 % (3760626)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.60 % (3760626)CaDiCaL version: 2.1.3
% 2.80/0.60 % (3760626)Termination reason: Instruction limit
% 2.80/0.60 % (3760626)Termination phase: Saturation
% 2.80/0.60 % (3760626)Time elapsed: 0.342 s
% 2.80/0.60 % (3760626)Peak memory usage: 18 MB
% 2.80/0.60 % (3760626)Instructions burned: 684 (million)
% 2.80/0.60 % (3760695)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2416051172:fmbsr=1.7:i=920_2995 on theBenchmark for (2995ds/920Mi)
% 2.80/0.60 % (3760696)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=1639557809:i=5131_2995 on theBenchmark for (2995ds/5131Mi)
% 2.80/0.60 % (3760695)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 2.80/0.60 % (3760695)Terminated due to inappropriate strategy.
% 2.80/0.60 % (3760695)------------------------------
% 2.80/0.60 % (3760695)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.60 % (3760695)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.60 % (3760695)CaDiCaL version: 2.1.3
% 2.80/0.60 % (3760695)Termination reason: Inappropriate
% 2.80/0.60 % (3760695)Time elapsed: 0.011 s
% 2.80/0.60 % (3760695)Peak memory usage: 12 MB
% 2.80/0.60 % (3760695)Instructions burned: 38 (million)
% 2.80/0.60 % (3760695)------------------------------
% 2.80/0.60 % (3760695)------------------------------
% 2.80/0.60 % (3760699)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3162279574:i=1472:ins=7:fdi=8:gsp=on_2995 on theBenchmark for (2995ds/1472Mi)
% 2.80/0.60 % (3760594) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3760575-3760594"...
% 2.80/0.60 % (3760594)...printing done.
% 2.80/0.60 % (3760594)Refutation found. Thanks to Tanya!
% 2.80/0.60 % SZS status Unsatisfiable for theBenchmark
% 2.80/0.60 % SZS output start Proof for theBenchmark
% 2.80/0.60 tff(type_def_5, type, c_sorted: $tType).
% 2.80/0.60 tff(type_def_6, type, 'Unit': $tType).
% 2.80/0.60 tff(type_def_7, type, c_unsorted: $tType).
% 2.80/0.60 tff(type_def_8, type, c_Boolean: $tType).
% 2.80/0.60 tff(type_def_9, type, c_type: $tType).
% 2.80/0.60 tff(func_def_0, type, lsl: ($int * $int) > $int).
% 2.80/0.60 tff(func_def_1, type, char_P_tag: c_unsorted).
% 2.80/0.60 tff(func_def_2, type, pset_union: (c_sorted * c_sorted) > c_unsorted).
% 2.80/0.60 tff(func_def_3, type, int_of_tag: c_sorted > $int).
% 2.80/0.60 tff(func_def_4, type, bool_not: c_Boolean > c_Boolean).
% 2.80/0.60 tff(func_def_5, type, int_min: ($int * $int) > $int).
% 2.80/0.60 tff(func_def_6, type, c_Boolean_true: c_Boolean).
% 2.80/0.60 tff(func_def_7, type, bitvector_of_char_P: c_sorted > c_unsorted).
% 2.80/0.60 tff(func_def_8, type, base_block: c_sorted > c_unsorted).
% 2.80/0.60 tff(func_def_9, type, downcast: (c_sorted * c_sorted * c_sorted) > c_unsorted).
% 2.80/0.60 tff(func_def_10, type, pset_empty: c_unsorted).
% 2.80/0.60 tff(func_def_11, type, pset_range: (c_sorted * $int * $int) > c_unsorted).
% 2.80/0.60 tff(func_def_12, type, tag_table: c_type > c_type).
% 2.80/0.60 tff(func_def_13, type, int32_of_integer: $int > c_unsorted).
% 2.80/0.60 tff(func_def_14, type, int_max: ($int * $int) > $int).
% 2.80/0.60 tff(func_def_15, type, c_unit: c_type).
% 2.80/0.60 tff(func_def_16, type, pset_deref: (c_sorted * c_sorted) > c_unsorted).
% 2.80/0.60 tff(func_def_17, type, tag_id: c_type > c_type).
% 2.80/0.60 tff(func_def_18, type, offset_max_bytes: (c_sorted * c_sorted * $int) > $int).
% 2.80/0.60 tff(func_def_19, type, neq_int_bool: ($int * $int) > c_Boolean).
% 2.80/0.60 tff(func_def_20, type, store_bytes: (c_sorted * c_sorted * $int * $int * c_sorted) > c_unsorted).
% 2.80/0.60 tff(func_def_21, type, s2bool: c_sorted > c_Boolean).
% 2.80/0.60 tff(func_def_22, type, subtag_bool: (c_sorted * c_sorted) > c_Boolean).
% 2.80/0.60 tff(func_def_23, type, abs_real: $real > $real).
% 2.80/0.60 tff(func_def_24, type, replace_bytes: (c_sorted * $int * $int * c_sorted) > c_unsorted).
% 2.80/0.60 tff(func_def_25, type, neq_real_bool: ($real * $real) > c_Boolean).
% 2.80/0.60 tff(func_def_26, type, abs_int: $int > $int).
% 2.80/0.60 tff(func_def_27, type, c_Boolean_false: c_Boolean).
% 2.80/0.60 tff(func_def_28, type, bool_or: (c_Boolean * c_Boolean) > c_Boolean).
% 2.80/0.60 tff(func_def_29, type, eq_real_bool: ($real * $real) > c_Boolean).
% 2.80/0.60 tff(func_def_30, type, lt_real_bool: ($real * $real) > c_Boolean).
% 2.80/0.60 tff(func_def_31, type, block: c_type > c_type).
% 2.80/0.60 tff(func_def_32, type, int32_of_bitvector: c_sorted > c_unsorted).
% 2.80/0.60 tff(func_def_33, type, log: $real > $real).
% 2.80/0.60 tff(func_def_34, type, bitvector_of_int32: c_sorted > c_unsorted).
% 2.80/0.60 tff(func_def_35, type, pset: c_type > c_type).
% 2.80/0.60 tff(func_def_36, type, address: c_sorted > $int).
% 2.80/0.60 tff(func_def_37, type, shift: (c_sorted * $int) > c_unsorted).
% 2.80/0.60 tff(func_def_38, type, exp: $real > $real).
% 2.80/0.60 tff(func_def_39, type, gt_int_bool: ($int * $int) > c_Boolean).
% 2.80/0.60 tff(func_def_40, type, offset_min_bytes: (c_sorted * c_sorted * $int) > $int).
% 2.80/0.60 tff(func_def_41, type, null: c_unsorted).
% 2.80/0.60 tff(func_def_42, type, eq_pointer_bool: (c_sorted * c_sorted) > c_Boolean).
% 2.80/0.60 tff(func_def_43, type, unit2u: 'Unit' > c_unsorted).
% 2.80/0.60 tff(func_def_44, type, pset_range_left: (c_sorted * $int) > c_unsorted).
% 2.80/0.60 tff(func_def_45, type, le_real_bool: ($real * $real) > c_Boolean).
% 2.80/0.60 tff(func_def_46, type, void_P_of_bitvector: c_sorted > c_unsorted).
% 2.80/0.60 tff(func_def_47, type, s2real: c_sorted > $real).
% 2.80/0.60 tff(func_def_48, type, concat_bitvector: (c_sorted * c_sorted) > c_unsorted).
% 2.80/0.60 tff(func_def_49, type, pset_range_right: (c_sorted * $int) > c_unsorted).
% 2.80/0.60 tff(func_def_50, type, int2u: $int > c_unsorted).
% 2.80/0.60 tff(func_def_51, type, int8_of_integer: $int > c_unsorted).
% 2.80/0.60 tff(func_def_52, type, s2unit: c_sorted > 'Unit').
% 2.80/0.60 tff(func_def_53, type, s2int: c_sorted > $int).
% 2.80/0.60 tff(func_def_54, type, void_P_of_pointer_address: c_sorted > c_unsorted).
% 2.80/0.60 tff(func_def_55, type, c_real: c_type).
% 2.80/0.60 tff(func_def_56, type, real_max: ($real * $real) > $real).
% 2.80/0.60 tff(func_def_57, type, lt_int_bool: ($int * $int) > c_Boolean).
% 2.80/0.60 tff(func_def_58, type, offset_max: (c_sorted * c_sorted) > $int).
% 2.80/0.60 tff(func_def_59, type, smtlib__select: (c_sorted * c_sorted) > c_unsorted).
% 2.80/0.60 tff(func_def_60, type, memory: (c_type * c_type) > c_type).
% 2.80/0.60 tff(func_def_61, type, real2u: $real > c_unsorted).
% 2.80/0.60 tff(func_def_62, type, int8: c_type).
% 2.80/0.60 tff(func_def_63, type, int32: c_type).
% 2.80/0.60 tff(func_def_64, type, bw_and: ($int * $int) > $int).
% 2.80/0.60 tff(func_def_65, type, gt_real_bool: ($real * $real) > c_Boolean).
% 2.80/0.60 tff(func_def_66, type, c_sort: (c_type * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_67, type, offset_min: (c_sorted * c_sorted) > $int).
% 2.80/0.60 tff(func_def_68, type, typeof: (c_sorted * c_sorted) > c_unsorted).
% 2.80/0.60 tff(func_def_69, type, bitvector_of_int8: c_sorted > c_unsorted).
% 2.80/0.60 tff(func_def_70, type, void_P_tag: c_unsorted).
% 2.80/0.60 tff(func_def_71, type, char_P_of_pointer_address: c_sorted > c_unsorted).
% 2.80/0.60 tff(func_def_72, type, le_int_bool: ($int * $int) > c_Boolean).
% 2.80/0.60 tff(func_def_73, type, bottom_tag: c_unsorted).
% 2.80/0.60 tff(func_def_74, type, bitvector: c_type).
% 2.80/0.60 tff(func_def_75, type, integer_of_int8: c_sorted > $int).
% 2.80/0.60 tff(func_def_76, type, lsr: ($int * $int) > $int).
% 2.80/0.60 tff(func_def_77, type, pset_all: c_sorted > c_unsorted).
% 2.80/0.60 tff(func_def_78, type, pointer_address: c_sorted > c_unsorted).
% 2.80/0.60 tff(func_def_79, type, extract_bytes: (c_sorted * $int * $int) > c_unsorted).
% 2.80/0.60 tff(func_def_80, type, bool_and: (c_Boolean * c_Boolean) > c_Boolean).
% 2.80/0.60 tff(func_def_81, type, smtlib__ite: (c_Boolean * c_sorted * c_sorted) > c_unsorted).
% 2.80/0.60 tff(func_def_82, type, bool_xor: (c_Boolean * c_Boolean) > c_Boolean).
% 2.80/0.60 tff(func_def_83, type, ge_real_bool: ($real * $real) > c_Boolean).
% 2.80/0.60 tff(func_def_84, type, eq_int_bool: ($int * $int) > c_Boolean).
% 2.80/0.60 tff(func_def_85, type, c_bool: c_type).
% 2.80/0.60 tff(func_def_86, type, pset_singleton: c_sorted > c_unsorted).
% 2.80/0.60 tff(func_def_87, type, bitvector_of_void_P: c_sorted > c_unsorted).
% 2.80/0.60 tff(func_def_88, type, pointer: c_type > c_type).
% 2.80/0.60 tff(func_def_89, type, select_bytes: (c_sorted * c_sorted * $int * $int) > c_unsorted).
% 2.80/0.60 tff(func_def_90, type, bool2u: c_Boolean > c_unsorted).
% 2.80/0.60 tff(func_def_91, type, void_P: c_type).
% 2.80/0.60 tff(func_def_92, type, integer_of_int32: c_sorted > $int).
% 2.80/0.60 tff(func_def_93, type, char_P_of_bitvector: c_sorted > c_unsorted).
% 2.80/0.60 tff(func_def_94, type, asr: ($int * $int) > $int).
% 2.80/0.60 tff(func_def_95, type, c_int: c_type).
% 2.80/0.60 tff(func_def_96, type, neq_pointer_bool: (c_sorted * c_sorted) > c_Boolean).
% 2.80/0.60 tff(func_def_97, type, int8_of_bitvector: c_sorted > c_unsorted).
% 2.80/0.60 tff(func_def_98, type, alloc_table: c_type > c_type).
% 2.80/0.60 tff(func_def_99, type, sub_pointer: (c_sorted * c_sorted) > $int).
% 2.80/0.60 tff(func_def_100, type, char_P: c_type).
% 2.80/0.60 tff(func_def_101, type, real_min: ($real * $real) > $real).
% 2.80/0.60 tff(func_def_102, type, ge_int_bool: ($int * $int) > c_Boolean).
% 2.80/0.60 tff(func_def_103, type, smtlib__store: (c_sorted * c_sorted * c_sorted) > c_unsorted).
% 2.80/0.60 tff(func_def_119, type, sK0: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_120, type, sK1: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_121, type, sK2: ($int * $int) > $int).
% 2.80/0.60 tff(func_def_122, type, sK3: ($int * $int) > $int).
% 2.80/0.60 tff(func_def_123, type, sK4: ($int * $int) > $int).
% 2.80/0.60 tff(func_def_124, type, sK5: ($int * $int) > $int).
% 2.80/0.60 tff(func_def_125, type, sK6: ($real * $real) > $real).
% 2.80/0.60 tff(func_def_126, type, sK7: ($real * $real) > $real).
% 2.80/0.60 tff(func_def_127, type, sK8: ($real * $real) > $real).
% 2.80/0.60 tff(func_def_128, type, sK9: ($real * $real) > $real).
% 2.80/0.60 tff(func_def_129, type, sK10: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_130, type, sK11: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_131, type, sK12: (c_type * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_132, type, sK13: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_133, type, sK14: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_134, type, sK15: (c_type * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_135, type, sK16: (c_type * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_136, type, sK17: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_137, type, sK18: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_138, type, sK19: (c_type * c_unsorted * $int * $int) > c_type).
% 2.80/0.60 tff(func_def_139, type, sK20: (c_type * c_unsorted * $int * $int) > c_sorted).
% 2.80/0.60 tff(func_def_140, type, sK21: (c_type * c_unsorted * $int * $int) > c_type).
% 2.80/0.60 tff(func_def_141, type, sK22: (c_type * c_unsorted * $int * $int) > c_sorted).
% 2.80/0.60 tff(func_def_142, type, sK23: (c_type * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_143, type, sK24: (c_type * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_144, type, sK25: (c_type * c_unsorted * $int * $int) > c_type).
% 2.80/0.60 tff(func_def_145, type, sK26: (c_type * c_unsorted * $int * $int) > c_sorted).
% 2.80/0.60 tff(func_def_146, type, sK27: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_147, type, sK28: (c_type * c_unsorted * c_unsorted * $int) > c_type).
% 2.80/0.60 tff(func_def_148, type, sK29: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_149, type, sK30: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_150, type, sK31: (c_type * c_unsorted * c_unsorted * $int) > c_type).
% 2.80/0.60 tff(func_def_151, type, sK32: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_152, type, sK33: (c_type * c_unsorted * $int * $int) > c_type).
% 2.80/0.60 tff(func_def_153, type, sK34: (c_type * c_unsorted * $int * $int) > c_sorted).
% 2.80/0.60 tff(func_def_154, type, sK35: (c_type * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_155, type, sK36: (c_type * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_156, type, sK37: (c_type * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_157, type, sK38: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_158, type, sK39: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_159, type, sK40: (c_type * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_160, type, sK41: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_161, type, sK42: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_162, type, sK43: (c_type * c_unsorted * c_unsorted * $int) > c_type).
% 2.80/0.60 tff(func_def_163, type, sK44: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_164, type, sK45: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_165, type, sK46: (c_type * c_unsorted * c_unsorted * $int) > c_type).
% 2.80/0.60 tff(func_def_166, type, sK47: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_167, type, sK48: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_168, type, sK49: (c_type * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_169, type, sK50: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_170, type, sK51: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_171, type, sK52: (c_type * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_172, type, sK53: (c_type * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_173, type, sK54: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_174, type, sK55: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_175, type, sK56: (c_type * c_unsorted * c_unsorted * $int) > c_type).
% 2.80/0.60 tff(func_def_176, type, sK57: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_177, type, sK58: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_178, type, sK59: (c_type * c_unsorted * c_unsorted * $int) > c_type).
% 2.80/0.60 tff(func_def_179, type, sK60: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_180, type, sK61: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_181, type, sK62: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_182, type, sK63: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_183, type, sK64: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_184, type, sK65: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_185, type, sK66: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_186, type, sK67: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_187, type, sK68: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_188, type, sK69: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_189, type, sK70: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_190, type, sK71: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_191, type, sK72: (c_type * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_192, type, sK73: (c_type * c_unsorted * c_unsorted) > c_unsorted).
% 2.80/0.60 tff(func_def_193, type, sK74: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_194, type, sK75: (c_type * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_195, type, sK76: (c_type * c_unsorted * c_unsorted) > c_unsorted).
% 2.80/0.60 tff(func_def_196, type, sK77: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_197, type, sK78: (c_type * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_198, type, sK79: (c_type * c_unsorted * $int * $int * $int * $int) > c_type).
% 2.80/0.60 tff(func_def_199, type, sK80: (c_type * c_unsorted * $int * $int * $int * $int) > c_sorted).
% 2.80/0.60 tff(func_def_200, type, sK81: (c_type * c_unsorted * $int * $int) > c_type).
% 2.80/0.60 tff(func_def_201, type, sK82: (c_type * c_unsorted * $int * $int) > c_sorted).
% 2.80/0.60 tff(func_def_202, type, sK83: (c_type * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_203, type, sK84: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_204, type, sK85: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_205, type, sK86: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_206, type, sK87: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted) > c_unsorted).
% 2.80/0.60 tff(func_def_207, type, sK88: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_208, type, sK89: (c_type * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_209, type, sK90: (c_type * c_unsorted * c_unsorted) > $int).
% 2.80/0.60 tff(func_def_210, type, sK91: (c_type * c_unsorted * c_unsorted) > c_unsorted).
% 2.80/0.60 tff(func_def_211, type, sK92: (c_type * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_212, type, sK93: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_213, type, sK94: (c_type * c_unsorted * c_unsorted * $int * $int) > c_type).
% 2.80/0.60 tff(func_def_214, type, sK95: (c_type * c_unsorted * c_unsorted * $int * $int) > $int).
% 2.80/0.60 tff(func_def_215, type, sK96: (c_type * c_unsorted * c_unsorted * $int * $int) > c_unsorted).
% 2.80/0.60 tff(func_def_216, type, sK97: (c_type * c_unsorted * c_unsorted * $int * $int) > c_type).
% 2.80/0.60 tff(func_def_217, type, sK98: (c_type * c_unsorted * c_unsorted * $int * $int) > c_sorted).
% 2.80/0.60 tff(func_def_218, type, sK99: (c_type * c_unsorted * c_unsorted * $int) > c_type).
% 2.80/0.60 tff(func_def_219, type, sK100: (c_type * c_unsorted * c_unsorted * $int) > $int).
% 2.80/0.60 tff(func_def_220, type, sK101: (c_type * c_unsorted * c_unsorted * $int) > c_unsorted).
% 2.80/0.60 tff(func_def_221, type, sK102: (c_type * c_unsorted * c_unsorted * $int) > c_type).
% 2.80/0.60 tff(func_def_222, type, sK103: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_223, type, sK104: (c_type * c_unsorted * c_unsorted * $int) > c_type).
% 2.80/0.60 tff(func_def_224, type, sK105: (c_type * c_unsorted * c_unsorted * $int) > $int).
% 2.80/0.60 tff(func_def_225, type, sK106: (c_type * c_unsorted * c_unsorted * $int) > c_unsorted).
% 2.80/0.60 tff(func_def_226, type, sK107: (c_type * c_unsorted * c_unsorted * $int) > c_type).
% 2.80/0.60 tff(func_def_227, type, sK108: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_228, type, sK109: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_229, type, sK110: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_230, type, sK111: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_231, type, sK112: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_232, type, sK113: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_233, type, sK114: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_234, type, sK115: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted) > c_unsorted).
% 2.80/0.60 tff(func_def_235, type, sK116: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted) > c_unsorted).
% 2.80/0.60 tff(func_def_236, type, sK117: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_237, type, sK118: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_238, type, sK119: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_239, type, sK120: (c_type * c_unsorted * c_unsorted * $int * $int) > c_type).
% 2.80/0.60 tff(func_def_240, type, sK121: (c_type * c_unsorted * c_unsorted * $int * $int) > $int).
% 2.80/0.60 tff(func_def_241, type, sK122: (c_type * c_unsorted * c_unsorted * $int * $int) > c_unsorted).
% 2.80/0.60 tff(func_def_242, type, sK123: (c_type * c_unsorted * c_unsorted * $int * $int * $int * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_243, type, sK124: (c_type * c_unsorted * c_unsorted * $int * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_244, type, sK125: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_245, type, sK126: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_246, type, sK127: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_247, type, sK128: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_248, type, sK129: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_249, type, sK130: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_unsorted).
% 2.80/0.60 tff(func_def_250, type, sK131: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_251, type, sK132: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_252, type, sK133: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_253, type, sK134: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_254, type, sK135: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_255, type, sK136: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_256, type, sK137: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_257, type, sK138: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_258, type, sK139: (c_type * c_unsorted * c_unsorted * $int) > c_type).
% 2.80/0.60 tff(func_def_259, type, sK140: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_260, type, sK141: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_261, type, sK142: (c_type * c_unsorted * c_unsorted * $int) > c_type).
% 2.80/0.60 tff(func_def_262, type, sK143: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_263, type, sK144: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_264, type, sK145: (c_type * c_unsorted * c_unsorted * $int) > c_type).
% 2.80/0.60 tff(func_def_265, type, sK146: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_266, type, sK147: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_267, type, sK148: (c_type * c_unsorted * c_unsorted * $int) > c_type).
% 2.80/0.60 tff(func_def_268, type, sK149: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_269, type, sK150: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_270, type, sK151: (c_type * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_271, type, sK152: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_272, type, sK153: (c_type * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_273, type, sK154: (c_type * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_274, type, sK155: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_275, type, sK156: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_276, type, sK157: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_277, type, sK158: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_278, type, sK159: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_279, type, sK160: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_280, type, sK161: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_281, type, sK162: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_282, type, sK163: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_283, type, sK164: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_284, type, sK165: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_285, type, sK166: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_286, type, sK167: (c_type * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_287, type, sK168: (c_type * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_288, type, sK169: (c_type * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_289, type, sK170: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_290, type, sK171: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_291, type, sK172: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_292, type, sK173: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_293, type, sK174: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_294, type, sK175: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_295, type, sK176: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_296, type, sK177: (c_type * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_297, type, sK178: (c_type * c_unsorted * c_unsorted * $int) > $int).
% 2.80/0.60 tff(func_def_298, type, sK179: (c_type * c_unsorted * c_unsorted * $int * $int) > c_type).
% 2.80/0.60 tff(func_def_299, type, sK180: c_type > c_type).
% 2.80/0.60 tff(func_def_300, type, sK181: c_type > c_type).
% 2.80/0.60 tff(func_def_301, type, sK182: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_302, type, sK183: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_303, type, sK184: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_304, type, sK185: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_305, type, sK186: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_306, type, sK187: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_307, type, sK188: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_308, type, sK189: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_309, type, sK190: (c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_310, type, sK191: c_type > c_type).
% 2.80/0.60 tff(func_def_311, type, sK192: c_type > c_type).
% 2.80/0.60 tff(func_def_312, type, sK193: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_313, type, sK194: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_314, type, sK195: (c_type * c_unsorted * c_unsorted * $int) > $int).
% 2.80/0.60 tff(func_def_315, type, sK196: (c_type * c_unsorted * c_unsorted * $int) > $int).
% 2.80/0.60 tff(func_def_316, type, sK197: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_317, type, sK198: (c_type * c_unsorted * c_unsorted * $int) > c_sorted).
% 2.80/0.60 tff(func_def_318, type, sK199: (c_type * c_unsorted * c_unsorted * $int) > $int).
% 2.80/0.60 tff(func_def_319, type, sK200: (c_type * c_unsorted * c_unsorted * $int) > $int).
% 2.80/0.60 tff(func_def_320, type, sK201: ($int * $int * $int * $int * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_321, type, sK202: ($int * $int * $int * $int * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_322, type, sK203: ($int * $int * $int * $int * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_323, type, sK204: ($int * $int * $int * $int * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_324, type, sK205: ($int * $int * $int * $int * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_325, type, sK206: ($int * $int * $int * $int * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_326, type, sK207: ($int * $int * $int * $int * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_327, type, sK208: ($int * $int * $int * $int * c_unsorted * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_328, type, sK209: ($int * $int * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_329, type, sK210: (c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_330, type, sK211: (c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_331, type, sK212: (c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_332, type, sK213: (c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_333, type, sK214: (c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_334, type, sK215: (c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_335, type, sK216: (c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_336, type, sK217: (c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_337, type, sK218: (c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_338, type, sK219: (c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_339, type, sK220: (c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_340, type, sK221: (c_type * c_unsorted * c_unsorted * $int * $int * $int * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_341, type, sK222: (c_type * c_unsorted * c_unsorted * $int * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_342, type, sK223: (c_type * c_unsorted * c_unsorted * $int * $int * $int * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_343, type, sK224: (c_type * c_unsorted * c_unsorted * $int * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_344, type, sK225: (c_type * c_unsorted * c_unsorted * $int * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_345, type, sK226: (c_type * c_unsorted * c_unsorted * $int * $int * $int) > c_sorted).
% 2.80/0.60 tff(func_def_346, type, sK227: (c_type * c_unsorted * c_unsorted * $int * $int * $int) > c_type).
% 2.80/0.60 tff(func_def_347, type, sK228: (c_type * c_unsorted * c_unsorted * $int * $int * $int) > c_sorted).
% 2.80/0.60 tff(func_def_348, type, sK229: (c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_349, type, sK230: (c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_350, type, sK231: (c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_351, type, sK232: (c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_352, type, sK233: (c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_353, type, sK234: (c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted) > c_type).
% 2.80/0.60 tff(func_def_354, type, sK235: (c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_355, type, sK236: (c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_356, type, sK237: (c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_357, type, sK238: (c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_358, type, sK239: (c_type * c_unsorted * c_unsorted * $int * $int * $int * $int) > c_sorted).
% 2.80/0.60 tff(func_def_359, type, sK240: (c_type * c_unsorted * c_unsorted * $int * $int * $int * $int) > c_sorted).
% 2.80/0.60 tff(func_def_360, type, sK241: c_unsorted > c_sorted).
% 2.80/0.60 tff(func_def_361, type, sK242: c_unsorted > c_sorted).
% 2.80/0.60 tff(func_def_362, type, sK243: c_unsorted > c_sorted).
% 2.80/0.60 tff(func_def_363, type, sK244: c_unsorted > c_sorted).
% 2.80/0.60 tff(func_def_364, type, sK245: c_unsorted > c_type).
% 2.80/0.60 tff(func_def_365, type, sK246: c_unsorted > c_sorted).
% 2.80/0.60 tff(func_def_366, type, sK247: c_unsorted > c_type).
% 2.80/0.60 tff(func_def_367, type, sK248: c_unsorted > c_sorted).
% 2.80/0.60 tff(func_def_368, type, sK249: c_type).
% 2.80/0.60 tff(func_def_369, type, sK250: (c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_370, type, sK251: (c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_371, type, sK252: (c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_372, type, sK253: (c_unsorted * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_373, type, sK254: c_unsorted > c_sorted).
% 2.80/0.60 tff(func_def_374, type, sK255: c_unsorted > $int).
% 2.80/0.60 tff(func_def_375, type, sK256: c_unsorted > c_sorted).
% 2.80/0.60 tff(func_def_376, type, sK257: c_unsorted > $int).
% 2.80/0.60 tff(func_def_377, type, sK258: (c_unsorted * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_378, type, sK259: (c_unsorted * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_379, type, sK260: (c_unsorted * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_380, type, sK261: (c_unsorted * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_381, type, sK262: c_unsorted > c_type).
% 2.80/0.60 tff(func_def_382, type, sK263: c_unsorted > c_sorted).
% 2.80/0.60 tff(func_def_383, type, sK264: c_unsorted > c_type).
% 2.80/0.60 tff(func_def_384, type, sK265: c_unsorted > c_sorted).
% 2.80/0.60 tff(func_def_385, type, sK266: (c_unsorted * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_386, type, sK267: (c_unsorted * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_387, type, sK268: (c_unsorted * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_388, type, sK269: (c_unsorted * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_389, type, sK270: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_390, type, sK271: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_391, type, sK272: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_392, type, sK273: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_393, type, sK274: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_394, type, sK275: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_395, type, sK276: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_396, type, sK277: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_397, type, sK278: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_398, type, sK279: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_399, type, sK280: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_400, type, sK281: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_401, type, sK282: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_402, type, sK283: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_403, type, sK284: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_404, type, sK285: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_405, type, sK286: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_406, type, sK287: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_407, type, sK288: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_408, type, sK289: (c_unsorted * $int * $int * c_unsorted) > c_sorted).
% 2.80/0.60 tff(func_def_409, type, sK290: c_unsorted > c_type).
% 2.80/0.60 tff(func_def_410, type, sK291: c_unsorted > c_sorted).
% 2.80/0.60 tff(func_def_411, type, sK292: c_unsorted > c_type).
% 2.80/0.60 tff(func_def_412, type, sK293: c_unsorted > c_sorted).
% 2.80/0.60 tff(func_def_413, type, sK294: c_type).
% 2.80/0.60 tff(func_def_414, type, sK295: c_unsorted).
% 2.80/0.60 tff(func_def_415, type, sK296: c_unsorted).
% 2.80/0.60 tff(func_def_416, type, sK297: c_unsorted).
% 2.80/0.60 tff(pred_def_1, type, left_valid_struct_void_P: (c_sorted * $int * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_2, type, strict_valid_root_void_P: (c_sorted * $int * $int * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_3, type, root_tag: c_sorted > $o).
% 2.80/0.60 tff(pred_def_4, type, alloc_extends: (c_sorted * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_5, type, valid_root_void_P: (c_sorted * $int * $int * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_6, type, valid_struct_char_P: (c_sorted * $int * $int * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_7, type, eq_int8: (c_sorted * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_8, type, same_block: (c_sorted * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_9, type, pset_included: (c_sorted * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_10, type, strict_valid_root_char_P: (c_sorted * $int * $int * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_11, type, in_pset: (c_sorted * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_12, type, instanceof: (c_sorted * c_sorted * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_13, type, alloc_extends_except: (c_sorted * c_sorted * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_14, type, not_assigns: (c_sorted * c_sorted * c_sorted * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_15, type, valid_bitvector_struct_char_P: (c_sorted * $int * $int * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_16, type, parenttag: (c_sorted * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_17, type, valid_pset: (c_sorted * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_18, type, right_valid_struct_char_P: (c_sorted * $int * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_19, type, strict_valid_struct_char_P: (c_sorted * $int * $int * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_20, type, valid_bitvector_struct_void_P: (c_sorted * $int * $int * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_21, type, right_valid_struct_void_P: (c_sorted * $int * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_22, type, valid: (c_sorted * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_23, type, full_separated: (c_sorted * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_24, type, strict_valid_struct_void_P: (c_sorted * $int * $int * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_25, type, valid_root_char_P: (c_sorted * $int * $int * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_26, type, fully_packed: (c_sorted * c_sorted * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_27, type, alloc_fresh: (c_sorted * c_sorted * $int) > $o).
% 2.80/0.60 tff(pred_def_28, type, eq_int32: (c_sorted * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_29, type, subtag: (c_sorted * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_30, type, valid_struct_void_P: (c_sorted * $int * $int * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_31, type, pset_disjoint: (c_sorted * c_sorted) > $o).
% 2.80/0.60 tff(pred_def_32, type, left_valid_struct_char_P: (c_sorted * $int * c_sorted) > $o).
% 2.80/0.60 tff(f46,axiom,(
% 2.80/0.60 ! [X0 : c_type] : address(c_sort(pointer(X0),null)) = 0),
% 2.80/0.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_46)).
% 2.80/0.60 tff(f47,axiom,(
% 2.80/0.60 ! [X0 : c_type,X1 : c_unsorted] : $lesseq(0,address(c_sort(pointer(X0),X1)))),
% 2.80/0.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_47)).
% 2.80/0.60 tff(f48,axiom,(
% 2.80/0.60 ! [X0 : c_type,X1 : c_unsorted,X2 : $int,X3 : $int] : ? [X4 : c_type] : (X4 = pointer(X0) & ? [X5 : c_sorted] : (X5 = c_sort(X4,X1) & ($less(address(c_sort(X4,shift(X5,X2))),address(c_sort(X4,shift(X5,X3)))) <=> $less(X2,X3))))),
% 2.80/0.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_48)).
% 2.80/0.60 tff(f50,axiom,(
% 2.80/0.60 ! [X0 : c_type,X1 : c_unsorted] : ? [X2 : c_type] : (X2 = pointer(X0) & ? [X3 : c_sorted] : (X3 = c_sort(X2,X1) & c_sort(X2,shift(X3,0)) = X3))),
% 2.80/0.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_50)).
% 2.80/0.60 tff(f187,plain,(
% 2.80/0.60 ! [X0 : c_type,X1 : c_unsorted] : ~$less(address(c_sort(pointer(X0),X1)),0)),
% 2.80/0.60 inference(theory_normalization,[],[f47])).
% 2.80/0.60 tff(f223,definition,(
% 2.80/0.60 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 2.80/0.60 introduced(theory,[tha_commutativity])).
% 2.80/0.60 tff(f224,definition,(
% 2.80/0.60 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2)) )),
% 2.80/0.60 introduced(theory,[tha_associativity])).
% 2.80/0.60 tff(f227,definition,(
% 2.80/0.60 ( ! [X0 : $int] : (0 = $sum(X0,$uminus(X0))) )),
% 2.80/0.60 introduced(theory,[tha_inverse_op_unit])).
% 2.80/0.60 tff(f228,definition,(
% 2.80/0.60 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 2.80/0.60 introduced(theory,[tha_non-reflexivity])).
% 2.80/0.60 tff(f229,definition,(
% 2.80/0.60 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X1,X2) | ~$less(X0,X1) | $less(X0,X2)) )),
% 2.80/0.60 introduced(theory,[tha_transitivity])).
% 2.80/0.60 tff(f231,definition,(
% 2.80/0.60 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,X1) | $less($sum(X0,X2),$sum(X1,X2))) )),
% 2.80/0.60 introduced(theory,[tha_order_monotonicity])).
% 2.80/0.60 tff(f232,definition,(
% 2.80/0.60 ( ! [X0 : $int,X1 : $int] : ($less(X1,$sum(X0,1)) | $less(X0,X1)) )),
% 2.80/0.60 introduced(theory,[tha_order_plus_one_dichotomy])).
% 2.80/0.60 tff(f421,plain,(
% 2.80/0.60 ( ! [X0 : c_type] : (0 = address(c_sort(pointer(X0),null))) )),
% 2.80/0.60 inference(cnf_transformation,[],[f46])).
% 2.80/0.60 tff(f422,plain,(
% 2.80/0.60 ( ! [X0 : c_type,X1 : c_unsorted] : (~$less(address(c_sort(pointer(X0),X1)),0)) )),
% 2.80/0.60 inference(cnf_transformation,[],[f187])).
% 2.80/0.60 tff(f423,plain,(
% 2.80/0.60 ( ! [X2 : $int,X3 : $int,X0 : c_type,X1 : c_unsorted] : (~$less(X2,X3) | $less(address(c_sort(sK19(X0,X1,X2,X3),shift(sK20(X0,X1,X2,X3),X2))),address(c_sort(sK19(X0,X1,X2,X3),shift(sK20(X0,X1,X2,X3),X3))))) )),
% 2.80/0.60 inference(cnf_transformation,[],[f48])).
% 2.80/0.60 tff(f425,plain,(
% 2.80/0.60 ( ! [X2 : $int,X3 : $int,X0 : c_type,X1 : c_unsorted] : (sK20(X0,X1,X2,X3) = c_sort(sK19(X0,X1,X2,X3),X1)) )),
% 2.80/0.60 inference(cnf_transformation,[],[f48])).
% 2.80/0.60 tff(f426,plain,(
% 2.80/0.60 ( ! [X2 : $int,X3 : $int,X0 : c_type,X1 : c_unsorted] : (pointer(X0) = sK19(X0,X1,X2,X3)) )),
% 2.80/0.60 inference(cnf_transformation,[],[f48])).
% 2.80/0.60 tff(f431,plain,(
% 2.80/0.60 ( ! [X0 : c_type,X1 : c_unsorted] : (sK24(X0,X1) = c_sort(sK23(X0,X1),shift(sK24(X0,X1),0))) )),
% 2.80/0.60 inference(cnf_transformation,[],[f50])).
% 2.80/0.60 tff(f432,plain,(
% 2.80/0.60 ( ! [X0 : c_type,X1 : c_unsorted] : (sK24(X0,X1) = c_sort(sK23(X0,X1),X1)) )),
% 2.80/0.60 inference(cnf_transformation,[],[f50])).
% 2.80/0.60 tff(f433,plain,(
% 2.80/0.60 ( ! [X0 : c_type,X1 : c_unsorted] : (pointer(X0) = sK23(X0,X1)) )),
% 2.80/0.60 inference(cnf_transformation,[],[f50])).
% 2.80/0.60 tff(f886,plain,(
% 2.80/0.60 ( ! [X2 : $int,X3 : $int,X0 : c_type,X1 : c_unsorted] : (c_sort(pointer(X0),X1) = sK20(X0,X1,X2,X3)) )),
% 2.80/0.60 inference(definition_unfolding,[],[f425,f426])).
% 2.80/0.60 tff(f888,plain,(
% 2.80/0.60 ( ! [X0 : c_type,X1 : c_unsorted] : (c_sort(pointer(X0),X1) = sK24(X0,X1)) )),
% 2.80/0.60 inference(definition_unfolding,[],[f432,f433])).
% 2.80/0.60 tff(f1007,plain,(
% 2.80/0.60 ( ! [X2 : $int,X3 : $int,X0 : c_type,X1 : c_unsorted] : ($less(address(c_sort(pointer(X0),shift(c_sort(pointer(X0),X1),X2))),address(c_sort(pointer(X0),shift(c_sort(pointer(X0),X1),X3)))) | ~$less(X2,X3)) )),
% 2.80/0.60 inference(definition_unfolding,[],[f423,f426,f886,f426,f886])).
% 2.80/0.60 tff(f1010,plain,(
% 2.80/0.60 ( ! [X0 : c_type,X1 : c_unsorted] : (c_sort(pointer(X0),X1) = c_sort(pointer(X0),shift(c_sort(pointer(X0),X1),0))) )),
% 2.80/0.60 inference(definition_unfolding,[],[f431,f888,f433,f888])).
% 2.80/0.60 tff(f1459,plain,(
% 2.80/0.60 ( ! [X0 : $int] : ($less(X0,$sum(X0,1))) )),
% 2.80/0.60 inference(resolution,[],[f232,f228])).
% 2.80/0.60 tff(f1624,plain,(
% 2.80/0.60 ( ! [X0 : $int,X1 : $int] : ($less(X0,$sum(X1,1)) | ~$less(X0,X1)) )),
% 2.80/0.60 inference(resolution,[],[f229,f1459])).
% 2.80/0.60 tff(f1738,plain,(
% 2.80/0.60 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($less($sum(X0,X1),$sum($sum(X2,1),X1)) | $less(X2,X0)) )),
% 2.80/0.60 inference(resolution,[],[f231,f232])).
% 2.80/0.60 tff(f1821,plain,(
% 2.80/0.60 ( ! [X0 : $int,X1 : $int] : ($sum(0,X1) = $sum(X0,$sum($uminus(X0),X1))) )),
% 2.80/0.60 inference(superposition,[],[f224,f227])).
% 2.80/0.60 tff(f1840,plain,(
% 2.80/0.60 ( ! [X0 : $int,X1 : $int] : ($sum(X0,$sum($uminus(X0),X1)) = X1) )),
% 2.80/0.60 inference(evaluation,[],[f1821])).
% 2.80/0.60 tff(f3330,plain,(
% 2.80/0.60 ( ! [X2 : $int,X0 : c_type,X1 : c_unsorted] : ($less(address(c_sort(pointer(X0),shift(c_sort(pointer(X0),X1),X2))),address(c_sort(pointer(X0),X1))) | ~$less(X2,0)) )),
% 2.80/0.60 inference(superposition,[],[f1007,f1010])).
% 2.80/0.60 tff(f9887,plain,(
% 2.80/0.60 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($less($sum(X0,X1),$sum(X2,$sum(1,X1))) | $less(X2,X0)) )),
% 2.80/0.60 inference(forward_demodulation,[],[f1738,f224])).
% 2.80/0.60 tff(f11299,plain,(
% 2.80/0.60 ( ! [X0 : $int] : (~$less($sum(X0,1),X0)) )),
% 2.80/0.60 inference(resolution,[],[f1624,f228])).
% 2.80/0.60 tff(f11328,plain,(
% 2.80/0.60 ( ! [X0 : $int] : ($less(X0,$sum(X0,$sum(1,1)))) )),
% 2.80/0.60 inference(resolution,[],[f11299,f9887])).
% 2.80/0.60 tff(f11426,plain,(
% 2.80/0.60 ( ! [X0 : $int] : ($less(X0,$sum(X0,2))) )),
% 2.80/0.60 inference(evaluation,[],[f11328])).
% 2.80/0.60 tff(f12127,plain,(
% 2.80/0.60 ( ! [X0 : $int] : ($less(X0,$sum(2,X0))) )),
% 2.80/0.60 inference(superposition,[],[f11426,f223])).
% 2.80/0.60 tff(f12341,plain,(
% 2.80/0.60 ( ! [X0 : $int] : ($less($sum($uminus(2),X0),X0)) )),
% 2.80/0.60 inference(superposition,[],[f12127,f1840])).
% 2.80/0.60 tff(f12345,plain,(
% 2.80/0.60 ( ! [X0 : $int] : ($less($sum(-2,X0),X0)) )),
% 2.80/0.60 inference(evaluation,[],[f12341])).
% 2.80/0.60 tff(f17188,plain,(
% 2.80/0.60 ( ! [X0 : c_type,X1 : $int] : ($less(address(c_sort(pointer(X0),shift(c_sort(pointer(X0),null),X1))),0) | ~$less(X1,0)) )),
% 2.80/0.60 inference(superposition,[],[f3330,f421])).
% 2.80/0.60 tff(f17189,plain,(
% 2.80/0.60 ( ! [X1 : $int] : (~$less(X1,0)) )),
% 2.80/0.60 inference(forward_subsumption_resolution,[],[f17188,f422])).
% 2.80/0.60 tff(f17404,plain,(
% 2.80/0.60 $false),
% 2.80/0.60 inference(resolution,[],[f17189,f12345])).
% 2.80/0.60 % SZS output end Proof for theBenchmark
% 2.80/0.60 % (3760594)------------------------------
% 2.80/0.60 % (3760594)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.60 % (3760594)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.60 % (3760594)CaDiCaL version: 2.1.3
% 2.80/0.60 % (3760594)Termination reason: Refutation
% 2.80/0.60 % (3760594)Time elapsed: 0.435 s
% 2.80/0.60 % (3760594)Peak memory usage: 20 MB
% 2.80/0.60 % (3760594)Instructions burned: 993 (million)
% 2.80/0.60 % (3760575)Success in time 0.467 s
% 2.80/0.60 % Vampire exiting
%------------------------------------------------------------------------------