%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ITP083^2 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:38 AM UTC 2026
% Result : Theorem 6.16s 1.19s
% Output : Refutation 6.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP083^2 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n008.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 19:50:56 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24 Running first-order model finding
% 0.09/0.24 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
% 5.43/1.12 % (3644569)Will run a generic schedule for satisfiability detection.
% 5.43/1.12 % (3644579)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2670465758:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 5.43/1.12 % (3644575)% WARNING: option uhcvi not known.
% 5.43/1.12 % (3644574)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3157669360_2999 on theBenchmark for (2999ds/0Mi)
% 5.43/1.12 % (3644575)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=374304836:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 5.43/1.12 % (3644576)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1913178683:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 5.43/1.12 % (3644577)dis+10_1_sil=32000:sp=arity:random_seed=820962995:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 5.43/1.12 % (3644578)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3731027243:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 5.43/1.12 % (3644580)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1032634816:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 5.43/1.12 % (3644579)Instruction limit reached!
% 5.43/1.12 % (3644579)------------------------------
% 5.43/1.12 % (3644579)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.43/1.12 % (3644579)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.43/1.12 % (3644579)CaDiCaL version: 2.1.3
% 5.43/1.12 % (3644579)Termination reason: Instruction limit
% 5.43/1.12 % (3644579)Termination phase: Saturation
% 5.43/1.12 % (3644579)Time elapsed: 0.031 s
% 5.43/1.12 % (3644579)Peak memory usage: 13 MB
% 5.43/1.12 % (3644579)Instructions burned: 131 (million)
% 5.43/1.12 % (3644578)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.43/1.12 % (3644575)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.43/1.12 % (3644588)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3696346519:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 5.43/1.12 % (3644577)Instruction limit reached!
% 5.43/1.12 % (3644577)------------------------------
% 5.43/1.12 % (3644577)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.43/1.12 % (3644577)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.43/1.12 % (3644577)CaDiCaL version: 2.1.3
% 5.43/1.12 % (3644577)Termination reason: Instruction limit
% 5.43/1.12 % (3644577)Termination phase: Property scanning
% 5.43/1.12 % (3644577)Time elapsed: 0.044 s
% 5.43/1.12 % (3644577)Peak memory usage: 11 MB
% 5.43/1.12 % (3644577)Instructions burned: 103 (million)
% 5.43/1.12 % Exception at run slice level
% 5.43/1.12 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.43/1.12 % (3644578)Instruction limit reached!
% 5.43/1.12 % (3644578)------------------------------
% 5.43/1.12 % (3644578)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.43/1.12 % (3644578)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.43/1.12 % (3644578)CaDiCaL version: 2.1.3
% 5.43/1.12 % (3644578)Termination reason: Instruction limit
% 5.43/1.12 % (3644578)Termination phase: Saturation
% 5.43/1.12 % (3644578)Time elapsed: 0.050 s
% 5.43/1.12 % (3644578)Peak memory usage: 12 MB
% 5.43/1.12 % (3644578)Instructions burned: 117 (million)
% 5.43/1.12 % (3644575)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 5.43/1.12 % Exception at run slice level
% 5.43/1.12 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.43/1.12 % (3644590)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1453821583:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 5.43/1.12 % (3644591)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=149064978:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 5.43/1.12 % (3644592)ott-21_1_sil=16000:fs=off:random_seed=2069814229:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 5.43/1.12 % (3644593)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1955351735:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 5.43/1.12 % (3644580)Instruction limit reached!
% 5.43/1.12 % (3644580)------------------------------
% 6.16/1.19 % (3644580)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.16/1.19 % (3644580)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.16/1.19 % (3644580)CaDiCaL version: 2.1.3
% 6.16/1.19 % (3644580)Termination reason: Instruction limit
% 6.16/1.19 % (3644580)Termination phase: Saturation
% 6.16/1.19 % (3644580)Time elapsed: 0.072 s
% 6.16/1.19 % (3644580)Peak memory usage: 13 MB
% 6.16/1.19 % (3644580)Instructions burned: 161 (million)
% 6.16/1.19 % (3644598)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1265021782:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 6.16/1.19 % (3644591)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.16/1.19 % (3644590)Instruction limit reached!
% 6.16/1.19 % (3644590)------------------------------
% 6.16/1.19 % (3644590)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.16/1.19 % (3644590)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.16/1.19 % (3644590)CaDiCaL version: 2.1.3
% 6.16/1.19 % (3644590)Termination reason: Instruction limit
% 6.16/1.19 % (3644590)Termination phase: Saturation
% 6.16/1.19 % (3644590)Time elapsed: 0.056 s
% 6.16/1.19 % (3644590)Peak memory usage: 13 MB
% 6.16/1.19 % (3644590)Instructions burned: 131 (million)
% 6.16/1.19 % (3644591)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 6.16/1.19 % (3644600)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=4253115799:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 6.16/1.19 % Exception at run slice level
% 6.16/1.19 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.16/1.19 % (3644592)Instruction limit reached!
% 6.16/1.19 % (3644592)------------------------------
% 6.16/1.19 % (3644592)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.16/1.19 % (3644592)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.16/1.19 % (3644592)CaDiCaL version: 2.1.3
% 6.16/1.19 % (3644592)Termination reason: Instruction limit
% 6.16/1.19 % (3644592)Termination phase: Saturation
% 6.16/1.19 % (3644592)Time elapsed: 0.078 s
% 6.16/1.19 % (3644592)Peak memory usage: 13 MB
% 6.16/1.19 % (3644592)Instructions burned: 180 (million)
% 6.16/1.19 % (3644602)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3802325509:i=889:ins=1_2997 on theBenchmark for (2997ds/889Mi)
% 6.16/1.19 % (3644603)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=3528061638: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)
% 6.16/1.19 % (3644603)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.16/1.19 % (3644593)Instruction limit reached!
% 6.16/1.19 % (3644593)------------------------------
% 6.16/1.19 % (3644593)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.16/1.19 % (3644593)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.16/1.19 % (3644593)CaDiCaL version: 2.1.3
% 6.16/1.19 % (3644593)Termination reason: Instruction limit
% 6.16/1.19 % (3644593)Termination phase: Saturation
% 6.16/1.19 % (3644593)Time elapsed: 0.130 s
% 6.16/1.19 % (3644593)Peak memory usage: 14 MB
% 6.16/1.19 % (3644593)Instructions burned: 481 (million)
% 6.16/1.19 % (3644606)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1685890963:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 6.16/1.19 % Exception at run slice level
% 6.16/1.19 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.16/1.19 % (3644606)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.16/1.19 % (3644608)fmb+10_1_sil=64000:random_seed=1062068437:i=22061:nm=2:gsp=on_2997 on theBenchmark for (2997ds/22061Mi)
% 6.16/1.19 % (3644608)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 6.16/1.19 % Exception at run slice level
% 6.16/1.19 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.16/1.19 % (3644610)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=928939194:i=9515:nm=5_2996 on theBenchmark for (2996ds/9515Mi)
% 6.16/1.19 % Exception at run slice level
% 6.16/1.19 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.16/1.19 % (3644612)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=3190283882:fmbsr=1.7:i=920_2995 on theBenchmark for (2995ds/920Mi)
% 6.16/1.19 % Exception at run slice level
% 6.16/1.19 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.16/1.19 % (3644591)Instruction limit reached!
% 6.16/1.19 % (3644591)------------------------------
% 6.16/1.19 % (3644591)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.16/1.19 % (3644591)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.16/1.19 % (3644591)CaDiCaL version: 2.1.3
% 6.16/1.19 % (3644591)Termination reason: Instruction limit
% 6.16/1.19 % (3644591)Termination phase: Saturation
% 6.16/1.19 % (3644591)Time elapsed: 0.363 s
% 6.16/1.19 % (3644591)Peak memory usage: 16 MB
% 6.16/1.19 % (3644591)Instructions burned: 684 (million)
% 6.16/1.19 % (3644614)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=1494550882:i=5131_2995 on theBenchmark for (2995ds/5131Mi)
% 6.16/1.19 % (3644606)Instruction limit reached!
% 6.16/1.19 % (3644606)------------------------------
% 6.16/1.19 % (3644606)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.16/1.19 % (3644606)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.16/1.19 % (3644606)CaDiCaL version: 2.1.3
% 6.16/1.19 % (3644606)Termination reason: Instruction limit
% 6.16/1.19 % (3644606)Termination phase: Saturation
% 6.16/1.19 % (3644606)Time elapsed: 0.239 s
% 6.16/1.19 % (3644606)Peak memory usage: 19 MB
% 6.16/1.19 % (3644606)Instructions burned: 880 (million)
% 6.16/1.19 % (3644615)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3139249577:i=1472:ins=7:fdi=8:gsp=on_2995 on theBenchmark for (2995ds/1472Mi)
% 6.16/1.19 % (3644618)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=882217057:i=6324_2994 on theBenchmark for (2994ds/6324Mi)
% 6.16/1.19 % (3644614)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.16/1.19 % Exception at run slice level
% 6.16/1.19 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.16/1.19 % (3644603)Instruction limit reached!
% 6.16/1.19 % (3644603)------------------------------
% 6.16/1.19 % (3644603)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.16/1.19 % (3644603)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.16/1.19 % (3644603)CaDiCaL version: 2.1.3
% 6.16/1.19 % (3644603)Termination reason: Instruction limit
% 6.16/1.19 % (3644603)Termination phase: Saturation
% 6.16/1.19 % (3644603)Time elapsed: 0.323 s
% 6.16/1.19 % (3644603)Peak memory usage: 19 MB
% 6.16/1.19 % (3644603)Instructions burned: 692 (million)
% 6.16/1.19 % (3644615)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 6.16/1.19 % (3644620)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=1075985511:fmbsr=2.30978:i=2174_2994 on theBenchmark for (2994ds/2174Mi)
% 6.16/1.19 % (3644615)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 6.16/1.19 % (3644621)ott-2_1_sil=16000:newcnf=on:random_seed=4256826023:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2994 on theBenchmark for (2994ds/869Mi)
% 6.16/1.19 % Exception at run slice level
% 6.16/1.19 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.16/1.19 % (3644624)ott+10_1_sil=32000:tgt=ground:random_seed=3240820699:i=5114:av=off_2994 on theBenchmark for (2994ds/5114Mi)
% 6.16/1.19 % (3644621)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.16/1.19 % (3644600)Instruction limit reached!
% 6.16/1.19 % (3644600)------------------------------
% 6.16/1.19 % (3644600)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.16/1.19 % (3644600)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.16/1.19 % (3644600)CaDiCaL version: 2.1.3
% 6.16/1.19 % (3644600)Termination reason: Instruction limit
% 6.16/1.19 % (3644600)Termination phase: Saturation
% 6.16/1.19 % (3644600)Time elapsed: 0.602 s
% 6.16/1.19 % (3644600)Peak memory usage: 22 MB
% 6.16/1.19 % (3644600)Instructions burned: 1182 (million)
% 6.16/1.19 % (3644626)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=1899300249:i=54282_2991 on theBenchmark for (2991ds/54282Mi)
% 6.16/1.19 % Exception at run slice level
% 6.16/1.19 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.16/1.19 % (3644628)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=3153906877:i=3512:aac=none_2991 on theBenchmark for (2991ds/3512Mi)
% 6.16/1.19 % (3644614) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3644569-3644614"...
% 6.16/1.19 % (3644614)...printing done.
% 6.16/1.19 % (3644614)Refutation found. Thanks to Tanya!
% 6.16/1.19 % SZS status Theorem for theBenchmark
% 6.16/1.19 % SZS output start Proof for theBenchmark
% 6.16/1.19 thf(type_def_5, type, product_prod: ($tType * $tType) > $tType).
% 6.16/1.19 thf(type_def_6, type, option: $tType > $tType).
% 6.16/1.19 thf(type_def_7, type, list: $tType > $tType).
% 6.16/1.19 thf(type_def_8, type, set: $tType > $tType).
% 6.16/1.19 thf(type_def_9, type, edgeD: $tType).
% 6.16/1.19 thf(type_def_10, type, node: $tType).
% 6.16/1.19 thf(type_def_11, type, var: $tType).
% 6.16/1.19 thf(type_def_12, type, val: $tType).
% 6.16/1.19 thf(type_def_13, type, g: $tType).
% 6.16/1.19 thf(type_def_14, type, sTfun: ($tType * $tType) > $tType).
% 6.16/1.19 thf(func_def_0, type, bounded_lattice_top: !>[X0: $tType]:($o)).
% 6.16/1.19 thf(func_def_1, type, bounded_lattice: !>[X0: $tType]:($o)).
% 6.16/1.19 thf(func_def_2, type, type: !>[X0: $tType]:($o)).
% 6.16/1.19 thf(func_def_3, type, sup: !>[X0: $tType]:($o)).
% 6.16/1.19 thf(func_def_4, type, order: !>[X0: $tType]:($o)).
% 6.16/1.19 thf(func_def_5, type, lattice: !>[X0: $tType]:($o)).
% 6.16/1.19 thf(func_def_6, type, finite_finite: !>[X0: $tType]:($o)).
% 6.16/1.19 thf(func_def_7, type, linorder: !>[X0: $tType]:($o)).
% 6.16/1.19 thf(func_def_8, type, preorder: !>[X0: $tType]:($o)).
% 6.16/1.19 thf(func_def_9, type, semilattice_sup: !>[X0: $tType]:($o)).
% 6.16/1.19 thf(func_def_10, type, bounde1808546759up_bot: !>[X0: $tType]:($o)).
% 6.16/1.19 thf(func_def_11, type, finite_finite2: !>[X0: $tType]:((set @ X0 > $o))).
% 6.16/1.19 thf(func_def_12, type, graph_1201503639essors: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X1 > list @ product_prod @ X1 @ X2) > X0 > X1 > list @ X1))).
% 6.16/1.19 thf(func_def_13, type, graph_449533722essors: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > list @ X1) > (X0 > X1 > list @ product_prod @ X1 @ X2) > X0 > X1 > list @ X1))).
% 6.16/1.19 thf(func_def_14, type, irredu280805948_edges: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > list @ X1) > (X0 > X1 > set @ X2) > (X0 > product_prod @ X1 @ X2 > option @ list @ X2) > X0 > set @ X2 > set @ product_prod @ set @ X2 @ set @ X2))).
% 6.16/1.19 thf(func_def_15, type, irredu1918690039_nodes: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > list @ X1) > (X0 > X1 > set @ X2) > (X0 > product_prod @ X1 @ X2 > option @ list @ X2) > X0 > set @ X2 > set @ set @ X2))).
% 6.16/1.19 thf(func_def_16, type, irredu2110774547nt_scc: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:(((X0 > list @ X1) > (X0 > X1 > list @ product_prod @ X1 @ X2) > (X0 > X1 > set @ X3) > (X0 > X1 > set @ X3) > (X0 > product_prod @ X1 @ X3 > option @ list @ X3) > X0 > set @ X3 > set @ X3 > $o))).
% 6.16/1.19 thf(func_def_17, type, irredu2110905762nt_set: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:(((X0 > list @ X1) > (X0 > X1 > list @ product_prod @ X1 @ X2) > (X0 > X1 > set @ X3) > (X0 > X1 > set @ X3) > (X0 > product_prod @ X1 @ X3 > option @ list @ X3) > X0 > set @ X3 > $o))).
% 6.16/1.19 thf(func_def_18, type, sup_sup: !>[X0: $tType]:((X0 > X0 > X0))).
% 6.16/1.19 thf(func_def_19, type, set2: !>[X0: $tType]:((list @ X0 > set @ X0))).
% 6.16/1.19 thf(func_def_20, type, zip: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > list @ product_prod @ X0 @ X1))).
% 6.16/1.19 thf(func_def_21, type, dom: !>[X0: $tType, X1: $tType]:(((X0 > option @ X1) > set @ X0))).
% 6.16/1.19 thf(func_def_22, type, none: !>[X0: $tType]:(option @ X0)).
% 6.16/1.19 thf(func_def_23, type, some: !>[X0: $tType]:((X0 > option @ X0))).
% 6.16/1.19 thf(func_def_24, type, bot_bot: !>[X0: $tType]:(X0)).
% 6.16/1.19 thf(func_def_25, type, ord_less_eq: !>[X0: $tType]:((X0 > X0 > $o))).
% 6.16/1.19 thf(func_def_26, type, product_Pair: !>[X0: $tType, X1: $tType]:((X0 > X1 > product_prod @ X0 @ X1))).
% 6.16/1.19 thf(func_def_27, type, sSA_CFG_SSA_allDefs: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X1 > set @ X2) > (X0 > product_prod @ X1 @ X2 > option @ list @ X2) > X0 > X1 > set @ X2))).
% 6.16/1.19 thf(func_def_28, type, sSA_CFG_SSA_allUses: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:(((X0 > list @ X1) > (X0 > X1 > list @ product_prod @ X1 @ X2) > (X0 > X1 > set @ X3) > (X0 > product_prod @ X1 @ X3 > option @ list @ X3) > X0 > X1 > set @ X3))).
% 6.16/1.19 thf(func_def_29, type, sSA_CFG_SSA_allVars: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:(((X0 > list @ X1) > (X0 > X1 > list @ product_prod @ X1 @ X2) > (X0 > X1 > set @ X3) > (X0 > X1 > set @ X3) > (X0 > product_prod @ X1 @ X3 > option @ list @ X3) > X0 > set @ X3))).
% 6.16/1.19 thf(func_def_30, type, sSA_CFG_SSA_phiDefs: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > product_prod @ X1 @ X2 > option @ list @ X2) > X0 > X1 > set @ X2))).
% 6.16/1.19 thf(func_def_31, type, sSA_CFG_SSA_phiUses: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:(((X0 > list @ X1) > (X0 > X1 > list @ product_prod @ X1 @ X2) > (X0 > product_prod @ X1 @ X3 > option @ list @ X3) > X0 > X1 > set @ X3))).
% 6.16/1.19 thf(func_def_32, type, sSA_CF1081484811efNode: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > list @ X1) > (X0 > X1 > set @ X2) > (X0 > product_prod @ X1 @ X2 > option @ list @ X2) > X0 > X2 > X1))).
% 6.16/1.19 thf(func_def_33, type, sSA_CF1297404942ialPhi: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > list @ X1) > (X0 > X1 > set @ X2) > (X0 > product_prod @ X1 @ X2 > option @ list @ X2) > X0 > X2 > X2 > $o))).
% 6.16/1.19 thf(func_def_34, type, sSA_CF722422777iveVal: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > list @ X1) > (X0 > X1 > set @ X2) > (X0 > X1 > set @ X2) > (X0 > product_prod @ X1 @ X2 > option @ list @ X2) > X0 > X2 > $o))).
% 6.16/1.19 thf(func_def_35, type, sSA_CFG_SSA_wf_phi: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > list @ X1) > (X0 > X1 > set @ X2) > (X0 > product_prod @ X1 @ X2 > option @ list @ X2) > X0 > X2 > option @ list @ X2))).
% 6.16/1.19 thf(func_def_36, type, sSA_CF1165125185phiArg: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > list @ X1) > (X0 > X1 > set @ X2) > (X0 > product_prod @ X1 @ X2 > option @ list @ X2) > X0 > X2 > X2 > $o))).
% 6.16/1.19 thf(func_def_37, type, sSA_CF823892918pruned: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > list @ X1) > (X0 > X1 > set @ X2) > (X0 > X1 > set @ X2) > (X0 > product_prod @ X1 @ X2 > option @ list @ X2) > X0 > $o))).
% 6.16/1.19 thf(func_def_38, type, sSA_CF462202545undant: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:(((X0 > list @ X1) > (X0 > X1 > list @ product_prod @ X1 @ X2) > (X0 > X1 > set @ X3) > (X0 > X1 > set @ X3) > (X0 > product_prod @ X1 @ X3 > option @ list @ X3) > X0 > $o))).
% 6.16/1.19 thf(func_def_39, type, sSA_CF1363434349rivial: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:(((X0 > list @ X1) > (X0 > X1 > list @ product_prod @ X1 @ X2) > (X0 > X1 > set @ X3) > (X0 > X1 > set @ X3) > (X0 > product_prod @ X1 @ X3 > option @ list @ X3) > X0 > X3 > $o))).
% 6.16/1.19 thf(func_def_40, type, sSA_CFG_vars: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > list @ X1) > (X0 > X1 > set @ X2) > X0 > set @ X2))).
% 6.16/1.19 thf(func_def_41, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 6.16/1.19 thf(func_def_42, type, insert: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 6.16/1.19 thf(func_def_43, type, transitive_acyclic: !>[X0: $tType]:((set @ product_prod @ X0 @ X0 > $o))).
% 6.16/1.19 thf(func_def_44, type, transitive_tranclp: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > X0 > $o))).
% 6.16/1.19 thf(func_def_45, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 6.16/1.19 thf(func_def_46, type, alpha_n: (g > list @ node)).
% 6.16/1.19 thf(func_def_47, type, phi: val).
% 6.16/1.19 thf(func_def_48, type, phi_s: val).
% 6.16/1.19 thf(func_def_49, type, phi2: val).
% 6.16/1.19 thf(func_def_50, type, defs: (g > node > set @ val)).
% 6.16/1.19 thf(func_def_51, type, g2: g).
% 6.16/1.19 thf(func_def_52, type, inEdges: (g > node > list @ product_prod @ node @ edgeD)).
% 6.16/1.19 thf(func_def_53, type, phis: (g > product_prod @ node @ val > option @ list @ val)).
% 6.16/1.19 thf(func_def_54, type, s: val).
% 6.16/1.19 thf(func_def_55, type, uses: (g > node > set @ val)).
% 6.16/1.19 thf(func_def_56, type, var2: (g > val > var)).
% 6.16/1.19 thf(func_def_60, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 6.16/1.19 thf(func_def_61, type, vAND: ($o > $o > $o)).
% 6.16/1.19 thf(func_def_62, type, db0: !>[X0: $tType]:(X0)).
% 6.16/1.19 thf(func_def_63, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 6.16/1.19 thf(func_def_64, type, vOR: ($o > $o > $o)).
% 6.16/1.19 thf(func_def_65, type, db1: !>[X0: $tType]:(X0)).
% 6.16/1.19 thf(func_def_66, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 6.16/1.19 thf(func_def_67, type, db6: !>[X0: $tType]:(X0)).
% 6.16/1.19 thf(func_def_68, type, db5: !>[X0: $tType]:(X0)).
% 6.16/1.19 thf(func_def_69, type, db4: !>[X0: $tType]:(X0)).
% 6.16/1.19 thf(func_def_70, type, db3: !>[X0: $tType]:(X0)).
% 6.16/1.19 thf(func_def_71, type, db2: !>[X0: $tType]:(X0)).
% 6.16/1.19 thf(func_def_72, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 6.16/1.19 thf(func_def_73, type, vIMP: ($o > $o > $o)).
% 6.16/1.19 thf(func_def_74, type, db7: !>[X0: $tType]:(X0)).
% 6.16/1.19 thf(func_def_75, type, vNOT: ($o > $o)).
% 6.16/1.19 thf(func_def_76, type, sP0: (g > (val > $o) > $o)).
% 6.16/1.19 thf(func_def_77, type, sP1: !>[X0: $tType, X1: $tType, X2: $tType]:(((X2 > X1 > set @ X0) > (X2 > list @ X1) > (X2 > X1 > set @ X0) > (X2 > product_prod @ X1 @ X0 > option @ list @ X0) > X2 > (X0 > $o) > $o))).
% 6.16/1.19 thf(func_def_78, type, sP2: !>[X0: $tType, X1: $tType]:(((option @ X1 > option @ X0 > $o) > option @ X1 > option @ X0 > $o))).
% 6.16/1.19 thf(func_def_79, type, sK3: val).
% 6.16/1.19 thf(func_def_80, type, sK4: (g > val > node)).
% 6.16/1.19 thf(func_def_81, type, sK5: (g > (val > $o) > val)).
% 6.16/1.19 thf(func_def_82, type, sK6: (g > (val > $o) > val)).
% 6.16/1.19 thf(func_def_83, type, sK7: ((val > $o) > g > node)).
% 6.16/1.19 thf(func_def_84, type, sK8: ((val > $o) > g > val)).
% 6.16/1.19 thf(func_def_85, type, sK9: (val > g > val)).
% 6.16/1.19 thf(func_def_86, type, sK10: (val > g > node)).
% 6.16/1.19 thf(func_def_87, type, sK11: (g > val > node)).
% 6.16/1.19 thf(func_def_88, type, sK12: (g > val > node)).
% 6.16/1.19 thf(func_def_89, type, sK13: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 6.16/1.19 thf(func_def_90, type, sK14: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 6.16/1.19 thf(func_def_91, type, sK15: !>[X0: $tType]:((set @ X0 > list @ X0))).
% 6.16/1.19 thf(func_def_92, type, sK16: !>[X0: $tType, X1: $tType, X2: $tType]:(((X2 > X1 > set @ X0) > (X2 > list @ X1) > (X2 > X1 > set @ X0) > (X2 > product_prod @ X1 @ X0 > option @ list @ X0) > X2 > (X0 > $o) > X0))).
% 6.16/1.19 thf(func_def_93, type, sK17: !>[X0: $tType, X1: $tType, X2: $tType]:(((X2 > X1 > set @ X0) > (X2 > list @ X1) > (X2 > X1 > set @ X0) > (X2 > product_prod @ X1 @ X0 > option @ list @ X0) > X2 > (X0 > $o) > X0))).
% 6.16/1.19 thf(func_def_94, type, sK18: !>[X0: $tType, X1: $tType, X2: $tType]:(((X2 > $o) > X1 > (X1 > X0 > set @ X2) > (X1 > list @ X0) > X0))).
% 6.16/1.19 thf(func_def_95, type, sK19: !>[X0: $tType, X1: $tType, X2: $tType]:(((X2 > $o) > X1 > (X1 > X0 > set @ X2) > (X1 > list @ X0) > X2))).
% 6.16/1.19 thf(func_def_96, type, sK20: !>[X0: $tType, X1: $tType, X2: $tType]:((X2 > X1 > (X1 > product_prod @ X0 @ X2 > option @ list @ X2) > (X1 > X0 > set @ X2) > (X1 > X0 > set @ X2) > (X1 > list @ X0) > X2))).
% 6.16/1.19 thf(func_def_97, type, sK21: !>[X0: $tType, X1: $tType, X2: $tType]:((X2 > X1 > (X1 > X0 > set @ X2) > (X1 > list @ X0) > X0))).
% 6.16/1.19 thf(func_def_98, type, sK22: (val > val > g > node)).
% 6.16/1.19 thf(func_def_99, type, sK23: (val > g > node > val)).
% 6.16/1.19 thf(func_def_100, type, sK24: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > set @ X1 > X1 > X0))).
% 6.16/1.19 thf(func_def_101, type, sK25: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > set @ X1 > X1))).
% 6.16/1.19 thf(func_def_102, type, sK26: (list @ val > g > node > val)).
% 6.16/1.19 thf(func_def_103, type, sK27: (set @ val > g > set @ val)).
% 6.16/1.19 thf(func_def_104, type, sK28: (node > g > val > node)).
% 6.16/1.19 thf(func_def_105, type, sK29: (node > g > val > val)).
% 6.16/1.19 thf(func_def_106, type, sK30: (node > g > val > list @ val)).
% 6.16/1.19 thf(func_def_107, type, sK31: !>[X0: $tType]:((X0 > set @ X0 > X0))).
% 6.16/1.19 thf(func_def_108, type, sK32: !>[X0: $tType]:((X0 > set @ X0 > X0))).
% 6.16/1.19 thf(func_def_109, type, sK33: !>[X0: $tType, X1: $tType]:(((option @ X1 > option @ X0 > $o) > option @ X1 > option @ X0 > X1))).
% 6.16/1.19 thf(func_def_110, type, sK34: !>[X0: $tType, X1: $tType]:(((option @ X1 > option @ X0 > $o) > option @ X1 > option @ X0 > X0))).
% 6.16/1.19 thf(func_def_111, type, sK35: !>[X0: $tType]:(((option @ X0 > $o) > X0))).
% 6.16/1.19 thf(func_def_112, type, sK36: !>[X0: $tType]:((option @ X0 > X0))).
% 6.16/1.19 thf(func_def_113, type, sK37: (g > set @ val > set @ val)).
% 6.16/1.19 thf(func_def_114, type, sK38: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 6.16/1.19 thf(func_def_115, type, sK39: !>[X0: $tType]:((set @ X0 > X0))).
% 6.16/1.19 thf(func_def_116, type, sK40: !>[X0: $tType]:((set @ X0 > X0))).
% 6.16/1.19 thf(func_def_117, type, sK41: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 6.16/1.19 thf(func_def_118, type, sK42: !>[X0: $tType]:(((X0 > X0 > X0) > X0))).
% 6.16/1.19 thf(func_def_119, type, sK43: !>[X0: $tType]:(((X0 > X0 > X0) > X0))).
% 6.16/1.19 thf(func_def_120, type, sK44: !>[X0: $tType]:(((X0 > X0 > X0) > X0))).
% 6.16/1.19 thf(func_def_121, type, sK45: !>[X0: $tType]:(((X0 > X0 > X0) > X0))).
% 6.16/1.19 thf(func_def_122, type, sK46: !>[X0: $tType]:(((X0 > X0 > X0) > X0))).
% 6.16/1.19 thf(func_def_123, type, sK47: !>[X0: $tType]:(((X0 > X0 > X0) > X0))).
% 6.16/1.19 thf(func_def_124, type, sK48: !>[X0: $tType]:(((X0 > X0 > X0) > X0))).
% 6.16/1.19 thf(func_def_125, type, sK49: !>[X0: $tType]:((set @ X0 > set @ X0 > set @ X0 > set @ X0))).
% 6.16/1.19 thf(func_def_126, type, sK50: !>[X0: $tType]:((set @ X0 > set @ X0 > set @ X0 > set @ X0))).
% 6.16/1.19 thf(func_def_127, type, sK51: (set @ val > g > val)).
% 6.16/1.19 thf(func_def_128, type, sK52: (set @ val > g > val > val)).
% 6.16/1.19 thf(func_def_129, type, sK53: (set @ val > g > val > val)).
% 6.16/1.19 thf(func_def_130, type, sK54: !>[X0: $tType]:(((X0 > $o) > set @ X0 > X0))).
% 6.16/1.19 thf(func_def_131, type, sK55: !>[X0: $tType]:(((X0 > $o) > set @ X0 > X0))).
% 6.16/1.19 thf(func_def_132, type, sK56: !>[X0: $tType]:((set @ X0 > set @ X0 > (X0 > $o) > X0))).
% 6.16/1.19 thf(func_def_133, type, sK57: !>[X0: $tType]:((set @ X0 > (X0 > $o) > set @ X0 > X0))).
% 6.16/1.19 thf(func_def_134, type, sK58: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 6.16/1.19 thf(func_def_135, type, sK59: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 6.16/1.19 thf(func_def_136, type, sK60: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 6.16/1.19 thf(func_def_137, type, sK61: !>[X0: $tType]:((list @ X0 > set @ X0 > X0))).
% 6.16/1.19 thf(func_def_138, type, sK62: !>[X0: $tType]:((option @ X0 > X0))).
% 6.16/1.19 thf(func_def_139, type, sK63: !>[X0: $tType]:((option @ X0 > X0))).
% 6.16/1.19 thf(func_def_140, type, sK64: (val > g > val > list @ val)).
% 6.16/1.19 thf(func_def_141, type, sK65: (g > node)).
% 6.16/1.19 thf(func_def_142, type, sK66: (g > val)).
% 6.16/1.19 thf(func_def_143, type, sK67: (val > g > val)).
% 6.16/1.19 thf(func_def_144, type, sK68: (val > g > val)).
% 6.16/1.19 thf(func_def_145, type, sK69: (val > g > val)).
% 6.16/1.19 thf(func_def_146, type, sK70: (val > g > node)).
% 6.16/1.19 thf(func_def_147, type, sK71: (val > g > val)).
% 6.16/1.19 thf(func_def_148, type, sK72: (g > val)).
% 6.16/1.19 thf(func_def_149, type, sK73: !>[X0: $tType]:(((option @ X0 > $o) > X0))).
% 6.16/1.19 thf(func_def_150, type, sK74: !>[X0: $tType]:(((option @ X0 > $o) > option @ X0))).
% 6.16/1.19 thf(func_def_151, type, sK75: !>[X0: $tType]:(((option @ X0 > $o) > option @ X0))).
% 6.16/1.19 thf(func_def_152, type, sK76: !>[X0: $tType]:(((option @ X0 > $o) > X0))).
% 6.16/1.19 thf(f6,axiom,(
% 6.16/1.19 ~ ! [X0 : val] : ~(sSA_CF1165125185phiArg @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ X0 @ phi_s)),
% 6.16/1.19 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_5__092_060open_062_092_060And_062thesis_O_A_I_092_060And_062_092_060phi_062_H_O_AphiArg_Ag_A_092_060phi_062_H_A_092_060phi_062_092_060_094sub_062s_A_092_060Longrightarrow_062_Athesis_J_A_092_060Longrightarrow_062_Athesis_092_060close_062)).
% 6.16/1.19 thf(f7,axiom,(
% 6.16/1.19 ! [X0 : g,X1 : val,X2 : val] : ((sSA_CF1165125185phiArg @ g @ node @ val @ alpha_n @ defs @ phis @ X0 @ X1 @ X2) => (member @ val @ X2 @ (sSA_CFG_SSA_allVars @ g @ node @ edgeD @ val @ alpha_n @ inEdges @ defs @ uses @ phis @ X0)))),
% 6.16/1.19 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_6_phiArg__in__allVars)).
% 6.16/1.19 thf(f301,conjecture,(
% 6.16/1.19 (member @ val @ phi_s @ (sSA_CFG_SSA_allVars @ g @ node @ edgeD @ val @ alpha_n @ inEdges @ defs @ uses @ phis @ g2))),
% 6.16/1.19 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0)).
% 6.16/1.19 thf(f302,negated_conjecture,(
% 6.16/1.19 ~(member @ val @ phi_s @ (sSA_CFG_SSA_allVars @ g @ node @ edgeD @ val @ alpha_n @ inEdges @ defs @ uses @ phis @ g2))),
% 6.16/1.19 inference(negated_conjecture,[status(cth)],[f301])).
% 6.16/1.19 thf(f309,plain,(
% 6.16/1.19 ~ ! [X0 : val] : ~(sSA_CF1165125185phiArg @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ X0 @ phi_s)),
% 6.16/1.19 inference(rectify,[],[f6])).
% 6.16/1.19 thf(f310,plain,(
% 6.16/1.19 ~ ! [X0 : val] : ~ (((sSA_CF1165125185phiArg @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ X0 @ phi_s)) = $true)),
% 6.16/1.19 inference(fool_elimination,[],[f309])).
% 6.16/1.19 thf(f311,plain,(
% 6.16/1.19 ! [X0 : g,X1 : val,X2 : val] : ((sSA_CF1165125185phiArg @ g @ node @ val @ alpha_n @ defs @ phis @ X0 @ X1 @ X2) => (member @ val @ X2 @ (sSA_CFG_SSA_allVars @ g @ node @ edgeD @ val @ alpha_n @ inEdges @ defs @ uses @ phis @ X0)))),
% 6.16/1.19 inference(rectify,[],[f7])).
% 6.16/1.19 thf(f312,plain,(
% 6.16/1.19 ! [X0 : g,X1 : val,X2 : val] : ((((sSA_CF1165125185phiArg @ g @ node @ val @ alpha_n @ defs @ phis @ X0 @ X1 @ X2)) = $true) => (((member @ val @ X2 @ (sSA_CFG_SSA_allVars @ g @ node @ edgeD @ val @ alpha_n @ inEdges @ defs @ uses @ phis @ X0))) = $true))),
% 6.16/1.19 inference(fool_elimination,[],[f311])).
% 6.16/1.19 thf(f845,plain,(
% 6.16/1.19 ~(member @ val @ phi_s @ (sSA_CFG_SSA_allVars @ g @ node @ edgeD @ val @ alpha_n @ inEdges @ defs @ uses @ phis @ g2))),
% 6.16/1.19 inference(rectify,[],[f302])).
% 6.16/1.19 thf(f846,plain,(
% 6.16/1.19 ~ (((member @ val @ phi_s @ (sSA_CFG_SSA_allVars @ g @ node @ edgeD @ val @ alpha_n @ inEdges @ defs @ uses @ phis @ g2))) = $true)),
% 6.16/1.19 inference(fool_elimination,[],[f845])).
% 6.16/1.19 thf(f847,plain,(
% 6.16/1.19 ~ ! [X0 : val] : (((sSA_CF1165125185phiArg @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ X0 @ phi_s)) != $true)),
% 6.16/1.19 inference(flattening,[],[f310])).
% 6.16/1.19 thf(f867,plain,(
% 6.16/1.19 (((member @ val @ phi_s @ (sSA_CFG_SSA_allVars @ g @ node @ edgeD @ val @ alpha_n @ inEdges @ defs @ uses @ phis @ g2))) != $true)),
% 6.16/1.19 inference(flattening,[],[f846])).
% 6.16/1.19 thf(f868,plain,(
% 6.16/1.19 ? [X0 : val] : (((sSA_CF1165125185phiArg @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ X0 @ phi_s)) = $true)),
% 6.16/1.19 inference(ennf_transformation,[],[f847])).
% 6.16/1.19 thf(f869,plain,(
% 6.16/1.19 ! [X0 : g,X1 : val,X2 : val] : ((((member @ val @ X2 @ (sSA_CFG_SSA_allVars @ g @ node @ edgeD @ val @ alpha_n @ inEdges @ defs @ uses @ phis @ X0))) = $true) | (((sSA_CF1165125185phiArg @ g @ node @ val @ alpha_n @ defs @ phis @ X0 @ X1 @ X2)) != $true))),
% 6.16/1.19 inference(ennf_transformation,[],[f312])).
% 6.16/1.19 thf(f1168,plain,(
% 6.16/1.19 ($true = ((sSA_CF1165125185phiArg @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ sK3 @ phi_s)))),
% 6.16/1.19 inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X0,sK3)],[f868])).
% 6.16/1.19 thf(f1214,plain,(
% 6.16/1.19 ($true = ((sSA_CF1165125185phiArg @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ sK3 @ phi_s)))),
% 6.16/1.19 inference(cnf_transformation,[],[f1168])).
% 6.16/1.19 thf(f1215,plain,(
% 6.16/1.19 ( ! [X2 : val,X0 : g,X1 : val] : ((((sSA_CF1165125185phiArg @ g @ node @ val @ alpha_n @ defs @ phis @ X0 @ X1 @ X2)) != $true) | (((member @ val @ X2 @ (sSA_CFG_SSA_allVars @ g @ node @ edgeD @ val @ alpha_n @ inEdges @ defs @ uses @ phis @ X0))) = $true)) )),
% 6.16/1.19 inference(cnf_transformation,[],[f869])).
% 6.16/1.19 thf(f1562,plain,(
% 6.16/1.19 (((member @ val @ phi_s @ (sSA_CFG_SSA_allVars @ g @ node @ edgeD @ val @ alpha_n @ inEdges @ defs @ uses @ phis @ g2))) != $true)),
% 6.16/1.19 inference(cnf_transformation,[],[f867])).
% 6.16/1.19 thf(f8580,plain,(
% 6.16/1.19 ($true != $true) | (((member @ val @ phi_s @ (sSA_CFG_SSA_allVars @ g @ node @ edgeD @ val @ alpha_n @ inEdges @ defs @ uses @ phis @ g2))) = $true)),
% 6.16/1.19 inference(constrained_superposition,[],[f1215,f1214])).
% 6.16/1.19 thf(f8581,plain,(
% 6.16/1.19 (((member @ val @ phi_s @ (sSA_CFG_SSA_allVars @ g @ node @ edgeD @ val @ alpha_n @ inEdges @ defs @ uses @ phis @ g2))) = $true)),
% 6.16/1.19 inference(trivial_inequality_removal,[],[f8580])).
% 6.16/1.19 thf(f8586,plain,(
% 6.16/1.19 $false),
% 6.16/1.19 inference(forward_subsumption_resolution,[],[f8581,f1562])).
% 6.16/1.19 % SZS output end Proof for theBenchmark
% 6.16/1.19 % (3644614)------------------------------
% 6.16/1.19 % (3644614)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.16/1.19 % (3644614)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.16/1.19 % (3644614)CaDiCaL version: 2.1.3
% 6.16/1.19 % (3644614)Termination reason: Refutation
% 6.16/1.19 % (3644614)Time elapsed: 0.431 s
% 6.16/1.19 % (3644614)Peak memory usage: 18 MB
% 6.16/1.19 % (3644614)Instructions burned: 828 (million)
% 6.16/1.19 % (3644569)Success in time 0.942 s
% 6.16/1.19 % Vampire exiting
%------------------------------------------------------------------------------