%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ITP006^2 : TPTP v9.3.1. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:10:01 AM UTC 2026
% Result : Theorem 9.19s 1.66s
% Output : Refutation 9.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP006^2 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n010.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 19:23:09 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.43/0.96 % (3289626)Will run a generic schedule for satisfiability detection.
% 4.43/0.96 % (3289634)dis+10_1_sil=32000:sp=arity:random_seed=1201636689:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.43/0.96 % (3289632)% WARNING: option uhcvi not known.
% 4.43/0.96 % (3289631)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3555648643_2999 on theBenchmark for (2999ds/0Mi)
% 4.43/0.96 % (3289632)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2511896368:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.43/0.96 % (3289633)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3228502744:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.43/0.96 % (3289635)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2915938059:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.43/0.96 % (3289636)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2607398468:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.43/0.96 % (3289637)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3683311374:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.43/0.96 % (3289632)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 4.43/0.96 % (3289635)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 4.43/0.96 % Exception at run slice level
% 4.43/0.96 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.43/0.96 % (3289632)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 4.43/0.96 % (3289634)Instruction limit reached!
% 4.43/0.96 % (3289634)------------------------------
% 4.43/0.96 % (3289634)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.43/0.96 % (3289634)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.43/0.96 % (3289634)CaDiCaL version: 2.1.3
% 4.43/0.96 % (3289634)Termination reason: Instruction limit
% 4.43/0.96 % (3289634)Termination phase: Saturation
% 4.43/0.96 % (3289634)Time elapsed: 0.028 s
% 4.43/0.96 % (3289634)Peak memory usage: 12 MB
% 4.43/0.96 % (3289634)Instructions burned: 104 (million)
% 4.43/0.96 % (3289645)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=127787372:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 4.43/0.96 % (3289646)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1929295661:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 4.43/0.96 % Exception at run slice level
% 4.43/0.96 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.43/0.96 % (3289635)Instruction limit reached!
% 4.43/0.96 % (3289635)------------------------------
% 4.43/0.96 % (3289635)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.43/0.96 % (3289635)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.43/0.96 % (3289635)CaDiCaL version: 2.1.3
% 4.43/0.96 % (3289635)Termination reason: Instruction limit
% 4.43/0.96 % (3289635)Termination phase: Saturation
% 4.43/0.96 % (3289635)Time elapsed: 0.056 s
% 4.43/0.96 % (3289635)Peak memory usage: 12 MB
% 4.43/0.96 % (3289635)Instructions burned: 117 (million)
% 4.43/0.96 % (3289646)Instruction limit reached!
% 4.43/0.96 % (3289646)------------------------------
% 4.43/0.96 % (3289646)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.43/0.96 % (3289646)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.43/0.96 % (3289646)CaDiCaL version: 2.1.3
% 4.43/0.96 % (3289646)Termination reason: Instruction limit
% 4.43/0.96 % (3289646)Termination phase: Saturation
% 4.43/0.96 % (3289646)Time elapsed: 0.032 s
% 4.43/0.96 % (3289646)Peak memory usage: 12 MB
% 4.43/0.96 % (3289646)Instructions burned: 134 (million)
% 4.43/0.96 % (3289649)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=2794154324:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 4.43/0.96 % (3289636)Instruction limit reached!
% 4.43/0.96 % (3289636)------------------------------
% 4.43/0.96 % (3289636)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.43/0.96 % (3289636)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.43/0.96 % (3289636)CaDiCaL version: 2.1.3
% 4.43/0.96 % (3289636)Termination reason: Instruction limit
% 9.19/1.66 % (3289636)Termination phase: Saturation
% 9.19/1.66 % (3289636)Time elapsed: 0.064 s
% 9.19/1.66 % (3289636)Peak memory usage: 13 MB
% 9.19/1.66 % (3289636)Instructions burned: 132 (million)
% 9.19/1.66 % (3289649)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 9.19/1.66 % (3289652)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2130852276:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 9.19/1.66 % (3289637)Instruction limit reached!
% 9.19/1.66 % (3289637)------------------------------
% 9.19/1.66 % (3289637)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.19/1.66 % (3289637)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.19/1.66 % (3289637)CaDiCaL version: 2.1.3
% 9.19/1.66 % (3289637)Termination reason: Instruction limit
% 9.19/1.66 % (3289637)Termination phase: Saturation
% 9.19/1.66 % (3289637)Time elapsed: 0.075 s
% 9.19/1.66 % (3289637)Peak memory usage: 13 MB
% 9.19/1.66 % (3289637)Instructions burned: 161 (million)
% 9.19/1.66 % (3289650)ott-21_1_sil=16000:fs=off:random_seed=1312735704:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 9.19/1.66 % (3289649)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 9.19/1.66 % (3289653)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2117002464:fmbsr=1.3:i=865:ins=25_2999 on theBenchmark for (2999ds/865Mi)
% 9.19/1.66 % (3289656)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3573031791:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 9.19/1.66 % Exception at run slice level
% 9.19/1.66 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 9.19/1.66 % (3289659)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2718885385:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 9.19/1.66 % Exception at run slice level
% 9.19/1.66 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 9.19/1.66 % (3289661)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=244938221: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)
% 9.19/1.66 % (3289661)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 9.19/1.66 % (3289650)Instruction limit reached!
% 9.19/1.66 % (3289650)------------------------------
% 9.19/1.66 % (3289650)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.19/1.66 % (3289650)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.19/1.66 % (3289650)CaDiCaL version: 2.1.3
% 9.19/1.66 % (3289650)Termination reason: Instruction limit
% 9.19/1.66 % (3289650)Termination phase: Saturation
% 9.19/1.66 % (3289650)Time elapsed: 0.085 s
% 9.19/1.66 % (3289650)Peak memory usage: 12 MB
% 9.19/1.66 % (3289650)Instructions burned: 180 (million)
% 9.19/1.66 % (3289663)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=88901450:i=879:kws=inv_precedence:fsr=off_2998 on theBenchmark for (2998ds/879Mi)
% 9.19/1.66 % (3289663)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 9.19/1.66 % (3289652)Instruction limit reached!
% 9.19/1.66 % (3289652)------------------------------
% 9.19/1.66 % (3289652)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.19/1.66 % (3289652)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.19/1.66 % (3289652)CaDiCaL version: 2.1.3
% 9.19/1.66 % (3289652)Termination reason: Instruction limit
% 9.19/1.66 % (3289652)Termination phase: Saturation
% 9.19/1.66 % (3289652)Time elapsed: 0.137 s
% 9.19/1.66 % (3289652)Peak memory usage: 13 MB
% 9.19/1.66 % (3289652)Instructions burned: 478 (million)
% 9.19/1.66 % (3289665)fmb+10_1_sil=64000:random_seed=3688310756:i=22061:nm=2:gsp=on_2997 on theBenchmark for (2997ds/22061Mi)
% 9.19/1.66 % (3289665)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 9.19/1.66 % Exception at run slice level
% 9.19/1.66 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 9.19/1.66 % (3289667)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1621014254:i=9515:nm=5_2997 on theBenchmark for (2997ds/9515Mi)
% 9.19/1.66 % Exception at run slice level
% 9.19/1.66 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 9.19/1.66 % (3289669)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=59543640:fmbsr=1.7:i=920_2997 on theBenchmark for (2997ds/920Mi)
% 9.19/1.66 % Exception at run slice level
% 9.19/1.66 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 9.19/1.66 % (3289671)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=924253815:i=5131_2997 on theBenchmark for (2997ds/5131Mi)
% 9.19/1.66 % (3289671)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 9.19/1.66 % (3289649)Instruction limit reached!
% 9.19/1.66 % (3289649)------------------------------
% 9.19/1.66 % (3289649)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.19/1.66 % (3289649)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.19/1.66 % (3289649)CaDiCaL version: 2.1.3
% 9.19/1.66 % (3289649)Termination reason: Instruction limit
% 9.19/1.66 % (3289649)Termination phase: Saturation
% 9.19/1.66 % (3289649)Time elapsed: 0.333 s
% 9.19/1.66 % (3289649)Peak memory usage: 14 MB
% 9.19/1.66 % (3289649)Instructions burned: 686 (million)
% 9.19/1.66 % (3289673)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=125957368:i=1472:ins=7:fdi=8:gsp=on_2995 on theBenchmark for (2995ds/1472Mi)
% 9.19/1.66 % (3289673)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 9.19/1.66 % (3289673)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 9.19/1.66 % (3289661)Instruction limit reached!
% 9.19/1.66 % (3289661)------------------------------
% 9.19/1.66 % (3289661)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.19/1.66 % (3289661)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.19/1.66 % (3289661)CaDiCaL version: 2.1.3
% 9.19/1.66 % (3289661)Termination reason: Instruction limit
% 9.19/1.66 % (3289661)Termination phase: Saturation
% 9.19/1.66 % (3289661)Time elapsed: 0.325 s
% 9.19/1.66 % (3289661)Peak memory usage: 16 MB
% 9.19/1.66 % (3289661)Instructions burned: 694 (million)
% 9.19/1.66 % (3289675)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=3140724022:i=6324_2994 on theBenchmark for (2994ds/6324Mi)
% 9.19/1.66 % Exception at run slice level
% 9.19/1.66 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 9.19/1.66 % (3289677)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=3894955904:fmbsr=2.30978:i=2174_2994 on theBenchmark for (2994ds/2174Mi)
% 9.19/1.66 % Exception at run slice level
% 9.19/1.66 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 9.19/1.66 % (3289679)ott-2_1_sil=16000:newcnf=on:random_seed=1851600393:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2994 on theBenchmark for (2994ds/869Mi)
% 9.19/1.66 % (3289679)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 9.19/1.66 % (3289663)Instruction limit reached!
% 9.19/1.66 % (3289663)------------------------------
% 9.19/1.66 % (3289663)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.19/1.66 % (3289663)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.19/1.66 % (3289663)CaDiCaL version: 2.1.3
% 9.19/1.66 % (3289663)Termination reason: Instruction limit
% 9.19/1.66 % (3289663)Termination phase: Saturation
% 9.19/1.66 % (3289663)Time elapsed: 0.455 s
% 9.19/1.66 % (3289663)Peak memory usage: 16 MB
% 9.19/1.66 % (3289663)Instructions burned: 879 (million)
% 9.19/1.66 % (3289681)ott+10_1_sil=32000:tgt=ground:random_seed=1017221716:i=5114:av=off_2993 on theBenchmark for (2993ds/5114Mi)
% 9.19/1.66 % (3289656)Instruction limit reached!
% 9.19/1.66 % (3289656)------------------------------
% 9.19/1.66 % (3289656)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.19/1.66 % (3289656)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.19/1.66 % (3289656)CaDiCaL version: 2.1.3
% 9.19/1.66 % (3289656)Termination reason: Instruction limit
% 9.19/1.66 % (3289656)Termination phase: Saturation
% 9.19/1.66 % (3289656)Time elapsed: 0.570 s
% 9.19/1.66 % (3289656)Peak memory usage: 16 MB
% 9.19/1.66 % (3289656)Instructions burned: 1179 (million)
% 9.19/1.66 % (3289683)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=227817497:i=54282_2993 on theBenchmark for (2993ds/54282Mi)
% 9.19/1.66 % Exception at run slice level
% 9.19/1.66 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 9.19/1.66 % (3289685)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=597936335:i=3512:aac=none_2992 on theBenchmark for (2992ds/3512Mi)
% 9.19/1.66 % (3289685)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 9.19/1.66 % (3289679)Instruction limit reached!
% 9.19/1.66 % (3289679)------------------------------
% 9.19/1.66 % (3289679)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.19/1.66 % (3289679)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.19/1.66 % (3289679)CaDiCaL version: 2.1.3
% 9.19/1.66 % (3289679)Termination reason: Instruction limit
% 9.19/1.66 % (3289679)Termination phase: Saturation
% 9.19/1.66 % (3289679)Time elapsed: 0.415 s
% 9.19/1.66 % (3289679)Peak memory usage: 16 MB
% 9.19/1.66 % (3289679)Instructions burned: 871 (million)
% 9.19/1.66 % (3289687)dis+21_1_sil=32000:sas=cadical:random_seed=2661482801:i=3773:amm=off_2989 on theBenchmark for (2989ds/3773Mi)
% 9.19/1.66 % (3289673)Instruction limit reached!
% 9.19/1.66 % (3289673)------------------------------
% 9.19/1.66 % (3289673)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.19/1.66 % (3289673)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.19/1.66 % (3289673)CaDiCaL version: 2.1.3
% 9.19/1.66 % (3289673)Termination reason: Instruction limit
% 9.19/1.66 % (3289673)Termination phase: Saturation
% 9.19/1.66 % (3289673)Time elapsed: 0.732 s
% 9.19/1.66 % (3289673)Peak memory usage: 15 MB
% 9.19/1.66 % (3289673)Instructions burned: 1474 (million)
% 9.19/1.66 % (3289689)ott+11_1_sil=16000:gs=on:random_seed=3904412122:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2988 on theBenchmark for (2988ds/2251Mi)
% 9.19/1.66 % (3289689)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 9.19/1.66 % (3289687) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3289626-3289687"...
% 9.19/1.66 % (3289687)...printing done.
% 9.19/1.66 % (3289687)Refutation found. Thanks to Tanya!
% 9.19/1.66 % SZS status Theorem for theBenchmark
% 9.19/1.66 % SZS output start Proof for theBenchmark
% 9.19/1.66 thf(type_def_5, type, del: $tType).
% 9.19/1.66 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 9.19/1.66 thf(func_def_0, type, bool: del).
% 9.19/1.66 thf(func_def_1, type, ind: del).
% 9.19/1.66 thf(func_def_2, type, arr: (del > del > del)).
% 9.19/1.66 thf(func_def_3, type, mem: ($i > del > $o)).
% 9.19/1.66 thf(func_def_4, type, ap: ($i > $i > $i)).
% 9.19/1.66 thf(func_def_5, type, lam: (del > ($i > $i) > $i)).
% 9.19/1.66 thf(func_def_6, type, p: ($i > $o)).
% 9.19/1.66 thf(func_def_7, type, inj__o: ($o > $i)).
% 9.19/1.66 thf(func_def_10, type, c_2EquantHeuristics_2EGUESS__FORALL__GAP: (del > del > $i)).
% 9.19/1.66 thf(func_def_11, type, c_2EquantHeuristics_2EGUESS__EXISTS__GAP: (del > del > $i)).
% 9.19/1.66 thf(func_def_12, type, c_2EquantHeuristics_2EGUESS__FORALL__POINT: (del > del > $i)).
% 9.19/1.66 thf(func_def_13, type, c_2EquantHeuristics_2EGUESS__EXISTS__POINT: (del > del > $i)).
% 9.19/1.66 thf(func_def_14, type, c_2EquantHeuristics_2EGUESS__FORALL: (del > del > $i)).
% 9.19/1.66 thf(func_def_15, type, c_2Ebool_2E_3F: (del > $i)).
% 9.19/1.66 thf(func_def_16, type, c_2EquantHeuristics_2EGUESS__EXISTS: (del > del > $i)).
% 9.19/1.66 thf(func_def_20, type, c_2Emin_2E_3D: (del > $i)).
% 9.19/1.66 thf(func_def_23, type, c_2Ebool_2E_21: (del > $i)).
% 9.19/1.66 thf(func_def_26, type, sP0: (del > del > $i > $i > $o)).
% 9.19/1.66 thf(func_def_27, type, sP1: (del > del > $i > $i > $o)).
% 9.19/1.66 thf(func_def_28, type, sP2: (del > del > $o)).
% 9.19/1.66 thf(func_def_29, type, sP3: (del > del > $o)).
% 9.19/1.66 thf(func_def_30, type, sP4: (del > del > $o)).
% 9.19/1.66 thf(func_def_31, type, sP5: ($i > $i > $i > $o)).
% 9.19/1.66 thf(func_def_32, type, sP6: ($i > $i > $i > $o)).
% 9.19/1.66 thf(func_def_33, type, sP7: ($i > $i > $i > $o)).
% 9.19/1.66 thf(func_def_34, type, sP8: ($i > $i > $i > $o)).
% 9.19/1.66 thf(func_def_35, type, sP9: ($i > $i > $i > $o)).
% 9.19/1.66 thf(func_def_36, type, sP10: ($i > $i > $i > $o)).
% 9.19/1.66 thf(func_def_37, type, sP11: ($i > $i > $i > $o)).
% 9.19/1.66 thf(func_def_38, type, sP12: ($i > $i > $i > $o)).
% 9.19/1.66 thf(func_def_39, type, sP13: ($i > $i > $i > $o)).
% 9.19/1.66 thf(func_def_40, type, sP14: ($i > $i > $i > $o)).
% 9.19/1.66 thf(func_def_41, type, sP15: ($i > $i > $i > $o)).
% 9.19/1.66 thf(func_def_42, type, sP16: ($i > $i > $o)).
% 9.19/1.66 thf(func_def_43, type, sP17: ($i > $i > $o)).
% 9.19/1.66 thf(func_def_44, type, sK18: (($i > $i) > del > del > $i)).
% 9.19/1.66 thf(func_def_45, type, sK19: ($i > $i > del > $i)).
% 9.19/1.66 thf(func_def_46, type, sK20: ($i > del > $i)).
% 9.19/1.66 thf(func_def_47, type, sK21: ($i > del > $i)).
% 9.19/1.66 thf(func_def_48, type, sK22: ($i > $i > del > $i)).
% 9.19/1.66 thf(func_def_49, type, sK23: ($i > $i > del > del > $i)).
% 9.19/1.66 thf(func_def_50, type, sK24: ($i > $i > del > $i)).
% 9.19/1.66 thf(func_def_51, type, sK25: ($i > $i > del > del > $i)).
% 9.19/1.66 thf(func_def_52, type, sK26: ($i > $i > del > $i)).
% 9.19/1.66 thf(func_def_53, type, sK27: (del > del > $i > $i > $i)).
% 9.19/1.66 thf(func_def_54, type, sK28: (del > $i > $i > $i)).
% 9.19/1.66 thf(func_def_55, type, sK29: (del > del > $i > $i > $i)).
% 9.19/1.66 thf(func_def_56, type, sK30: (del > $i > $i > $i)).
% 9.19/1.66 thf(func_def_57, type, sK31: ($i > $i > del > $i)).
% 9.19/1.66 thf(func_def_58, type, sK32: del).
% 9.19/1.66 thf(func_def_59, type, sK33: del).
% 9.19/1.66 thf(func_def_63, type, vNOT: ($o > $o)).
% 9.19/1.66 thf(func_def_65, type, db0: !>[X0: $tType]:(X0)).
% 9.19/1.66 thf(func_def_66, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 9.19/1.66 thf(func_def_67, type, db1: !>[X0: $tType]:(X0)).
% 9.19/1.66 thf(f3,axiom,(
% 9.19/1.66 ! [X0 : $i] : ((mem @ X0 @ bool) => (X0 = ((inj__o @ (p @ X0)))))),
% 9.19/1.66 file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP001^2.ax',stp_iso_mem_o)).
% 9.19/1.66 thf(f4,axiom,(
% 9.19/1.66 ! [X0 : del,X1 : del,X2 : $i] : ((mem @ X2 @ (arr @ X0 @ X1)) => ! [X3 : $i] : ((mem @ X3 @ X0) => (mem @ (ap @ X2 @ X3) @ X1)))),
% 9.19/1.66 file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP001^2.ax',ap_tp)).
% 9.19/1.66 thf(f18,axiom,(
% 9.19/1.66 (mem @ c_2Ebool_2EF @ bool)),
% 9.19/1.66 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mem_c_2Ebool_2EF)).
% 9.19/1.66 thf(f19,axiom,(
% 9.19/1.66 ~(p @ c_2Ebool_2EF)),
% 9.19/1.66 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_false_p)).
% 9.19/1.66 thf(f39,axiom,(
% 9.19/1.66 ! [X0 : del,X1 : del,X2 : $i] : ((mem @ X2 @ (arr @ X0 @ X1)) => ! [X3 : $i] : ((mem @ X3 @ (arr @ X1 @ bool)) => (! [X18 : $i] : ((mem @ X18 @ (arr @ X0 @ X1)) => ! [X19 : $i] : ((mem @ X19 @ (arr @ X1 @ bool)) => ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1) @ X18) @ X19)) <=> ! [X20 : $i] : ((mem @ X20 @ X1) => (~(p @ (ap @ X19 @ X20)) => ? [X21 : $i] : ((X20 = ((ap @ X18 @ X21))) & (mem @ X21 @ X0))))))) & ! [X14 : $i] : ((mem @ X14 @ (arr @ X0 @ X1)) => ! [X15 : $i] : ((mem @ X15 @ (arr @ X1 @ bool)) => ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1) @ X14) @ X15)) <=> ! [X16 : $i] : ((mem @ X16 @ X1) => ((p @ (ap @ X15 @ X16)) => ? [X17 : $i] : ((X16 = ((ap @ X14 @ X17))) & (mem @ X17 @ X0))))))) & ! [X11 : $i] : ((mem @ X11 @ (arr @ X0 @ X1)) => ! [X12 : $i] : ((mem @ X12 @ (arr @ X1 @ bool)) => ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1) @ X11) @ X12)) <=> ! [X13 : $i] : ((mem @ X13 @ X0) => ~(p @ (ap @ X12 @ (ap @ X11 @ X13))))))) & ! [X8 : $i] : ((mem @ X8 @ (arr @ X0 @ X1)) => ! [X9 : $i] : ((mem @ X9 @ (arr @ X1 @ bool)) => ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1) @ X8) @ X9)) <=> ! [X10 : $i] : ((mem @ X10 @ X0) => (p @ (ap @ X9 @ (ap @ X8 @ X10))))))) & ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1) @ X2) @ X3)) <=> ! [X6 : $i] : ((mem @ X6 @ X1) => (~(p @ (ap @ X3 @ X6)) => ? [X7 : $i] : (~(p @ (ap @ X3 @ (ap @ X2 @ X7))) & (mem @ X7 @ X0))))) & ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1) @ X2) @ X3)) <=> ! [X4 : $i] : ((mem @ X4 @ X1) => ((p @ (ap @ X3 @ X4)) => ? [X5 : $i] : ((p @ (ap @ X3 @ (ap @ X2 @ X5))) & (mem @ X5 @ X0))))))))),
% 9.19/1.66 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__REWRITES)).
% 9.19/1.66 thf(f51,conjecture,(
% 9.19/1.66 ! [X0 : del,X1 : del,X2 : $i] : ((mem @ X2 @ (arr @ X1 @ X0)) => ! [X3 : $i] : ((mem @ X3 @ (arr @ X0 @ bool)) => ! [X4 : $i] : ((mem @ X4 @ (arr @ X0 @ bool)) => (! [X5 : $i] : ((mem @ X5 @ X0) => ((p @ (ap @ X4 @ X5)) => (p @ (ap @ X3 @ X5)))) => ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0) @ X2) @ X3)) => (p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0) @ X2) @ X4)))))))),
% 9.19/1.66 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT)).
% 9.19/1.66 thf(f52,negated_conjecture,(
% 9.19/1.66 ~ ! [X0 : del,X1 : del,X2 : $i] : ((mem @ X2 @ (arr @ X1 @ X0)) => ! [X3 : $i] : ((mem @ X3 @ (arr @ X0 @ bool)) => ! [X4 : $i] : ((mem @ X4 @ (arr @ X0 @ bool)) => (! [X5 : $i] : ((mem @ X5 @ X0) => ((p @ (ap @ X4 @ X5)) => (p @ (ap @ X3 @ X5)))) => ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0) @ X2) @ X3)) => (p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0) @ X2) @ X4)))))))),
% 9.19/1.66 inference(negated_conjecture,[status(cth)],[f51])).
% 9.19/1.66 thf(f55,plain,(
% 9.19/1.66 ! [X0 : $i] : ((mem @ X0 @ bool) => (X0 = ((inj__o @ (p @ X0)))))),
% 9.19/1.66 inference(rectify,[],[f3])).
% 9.19/1.66 thf(f56,plain,(
% 9.19/1.66 ! [X0 : $i] : ((((mem @ X0 @ bool)) = $true) => (((inj__o @ (p @ X0))) = X0))),
% 9.19/1.66 inference(fool_elimination,[],[f55])).
% 9.19/1.66 thf(f57,plain,(
% 9.19/1.66 ! [X0 : del,X1 : del,X2 : $i] : ((mem @ X2 @ (arr @ X0 @ X1)) => ! [X3 : $i] : ((mem @ X3 @ X0) => (mem @ (ap @ X2 @ X3) @ X1)))),
% 9.19/1.66 inference(rectify,[],[f4])).
% 9.19/1.66 thf(f58,plain,(
% 9.19/1.66 ! [X0 : del,X1 : del,X2 : $i] : ((((mem @ X2 @ (arr @ X0 @ X1))) = $true) => ! [X3 : $i] : ((((mem @ X3 @ X0)) = $true) => (((mem @ (ap @ X2 @ X3) @ X1)) = $true)))),
% 9.19/1.66 inference(fool_elimination,[],[f57])).
% 9.19/1.66 thf(f85,plain,(
% 9.19/1.66 (mem @ c_2Ebool_2EF @ bool)),
% 9.19/1.66 inference(rectify,[],[f18])).
% 9.19/1.66 thf(f86,plain,(
% 9.19/1.66 (((mem @ c_2Ebool_2EF @ bool)) = $true)),
% 9.19/1.66 inference(fool_elimination,[],[f85])).
% 9.19/1.66 thf(f87,plain,(
% 9.19/1.66 ~(p @ c_2Ebool_2EF)),
% 9.19/1.66 inference(rectify,[],[f19])).
% 9.19/1.66 thf(f88,plain,(
% 9.19/1.66 ~ (((p @ c_2Ebool_2EF)) = $true)),
% 9.19/1.66 inference(fool_elimination,[],[f87])).
% 9.19/1.66 thf(f125,plain,(
% 9.19/1.66 ! [X0 : del,X1 : del,X2 : $i] : ((mem @ X2 @ (arr @ X0 @ X1)) => ! [X3 : $i] : ((mem @ X3 @ (arr @ X1 @ bool)) => (! [X4 : $i] : ((mem @ X4 @ (arr @ X0 @ X1)) => ! [X5 : $i] : ((mem @ X5 @ (arr @ X1 @ bool)) => ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1) @ X4) @ X5)) <=> ! [X6 : $i] : ((mem @ X6 @ X1) => (~(p @ (ap @ X5 @ X6)) => ? [X7 : $i] : ((((ap @ X4 @ X7)) = X6) & (mem @ X7 @ X0))))))) & ! [X8 : $i] : ((mem @ X8 @ (arr @ X0 @ X1)) => ! [X9 : $i] : ((mem @ X9 @ (arr @ X1 @ bool)) => ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1) @ X8) @ X9)) <=> ! [X10 : $i] : ((mem @ X10 @ X1) => ((p @ (ap @ X9 @ X10)) => ? [X11 : $i] : ((((ap @ X8 @ X11)) = X10) & (mem @ X11 @ X0))))))) & ! [X12 : $i] : ((mem @ X12 @ (arr @ X0 @ X1)) => ! [X13 : $i] : ((mem @ X13 @ (arr @ X1 @ bool)) => ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1) @ X12) @ X13)) <=> ! [X14 : $i] : ((mem @ X14 @ X0) => ~(p @ (ap @ X13 @ (ap @ X12 @ X14))))))) & ! [X15 : $i] : ((mem @ X15 @ (arr @ X0 @ X1)) => ! [X16 : $i] : ((mem @ X16 @ (arr @ X1 @ bool)) => ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1) @ X15) @ X16)) <=> ! [X17 : $i] : ((mem @ X17 @ X0) => (p @ (ap @ X16 @ (ap @ X15 @ X17))))))) & ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1) @ X2) @ X3)) <=> ! [X18 : $i] : ((mem @ X18 @ X1) => (~(p @ (ap @ X3 @ X18)) => ? [X19 : $i] : (~(p @ (ap @ X3 @ (ap @ X2 @ X19))) & (mem @ X19 @ X0))))) & ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1) @ X2) @ X3)) <=> ! [X20 : $i] : ((mem @ X20 @ X1) => ((p @ (ap @ X3 @ X20)) => ? [X21 : $i] : ((p @ (ap @ X3 @ (ap @ X2 @ X21))) & (mem @ X21 @ X0))))))))),
% 9.19/1.66 inference(rectify,[],[f39])).
% 9.19/1.66 thf(f126,plain,(
% 9.19/1.66 ! [X0 : del,X1 : del,X2 : $i] : ((((mem @ X2 @ (arr @ X0 @ X1))) = $true) => ! [X3 : $i] : ((((mem @ X3 @ (arr @ X1 @ bool))) = $true) => (! [X4 : $i] : (($true = ((mem @ X4 @ (arr @ X0 @ X1)))) => ! [X5 : $i] : (($true = ((mem @ X5 @ (arr @ X1 @ bool)))) => (($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1) @ X4) @ X5)))) <=> ! [X6 : $i] : ((((mem @ X6 @ X1)) = $true) => (~ ($true = ((p @ (ap @ X5 @ X6)))) => ? [X7 : $i] : ((((ap @ X4 @ X7)) = X6) & (((mem @ X7 @ X0)) = $true))))))) & ! [X8 : $i] : ((((mem @ X8 @ (arr @ X0 @ X1))) = $true) => ! [X9 : $i] : ((((mem @ X9 @ (arr @ X1 @ bool))) = $true) => (($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1) @ X8) @ X9)))) <=> ! [X10 : $i] : (($true = ((mem @ X10 @ X1))) => (($true = ((p @ (ap @ X9 @ X10)))) => ? [X11 : $i] : ((((ap @ X8 @ X11)) = X10) & ($true = ((mem @ X11 @ X0))))))))) & ! [X12 : $i] : (($true = ((mem @ X12 @ (arr @ X0 @ X1)))) => ! [X13 : $i] : (($true = ((mem @ X13 @ (arr @ X1 @ bool)))) => (($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1) @ X12) @ X13)))) <=> ! [X14 : $i] : (($true = ((mem @ X14 @ X0))) => ~ ($true = ((p @ (ap @ X13 @ (ap @ X12 @ X14))))))))) & ! [X15 : $i] : (($true = ((mem @ X15 @ (arr @ X0 @ X1)))) => ! [X16 : $i] : (($true = ((mem @ X16 @ (arr @ X1 @ bool)))) => (($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1) @ X15) @ X16)))) <=> ! [X17 : $i] : ((((mem @ X17 @ X0)) = $true) => ($true = ((p @ (ap @ X16 @ (ap @ X15 @ X17))))))))) & ((((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1) @ X2) @ X3))) = $true) <=> ! [X18 : $i] : (($true = ((mem @ X18 @ X1))) => (~ ($true = ((p @ (ap @ X3 @ X18)))) => ? [X19 : $i] : (~ ($true = ((p @ (ap @ X3 @ (ap @ X2 @ X19))))) & ($true = ((mem @ X19 @ X0))))))) & ((((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1) @ X2) @ X3))) = $true) <=> ! [X20 : $i] : ((((mem @ X20 @ X1)) = $true) => (($true = ((p @ (ap @ X3 @ X20)))) => ? [X21 : $i] : (($true = ((p @ (ap @ X3 @ (ap @ X2 @ X21))))) & (((mem @ X21 @ X0)) = $true))))))))),
% 9.19/1.66 inference(fool_elimination,[],[f125])).
% 9.19/1.66 thf(f149,plain,(
% 9.19/1.66 ~ ! [X0 : del,X1 : del,X2 : $i] : ((mem @ X2 @ (arr @ X1 @ X0)) => ! [X3 : $i] : ((mem @ X3 @ (arr @ X0 @ bool)) => ! [X4 : $i] : ((mem @ X4 @ (arr @ X0 @ bool)) => (! [X5 : $i] : ((mem @ X5 @ X0) => ((p @ (ap @ X4 @ X5)) => (p @ (ap @ X3 @ X5)))) => ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0) @ X2) @ X3)) => (p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0) @ X2) @ X4)))))))),
% 9.19/1.66 inference(rectify,[],[f52])).
% 9.19/1.66 thf(f150,plain,(
% 9.19/1.66 ~ ! [X0 : del,X1 : del,X2 : $i] : ((((mem @ X2 @ (arr @ X1 @ X0))) = $true) => ! [X3 : $i] : ((((mem @ X3 @ (arr @ X0 @ bool))) = $true) => ! [X4 : $i] : ((((mem @ X4 @ (arr @ X0 @ bool))) = $true) => (! [X5 : $i] : ((((mem @ X5 @ X0)) = $true) => ((((p @ (ap @ X4 @ X5))) = $true) => (((p @ (ap @ X3 @ X5))) = $true))) => ((((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0) @ X2) @ X3))) = $true) => (((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0) @ X2) @ X4))) = $true))))))),
% 9.19/1.66 inference(fool_elimination,[],[f149])).
% 9.19/1.66 thf(f151,plain,(
% 9.19/1.66 (((p @ c_2Ebool_2EF)) != $true)),
% 9.19/1.66 inference(flattening,[],[f88])).
% 9.19/1.66 thf(f159,plain,(
% 9.19/1.66 ! [X0 : del,X1 : del,X2 : $i] : ((((mem @ X2 @ (arr @ X0 @ X1))) = $true) => ! [X3 : $i] : ((((mem @ X3 @ (arr @ X1 @ bool))) = $true) => (! [X4 : $i] : (($true = ((mem @ X4 @ (arr @ X0 @ X1)))) => ! [X5 : $i] : (($true = ((mem @ X5 @ (arr @ X1 @ bool)))) => (($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1) @ X4) @ X5)))) <=> ! [X6 : $i] : ((((mem @ X6 @ X1)) = $true) => (($true != ((p @ (ap @ X5 @ X6)))) => ? [X7 : $i] : ((((ap @ X4 @ X7)) = X6) & (((mem @ X7 @ X0)) = $true))))))) & ! [X8 : $i] : ((((mem @ X8 @ (arr @ X0 @ X1))) = $true) => ! [X9 : $i] : ((((mem @ X9 @ (arr @ X1 @ bool))) = $true) => (($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1) @ X8) @ X9)))) <=> ! [X10 : $i] : (($true = ((mem @ X10 @ X1))) => (($true = ((p @ (ap @ X9 @ X10)))) => ? [X11 : $i] : ((((ap @ X8 @ X11)) = X10) & ($true = ((mem @ X11 @ X0))))))))) & ! [X12 : $i] : (($true = ((mem @ X12 @ (arr @ X0 @ X1)))) => ! [X13 : $i] : (($true = ((mem @ X13 @ (arr @ X1 @ bool)))) => (($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1) @ X12) @ X13)))) <=> ! [X14 : $i] : (($true = ((mem @ X14 @ X0))) => ($true != ((p @ (ap @ X13 @ (ap @ X12 @ X14))))))))) & ! [X15 : $i] : (($true = ((mem @ X15 @ (arr @ X0 @ X1)))) => ! [X16 : $i] : (($true = ((mem @ X16 @ (arr @ X1 @ bool)))) => (($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1) @ X15) @ X16)))) <=> ! [X17 : $i] : ((((mem @ X17 @ X0)) = $true) => ($true = ((p @ (ap @ X16 @ (ap @ X15 @ X17))))))))) & ((((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1) @ X2) @ X3))) = $true) <=> ! [X18 : $i] : (($true = ((mem @ X18 @ X1))) => (($true != ((p @ (ap @ X3 @ X18)))) => ? [X19 : $i] : (($true != ((p @ (ap @ X3 @ (ap @ X2 @ X19))))) & ($true = ((mem @ X19 @ X0))))))) & ((((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1) @ X2) @ X3))) = $true) <=> ! [X20 : $i] : ((((mem @ X20 @ X1)) = $true) => (($true = ((p @ (ap @ X3 @ X20)))) => ? [X21 : $i] : (($true = ((p @ (ap @ X3 @ (ap @ X2 @ X21))))) & (((mem @ X21 @ X0)) = $true))))))))),
% 9.19/1.66 inference(flattening,[],[f126])).
% 9.19/1.66 thf(f174,plain,(
% 9.19/1.66 ! [X0 : $i] : ((((inj__o @ (p @ X0))) = X0) | (((mem @ X0 @ bool)) != $true))),
% 9.19/1.66 inference(ennf_transformation,[],[f56])).
% 9.19/1.66 thf(f175,plain,(
% 9.19/1.66 ! [X0 : del,X1 : del,X2 : $i] : (! [X3 : $i] : ((((mem @ (ap @ X2 @ X3) @ X1)) = $true) | (((mem @ X3 @ X0)) != $true)) | (((mem @ X2 @ (arr @ X0 @ X1))) != $true))),
% 9.19/1.66 inference(ennf_transformation,[],[f58])).
% 9.19/1.66 thf(f195,plain,(
% 9.19/1.66 ! [X0 : del,X1 : del,X2 : $i] : (! [X3 : $i] : ((! [X4 : $i] : (! [X5 : $i] : ((($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1) @ X4) @ X5)))) <=> ! [X6 : $i] : ((? [X7 : $i] : ((((ap @ X4 @ X7)) = X6) & (((mem @ X7 @ X0)) = $true)) | ($true = ((p @ (ap @ X5 @ X6))))) | (((mem @ X6 @ X1)) != $true))) | ($true != ((mem @ X5 @ (arr @ X1 @ bool))))) | ($true != ((mem @ X4 @ (arr @ X0 @ X1))))) & ! [X8 : $i] : (! [X9 : $i] : ((($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1) @ X8) @ X9)))) <=> ! [X10 : $i] : ((? [X11 : $i] : ((((ap @ X8 @ X11)) = X10) & ($true = ((mem @ X11 @ X0)))) | ($true != ((p @ (ap @ X9 @ X10))))) | ($true != ((mem @ X10 @ X1))))) | (((mem @ X9 @ (arr @ X1 @ bool))) != $true)) | (((mem @ X8 @ (arr @ X0 @ X1))) != $true)) & ! [X12 : $i] : (! [X13 : $i] : ((($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1) @ X12) @ X13)))) <=> ! [X14 : $i] : (($true != ((p @ (ap @ X13 @ (ap @ X12 @ X14))))) | ($true != ((mem @ X14 @ X0))))) | ($true != ((mem @ X13 @ (arr @ X1 @ bool))))) | ($true != ((mem @ X12 @ (arr @ X0 @ X1))))) & ! [X15 : $i] : (! [X16 : $i] : ((($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1) @ X15) @ X16)))) <=> ! [X17 : $i] : (($true = ((p @ (ap @ X16 @ (ap @ X15 @ X17))))) | (((mem @ X17 @ X0)) != $true))) | ($true != ((mem @ X16 @ (arr @ X1 @ bool))))) | ($true != ((mem @ X15 @ (arr @ X0 @ X1))))) & ((((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1) @ X2) @ X3))) = $true) <=> ! [X18 : $i] : ((? [X19 : $i] : (($true != ((p @ (ap @ X3 @ (ap @ X2 @ X19))))) & ($true = ((mem @ X19 @ X0)))) | ($true = ((p @ (ap @ X3 @ X18))))) | ($true != ((mem @ X18 @ X1))))) & ((((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1) @ X2) @ X3))) = $true) <=> ! [X20 : $i] : ((? [X21 : $i] : (($true = ((p @ (ap @ X3 @ (ap @ X2 @ X21))))) & (((mem @ X21 @ X0)) = $true)) | ($true != ((p @ (ap @ X3 @ X20))))) | (((mem @ X20 @ X1)) != $true)))) | (((mem @ X3 @ (arr @ X1 @ bool))) != $true)) | (((mem @ X2 @ (arr @ X0 @ X1))) != $true))),
% 9.19/1.66 inference(ennf_transformation,[],[f159])).
% 9.19/1.66 thf(f196,plain,(
% 9.19/1.66 ! [X0 : del,X1 : del,X2 : $i] : (! [X3 : $i] : ((! [X4 : $i] : (! [X5 : $i] : ((($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1) @ X4) @ X5)))) <=> ! [X6 : $i] : (? [X7 : $i] : ((((ap @ X4 @ X7)) = X6) & (((mem @ X7 @ X0)) = $true)) | ($true = ((p @ (ap @ X5 @ X6)))) | (((mem @ X6 @ X1)) != $true))) | ($true != ((mem @ X5 @ (arr @ X1 @ bool))))) | ($true != ((mem @ X4 @ (arr @ X0 @ X1))))) & ! [X8 : $i] : (! [X9 : $i] : ((($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1) @ X8) @ X9)))) <=> ! [X10 : $i] : (? [X11 : $i] : ((((ap @ X8 @ X11)) = X10) & ($true = ((mem @ X11 @ X0)))) | ($true != ((p @ (ap @ X9 @ X10)))) | ($true != ((mem @ X10 @ X1))))) | (((mem @ X9 @ (arr @ X1 @ bool))) != $true)) | (((mem @ X8 @ (arr @ X0 @ X1))) != $true)) & ! [X12 : $i] : (! [X13 : $i] : ((($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1) @ X12) @ X13)))) <=> ! [X14 : $i] : (($true != ((p @ (ap @ X13 @ (ap @ X12 @ X14))))) | ($true != ((mem @ X14 @ X0))))) | ($true != ((mem @ X13 @ (arr @ X1 @ bool))))) | ($true != ((mem @ X12 @ (arr @ X0 @ X1))))) & ! [X15 : $i] : (! [X16 : $i] : ((($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1) @ X15) @ X16)))) <=> ! [X17 : $i] : (($true = ((p @ (ap @ X16 @ (ap @ X15 @ X17))))) | (((mem @ X17 @ X0)) != $true))) | ($true != ((mem @ X16 @ (arr @ X1 @ bool))))) | ($true != ((mem @ X15 @ (arr @ X0 @ X1))))) & ((((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1) @ X2) @ X3))) = $true) <=> ! [X18 : $i] : (? [X19 : $i] : (($true != ((p @ (ap @ X3 @ (ap @ X2 @ X19))))) & ($true = ((mem @ X19 @ X0)))) | ($true = ((p @ (ap @ X3 @ X18)))) | ($true != ((mem @ X18 @ X1))))) & ((((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1) @ X2) @ X3))) = $true) <=> ! [X20 : $i] : (? [X21 : $i] : (($true = ((p @ (ap @ X3 @ (ap @ X2 @ X21))))) & (((mem @ X21 @ X0)) = $true)) | ($true != ((p @ (ap @ X3 @ X20)))) | (((mem @ X20 @ X1)) != $true)))) | (((mem @ X3 @ (arr @ X1 @ bool))) != $true)) | (((mem @ X2 @ (arr @ X0 @ X1))) != $true))),
% 9.19/1.66 inference(flattening,[],[f195])).
% 9.19/1.66 thf(f212,plain,(
% 9.19/1.66 ? [X0 : del,X1 : del,X2 : $i] : (? [X3 : $i] : (? [X4 : $i] : ((((((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0) @ X2) @ X4))) != $true) & (((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0) @ X2) @ X3))) = $true)) & ! [X5 : $i] : (((((p @ (ap @ X3 @ X5))) = $true) | (((p @ (ap @ X4 @ X5))) != $true)) | (((mem @ X5 @ X0)) != $true))) & (((mem @ X4 @ (arr @ X0 @ bool))) = $true)) & (((mem @ X3 @ (arr @ X0 @ bool))) = $true)) & (((mem @ X2 @ (arr @ X1 @ X0))) = $true))),
% 9.19/1.66 inference(ennf_transformation,[],[f150])).
% 9.19/1.66 thf(f213,plain,(
% 9.19/1.66 ? [X0 : del,X1 : del,X2 : $i] : (? [X3 : $i] : (? [X4 : $i] : ((((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0) @ X2) @ X4))) != $true) & (((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0) @ X2) @ X3))) = $true) & ! [X5 : $i] : ((((p @ (ap @ X3 @ X5))) = $true) | (((p @ (ap @ X4 @ X5))) != $true) | (((mem @ X5 @ X0)) != $true)) & (((mem @ X4 @ (arr @ X0 @ bool))) = $true)) & (((mem @ X3 @ (arr @ X0 @ bool))) = $true)) & (((mem @ X2 @ (arr @ X1 @ X0))) = $true))),
% 9.19/1.66 inference(flattening,[],[f212])).
% 9.19/1.66 thf(f214,definition,(
% 9.19/1.66 ! [X2 : $i,X3 : $i,X0 : del,X1 : del] : (((((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1) @ X2) @ X3))) = $true) <=> ! [X20 : $i] : (? [X21 : $i] : (($true = ((p @ (ap @ X3 @ (ap @ X2 @ X21))))) & (((mem @ X21 @ X0)) = $true)) | ($true != ((p @ (ap @ X3 @ X20)))) | (((mem @ X20 @ X1)) != $true))) | ~ ($true = ((sP0 @ X1 @ X0 @ X3 @ X2))))),
% 9.19/1.66 introduced(definition,[new_symbols(definition,[=])],[predicate_definition_introduction])).
% 9.19/1.66 thf(f215,definition,(
% 9.19/1.66 ! [X2 : $i,X3 : $i,X0 : del,X1 : del] : (((((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1) @ X2) @ X3))) = $true) <=> ! [X18 : $i] : (? [X19 : $i] : (($true != ((p @ (ap @ X3 @ (ap @ X2 @ X19))))) & ($true = ((mem @ X19 @ X0)))) | ($true = ((p @ (ap @ X3 @ X18)))) | ($true != ((mem @ X18 @ X1))))) | ~ ($true = ((sP1 @ X1 @ X0 @ X3 @ X2))))),
% 9.19/1.66 introduced(definition,[new_symbols(definition,[=])],[predicate_definition_introduction])).
% 9.19/1.66 thf(f216,definition,(
% 9.19/1.66 ! [X0 : del,X1 : del] : (! [X8 : $i] : (! [X9 : $i] : ((($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1) @ X8) @ X9)))) <=> ! [X10 : $i] : (? [X11 : $i] : ((((ap @ X8 @ X11)) = X10) & ($true = ((mem @ X11 @ X0)))) | ($true != ((p @ (ap @ X9 @ X10)))) | ($true != ((mem @ X10 @ X1))))) | (((mem @ X9 @ (arr @ X1 @ bool))) != $true)) | (((mem @ X8 @ (arr @ X0 @ X1))) != $true)) | ~ ($true = ((sP2 @ X1 @ X0))))),
% 9.19/1.66 introduced(definition,[new_symbols(definition,[=])],[predicate_definition_introduction])).
% 9.19/1.66 thf(f217,definition,(
% 9.19/1.66 ! [X0 : del,X1 : del] : (! [X4 : $i] : (! [X5 : $i] : ((($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1) @ X4) @ X5)))) <=> ! [X6 : $i] : (? [X7 : $i] : ((((ap @ X4 @ X7)) = X6) & (((mem @ X7 @ X0)) = $true)) | ($true = ((p @ (ap @ X5 @ X6)))) | (((mem @ X6 @ X1)) != $true))) | ($true != ((mem @ X5 @ (arr @ X1 @ bool))))) | ($true != ((mem @ X4 @ (arr @ X0 @ X1))))) | ~ ($true = ((sP3 @ X1 @ X0))))),
% 9.19/1.66 introduced(definition,[new_symbols(definition,[=])],[predicate_definition_introduction])).
% 9.19/1.66 thf(f218,definition,(
% 9.19/1.66 ! [X0 : del,X1 : del] : (! [X15 : $i] : (! [X16 : $i] : ((($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1) @ X15) @ X16)))) <=> ! [X17 : $i] : (($true = ((p @ (ap @ X16 @ (ap @ X15 @ X17))))) | (((mem @ X17 @ X0)) != $true))) | ($true != ((mem @ X16 @ (arr @ X1 @ bool))))) | ($true != ((mem @ X15 @ (arr @ X0 @ X1))))) | ~ ($true = ((sP4 @ X1 @ X0))))),
% 9.19/1.66 introduced(definition,[new_symbols(definition,[=])],[predicate_definition_introduction])).
% 9.19/1.66 thf(f219,plain,(
% 9.19/1.66 ! [X0 : del,X1 : del,X2 : $i] : (! [X3 : $i] : ((($true = ((sP3 @ X1 @ X0))) & ($true = ((sP2 @ X1 @ X0))) & ! [X12 : $i] : (! [X13 : $i] : ((($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1) @ X12) @ X13)))) <=> ! [X14 : $i] : (($true != ((p @ (ap @ X13 @ (ap @ X12 @ X14))))) | ($true != ((mem @ X14 @ X0))))) | ($true != ((mem @ X13 @ (arr @ X1 @ bool))))) | ($true != ((mem @ X12 @ (arr @ X0 @ X1))))) & ($true = ((sP4 @ X1 @ X0))) & ($true = ((sP1 @ X1 @ X0 @ X3 @ X2))) & ($true = ((sP0 @ X1 @ X0 @ X3 @ X2)))) | (((mem @ X3 @ (arr @ X1 @ bool))) != $true)) | (((mem @ X2 @ (arr @ X0 @ X1))) != $true))),
% 9.19/1.66 inference(definition_folding,[],[f196,f218,f217,f216,f215,f214])).
% 9.19/1.66 thf(f278,plain,(
% 9.19/1.66 ! [X0 : del,X1 : del,X2 : $i] : (! [X3 : $i] : ((($true = ((sP3 @ X1 @ X0))) & ($true = ((sP2 @ X1 @ X0))) & ! [X12 : $i] : (! [X13 : $i] : (((($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1) @ X12) @ X13)))) | ? [X14 : $i] : (($true = ((p @ (ap @ X13 @ (ap @ X12 @ X14))))) & ($true = ((mem @ X14 @ X0))))) & (! [X14 : $i] : (($true != ((p @ (ap @ X13 @ (ap @ X12 @ X14))))) | ($true != ((mem @ X14 @ X0)))) | ($true != ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1) @ X12) @ X13)))))) | ($true != ((mem @ X13 @ (arr @ X1 @ bool))))) | ($true != ((mem @ X12 @ (arr @ X0 @ X1))))) & ($true = ((sP4 @ X1 @ X0))) & ($true = ((sP1 @ X1 @ X0 @ X3 @ X2))) & ($true = ((sP0 @ X1 @ X0 @ X3 @ X2)))) | (((mem @ X3 @ (arr @ X1 @ bool))) != $true)) | (((mem @ X2 @ (arr @ X0 @ X1))) != $true))),
% 9.19/1.66 inference(nnf_transformation,[],[f219])).
% 9.19/1.66 thf(f279,plain,(
% 9.19/1.66 ! [X0 : del,X1 : del,X2 : $i] : (! [X3 : $i] : ((($true = ((sP3 @ X1 @ X0))) & ($true = ((sP2 @ X1 @ X0))) & ! [X4 : $i] : (! [X5 : $i] : (((($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1) @ X4) @ X5)))) | ? [X6 : $i] : (($true = ((p @ (ap @ X5 @ (ap @ X4 @ X6))))) & ($true = ((mem @ X6 @ X0))))) & (! [X7 : $i] : (($true != ((p @ (ap @ X5 @ (ap @ X4 @ X7))))) | (((mem @ X7 @ X0)) != $true)) | ($true != ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1) @ X4) @ X5)))))) | ($true != ((mem @ X5 @ (arr @ X1 @ bool))))) | ($true != ((mem @ X4 @ (arr @ X0 @ X1))))) & ($true = ((sP4 @ X1 @ X0))) & ($true = ((sP1 @ X1 @ X0 @ X3 @ X2))) & ($true = ((sP0 @ X1 @ X0 @ X3 @ X2)))) | (((mem @ X3 @ (arr @ X1 @ bool))) != $true)) | (((mem @ X2 @ (arr @ X0 @ X1))) != $true))),
% 9.19/1.66 inference(rectify,[],[f278])).
% 9.19/1.66 thf(f280,plain,(
% 9.19/1.66 ! [X0 : del,X1 : del,X2 : $i] : (! [X3 : $i] : ((($true = ((sP3 @ X1 @ X0))) & ($true = ((sP2 @ X1 @ X0))) & ! [X4 : $i] : (! [X5 : $i] : (((($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1) @ X4) @ X5)))) | (($true = ((p @ (ap @ X5 @ (ap @ X4 @ (sK31 @ X5 @ X4 @ X0)))))) & ($true = ((mem @ (sK31 @ X5 @ X4 @ X0) @ X0))))) & (! [X7 : $i] : (($true != ((p @ (ap @ X5 @ (ap @ X4 @ X7))))) | (((mem @ X7 @ X0)) != $true)) | ($true != ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1) @ X4) @ X5)))))) | ($true != ((mem @ X5 @ (arr @ X1 @ bool))))) | ($true != ((mem @ X4 @ (arr @ X0 @ X1))))) & ($true = ((sP4 @ X1 @ X0))) & ($true = ((sP1 @ X1 @ X0 @ X3 @ X2))) & ($true = ((sP0 @ X1 @ X0 @ X3 @ X2)))) | (((mem @ X3 @ (arr @ X1 @ bool))) != $true)) | (((mem @ X2 @ (arr @ X0 @ X1))) != $true))),
% 9.19/1.66 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP]),skolemize(X3,sK18 @ X2 @ X1 @ X0)],[f279])).
% 9.19/1.66 thf(f319,plain,(
% 9.19/1.66 ((($true != ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK33 @ sK32) @ sK34) @ sK36)))) & ($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK33 @ sK32) @ sK34) @ sK35)))) & ! [X5 : $i] : (($true = ((p @ (ap @ sK35 @ X5)))) | ($true != ((p @ (ap @ sK36 @ X5)))) | ($true != ((mem @ X5 @ sK32)))) & ($true = ((mem @ sK36 @ (arr @ sK32 @ bool))))) & ($true = ((mem @ sK35 @ (arr @ sK32 @ bool))))) & ($true = ((mem @ sK34 @ (arr @ sK33 @ sK32))))),
% 9.19/1.66 inference(skolemize,[status(esa),new_symbols(skolem,[sK32,sK33,sK34,sK35,sK36]),skolemize(X0,sK32),skolemize(X1,sK33),skolemize(X2,sK34),skolemize(X3,sK35),skolemize(X4,sK36)],[f213])).
% 9.19/1.66 thf(f322,plain,(
% 9.19/1.66 ( ! [X0 : $i] : ((((mem @ X0 @ bool)) != $true) | (((inj__o @ (p @ X0))) = X0)) )),
% 9.19/1.66 inference(cnf_transformation,[],[f174])).
% 9.19/1.66 thf(f323,plain,(
% 9.19/1.66 ( ! [X2 : $i,X3 : $i,X0 : del,X1 : del] : ((((mem @ X2 @ (arr @ X0 @ X1))) != $true) | (((mem @ X3 @ X0)) != $true) | (((mem @ (ap @ X2 @ X3) @ X1)) = $true)) )),
% 9.19/1.66 inference(cnf_transformation,[],[f175])).
% 9.19/1.66 thf(f341,plain,(
% 9.19/1.66 (((mem @ c_2Ebool_2EF @ bool)) = $true)),
% 9.19/1.66 inference(cnf_transformation,[],[f86])).
% 9.19/1.66 thf(f342,plain,(
% 9.19/1.66 (((p @ c_2Ebool_2EF)) != $true)),
% 9.19/1.66 inference(cnf_transformation,[],[f151])).
% 9.19/1.66 thf(f422,plain,(
% 9.19/1.66 ( ! [X2 : $i,X3 : $i,X0 : del,X1 : del,X7 : $i,X4 : $i,X5 : $i] : (($true != ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1) @ X4) @ X5)))) | (((mem @ X7 @ X0)) != $true) | ($true != ((p @ (ap @ X5 @ (ap @ X4 @ X7))))) | ($true != ((mem @ X5 @ (arr @ X1 @ bool)))) | ($true != ((mem @ X4 @ (arr @ X0 @ X1)))) | (((mem @ X3 @ (arr @ X1 @ bool))) != $true) | (((mem @ X2 @ (arr @ X0 @ X1))) != $true)) )),
% 9.19/1.66 inference(cnf_transformation,[],[f280])).
% 9.19/1.66 thf(f423,plain,(
% 9.19/1.66 ( ! [X2 : $i,X3 : $i,X0 : del,X1 : del,X4 : $i,X5 : $i] : ((((mem @ X2 @ (arr @ X0 @ X1))) != $true) | ($true = ((mem @ (sK31 @ X5 @ X4 @ X0) @ X0))) | ($true != ((mem @ X5 @ (arr @ X1 @ bool)))) | ($true != ((mem @ X4 @ (arr @ X0 @ X1)))) | (((mem @ X3 @ (arr @ X1 @ bool))) != $true) | ($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1) @ X4) @ X5))))) )),
% 9.19/1.66 inference(cnf_transformation,[],[f280])).
% 9.19/1.66 thf(f424,plain,(
% 9.19/1.66 ( ! [X2 : $i,X3 : $i,X0 : del,X1 : del,X4 : $i,X5 : $i] : ((((mem @ X2 @ (arr @ X0 @ X1))) != $true) | ($true = ((p @ (ap @ X5 @ (ap @ X4 @ (sK31 @ X5 @ X4 @ X0)))))) | ($true != ((mem @ X5 @ (arr @ X1 @ bool)))) | ($true != ((mem @ X4 @ (arr @ X0 @ X1)))) | (((mem @ X3 @ (arr @ X1 @ bool))) != $true) | ($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1) @ X4) @ X5))))) )),
% 9.19/1.66 inference(cnf_transformation,[],[f280])).
% 9.19/1.66 thf(f512,plain,(
% 9.19/1.66 ($true = ((mem @ sK34 @ (arr @ sK33 @ sK32))))),
% 9.19/1.66 inference(cnf_transformation,[],[f319])).
% 9.19/1.66 thf(f513,plain,(
% 9.19/1.66 ($true = ((mem @ sK35 @ (arr @ sK32 @ bool))))),
% 9.19/1.66 inference(cnf_transformation,[],[f319])).
% 9.19/1.66 thf(f514,plain,(
% 9.19/1.66 ($true = ((mem @ sK36 @ (arr @ sK32 @ bool))))),
% 9.19/1.66 inference(cnf_transformation,[],[f319])).
% 9.19/1.66 thf(f515,plain,(
% 9.19/1.66 ( ! [X5 : $i] : (($true != ((p @ (ap @ sK36 @ X5)))) | ($true = ((p @ (ap @ sK35 @ X5)))) | ($true != ((mem @ X5 @ sK32)))) )),
% 9.19/1.66 inference(cnf_transformation,[],[f319])).
% 9.19/1.66 thf(f516,plain,(
% 9.19/1.66 ($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK33 @ sK32) @ sK34) @ sK35))))),
% 9.19/1.66 inference(cnf_transformation,[],[f319])).
% 9.19/1.66 thf(f517,plain,(
% 9.19/1.66 ($true != ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK33 @ sK32) @ sK34) @ sK36))))),
% 9.19/1.66 inference(cnf_transformation,[],[f319])).
% 9.19/1.66 thf(f519,definition,(
% 9.19/1.66 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 9.19/1.66 introduced(theory,[fool_exhaustiveness_axiom])).
% 9.19/1.66 thf(f614,plain,(
% 9.19/1.66 ( ! [X0 : $i] : (($true != $true) | ($true = ((p @ (ap @ sK35 @ X0)))) | ($true != ((mem @ X0 @ sK32))) | ($false = ((p @ (ap @ sK36 @ X0))))) )),
% 9.19/1.66 inference(constrained_superposition,[],[f515,f519])).
% 9.19/1.66 thf(f616,plain,(
% 9.19/1.66 ( ! [X0 : $i] : (($false = ((p @ (ap @ sK36 @ X0)))) | ($true != ((mem @ X0 @ sK32))) | ($true = ((p @ (ap @ sK35 @ X0))))) )),
% 9.19/1.66 inference(trivial_inequality_removal,[],[f614])).
% 9.19/1.66 thf(f629,plain,(
% 9.19/1.66 ($true != $true) | (((p @ c_2Ebool_2EF)) = $false)),
% 9.19/1.66 inference(constrained_superposition,[],[f342,f519])).
% 9.19/1.66 thf(f630,plain,(
% 9.19/1.66 (((p @ c_2Ebool_2EF)) = $false)),
% 9.19/1.66 inference(trivial_inequality_removal,[],[f629])).
% 9.19/1.66 thf(f646,plain,(
% 9.19/1.66 ($true != $true) | (c_2Ebool_2EF = ((inj__o @ (p @ c_2Ebool_2EF))))),
% 9.19/1.66 inference(constrained_superposition,[],[f322,f341])).
% 9.19/1.66 thf(f648,plain,(
% 9.19/1.66 ( ! [X0 : $i] : (($true != $true) | (((inj__o @ (p @ X0))) = X0) | (((mem @ X0 @ bool)) = $false)) )),
% 9.19/1.66 inference(constrained_superposition,[],[f322,f519])).
% 9.19/1.66 thf(f649,plain,(
% 9.19/1.66 ( ! [X0 : $i] : ((((mem @ X0 @ bool)) = $false) | (((inj__o @ (p @ X0))) = X0)) )),
% 9.19/1.66 inference(trivial_inequality_removal,[],[f648])).
% 9.19/1.66 thf(f651,plain,(
% 9.19/1.66 (c_2Ebool_2EF = ((inj__o @ (p @ c_2Ebool_2EF))))),
% 9.19/1.66 inference(trivial_inequality_removal,[],[f646])).
% 9.19/1.66 thf(f653,plain,(
% 9.19/1.66 (c_2Ebool_2EF = ((inj__o @ $false)))),
% 9.19/1.66 inference(forward_demodulation,[],[f651,f630])).
% 9.19/1.66 thf(f1283,plain,(
% 9.19/1.66 ( ! [X0 : $i] : (($true != $true) | ($true != ((mem @ X0 @ sK33))) | ($true = ((mem @ (ap @ sK34 @ X0) @ sK32)))) )),
% 9.19/1.66 inference(constrained_superposition,[],[f323,f512])).
% 9.19/1.66 thf(f1285,plain,(
% 9.19/1.66 ( ! [X0 : $i] : (($true != $true) | ($true != ((mem @ X0 @ sK32))) | ($true = ((mem @ (ap @ sK36 @ X0) @ bool)))) )),
% 9.19/1.66 inference(constrained_superposition,[],[f323,f514])).
% 9.19/1.66 thf(f1288,plain,(
% 9.19/1.66 ( ! [X0 : $i] : (($true = ((mem @ (ap @ sK36 @ X0) @ bool))) | ($true != ((mem @ X0 @ sK32)))) )),
% 9.19/1.66 inference(trivial_inequality_removal,[],[f1285])).
% 9.19/1.66 thf(f1290,plain,(
% 9.19/1.66 ( ! [X0 : $i] : (($true = ((mem @ (ap @ sK34 @ X0) @ sK32))) | ($true != ((mem @ X0 @ sK33)))) )),
% 9.19/1.66 inference(trivial_inequality_removal,[],[f1283])).
% 9.19/1.66 thf(f1307,plain,(
% 9.19/1.66 ( ! [X0 : $i] : (($true = $false) | (((ap @ sK36 @ X0)) = ((inj__o @ (p @ (ap @ sK36 @ X0))))) | ($true != ((mem @ X0 @ sK32)))) )),
% 9.19/1.66 inference(constrained_superposition,[],[f649,f1288])).
% 9.19/1.66 thf(f1326,plain,(
% 9.19/1.66 ( ! [X0 : $i] : ((((ap @ sK36 @ X0)) = ((inj__o @ (p @ (ap @ sK36 @ X0))))) | ($true != ((mem @ X0 @ sK32)))) )),
% 9.19/1.66 inference(trivial_inequality_removal,[],[f1307])).
% 9.19/1.66 thf(f1372,definition,(
% 9.19/1.66 spl37_12 <=> ! [X0 : $i] : ($true != ((mem @ X0 @ (arr @ sK32 @ bool))))),
% 9.19/1.66 introduced(definition,[new_symbols(definition,[spl37_12])],[avatar_definition])).
% 9.19/1.66 thf(f1373,plain,(
% 9.19/1.66 ( ! [X0 : $i] : (($true != ((mem @ X0 @ (arr @ sK32 @ bool))))) ) | ~spl37_12),
% 9.19/1.66 inference(avatar_component_clause,[],[f1372])).
% 9.19/1.66 thf(f1506,plain,(
% 9.19/1.66 ($true != $true) | ~spl37_12),
% 9.19/1.66 inference(constrained_superposition,[],[f1373,f513])).
% 9.19/1.66 thf(f1512,plain,(
% 9.19/1.66 $false | ~spl37_12),
% 9.19/1.66 inference(trivial_inequality_removal,[],[f1506])).
% 9.19/1.66 thf(f1513,plain,(
% 9.19/1.66 ~spl37_12),
% 9.19/1.66 inference(avatar_contradiction_clause,[],[f1512])).
% 9.19/1.66 thf(f1777,plain,(
% 9.19/1.66 ( ! [X0 : $i] : ((((ap @ sK36 @ X0)) = ((inj__o @ $false))) | ($true != ((mem @ X0 @ sK32))) | ($true != ((mem @ X0 @ sK32))) | ($true = ((p @ (ap @ sK35 @ X0))))) )),
% 9.19/1.66 inference(constrained_superposition,[],[f1326,f616])).
% 9.19/1.66 thf(f1798,plain,(
% 9.19/1.66 ( ! [X0 : $i] : ((((ap @ sK36 @ X0)) = ((inj__o @ $false))) | ($true != ((mem @ X0 @ sK32))) | ($true = ((p @ (ap @ sK35 @ X0))))) )),
% 9.19/1.66 inference(duplicate_literal_removal,[],[f1777])).
% 9.19/1.66 thf(f1800,plain,(
% 9.19/1.66 ( ! [X0 : $i] : (($true = ((p @ (ap @ sK35 @ X0)))) | ($true != ((mem @ X0 @ sK32))) | (c_2Ebool_2EF = ((ap @ sK36 @ X0)))) )),
% 9.19/1.66 inference(forward_demodulation,[],[f1798,f653])).
% 9.19/1.66 thf(f3445,plain,(
% 9.19/1.66 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != $true) | ($true = ((mem @ (sK31 @ X0 @ X1 @ sK33) @ sK33))) | ($true != ((mem @ X0 @ (arr @ sK32 @ bool)))) | ($true != ((mem @ X1 @ (arr @ sK33 @ sK32)))) | ($true != ((mem @ X2 @ (arr @ sK32 @ bool)))) | ($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK33 @ sK32) @ X1) @ X0))))) )),
% 9.19/1.66 inference(constrained_superposition,[],[f423,f512])).
% 9.19/1.66 thf(f3450,plain,(
% 9.19/1.67 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = ((mem @ (sK31 @ X0 @ X1 @ sK33) @ sK33))) | ($true != ((mem @ X0 @ (arr @ sK32 @ bool)))) | ($true != ((mem @ X1 @ (arr @ sK33 @ sK32)))) | ($true != ((mem @ X2 @ (arr @ sK32 @ bool)))) | ($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK33 @ sK32) @ X1) @ X0))))) )),
% 9.19/1.67 inference(trivial_inequality_removal,[],[f3445])).
% 9.19/1.67 thf(f3503,plain,(
% 9.19/1.67 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != $true) | ($true != ((mem @ X0 @ sK33))) | ($true != ((p @ (ap @ sK35 @ (ap @ sK34 @ X0))))) | ($true != ((mem @ sK35 @ (arr @ sK32 @ bool)))) | ($true != ((mem @ sK34 @ (arr @ sK33 @ sK32)))) | ($true != ((mem @ X1 @ (arr @ sK32 @ bool)))) | ($true != ((mem @ X2 @ (arr @ sK33 @ sK32))))) )),
% 9.19/1.67 inference(constrained_superposition,[],[f422,f516])).
% 9.19/1.67 thf(f3505,plain,(
% 9.19/1.67 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != ((mem @ X0 @ sK33))) | ($true != ((p @ (ap @ sK35 @ (ap @ sK34 @ X0))))) | ($true != ((mem @ sK35 @ (arr @ sK32 @ bool)))) | ($true != ((mem @ sK34 @ (arr @ sK33 @ sK32)))) | ($true != ((mem @ X1 @ (arr @ sK32 @ bool)))) | ($true != ((mem @ X2 @ (arr @ sK33 @ sK32))))) )),
% 9.19/1.67 inference(trivial_inequality_removal,[],[f3503])).
% 9.19/1.67 thf(f3531,plain,(
% 9.19/1.67 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != $true) | ($true = ((p @ (ap @ X0 @ (ap @ X1 @ (sK31 @ X0 @ X1 @ sK33)))))) | ($true != ((mem @ X0 @ (arr @ sK32 @ bool)))) | ($true != ((mem @ X1 @ (arr @ sK33 @ sK32)))) | ($true != ((mem @ X2 @ (arr @ sK32 @ bool)))) | ($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK33 @ sK32) @ X1) @ X0))))) )),
% 9.19/1.67 inference(constrained_superposition,[],[f424,f512])).
% 9.19/1.67 thf(f3536,plain,(
% 9.19/1.67 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = ((p @ (ap @ X0 @ (ap @ X1 @ (sK31 @ X0 @ X1 @ sK33)))))) | ($true != ((mem @ X0 @ (arr @ sK32 @ bool)))) | ($true != ((mem @ X1 @ (arr @ sK33 @ sK32)))) | ($true != ((mem @ X2 @ (arr @ sK32 @ bool)))) | ($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK33 @ sK32) @ X1) @ X0))))) )),
% 9.19/1.67 inference(trivial_inequality_removal,[],[f3531])).
% 9.19/1.67 thf(f3564,definition,(
% 9.19/1.67 spl37_52 <=> ! [X0 : $i,X1 : $i] : (($true = ((p @ (ap @ X0 @ (ap @ X1 @ (sK31 @ X0 @ X1 @ sK33)))))) | ($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK33 @ sK32) @ X1) @ X0)))) | ($true != ((mem @ X1 @ (arr @ sK33 @ sK32)))) | ($true != ((mem @ X0 @ (arr @ sK32 @ bool)))))),
% 9.19/1.67 introduced(definition,[new_symbols(definition,[spl37_52])],[avatar_definition])).
% 9.19/1.67 thf(f3565,plain,(
% 9.19/1.67 ( ! [X0 : $i,X1 : $i] : (($true = ((p @ (ap @ X0 @ (ap @ X1 @ (sK31 @ X0 @ X1 @ sK33)))))) | ($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK33 @ sK32) @ X1) @ X0)))) | ($true != ((mem @ X1 @ (arr @ sK33 @ sK32)))) | ($true != ((mem @ X0 @ (arr @ sK32 @ bool))))) ) | ~spl37_52),
% 9.19/1.67 inference(avatar_component_clause,[],[f3564])).
% 9.19/1.67 thf(f3566,plain,(
% 9.19/1.67 spl37_12 | spl37_52),
% 9.19/1.67 inference(avatar_split_clause,[],[f3536,f3564,f1372])).
% 9.19/1.67 thf(f3739,definition,(
% 9.19/1.67 spl37_69 <=> ! [X0 : $i,X1 : $i] : (($true = ((mem @ (sK31 @ X0 @ X1 @ sK33) @ sK33))) | ($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK33 @ sK32) @ X1) @ X0)))) | ($true != ((mem @ X1 @ (arr @ sK33 @ sK32)))) | ($true != ((mem @ X0 @ (arr @ sK32 @ bool)))))),
% 9.19/1.67 introduced(definition,[new_symbols(definition,[spl37_69])],[avatar_definition])).
% 9.19/1.67 thf(f3740,plain,(
% 9.19/1.67 ( ! [X0 : $i,X1 : $i] : (($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK33 @ sK32) @ X1) @ X0)))) | ($true = ((mem @ (sK31 @ X0 @ X1 @ sK33) @ sK33))) | ($true != ((mem @ X1 @ (arr @ sK33 @ sK32)))) | ($true != ((mem @ X0 @ (arr @ sK32 @ bool))))) ) | ~spl37_69),
% 9.19/1.67 inference(avatar_component_clause,[],[f3739])).
% 9.19/1.67 thf(f3741,plain,(
% 9.19/1.67 spl37_12 | spl37_69),
% 9.19/1.67 inference(avatar_split_clause,[],[f3450,f3739,f1372])).
% 9.19/1.67 thf(f3742,plain,(
% 9.19/1.67 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != ((mem @ X0 @ sK33))) | ($true != ((p @ (ap @ sK35 @ (ap @ sK34 @ X0))))) | ($true != ((mem @ sK34 @ (arr @ sK33 @ sK32)))) | ($true != ((mem @ X1 @ (arr @ sK32 @ bool)))) | ($true != ((mem @ X2 @ (arr @ sK33 @ sK32))))) )),
% 9.19/1.67 inference(forward_subsumption_resolution,[],[f3505,f513])).
% 9.19/1.67 thf(f3743,plain,(
% 9.19/1.67 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != ((mem @ X0 @ sK33))) | ($true != ((p @ (ap @ sK35 @ (ap @ sK34 @ X0))))) | ($true != ((mem @ X1 @ (arr @ sK32 @ bool)))) | ($true != ((mem @ X2 @ (arr @ sK33 @ sK32))))) )),
% 9.19/1.67 inference(forward_subsumption_resolution,[],[f3742,f512])).
% 9.19/1.67 thf(f3745,definition,(
% 9.19/1.67 spl37_70 <=> ! [X2 : $i] : ($true != ((mem @ X2 @ (arr @ sK33 @ sK32))))),
% 9.19/1.67 introduced(definition,[new_symbols(definition,[spl37_70])],[avatar_definition])).
% 9.19/1.67 thf(f3746,plain,(
% 9.19/1.67 ( ! [X2 : $i] : (($true != ((mem @ X2 @ (arr @ sK33 @ sK32))))) ) | ~spl37_70),
% 9.19/1.67 inference(avatar_component_clause,[],[f3745])).
% 9.19/1.67 thf(f3748,definition,(
% 9.19/1.67 spl37_71 <=> ! [X0 : $i] : (($true != ((mem @ X0 @ sK33))) | ($true != ((p @ (ap @ sK35 @ (ap @ sK34 @ X0))))))),
% 9.19/1.67 introduced(definition,[new_symbols(definition,[spl37_71])],[avatar_definition])).
% 9.19/1.67 thf(f3749,plain,(
% 9.19/1.67 ( ! [X0 : $i] : (($true != ((p @ (ap @ sK35 @ (ap @ sK34 @ X0))))) | ($true != ((mem @ X0 @ sK33)))) ) | ~spl37_71),
% 9.19/1.67 inference(avatar_component_clause,[],[f3748])).
% 9.19/1.67 thf(f3750,plain,(
% 9.19/1.67 spl37_70 | spl37_12 | spl37_71),
% 9.19/1.67 inference(avatar_split_clause,[],[f3743,f3748,f1372,f3745])).
% 9.19/1.67 thf(f3764,plain,(
% 9.19/1.67 ($true != $true) | ~spl37_70),
% 9.19/1.67 inference(constrained_superposition,[],[f3746,f512])).
% 9.19/1.67 thf(f3765,plain,(
% 9.19/1.67 $false | ~spl37_70),
% 9.19/1.67 inference(trivial_inequality_removal,[],[f3764])).
% 9.19/1.67 thf(f3766,plain,(
% 9.19/1.67 ~spl37_70),
% 9.19/1.67 inference(avatar_contradiction_clause,[],[f3765])).
% 9.19/1.67 thf(f5496,plain,(
% 9.19/1.67 ( ! [X0 : $i] : (($true != $true) | ($true != ((mem @ X0 @ sK33))) | ($true != ((mem @ (ap @ sK34 @ X0) @ sK32))) | (c_2Ebool_2EF = ((ap @ sK36 @ (ap @ sK34 @ X0))))) ) | ~spl37_71),
% 9.19/1.67 inference(constrained_superposition,[],[f3749,f1800])).
% 9.19/1.67 thf(f5497,plain,(
% 9.19/1.67 ( ! [X0 : $i] : (($true != ((mem @ X0 @ sK33))) | ($true != ((mem @ (ap @ sK34 @ X0) @ sK32))) | (c_2Ebool_2EF = ((ap @ sK36 @ (ap @ sK34 @ X0))))) ) | ~spl37_71),
% 9.19/1.67 inference(trivial_inequality_removal,[],[f5496])).
% 9.19/1.67 thf(f5505,plain,(
% 9.19/1.67 ( ! [X0 : $i] : ((c_2Ebool_2EF = ((ap @ sK36 @ (ap @ sK34 @ X0)))) | ($true != ((mem @ X0 @ sK33)))) ) | ~spl37_71),
% 9.19/1.67 inference(forward_subsumption_resolution,[],[f5497,f1290])).
% 9.19/1.67 thf(f5536,plain,(
% 9.19/1.67 (((p @ c_2Ebool_2EF)) = $true) | ($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK33 @ sK32) @ sK34) @ sK36)))) | ($true != ((mem @ sK34 @ (arr @ sK33 @ sK32)))) | ($true != ((mem @ sK36 @ (arr @ sK32 @ bool)))) | ($true != ((mem @ (sK31 @ sK36 @ sK34 @ sK33) @ sK33))) | (~spl37_52 | ~spl37_71)),
% 9.19/1.67 inference(constrained_superposition,[],[f3565,f5505])).
% 9.19/1.67 thf(f5552,plain,(
% 9.19/1.67 (((p @ c_2Ebool_2EF)) = $true) | ($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK33 @ sK32) @ sK34) @ sK36)))) | ($true != ((mem @ sK34 @ (arr @ sK33 @ sK32)))) | ($true != ((mem @ sK36 @ (arr @ sK32 @ bool)))) | (~spl37_52 | ~spl37_69 | ~spl37_71)),
% 9.19/1.67 inference(forward_subsumption_resolution,[],[f5536,f3740])).
% 9.19/1.67 thf(f5554,plain,(
% 9.19/1.67 ($true = ((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK33 @ sK32) @ sK34) @ sK36)))) | ($true != ((mem @ sK34 @ (arr @ sK33 @ sK32)))) | ($true != ((mem @ sK36 @ (arr @ sK32 @ bool)))) | (~spl37_52 | ~spl37_69 | ~spl37_71)),
% 9.19/1.67 inference(forward_subsumption_resolution,[],[f5552,f342])).
% 9.19/1.67 thf(f5555,plain,(
% 9.19/1.67 ($true != ((mem @ sK34 @ (arr @ sK33 @ sK32)))) | ($true != ((mem @ sK36 @ (arr @ sK32 @ bool)))) | (~spl37_52 | ~spl37_69 | ~spl37_71)),
% 9.19/1.67 inference(forward_subsumption_resolution,[],[f5554,f517])).
% 9.19/1.67 thf(f5556,plain,(
% 9.19/1.67 ($true != ((mem @ sK36 @ (arr @ sK32 @ bool)))) | (~spl37_52 | ~spl37_69 | ~spl37_71)),
% 9.19/1.67 inference(forward_subsumption_resolution,[],[f5555,f512])).
% 9.19/1.67 thf(f5557,plain,(
% 9.19/1.67 $false | (~spl37_52 | ~spl37_69 | ~spl37_71)),
% 9.19/1.67 inference(forward_subsumption_resolution,[],[f5556,f514])).
% 9.19/1.67 thf(f5558,plain,(
% 9.19/1.67 ~spl37_52 | ~spl37_69 | ~spl37_71),
% 9.19/1.67 inference(avatar_contradiction_clause,[],[f5557])).
% 9.19/1.67 cnf(s56, plain, ~spl37_12, inference(sat_conversion,[],[f1513])).
% 9.19/1.67 cnf(s153, plain, spl37_12 | spl37_52, inference(sat_conversion,[],[f3566])).
% 9.19/1.67 cnf(s178, plain, spl37_12 | spl37_69, inference(sat_conversion,[],[f3741])).
% 9.19/1.67 cnf(s179, plain, spl37_12 | spl37_70 | spl37_71, inference(sat_conversion,[],[f3750])).
% 9.19/1.67 cnf(s180, plain, ~spl37_70, inference(sat_conversion,[],[f3766])).
% 9.19/1.67 cnf(s242, plain, ~spl37_52 | ~spl37_69 | ~spl37_71, inference(sat_conversion,[],[f5558])).
% 9.19/1.67 cnf(s248, plain, spl37_12 | spl37_71, inference(rat,[],[s179,s180])).
% 9.19/1.67 cnf(s266, plain, spl37_71, inference(rat,[],[s248,s56])).
% 9.19/1.67 cnf(s267, plain, spl37_69, inference(rat,[],[s178,s56])).
% 9.19/1.67 cnf(s268, plain, spl37_52, inference(rat,[],[s153,s56])).
% 9.19/1.67 cnf(s269, plain, $false, inference(rat,[],[s242,s266,s267,s268])).
% 9.19/1.67 thf(f5559,plain,(
% 9.19/1.67 $false),
% 9.19/1.67 inference(avatar_sat_refutation,[],[s269])).
% 9.19/1.67 % SZS output end Proof for theBenchmark
% 9.19/1.67 % (3289687)------------------------------
% 9.19/1.67 % (3289687)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.19/1.67 % (3289687)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.19/1.67 % (3289687)CaDiCaL version: 2.1.3
% 9.19/1.67 % (3289687)Termination reason: Refutation
% 9.19/1.67 % (3289687)Time elapsed: 0.401 s
% 9.19/1.67 % (3289687)Peak memory usage: 15 MB
% 9.19/1.67 % (3289687)Instructions burned: 814 (million)
% 9.19/1.67 % (3289626)Success in time 1.433 s
% 9.19/1.67 % Vampire exiting
%------------------------------------------------------------------------------