%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU582^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n013.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:32:32 AM UTC 2026
% Result : Theorem 6.36s 1.16s
% Output : Refutation 6.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU582^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n013.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 13:51:36 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.19/0.99 % (2150964)Will run a generic schedule for satisfiability detection.
% 4.19/0.99 % (2150971)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2138430663:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.19/0.99 % (2150970)% WARNING: option uhcvi not known.
% 4.19/0.99 % (2150969)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1423351575_2999 on theBenchmark for (2999ds/0Mi)
% 4.19/0.99 % (2150970)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2046707641:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.19/0.99 % (2150972)dis+10_1_sil=32000:sp=arity:random_seed=879648799:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.19/0.99 % (2150973)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=942265078:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.19/0.99 % (2150974)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1614154645:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.19/0.99 % (2150975)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3859792138:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.19/0.99 % (2150970)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 4.19/0.99 % (2150973)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 4.19/0.99 % Exception at run slice level
% 4.19/0.99 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.19/0.99 % (2150970)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 4.19/0.99 % (2150983)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2624223173:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 4.19/0.99 % (2150972)Instruction limit reached!
% 4.19/0.99 % (2150972)------------------------------
% 4.19/0.99 % (2150972)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.19/0.99 % (2150972)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/0.99 % (2150972)CaDiCaL version: 2.1.3
% 4.19/0.99 % (2150972)Termination reason: Instruction limit
% 4.19/0.99 % (2150972)Termination phase: Saturation
% 4.19/0.99 % (2150972)Time elapsed: 0.049 s
% 4.19/0.99 % (2150972)Peak memory usage: 13 MB
% 4.19/0.99 % (2150972)Instructions burned: 103 (million)
% 4.19/0.99 % Exception at run slice level
% 4.19/0.99 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.19/0.99 % (2150973)Instruction limit reached!
% 4.19/0.99 % (2150973)------------------------------
% 4.19/0.99 % (2150973)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.19/0.99 % (2150973)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/0.99 % (2150973)CaDiCaL version: 2.1.3
% 4.19/0.99 % (2150973)Termination reason: Instruction limit
% 4.19/0.99 % (2150973)Termination phase: Saturation
% 4.19/0.99 % (2150973)Time elapsed: 0.055 s
% 4.19/0.99 % (2150973)Peak memory usage: 13 MB
% 4.19/0.99 % (2150973)Instructions burned: 117 (million)
% 4.19/0.99 % (2150974)Instruction limit reached!
% 4.19/0.99 % (2150974)------------------------------
% 4.19/0.99 % (2150974)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.19/0.99 % (2150974)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/0.99 % (2150974)CaDiCaL version: 2.1.3
% 4.19/0.99 % (2150974)Termination reason: Instruction limit
% 4.19/0.99 % (2150974)Termination phase: Saturation
% 4.19/0.99 % (2150974)Time elapsed: 0.060 s
% 4.19/0.99 % (2150974)Peak memory usage: 13 MB
% 4.19/0.99 % (2150974)Instructions burned: 132 (million)
% 4.19/0.99 % (2150985)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2160674390:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 4.19/0.99 % (2150975)Instruction limit reached!
% 4.19/0.99 % (2150975)------------------------------
% 4.19/0.99 % (2150975)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.19/0.99 % (2150975)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/0.99 % (2150975)CaDiCaL version: 2.1.3
% 4.19/0.99 % (2150975)Termination reason: Instruction limit
% 4.19/0.99 % (2150975)Termination phase: Saturation
% 4.19/0.99 % (2150975)Time elapsed: 0.071 s
% 4.19/0.99 % (2150975)Peak memory usage: 14 MB
% 4.19/0.99 % (2150975)Instructions burned: 167 (million)
% 4.19/0.99 % (2150986)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=2649990555:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 6.36/1.16 % (2150987)ott-21_1_sil=16000:fs=off:random_seed=2022678909:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 6.36/1.16 % (2150988)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1590086611:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 6.36/1.16 % (2150986)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.36/1.16 % (2150990)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=4115079398:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 6.36/1.16 % (2150986)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 6.36/1.16 % Exception at run slice level
% 6.36/1.16 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.36/1.16 % (2150995)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=23358101:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 6.36/1.16 % (2150985)Instruction limit reached!
% 6.36/1.16 % (2150985)------------------------------
% 6.36/1.16 % (2150985)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.36/1.16 % (2150985)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.36/1.16 % (2150985)CaDiCaL version: 2.1.3
% 6.36/1.16 % (2150985)Termination reason: Instruction limit
% 6.36/1.16 % (2150985)Termination phase: Saturation
% 6.36/1.16 % (2150985)Time elapsed: 0.061 s
% 6.36/1.16 % (2150985)Peak memory usage: 13 MB
% 6.36/1.16 % (2150985)Instructions burned: 132 (million)
% 6.36/1.16 % (2150997)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=4056025861:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 6.36/1.16 % (2150987)Instruction limit reached!
% 6.36/1.16 % (2150987)------------------------------
% 6.36/1.16 % (2150987)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.36/1.16 % (2150987)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.36/1.16 % (2150987)CaDiCaL version: 2.1.3
% 6.36/1.16 % (2150987)Termination reason: Instruction limit
% 6.36/1.16 % (2150987)Termination phase: Saturation
% 6.36/1.16 % (2150987)Time elapsed: 0.087 s
% 6.36/1.16 % (2150987)Peak memory usage: 13 MB
% 6.36/1.16 % (2150987)Instructions burned: 181 (million)
% 6.36/1.16 % Exception at run slice level
% 6.36/1.16 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.36/1.16 % (2150999)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=2346516057: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.36/1.16 % (2151000)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1152800439:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 6.36/1.16 % (2150999)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.36/1.16 % (2151000)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.36/1.16 % (2150986)Instruction limit reached!
% 6.36/1.16 % (2150986)------------------------------
% 6.36/1.16 % (2150986)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.36/1.16 % (2150986)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.36/1.16 % (2150986)CaDiCaL version: 2.1.3
% 6.36/1.16 % (2150986)Termination reason: Instruction limit
% 6.36/1.16 % (2150986)Termination phase: Saturation
% 6.36/1.16 % (2150986)Time elapsed: 0.259 s
% 6.36/1.16 % (2150986)Peak memory usage: 14 MB
% 6.36/1.16 % (2150986)Instructions burned: 685 (million)
% 6.36/1.16 % (2150988)Instruction limit reached!
% 6.36/1.16 % (2150988)------------------------------
% 6.36/1.16 % (2150988)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.36/1.16 % (2150988)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.36/1.16 % (2150988)CaDiCaL version: 2.1.3
% 6.36/1.16 % (2150988)Termination reason: Instruction limit
% 6.36/1.16 % (2150988)Termination phase: Saturation
% 6.36/1.16 % (2150988)Time elapsed: 0.259 s
% 6.36/1.16 % (2150988)Peak memory usage: 13 MB
% 6.36/1.16 % (2150988)Instructions burned: 477 (million)
% 6.36/1.16 % (2151003)fmb+10_1_sil=64000:random_seed=3287835352:i=22061:nm=2:gsp=on_2996 on theBenchmark for (2996ds/22061Mi)
% 6.36/1.16 % (2151004)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=320488136:i=9515:nm=5_2996 on theBenchmark for (2996ds/9515Mi)
% 6.36/1.16 % (2151003)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 6.36/1.16 % Exception at run slice level
% 6.36/1.16 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.36/1.16 % Exception at run slice level
% 6.36/1.16 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.36/1.16 % (2151007)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1839306316:fmbsr=1.7:i=920_2995 on theBenchmark for (2995ds/920Mi)
% 6.36/1.16 % (2151008)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3632581570:i=5131_2995 on theBenchmark for (2995ds/5131Mi)
% 6.36/1.16 % (2151008)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.36/1.16 % Exception at run slice level
% 6.36/1.16 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.36/1.16 % (2151011)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=946455874:i=1472:ins=7:fdi=8:gsp=on_2995 on theBenchmark for (2995ds/1472Mi)
% 6.36/1.16 % (2151011)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 6.36/1.16 % (2151011)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 6.36/1.16 % (2150999)Instruction limit reached!
% 6.36/1.16 % (2150999)------------------------------
% 6.36/1.16 % (2150999)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.36/1.16 % (2150999)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.36/1.16 % (2150999)CaDiCaL version: 2.1.3
% 6.36/1.16 % (2150999)Termination reason: Instruction limit
% 6.36/1.16 % (2150999)Termination phase: Saturation
% 6.36/1.16 % (2150999)Time elapsed: 0.269 s
% 6.36/1.16 % (2150999)Peak memory usage: 15 MB
% 6.36/1.16 % (2150999)Instructions burned: 695 (million)
% 6.36/1.16 % (2151013)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1775873460:i=6324_2995 on theBenchmark for (2995ds/6324Mi)
% 6.36/1.16 % Exception at run slice level
% 6.36/1.16 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.36/1.16 % (2151015)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=3110994625:fmbsr=2.30978:i=2174_2994 on theBenchmark for (2994ds/2174Mi)
% 6.36/1.16 % Exception at run slice level
% 6.36/1.16 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.36/1.16 % (2151017)ott-2_1_sil=16000:newcnf=on:random_seed=4189005162:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2994 on theBenchmark for (2994ds/869Mi)
% 6.36/1.16 % (2151017)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.36/1.16 % (2151000)Instruction limit reached!
% 6.36/1.16 % (2151000)------------------------------
% 6.36/1.16 % (2151000)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.36/1.16 % (2151000)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.36/1.16 % (2151000)CaDiCaL version: 2.1.3
% 6.36/1.16 % (2151000)Termination reason: Instruction limit
% 6.36/1.16 % (2151000)Termination phase: Saturation
% 6.36/1.16 % (2151000)Time elapsed: 0.436 s
% 6.36/1.16 % (2151000)Peak memory usage: 18 MB
% 6.36/1.16 % (2151000)Instructions burned: 881 (million)
% 6.36/1.16 % (2151019)ott+10_1_sil=32000:tgt=ground:random_seed=4221023397:i=5114:av=off_2993 on theBenchmark for (2993ds/5114Mi)
% 6.36/1.16 % (2150995)Instruction limit reached!
% 6.36/1.16 % (2150995)------------------------------
% 6.36/1.16 % (2150995)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.36/1.16 % (2150995)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.36/1.16 % (2150995)CaDiCaL version: 2.1.3
% 6.36/1.16 % (2150995)Termination reason: Instruction limit
% 6.36/1.16 % (2150995)Termination phase: Saturation
% 6.36/1.16 % (2150995)Time elapsed: 0.566 s
% 6.36/1.16 % (2150995)Peak memory usage: 18 MB
% 6.36/1.16 % (2150995)Instructions burned: 1179 (million)
% 6.36/1.16 % (2151021)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=1754978344:i=54282_2992 on theBenchmark for (2992ds/54282Mi)
% 6.36/1.16 % Exception at run slice level
% 6.36/1.16 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.36/1.16 % (2151023)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=1280010443:i=3512:aac=none_2992 on theBenchmark for (2992ds/3512Mi)
% 6.36/1.16 % (2151023)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 6.36/1.16 % (2151017) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2150964-2151017"...
% 6.36/1.16 % (2151017)...printing done.
% 6.36/1.16 % (2151017)Refutation found. Thanks to Tanya!
% 6.36/1.16 % SZS status Theorem for theBenchmark
% 6.36/1.16 % SZS output start Proof for theBenchmark
% 6.36/1.16 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 6.36/1.16 thf(func_def_0, type, in: ($i > $i > $o)).
% 6.36/1.16 thf(func_def_1, type, exu: (($i > $o) > $o)).
% 6.36/1.16 thf(func_def_3, type, setextAx: $o).
% 6.36/1.16 thf(func_def_5, type, emptysetAx: $o).
% 6.36/1.16 thf(func_def_6, type, setadjoin: ($i > $i > $i)).
% 6.36/1.16 thf(func_def_7, type, setadjoinAx: $o).
% 6.36/1.16 thf(func_def_8, type, powerset: ($i > $i)).
% 6.36/1.16 thf(func_def_9, type, powersetAx: $o).
% 6.36/1.16 thf(func_def_10, type, setunion: ($i > $i)).
% 6.36/1.16 thf(func_def_11, type, setunionAx: $o).
% 6.36/1.16 thf(func_def_13, type, omega0Ax: $o).
% 6.36/1.16 thf(func_def_14, type, omegaSAx: $o).
% 6.36/1.16 thf(func_def_15, type, omegaIndAx: $o).
% 6.36/1.16 thf(func_def_16, type, replAx: $o).
% 6.36/1.16 thf(func_def_17, type, foundationAx: $o).
% 6.36/1.16 thf(func_def_18, type, wellorderingAx: $o).
% 6.36/1.16 thf(func_def_19, type, descr: (($i > $o) > $i)).
% 6.36/1.16 thf(func_def_20, type, descrp: $o).
% 6.36/1.16 thf(func_def_21, type, dsetconstr: ($i > ($i > $o) > $i)).
% 6.36/1.16 thf(func_def_22, type, dsetconstrI: $o).
% 6.36/1.16 thf(func_def_23, type, dsetconstrEL: $o).
% 6.36/1.16 thf(func_def_24, type, dsetconstrER: $o).
% 6.36/1.16 thf(func_def_25, type, exuE1: $o).
% 6.36/1.16 thf(func_def_26, type, prop2set: ($o > $i)).
% 6.36/1.16 thf(func_def_27, type, prop2setE: $o).
% 6.36/1.16 thf(func_def_28, type, emptysetE: $o).
% 6.36/1.16 thf(func_def_29, type, emptysetimpfalse: $o).
% 6.36/1.16 thf(func_def_30, type, notinemptyset: $o).
% 6.36/1.16 thf(func_def_31, type, exuE3e: $o).
% 6.36/1.16 thf(func_def_32, type, setext: $o).
% 6.36/1.16 thf(func_def_33, type, emptyI: $o).
% 6.36/1.16 thf(func_def_34, type, noeltsimpempty: $o).
% 6.36/1.16 thf(func_def_35, type, setbeta: $o).
% 6.36/1.16 thf(func_def_36, type, nonempty: ($i > $o)).
% 6.36/1.16 thf(func_def_37, type, nonemptyE1: $o).
% 6.36/1.16 thf(func_def_38, type, nonemptyI: $o).
% 6.36/1.16 thf(func_def_39, type, nonemptyI1: $o).
% 6.36/1.16 thf(func_def_40, type, setadjoinIL: $o).
% 6.36/1.16 thf(func_def_41, type, emptyinunitempty: $o).
% 6.36/1.16 thf(func_def_42, type, setadjoinIR: $o).
% 6.36/1.16 thf(func_def_43, type, setadjoinE: $o).
% 6.36/1.16 thf(func_def_44, type, setadjoinOr: $o).
% 6.36/1.16 thf(func_def_45, type, setoftrueEq: $o).
% 6.36/1.16 thf(func_def_46, type, powersetI: $o).
% 6.36/1.16 thf(func_def_47, type, emptyinPowerset: $o).
% 6.36/1.16 thf(func_def_48, type, emptyInPowerset: $o).
% 6.36/1.16 thf(func_def_49, type, powersetE: $o).
% 6.36/1.16 thf(func_def_50, type, setunionI: $o).
% 6.36/1.16 thf(func_def_51, type, setunionE: $o).
% 6.36/1.16 thf(func_def_52, type, subPowSU: $o).
% 6.36/1.16 thf(func_def_53, type, exuE2: $o).
% 6.36/1.16 thf(func_def_54, type, nonemptyImpWitness: $o).
% 6.36/1.16 thf(func_def_55, type, uniqinunit: $o).
% 6.36/1.16 thf(func_def_56, type, notinsingleton: $o).
% 6.36/1.16 thf(func_def_57, type, eqinunit: $o).
% 6.36/1.16 thf(func_def_58, type, singletonsswitch: $o).
% 6.36/1.16 thf(func_def_59, type, upairsetE: $o).
% 6.36/1.16 thf(func_def_60, type, upairsetIL: $o).
% 6.36/1.16 thf(func_def_61, type, upairsetIR: $o).
% 6.36/1.16 thf(func_def_62, type, emptyE1: $o).
% 6.36/1.16 thf(func_def_63, type, vacuousDall: $o).
% 6.36/1.16 thf(func_def_64, type, quantDeMorgan1: $o).
% 6.36/1.16 thf(func_def_65, type, quantDeMorgan2: $o).
% 6.36/1.16 thf(func_def_66, type, quantDeMorgan3: $o).
% 6.36/1.16 thf(func_def_67, type, quantDeMorgan4: $o).
% 6.36/1.16 thf(func_def_68, type, prop2setI: $o).
% 6.36/1.16 thf(func_def_69, type, set2prop: ($i > $o)).
% 6.36/1.16 thf(func_def_70, type, prop2set2propI: $o).
% 6.36/1.16 thf(func_def_71, type, notdexE: $o).
% 6.36/1.16 thf(func_def_72, type, notdallE: $o).
% 6.36/1.16 thf(func_def_73, type, exuI1: $o).
% 6.36/1.16 thf(func_def_74, type, exuI3: $o).
% 6.36/1.16 thf(func_def_75, type, exuI2: $o).
% 6.36/1.16 thf(func_def_76, type, inCongP: $o).
% 6.36/1.16 thf(func_def_77, type, in__Cong: $o).
% 6.36/1.16 thf(func_def_78, type, exuE3u: $o).
% 6.36/1.16 thf(func_def_79, type, exu__Cong: $o).
% 6.36/1.16 thf(func_def_80, type, emptyset__Cong: $o).
% 6.36/1.16 thf(func_def_81, type, setadjoin__Cong: $o).
% 6.36/1.16 thf(func_def_82, type, powerset__Cong: $o).
% 6.36/1.16 thf(func_def_83, type, setunion__Cong: $o).
% 6.36/1.16 thf(func_def_84, type, omega__Cong: $o).
% 6.36/1.16 thf(func_def_85, type, exuEu: $o).
% 6.36/1.16 thf(func_def_86, type, descr__Cong: $o).
% 6.36/1.16 thf(func_def_87, type, dsetconstr__Cong: $o).
% 6.36/1.16 thf(func_def_88, type, subset: ($i > $i > $o)).
% 6.36/1.16 thf(func_def_89, type, disjoint: ($i > $i > $o)).
% 6.36/1.16 thf(func_def_90, type, setsmeet: ($i > $i > $o)).
% 6.36/1.16 thf(func_def_91, type, subsetI1: $o).
% 6.36/1.16 thf(func_def_92, type, eqimpsubset2: $o).
% 6.36/1.16 thf(func_def_93, type, eqimpsubset1: $o).
% 6.36/1.16 thf(func_def_94, type, subsetI2: $o).
% 6.36/1.16 thf(func_def_95, type, emptysetsubset: $o).
% 6.36/1.16 thf(func_def_96, type, subsetE: $o).
% 6.36/1.16 thf(func_def_97, type, subsetE2: $o).
% 6.36/1.16 thf(func_def_98, type, notsubsetI: $o).
% 6.36/1.16 thf(func_def_99, type, notequalI1: $o).
% 6.36/1.16 thf(func_def_100, type, notequalI2: $o).
% 6.36/1.16 thf(func_def_101, type, subsetRefl: $o).
% 6.36/1.16 thf(func_def_102, type, subsetTrans: $o).
% 6.36/1.16 thf(func_def_103, type, setadjoinSub: $o).
% 6.36/1.16 thf(func_def_104, type, setadjoinSub2: $o).
% 6.36/1.16 thf(func_def_105, type, subset2powerset: $o).
% 6.36/1.16 thf(func_def_106, type, setextsub: $o).
% 6.36/1.16 thf(func_def_107, type, subsetemptysetimpeq: $o).
% 6.36/1.16 thf(func_def_108, type, powersetI1: $o).
% 6.36/1.16 thf(func_def_109, type, powersetE1: $o).
% 6.36/1.16 thf(func_def_110, type, inPowerset: $o).
% 6.36/1.16 thf(func_def_111, type, powersetsubset: $o).
% 6.36/1.16 thf(func_def_112, type, sepInPowerset: $o).
% 6.36/1.16 thf(func_def_113, type, sepSubset: $o).
% 6.36/1.16 thf(func_def_114, type, binunion: ($i > $i > $i)).
% 6.36/1.16 thf(func_def_115, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 6.36/1.16 thf(func_def_116, type, vAND: ($o > $o > $o)).
% 6.36/1.16 thf(func_def_117, type, db1: !>[X0: $tType]:(X0)).
% 6.36/1.16 thf(func_def_118, type, db0: !>[X0: $tType]:(X0)).
% 6.36/1.16 thf(func_def_119, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 6.36/1.16 thf(func_def_120, type, vIMP: ($o > $o > $o)).
% 6.36/1.16 thf(func_def_121, type, db2: !>[X0: $tType]:(X0)).
% 6.36/1.16 thf(func_def_122, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 6.36/1.16 thf(func_def_123, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 6.36/1.16 thf(func_def_124, type, vIFF: ($o > $o > $o)).
% 6.36/1.16 thf(func_def_125, type, vNOT: ($o > $o)).
% 6.36/1.16 thf(func_def_126, type, vOR: ($o > $o > $o)).
% 6.36/1.16 thf(func_def_127, type, db4: !>[X0: $tType]:(X0)).
% 6.36/1.16 thf(func_def_128, type, db3: !>[X0: $tType]:(X0)).
% 6.36/1.16 thf(func_def_131, type, db5: !>[X0: $tType]:(X0)).
% 6.36/1.16 thf(func_def_135, type, sK3: ($i > $i > $i)).
% 6.36/1.16 thf(func_def_136, type, sK4: ($i > $i > $i)).
% 6.36/1.16 thf(func_def_137, type, sK5: (($i > $o) > ($i > $o) > $i > $i > $i)).
% 6.36/1.16 thf(func_def_138, type, sK6: ($i > $i > ($i > $o) > ($i > $o) > $i)).
% 6.36/1.16 thf(func_def_139, type, sK7: (($i > $o) > ($i > $o) > $i)).
% 6.36/1.16 thf(func_def_140, type, sK8: (($i > $o) > ($i > $o) > $i)).
% 6.36/1.16 thf(func_def_141, type, sK9: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_142, type, sK10: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_143, type, sK11: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_144, type, sK12: (($i > $o) > ($i > $o) > $i)).
% 6.36/1.16 thf(func_def_145, type, sK13: (($i > $o) > ($i > $o) > $i)).
% 6.36/1.16 thf(func_def_146, type, sK14: (($i > $o) > $i)).
% 6.36/1.16 thf(func_def_147, type, sK15: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_148, type, sK16: (($i > $o) > $i)).
% 6.36/1.16 thf(func_def_149, type, sK17: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_150, type, sK18: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_151, type, sK19: (($i > $o) > $i)).
% 6.36/1.16 thf(func_def_152, type, sK20: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_153, type, sK21: (($i > $o) > $i)).
% 6.36/1.16 thf(func_def_154, type, sK22: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_155, type, sK23: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_156, type, sK24: (($i > $o) > $i)).
% 6.36/1.16 thf(func_def_157, type, sK25: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_158, type, sK26: (($i > $o) > $i)).
% 6.36/1.16 thf(func_def_159, type, sK27: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_160, type, sK28: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_161, type, sK29: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_162, type, sK30: (($i > $o) > $i)).
% 6.36/1.16 thf(func_def_163, type, sK31: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_164, type, sK32: (($i > $o) > $i)).
% 6.36/1.16 thf(func_def_165, type, sK33: (($i > $o) > $i)).
% 6.36/1.16 thf(func_def_166, type, sK34: (($i > $o) > $i)).
% 6.36/1.16 thf(func_def_167, type, sK35: (($i > $o) > $i)).
% 6.36/1.16 thf(func_def_168, type, sK36: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_169, type, sK37: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_170, type, sK38: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_171, type, sK39: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_172, type, sK40: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_173, type, sK41: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_174, type, sK42: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_175, type, sK43: ($i > $i)).
% 6.36/1.16 thf(func_def_176, type, sK44: (($i > $o) > $i)).
% 6.36/1.16 thf(func_def_177, type, sK45: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_178, type, sK46: ($i > $o > $i > $i)).
% 6.36/1.16 thf(func_def_179, type, sK47: ($i > $i > $i)).
% 6.36/1.16 thf(func_def_180, type, sK48: ($i > $i)).
% 6.36/1.16 thf(func_def_181, type, sK49: ($i > $i)).
% 6.36/1.16 thf(func_def_182, type, sK50: ($i > $i)).
% 6.36/1.16 thf(func_def_183, type, sK51: ($i > $i > $i)).
% 6.36/1.16 thf(func_def_184, type, sK52: ($i > $i > $i)).
% 6.36/1.16 thf(func_def_185, type, sK53: (($i > $o) > $i)).
% 6.36/1.16 thf(func_def_186, type, sK54: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_187, type, sK55: (($i > $o) > $i)).
% 6.36/1.16 thf(func_def_188, type, sK56: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_189, type, sK57: (($i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_190, type, sK58: ($i > $i)).
% 6.36/1.16 thf(func_def_191, type, sK59: ($i > $i > $i > $i)).
% 6.36/1.16 thf(func_def_192, type, sK60: ($i > $i > $i)).
% 6.36/1.16 thf(func_def_193, type, sK61: ($i > $i > $i)).
% 6.36/1.16 thf(func_def_194, type, sK62: ($i > $i > $i)).
% 6.36/1.16 thf(func_def_195, type, sK63: ($i > $i)).
% 6.36/1.16 thf(func_def_196, type, sK64: ($i > ($i > $i > $o) > $i)).
% 6.36/1.16 thf(func_def_197, type, sK65: ($i > ($i > $i > $o) > $i)).
% 6.36/1.16 thf(func_def_198, type, sK66: ($i > $i > ($i > $i > $o) > $i)).
% 6.36/1.16 thf(func_def_199, type, sK67: ($i > ($i > $i > $o) > $i > $i)).
% 6.36/1.16 thf(func_def_200, type, sK68: ($i > $i > ($i > $i > $o) > $i)).
% 6.36/1.16 thf(func_def_201, type, sK69: ($i > $i > ($i > $i > $o) > $i)).
% 6.36/1.16 thf(func_def_202, type, sK70: ($i > $i)).
% 6.36/1.16 thf(func_def_203, type, sK71: ($i > $i > $i)).
% 6.36/1.16 thf(func_def_204, type, sK72: ($i > $i > $i)).
% 6.36/1.16 thf(func_def_205, type, sK73: ($i > $i > $i)).
% 6.36/1.16 thf(f41,axiom,(
% 6.36/1.16 (setunionI = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X1 @ X2) => ((in @ X2 @ X0) => (in @ X1 @ (setunion @ X0)))))),
% 6.36/1.16 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionI)).
% 6.36/1.16 thf(f51,axiom,(
% 6.36/1.16 (upairsetIL = ! [X0 : $i,X1 : $i] : (in @ X0 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))))),
% 6.36/1.16 file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairsetIL)).
% 6.36/1.16 thf(f71,axiom,(
% 6.36/1.16 (setadjoin__Cong = ! [X0 : $i,X1 : $i] : ((X0 = X1) => ! [X2 : $i,X3 : $i] : ((X2 = X3) => (((setadjoin @ X0 @ X2)) = ((setadjoin @ X1 @ X3))))))),
% 6.36/1.16 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoin__Cong)).
% 6.36/1.16 thf(f101,axiom,(
% 6.36/1.16 (binunion = (^[X0 : $i, X1 : $i] : ((setunion @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))))))),
% 6.36/1.16 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binunion)).
% 6.36/1.16 thf(f102,conjecture,(
% 6.36/1.16 setextAx => (emptysetAx => (setadjoinAx => (powersetAx => (setunionAx => (omega0Ax => (omegaSAx => (omegaIndAx => (replAx => (foundationAx => (wellorderingAx => (descrp => (dsetconstrI => (dsetconstrEL => (dsetconstrER => (exuE1 => (prop2setE => (emptysetE => (emptysetimpfalse => (notinemptyset => (exuE3e => (setext => (emptyI => (noeltsimpempty => (setbeta => (nonemptyE1 => (nonemptyI => (nonemptyI1 => (setadjoinIL => (emptyinunitempty => (setadjoinIR => (setadjoinE => (setadjoinOr => (setoftrueEq => (powersetI => (emptyinPowerset => (emptyInPowerset => (powersetE => (setunionI => (setunionE => (subPowSU => (exuE2 => (nonemptyImpWitness => (uniqinunit => (notinsingleton => (eqinunit => (singletonsswitch => (upairsetE => (upairsetIL => (upairsetIR => (emptyE1 => (vacuousDall => (quantDeMorgan1 => (quantDeMorgan2 => (quantDeMorgan3 => (quantDeMorgan4 => (prop2setI => (prop2set2propI => (notdexE => (notdallE => (exuI1 => (exuI3 => (exuI2 => (inCongP => (in__Cong => (exuE3u => (exu__Cong => (emptyset__Cong => (setadjoin__Cong => (powerset__Cong => (setunion__Cong => (omega__Cong => (exuEu => (descr__Cong => (dsetconstr__Cong => (subsetI1 => (eqimpsubset2 => (eqimpsubset1 => (subsetI2 => (emptysetsubset => (subsetE => (subsetE2 => (notsubsetI => (notequalI1 => (notequalI2 => (subsetRefl => (subsetTrans => (setadjoinSub => (setadjoinSub2 => (subset2powerset => (setextsub => (subsetemptysetimpeq => (powersetI1 => (powersetE1 => (inPowerset => (powersetsubset => (sepInPowerset => (sepSubset => ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X2 @ X0) => (in @ X2 @ (binunion @ X0 @ X1))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),
% 6.36/1.16 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binunionIL)).
% 6.36/1.16 thf(f103,negated_conjecture,(
% 6.36/1.16 ~(setextAx => (emptysetAx => (setadjoinAx => (powersetAx => (setunionAx => (omega0Ax => (omegaSAx => (omegaIndAx => (replAx => (foundationAx => (wellorderingAx => (descrp => (dsetconstrI => (dsetconstrEL => (dsetconstrER => (exuE1 => (prop2setE => (emptysetE => (emptysetimpfalse => (notinemptyset => (exuE3e => (setext => (emptyI => (noeltsimpempty => (setbeta => (nonemptyE1 => (nonemptyI => (nonemptyI1 => (setadjoinIL => (emptyinunitempty => (setadjoinIR => (setadjoinE => (setadjoinOr => (setoftrueEq => (powersetI => (emptyinPowerset => (emptyInPowerset => (powersetE => (setunionI => (setunionE => (subPowSU => (exuE2 => (nonemptyImpWitness => (uniqinunit => (notinsingleton => (eqinunit => (singletonsswitch => (upairsetE => (upairsetIL => (upairsetIR => (emptyE1 => (vacuousDall => (quantDeMorgan1 => (quantDeMorgan2 => (quantDeMorgan3 => (quantDeMorgan4 => (prop2setI => (prop2set2propI => (notdexE => (notdallE => (exuI1 => (exuI3 => (exuI2 => (inCongP => (in__Cong => (exuE3u => (exu__Cong => (emptyset__Cong => (setadjoin__Cong => (powerset__Cong => (setunion__Cong => (omega__Cong => (exuEu => (descr__Cong => (dsetconstr__Cong => (subsetI1 => (eqimpsubset2 => (eqimpsubset1 => (subsetI2 => (emptysetsubset => (subsetE => (subsetE2 => (notsubsetI => (notequalI1 => (notequalI2 => (subsetRefl => (subsetTrans => (setadjoinSub => (setadjoinSub2 => (subset2powerset => (setextsub => (subsetemptysetimpeq => (powersetI1 => (powersetE1 => (inPowerset => (powersetsubset => (sepInPowerset => (sepSubset => ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X2 @ X0) => (in @ X2 @ (binunion @ X0 @ X1)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),
% 6.36/1.16 inference(negated_conjecture,[status(cth)],[f102])).
% 6.36/1.16 thf(f179,plain,(
% 6.36/1.16 (setunionI = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X1 @ X2) => ((in @ X2 @ X0) => (in @ X1 @ (setunion @ X0)))))),
% 6.36/1.16 inference(rectify,[],[f41])).
% 6.36/1.16 thf(f180,plain,(
% 6.36/1.16 (setunionI = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => ((in @ Y0 @ Y2) => (in @ Y1 @ (setunion @ Y2))))))))))))),
% 6.36/1.16 inference(fool_elimination,[],[f179])).
% 6.36/1.16 thf(f199,plain,(
% 6.36/1.16 (upairsetIL = ! [X0 : $i,X1 : $i] : (in @ X0 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))))),
% 6.36/1.16 inference(rectify,[],[f51])).
% 6.36/1.16 thf(f200,plain,(
% 6.36/1.16 (upairsetIL = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset)))))))))),
% 6.36/1.16 inference(fool_elimination,[],[f199])).
% 6.36/1.16 thf(f238,plain,(
% 6.36/1.16 (setadjoin__Cong = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y3 = Y2) => ((setadjoin @ Y1 @ Y3) = (setadjoin @ Y0 @ Y2))))))))))))))),
% 6.36/1.16 inference(fool_elimination,[],[f71])).
% 6.36/1.16 thf(f294,plain,(
% 6.36/1.16 (binunion = (^[Y0 : $i]: ((^[Y1 : $i]: (setunion @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)))))))),
% 6.36/1.16 inference(fool_elimination,[],[f101])).
% 6.36/1.16 thf(f295,plain,(
% 6.36/1.16 ~(setextAx => (emptysetAx => (setadjoinAx => (powersetAx => (setunionAx => (omega0Ax => (omegaSAx => (omegaIndAx => (replAx => (foundationAx => (wellorderingAx => (descrp => (dsetconstrI => (dsetconstrEL => (dsetconstrER => (exuE1 => (prop2setE => (emptysetE => (emptysetimpfalse => (notinemptyset => (exuE3e => (setext => (emptyI => (noeltsimpempty => (setbeta => (nonemptyE1 => (nonemptyI => (nonemptyI1 => (setadjoinIL => (emptyinunitempty => (setadjoinIR => (setadjoinE => (setadjoinOr => (setoftrueEq => (powersetI => (emptyinPowerset => (emptyInPowerset => (powersetE => (setunionI => (setunionE => (subPowSU => (exuE2 => (nonemptyImpWitness => (uniqinunit => (notinsingleton => (eqinunit => (singletonsswitch => (upairsetE => (upairsetIL => (upairsetIR => (emptyE1 => (vacuousDall => (quantDeMorgan1 => (quantDeMorgan2 => (quantDeMorgan3 => (quantDeMorgan4 => (prop2setI => (prop2set2propI => (notdexE => (notdallE => (exuI1 => (exuI3 => (exuI2 => (inCongP => (in__Cong => (exuE3u => (exu__Cong => (emptyset__Cong => (setadjoin__Cong => (powerset__Cong => (setunion__Cong => (omega__Cong => (exuEu => (descr__Cong => (dsetconstr__Cong => (subsetI1 => (eqimpsubset2 => (eqimpsubset1 => (subsetI2 => (emptysetsubset => (subsetE => (subsetE2 => (notsubsetI => (notequalI1 => (notequalI2 => (subsetRefl => (subsetTrans => (setadjoinSub => (setadjoinSub2 => (subset2powerset => (setextsub => (subsetemptysetimpeq => (powersetI1 => (powersetE1 => (inPowerset => (powersetsubset => (sepInPowerset => (sepSubset => ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X2 @ X0) => (in @ X2 @ (binunion @ X0 @ X1)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),
% 6.36/1.16 inference(rectify,[],[f103])).
% 6.36/1.16 thf(f296,plain,(
% 6.36/1.16 ~((setextAx = $true) => ((emptysetAx = $true) => ((setadjoinAx = $true) => ((powersetAx = $true) => ((setunionAx = $true) => ((omega0Ax = $true) => ((omegaSAx = $true) => ((omegaIndAx = $true) => ((replAx = $true) => ((foundationAx = $true) => ((wellorderingAx = $true) => ((descrp = $true) => ((dsetconstrI = $true) => ((dsetconstrEL = $true) => ((dsetconstrER = $true) => ((exuE1 = $true) => ((prop2setE = $true) => ((emptysetE = $true) => ((emptysetimpfalse = $true) => ((notinemptyset = $true) => ((exuE3e = $true) => ((setext = $true) => ((emptyI = $true) => ((noeltsimpempty = $true) => ((setbeta = $true) => ((nonemptyE1 = $true) => ((nonemptyI = $true) => ((nonemptyI1 = $true) => ((setadjoinIL = $true) => ((emptyinunitempty = $true) => ((setadjoinIR = $true) => ((setadjoinE = $true) => ((setadjoinOr = $true) => ((setoftrueEq = $true) => ((powersetI = $true) => ((emptyinPowerset = $true) => ((emptyInPowerset = $true) => ((powersetE = $true) => ((setunionI = $true) => ((setunionE = $true) => ((subPowSU = $true) => ((exuE2 = $true) => ((nonemptyImpWitness = $true) => ((uniqinunit = $true) => ((notinsingleton = $true) => ((eqinunit = $true) => ((singletonsswitch = $true) => ((upairsetE = $true) => ((upairsetIL = $true) => ((upairsetIR = $true) => ((emptyE1 = $true) => ((vacuousDall = $true) => ((quantDeMorgan1 = $true) => ((quantDeMorgan2 = $true) => ((quantDeMorgan3 = $true) => ((quantDeMorgan4 = $true) => ((prop2setI = $true) => ((prop2set2propI = $true) => ((notdexE = $true) => ((notdallE = $true) => ((exuI1 = $true) => ((exuI3 = $true) => ((exuI2 = $true) => ((inCongP = $true) => ((in__Cong = $true) => ((exuE3u = $true) => ((exu__Cong = $true) => ((emptyset__Cong = $true) => ((setadjoin__Cong = $true) => ((powerset__Cong = $true) => ((setunion__Cong = $true) => ((omega__Cong = $true) => ((exuEu = $true) => ((descr__Cong = $true) => ((dsetconstr__Cong = $true) => ((subsetI1 = $true) => ((eqimpsubset2 = $true) => ((eqimpsubset1 = $true) => ((subsetI2 = $true) => ((emptysetsubset = $true) => ((subsetE = $true) => ((subsetE2 = $true) => ((notsubsetI = $true) => ((notequalI1 = $true) => ((notequalI2 = $true) => ((subsetRefl = $true) => ((subsetTrans = $true) => ((setadjoinSub = $true) => ((setadjoinSub2 = $true) => ((subset2powerset = $true) => ((setextsub = $true) => ((subsetemptysetimpeq = $true) => ((powersetI1 = $true) => ((powersetE1 = $true) => ((inPowerset = $true) => ((powersetsubset = $true) => ((sepInPowerset = $true) => ((sepSubset = $true) => ! [X0 : $i,X1 : $i,X2 : $i] : ((((in @ X2 @ X0)) = $true) => (((in @ X2 @ (binunion @ X0 @ X1))) = $true))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),
% 6.36/1.16 inference(fool_elimination,[],[f295])).
% 6.36/1.16 thf(f297,plain,(
% 6.36/1.16 (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((? [X0 : $i,X1 : $i,X2 : $i] : ((((in @ X2 @ (binunion @ X0 @ X1))) != $true) & (((in @ X2 @ X0)) = $true)) & (sepSubset = $true)) & (sepInPowerset = $true)) & (powersetsubset = $true)) & (inPowerset = $true)) & (powersetE1 = $true)) & (powersetI1 = $true)) & (subsetemptysetimpeq = $true)) & (setextsub = $true)) & (subset2powerset = $true)) & (setadjoinSub2 = $true)) & (setadjoinSub = $true)) & (subsetTrans = $true)) & (subsetRefl = $true)) & (notequalI2 = $true)) & (notequalI1 = $true)) & (notsubsetI = $true)) & (subsetE2 = $true)) & (subsetE = $true)) & (emptysetsubset = $true)) & (subsetI2 = $true)) & (eqimpsubset1 = $true)) & (eqimpsubset2 = $true)) & (subsetI1 = $true)) & (dsetconstr__Cong = $true)) & (descr__Cong = $true)) & (exuEu = $true)) & (omega__Cong = $true)) & (setunion__Cong = $true)) & (powerset__Cong = $true)) & (setadjoin__Cong = $true)) & (emptyset__Cong = $true)) & (exu__Cong = $true)) & (exuE3u = $true)) & (in__Cong = $true)) & (inCongP = $true)) & (exuI2 = $true)) & (exuI3 = $true)) & (exuI1 = $true)) & (notdallE = $true)) & (notdexE = $true)) & (prop2set2propI = $true)) & (prop2setI = $true)) & (quantDeMorgan4 = $true)) & (quantDeMorgan3 = $true)) & (quantDeMorgan2 = $true)) & (quantDeMorgan1 = $true)) & (vacuousDall = $true)) & (emptyE1 = $true)) & (upairsetIR = $true)) & (upairsetIL = $true)) & (upairsetE = $true)) & (singletonsswitch = $true)) & (eqinunit = $true)) & (notinsingleton = $true)) & (uniqinunit = $true)) & (nonemptyImpWitness = $true)) & (exuE2 = $true)) & (subPowSU = $true)) & (setunionE = $true)) & (setunionI = $true)) & (powersetE = $true)) & (emptyInPowerset = $true)) & (emptyinPowerset = $true)) & (powersetI = $true)) & (setoftrueEq = $true)) & (setadjoinOr = $true)) & (setadjoinE = $true)) & (setadjoinIR = $true)) & (emptyinunitempty = $true)) & (setadjoinIL = $true)) & (nonemptyI1 = $true)) & (nonemptyI = $true)) & (nonemptyE1 = $true)) & (setbeta = $true)) & (noeltsimpempty = $true)) & (emptyI = $true)) & (setext = $true)) & (exuE3e = $true)) & (notinemptyset = $true)) & (emptysetimpfalse = $true)) & (emptysetE = $true)) & (prop2setE = $true)) & (exuE1 = $true)) & (dsetconstrER = $true)) & (dsetconstrEL = $true)) & (dsetconstrI = $true)) & (descrp = $true)) & (wellorderingAx = $true)) & (foundationAx = $true)) & (replAx = $true)) & (omegaIndAx = $true)) & (omegaSAx = $true)) & (omega0Ax = $true)) & (setunionAx = $true)) & (powersetAx = $true)) & (setadjoinAx = $true)) & (emptysetAx = $true)) & (setextAx = $true)),
% 6.36/1.16 inference(ennf_transformation,[],[f296])).
% 6.36/1.16 thf(f298,plain,(
% 6.36/1.16 ? [X0 : $i,X1 : $i,X2 : $i] : ((((in @ X2 @ (binunion @ X0 @ X1))) != $true) & (((in @ X2 @ X0)) = $true)) & (sepSubset = $true) & (sepInPowerset = $true) & (powersetsubset = $true) & (inPowerset = $true) & (powersetE1 = $true) & (powersetI1 = $true) & (subsetemptysetimpeq = $true) & (setextsub = $true) & (subset2powerset = $true) & (setadjoinSub2 = $true) & (setadjoinSub = $true) & (subsetTrans = $true) & (subsetRefl = $true) & (notequalI2 = $true) & (notequalI1 = $true) & (notsubsetI = $true) & (subsetE2 = $true) & (subsetE = $true) & (emptysetsubset = $true) & (subsetI2 = $true) & (eqimpsubset1 = $true) & (eqimpsubset2 = $true) & (subsetI1 = $true) & (dsetconstr__Cong = $true) & (descr__Cong = $true) & (exuEu = $true) & (omega__Cong = $true) & (setunion__Cong = $true) & (powerset__Cong = $true) & (setadjoin__Cong = $true) & (emptyset__Cong = $true) & (exu__Cong = $true) & (exuE3u = $true) & (in__Cong = $true) & (inCongP = $true) & (exuI2 = $true) & (exuI3 = $true) & (exuI1 = $true) & (notdallE = $true) & (notdexE = $true) & (prop2set2propI = $true) & (prop2setI = $true) & (quantDeMorgan4 = $true) & (quantDeMorgan3 = $true) & (quantDeMorgan2 = $true) & (quantDeMorgan1 = $true) & (vacuousDall = $true) & (emptyE1 = $true) & (upairsetIR = $true) & (upairsetIL = $true) & (upairsetE = $true) & (singletonsswitch = $true) & (eqinunit = $true) & (notinsingleton = $true) & (uniqinunit = $true) & (nonemptyImpWitness = $true) & (exuE2 = $true) & (subPowSU = $true) & (setunionE = $true) & (setunionI = $true) & (powersetE = $true) & (emptyInPowerset = $true) & (emptyinPowerset = $true) & (powersetI = $true) & (setoftrueEq = $true) & (setadjoinOr = $true) & (setadjoinE = $true) & (setadjoinIR = $true) & (emptyinunitempty = $true) & (setadjoinIL = $true) & (nonemptyI1 = $true) & (nonemptyI = $true) & (nonemptyE1 = $true) & (setbeta = $true) & (noeltsimpempty = $true) & (emptyI = $true) & (setext = $true) & (exuE3e = $true) & (notinemptyset = $true) & (emptysetimpfalse = $true) & (emptysetE = $true) & (prop2setE = $true) & (exuE1 = $true) & (dsetconstrER = $true) & (dsetconstrEL = $true) & (dsetconstrI = $true) & (descrp = $true) & (wellorderingAx = $true) & (foundationAx = $true) & (replAx = $true) & (omegaIndAx = $true) & (omegaSAx = $true) & (omega0Ax = $true) & (setunionAx = $true) & (powersetAx = $true) & (setadjoinAx = $true) & (emptysetAx = $true) & (setextAx = $true)),
% 6.36/1.16 inference(flattening,[],[f297])).
% 6.36/1.16 thf(f299,plain,(
% 6.36/1.16 (($true != ((in @ sK2 @ (binunion @ sK0 @ sK1)))) & ($true = ((in @ sK2 @ sK0)))) & (sepSubset = $true) & (sepInPowerset = $true) & (powersetsubset = $true) & (inPowerset = $true) & (powersetE1 = $true) & (powersetI1 = $true) & (subsetemptysetimpeq = $true) & (setextsub = $true) & (subset2powerset = $true) & (setadjoinSub2 = $true) & (setadjoinSub = $true) & (subsetTrans = $true) & (subsetRefl = $true) & (notequalI2 = $true) & (notequalI1 = $true) & (notsubsetI = $true) & (subsetE2 = $true) & (subsetE = $true) & (emptysetsubset = $true) & (subsetI2 = $true) & (eqimpsubset1 = $true) & (eqimpsubset2 = $true) & (subsetI1 = $true) & (dsetconstr__Cong = $true) & (descr__Cong = $true) & (exuEu = $true) & (omega__Cong = $true) & (setunion__Cong = $true) & (powerset__Cong = $true) & (setadjoin__Cong = $true) & (emptyset__Cong = $true) & (exu__Cong = $true) & (exuE3u = $true) & (in__Cong = $true) & (inCongP = $true) & (exuI2 = $true) & (exuI3 = $true) & (exuI1 = $true) & (notdallE = $true) & (notdexE = $true) & (prop2set2propI = $true) & (prop2setI = $true) & (quantDeMorgan4 = $true) & (quantDeMorgan3 = $true) & (quantDeMorgan2 = $true) & (quantDeMorgan1 = $true) & (vacuousDall = $true) & (emptyE1 = $true) & (upairsetIR = $true) & (upairsetIL = $true) & (upairsetE = $true) & (singletonsswitch = $true) & (eqinunit = $true) & (notinsingleton = $true) & (uniqinunit = $true) & (nonemptyImpWitness = $true) & (exuE2 = $true) & (subPowSU = $true) & (setunionE = $true) & (setunionI = $true) & (powersetE = $true) & (emptyInPowerset = $true) & (emptyinPowerset = $true) & (powersetI = $true) & (setoftrueEq = $true) & (setadjoinOr = $true) & (setadjoinE = $true) & (setadjoinIR = $true) & (emptyinunitempty = $true) & (setadjoinIL = $true) & (nonemptyI1 = $true) & (nonemptyI = $true) & (nonemptyE1 = $true) & (setbeta = $true) & (noeltsimpempty = $true) & (emptyI = $true) & (setext = $true) & (exuE3e = $true) & (notinemptyset = $true) & (emptysetimpfalse = $true) & (emptysetE = $true) & (prop2setE = $true) & (exuE1 = $true) & (dsetconstrER = $true) & (dsetconstrEL = $true) & (dsetconstrI = $true) & (descrp = $true) & (wellorderingAx = $true) & (foundationAx = $true) & (replAx = $true) & (omegaIndAx = $true) & (omegaSAx = $true) & (omega0Ax = $true) & (setunionAx = $true) & (powersetAx = $true) & (setadjoinAx = $true) & (emptysetAx = $true) & (setextAx = $true)),
% 6.36/1.16 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f298])).
% 6.36/1.16 thf(f340,plain,(
% 6.36/1.16 (setunionI = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => ((in @ Y0 @ Y2) => (in @ Y1 @ (setunion @ Y2))))))))))))),
% 6.36/1.16 inference(cnf_transformation,[],[f180])).
% 6.36/1.16 thf(f350,plain,(
% 6.36/1.16 (upairsetIL = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset)))))))))),
% 6.36/1.16 inference(cnf_transformation,[],[f200])).
% 6.36/1.16 thf(f370,plain,(
% 6.36/1.16 (setadjoin__Cong = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y3 = Y2) => ((setadjoin @ Y1 @ Y3) = (setadjoin @ Y0 @ Y2))))))))))))))),
% 6.36/1.16 inference(cnf_transformation,[],[f238])).
% 6.36/1.16 thf(f400,plain,(
% 6.36/1.16 (binunion = (^[Y0 : $i]: ((^[Y1 : $i]: (setunion @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)))))))),
% 6.36/1.16 inference(cnf_transformation,[],[f294])).
% 6.36/1.16 thf(f439,plain,(
% 6.36/1.16 (setunionI = $true)),
% 6.36/1.16 inference(cnf_transformation,[],[f299])).
% 6.36/1.16 thf(f449,plain,(
% 6.36/1.16 (upairsetIL = $true)),
% 6.36/1.16 inference(cnf_transformation,[],[f299])).
% 6.36/1.16 thf(f469,plain,(
% 6.36/1.16 (setadjoin__Cong = $true)),
% 6.36/1.16 inference(cnf_transformation,[],[f299])).
% 6.36/1.16 thf(f499,plain,(
% 6.36/1.16 ($true = ((in @ sK2 @ sK0)))),
% 6.36/1.16 inference(cnf_transformation,[],[f299])).
% 6.36/1.16 thf(f500,plain,(
% 6.36/1.16 ($true != ((in @ sK2 @ (binunion @ sK0 @ sK1))))),
% 6.36/1.16 inference(cnf_transformation,[],[f299])).
% 6.36/1.16 thf(f502,definition,(
% 6.36/1.16 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 6.36/1.16 introduced(theory,[fool_exhaustiveness_axiom])).
% 6.36/1.16 thf(f541,plain,(
% 6.36/1.16 ($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => ((in @ Y0 @ Y2) => (in @ Y1 @ (setunion @ Y2))))))))))))),
% 6.36/1.16 inference(definition_unfolding,[],[f340,f439])).
% 6.36/1.16 thf(f551,plain,(
% 6.36/1.16 ($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset)))))))))),
% 6.36/1.16 inference(definition_unfolding,[],[f350,f449])).
% 6.36/1.16 thf(f571,plain,(
% 6.36/1.16 ($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y3 = Y2) => ((setadjoin @ Y1 @ Y3) = (setadjoin @ Y0 @ Y2))))))))))))))),
% 6.36/1.16 inference(definition_unfolding,[],[f370,f469])).
% 6.36/1.16 thf(f601,plain,(
% 6.36/1.16 ($true != ((in @ sK2 @ ((^[Y0 : $i]: ((^[Y1 : $i]: (setunion @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)))))) @ sK0 @ sK1))))),
% 6.36/1.16 inference(definition_unfolding,[],[f500,f400])).
% 6.36/1.16 thf(f602,plain,(
% 6.36/1.16 ($true != ((in @ sK2 @ (setunion @ (setadjoin @ sK0 @ (setadjoin @ sK1 @ emptyset))))))),
% 6.36/1.16 inference(beta-eta_normalization,[],[f601])).
% 6.36/1.16 thf(f855,plain,(
% 6.36/1.16 ( ! [X1 : $i] : (($true = (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y3 = Y2) => ((setadjoin @ Y1 @ Y3) = (setadjoin @ Y0 @ Y2))))))))))) @ X1)))) )),
% 6.36/1.16 inference(pi_proxy_clausification,[],[f571])).
% 6.36/1.16 thf(f856,plain,(
% 6.36/1.16 ( ! [X1 : $i] : (($true = ((!! @ $i @ (^[Y0 : $i]: ((Y0 = X1) => (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y2 = Y1) => ((setadjoin @ Y0 @ Y2) = (setadjoin @ X1 @ Y1))))))))))))) )),
% 6.36/1.16 inference(beta-eta_normalization,[],[f855])).
% 6.36/1.16 thf(f857,plain,(
% 6.36/1.16 ( ! [X2 : $i,X1 : $i] : (($true = (((^[Y0 : $i]: ((Y0 = X1) => (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y2 = Y1) => ((setadjoin @ Y0 @ Y2) = (setadjoin @ X1 @ Y1))))))))) @ X2)))) )),
% 6.36/1.16 inference(pi_proxy_clausification,[],[f856])).
% 6.36/1.16 thf(f858,plain,(
% 6.36/1.16 ( ! [X2 : $i,X1 : $i] : (($true = (((X2 = X1) => (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => ((setadjoin @ X2 @ Y1) = (setadjoin @ X1 @ Y0))))))))))) )),
% 6.36/1.16 inference(beta-eta_normalization,[],[f857])).
% 6.36/1.16 thf(f859,plain,(
% 6.36/1.16 ( ! [X2 : $i,X1 : $i] : (($false = ((X2 = X1))) | ($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => ((setadjoin @ X2 @ Y1) = (setadjoin @ X1 @ Y0)))))))))) )),
% 6.36/1.16 inference(imp_proxy_clausification,[],[f858])).
% 6.36/1.16 thf(f860,plain,(
% 6.36/1.16 ( ! [X2 : $i,X1 : $i] : ((X1 != X2) | ($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => ((setadjoin @ X2 @ Y1) = (setadjoin @ X1 @ Y0)))))))))) )),
% 6.36/1.16 inference(equality_proxy_clausification,[],[f859])).
% 6.36/1.16 thf(f861,plain,(
% 6.36/1.16 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((X1 != X2) | ($true = (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => ((setadjoin @ X2 @ Y1) = (setadjoin @ X1 @ Y0)))))) @ X3)))) )),
% 6.36/1.16 inference(pi_proxy_clausification,[],[f860])).
% 6.36/1.16 thf(f862,plain,(
% 6.36/1.16 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((X1 != X2) | ($true = ((!! @ $i @ (^[Y0 : $i]: ((Y0 = X3) => ((setadjoin @ X2 @ Y0) = (setadjoin @ X1 @ X3)))))))) )),
% 6.36/1.16 inference(beta-eta_normalization,[],[f861])).
% 6.36/1.16 thf(f863,plain,(
% 6.36/1.16 ( ! [X2 : $i,X3 : $i,X1 : $i,X4 : $i] : ((X1 != X2) | ($true = (((^[Y0 : $i]: ((Y0 = X3) => ((setadjoin @ X2 @ Y0) = (setadjoin @ X1 @ X3)))) @ X4)))) )),
% 6.36/1.16 inference(pi_proxy_clausification,[],[f862])).
% 6.36/1.16 thf(f864,plain,(
% 6.36/1.16 ( ! [X2 : $i,X3 : $i,X1 : $i,X4 : $i] : ((X1 != X2) | ($true = (((X4 = X3) => ((setadjoin @ X2 @ X4) = (setadjoin @ X1 @ X3)))))) )),
% 6.36/1.16 inference(beta-eta_normalization,[],[f863])).
% 6.36/1.16 thf(f865,plain,(
% 6.36/1.16 ( ! [X2 : $i,X3 : $i,X1 : $i,X4 : $i] : ((X1 != X2) | ($false = ((X4 = X3))) | ($true = (((setadjoin @ X2 @ X4) = (setadjoin @ X1 @ X3))))) )),
% 6.36/1.16 inference(imp_proxy_clausification,[],[f864])).
% 6.36/1.16 thf(f866,plain,(
% 6.36/1.16 ( ! [X2 : $i,X3 : $i,X1 : $i,X4 : $i] : ((X1 != X2) | (X3 != X4) | ($true = (((setadjoin @ X2 @ X4) = (setadjoin @ X1 @ X3))))) )),
% 6.36/1.16 inference(equality_proxy_clausification,[],[f865])).
% 6.36/1.16 thf(f867,plain,(
% 6.36/1.16 ( ! [X2 : $i,X3 : $i,X1 : $i,X4 : $i] : ((((setadjoin @ X1 @ X3)) = ((setadjoin @ X2 @ X4))) | (X3 != X4) | (X1 != X2)) )),
% 6.36/1.16 inference(equality_proxy_clausification,[],[f866])).
% 6.36/1.16 thf(f1249,plain,(
% 6.36/1.16 ( ! [X1 : $i] : (($true = (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset)))))) @ X1)))) )),
% 6.36/1.16 inference(pi_proxy_clausification,[],[f551])).
% 6.36/1.16 thf(f1250,plain,(
% 6.36/1.16 ( ! [X1 : $i] : (($true = ((!! @ $i @ (^[Y0 : $i]: (in @ Y0 @ (setadjoin @ Y0 @ (setadjoin @ X1 @ emptyset)))))))) )),
% 6.36/1.16 inference(beta-eta_normalization,[],[f1249])).
% 6.36/1.16 thf(f1251,plain,(
% 6.36/1.16 ( ! [X2 : $i,X1 : $i] : (($true = (((^[Y0 : $i]: (in @ Y0 @ (setadjoin @ Y0 @ (setadjoin @ X1 @ emptyset)))) @ X2)))) )),
% 6.36/1.16 inference(pi_proxy_clausification,[],[f1250])).
% 6.36/1.16 thf(f1252,plain,(
% 6.36/1.16 ( ! [X2 : $i,X1 : $i] : (($true = ((in @ X2 @ (setadjoin @ X2 @ (setadjoin @ X1 @ emptyset)))))) )),
% 6.36/1.16 inference(beta-eta_normalization,[],[f1251])).
% 6.36/1.16 thf(f1339,plain,(
% 6.36/1.16 ( ! [X1 : $i] : (($true = (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => ((in @ Y0 @ Y2) => (in @ Y1 @ (setunion @ Y2))))))))) @ X1)))) )),
% 6.36/1.16 inference(pi_proxy_clausification,[],[f541])).
% 6.36/1.16 thf(f1340,plain,(
% 6.36/1.16 ( ! [X1 : $i] : (($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ X1) => ((in @ X1 @ Y1) => (in @ Y0 @ (setunion @ Y1))))))))))) )),
% 6.36/1.16 inference(beta-eta_normalization,[],[f1339])).
% 6.36/1.16 thf(f1341,plain,(
% 6.36/1.16 ( ! [X2 : $i,X1 : $i] : (($true = (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ X1) => ((in @ X1 @ Y1) => (in @ Y0 @ (setunion @ Y1))))))) @ X2)))) )),
% 6.36/1.16 inference(pi_proxy_clausification,[],[f1340])).
% 6.36/1.16 thf(f1342,plain,(
% 6.36/1.16 ( ! [X2 : $i,X1 : $i] : (($true = ((!! @ $i @ (^[Y0 : $i]: ((in @ X2 @ X1) => ((in @ X1 @ Y0) => (in @ X2 @ (setunion @ Y0))))))))) )),
% 6.36/1.16 inference(beta-eta_normalization,[],[f1341])).
% 6.36/1.16 thf(f1343,plain,(
% 6.36/1.16 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (((^[Y0 : $i]: ((in @ X2 @ X1) => ((in @ X1 @ Y0) => (in @ X2 @ (setunion @ Y0))))) @ X3)))) )),
% 6.36/1.16 inference(pi_proxy_clausification,[],[f1342])).
% 6.36/1.16 thf(f1344,plain,(
% 6.36/1.16 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (((in @ X2 @ X1) => ((in @ X1 @ X3) => (in @ X2 @ (setunion @ X3))))))) )),
% 6.36/1.16 inference(beta-eta_normalization,[],[f1343])).
% 6.36/1.16 thf(f1345,plain,(
% 6.36/1.16 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((in @ X2 @ X1)) = $false) | ($true = (((in @ X1 @ X3) => (in @ X2 @ (setunion @ X3)))))) )),
% 6.36/1.16 inference(imp_proxy_clausification,[],[f1344])).
% 6.36/1.16 thf(f1346,plain,(
% 6.36/1.16 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((in @ X2 @ X1)) = $false) | (((in @ X1 @ X3)) = $false) | ($true = ((in @ X2 @ (setunion @ X3))))) )),
% 6.36/1.16 inference(imp_proxy_clausification,[],[f1345])).
% 6.36/1.16 thf(f1787,definition,(
% 6.36/1.16 spl74_1 <=> ! [X3 : $o] : (($false = X3) | ($true = X3))),
% 6.36/1.16 introduced(definition,[new_symbols(definition,[spl74_1])],[avatar_definition])).
% 6.36/1.16 thf(f1788,plain,(
% 6.36/1.16 ( ! [X3 : $o] : (($true = X3) | ($false = X3)) ) | ~spl74_1),
% 6.36/1.16 inference(avatar_component_clause,[],[f1787])).
% 6.36/1.16 thf(f1805,plain,(
% 6.36/1.16 spl74_1),
% 6.36/1.16 inference(avatar_split_clause,[],[f502,f1787])).
% 6.36/1.16 thf(f2509,plain,(
% 6.36/1.16 ($true != $true) | ($false = ((in @ sK2 @ (setunion @ (setadjoin @ sK0 @ (setadjoin @ sK1 @ emptyset)))))) | ~spl74_1),
% 6.36/1.16 inference(constrained_superposition,[],[f602,f1788])).
% 6.36/1.16 thf(f2510,plain,(
% 6.36/1.16 ($false = ((in @ sK2 @ (setunion @ (setadjoin @ sK0 @ (setadjoin @ sK1 @ emptyset)))))) | ~spl74_1),
% 6.36/1.16 inference(trivial_inequality_removal,[],[f2509])).
% 6.36/1.16 thf(f2516,plain,(
% 6.36/1.16 ( ! [X0 : $i,X1 : $i] : (($false = ((in @ sK2 @ (setunion @ (setadjoin @ sK0 @ (setadjoin @ X0 @ X1)))))) | (emptyset != X1) | (sK1 != X0)) ) | ~spl74_1),
% 6.36/1.16 inference(constrained_superposition,[],[f2510,f867])).
% 6.36/1.16 thf(f5354,plain,(
% 6.36/1.16 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($false = $true) | (emptyset != X1) | (sK1 != X0) | ($false = ((in @ sK2 @ X2))) | ($false = ((in @ X2 @ (setadjoin @ sK0 @ (setadjoin @ X0 @ X1)))))) ) | ~spl74_1),
% 6.36/1.16 inference(constrained_superposition,[],[f2516,f1346])).
% 6.36/1.16 thf(f5362,plain,(
% 6.36/1.16 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($false = ((in @ X2 @ (setadjoin @ sK0 @ (setadjoin @ X0 @ X1))))) | (sK1 != X0) | ($false = ((in @ sK2 @ X2))) | (emptyset != X1)) ) | ~spl74_1),
% 6.36/1.16 inference(trivial_inequality_removal,[],[f5354])).
% 6.36/1.16 thf(f5504,plain,(
% 6.36/1.16 ( ! [X0 : $i] : (($false = $true) | (sK1 != X0) | ($false = ((in @ sK2 @ sK0))) | (emptyset != emptyset)) ) | ~spl74_1),
% 6.36/1.16 inference(constrained_superposition,[],[f1252,f5362])).
% 6.36/1.16 thf(f5521,plain,(
% 6.36/1.16 ( ! [X0 : $i] : ((sK1 != X0) | ($false = ((in @ sK2 @ sK0)))) ) | ~spl74_1),
% 6.36/1.16 inference(trivial_inequality_removal,[],[f5504])).
% 6.36/1.16 thf(f5548,plain,(
% 6.36/1.16 ( ! [X0 : $i] : (($false = $true) | (sK1 != X0)) ) | ~spl74_1),
% 6.36/1.16 inference(forward_demodulation,[],[f5521,f499])).
% 6.36/1.16 thf(f5549,plain,(
% 6.36/1.16 ( ! [X0 : $i] : ((sK1 != X0)) ) | ~spl74_1),
% 6.36/1.16 inference(trivial_inequality_removal,[],[f5548])).
% 6.36/1.16 thf(f5560,plain,(
% 6.36/1.16 $false | ~spl74_1),
% 6.36/1.16 inference(equality_resolution,[],[f5549])).
% 6.36/1.16 thf(f5561,plain,(
% 6.36/1.16 ~spl74_1),
% 6.36/1.16 inference(avatar_contradiction_clause,[],[f5560])).
% 6.36/1.16 cnf(s5, plain, spl74_1, inference(sat_conversion,[],[f1805])).
% 6.36/1.16 cnf(s16, plain, ~spl74_1, inference(sat_conversion,[],[f5561])).
% 6.36/1.16 cnf(s17, plain, $false, inference(rat,[],[s5,s16])).
% 6.36/1.16 thf(f5562,plain,(
% 6.36/1.16 $false),
% 6.36/1.16 inference(avatar_sat_refutation,[],[s17])).
% 6.36/1.16 % SZS output end Proof for theBenchmark
% 6.36/1.16 % (2151017)------------------------------
% 6.36/1.16 % (2151017)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.36/1.16 % (2151017)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.36/1.16 % (2151017)CaDiCaL version: 2.1.3
% 6.36/1.16 % (2151017)Termination reason: Refutation
% 6.36/1.16 % (2151017)Time elapsed: 0.350 s
% 6.36/1.16 % (2151017)Peak memory usage: 16 MB
% 6.36/1.16 % (2151017)Instructions burned: 736 (million)
% 6.36/1.16 % (2150964)Success in time 0.936 s
% 6.36/1.16 % Vampire exiting
%------------------------------------------------------------------------------