%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW809_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 : n016.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 01:45:00 PM UTC 2026
% Result : Unsatisfiable 5.08s 6.28s
% Output : Refutation 5.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW809_1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.17/5.41 % Computer : n016.cluster.edu
% 0.17/5.41 % Model : x86_64 x86_64
% 0.17/5.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.41 % Memory : 8046.5625MB
% 0.17/5.41 % OS : Linux 6.8.0-71-generic
% 0.17/5.41 % CPULimit : 300
% 0.17/5.41 % WCLimit : 300
% 0.17/5.41 % DateTime : Mon Sep 28 14:35:46 UTC 2026
% 0.17/5.42 % CPUTime :
% 0.17/5.42 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.17/5.45 Running first-order model finding
% 0.17/5.45 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
% 4.05/6.11 % (3670901)Will run a generic schedule for satisfiability detection.
% 4.05/6.11 % (3670907)% WARNING: option uhcvi not known.
% 4.05/6.11 % (3670908)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2231835188:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.05/6.11 % (3670906)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=286783817_2999 on theBenchmark for (2999ds/0Mi)
% 4.05/6.11 % (3670909)dis+10_1_sil=32000:sp=arity:random_seed=4247038290:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.05/6.11 % (3670907)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=595999087:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.05/6.11 % (3670910)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3816382134:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.05/6.11 % (3670911)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=894501086:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.05/6.11 % (3670912)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=243252224:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.05/6.11 % (3670906)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 4.05/6.11 % (3670906)Terminated due to inappropriate strategy.
% 4.05/6.11 % (3670906)------------------------------
% 4.05/6.11 % (3670906)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.05/6.11 % (3670906)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.05/6.11 % (3670906)CaDiCaL version: 2.1.3
% 4.05/6.11 % (3670906)Termination reason: Inappropriate
% 4.05/6.11 % (3670906)Time elapsed: 0.017 s
% 4.05/6.11 % (3670906)Peak memory usage: 11 MB
% 4.05/6.11 % (3670906)Instructions burned: 33 (million)
% 4.05/6.11 % (3670906)------------------------------
% 4.05/6.11 % (3670906)------------------------------
% 4.05/6.11 % (3670920)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=833579234:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 4.05/6.11 % (3670920)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 4.05/6.11 % (3670920)Terminated due to inappropriate strategy.
% 4.05/6.11 % (3670920)------------------------------
% 4.05/6.11 % (3670920)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.05/6.11 % (3670920)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.05/6.11 % (3670920)CaDiCaL version: 2.1.3
% 4.05/6.11 % (3670920)Termination reason: Inappropriate
% 4.05/6.11 % (3670920)Time elapsed: 0.015 s
% 4.05/6.11 % (3670920)Peak memory usage: 11 MB
% 4.05/6.11 % (3670920)Instructions burned: 30 (million)
% 4.05/6.11 % (3670920)------------------------------
% 4.05/6.11 % (3670920)------------------------------
% 4.05/6.11 % (3670909)Instruction limit reached!
% 4.05/6.11 % (3670909)------------------------------
% 4.05/6.11 % (3670909)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.05/6.11 % (3670909)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.05/6.11 % (3670909)CaDiCaL version: 2.1.3
% 4.05/6.11 % (3670909)Termination reason: Instruction limit
% 4.05/6.11 % (3670909)Termination phase: Saturation
% 4.05/6.11 % (3670909)Time elapsed: 0.064 s
% 4.05/6.11 % (3670909)Peak memory usage: 13 MB
% 4.05/6.11 % (3670909)Instructions burned: 104 (million)
% 4.05/6.11 % (3670910)Instruction limit reached!
% 4.05/6.11 % (3670910)------------------------------
% 4.05/6.11 % (3670910)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.05/6.11 % (3670910)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.05/6.11 % (3670910)CaDiCaL version: 2.1.3
% 4.05/6.11 % (3670910)Termination reason: Instruction limit
% 4.05/6.11 % (3670910)Termination phase: Saturation
% 4.05/6.11 % (3670910)Time elapsed: 0.069 s
% 4.05/6.11 % (3670910)Peak memory usage: 13 MB
% 4.05/6.11 % (3670910)Instructions burned: 117 (million)
% 4.05/6.11 % (3670922)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3294178233:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 4.05/6.11 % (3670911)Instruction limit reached!
% 4.05/6.11 % (3670911)------------------------------
% 4.05/6.11 % (3670911)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.05/6.11 % (3670911)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.05/6.11 % (3670911)CaDiCaL version: 2.1.3
% 4.05/6.11 % (3670911)Termination reason: Instruction limit
% 5.08/6.23 % (3670911)Termination phase: Saturation
% 5.08/6.23 % (3670911)Time elapsed: 0.081 s
% 5.08/6.23 % (3670911)Peak memory usage: 14 MB
% 5.08/6.23 % (3670911)Instructions burned: 132 (million)
% 5.08/6.23 % (3670923)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=1954232326:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 5.08/6.23 % (3670924)ott-21_1_sil=16000:fs=off:random_seed=234453088:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 5.08/6.23 % (3670926)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2789149784:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 5.08/6.23 % (3670912)Instruction limit reached!
% 5.08/6.23 % (3670912)------------------------------
% 5.08/6.23 % (3670912)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.08/6.23 % (3670912)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.08/6.23 % (3670912)CaDiCaL version: 2.1.3
% 5.08/6.23 % (3670912)Termination reason: Instruction limit
% 5.08/6.23 % (3670912)Termination phase: Saturation
% 5.08/6.23 % (3670912)Time elapsed: 0.104 s
% 5.08/6.23 % (3670912)Peak memory usage: 14 MB
% 5.08/6.23 % (3670912)Instructions burned: 160 (million)
% 5.08/6.23 % (3670930)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1495733318:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 5.08/6.23 % (3670930)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 5.08/6.23 % (3670930)Terminated due to inappropriate strategy.
% 5.08/6.23 % (3670930)------------------------------
% 5.08/6.23 % (3670930)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.08/6.23 % (3670930)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.08/6.23 % (3670930)CaDiCaL version: 2.1.3
% 5.08/6.23 % (3670930)Termination reason: Inappropriate
% 5.08/6.23 % (3670930)Time elapsed: 0.014 s
% 5.08/6.23 % (3670930)Peak memory usage: 11 MB
% 5.08/6.23 % (3670930)Instructions burned: 29 (million)
% 5.08/6.23 % (3670930)------------------------------
% 5.08/6.23 % (3670930)------------------------------
% 5.08/6.23 % (3670922)Instruction limit reached!
% 5.08/6.23 % (3670922)------------------------------
% 5.08/6.23 % (3670922)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.08/6.23 % (3670922)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.08/6.23 % (3670922)CaDiCaL version: 2.1.3
% 5.08/6.23 % (3670922)Termination reason: Instruction limit
% 5.08/6.23 % (3670922)Termination phase: Saturation
% 5.08/6.23 % (3670922)Time elapsed: 0.078 s
% 5.08/6.23 % (3670922)Peak memory usage: 13 MB
% 5.08/6.23 % (3670922)Instructions burned: 132 (million)
% 5.08/6.23 % (3670932)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1671643925:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 5.08/6.23 % (3670933)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2846733236:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 5.08/6.23 % (3670924)Instruction limit reached!
% 5.08/6.23 % (3670924)------------------------------
% 5.08/6.23 % (3670924)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.08/6.23 % (3670924)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.08/6.23 % (3670924)CaDiCaL version: 2.1.3
% 5.08/6.23 % (3670924)Termination reason: Instruction limit
% 5.08/6.23 % (3670924)Termination phase: Saturation
% 5.08/6.23 % (3670924)Time elapsed: 0.088 s
% 5.08/6.23 % (3670924)Peak memory usage: 13 MB
% 5.08/6.23 % (3670924)Instructions burned: 180 (million)
% 5.08/6.23 % (3670933)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 5.08/6.23 % (3670933)Terminated due to inappropriate strategy.
% 5.08/6.23 % (3670933)------------------------------
% 5.08/6.23 % (3670933)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.08/6.23 % (3670933)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.08/6.23 % (3670933)CaDiCaL version: 2.1.3
% 5.08/6.23 % (3670933)Termination reason: Inappropriate
% 5.08/6.23 % (3670933)Time elapsed: 0.014 s
% 5.08/6.23 % (3670933)Peak memory usage: 11 MB
% 5.08/6.23 % (3670933)Instructions burned: 29 (million)
% 5.08/6.23 % (3670933)------------------------------
% 5.08/6.23 % (3670933)------------------------------
% 5.08/6.23 % (3670936)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=1023157977: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.08/6.28 % (3670937)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=574088548:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 5.08/6.28 % (3670926)Instruction limit reached!
% 5.08/6.28 % (3670926)------------------------------
% 5.08/6.28 % (3670926)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.08/6.28 % (3670926)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.08/6.28 % (3670926)CaDiCaL version: 2.1.3
% 5.08/6.28 % (3670926)Termination reason: Instruction limit
% 5.08/6.28 % (3670926)Termination phase: Saturation
% 5.08/6.28 % (3670926)Time elapsed: 0.310 s
% 5.08/6.28 % (3670926)Peak memory usage: 17 MB
% 5.08/6.28 % (3670926)Instructions burned: 478 (million)
% 5.08/6.28 % (3670940)fmb+10_1_sil=64000:random_seed=3513994155:i=22061:nm=2:gsp=on_2995 on theBenchmark for (2995ds/22061Mi)
% 5.08/6.28 % (3670940)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 5.08/6.28 % (3670940)Terminated due to inappropriate strategy.
% 5.08/6.28 % (3670940)------------------------------
% 5.08/6.28 % (3670940)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.08/6.28 % (3670940)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.08/6.28 % (3670940)CaDiCaL version: 2.1.3
% 5.08/6.28 % (3670940)Termination reason: Inappropriate
% 5.08/6.28 % (3670940)Time elapsed: 0.016 s
% 5.08/6.28 % (3670940)Peak memory usage: 11 MB
% 5.08/6.28 % (3670940)Instructions burned: 32 (million)
% 5.08/6.28 % (3670940)------------------------------
% 5.08/6.28 % (3670940)------------------------------
% 5.08/6.28 % (3670942)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2948706181:i=9515:nm=5_2995 on theBenchmark for (2995ds/9515Mi)
% 5.08/6.28 % (3670942)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 5.08/6.28 % (3670942)Terminated due to inappropriate strategy.
% 5.08/6.28 % (3670942)------------------------------
% 5.08/6.28 % (3670942)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.08/6.28 % (3670942)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.08/6.28 % (3670942)CaDiCaL version: 2.1.3
% 5.08/6.28 % (3670942)Termination reason: Inappropriate
% 5.08/6.28 % (3670942)Time elapsed: 0.014 s
% 5.08/6.28 % (3670942)Peak memory usage: 11 MB
% 5.08/6.28 % (3670942)Instructions burned: 29 (million)
% 5.08/6.28 % (3670942)------------------------------
% 5.08/6.28 % (3670942)------------------------------
% 5.08/6.28 % (3670923)Instruction limit reached!
% 5.08/6.28 % (3670923)------------------------------
% 5.08/6.28 % (3670923)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.08/6.28 % (3670923)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.08/6.28 % (3670923)CaDiCaL version: 2.1.3
% 5.08/6.28 % (3670923)Termination reason: Instruction limit
% 5.08/6.28 % (3670923)Termination phase: Saturation
% 5.08/6.28 % (3670923)Time elapsed: 0.403 s
% 5.08/6.28 % (3670923)Peak memory usage: 23 MB
% 5.08/6.28 % (3670923)Instructions burned: 685 (million)
% 5.08/6.28 % (3670944)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=3221995307:fmbsr=1.7:i=920_2994 on theBenchmark for (2994ds/920Mi)
% 5.08/6.28 % (3670945)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3017632478:i=5131_2994 on theBenchmark for (2994ds/5131Mi)
% 5.08/6.28 % (3670944)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 5.08/6.28 % (3670944)Terminated due to inappropriate strategy.
% 5.08/6.28 % (3670944)------------------------------
% 5.08/6.28 % (3670944)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.08/6.28 % (3670944)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.08/6.28 % (3670944)CaDiCaL version: 2.1.3
% 5.08/6.28 % (3670944)Termination reason: Inappropriate
% 5.08/6.28 % (3670944)Time elapsed: 0.014 s
% 5.08/6.28 % (3670944)Peak memory usage: 11 MB
% 5.08/6.28 % (3670944)Instructions burned: 30 (million)
% 5.08/6.28 % (3670944)------------------------------
% 5.08/6.28 % (3670944)------------------------------
% 5.08/6.28 % (3670948)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3175934407:i=1472:ins=7:fdi=8:gsp=on_2994 on theBenchmark for (2994ds/1472Mi)
% 5.08/6.28 % (3670936)Instruction limit reached!
% 5.08/6.28 % (3670936)------------------------------
% 5.08/6.28 % (3670936)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.08/6.28 % (3670936)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.08/6.28 % (3670936)CaDiCaL version: 2.1.3
% 5.08/6.28 % (3670936)Termination reason: Instruction limit
% 5.08/6.28 % (3670936)Termination phase: Saturation
% 5.08/6.28 % (3670936)Time elapsed: 0.423 s
% 5.08/6.28 % (3670936)Peak memory usage: 19 MB
% 5.08/6.28 % (3670936)Instructions burned: 693 (million)
% 5.08/6.28 % (3670950)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=525813261:i=6324_2993 on theBenchmark for (2993ds/6324Mi)
% 5.08/6.28 % (3670950)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 5.08/6.28 % (3670950)Terminated due to inappropriate strategy.
% 5.08/6.28 % (3670950)------------------------------
% 5.08/6.28 % (3670950)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.08/6.28 % (3670950)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.08/6.28 % (3670950)CaDiCaL version: 2.1.3
% 5.08/6.28 % (3670950)Termination reason: Inappropriate
% 5.08/6.28 % (3670950)Time elapsed: 0.017 s
% 5.08/6.28 % (3670950)Peak memory usage: 11 MB
% 5.08/6.28 % (3670950)Instructions burned: 33 (million)
% 5.08/6.28 % (3670950)------------------------------
% 5.08/6.28 % (3670950)------------------------------
% 5.08/6.28 % (3670937)Instruction limit reached!
% 5.08/6.28 % (3670937)------------------------------
% 5.08/6.28 % (3670937)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.08/6.28 % (3670937)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.08/6.28 % (3670937)CaDiCaL version: 2.1.3
% 5.08/6.28 % (3670937)Termination reason: Instruction limit
% 5.08/6.28 % (3670937)Termination phase: Saturation
% 5.08/6.28 % (3670937)Time elapsed: 0.471 s
% 5.08/6.28 % (3670937)Peak memory usage: 20 MB
% 5.08/6.28 % (3670937)Instructions burned: 879 (million)
% 5.08/6.28 % (3670952)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=1770860534:fmbsr=2.30978:i=2174_2993 on theBenchmark for (2993ds/2174Mi)
% 5.08/6.28 % (3670932)Instruction limit reached!
% 5.08/6.28 % (3670932)------------------------------
% 5.08/6.28 % (3670932)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.08/6.28 % (3670932)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.08/6.28 % (3670932)CaDiCaL version: 2.1.3
% 5.08/6.28 % (3670932)Termination reason: Instruction limit
% 5.08/6.28 % (3670932)Termination phase: Saturation
% 5.08/6.28 % (3670932)Time elapsed: 0.529 s
% 5.08/6.28 % (3670932)Peak memory usage: 23 MB
% 5.08/6.28 % (3670932)Instructions burned: 1180 (million)
% 5.08/6.28 % (3670955)ott+10_1_sil=32000:tgt=ground:random_seed=1173726865:i=5114:av=off_2992 on theBenchmark for (2992ds/5114Mi)
% 5.08/6.28 % (3670953)ott-2_1_sil=16000:newcnf=on:random_seed=709806233:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2992 on theBenchmark for (2992ds/869Mi)
% 5.08/6.28 % (3670952)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 5.08/6.28 % (3670952)Terminated due to inappropriate strategy.
% 5.08/6.28 % (3670952)------------------------------
% 5.08/6.28 % (3670952)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.08/6.28 % (3670952)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.08/6.28 % (3670952)CaDiCaL version: 2.1.3
% 5.08/6.28 % (3670952)Termination reason: Inappropriate
% 5.08/6.28 % (3670952)Time elapsed: 0.014 s
% 5.08/6.28 % (3670952)Peak memory usage: 11 MB
% 5.08/6.28 % (3670952)Instructions burned: 30 (million)
% 5.08/6.28 % (3670952)------------------------------
% 5.08/6.28 % (3670952)------------------------------
% 5.08/6.28 % (3670958)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=3069811407:i=54282_2992 on theBenchmark for (2992ds/54282Mi)
% 5.08/6.28 % (3670958)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 5.08/6.28 % (3670958)Terminated due to inappropriate strategy.
% 5.08/6.28 % (3670958)------------------------------
% 5.08/6.28 % (3670958)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.08/6.28 % (3670958)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.08/6.28 % (3670958)CaDiCaL version: 2.1.3
% 5.08/6.28 % (3670958)Termination reason: Inappropriate
% 5.08/6.28 % (3670958)Time elapsed: 0.017 s
% 5.08/6.28 % (3670958)Peak memory usage: 11 MB
% 5.08/6.28 % (3670958)Instructions burned: 33 (million)
% 5.08/6.28 % (3670958)------------------------------
% 5.08/6.28 % (3670958)------------------------------
% 5.08/6.28 % (3670960)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=2612636728:i=3512:aac=none_2992 on theBenchmark for (2992ds/3512Mi)
% 5.08/6.28 % (3670907) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3670901-3670907"...
% 5.08/6.28 % (3670907)...printing done.
% 5.08/6.28 % (3670907)Refutation found. Thanks to Tanya!
% 5.08/6.28 % SZS status Unsatisfiable for theBenchmark
% 5.08/6.28 % SZS output start Proof for theBenchmark
% 5.08/6.28 tff(type_def_5, type, c_ssorted: $tType).
% 5.08/6.28 tff(type_def_6, type, c_Boolean: $tType).
% 5.08/6.28 tff(type_def_7, type, c_type: $tType).
% 5.08/6.28 tff(type_def_8, type, c_unique: $tType).
% 5.08/6.28 tff(func_def_0, type, pset_acc_range_left: (c_ssorted * c_ssorted * $int) > c_unique).
% 5.08/6.28 tff(func_def_1, type, c_Boolean_true: c_Boolean).
% 5.08/6.28 tff(func_def_2, type, ss2Real: c_ssorted > $real).
% 5.08/6.28 tff(func_def_3, type, base_addr: c_ssorted > c_unique).
% 5.08/6.28 tff(func_def_4, type, pset_acc_range: (c_ssorted * c_ssorted * $int * $int) > c_unique).
% 5.08/6.28 tff(func_def_5, type, type_pset: c_type > c_type).
% 5.08/6.28 tff(func_def_6, type, '%': ($int * $int) > $int).
% 5.08/6.28 tff(func_def_7, type, neq_int_bool: ($int * $int) > c_Boolean).
% 5.08/6.28 tff(func_def_8, type, whydivide: ($int * $int) > $int).
% 5.08/6.28 tff(func_def_9, type, c_Boolean_false: c_Boolean).
% 5.08/6.28 tff(func_def_10, type, pset_singleton: c_ssorted > c_unique).
% 5.08/6.28 tff(func_def_11, type, bool2U: c_Boolean > c_unique).
% 5.08/6.28 tff(func_def_12, type, type_alloc_table: c_type).
% 5.08/6.28 tff(func_def_13, type, gt_int_bool: ($int * $int) > c_Boolean).
% 5.08/6.28 tff(func_def_14, type, pset_acc_range_right: (c_ssorted * c_ssorted * $int) > c_unique).
% 5.08/6.28 tff(func_def_15, type, type_pointer: c_type > c_type).
% 5.08/6.28 tff(func_def_16, type, shift: (c_ssorted * $int) > c_unique).
% 5.08/6.28 tff(func_def_17, type, upd: (c_ssorted * c_ssorted * c_ssorted) > c_unique).
% 5.08/6.28 tff(func_def_18, type, pset_all: c_ssorted > c_unique).
% 5.08/6.28 tff(func_def_19, type, int2U: $int > c_unique).
% 5.08/6.28 tff(func_def_20, type, c_real: c_type).
% 5.08/6.28 tff(func_def_21, type, lt_int_bool: ($int * $int) > c_Boolean).
% 5.08/6.28 tff(func_def_22, type, pset_range: (c_ssorted * $int * $int) > c_unique).
% 5.08/6.28 tff(func_def_23, type, ss2Int: c_ssorted > $int).
% 5.08/6.28 tff(func_def_24, type, pset_union: (c_ssorted * c_ssorted) > c_unique).
% 5.08/6.28 tff(func_def_25, type, le_int_bool: ($int * $int) > c_Boolean).
% 5.08/6.28 tff(func_def_26, type, null: c_unique).
% 5.08/6.28 tff(func_def_27, type, real2U: $real > c_unique).
% 5.08/6.28 tff(func_def_28, type, smtlib__ite: (c_Boolean * c_ssorted * c_ssorted) > c_unique).
% 5.08/6.28 tff(func_def_29, type, pset_range_left: (c_ssorted * $int) > c_unique).
% 5.08/6.28 tff(func_def_30, type, block_length: (c_ssorted * c_ssorted) > $int).
% 5.08/6.28 tff(func_def_31, type, c_sort: (c_type * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_32, type, eq_int_bool: ($int * $int) > c_Boolean).
% 5.08/6.28 tff(func_def_33, type, sub_pointer: (c_ssorted * c_ssorted) > $int).
% 5.08/6.28 tff(func_def_34, type, pset_empty: c_unique).
% 5.08/6.28 tff(func_def_35, type, c_bool: c_type).
% 5.08/6.28 tff(func_def_36, type, ss2Bool: c_ssorted > c_Boolean).
% 5.08/6.28 tff(func_def_37, type, type_memory: (c_type * c_type) > c_type).
% 5.08/6.28 tff(func_def_38, type, acc: (c_ssorted * c_ssorted) > c_unique).
% 5.08/6.28 tff(func_def_39, type, c_int: c_type).
% 5.08/6.28 tff(func_def_40, type, type_global: c_type).
% 5.08/6.28 tff(func_def_41, type, pset_range_right: (c_ssorted * $int) > c_unique).
% 5.08/6.28 tff(func_def_42, type, pset_acc_all: (c_ssorted * c_ssorted) > c_unique).
% 5.08/6.28 tff(func_def_43, type, pset_star: (c_ssorted * c_ssorted) > c_unique).
% 5.08/6.28 tff(func_def_44, type, ge_int_bool: ($int * $int) > c_Boolean).
% 5.08/6.28 tff(func_def_45, type, offset: c_ssorted > $int).
% 5.08/6.28 tff(func_def_58, type, sK0: (c_type * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_59, type, sK1: (c_type * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_60, type, sK2: (c_type * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_61, type, sK3: (c_type * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_62, type, sK4: (c_type * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_63, type, sK5: (c_type * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_64, type, sK6: (c_type * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_65, type, sK7: (c_type * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_66, type, sK8: (c_type * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_67, type, sK9: (c_type * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_68, type, sK10: (c_type * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_69, type, sK11: (c_type * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_70, type, sK12: (c_type * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_71, type, sK13: (c_type * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_72, type, sK14: (c_type * c_unique * c_unique) > $int).
% 5.08/6.28 tff(func_def_73, type, sK15: (c_type * c_unique * c_unique * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_74, type, sK16: (c_type * c_unique * c_unique * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_75, type, sK17: (c_type * c_unique * c_unique * $int) > $int).
% 5.08/6.28 tff(func_def_76, type, sK18: (c_type * c_unique * c_unique * $int * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_77, type, sK19: (c_type * c_unique * c_unique * $int * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_78, type, sK20: (c_type * c_unique * c_unique * $int * $int) > $int).
% 5.08/6.28 tff(func_def_79, type, sK21: (c_type * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_80, type, sK22: (c_type * c_unique * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_81, type, sK23: (c_type * c_unique * $int * $int) > c_type).
% 5.08/6.28 tff(func_def_82, type, sK24: (c_type * c_unique * $int * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_83, type, sK25: (c_type * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_84, type, sK26: (c_type * c_unique * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_85, type, sK27: (c_type * c_unique * c_unique * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_86, type, sK28: (c_type * c_unique * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_87, type, sK29: (c_type * c_unique * c_unique * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_88, type, sK30: (c_type * c_unique * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_89, type, sK31: (c_type * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_90, type, sK32: (c_type * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_91, type, sK33: (c_type * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_92, type, sK34: (c_type * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_93, type, sK35: (c_type * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_94, type, sK36: (c_type * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_95, type, sK37: (c_type * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_96, type, sK38: (c_type * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_97, type, sK39: (c_type * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_98, type, sK40: (c_type * c_unique * c_unique * $int * $int) > c_type).
% 5.08/6.28 tff(func_def_99, type, sK41: (c_type * c_unique * c_unique * $int * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_100, type, sK42: (c_type * c_unique * c_unique * $int * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_101, type, sK43: (c_type * c_unique * c_unique * $int * $int) > c_type).
% 5.08/6.28 tff(func_def_102, type, sK44: (c_type * c_unique * c_unique * $int * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_103, type, sK45: (c_type * c_unique * c_unique * $int * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_104, type, sK46: (c_type * c_unique * c_unique * $int * $int) > c_type).
% 5.08/6.28 tff(func_def_105, type, sK47: (c_type * c_unique * c_unique * $int * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_106, type, sK48: (c_type * c_unique * c_unique * $int * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_107, type, sK49: (c_type * c_unique * c_unique * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_108, type, sK50: (c_type * c_unique * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_109, type, sK51: (c_type * c_unique * c_unique * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_110, type, sK52: (c_type * c_unique * c_unique * $int * $int * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_111, type, sK53: (c_type * c_unique * c_unique * $int * $int * $int) > c_type).
% 5.08/6.28 tff(func_def_112, type, sK54: (c_type * c_unique * c_unique * $int * $int * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_113, type, sK55: (c_type * c_unique * c_unique * $int * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_114, type, sK56: (c_type * c_unique * c_unique * $int * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_115, type, sK57: (c_type * c_unique * c_unique * $int * $int * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_116, type, sK58: (c_type * c_unique * c_unique * $int * $int * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_117, type, sK59: (c_type * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_118, type, sK60: (c_type * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_119, type, sK61: (c_type * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_120, type, sK62: (c_type * c_type * c_unique * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_121, type, sK63: (c_type * c_type * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_122, type, sK64: (c_type * c_type * c_unique * c_unique * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_123, type, sK65: (c_type * c_type * c_unique * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_124, type, sK66: (c_type * c_type * c_unique * c_unique * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_125, type, sK67: (c_type * c_type * c_unique * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_126, type, sK68: (c_type * c_type * c_unique * c_unique * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_127, type, sK69: (c_type * c_type * c_unique * c_unique * c_unique * c_unique) > c_unique).
% 5.08/6.28 tff(func_def_128, type, sK70: (c_type * c_type * c_unique * c_unique * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_129, type, sK71: (c_type * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_130, type, sK72: (c_type * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_131, type, sK73: (c_type * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_132, type, sK74: (c_type * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_133, type, sK75: (c_type * c_unique * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_134, type, sK76: (c_type * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_135, type, sK77: (c_type * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_136, type, sK78: (c_type * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_137, type, sK79: (c_type * c_unique * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_138, type, sK80: (c_type * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_139, type, sK81: (c_type * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_140, type, sK82: (c_type * c_unique * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_141, type, sK83: (c_type * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_142, type, sK84: (c_type * c_type * c_unique * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_143, type, sK85: (c_type * c_type * c_unique * c_unique * c_unique) > c_unique).
% 5.08/6.28 tff(func_def_144, type, sK86: (c_type * c_type * c_unique * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_145, type, sK87: (c_type * c_type * c_unique * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_146, type, sK88: (c_type * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_147, type, sK89: (c_type * c_unique * c_unique) > c_unique).
% 5.08/6.28 tff(func_def_148, type, sK90: (c_type * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_149, type, sK91: (c_type * c_unique * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_150, type, sK92: (c_type * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_151, type, sK93: (c_type * c_unique * c_unique * $int * $int) > c_type).
% 5.08/6.28 tff(func_def_152, type, sK94: (c_type * c_unique * c_unique * $int * $int) > c_unique).
% 5.08/6.28 tff(func_def_153, type, sK95: (c_type * c_unique * c_unique * $int * $int) > $int).
% 5.08/6.28 tff(func_def_154, type, sK96: (c_type * c_unique * c_unique * $int * $int) > c_type).
% 5.08/6.28 tff(func_def_155, type, sK97: (c_type * c_unique * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_156, type, sK98: (c_type * c_unique * c_unique * $int) > c_unique).
% 5.08/6.28 tff(func_def_157, type, sK99: (c_type * c_unique * c_unique * $int) > $int).
% 5.08/6.28 tff(func_def_158, type, sK100: (c_type * c_unique * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_159, type, sK101: (c_type * c_unique * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_160, type, sK102: (c_type * c_unique * c_unique * $int) > c_unique).
% 5.08/6.28 tff(func_def_161, type, sK103: (c_type * c_unique * c_unique * $int) > $int).
% 5.08/6.28 tff(func_def_162, type, sK104: (c_type * c_unique * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_163, type, sK105: (c_type * c_type * c_unique * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_164, type, sK106: (c_type * c_type * c_unique * c_unique * c_unique) > c_unique).
% 5.08/6.28 tff(func_def_165, type, sK107: (c_type * c_type * c_unique * c_unique * c_unique) > $int).
% 5.08/6.28 tff(func_def_166, type, sK108: (c_type * c_type * c_unique * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_167, type, sK109: (c_type * c_type * c_unique * c_unique * c_unique * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_168, type, sK110: (c_type * c_type * c_unique * c_unique * c_unique * $int * $int) > c_type).
% 5.08/6.28 tff(func_def_169, type, sK111: (c_type * c_type * c_unique * c_unique * c_unique * $int * $int) > c_unique).
% 5.08/6.28 tff(func_def_170, type, sK112: (c_type * c_type * c_unique * c_unique * c_unique * $int * $int) > $int).
% 5.08/6.28 tff(func_def_171, type, sK113: (c_type * c_type * c_unique * c_unique * c_unique * $int * $int) > c_type).
% 5.08/6.28 tff(func_def_172, type, sK114: (c_type * c_type * c_unique * c_unique * c_unique * $int * $int * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_173, type, sK115: (c_type * c_type * c_unique * c_unique * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_174, type, sK116: (c_type * c_type * c_unique * c_unique * c_unique * $int) > c_unique).
% 5.08/6.28 tff(func_def_175, type, sK117: (c_type * c_type * c_unique * c_unique * c_unique * $int) > $int).
% 5.08/6.28 tff(func_def_176, type, sK118: (c_type * c_type * c_unique * c_unique * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_177, type, sK119: (c_type * c_type * c_unique * c_unique * c_unique * $int * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_178, type, sK120: (c_type * c_type * c_unique * c_unique * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_179, type, sK121: (c_type * c_type * c_unique * c_unique * c_unique * $int) > c_unique).
% 5.08/6.28 tff(func_def_180, type, sK122: (c_type * c_type * c_unique * c_unique * c_unique * $int) > $int).
% 5.08/6.28 tff(func_def_181, type, sK123: (c_type * c_type * c_unique * c_unique * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_182, type, sK124: (c_type * c_type * c_unique * c_unique * c_unique * $int * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_183, type, sK125: (c_type * c_type * c_unique * c_unique * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_184, type, sK126: (c_type * c_type * c_unique * c_unique * c_unique * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_185, type, sK127: (c_type * c_type * c_unique * c_unique * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_186, type, sK128: (c_type * c_type * c_unique * c_unique * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_187, type, sK129: (c_type * c_type * c_unique * c_unique * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_188, type, sK130: (c_type * c_type * c_unique * c_unique * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_189, type, sK131: (c_type * c_type * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_190, type, sK132: (c_type * c_type * c_unique) > c_unique).
% 5.08/6.28 tff(func_def_191, type, sK133: (c_type * c_type * c_unique) > c_unique).
% 5.08/6.28 tff(func_def_192, type, sK134: (c_type * c_type * c_unique * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_193, type, sK135: (c_type * c_type * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_194, type, sK136: (c_type * c_type * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_195, type, sK137: (c_type * c_type * c_unique * $int) > c_unique).
% 5.08/6.28 tff(func_def_196, type, sK138: (c_type * c_type * c_unique * $int) > c_unique).
% 5.08/6.28 tff(func_def_197, type, sK139: (c_type * c_type * c_unique * $int * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_198, type, sK140: (c_type * c_type * c_unique * $int * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_199, type, sK141: (c_type * c_type * c_unique * $int * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_200, type, sK142: (c_type * c_type * c_unique * $int * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_201, type, sK143: (c_type * c_type * c_unique * $int * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_202, type, sK144: (c_type * c_type * c_unique * $int * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_203, type, sK145: (c_type * c_type * c_unique * $int * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_204, type, sK146: (c_type * c_type * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_205, type, sK147: (c_type * c_type * c_unique * c_unique) > c_unique).
% 5.08/6.28 tff(func_def_206, type, sK148: (c_type * c_type * c_unique * c_unique) > c_unique).
% 5.08/6.28 tff(func_def_207, type, sK149: (c_type * c_type * c_unique * c_unique * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_208, type, sK150: (c_type * c_type * c_unique * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_209, type, sK151: (c_type * c_type * c_unique * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_210, type, sK152: (c_type * c_type * c_unique * c_unique * $int) > c_unique).
% 5.08/6.28 tff(func_def_211, type, sK153: (c_type * c_type * c_unique * c_unique * $int) > c_unique).
% 5.08/6.28 tff(func_def_212, type, sK154: (c_type * c_type * c_unique * c_unique * $int) > $int).
% 5.08/6.28 tff(func_def_213, type, sK155: (c_type * c_type * c_unique * c_unique * $int * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_214, type, sK156: (c_type * c_type * c_unique * c_unique * $int * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_215, type, sK157: (c_type * c_type * c_unique * c_unique * $int * c_unique * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_216, type, sK158: (c_type * c_type * c_unique * $int) > c_unique).
% 5.08/6.28 tff(func_def_217, type, sK159: (c_type * c_type * c_unique * $int) > c_unique).
% 5.08/6.28 tff(func_def_218, type, sK160: (c_type * c_type * c_unique * $int) > $int).
% 5.08/6.28 tff(func_def_219, type, sK161: (c_type * c_type * c_unique * $int) > $int).
% 5.08/6.28 tff(func_def_220, type, sK162: (c_type * c_type * c_unique * $int * c_unique * $int * $int) > c_type).
% 5.08/6.28 tff(func_def_221, type, sK163: (c_type * c_type * c_unique * $int * c_unique * $int * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_222, type, sK164: (c_type * c_type * c_unique * $int * c_unique * $int * $int) > c_type).
% 5.08/6.28 tff(func_def_223, type, sK165: (c_type * c_type * c_unique * $int * c_unique * $int * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_224, type, sK166: (c_type * c_type * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_225, type, sK167: (c_type * c_type * c_unique * c_unique) > c_unique).
% 5.08/6.28 tff(func_def_226, type, sK168: (c_type * c_type * c_unique * c_unique) > c_unique).
% 5.08/6.28 tff(func_def_227, type, sK169: (c_type * c_type * c_unique * c_unique * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_228, type, sK170: (c_type * c_type * c_unique * c_unique * c_unique * c_unique) > c_type).
% 5.08/6.28 tff(func_def_229, type, sK171: (c_type * c_type * c_unique * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_230, type, sK172: (c_type * c_type * c_unique * c_unique * $int) > c_unique).
% 5.08/6.28 tff(func_def_231, type, sK173: (c_type * c_type * c_unique * c_unique * $int) > c_unique).
% 5.08/6.28 tff(func_def_232, type, sK174: (c_type * c_type * c_unique * c_unique * $int) > $int).
% 5.08/6.28 tff(func_def_233, type, sK175: (c_type * c_type * c_unique * c_unique * $int * c_unique * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_234, type, sK176: (c_type * c_type * c_unique * c_unique * $int * c_unique * c_unique * $int) > c_type).
% 5.08/6.28 tff(func_def_235, type, sK177: (c_type * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_236, type, sK178: (c_type * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_237, type, sK179: (c_type * c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_238, type, sK180: (c_type * c_unique * c_unique * c_unique * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_239, type, sK181: (c_type * c_unique * c_unique * c_unique * $int * $int) > c_ssorted).
% 5.08/6.28 tff(func_def_240, type, sK182: c_unique > c_ssorted).
% 5.08/6.28 tff(func_def_241, type, sK183: (c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_242, type, sK184: (c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_243, type, sK185: (c_unique * c_unique * c_unique) > c_ssorted).
% 5.08/6.28 tff(func_def_244, type, sK186: $int > $int).
% 5.08/6.28 tff(func_def_245, type, sK187: $int).
% 5.08/6.28 tff(func_def_246, type, sK188: c_unique).
% 5.08/6.28 tff(func_def_247, type, sK189: $int).
% 5.08/6.28 tff(func_def_248, type, sK190: $int).
% 5.08/6.28 tff(func_def_249, type, sK191: c_unique).
% 5.08/6.28 tff(func_def_250, type, sK192: $int).
% 5.08/6.28 tff(func_def_251, type, sK193: c_unique).
% 5.08/6.28 tff(func_def_252, type, sK194: $int).
% 5.08/6.28 tff(func_def_253, type, sK195: $int > c_type).
% 5.08/6.28 tff(func_def_254, type, sK196: $int).
% 5.08/6.28 tff(func_def_255, type, sK197: $int).
% 5.08/6.28 tff(func_def_256, type, sK198: $int).
% 5.08/6.28 tff(func_def_257, type, sK199: $int).
% 5.08/6.28 tff(func_def_258, type, sK200: $int).
% 5.08/6.28 tff(func_def_259, type, sK201: $int).
% 5.08/6.28 tff(func_def_260, type, sK202: c_unique).
% 5.08/6.28 tff(func_def_261, type, sK203: c_unique).
% 5.08/6.28 tff(func_def_262, type, sK204: c_type > c_unique).
% 5.08/6.28 tff(func_def_263, type, sK205: c_type > $int).
% 5.08/6.28 tff(func_def_264, type, sK206: c_type > c_unique).
% 5.08/6.28 tff(func_def_265, type, sK207: c_type > $int).
% 5.08/6.28 tff(func_def_266, type, sK208: c_type > $int).
% 5.08/6.28 tff(func_def_267, type, sK209: c_type > c_unique).
% 5.08/6.28 tff(func_def_268, type, sK210: c_type > $int).
% 5.08/6.28 tff(func_def_269, type, sK211: c_type > $int).
% 5.08/6.28 tff(func_def_270, type, sK212: c_type > $int).
% 5.08/6.28 tff(func_def_271, type, sK213: c_type > $int).
% 5.08/6.28 tff(func_def_272, type, sK214: c_type > $int).
% 5.08/6.28 tff(func_def_273, type, sK215: c_type > $int).
% 5.08/6.28 tff(func_def_274, type, sK216: c_type > $int).
% 5.08/6.28 tff(func_def_275, type, sK217: c_type > $int).
% 5.08/6.28 tff(pred_def_1, type, fresh: (c_ssorted * c_ssorted) > $o).
% 5.08/6.28 tff(pred_def_2, type, gt_pointer: (c_ssorted * c_ssorted) > $o).
% 5.08/6.28 tff(pred_def_3, type, valid_acc_range: (c_ssorted * $int) > $o).
% 5.08/6.28 tff(pred_def_4, type, on_stack: (c_ssorted * c_ssorted) > $o).
% 5.08/6.28 tff(pred_def_5, type, valid_acc: c_ssorted > $o).
% 5.08/6.28 tff(pred_def_6, type, le_pointer: (c_ssorted * c_ssorted) > $o).
% 5.08/6.28 tff(pred_def_7, type, not_assigns: (c_ssorted * c_ssorted * c_ssorted * c_ssorted) > $o).
% 5.08/6.28 tff(pred_def_8, type, valid_range: (c_ssorted * c_ssorted * $int * $int) > $o).
% 5.08/6.28 tff(pred_def_9, type, valid_index: (c_ssorted * c_ssorted * $int) > $o).
% 5.08/6.28 tff(pred_def_10, type, not_in_pset: (c_ssorted * c_ssorted) > $o).
% 5.08/6.28 tff(pred_def_11, type, ge_pointer: (c_ssorted * c_ssorted) > $o).
% 5.08/6.28 tff(pred_def_12, type, free_stack: (c_ssorted * c_ssorted * c_ssorted) > $o).
% 5.08/6.28 tff(pred_def_13, type, valid: (c_ssorted * c_ssorted) > $o).
% 5.08/6.28 tff(pred_def_14, type, separation1: (c_ssorted * c_ssorted) > $o).
% 5.08/6.28 tff(pred_def_15, type, alloc_extends: (c_ssorted * c_ssorted) > $o).
% 5.08/6.28 tff(pred_def_16, type, separation1_range: (c_ssorted * $int) > $o).
% 5.08/6.28 tff(pred_def_17, type, lt_pointer: (c_ssorted * c_ssorted) > $o).
% 5.08/6.28 tff(pred_def_18, type, on_heap: (c_ssorted * c_ssorted) > $o).
% 5.08/6.28 tff(pred_def_19, type, separation1_range1: (c_ssorted * c_ssorted * $int) > $o).
% 5.08/6.28 tff(pred_def_20, type, separation2_range1: (c_ssorted * c_ssorted * $int) > $o).
% 5.08/6.28 tff(pred_def_21, type, separation2: (c_ssorted * c_ssorted) > $o).
% 5.08/6.28 tff(f19,axiom,(
% 5.08/6.28 ! [X0 : $int,X1 : $int] : (ge_int_bool(X0,X1) = c_Boolean_true <=> $greatereq(X0,X1))),
% 5.08/6.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_19)).
% 5.08/6.28 tff(f101,axiom,(
% 5.08/6.28 ~ ! [X0 : $int,X1 : c_unique,X2 : $int,X3 : $int,X4 : c_unique] : ((X2 = 0 & X3 = 2800 & X0 = 10000 & valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X4),0,2800)) => ! [X5 : $int,X6 : c_unique] : (($lesseq(0,X5) & $lesseq(X5,2800) & ! [X7 : $int] : ? [X8 : c_type] : (X8 = type_pointer(type_global) & (($lesseq(0,X7) & $less(X7,X5)) => ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X4),X7))))) = 2000))) => ($difference(X5,X3) = 0 => ! [X9 : $int] : (($lesseq(0,X9) & $lesseq(X9,2800) & '%'(X9,14) = 0) => ! [X10 : $int] : (X10 = 0 => ! [X11 : $int] : (X11 = $product(X9,2) => (X11 != 0 => ! [X12 : $int] : (X12 = X9 => ! [X13 : $int,X14 : $int,X15 : $int,X16 : c_unique] : (($lesseq(1,X13) & $lesseq(X13,X9) & X15 = $product(X13,2)) => (1 != 0 => ! [X17 : c_unique] : ? [X18 : c_type] : (X18 = type_pointer(type_global) & (X17 = shift(c_sort(X18,X4),X13) => (valid(c_sort(type_alloc_table,X1),c_sort(X18,X17)) => ! [X19 : c_unique] : (X19 = acc(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X17)) => ! [X20 : $int] : (X20 = $sum(X14,$product(ss2Int(c_sort(c_int,X19)),X0)) => ! [X21 : c_unique] : (X21 = shift(c_sort(X18,X4),X13) => ! [X22 : $int] : (X22 = $difference(X15,1) => (X22 != 0 => ! [X23 : $int] : (X23 = '%'(X20,X22) => (valid(c_sort(type_alloc_table,X1),c_sort(X18,X21)) => ! [X24 : c_unique] : (X24 = upd(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X21),c_sort(c_int,int2U(X23))) => ! [X25 : $int] : (X25 = $difference(X22,1) => (X22 != 0 => ! [X26 : $int] : (X26 = whydivide(X20,X22) => ! [X27 : $int] : (X27 = X26 => ! [X28 : $int] : (X28 = $difference(X13,1) => (X28 = 0 => ! [X29 : $int] : (X29 = $difference(X9,14) => (X0 != 0 => ! [X30 : $int] : (X30 = whydivide(X27,X0) => (X0 != 0 => ! [X31 : $int] : (X31 = '%'(X27,X0) => ! [X32 : $int] : (X32 = X31 => $lesseq(X29,2800))))))))))))))))))))))))))))))))))),
% 5.08/6.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_101)).
% 5.08/6.28 tff(f104,plain,(
% 5.08/6.28 ! [X0 : $int,X1 : $int] : (ge_int_bool(X0,X1) = c_Boolean_true <=> ~$less(X0,X1))),
% 5.08/6.28 inference(theory_normalization,[],[f19])).
% 5.08/6.28 tff(f134,plain,(
% 5.08/6.28 ~ ! [X0 : $int,X1 : c_unique,X2 : $int,X3 : $int,X4 : c_unique] : ((X2 = 0 & X3 = 2800 & X0 = 10000 & valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X4),0,2800)) => ! [X5 : $int,X6 : c_unique] : ((~$less(X5,0) & ~$less(2800,X5) & ! [X7 : $int] : ? [X8 : c_type] : (X8 = type_pointer(type_global) & ((~$less(X7,0) & $less(X7,X5)) => ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X4),X7))))) = 2000))) => (0 = $sum(X5,$uminus(X3)) => ! [X9 : $int] : ((~$less(X9,0) & ~$less(2800,X9) & '%'(X9,14) = 0) => ! [X10 : $int] : (X10 = 0 => ! [X11 : $int] : (X11 = $product(X9,2) => (X11 != 0 => ! [X12 : $int] : (X12 = X9 => ! [X13 : $int,X14 : $int,X15 : $int,X16 : c_unique] : ((~$less(X13,1) & ~$less(X9,X13) & X15 = $product(X13,2)) => (1 != 0 => ! [X17 : c_unique] : ? [X18 : c_type] : (X18 = type_pointer(type_global) & (X17 = shift(c_sort(X18,X4),X13) => (valid(c_sort(type_alloc_table,X1),c_sort(X18,X17)) => ! [X19 : c_unique] : (X19 = acc(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X17)) => ! [X20 : $int] : (X20 = $sum(X14,$product(ss2Int(c_sort(c_int,X19)),X0)) => ! [X21 : c_unique] : (X21 = shift(c_sort(X18,X4),X13) => ! [X22 : $int] : ($sum(X15,$uminus(1)) = X22 => (X22 != 0 => ! [X23 : $int] : (X23 = '%'(X20,X22) => (valid(c_sort(type_alloc_table,X1),c_sort(X18,X21)) => ! [X24 : c_unique] : (X24 = upd(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X21),c_sort(c_int,int2U(X23))) => ! [X25 : $int] : ($sum(X22,$uminus(1)) = X25 => (X22 != 0 => ! [X26 : $int] : (X26 = whydivide(X20,X22) => ! [X27 : $int] : (X27 = X26 => ! [X28 : $int] : ($sum(X13,$uminus(1)) = X28 => (X28 = 0 => ! [X29 : $int] : ($sum(X9,$uminus(14)) = X29 => (X0 != 0 => ! [X30 : $int] : (X30 = whydivide(X27,X0) => (X0 != 0 => ! [X31 : $int] : (X31 = '%'(X27,X0) => ! [X32 : $int] : (X32 = X31 => ~$less(2800,X29))))))))))))))))))))))))))))))))))),
% 5.08/6.28 inference(theory_normalization,[],[f101])).
% 5.08/6.28 tff(f135,definition,(
% 5.08/6.28 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 5.08/6.28 introduced(theory,[tha_commutativity])).
% 5.08/6.28 tff(f141,definition,(
% 5.08/6.28 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X1,X2) | ~$less(X0,X1) | $less(X0,X2)) )),
% 5.08/6.28 introduced(theory,[tha_transitivity])).
% 5.08/6.28 tff(f142,definition,(
% 5.08/6.28 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )),
% 5.08/6.28 introduced(theory,[tha_order_totality])).
% 5.08/6.28 tff(f143,definition,(
% 5.08/6.28 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,X1) | $less($sum(X0,X2),$sum(X1,X2))) )),
% 5.08/6.28 introduced(theory,[tha_order_monotonicity])).
% 5.08/6.28 tff(f152,definition,(
% 5.08/6.28 ( ! [X0 : $int,X1 : $int] : (~$less(X1,$sum(X0,1)) | ~$less(X0,X1)) )),
% 5.08/6.28 introduced(theory,[tha_extra_integer_ordering])).
% 5.08/6.28 tff(f236,plain,(
% 5.08/6.28 ? [X0 : $int,X1 : c_unique,X2 : $int,X3 : $int,X4 : c_unique] : (? [X5 : $int,X6 : c_unique] : ((? [X9 : $int] : (? [X10 : $int] : (? [X11 : $int] : ((? [X12 : $int] : (? [X13 : $int,X14 : $int,X15 : $int,X16 : c_unique] : ((? [X17 : c_unique] : ! [X18 : c_type] : (type_pointer(type_global) != X18 | ((? [X19 : c_unique] : (? [X20 : $int] : (? [X21 : c_unique] : (? [X22 : $int] : ((? [X23 : $int] : ((? [X24 : c_unique] : (? [X25 : $int] : ((? [X26 : $int] : (? [X27 : $int] : (? [X28 : $int] : ((? [X29 : $int] : ((? [X30 : $int] : ((? [X31 : $int] : (? [X32 : $int] : ($less(2800,X29) & X32 = X31) & X31 = '%'(X27,X0)) & X0 != 0) & X30 = whydivide(X27,X0)) & X0 != 0) & $sum(X9,$uminus(14)) = X29) & X28 = 0) & $sum(X13,$uminus(1)) = X28) & X27 = X26) & X26 = whydivide(X20,X22)) & X22 != 0) & $sum(X22,$uminus(1)) = X25) & X24 = upd(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X21),c_sort(c_int,int2U(X23)))) & valid(c_sort(type_alloc_table,X1),c_sort(X18,X21))) & X23 = '%'(X20,X22)) & X22 != 0) & $sum(X15,$uminus(1)) = X22) & X21 = shift(c_sort(X18,X4),X13)) & X20 = $sum(X14,$product(ss2Int(c_sort(c_int,X19)),X0))) & X19 = acc(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X17))) & valid(c_sort(type_alloc_table,X1),c_sort(X18,X17))) & X17 = shift(c_sort(X18,X4),X13))) & 1 != 0) & (~$less(X13,1) & ~$less(X9,X13) & X15 = $product(X13,2))) & X12 = X9) & X11 != 0) & X11 = $product(X9,2)) & X10 = 0) & (~$less(X9,0) & ~$less(2800,X9) & '%'(X9,14) = 0)) & 0 = $sum(X5,$uminus(X3))) & (~$less(X5,0) & ~$less(2800,X5) & ! [X7 : $int] : ? [X8 : c_type] : (X8 = type_pointer(type_global) & (ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X4),X7))))) = 2000 | ($less(X7,0) | ~$less(X7,X5)))))) & (X2 = 0 & X3 = 2800 & X0 = 10000 & valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X4),0,2800)))),
% 5.08/6.28 inference(ennf_transformation,[],[f134])).
% 5.08/6.28 tff(f237,plain,(
% 5.08/6.28 ? [X0 : $int,X1 : c_unique,X2 : $int,X3 : $int,X4 : c_unique] : (? [X5 : $int,X6 : c_unique] : (? [X9 : $int] : (? [X10 : $int] : (? [X11 : $int] : (? [X12 : $int] : (? [X13 : $int,X14 : $int,X15 : $int,X16 : c_unique] : (? [X17 : c_unique] : ! [X18 : c_type] : (type_pointer(type_global) != X18 | (? [X19 : c_unique] : (? [X20 : $int] : (? [X21 : c_unique] : (? [X22 : $int] : (? [X23 : $int] : (? [X24 : c_unique] : (? [X25 : $int] : (? [X26 : $int] : (? [X27 : $int] : (? [X28 : $int] : (? [X29 : $int] : (? [X30 : $int] : (? [X31 : $int] : (? [X32 : $int] : ($less(2800,X29) & X32 = X31) & X31 = '%'(X27,X0)) & X0 != 0 & X30 = whydivide(X27,X0)) & X0 != 0 & $sum(X9,$uminus(14)) = X29) & X28 = 0 & $sum(X13,$uminus(1)) = X28) & X27 = X26) & X26 = whydivide(X20,X22)) & X22 != 0 & $sum(X22,$uminus(1)) = X25) & X24 = upd(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X21),c_sort(c_int,int2U(X23)))) & valid(c_sort(type_alloc_table,X1),c_sort(X18,X21)) & X23 = '%'(X20,X22)) & X22 != 0 & $sum(X15,$uminus(1)) = X22) & X21 = shift(c_sort(X18,X4),X13)) & X20 = $sum(X14,$product(ss2Int(c_sort(c_int,X19)),X0))) & X19 = acc(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X17))) & valid(c_sort(type_alloc_table,X1),c_sort(X18,X17)) & X17 = shift(c_sort(X18,X4),X13))) & 1 != 0 & ~$less(X13,1) & ~$less(X9,X13) & X15 = $product(X13,2)) & X12 = X9) & X11 != 0 & X11 = $product(X9,2)) & X10 = 0) & ~$less(X9,0) & ~$less(2800,X9) & '%'(X9,14) = 0) & 0 = $sum(X5,$uminus(X3)) & ~$less(X5,0) & ~$less(2800,X5) & ! [X7 : $int] : ? [X8 : c_type] : (X8 = type_pointer(type_global) & (ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X4),X7))))) = 2000 | $less(X7,0) | ~$less(X7,X5)))) & X2 = 0 & X3 = 2800 & X0 = 10000 & valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X4),0,2800))),
% 5.08/6.28 inference(flattening,[],[f236])).
% 5.08/6.28 tff(f259,plain,(
% 5.08/6.28 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | c_Boolean_true = ge_int_bool(X0,X1)) )),
% 5.08/6.28 inference(cnf_transformation,[],[f104])).
% 5.08/6.28 tff(f260,plain,(
% 5.08/6.28 ( ! [X0 : $int,X1 : $int] : (c_Boolean_true != ge_int_bool(X0,X1) | ~$less(X0,X1)) )),
% 5.08/6.28 inference(cnf_transformation,[],[f104])).
% 5.08/6.28 tff(f550,plain,(
% 5.08/6.28 ( ! [X18 : c_type] : ($less(2800,sK214(X18)) | type_pointer(type_global) != X18) )),
% 5.08/6.28 inference(cnf_transformation,[],[f237])).
% 5.08/6.28 tff(f554,plain,(
% 5.08/6.28 ( ! [X18 : c_type] : (sK214(X18) = $sum(sK194,$uminus(14)) | type_pointer(type_global) != X18) )),
% 5.08/6.28 inference(cnf_transformation,[],[f237])).
% 5.08/6.28 tff(f576,plain,(
% 5.08/6.28 sK194 = sK198),
% 5.08/6.28 inference(cnf_transformation,[],[f237])).
% 5.08/6.28 tff(f583,plain,(
% 5.08/6.28 ~$less(2800,sK194)),
% 5.08/6.28 inference(cnf_transformation,[],[f237])).
% 5.08/6.28 tff(f757,plain,(
% 5.08/6.28 ~$less(2800,sK198)),
% 5.08/6.28 inference(definition_unfolding,[],[f583,f576])).
% 5.08/6.28 tff(f764,plain,(
% 5.08/6.28 ( ! [X18 : c_type] : (sK214(X18) = $sum(sK198,$uminus(14)) | type_pointer(type_global) != X18) )),
% 5.08/6.28 inference(definition_unfolding,[],[f554,f576])).
% 5.08/6.28 tff(f870,plain,(
% 5.08/6.28 $sum(sK198,$uminus(14)) = sK214(type_pointer(type_global))),
% 5.08/6.28 inference(equality_resolution,[],[f764])).
% 5.08/6.28 tff(f874,plain,(
% 5.08/6.28 $less(2800,sK214(type_pointer(type_global)))),
% 5.08/6.28 inference(equality_resolution,[],[f550])).
% 5.08/6.28 tff(f962,plain,(
% 5.08/6.28 sK214(type_pointer(type_global)) = $sum(sK198,-14)),
% 5.08/6.28 inference(evaluation,[],[f870])).
% 5.08/6.28 tff(f1009,plain,(
% 5.08/6.28 sK214(type_pointer(type_global)) = $sum(-14,sK198)),
% 5.08/6.28 inference(forward_demodulation,[],[f962,f135])).
% 5.08/6.28 tff(f1013,plain,(
% 5.08/6.28 $less(2800,$sum(-14,sK198))),
% 5.08/6.28 inference(superposition,[],[f874,f1009])).
% 5.08/6.28 tff(f1021,plain,(
% 5.08/6.28 ( ! [X0 : $int,X1 : $int] : (~$less(X1,$sum(1,X0)) | ~$less(X0,X1)) )),
% 5.08/6.28 inference(superposition,[],[f152,f135])).
% 5.08/6.28 tff(f1109,plain,(
% 5.08/6.28 ( ! [X0 : $int] : (~$less(X0,2800) | $less(X0,sK214(type_pointer(type_global)))) )),
% 5.08/6.28 inference(resolution,[],[f141,f874])).
% 5.08/6.28 tff(f1115,plain,(
% 5.08/6.28 ( ! [X0 : $int] : (~$less(X0,2800) | $less(X0,$sum(-14,sK198))) )),
% 5.08/6.28 inference(forward_demodulation,[],[f1109,f1009])).
% 5.08/6.28 tff(f1191,plain,(
% 5.08/6.28 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($less($sum(X0,X1),$sum(X2,X1)) | c_Boolean_true = ge_int_bool(X0,X2)) )),
% 5.08/6.28 inference(resolution,[],[f143,f259])).
% 5.08/6.28 tff(f2223,plain,(
% 5.08/6.28 ( ! [X0 : $int] : ($less(X0,$sum(-14,sK198)) | $less(2800,X0) | 2800 = X0) )),
% 5.08/6.28 inference(resolution,[],[f1115,f142])).
% 5.08/6.28 tff(f3674,definition,(
% 5.08/6.28 spl218_33 <=> 2800 = sK198),
% 5.08/6.28 introduced(definition,[new_symbols(definition,[spl218_33])],[avatar_definition])).
% 5.08/6.28 tff(f3675,plain,(
% 5.08/6.28 2800 != sK198 | spl218_33),
% 5.08/6.28 inference(avatar_component_clause,[],[f3674])).
% 5.08/6.28 tff(f3676,plain,(
% 5.08/6.28 2800 = sK198 | ~spl218_33),
% 5.08/6.28 inference(avatar_component_clause,[],[f3674])).
% 5.08/6.28 tff(f4006,plain,(
% 5.08/6.28 $less(2800,$sum(-14,2800)) | ~spl218_33),
% 5.08/6.28 inference(superposition,[],[f1013,f3676])).
% 5.08/6.28 tff(f4052,plain,(
% 5.08/6.28 $false | ~spl218_33),
% 5.08/6.28 inference(evaluation,[],[f4006])).
% 5.08/6.28 tff(f4053,plain,(
% 5.08/6.28 ~spl218_33),
% 5.08/6.28 inference(avatar_contradiction_clause,[],[f4052])).
% 5.08/6.28 tff(f4573,plain,(
% 5.08/6.28 ( ! [X0 : $int,X1 : $int] : (~$less(X1,$sum(X0,X1)) | c_Boolean_true = ge_int_bool(X0,1)) )),
% 5.08/6.28 inference(resolution,[],[f1191,f1021])).
% 5.08/6.28 tff(f19239,definition,(
% 5.08/6.28 spl218_192 <=> c_Boolean_true = ge_int_bool(-14,1)),
% 5.08/6.28 introduced(definition,[new_symbols(definition,[spl218_192])],[avatar_definition])).
% 5.08/6.28 tff(f19241,plain,(
% 5.08/6.28 c_Boolean_true = ge_int_bool(-14,1) | ~spl218_192),
% 5.08/6.28 inference(avatar_component_clause,[],[f19239])).
% 5.08/6.28 tff(f21150,plain,(
% 5.08/6.28 $less(2800,sK198) | 2800 = sK198 | c_Boolean_true = ge_int_bool(-14,1)),
% 5.08/6.28 inference(resolution,[],[f2223,f4573])).
% 5.08/6.28 tff(f21184,plain,(
% 5.08/6.28 2800 = sK198 | c_Boolean_true = ge_int_bool(-14,1)),
% 5.08/6.28 inference(forward_subsumption_resolution,[],[f21150,f757])).
% 5.08/6.28 tff(f21187,plain,(
% 5.08/6.28 c_Boolean_true = ge_int_bool(-14,1) | spl218_33),
% 5.08/6.28 inference(forward_subsumption_resolution,[],[f21184,f3675])).
% 5.08/6.28 tff(f21198,plain,(
% 5.08/6.28 spl218_192 | spl218_33),
% 5.08/6.28 inference(avatar_split_clause,[],[f21187,f3674,f19239])).
% 5.08/6.28 tff(f25267,plain,(
% 5.08/6.28 c_Boolean_true != c_Boolean_true | ~$less(-14,1) | ~spl218_192),
% 5.08/6.28 inference(superposition,[],[f260,f19241])).
% 5.08/6.28 tff(f25268,plain,(
% 5.08/6.28 ~$less(-14,1) | ~spl218_192),
% 5.08/6.28 inference(trivial_inequality_removal,[],[f25267])).
% 5.08/6.28 tff(f25269,plain,(
% 5.08/6.28 $false | ~spl218_192),
% 5.08/6.28 inference(evaluation,[],[f25268])).
% 5.08/6.28 tff(f25270,plain,(
% 5.08/6.28 ~spl218_192),
% 5.08/6.28 inference(avatar_contradiction_clause,[],[f25269])).
% 5.08/6.28 cnf(s66, plain, ~spl218_33, inference(sat_conversion,[],[f4053])).
% 5.08/6.28 cnf(s818, plain, spl218_33 | spl218_192, inference(sat_conversion,[],[f21198])).
% 5.08/6.28 cnf(s863, plain, ~spl218_192, inference(sat_conversion,[],[f25270])).
% 5.08/6.28 cnf(s864, plain, spl218_33, inference(rat,[],[s818,s863])).
% 5.08/6.28 cnf(s890, plain, $false, inference(rat,[],[s66,s864])).
% 5.08/6.28 tff(f25273,plain,(
% 5.08/6.28 $false),
% 5.08/6.28 inference(avatar_sat_refutation,[],[s890])).
% 5.08/6.28 % SZS output end Proof for theBenchmark
% 5.08/6.28 % (3670907)------------------------------
% 5.08/6.28 % (3670907)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.08/6.28 % (3670907)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.08/6.28 % (3670907)CaDiCaL version: 2.1.3
% 5.08/6.28 % (3670907)Termination reason: Refutation
% 5.08/6.28 % (3670907)Time elapsed: 0.785 s
% 5.08/6.28 % (3670907)Peak memory usage: 22 MB
% 5.08/6.28 % (3670907)Instructions burned: 1365 (million)
% 5.08/6.28 % (3670901)Success in time 0.827 s
% 5.08/6.28 % Vampire exiting
%------------------------------------------------------------------------------