%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU674^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:30:40 AM UTC 2026
% Result : Theorem 9.54s 1.98s
% Output : Refutation 9.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU674^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.16 % Computer : n007.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Tue Sep 29 14:05:11 UTC 2026
% 0.10/0.16 % CPUTime :
% 0.10/0.16 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.19 Running higher-order theorem proving
% 0.10/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.37 % (3420418)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.37 % (3420424)lrs+10_16_si=on:nwc=1.5:random_seed=392837483:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.37 % (3420423)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1137283893:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.37 % (3420428)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2195311238:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.37 % (3420425)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3763828644:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.37 % (3420424)Instruction limit reached!
% 0.21/0.37 % (3420424)------------------------------
% 0.21/0.37 % (3420424)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.37 % (3420424)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.37 % (3420424)CaDiCaL version: 2.1.3
% 0.21/0.37 % (3420424)Termination reason: Instruction limit
% 0.21/0.37 % (3420424)Termination phase: shuffling
% 0.21/0.37 % (3420424)Time elapsed: 0.013 s
% 0.21/0.37 % (3420424)Peak memory usage: 10 MB
% 0.21/0.37 % (3420424)Instructions burned: 22 (million)
% 0.21/0.37 % (3420425)Instruction limit reached!
% 0.21/0.37 % (3420425)------------------------------
% 0.21/0.37 % (3420425)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.37 % (3420425)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.37 % (3420425)CaDiCaL version: 2.1.3
% 0.21/0.37 % (3420425)Termination reason: Instruction limit
% 0.21/0.37 % (3420425)Termination phase: shuffling
% 0.21/0.37 % (3420425)Time elapsed: 0.003 s
% 0.21/0.37 % (3420425)Peak memory usage: 10 MB
% 0.21/0.37 % (3420425)Instructions burned: 3 (million)
% 0.21/0.37 % (3420429)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.37 % (3420429)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.21/0.37 % (3420426)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=2179650806:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.21/0.37 % (3420427)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3927701873:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.37 % (3420429)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=2953912535:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.37 % (3420436)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=2292506273:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.21/0.37 % (3420436)Instruction limit reached!
% 0.21/0.37 % (3420436)------------------------------
% 0.21/0.37 % (3420436)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.37 % (3420436)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.37 % (3420436)CaDiCaL version: 2.1.3
% 0.21/0.37 % (3420436)Termination reason: Instruction limit
% 0.21/0.37 % (3420436)Termination phase: shuffling
% 0.21/0.37 % (3420436)Time elapsed: 0.001 s
% 0.21/0.37 % (3420436)Peak memory usage: 10 MB
% 0.21/0.37 % (3420436)Instructions burned: 6 (million)
% 0.21/0.37 % (3420434)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=3759570323:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.21/0.37 % (3420434)Instruction limit reached!
% 0.21/0.37 % (3420434)------------------------------
% 0.21/0.37 % (3420434)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.37 % (3420434)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.37 % (3420434)CaDiCaL version: 2.1.3
% 0.21/0.37 % (3420434)Termination reason: Instruction limit
% 0.21/0.37 % (3420434)Termination phase: shuffling
% 0.21/0.37 % (3420434)Time elapsed: 0.002 s
% 0.21/0.37 % (3420434)Peak memory usage: 10 MB
% 0.21/0.37 % (3420434)Instructions burned: 4 (million)
% 0.98/0.42 % (3420440)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.98/0.42 % (3420427)Instruction limit reached!
% 0.98/0.42 % (3420427)------------------------------
% 0.98/0.42 % (3420427)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.42 % (3420427)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.42 % (3420427)CaDiCaL version: 2.1.3
% 0.98/0.42 % (3420427)Termination reason: Instruction limit
% 0.98/0.42 % (3420427)Termination phase: Property scanning
% 0.98/0.42 % (3420427)Time elapsed: 0.021 s
% 0.98/0.42 % (3420427)Peak memory usage: 10 MB
% 0.98/0.42 % (3420427)Instructions burned: 25 (million)
% 0.98/0.42 % (3420440)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=3386703008:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.98/0.42 % (3420440)Instruction limit reached!
% 0.98/0.42 % (3420440)------------------------------
% 0.98/0.42 % (3420440)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.42 % (3420440)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.42 % (3420440)CaDiCaL version: 2.1.3
% 0.98/0.42 % (3420440)Termination reason: Instruction limit
% 0.98/0.42 % (3420440)Termination phase: shuffling
% 0.98/0.42 % (3420440)Time elapsed: 0.002 s
% 0.98/0.42 % (3420440)Peak memory usage: 10 MB
% 0.98/0.42 % (3420440)Instructions burned: 9 (million)
% 0.98/0.42 % (3420423)Instruction limit reached!
% 0.98/0.42 % (3420423)------------------------------
% 0.98/0.42 % (3420423)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.42 % (3420423)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.42 % (3420423)CaDiCaL version: 2.1.3
% 0.98/0.42 % (3420423)Termination reason: Instruction limit
% 0.98/0.42 % (3420423)Termination phase: Function definition elimination
% 0.98/0.42 % (3420423)Time elapsed: 0.041 s
% 0.98/0.42 % (3420423)Peak memory usage: 12 MB
% 0.98/0.42 % (3420423)Instructions burned: 88 (million)
% 0.98/0.42 % (3420428)Instruction limit reached!
% 0.98/0.42 % (3420428)------------------------------
% 0.98/0.42 % (3420428)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.42 % (3420428)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.42 % (3420428)CaDiCaL version: 2.1.3
% 0.98/0.42 % (3420428)Termination reason: Instruction limit
% 0.98/0.42 % (3420428)Termination phase: Property scanning
% 0.98/0.42 % (3420428)Time elapsed: 0.039 s
% 0.98/0.42 % (3420428)Peak memory usage: 12 MB
% 0.98/0.42 % (3420428)Instructions burned: 76 (million)
% 0.98/0.42 % (3420445)lrs+1002_64_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:sp=occurrence:lma=off:plsqr=32,1:uwa=interpreted_only:random_seed=3388394904:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.98/0.42 % (3420442)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=2275621366:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.98/0.42 % (3420444)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.98/0.42 % (3420444)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.98/0.42 % (3420442)Instruction limit reached!
% 0.98/0.42 % (3420442)------------------------------
% 0.98/0.42 % (3420442)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.42 % (3420442)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.42 % (3420442)CaDiCaL version: 2.1.3
% 0.98/0.42 % (3420442)Termination reason: Instruction limit
% 0.98/0.42 % (3420442)Termination phase: shuffling
% 0.98/0.42 % (3420442)Time elapsed: 0.006 s
% 0.98/0.42 % (3420442)Peak memory usage: 10 MB
% 0.98/0.42 % (3420442)Instructions burned: 13 (million)
% 0.98/0.42 % (3420446)lrs+10_1_si=on:cs=on:random_seed=1270355973:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.98/0.42 % (3420444)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=3895698023:i=28:s2at=5:piset=not:hud=10:bd=all:av=off:rtra=on:ixr=off:fsdmm=1_2999 on theBenchmark for (2999ds/28Mi)
% 0.98/0.46 % (3420446)Instruction limit reached!
% 0.98/0.46 % (3420446)------------------------------
% 0.98/0.46 % (3420446)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.46 % (3420446)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.46 % (3420446)CaDiCaL version: 2.1.3
% 0.98/0.46 % (3420446)Termination reason: Instruction limit
% 0.98/0.46 % (3420446)Termination phase: shuffling
% 0.98/0.46 % (3420446)Time elapsed: 0.004 s
% 0.98/0.46 % (3420446)Peak memory usage: 10 MB
% 0.98/0.46 % (3420446)Instructions burned: 8 (million)
% 0.98/0.46 % (3420445)Instruction limit reached!
% 0.98/0.46 % (3420445)------------------------------
% 0.98/0.46 % (3420445)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.46 % (3420445)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.46 % (3420445)CaDiCaL version: 2.1.3
% 0.98/0.46 % (3420445)Termination reason: Instruction limit
% 0.98/0.46 % (3420445)Termination phase: Property scanning
% 0.98/0.46 % (3420445)Time elapsed: 0.019 s
% 0.98/0.46 % (3420445)Peak memory usage: 11 MB
% 0.98/0.46 % (3420445)Instructions burned: 88 (million)
% 0.98/0.46 % (3420447)WARNING Broken Constraint: if positive_literal_split_queue_ratios(1,32) has been set then positive_literal_split_queue(off) is equal to on
% 0.98/0.46 % (3420444)Instruction limit reached!
% 0.98/0.46 % (3420444)------------------------------
% 0.98/0.46 % (3420444)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.46 % (3420444)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.46 % (3420444)CaDiCaL version: 2.1.3
% 0.98/0.46 % (3420444)Termination reason: Instruction limit
% 0.98/0.46 % (3420444)Termination phase: Property scanning
% 0.98/0.46 % (3420444)Time elapsed: 0.013 s
% 0.98/0.46 % (3420444)Peak memory usage: 10 MB
% 0.98/0.46 % (3420444)Instructions burned: 29 (million)
% 0.98/0.46 % (3420447)ott+1002_20_sil=128000:cnfonf=lazy_not_gen_be_off:si=on:sp=unary_frequency:plsqr=1,32:bce=on:uwa=interpreted_only:foolp=on:random_seed=3315581958:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.98/0.46 % (3420447)Instruction limit reached!
% 0.98/0.46 % (3420447)------------------------------
% 0.98/0.46 % (3420447)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.46 % (3420447)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.46 % (3420447)CaDiCaL version: 2.1.3
% 0.98/0.46 % (3420447)Termination reason: Instruction limit
% 0.98/0.46 % (3420447)Termination phase: shuffling
% 0.98/0.46 % (3420447)Time elapsed: 0.003 s
% 0.98/0.46 % (3420447)Peak memory usage: 10 MB
% 0.98/0.46 % (3420447)Instructions burned: 2 (million)
% 0.98/0.46 % (3420454)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=1807366809:hsq=on:st=2:i=25:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/25Mi)
% 0.98/0.46 % (3420453)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=3509462983:st=2:i=249:sd=1:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/249Mi)
% 0.98/0.46 % (3420454)Instruction limit reached!
% 0.98/0.46 % (3420454)------------------------------
% 0.98/0.46 % (3420454)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.46 % (3420454)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.46 % (3420454)CaDiCaL version: 2.1.3
% 0.98/0.46 % (3420454)Termination reason: Instruction limit
% 0.98/0.46 % (3420454)Termination phase: SInE selection
% 0.98/0.46 % (3420454)Time elapsed: 0.007 s
% 0.98/0.46 % (3420454)Peak memory usage: 11 MB
% 0.98/0.46 % (3420454)Instructions burned: 29 (million)
% 0.98/0.46 % (3420455)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=3401282176:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2998 on theBenchmark for (2998ds/14Mi)
% 0.98/0.46 % (3420460)dis+10_1_anc=all_dependent:to=kbo:sil=128000:si=on:chr=on:random_seed=1766836712:uwa_fpi=on:i=14:aac=none:rtra=on:fe=abstraction_2998 on theBenchmark for (2998ds/14Mi)
% 0.98/0.46 % (3420455)Instruction limit reached!
% 0.98/0.46 % (3420455)------------------------------
% 0.98/0.46 % (3420455)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.46 % (3420455)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.46 % (3420455)CaDiCaL version: 2.1.3
% 0.98/0.46 % (3420455)Termination reason: Instruction limit
% 0.98/0.46 % (3420455)Termination phase: shuffling
% 1.61/0.53 % (3420455)Time elapsed: 0.007 s
% 1.61/0.53 % (3420455)Peak memory usage: 10 MB
% 1.61/0.53 % (3420455)Instructions burned: 14 (million)
% 1.61/0.53 % (3420451)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=3324302227:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/38Mi)
% 1.61/0.53 % (3420460)Instruction limit reached!
% 1.61/0.53 % (3420460)------------------------------
% 1.61/0.53 % (3420460)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.61/0.53 % (3420460)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.61/0.53 % (3420460)CaDiCaL version: 2.1.3
% 1.61/0.53 % (3420460)Termination reason: Instruction limit
% 1.61/0.53 % (3420460)Termination phase: shuffling
% 1.61/0.53 % (3420460)Time elapsed: 0.004 s
% 1.61/0.53 % (3420460)Peak memory usage: 10 MB
% 1.61/0.53 % (3420460)Instructions burned: 15 (million)
% 1.61/0.53 % (3420465)ott+1004_1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:sp=unary_frequency:cbe=off:uwa=off:nwc=1:random_seed=3238768753:i=26:ep=R:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/26Mi)
% 1.61/0.53 % (3420465)Instruction limit reached!
% 1.61/0.53 % (3420465)------------------------------
% 1.61/0.53 % (3420465)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.61/0.53 % (3420465)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.61/0.53 % (3420465)CaDiCaL version: 2.1.3
% 1.61/0.53 % (3420465)Termination reason: Instruction limit
% 1.61/0.53 % (3420465)Termination phase: Property scanning
% 1.61/0.53 % (3420465)Time elapsed: 0.007 s
% 1.61/0.53 % (3420465)Peak memory usage: 10 MB
% 1.61/0.53 % (3420465)Instructions burned: 30 (million)
% 1.61/0.53 % (3420458)dis+1010_1_sil=128000:si=on:uwa=off:random_seed=4012945710:st=3:s2a=on:i=327:sd=3:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/327Mi)
% 1.61/0.53 % (3420451)Instruction limit reached!
% 1.61/0.53 % (3420451)------------------------------
% 1.61/0.53 % (3420451)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.61/0.53 % (3420451)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.61/0.53 % (3420451)CaDiCaL version: 2.1.3
% 1.61/0.53 % (3420451)Termination reason: Instruction limit
% 1.61/0.53 % (3420451)Termination phase: Preprocessing 3
% 1.61/0.53 % (3420451)Time elapsed: 0.036 s
% 1.61/0.53 % (3420451)Peak memory usage: 11 MB
% 1.61/0.53 % (3420451)Instructions burned: 39 (million)
% 1.61/0.53 % (3420467)dis+1002_16_sil=128000:si=on:sp=occurrence:random_seed=3909516303:cond=fast:i=23:hud=1:av=off:rtra=on:fe=abstraction:ntd=on_2998 on theBenchmark for (2998ds/23Mi)
% 1.61/0.53 % (3420464)ott+21_20_to=lpo:sil=128000:tgt=ground:si=on:sp=arity:lma=off:uwa=off:foolp=on:random_seed=2306188414:st=4:i=2:add=off:sd=3:nm=16:fsr=off:rtra=on:ss=axioms:sgt=8:ntd=on_2998 on theBenchmark for (2998ds/2Mi)
% 1.61/0.53 % (3420429)Instruction limit reached!
% 1.61/0.53 % (3420429)------------------------------
% 1.61/0.53 % (3420429)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.61/0.53 % (3420429)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.61/0.53 % (3420429)CaDiCaL version: 2.1.3
% 1.61/0.53 % (3420429)Termination reason: Instruction limit
% 1.61/0.53 % (3420429)Termination phase: Saturation
% 1.61/0.53 % (3420429)Time elapsed: 0.123 s
% 1.61/0.53 % (3420429)Peak memory usage: 13 MB
% 1.61/0.53 % (3420429)Instructions burned: 158 (million)
% 1.61/0.53 % (3420464)Instruction limit reached!
% 1.61/0.53 % (3420464)------------------------------
% 1.61/0.53 % (3420464)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.61/0.53 % (3420464)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.61/0.53 % (3420464)CaDiCaL version: 2.1.3
% 1.61/0.53 % (3420464)Termination reason: Instruction limit
% 1.61/0.53 % (3420464)Termination phase: shuffling
% 1.61/0.53 % (3420464)Time elapsed: 0.002 s
% 1.61/0.53 % (3420464)Peak memory usage: 10 MB
% 1.61/0.53 % (3420464)Instructions burned: 3 (million)
% 1.61/0.53 % (3420467)Instruction limit reached!
% 1.61/0.53 % (3420467)------------------------------
% 1.61/0.53 % (3420467)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.61/0.53 % (3420467)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.61/0.53 % (3420467)CaDiCaL version: 2.1.3
% 1.61/0.53 % (3420467)Termination reason: Instruction limit
% 1.61/0.53 % (3420467)Termination phase: Property scanning
% 1.61/0.53 % (3420467)Time elapsed: 0.011 s
% 2.32/0.59 % (3420467)Peak memory usage: 11 MB
% 2.32/0.59 % (3420467)Instructions burned: 24 (million)
% 2.32/0.59 % (3420472)WARNING Broken Constraint: if sine_to_age_generality_threshold(10) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 2.32/0.59 % (3420472)WARNING Broken Constraint: if lrs_weight_limit_only(on) has been set then saturation_algorithm(otter) is equal to lrs
% 2.32/0.59 % (3420473)WARNING Broken Constraint: if choice_reasoning(on) has been set then choice_ax(on) is equal to off
% 2.32/0.59 % (3420472)ott+21_1_to=kbo:sil=128000:cnfonf=lazy_gen:bsd=on:si=on:sp=const_frequency:lma=off:uwa=off:foolp=on:s2agt=10:lwlo=on:random_seed=4101073907:i=14:add=off:nm=40:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 2.32/0.59 % (3420473)lrs+1010_4:1_slsqr=8,1:to=kbo:cha=on:drc=off:si=on:sp=arity:lcm=predicate:uwa=off:fd=preordered:gs=on:nwc=5:s2agt=32:slsqc=1:kmz=on:updr=off:chr=on:pe=on:slsq=on:random_seed=1045628280:i=8:nm=2:rtra=on:fe=abstraction:inj=on_2998 on theBenchmark for (2998ds/8Mi)
% 2.32/0.59 % (3420469)lrs+1002_1024_sil=128000:tgt=ground:fde=none:e2e=on:si=on:uwa=off:nwc=1:random_seed=4015223604:cond=on:i=60:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/60Mi)
% 2.32/0.59 % (3420473)Instruction limit reached!
% 2.32/0.59 % (3420473)------------------------------
% 2.32/0.59 % (3420473)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.32/0.59 % (3420473)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.32/0.59 % (3420473)CaDiCaL version: 2.1.3
% 2.32/0.59 % (3420473)Termination reason: Instruction limit
% 2.32/0.59 % (3420473)Termination phase: shuffling
% 2.32/0.59 % (3420473)Time elapsed: 0.004 s
% 2.32/0.59 % (3420473)Peak memory usage: 10 MB
% 2.32/0.59 % (3420473)Instructions burned: 8 (million)
% 2.32/0.59 % (3420472)Instruction limit reached!
% 2.32/0.59 % (3420472)------------------------------
% 2.32/0.59 % (3420472)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.32/0.59 % (3420472)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.32/0.59 % (3420472)CaDiCaL version: 2.1.3
% 2.32/0.59 % (3420472)Termination reason: Instruction limit
% 2.32/0.59 % (3420472)Termination phase: shuffling
% 2.32/0.59 % (3420472)Time elapsed: 0.008 s
% 2.32/0.59 % (3420472)Peak memory usage: 10 MB
% 2.32/0.59 % (3420472)Instructions burned: 16 (million)
% 2.32/0.59 % (3420474)dis+1004_50_to=lpo:drc=off:fde=unused:cnfonf=lazy_not_gen_be_off:si=on:sp=reverse_arity:spb=units:cbe=off:foolp=on:random_seed=4265455251:uwa_fpi=on:i=31:doe=on:bd=preordered:rtra=on:fsd=on_2998 on theBenchmark for (2998ds/31Mi)
% 2.32/0.59 % (3420469)Instruction limit reached!
% 2.32/0.59 % (3420469)------------------------------
% 2.32/0.59 % (3420469)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.32/0.59 % (3420469)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.32/0.59 % (3420469)CaDiCaL version: 2.1.3
% 2.32/0.59 % (3420469)Termination reason: Instruction limit
% 2.32/0.59 % (3420469)Termination phase: Property scanning
% 2.32/0.59 % (3420469)Time elapsed: 0.019 s
% 2.32/0.59 % (3420469)Peak memory usage: 12 MB
% 2.32/0.59 % (3420469)Instructions burned: 64 (million)
% 2.32/0.59 % (3420478)dis+10_1024_sil=128000:cnfonf=off:si=on:fd=off:random_seed=3591921346:i=7:hud=5:bd=preordered:rtra=on:bet=on_2997 on theBenchmark for (2997ds/7Mi)
% 2.32/0.59 % (3420474)Instruction limit reached!
% 2.32/0.59 % (3420474)------------------------------
% 2.32/0.59 % (3420474)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.32/0.59 % (3420474)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.32/0.59 % (3420474)CaDiCaL version: 2.1.3
% 2.32/0.59 % (3420474)Termination reason: Instruction limit
% 2.32/0.59 % (3420474)Termination phase: Property scanning
% 2.32/0.59 % (3420474)Time elapsed: 0.017 s
% 2.32/0.59 % (3420474)Peak memory usage: 10 MB
% 2.32/0.59 % (3420474)Instructions burned: 31 (million)
% 2.32/0.59 % (3420480)lrs+10_1_plsq=on:drc=ordering:cnfonf=lazy_not_gen_be_off:bsd=on:si=on:plsqr=32,1:cs=on:random_seed=2644546387:i=23:rtra=on:ntd=on_2997 on theBenchmark for (2997ds/23Mi)
% 2.32/0.59 % (3420478)Instruction limit reached!
% 2.32/0.59 % (3420478)------------------------------
% 2.32/0.59 % (3420478)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.32/0.59 % (3420478)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.60/0.68 % (3420478)CaDiCaL version: 2.1.3
% 2.60/0.68 % (3420478)Termination reason: Instruction limit
% 2.60/0.68 % (3420478)Termination phase: shuffling
% 2.60/0.68 % (3420478)Time elapsed: 0.004 s
% 2.60/0.68 % (3420478)Peak memory usage: 10 MB
% 2.60/0.68 % (3420478)Instructions burned: 7 (million)
% 2.60/0.68 % (3420481)lrs+10_1_sil=128000:fde=unused:si=on:random_seed=2458036801:s2a=on:i=20:kws=inv_frequency:bd=all:rtra=on_2997 on theBenchmark for (2997ds/20Mi)
% 2.60/0.68 % (3420481)Instruction limit reached!
% 2.60/0.68 % (3420481)------------------------------
% 2.60/0.68 % (3420481)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.60/0.68 % (3420481)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.60/0.68 % (3420481)CaDiCaL version: 2.1.3
% 2.60/0.68 % (3420481)Termination reason: Instruction limit
% 2.60/0.68 % (3420481)Termination phase: Property scanning
% 2.60/0.68 % (3420481)Time elapsed: 0.006 s
% 2.60/0.68 % (3420481)Peak memory usage: 11 MB
% 2.60/0.68 % (3420481)Instructions burned: 25 (million)
% 2.60/0.68 % (3420453)Instruction limit reached!
% 2.60/0.68 % (3420453)------------------------------
% 2.60/0.68 % (3420453)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.60/0.68 % (3420453)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.60/0.68 % (3420453)CaDiCaL version: 2.1.3
% 2.60/0.68 % (3420453)Termination reason: Instruction limit
% 2.60/0.68 % (3420453)Termination phase: Saturation
% 2.60/0.68 % (3420453)Time elapsed: 0.122 s
% 2.60/0.68 % (3420453)Peak memory usage: 14 MB
% 2.60/0.68 % (3420453)Instructions burned: 249 (million)
% 2.60/0.68 % (3420485)ott+1002_32_tgt=ground:si=on:sp=const_max:acc=on:nwc=0.5:random_seed=3096022356:i=143:fgj=on:piset=pi_sigma:rtra=on:fe=abstraction_2997 on theBenchmark for (2997ds/143Mi)
% 2.60/0.68 % (3420487)lrs+1002_1_sil=128000:si=on:acc=on:uwa=off:random_seed=668433148:st=5:s2a=on:i=193:sd=1:rtra=on:ss=axioms_2997 on theBenchmark for (2997ds/193Mi)
% 2.60/0.68 % (3420480)Instruction limit reached!
% 2.60/0.68 % (3420480)------------------------------
% 2.60/0.68 % (3420480)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.60/0.68 % (3420480)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.60/0.68 % (3420480)CaDiCaL version: 2.1.3
% 2.60/0.68 % (3420480)Termination reason: Instruction limit
% 2.60/0.68 % (3420480)Termination phase: shuffling
% 2.60/0.68 % (3420480)Time elapsed: 0.024 s
% 2.60/0.68 % (3420480)Peak memory usage: 10 MB
% 2.60/0.68 % (3420480)Instructions burned: 23 (million)
% 2.60/0.68 % (3420483)dis+1010_2:1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:uwa=off:slsq=on:random_seed=1137911419:i=1240:rtra=on:ixr=off_2997 on theBenchmark for (2997ds/1240Mi)
% 2.60/0.68 % (3420488)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=579037576:i=42:hud=10:rtra=on_2997 on theBenchmark for (2997ds/42Mi)
% 2.60/0.68 % (3420491)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 2.60/0.68 % (3420491)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=4084296779:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2997 on theBenchmark for (2997ds/7Mi)
% 2.60/0.68 % (3420491)Instruction limit reached!
% 2.60/0.68 % (3420491)------------------------------
% 2.60/0.68 % (3420491)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.60/0.68 % (3420491)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.60/0.68 % (3420491)CaDiCaL version: 2.1.3
% 2.60/0.68 % (3420491)Termination reason: Instruction limit
% 2.60/0.68 % (3420491)Termination phase: shuffling
% 2.60/0.68 % (3420491)Time elapsed: 0.003 s
% 2.60/0.68 % (3420491)Peak memory usage: 10 MB
% 2.60/0.68 % (3420491)Instructions burned: 7 (million)
% 2.60/0.68 % (3420488)Instruction limit reached!
% 2.60/0.68 % (3420488)------------------------------
% 2.60/0.68 % (3420488)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.60/0.68 % (3420488)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.60/0.68 % (3420488)CaDiCaL version: 2.1.3
% 2.60/0.68 % (3420488)Termination reason: Instruction limit
% 2.60/0.68 % (3420488)Termination phase: Property scanning
% 2.60/0.68 % (3420488)Time elapsed: 0.019 s
% 2.60/0.68 % (3420488)Peak memory usage: 11 MB
% 2.60/0.68 % (3420488)Instructions burned: 45 (million)
% 2.60/0.68 % (3420495)lrs+10_1_to=lpo:sil=128000:si=on:sp=arity:urr=on:random_seed=1766082759:i=181:sd=2:bd=preordered:rtra=on:ss=axioms_2997 on theBenchmark for (2997ds/181Mi)
% 2.91/0.76 % (3420487)Instruction limit reached!
% 2.91/0.76 % (3420487)------------------------------
% 2.91/0.76 % (3420487)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.91/0.76 % (3420487)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/0.76 % (3420487)CaDiCaL version: 2.1.3
% 2.91/0.76 % (3420487)Termination reason: Instruction limit
% 2.91/0.76 % (3420487)Termination phase: Saturation
% 2.91/0.76 % (3420487)Time elapsed: 0.047 s
% 2.91/0.76 % (3420487)Peak memory usage: 14 MB
% 2.91/0.76 % (3420487)Instructions burned: 198 (million)
% 2.91/0.76 % (3420496)dis+10_8_sil=128000:plsq=on:plsqc=1:si=on:sp=unary_first:sos=on:lma=off:plsqr=64,1:uwa=interpreted_only:foolp=on:random_seed=1541541024:st=3:avsq=on:i=169:avsqr=8,1:sd=2:kws=precedence:bd=preordered:rtra=on:ss=axioms:ntd=on_2997 on theBenchmark for (2997ds/169Mi)
% 2.91/0.76 % (3420498)WARNING Broken Constraint: if sine_level_split_queue_cutoffs(5) has been set then sine_level_split_queue(off) is equal to on
% 2.91/0.76 % (3420498)lrs+1002_1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:sp=arity:cbe=off:uwa=all:slsqc=5:random_seed=3574708951:st=4:s2a=on:i=6:add=on:doe=on:hud=10:rtra=on:bet=on:ss=axioms_2996 on theBenchmark for (2996ds/6Mi)
% 2.91/0.76 % (3420485)Instruction limit reached!
% 2.91/0.76 % (3420485)------------------------------
% 2.91/0.76 % (3420485)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.91/0.76 % (3420485)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/0.76 % (3420485)CaDiCaL version: 2.1.3
% 2.91/0.76 % (3420485)Termination reason: Instruction limit
% 2.91/0.76 % (3420485)Termination phase: Saturation
% 2.91/0.76 % (3420485)Time elapsed: 0.062 s
% 2.91/0.76 % (3420485)Peak memory usage: 14 MB
% 2.91/0.76 % (3420485)Instructions burned: 146 (million)
% 2.91/0.76 % (3420498)Instruction limit reached!
% 2.91/0.76 % (3420498)------------------------------
% 2.91/0.76 % (3420498)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.91/0.76 % (3420498)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/0.76 % (3420498)CaDiCaL version: 2.1.3
% 2.91/0.76 % (3420498)Termination reason: Instruction limit
% 2.91/0.76 % (3420498)Termination phase: shuffling
% 2.91/0.76 % (3420498)Time elapsed: 0.004 s
% 2.91/0.76 % (3420498)Peak memory usage: 10 MB
% 2.91/0.76 % (3420498)Instructions burned: 16 (million)
% 2.91/0.76 % (3420502)dis+1010_1_to=lpo:sil=128000:cnfonf=lazy_pi_sigma_gen:sas=cadical:si=on:sos=all:uwa=off:sac=on:random_seed=65517179:i=19:add=on:rtra=on_2996 on theBenchmark for (2996ds/19Mi)
% 2.91/0.76 % (3420502)Instruction limit reached!
% 2.91/0.76 % (3420502)------------------------------
% 2.91/0.76 % (3420502)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.91/0.76 % (3420502)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/0.76 % (3420502)CaDiCaL version: 2.1.3
% 2.91/0.76 % (3420502)Termination reason: Instruction limit
% 2.91/0.76 % (3420502)Termination phase: shuffling
% 2.91/0.76 % (3420502)Time elapsed: 0.005 s
% 2.91/0.76 % (3420502)Peak memory usage: 10 MB
% 2.91/0.76 % (3420502)Instructions burned: 23 (million)
% 2.91/0.76 % (3420501)ott+2_5:4_anc=none:to=lpo:si=on:lma=off:cbe=off:uwa=ground:nwc=3:random_seed=2182982738:uwa_fpi=on:i=22:add=on:doe=on:ins=1:rtra=on_2996 on theBenchmark for (2996ds/22Mi)
% 2.91/0.76 % (3420501)Instruction limit reached!
% 2.91/0.76 % (3420501)------------------------------
% 2.91/0.76 % (3420501)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.91/0.76 % (3420501)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/0.76 % (3420501)CaDiCaL version: 2.1.3
% 2.91/0.76 % (3420501)Termination reason: Instruction limit
% 2.91/0.76 % (3420501)Termination phase: shuffling
% 2.91/0.76 % (3420501)Time elapsed: 0.010 s
% 2.91/0.76 % (3420501)Peak memory usage: 10 MB
% 2.91/0.76 % (3420501)Instructions burned: 22 (million)
% 2.91/0.76 % (3420505)ott+10_1_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:lma=off:plsqr=128,1:urr=ec_only:uwa=off:rp=on:nwc=20:br=off:random_seed=2441054622:i=316:bs=unit_only:ins=25:rtra=on:ntd=on_2996 on theBenchmark for (2996ds/316Mi)
% 2.91/0.76 % (3420507)dis+1004_4:1_slsqr=1,2:to=lpo:plsq=on:fde=unused:e2e=on:si=on:spb=goal_then_units:acc=on:urr=on:uwa=off:fd=preordered:s2agt=16:slsqc=1:slsq=on:random_seed=1909968224:hsq=on:hsqr=16,1:s2a=on:i=853:add=off:bd=all:nm=64:rtra=on:gtg=position:c=on:ntd=on_2996 on theBenchmark for (2996ds/853Mi)
% 3.74/0.91 % (3420496)Instruction limit reached!
% 3.74/0.91 % (3420496)------------------------------
% 3.74/0.91 % (3420496)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.74/0.91 % (3420496)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/0.91 % (3420496)CaDiCaL version: 2.1.3
% 3.74/0.91 % (3420496)Termination reason: Instruction limit
% 3.74/0.91 % (3420496)Termination phase: Saturation
% 3.74/0.91 % (3420496)Time elapsed: 0.074 s
% 3.74/0.91 % (3420496)Peak memory usage: 14 MB
% 3.74/0.91 % (3420496)Instructions burned: 170 (million)
% 3.74/0.91 % (3420509)dis+1003_3:4_to=kbo:plsq=on:prc=on:sims=off:e2e=on:si=on:spb=intro:acc=on:urr=on:uwa=off:foolp=on:s2agt=32:slsqc=3:slsq=on:random_seed=1999589060:hsq=on:hsqr=16,1:s2a=on:i=45:erml=3:slsql=off:rtra=on:gtg=exists_top:er=filter:ntd=on_2996 on theBenchmark for (2996ds/45Mi)
% 3.74/0.91 % (3420495)Instruction limit reached!
% 3.74/0.91 % (3420495)------------------------------
% 3.74/0.91 % (3420495)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.74/0.91 % (3420495)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/0.91 % (3420495)CaDiCaL version: 2.1.3
% 3.74/0.91 % (3420495)Termination reason: Instruction limit
% 3.74/0.91 % (3420495)Termination phase: Saturation
% 3.74/0.91 % (3420495)Time elapsed: 0.106 s
% 3.74/0.91 % (3420495)Peak memory usage: 14 MB
% 3.74/0.91 % (3420495)Instructions burned: 182 (million)
% 3.74/0.91 % (3420509)Instruction limit reached!
% 3.74/0.91 % (3420509)------------------------------
% 3.74/0.91 % (3420509)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.74/0.91 % (3420509)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/0.91 % (3420509)CaDiCaL version: 2.1.3
% 3.74/0.91 % (3420509)Termination reason: Instruction limit
% 3.74/0.91 % (3420509)Termination phase: Preprocessing 3
% 3.74/0.91 % (3420509)Time elapsed: 0.021 s
% 3.74/0.91 % (3420509)Peak memory usage: 11 MB
% 3.74/0.91 % (3420509)Instructions burned: 47 (million)
% 3.74/0.91 % (3420505)Instruction limit reached!
% 3.74/0.92 % (3420505)------------------------------
% 3.74/0.92 % (3420505)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.74/0.92 % (3420505)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/0.92 % (3420505)CaDiCaL version: 2.1.3
% 3.74/0.92 % (3420505)Termination reason: Instruction limit
% 3.74/0.92 % (3420505)Termination phase: Saturation
% 3.74/0.92 % (3420505)Time elapsed: 0.081 s
% 3.74/0.92 % (3420505)Peak memory usage: 16 MB
% 3.74/0.92 % (3420505)Instructions burned: 321 (million)
% 3.74/0.92 % (3420511)lrs+1002_1_sil=128000:fde=unused:e2e=on:si=on:sos=on:uwa=interpreted_only:random_seed=4140119309:i=480:rtra=on_2995 on theBenchmark for (2995ds/480Mi)
% 3.74/0.92 % (3420513)WARNING Broken Constraint: if sine_level_split_queue_cutoffs(2) has been set then sine_level_split_queue(off) is equal to on
% 3.74/0.92 % (3420513)ott+1002_3_si=on:sp=weighted_frequency:spb=goal:cbe=off:slsqc=2:random_seed=3323644558:cts=off:uwa_fpi=on:i=200:av=off:fsr=off:rtra=on:ntd=on_2995 on theBenchmark for (2995ds/200Mi)
% 3.74/0.92 % (3420512)dis+1010_40_sil=128000:si=on:uwa=off:nwc=1:sac=on:chr=on:avsqc=3:random_seed=2025715363:avsq=on:i=21:avsqr=8,1:kws=frequency:fgj=on:bd=all:rtra=on:fe=axiom:ntd=on_2995 on theBenchmark for (2995ds/21Mi)
% 3.74/0.92 % (3420458)Instruction limit reached!
% 3.74/0.92 % (3420458)------------------------------
% 3.74/0.92 % (3420458)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.74/0.92 % (3420458)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/0.92 % (3420458)CaDiCaL version: 2.1.3
% 3.74/0.92 % (3420458)Termination reason: Instruction limit
% 3.74/0.92 % (3420458)Termination phase: Saturation
% 3.74/0.92 % (3420458)Time elapsed: 0.284 s
% 3.74/0.92 % (3420458)Peak memory usage: 15 MB
% 3.74/0.92 % (3420458)Instructions burned: 327 (million)
% 3.74/0.92 % (3420512)Instruction limit reached!
% 3.74/0.92 % (3420512)------------------------------
% 3.74/0.92 % (3420512)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.74/0.92 % (3420512)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/0.92 % (3420512)CaDiCaL version: 2.1.3
% 3.74/0.92 % (3420512)Termination reason: Instruction limit
% 3.74/1.05 % (3420512)Termination phase: shuffling
% 3.74/1.05 % (3420512)Time elapsed: 0.010 s
% 3.74/1.05 % (3420512)Peak memory usage: 10 MB
% 3.74/1.05 % (3420512)Instructions burned: 21 (million)
% 3.74/1.05 % (3420426)Instruction limit reached!
% 3.74/1.05 % (3420426)------------------------------
% 3.74/1.05 % (3420426)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.74/1.05 % (3420426)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/1.05 % (3420426)CaDiCaL version: 2.1.3
% 3.74/1.05 % (3420426)Termination reason: Instruction limit
% 3.74/1.05 % (3420426)Termination phase: Saturation
% 3.74/1.05 % (3420426)Time elapsed: 0.409 s
% 3.74/1.05 % (3420426)Peak memory usage: 19 MB
% 3.74/1.05 % (3420426)Instructions burned: 634 (million)
% 3.74/1.05 % (3420518)lrs+1010_1_anc=none:slsqr=1,2:sil=128000:cnfonf=conj_eager:sas=cadical:si=on:hi=on:uwa=one_side_interpreted:rp=on:nwc=2:slsqc=3:slsq=on:random_seed=1113721983:i=66:s2at=3:nm=2:rtra=on:rawr=on_2995 on theBenchmark for (2995ds/66Mi)
% 3.74/1.05 % (3420517)lrs+10_1_sil=128000:fde=unused:si=on:random_seed=3878859144:s2a=on:i=13:kws=inv_frequency:bd=all:rtra=on_2995 on theBenchmark for (2995ds/13Mi)
% 3.74/1.05 % (3420517)Instruction limit reached!
% 3.74/1.05 % (3420517)------------------------------
% 3.74/1.05 % (3420517)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.74/1.05 % (3420517)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/1.05 % (3420517)CaDiCaL version: 2.1.3
% 3.74/1.05 % (3420517)Termination reason: Instruction limit
% 3.74/1.05 % (3420517)Termination phase: shuffling
% 3.74/1.05 % (3420517)Time elapsed: 0.011 s
% 3.74/1.05 % (3420517)Peak memory usage: 10 MB
% 3.74/1.05 % (3420517)Instructions burned: 13 (million)
% 3.74/1.05 % (3420519)lrs+1004_128_si=on:sos=all:uwa=off:random_seed=1227152375:i=51:fsr=off:rtra=on_2995 on theBenchmark for (2995ds/51Mi)
% 3.74/1.05 % (3420513)Instruction limit reached!
% 3.74/1.05 % (3420513)------------------------------
% 3.74/1.05 % (3420513)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.74/1.05 % (3420513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/1.05 % (3420513)CaDiCaL version: 2.1.3
% 3.74/1.05 % (3420513)Termination reason: Instruction limit
% 3.74/1.05 % (3420513)Termination phase: Saturation
% 3.74/1.05 % (3420513)Time elapsed: 0.057 s
% 3.74/1.05 % (3420513)Peak memory usage: 14 MB
% 3.74/1.05 % (3420513)Instructions burned: 201 (million)
% 3.74/1.05 % (3420518)Instruction limit reached!
% 3.74/1.05 % (3420518)------------------------------
% 3.74/1.05 % (3420518)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.74/1.05 % (3420518)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/1.05 % (3420518)CaDiCaL version: 2.1.3
% 3.74/1.05 % (3420518)Termination reason: Instruction limit
% 3.74/1.05 % (3420518)Termination phase: Property scanning
% 3.74/1.05 % (3420518)Time elapsed: 0.028 s
% 3.74/1.05 % (3420518)Peak memory usage: 11 MB
% 3.74/1.05 % (3420518)Instructions burned: 66 (million)
% 3.74/1.05 % (3420524)dis+1010_40_to=kbo:tgt=full:fde=unused:si=on:sp=const_frequency:lma=off:cbe=off:uwa=interpreted_only:random_seed=187228381:i=137:kws=precedence:bd=all:rtra=on:c=on:ntd=on_2995 on theBenchmark for (2995ds/137Mi)
% 3.74/1.05 % (3420525)dis+10_2_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_pi_sigma_gen:si=on:sp=occurrence:plsqr=5,1:bsr=on:plsql=on:random_seed=981768095:cond=on:i=34:hud=10:nm=10:rtra=on_2995 on theBenchmark for (2995ds/34Mi)
% 3.74/1.05 % (3420522)dis+1002_64_sil=128000:cnfonf=lazy_not_gen_be_off:si=on:cbe=off:uwa=off:nwc=0.5:random_seed=4231209675:i=31:kws=inv_frequency:bd=all:rtra=on:ntd=on_2995 on theBenchmark for (2995ds/31Mi)
% 3.74/1.05 % (3420519)Instruction limit reached!
% 3.74/1.05 % (3420519)------------------------------
% 3.74/1.05 % (3420519)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.74/1.05 % (3420519)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/1.05 % (3420519)CaDiCaL version: 2.1.3
% 3.74/1.05 % (3420519)Termination reason: Instruction limit
% 3.74/1.05 % (3420519)Termination phase: Property scanning
% 3.74/1.05 % (3420519)Time elapsed: 0.043 s
% 3.74/1.05 % (3420519)Peak memory usage: 11 MB
% 3.74/1.05 % (3420519)Instructions burned: 52 (million)
% 3.74/1.05 % (3420525)Instruction limit reached!
% 3.74/1.05 % (3420525)------------------------------
% 3.74/1.05 % (3420525)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.39/1.25 % (3420525)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.39/1.25 % (3420525)CaDiCaL version: 2.1.3
% 6.39/1.25 % (3420525)Termination reason: Instruction limit
% 6.39/1.25 % (3420525)Termination phase: Property scanning
% 6.39/1.25 % (3420525)Time elapsed: 0.015 s
% 6.39/1.25 % (3420525)Peak memory usage: 10 MB
% 6.39/1.25 % (3420525)Instructions burned: 34 (million)
% 6.39/1.25 % (3420522)Instruction limit reached!
% 6.39/1.25 % (3420522)------------------------------
% 6.39/1.25 % (3420522)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.39/1.25 % (3420522)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.39/1.25 % (3420522)CaDiCaL version: 2.1.3
% 6.39/1.25 % (3420522)Termination reason: Instruction limit
% 6.39/1.25 % (3420522)Termination phase: Property scanning
% 6.39/1.25 % (3420522)Time elapsed: 0.026 s
% 6.39/1.25 % (3420522)Peak memory usage: 10 MB
% 6.39/1.25 % (3420522)Instructions burned: 32 (million)
% 6.39/1.25 % (3420530)WARNING Broken Constraint: if sine_generality_threshold(60) has been set then sine_selection(off) is not equal to off
% 6.39/1.25 % (3420530)dis+21_1_to=lpo:sil=128000:cnfonf=lazy_not_gen_be_off:si=on:sp=unary_frequency:bsr=on:random_seed=1767428657:i=180:hud=16:bd=all:fsr=off:rtra=on:sgt=60:ntd=on_2994 on theBenchmark for (2994ds/180Mi)
% 6.39/1.25 % (3420529)lrs+1010_1_sil=128000:hsqc=4:si=on:sos=on:random_seed=1426294740:hsq=on:i=67:hsqaw=5:rtra=on:fe=abstraction:ntd=on_2994 on theBenchmark for (2994ds/67Mi)
% 6.39/1.25 % (3420531)lrs+1002_1_sil=128000:si=on:uwa=off:random_seed=347687789:st=2:i=246:sd=3:rtra=on:ss=axioms_2994 on theBenchmark for (2994ds/246Mi)
% 6.39/1.25 % (3420524)Instruction limit reached!
% 6.39/1.25 % (3420524)------------------------------
% 6.39/1.25 % (3420524)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.39/1.25 % (3420524)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.39/1.25 % (3420524)CaDiCaL version: 2.1.3
% 6.39/1.25 % (3420524)Termination reason: Instruction limit
% 6.39/1.25 % (3420524)Termination phase: Saturation
% 6.39/1.25 % (3420524)Time elapsed: 0.068 s
% 6.39/1.25 % (3420524)Peak memory usage: 13 MB
% 6.39/1.25 % (3420524)Instructions burned: 137 (million)
% 6.39/1.25 % (3420511)Instruction limit reached!
% 6.39/1.25 % (3420511)------------------------------
% 6.39/1.25 % (3420511)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.39/1.25 % (3420511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.39/1.25 % (3420511)CaDiCaL version: 2.1.3
% 6.39/1.25 % (3420511)Termination reason: Instruction limit
% 6.39/1.25 % (3420511)Termination phase: Saturation
% 6.39/1.25 % (3420511)Time elapsed: 0.156 s
% 6.39/1.25 % (3420511)Peak memory usage: 16 MB
% 6.39/1.25 % (3420511)Instructions burned: 483 (million)
% 6.39/1.25 % (3420536)lrs+10_1_sil=128000:si=on:sos=on:urr=on:random_seed=2724716174:i=427:sd=1:rtra=on:ss=axioms_2994 on theBenchmark for (2994ds/427Mi)
% 6.39/1.25 % (3420529)Instruction limit reached!
% 6.39/1.25 % (3420529)------------------------------
% 6.39/1.25 % (3420529)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.39/1.25 % (3420529)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.39/1.25 % (3420529)CaDiCaL version: 2.1.3
% 6.39/1.25 % (3420529)Termination reason: Instruction limit
% 6.39/1.25 % (3420529)Termination phase: Property scanning
% 6.39/1.25 % (3420529)Time elapsed: 0.033 s
% 6.39/1.25 % (3420529)Peak memory usage: 11 MB
% 6.39/1.25 % (3420529)Instructions burned: 68 (million)
% 6.39/1.25 % (3420535)lrs+10_7_sil=128000:tgt=full:si=on:lma=off:uwa=off:nwc=1:sac=on:random_seed=929164709:cond=on:i=96:bd=all:rtra=on_2994 on theBenchmark for (2994ds/96Mi)
% 6.39/1.25 % (3420538)dis+1010_1_sil=128000:si=on:uwa=off:random_seed=213077384:st=3:s2a=on:i=874:sd=3:rtra=on:ss=axioms_2993 on theBenchmark for (2993ds/874Mi)
% 6.39/1.25 % (3420531)Instruction limit reached!
% 6.39/1.25 % (3420531)------------------------------
% 6.39/1.25 % (3420531)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.39/1.25 % (3420531)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.39/1.25 % (3420531)CaDiCaL version: 2.1.3
% 6.39/1.25 % (3420531)Termination reason: Instruction limit
% 6.39/1.25 % (3420531)Termination phase: Saturation
% 6.39/1.25 % (3420531)Time elapsed: 0.115 s
% 6.39/1.25 % (3420531)Peak memory usage: 14 MB
% 6.39/1.25 % (3420531)Instructions burned: 247 (million)
% 6.39/1.25 % (3420535)Instruction limit reached!
% 6.97/1.34 % (3420535)------------------------------
% 6.97/1.34 % (3420535)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.97/1.34 % (3420535)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.97/1.34 % (3420535)CaDiCaL version: 2.1.3
% 6.97/1.34 % (3420535)Termination reason: Instruction limit
% 6.97/1.34 % (3420535)Termination phase: Property scanning
% 6.97/1.34 % (3420535)Time elapsed: 0.081 s
% 6.97/1.34 % (3420535)Peak memory usage: 12 MB
% 6.97/1.34 % (3420535)Instructions burned: 97 (million)
% 6.97/1.34 % (3420536)Instruction limit reached!
% 6.97/1.34 % (3420536)------------------------------
% 6.97/1.34 % (3420536)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.97/1.34 % (3420536)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.97/1.34 % (3420536)CaDiCaL version: 2.1.3
% 6.97/1.34 % (3420536)Termination reason: Instruction limit
% 6.97/1.34 % (3420536)Termination phase: Saturation
% 6.97/1.34 % (3420536)Time elapsed: 0.109 s
% 6.97/1.34 % (3420536)Peak memory usage: 15 MB
% 6.97/1.34 % (3420536)Instructions burned: 428 (million)
% 6.97/1.34 % (3420530)Instruction limit reached!
% 6.97/1.34 % (3420530)------------------------------
% 6.97/1.34 % (3420530)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.97/1.34 % (3420530)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.97/1.34 % (3420530)CaDiCaL version: 2.1.3
% 6.97/1.34 % (3420530)Termination reason: Instruction limit
% 6.97/1.34 % (3420530)Termination phase: Saturation
% 6.97/1.34 % (3420530)Time elapsed: 0.147 s
% 6.97/1.34 % (3420530)Peak memory usage: 13 MB
% 6.97/1.34 % (3420530)Instructions burned: 181 (million)
% 6.97/1.34 % (3420542)lrs+1002_1_cnfonf=lazy_pi_sigma_gen:si=on:uwa=off:random_seed=3720149770:st=1.5:i=130:rtra=on:ss=axioms_2993 on theBenchmark for (2993ds/130Mi)
% 6.97/1.34 % (3420541)dis+1010_4_sas=cadical:si=on:cbe=off:nwc=20:random_seed=4077342730:st=6:s2a=on:i=515:sd=2:nm=2:rtra=on:ss=axioms_2993 on theBenchmark for (2993ds/515Mi)
% 6.97/1.34 % (3420544)lrs+1010_8:1_sil=128000:fde=unused:e2e=on:si=on:sos=on:urr=on:uwa=one_side_constant:fd=off:random_seed=1524975751:s2a=on:i=571:nm=16:rtra=on_2992 on theBenchmark for (2992ds/571Mi)
% 6.97/1.34 % (3420543)ott+1004_1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:sp=unary_frequency:cbe=off:uwa=off:nwc=1:random_seed=2761573612:i=44:ep=R:rtra=on:ntd=on_2992 on theBenchmark for (2992ds/44Mi)
% 6.97/1.34 % (3420543)Instruction limit reached!
% 6.97/1.34 % (3420543)------------------------------
% 6.97/1.34 % (3420543)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.97/1.34 % (3420543)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.97/1.34 % (3420543)CaDiCaL version: 2.1.3
% 6.97/1.34 % (3420543)Termination reason: Instruction limit
% 6.97/1.34 % (3420543)Termination phase: Clausification
% 6.97/1.34 % (3420543)Time elapsed: 0.019 s
% 6.97/1.34 % (3420543)Peak memory usage: 11 MB
% 6.97/1.34 % (3420543)Instructions burned: 46 (million)
% 6.97/1.34 % (3420549)dis+1010_8_to=lpo:sil=128000:tgt=ground:si=on:sp=reverse_frequency:cbe=off:uwa=off:random_seed=486308684:i=450:rtra=on:ixr=off:ntd=on_2992 on theBenchmark for (2992ds/450Mi)
% 6.97/1.34 % (3420542)Instruction limit reached!
% 6.97/1.34 % (3420542)------------------------------
% 6.97/1.34 % (3420542)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.97/1.34 % (3420542)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.97/1.34 % (3420542)CaDiCaL version: 2.1.3
% 6.97/1.34 % (3420542)Termination reason: Instruction limit
% 6.97/1.34 % (3420542)Termination phase: Saturation
% 6.97/1.34 % (3420542)Time elapsed: 0.054 s
% 6.97/1.34 % (3420542)Peak memory usage: 12 MB
% 6.97/1.34 % (3420542)Instructions burned: 132 (million)
% 6.97/1.34 % (3420551)lrs+10_5:1_to=lpo:sil=128000:si=on:uwa=one_side_interpreted:random_seed=3357710869:cts=off:i=95:piset=pi_sigma:bd=all:rtra=on:ntd=on_2992 on theBenchmark for (2992ds/95Mi)
% 6.97/1.34 % (3420551)Instruction limit reached!
% 6.97/1.34 % (3420551)------------------------------
% 6.97/1.34 % (3420551)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.97/1.34 % (3420551)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.97/1.34 % (3420551)CaDiCaL version: 2.1.3
% 6.97/1.34 % (3420551)Termination reason: Instruction limit
% 6.97/1.34 % (3420551)Termination phase: Saturation
% 6.97/1.34 % (3420551)Time elapsed: 0.040 s
% 6.97/1.34 % (3420551)Peak memory usage: 13 MB
% 7.32/1.49 % (3420551)Instructions burned: 95 (million)
% 7.32/1.49 % (3420553)lrs+1003_1_sil=128000:drc=off:cnfonf=lazy_pi_sigma_gen:si=on:uwa=one_side_interpreted:fd=off:rp=on:sac=on:random_seed=1000386904:s2a=on:i=65:add=on:bd=preordered:ins=10:rtra=on_2991 on theBenchmark for (2991ds/65Mi)
% 7.32/1.49 % (3420544)Instruction limit reached!
% 7.32/1.49 % (3420544)------------------------------
% 7.32/1.49 % (3420544)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.49 % (3420544)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.49 % (3420544)CaDiCaL version: 2.1.3
% 7.32/1.49 % (3420544)Termination reason: Instruction limit
% 7.32/1.49 % (3420544)Termination phase: Saturation
% 7.32/1.49 % (3420544)Time elapsed: 0.149 s
% 7.32/1.49 % (3420544)Peak memory usage: 18 MB
% 7.32/1.49 % (3420544)Instructions burned: 571 (million)
% 7.32/1.49 % (3420553)Instruction limit reached!
% 7.32/1.49 % (3420553)------------------------------
% 7.32/1.49 % (3420553)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.49 % (3420553)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.49 % (3420553)CaDiCaL version: 2.1.3
% 7.32/1.49 % (3420553)Termination reason: Instruction limit
% 7.32/1.49 % (3420553)Termination phase: Property scanning
% 7.32/1.49 % (3420553)Time elapsed: 0.027 s
% 7.32/1.49 % (3420553)Peak memory usage: 11 MB
% 7.32/1.49 % (3420553)Instructions burned: 66 (million)
% 7.32/1.49 % (3420555)dis+1010_2:1_slsqr=2,1:to=lpo:plsq=on:cnfonf=lazy_pi_sigma_gen:si=on:sp=reverse_arity:acc=on:uwa=hol:fd=preordered:s2agt=16:flr=on:pe=on:slsq=on:random_seed=1216115196:uwa_fpi=on:avsq=on:s2a=on:cond=fast:i=105:s2at=1.5:aac=none:fgj=on:piset=and:hud=3:fsr=off:rtra=on:er=filter:rawr=on_2991 on theBenchmark for (2991ds/105Mi)
% 7.32/1.49 % (3420556)dis+10_4:1_sfv=off:to=kbo:fde=unused:cnfonf=off:sas=cadical:e2e=on:si=on:sp=occurrence:acc=on:uwa=off:fd=preordered:foolp=on:random_seed=1486942088:hsq=on:hsqr=16,1:s2a=on:i=5755:piset=or:nm=32:rtra=on:ss=axioms:c=on:sgt=8:rawr=on_2991 on theBenchmark for (2991ds/5755Mi)
% 7.32/1.49 % (3420555)Instruction limit reached!
% 7.32/1.49 % (3420555)------------------------------
% 7.32/1.49 % (3420555)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.49 % (3420555)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.49 % (3420555)CaDiCaL version: 2.1.3
% 7.32/1.49 % (3420555)Termination reason: Instruction limit
% 7.32/1.49 % (3420555)Termination phase: Saturation
% 7.32/1.49 % (3420555)Time elapsed: 0.023 s
% 7.32/1.49 % (3420555)Peak memory usage: 12 MB
% 7.32/1.49 % (3420555)Instructions burned: 107 (million)
% 7.32/1.49 % (3420559)lrs+10_1_sil=128000:drc=off:si=on:fs=off:urr=on:uwa=one_side_constant:random_seed=2267930308:st=10:i=375:sd=1:bd=all:fsr=off:rtra=on:ss=axioms_2990 on theBenchmark for (2990ds/375Mi)
% 7.32/1.49 % (3420483)Instruction limit reached!
% 7.32/1.49 % (3420483)------------------------------
% 7.32/1.49 % (3420483)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.49 % (3420483)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.49 % (3420483)CaDiCaL version: 2.1.3
% 7.32/1.49 % (3420483)Termination reason: Instruction limit
% 7.32/1.49 % (3420483)Termination phase: Saturation
% 7.32/1.49 % (3420483)Time elapsed: 0.662 s
% 7.32/1.49 % (3420483)Peak memory usage: 19 MB
% 7.32/1.49 % (3420483)Instructions burned: 1240 (million)
% 7.32/1.49 % (3420561)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1136409814:s2a=on:i=495:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2990 on theBenchmark for (2990ds/495Mi)
% 7.32/1.49 % (3420559)Instruction limit reached!
% 7.32/1.49 % (3420559)------------------------------
% 7.32/1.49 % (3420559)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.49 % (3420559)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.49 % (3420559)CaDiCaL version: 2.1.3
% 7.32/1.49 % (3420559)Termination reason: Instruction limit
% 7.32/1.49 % (3420559)Termination phase: Saturation
% 7.32/1.49 % (3420559)Time elapsed: 0.096 s
% 7.32/1.49 % (3420559)Peak memory usage: 15 MB
% 7.32/1.49 % (3420559)Instructions burned: 376 (million)
% 7.32/1.49 % (3420563)dis+10_2_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_pi_sigma_gen:si=on:sp=occurrence:plsqr=5,1:bsr=on:plsql=on:random_seed=2983532979:cond=on:i=34:hud=10:nm=10:rtra=on_2989 on theBenchmark for (2989ds/34Mi)
% 8.12/1.68 % (3420563)Instruction limit reached!
% 8.12/1.68 % (3420563)------------------------------
% 8.12/1.68 % (3420563)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.12/1.68 % (3420563)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.12/1.68 % (3420563)CaDiCaL version: 2.1.3
% 8.12/1.68 % (3420563)Termination reason: Instruction limit
% 8.12/1.68 % (3420563)Termination phase: Property scanning
% 8.12/1.68 % (3420563)Time elapsed: 0.009 s
% 8.12/1.68 % (3420563)Peak memory usage: 10 MB
% 8.12/1.68 % (3420563)Instructions burned: 38 (million)
% 8.12/1.68 % (3420565)ott+1002_4_tgt=ground:si=on:tsa=off:nwc=1:random_seed=2134371603:s2a=on:i=91:piset=or:hud=5:rtra=on:fe=abstraction_2989 on theBenchmark for (2989ds/91Mi)
% 8.12/1.68 % (3420549)Instruction limit reached!
% 8.12/1.68 % (3420549)------------------------------
% 8.12/1.68 % (3420549)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.12/1.68 % (3420549)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.12/1.68 % (3420549)CaDiCaL version: 2.1.3
% 8.12/1.68 % (3420549)Termination reason: Instruction limit
% 8.12/1.68 % (3420549)Termination phase: Saturation
% 8.12/1.68 % (3420549)Time elapsed: 0.284 s
% 8.12/1.68 % (3420549)Peak memory usage: 20 MB
% 8.12/1.68 % (3420549)Instructions burned: 451 (million)
% 8.12/1.68 % (3420565)Instruction limit reached!
% 8.12/1.68 % (3420565)------------------------------
% 8.12/1.68 % (3420565)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.12/1.68 % (3420565)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.12/1.68 % (3420565)CaDiCaL version: 2.1.3
% 8.12/1.68 % (3420565)Termination reason: Instruction limit
% 8.12/1.68 % (3420565)Termination phase: Twee Goal Transformation
% 8.12/1.68 % (3420565)Time elapsed: 0.021 s
% 8.12/1.68 % (3420565)Peak memory usage: 12 MB
% 8.12/1.68 % (3420565)Instructions burned: 95 (million)
% 8.12/1.68 % (3420567)dis+2_1_sil=128000:tgt=ground:e2e=on:si=on:sos=on:urr=on:uwa=off:nwc=2:random_seed=1042372318:i=66:sd=50:kws=inv_arity:bd=preordered:nm=64:rtra=on:ss=axioms:c=on:ntd=on_2989 on theBenchmark for (2989ds/66Mi)
% 8.12/1.68 % (3420568)ott+2_5:4_anc=none:to=lpo:si=on:lma=off:cbe=off:uwa=ground:nwc=3:random_seed=99827461:uwa_fpi=on:i=22:add=on:doe=on:ins=1:rtra=on_2989 on theBenchmark for (2989ds/22Mi)
% 8.12/1.68 % (3420568)Instruction limit reached!
% 8.12/1.68 % (3420568)------------------------------
% 8.12/1.68 % (3420568)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.12/1.68 % (3420568)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.12/1.68 % (3420568)CaDiCaL version: 2.1.3
% 8.12/1.68 % (3420568)Termination reason: Instruction limit
% 8.12/1.68 % (3420568)Termination phase: Property scanning
% 8.12/1.68 % (3420568)Time elapsed: 0.006 s
% 8.12/1.68 % (3420568)Peak memory usage: 11 MB
% 8.12/1.68 % (3420568)Instructions burned: 26 (million)
% 8.12/1.68 % (3420571)lrs+21_16_anc=none:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:sas=cadical:si=on:plsqr=32,1:uwa=interpreted_only:foolp=on:nwc=3:random_seed=2964443419:i=338:bd=all:ins=4:rtra=on_2989 on theBenchmark for (2989ds/338Mi)
% 8.12/1.68 % (3420567)Instruction limit reached!
% 8.12/1.68 % (3420567)------------------------------
% 8.12/1.68 % (3420567)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.12/1.68 % (3420567)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.12/1.68 % (3420567)CaDiCaL version: 2.1.3
% 8.12/1.68 % (3420567)Termination reason: Instruction limit
% 8.12/1.68 % (3420567)Termination phase: Property scanning
% 8.12/1.68 % (3420567)Time elapsed: 0.033 s
% 8.12/1.68 % (3420567)Peak memory usage: 12 MB
% 8.12/1.68 % (3420567)Instructions burned: 68 (million)
% 8.12/1.68 % (3420541)Instruction limit reached!
% 8.12/1.68 % (3420541)------------------------------
% 8.12/1.68 % (3420541)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.12/1.68 % (3420541)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.12/1.68 % (3420541)CaDiCaL version: 2.1.3
% 8.12/1.68 % (3420541)Termination reason: Instruction limit
% 8.12/1.68 % (3420541)Termination phase: Saturation
% 8.12/1.68 % (3420541)Time elapsed: 0.392 s
% 8.12/1.68 % (3420541)Peak memory usage: 15 MB
% 8.12/1.68 % (3420541)Instructions burned: 515 (million)
% 8.12/1.68 % (3420507)Instruction limit reached!
% 8.12/1.68 % (3420507)------------------------------
% 8.12/1.68 % (3420507)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.61/1.77 % (3420507)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.61/1.77 % (3420507)CaDiCaL version: 2.1.3
% 8.61/1.77 % (3420507)Termination reason: Instruction limit
% 8.61/1.77 % (3420507)Termination phase: Saturation
% 8.61/1.77 % (3420507)Time elapsed: 0.750 s
% 8.61/1.77 % (3420507)Peak memory usage: 21 MB
% 8.61/1.77 % (3420507)Instructions burned: 854 (million)
% 8.61/1.77 % (3420574)WARNING Broken Constraint: if avatar_split_queue_ratios(1,16) has been set then avatar_split_queue(off) is equal to on
% 8.61/1.77 % (3420573)lrs+10_1_sil=128000:si=on:urr=on:random_seed=1515617912:i=28:sd=1:rtra=on:ss=axioms:sgt=64_2988 on theBenchmark for (2988ds/28Mi)
% 8.61/1.77 % (3420571)Instruction limit reached!
% 8.61/1.77 % (3420571)------------------------------
% 8.61/1.77 % (3420571)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.61/1.77 % (3420571)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.61/1.77 % (3420571)CaDiCaL version: 2.1.3
% 8.61/1.77 % (3420571)Termination reason: Instruction limit
% 8.61/1.77 % (3420571)Termination phase: Saturation
% 8.61/1.77 % (3420571)Time elapsed: 0.073 s
% 8.61/1.77 % (3420571)Peak memory usage: 16 MB
% 8.61/1.77 % (3420571)Instructions burned: 339 (million)
% 8.61/1.77 % (3420574)lrs+1010_2:13_to=kbo:sil=128000:cnfonf=lazy_not_gen:si=on:sp=const_min:uwa=interpreted_only:random_seed=1687065289:i=137:add=off:avsqr=1,16:kws=inv_arity:bd=preordered:nm=0:rtra=on:ntd=on:rawr=on_2988 on theBenchmark for (2988ds/137Mi)
% 8.61/1.77 % (3420578)dis+1004_1_sil=128000:si=on:sos=on:uwa=one_side_interpreted:random_seed=840802522:i=227:sd=1:bd=all:rtra=on:ss=axioms_2988 on theBenchmark for (2988ds/227Mi)
% 8.61/1.77 % (3420575)dis+10_32_sil=128000:tgt=ground:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=32,1:uwa=one_side_interpreted:nwc=1:random_seed=239370590:hsq=on:hsqr=1,8:i=340:hsql=off:bd=preordered:av=off:rtra=on_2988 on theBenchmark for (2988ds/340Mi)
% 8.61/1.77 % (3420561)Instruction limit reached!
% 8.61/1.77 % (3420561)------------------------------
% 8.61/1.77 % (3420561)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.61/1.77 % (3420561)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.61/1.77 % (3420561)CaDiCaL version: 2.1.3
% 8.61/1.77 % (3420561)Termination reason: Instruction limit
% 8.61/1.77 % (3420561)Termination phase: Saturation
% 8.61/1.77 % (3420561)Time elapsed: 0.253 s
% 8.61/1.77 % (3420561)Peak memory usage: 17 MB
% 8.61/1.77 % (3420561)Instructions burned: 495 (million)
% 8.61/1.77 % (3420573)Instruction limit reached!
% 8.61/1.77 % (3420573)------------------------------
% 8.61/1.77 % (3420573)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.61/1.77 % (3420573)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.61/1.77 % (3420573)CaDiCaL version: 2.1.3
% 8.61/1.77 % (3420573)Termination reason: Instruction limit
% 8.61/1.77 % (3420573)Termination phase: Property scanning
% 8.61/1.77 % (3420573)Time elapsed: 0.038 s
% 8.61/1.77 % (3420573)Peak memory usage: 11 MB
% 8.61/1.77 % (3420573)Instructions burned: 29 (million)
% 8.61/1.77 % (3420581)WARNING Broken Constraint: if sine_level_split_queue_cutoffs(1) has been set then sine_level_split_queue(off) is equal to on
% 8.61/1.77 % (3420578)Instruction limit reached!
% 8.61/1.77 % (3420578)------------------------------
% 8.61/1.77 % (3420578)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.61/1.77 % (3420578)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.61/1.77 % (3420578)CaDiCaL version: 2.1.3
% 8.61/1.77 % (3420578)Termination reason: Instruction limit
% 8.61/1.77 % (3420578)Termination phase: Saturation
% 8.61/1.77 % (3420578)Time elapsed: 0.057 s
% 8.61/1.77 % (3420578)Peak memory usage: 14 MB
% 8.61/1.77 % (3420578)Instructions burned: 231 (million)
% 8.61/1.77 % (3420581)dis+1010_1_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:nwc=2:slsqc=1:random_seed=3491658994:i=373:hud=10:nm=16:av=off:rtra=on:ntd=on_2987 on theBenchmark for (2987ds/373Mi)
% 8.61/1.77 % (3420582)lrs+10_64_anc=all_dependent:sil=128000:e2e=on:si=on:cbe=off:uwa=off:random_seed=150857217:i=116:ep=RSTC:rtra=on:ntd=on_2987 on theBenchmark for (2987ds/116Mi)
% 8.61/1.77 % (3420583)lrs+10_1_sil=128000:drc=off:si=on:sos=on:erd=off:urr=on:uwa=interpreted_only:random_seed=2926479430:i=575:rtra=on_2987 on theBenchmark for (2987ds/575Mi)
% 8.61/1.77 % (3420582)Instruction limit reached!
% 8.61/1.77 % (3420582)------------------------------
% 9.54/1.96 % (3420582)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.54/1.96 % (3420582)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.54/1.96 % (3420582)CaDiCaL version: 2.1.3
% 9.54/1.96 % (3420582)Termination reason: Instruction limit
% 9.54/1.96 % (3420582)Termination phase: Saturation
% 9.54/1.96 % (3420582)Time elapsed: 0.028 s
% 9.54/1.96 % (3420582)Peak memory usage: 13 MB
% 9.54/1.96 % (3420582)Instructions burned: 120 (million)
% 9.54/1.96 % (3420587)dis+2_1_to=lpo:sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:fdtod=off:sp=const_max:lma=off:random_seed=186436906:cts=off:i=270:doe=on:hud=5:bs=unit_only:bd=preordered:nm=30:ins=25:rtra=on_2987 on theBenchmark for (2987ds/270Mi)
% 9.54/1.96 % (3420574)Instruction limit reached!
% 9.54/1.96 % (3420574)------------------------------
% 9.54/1.96 % (3420574)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.54/1.96 % (3420574)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.54/1.96 % (3420574)CaDiCaL version: 2.1.3
% 9.54/1.96 % (3420574)Termination reason: Instruction limit
% 9.54/1.96 % (3420574)Termination phase: Saturation
% 9.54/1.96 % (3420574)Time elapsed: 0.122 s
% 9.54/1.96 % (3420574)Peak memory usage: 13 MB
% 9.54/1.96 % (3420574)Instructions burned: 138 (million)
% 9.54/1.96 % (3420589)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=1013778516:hsq=on:hsqr=16,1:s2a=on:i=9840:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2987 on theBenchmark for (2987ds/9840Mi)
% 9.54/1.96 % (3420587)Instruction limit reached!
% 9.54/1.96 % (3420587)------------------------------
% 9.54/1.96 % (3420587)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.54/1.96 % (3420587)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.54/1.96 % (3420587)CaDiCaL version: 2.1.3
% 9.54/1.96 % (3420587)Termination reason: Instruction limit
% 9.54/1.96 % (3420587)Termination phase: Saturation
% 9.54/1.96 % (3420587)Time elapsed: 0.057 s
% 9.54/1.96 % (3420587)Peak memory usage: 14 MB
% 9.54/1.96 % (3420587)Instructions burned: 274 (million)
% 9.54/1.96 % (3420538)Instruction limit reached!
% 9.54/1.96 % (3420538)------------------------------
% 9.54/1.96 % (3420538)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.54/1.96 % (3420538)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.54/1.96 % (3420538)CaDiCaL version: 2.1.3
% 9.54/1.96 % (3420538)Termination reason: Instruction limit
% 9.54/1.96 % (3420538)Termination phase: Saturation
% 9.54/1.96 % (3420538)Time elapsed: 0.703 s
% 9.54/1.96 % (3420538)Peak memory usage: 15 MB
% 9.54/1.96 % (3420538)Instructions burned: 874 (million)
% 9.54/1.96 % (3420591)lrs+1010_1_sil=128000:si=on:sos=all:uwa=off:nwc=1:random_seed=3050414710:i=421:rtra=on:ss=axioms_2986 on theBenchmark for (2986ds/421Mi)
% 9.54/1.96 % (3420592)WARNING Broken Constraint: if sine_to_age_tolerance(3) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 9.54/1.96 % (3420592)lrs+10_40_sil=128000:tgt=full:cnfonf=off:si=on:sp=reverse_frequency:spb=goal_then_units:uwa=off:fd=preordered:nwc=1:random_seed=2541910718:avsq=on:i=270:s2at=3:avsqr=1,16:rtra=on:ntd=on_2986 on theBenchmark for (2986ds/270Mi)
% 9.54/1.96 % (3420592)Refutation not found, incomplete strategy
% 9.54/1.96 % (3420592)------------------------------
% 9.54/1.96 % (3420592)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.54/1.96 % (3420592)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.54/1.96 % (3420592)CaDiCaL version: 2.1.3
% 9.54/1.96 % (3420592)Termination reason: Refutation not found, incomplete strategy
% 9.54/1.96 % (3420592)Time elapsed: 0.079 s
% 9.54/1.96 % (3420592)Peak memory usage: 14 MB
% 9.54/1.96 % (3420592)Instructions burned: 177 (million)
% 9.54/1.96 % (3420592)------------------------------
% 9.54/1.96 % (3420592)------------------------------
% 9.54/1.96 % (3420591)Instruction limit reached!
% 9.54/1.96 % (3420591)------------------------------
% 9.54/1.96 % (3420591)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.54/1.96 % (3420591)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.54/1.96 % (3420591)CaDiCaL version: 2.1.3
% 9.54/1.96 % (3420591)Termination reason: Instruction limit
% 9.54/1.98 % (3420591)Termination phase: Saturation
% 9.54/1.98 % (3420591)Time elapsed: 0.106 s
% 9.54/1.98 % (3420591)Peak memory usage: 15 MB
% 9.54/1.98 % (3420591)Instructions burned: 425 (million)
% 9.54/1.98 % (3420575)Instruction limit reached!
% 9.54/1.98 % (3420575)------------------------------
% 9.54/1.98 % (3420575)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.54/1.98 % (3420575)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.54/1.98 % (3420575)CaDiCaL version: 2.1.3
% 9.54/1.98 % (3420575)Termination reason: Instruction limit
% 9.54/1.98 % (3420575)Termination phase: Saturation
% 9.54/1.98 % (3420575)Time elapsed: 0.279 s
% 9.54/1.98 % (3420575)Peak memory usage: 14 MB
% 9.54/1.98 % (3420575)Instructions burned: 341 (million)
% 9.54/1.98 % (3420596)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 9.54/1.98 % (3420596)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 9.54/1.98 % (3420595)dis+1002_64_sil=128000:cnfonf=lazy_not_gen_be_off:si=on:cbe=off:uwa=off:nwc=0.5:random_seed=2009405728:i=31:kws=inv_frequency:bd=all:rtra=on:ntd=on_2985 on theBenchmark for (2985ds/31Mi)
% 9.54/1.98 % (3420596)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=3853995773:hsqr=1,8:i=1440:s2at=5:add=on:nm=2:rtra=on_2985 on theBenchmark for (2985ds/1440Mi)
% 9.54/1.98 % (3420595)Instruction limit reached!
% 9.54/1.98 % (3420595)------------------------------
% 9.54/1.98 % (3420595)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.54/1.98 % (3420595)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.54/1.98 % (3420595)CaDiCaL version: 2.1.3
% 9.54/1.98 % (3420595)Termination reason: Instruction limit
% 9.54/1.98 % (3420595)Termination phase: Property scanning
% 9.54/1.98 % (3420595)Time elapsed: 0.014 s
% 9.54/1.98 % (3420595)Peak memory usage: 10 MB
% 9.54/1.98 % (3420595)Instructions burned: 31 (million)
% 9.54/1.98 % (3420597)dis+10_2_sil=128000:si=on:random_seed=422484901:s2a=on:i=339:av=off:rtra=on:fe=abstraction:ss=axioms:fsd=on:ntd=on_2985 on theBenchmark for (2985ds/339Mi)
% 9.54/1.98 % (3420600)lrs+2_16:1_si=on:cbe=off:uwa=interpreted_only:random_seed=3477011185:i=111:add=on:fgj=on:rtra=on:fdi=1024_2985 on theBenchmark for (2985ds/111Mi)
% 9.54/1.98 % (3420581)Instruction limit reached!
% 9.54/1.98 % (3420581)------------------------------
% 9.54/1.98 % (3420581)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.54/1.98 % (3420581)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.54/1.98 % (3420581)CaDiCaL version: 2.1.3
% 9.54/1.98 % (3420581)Termination reason: Instruction limit
% 9.54/1.98 % (3420581)Termination phase: Saturation
% 9.54/1.98 % (3420581)Time elapsed: 0.260 s
% 9.54/1.98 % (3420581)Peak memory usage: 13 MB
% 9.54/1.98 % (3420581)Instructions burned: 374 (million)
% 9.54/1.98 % (3420583)Instruction limit reached!
% 9.54/1.98 % (3420583)------------------------------
% 9.54/1.98 % (3420583)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.54/1.98 % (3420583)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.54/1.98 % (3420583)CaDiCaL version: 2.1.3
% 9.54/1.98 % (3420583)Termination reason: Instruction limit
% 9.54/1.98 % (3420583)Termination phase: Saturation
% 9.54/1.98 % (3420583)Time elapsed: 0.254 s
% 9.54/1.98 % (3420583)Peak memory usage: 16 MB
% 9.54/1.98 % (3420583)Instructions burned: 575 (million)
% 9.54/1.98 % (3420603)dis+10_8_sil=128000:plsq=on:plsqc=1:si=on:sp=unary_first:sos=on:lma=off:plsqr=64,1:uwa=interpreted_only:foolp=on:random_seed=2250725126:st=3:avsq=on:i=122:avsqr=8,1:sd=2:kws=precedence:bd=preordered:rtra=on:ss=axioms:ntd=on_2984 on theBenchmark for (2984ds/122Mi)
% 9.54/1.98 % (3420604)dis+1010_3:2_anc=all_dependent:sil=128000:si=on:sos=on:lma=off:spb=goal_then_units:bce=on:fd=off:random_seed=2941184855:uwa_fpi=on:avsq=on:i=136:avsqr=1,32:hud=15:nm=0:rtra=on:ntd=on_2984 on theBenchmark for (2984ds/136Mi)
% 9.54/1.98 % (3420600)Instruction limit reached!
% 9.54/1.98 % (3420600)------------------------------
% 9.54/1.98 % (3420600)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.54/1.98 % (3420600)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.54/1.98 % (3420600)CaDiCaL version: 2.1.3
% 9.54/1.98 % (3420600)Termination reason: Instruction limit
% 9.54/1.98 % (3420600)Termination phase: Saturation
% 9.54/1.98 % (3420600)Time elapsed: 0.047 s
% 9.54/1.98 % (3420600)Peak memory usage: 13 MB
% 9.54/1.98 % (3420600)Instructions burned: 112 (million)
% 9.54/1.98 % (3420597)Instruction limit reached!
% 9.54/1.98 % (3420597)------------------------------
% 9.54/1.98 % (3420597)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.54/1.98 % (3420597)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.54/1.98 % (3420597)CaDiCaL version: 2.1.3
% 9.54/1.98 % (3420597)Termination reason: Instruction limit
% 9.54/1.98 % (3420597)Termination phase: Saturation
% 9.54/1.98 % (3420597)Time elapsed: 0.081 s
% 9.54/1.98 % (3420597)Peak memory usage: 14 MB
% 9.54/1.98 % (3420597)Instructions burned: 342 (million)
% 9.54/1.98 % (3420607)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=3630852218:hsq=on:st=2:i=232:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2984 on theBenchmark for (2984ds/232Mi)
% 9.54/1.98 % (3420608)lrs+1010_8:1_sil=128000:tgt=ground:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:sos=on:plsqr=256,1:uwa=off:random_seed=4249596269:i=1254:kws=precedence:bd=preordered:av=off:rtra=on_2984 on theBenchmark for (2984ds/1254Mi)
% 9.54/1.98 % (3420603)Instruction limit reached!
% 9.54/1.98 % (3420603)------------------------------
% 9.54/1.98 % (3420603)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.54/1.98 % (3420603)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.54/1.98 % (3420603)CaDiCaL version: 2.1.3
% 9.54/1.98 % (3420603)Termination reason: Instruction limit
% 9.54/1.98 % (3420603)Termination phase: Saturation
% 9.54/1.98 % (3420603)Time elapsed: 0.071 s
% 9.54/1.98 % (3420603)Peak memory usage: 13 MB
% 9.54/1.98 % (3420603)Instructions burned: 122 (million)
% 9.54/1.98 % (3420604)Instruction limit reached!
% 9.54/1.98 % (3420604)------------------------------
% 9.54/1.98 % (3420604)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.54/1.98 % (3420604)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.54/1.98 % (3420604)CaDiCaL version: 2.1.3
% 9.54/1.98 % (3420604)Termination reason: Instruction limit
% 9.54/1.98 % (3420604)Termination phase: Saturation
% 9.54/1.98 % (3420604)Time elapsed: 0.060 s
% 9.54/1.98 % (3420604)Peak memory usage: 13 MB
% 9.54/1.98 % (3420604)Instructions burned: 137 (million)
% 9.54/1.98 % (3420611)WARNING Broken Constraint: if lrs_weight_limit_only(on) has been set then saturation_algorithm(discount) is equal to lrs
% 9.54/1.98 % (3420611)dis+1002_5:4_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_simp:si=on:plsqr=878,253:plsql=on:uwa=interpreted_only:lwlo=on:random_seed=1588316052:s2a=on:i=281:add=on:rtra=on:fe=axiom:fdi=1024_2984 on theBenchmark for (2984ds/281Mi)
% 9.54/1.98 % (3420612)dis+1010_1_to=lpo:sil=128000:cnfonf=lazy_pi_sigma_gen:sas=cadical:si=on:sos=all:uwa=off:sac=on:random_seed=3868954545:i=619:add=on:rtra=on_2984 on theBenchmark for (2984ds/619Mi)
% 9.54/1.98 % (3420607)Instruction limit reached!
% 9.54/1.98 % (3420607)------------------------------
% 9.54/1.98 % (3420607)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.54/1.98 % (3420607)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.54/1.98 % (3420607)CaDiCaL version: 2.1.3
% 9.54/1.98 % (3420607)Termination reason: Instruction limit
% 9.54/1.98 % (3420607)Termination phase: Saturation
% 9.54/1.98 % (3420607)Time elapsed: 0.142 s
% 9.54/1.98 % (3420607)Peak memory usage: 16 MB
% 9.54/1.98 % (3420607)Instructions burned: 233 (million)
% 9.54/1.98 % (3420608) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3420418-3420608"...
% 9.54/1.98 % (3420615)ott+10_1_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:lma=off:plsqr=128,1:urr=ec_only:uwa=off:rp=on:nwc=20:br=off:random_seed=2271716081:i=865:bs=unit_only:ins=25:rtra=on:ntd=on_2982 on theBenchmark for (2982ds/865Mi)
% 9.54/1.98 % (3420611)Instruction limit reached!
% 9.54/1.98 % (3420611)------------------------------
% 9.54/1.98 % (3420611)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.54/1.98 % (3420611)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.54/1.98 % (3420611)CaDiCaL version: 2.1.3
% 9.54/1.98 % (3420611)Termination reason: Instruction limit
% 9.54/1.98 % (3420611)Termination phase: Saturation
% 9.54/1.98 % (3420611)Time elapsed: 0.122 s
% 9.54/1.98 % (3420611)Peak memory usage: 15 MB
% 9.54/1.98 % (3420611)Instructions burned: 282 (million)
% 9.54/1.98 % (3420608)...printing done.
% 9.54/1.98 % (3420608)Refutation found. Thanks to Tanya!
% 9.54/1.98 % SZS status Theorem for theBenchmark
% 9.54/1.98 % SZS output start Proof for theBenchmark
% 9.54/1.98 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 9.54/1.98 thf(func_def_0, type, in: ($i > $i > $o)).
% 9.54/1.98 thf(func_def_1, type, exu: (($i > $o) > $o)).
% 9.54/1.98 thf(func_def_3, type, setextAx: $o).
% 9.54/1.98 thf(func_def_5, type, emptysetAx: $o).
% 9.54/1.98 thf(func_def_6, type, setadjoin: ($i > $i > $i)).
% 9.54/1.98 thf(func_def_7, type, setadjoinAx: $o).
% 9.54/1.98 thf(func_def_8, type, powerset: ($i > $i)).
% 9.54/1.98 thf(func_def_9, type, powersetAx: $o).
% 9.54/1.98 thf(func_def_10, type, setunion: ($i > $i)).
% 9.54/1.98 thf(func_def_11, type, setunionAx: $o).
% 9.54/1.98 thf(func_def_13, type, omega0Ax: $o).
% 9.54/1.98 thf(func_def_14, type, omegaSAx: $o).
% 9.54/1.98 thf(func_def_15, type, omegaIndAx: $o).
% 9.54/1.98 thf(func_def_16, type, replAx: $o).
% 9.54/1.98 thf(func_def_17, type, foundationAx: $o).
% 9.54/1.98 thf(func_def_18, type, wellorderingAx: $o).
% 9.54/1.98 thf(func_def_19, type, descr: (($i > $o) > $i)).
% 9.54/1.98 thf(func_def_20, type, descrp: $o).
% 9.54/1.98 thf(func_def_21, type, dsetconstr: ($i > ($i > $o) > $i)).
% 9.54/1.98 thf(func_def_22, type, dsetconstrI: $o).
% 9.54/1.98 thf(func_def_23, type, dsetconstrEL: $o).
% 9.54/1.98 thf(func_def_24, type, dsetconstrER: $o).
% 9.54/1.98 thf(func_def_25, type, exuE1: $o).
% 9.54/1.98 thf(func_def_26, type, prop2set: ($o > $i)).
% 9.54/1.98 thf(func_def_27, type, prop2setE: $o).
% 9.54/1.98 thf(func_def_28, type, emptysetE: $o).
% 9.54/1.98 thf(func_def_29, type, emptysetimpfalse: $o).
% 9.54/1.98 thf(func_def_30, type, notinemptyset: $o).
% 9.54/1.98 thf(func_def_31, type, exuE3e: $o).
% 9.54/1.98 thf(func_def_32, type, setext: $o).
% 9.54/1.98 thf(func_def_33, type, emptyI: $o).
% 9.54/1.98 thf(func_def_34, type, noeltsimpempty: $o).
% 9.54/1.98 thf(func_def_35, type, setbeta: $o).
% 9.54/1.98 thf(func_def_36, type, nonempty: ($i > $o)).
% 9.54/1.98 thf(func_def_37, type, nonemptyE1: $o).
% 9.54/1.98 thf(func_def_38, type, nonemptyI: $o).
% 9.54/1.98 thf(func_def_39, type, nonemptyI1: $o).
% 9.54/1.98 thf(func_def_40, type, setadjoinIL: $o).
% 9.54/1.98 thf(func_def_41, type, emptyinunitempty: $o).
% 9.54/1.98 thf(func_def_42, type, setadjoinIR: $o).
% 9.54/1.98 thf(func_def_43, type, setadjoinE: $o).
% 9.54/1.98 thf(func_def_44, type, setadjoinOr: $o).
% 9.54/1.98 thf(func_def_45, type, setoftrueEq: $o).
% 9.54/1.98 thf(func_def_46, type, powersetI: $o).
% 9.54/1.98 thf(func_def_47, type, emptyinPowerset: $o).
% 9.54/1.98 thf(func_def_48, type, emptyInPowerset: $o).
% 9.54/1.98 thf(func_def_49, type, powersetE: $o).
% 9.54/1.98 thf(func_def_50, type, setunionI: $o).
% 9.54/1.98 thf(func_def_51, type, setunionE: $o).
% 9.54/1.98 thf(func_def_52, type, subPowSU: $o).
% 9.54/1.98 thf(func_def_53, type, exuE2: $o).
% 9.54/1.98 thf(func_def_54, type, nonemptyImpWitness: $o).
% 9.54/1.98 thf(func_def_55, type, uniqinunit: $o).
% 9.54/1.98 thf(func_def_56, type, notinsingleton: $o).
% 9.54/1.98 thf(func_def_57, type, eqinunit: $o).
% 9.54/1.98 thf(func_def_58, type, singletonsswitch: $o).
% 9.54/1.98 thf(func_def_59, type, upairsetE: $o).
% 9.54/1.98 thf(func_def_60, type, upairsetIL: $o).
% 9.54/1.98 thf(func_def_61, type, upairsetIR: $o).
% 9.54/1.98 thf(func_def_62, type, emptyE1: $o).
% 9.54/1.98 thf(func_def_63, type, vacuousDall: $o).
% 9.54/1.98 thf(func_def_64, type, quantDeMorgan1: $o).
% 9.54/1.98 thf(func_def_65, type, quantDeMorgan2: $o).
% 9.54/1.98 thf(func_def_66, type, quantDeMorgan3: $o).
% 9.54/1.98 thf(func_def_67, type, quantDeMorgan4: $o).
% 9.54/1.98 thf(func_def_68, type, prop2setI: $o).
% 9.54/1.98 thf(func_def_69, type, set2prop: ($i > $o)).
% 9.54/1.98 thf(func_def_70, type, prop2set2propI: $o).
% 9.54/1.98 thf(func_def_71, type, notdexE: $o).
% 9.54/1.98 thf(func_def_72, type, notdallE: $o).
% 9.54/1.98 thf(func_def_73, type, exuI1: $o).
% 9.54/1.98 thf(func_def_74, type, exuI3: $o).
% 9.54/1.98 thf(func_def_75, type, exuI2: $o).
% 9.54/1.98 thf(func_def_76, type, inCongP: $o).
% 9.54/1.98 thf(func_def_77, type, in__Cong: $o).
% 9.54/1.98 thf(func_def_78, type, exuE3u: $o).
% 9.54/1.98 thf(func_def_79, type, exu__Cong: $o).
% 9.54/1.98 thf(func_def_80, type, emptyset__Cong: $o).
% 9.54/1.98 thf(func_def_81, type, setadjoin__Cong: $o).
% 9.54/1.98 thf(func_def_82, type, powerset__Cong: $o).
% 9.54/1.98 thf(func_def_83, type, setunion__Cong: $o).
% 9.54/1.98 thf(func_def_84, type, omega__Cong: $o).
% 9.54/1.98 thf(func_def_85, type, exuEu: $o).
% 9.54/1.98 thf(func_def_86, type, descr__Cong: $o).
% 9.54/1.98 thf(func_def_87, type, dsetconstr__Cong: $o).
% 9.54/1.98 thf(func_def_88, type, subset: ($i > $i > $o)).
% 9.54/1.98 thf(func_def_89, type, disjoint: ($i > $i > $o)).
% 9.54/1.98 thf(func_def_90, type, setsmeet: ($i > $i > $o)).
% 9.54/1.98 thf(func_def_91, type, subsetI1: $o).
% 9.54/1.98 thf(func_def_92, type, eqimpsubset2: $o).
% 9.54/1.98 thf(func_def_93, type, eqimpsubset1: $o).
% 9.54/1.98 thf(func_def_94, type, subsetI2: $o).
% 9.54/1.98 thf(func_def_95, type, emptysetsubset: $o).
% 9.54/1.98 thf(func_def_96, type, subsetE: $o).
% 9.54/1.98 thf(func_def_97, type, subsetE2: $o).
% 9.54/1.98 thf(func_def_98, type, notsubsetI: $o).
% 9.54/1.98 thf(func_def_99, type, notequalI1: $o).
% 9.54/1.98 thf(func_def_100, type, notequalI2: $o).
% 9.54/1.98 thf(func_def_101, type, subsetRefl: $o).
% 9.54/1.98 thf(func_def_102, type, subsetTrans: $o).
% 9.54/1.98 thf(func_def_103, type, setadjoinSub: $o).
% 9.54/1.98 thf(func_def_104, type, setadjoinSub2: $o).
% 9.54/1.98 thf(func_def_105, type, subset2powerset: $o).
% 9.54/1.98 thf(func_def_106, type, setextsub: $o).
% 9.54/1.98 thf(func_def_107, type, subsetemptysetimpeq: $o).
% 9.54/1.98 thf(func_def_108, type, powersetI1: $o).
% 9.54/1.98 thf(func_def_109, type, powersetE1: $o).
% 9.54/1.98 thf(func_def_110, type, inPowerset: $o).
% 9.54/1.98 thf(func_def_111, type, powersetsubset: $o).
% 9.54/1.98 thf(func_def_112, type, sepInPowerset: $o).
% 9.54/1.98 thf(func_def_113, type, sepSubset: $o).
% 9.54/1.98 thf(func_def_114, type, binunion: ($i > $i > $i)).
% 9.54/1.98 thf(func_def_115, type, binunionIL: $o).
% 9.54/1.98 thf(func_def_116, type, upairset2IR: $o).
% 9.54/1.98 thf(func_def_117, type, binunionIR: $o).
% 9.54/1.98 thf(func_def_118, type, binunionEcases: $o).
% 9.54/1.98 thf(func_def_119, type, binunionE: $o).
% 9.54/1.98 thf(func_def_120, type, binunionLsub: $o).
% 9.54/1.98 thf(func_def_121, type, binunionRsub: $o).
% 9.54/1.98 thf(func_def_122, type, binintersect: ($i > $i > $i)).
% 9.54/1.98 thf(func_def_123, type, binintersectI: $o).
% 9.54/1.98 thf(func_def_124, type, binintersectSubset5: $o).
% 9.54/1.98 thf(func_def_125, type, binintersectEL: $o).
% 9.54/1.98 thf(func_def_126, type, binintersectLsub: $o).
% 9.54/1.98 thf(func_def_127, type, binintersectSubset2: $o).
% 9.54/1.98 thf(func_def_128, type, binintersectSubset3: $o).
% 9.54/1.98 thf(func_def_129, type, binintersectER: $o).
% 9.54/1.98 thf(func_def_130, type, disjointsetsI1: $o).
% 9.54/1.98 thf(func_def_131, type, binintersectRsub: $o).
% 9.54/1.98 thf(func_def_132, type, binintersectSubset4: $o).
% 9.54/1.98 thf(func_def_133, type, binintersectSubset1: $o).
% 9.54/1.98 thf(func_def_134, type, bs114d: $o).
% 9.54/1.98 thf(func_def_135, type, regular: ($i > $o)).
% 9.54/1.98 thf(func_def_136, type, setminus: ($i > $i > $i)).
% 9.54/1.98 thf(func_def_137, type, setminusI: $o).
% 9.54/1.98 thf(func_def_138, type, setminusEL: $o).
% 9.54/1.98 thf(func_def_139, type, setminusER: $o).
% 9.54/1.98 thf(func_def_140, type, setminusSubset2: $o).
% 9.54/1.98 thf(func_def_141, type, setminusERneg: $o).
% 9.54/1.98 thf(func_def_142, type, setminusELneg: $o).
% 9.54/1.98 thf(func_def_143, type, setminusILneg: $o).
% 9.54/1.98 thf(func_def_144, type, setminusIRneg: $o).
% 9.54/1.98 thf(func_def_145, type, setminusLsub: $o).
% 9.54/1.98 thf(func_def_146, type, setminusSubset1: $o).
% 9.54/1.98 thf(func_def_147, type, symdiff: ($i > $i > $i)).
% 9.54/1.98 thf(func_def_148, type, symdiffE: $o).
% 9.54/1.98 thf(func_def_149, type, symdiffI1: $o).
% 9.54/1.98 thf(func_def_150, type, symdiffI2: $o).
% 9.54/1.98 thf(func_def_151, type, symdiffIneg1: $o).
% 9.54/1.98 thf(func_def_152, type, symdiffIneg2: $o).
% 9.54/1.98 thf(func_def_153, type, iskpair: ($i > $o)).
% 9.54/1.98 thf(func_def_154, type, secondinupair: $o).
% 9.54/1.98 thf(func_def_155, type, setukpairIL: $o).
% 9.54/1.98 thf(func_def_156, type, setukpairIR: $o).
% 9.54/1.98 thf(func_def_157, type, kpairiskpair: $o).
% 9.54/1.98 thf(func_def_158, type, kpair: ($i > $i > $i)).
% 9.54/1.98 thf(func_def_159, type, kpairp: $o).
% 9.54/1.98 thf(func_def_160, type, cartprod: ($i > $i > $i)).
% 9.54/1.98 thf(func_def_161, type, singletonsubset: $o).
% 9.54/1.98 thf(func_def_162, type, singletoninpowerset: $o).
% 9.54/1.98 thf(func_def_163, type, singletoninpowunion: $o).
% 9.54/1.98 thf(func_def_164, type, upairset2E: $o).
% 9.54/1.98 thf(func_def_165, type, upairsubunion: $o).
% 9.54/1.98 thf(func_def_166, type, upairinpowunion: $o).
% 9.54/1.98 thf(func_def_167, type, ubforcartprodlem1: $o).
% 9.54/1.98 thf(func_def_168, type, ubforcartprodlem2: $o).
% 9.54/1.98 thf(func_def_169, type, ubforcartprodlem3: $o).
% 9.54/1.98 thf(func_def_170, type, cartprodpairin: $o).
% 9.54/1.98 thf(func_def_171, type, cartprodmempair1: $o).
% 9.54/1.98 thf(func_def_172, type, cartprodmempair: $o).
% 9.54/1.98 thf(func_def_173, type, setunionE2: $o).
% 9.54/1.98 thf(func_def_174, type, setunionsingleton1: $o).
% 9.54/1.98 thf(func_def_175, type, setunionsingleton2: $o).
% 9.54/1.98 thf(func_def_176, type, setunionsingleton: $o).
% 9.54/1.98 thf(func_def_177, type, singleton: ($i > $o)).
% 9.54/1.98 thf(func_def_178, type, singletonprop: $o).
% 9.54/1.98 thf(func_def_179, type, ex1: ($i > ($i > $o) > $o)).
% 9.54/1.98 thf(func_def_180, type, ex1E1: $o).
% 9.54/1.98 thf(func_def_181, type, ex1I: $o).
% 9.54/1.98 thf(func_def_182, type, ex1I2: $o).
% 9.54/1.98 thf(func_def_183, type, singletonsuniq: $o).
% 9.54/1.98 thf(func_def_184, type, atmost1p: ($i > $o)).
% 9.54/1.98 thf(func_def_185, type, atleast2p: ($i > $o)).
% 9.54/1.98 thf(func_def_186, type, atmost2p: ($i > $o)).
% 9.54/1.98 thf(func_def_187, type, upairsetp: ($i > $o)).
% 9.54/1.98 thf(func_def_188, type, setukpairinjL1: $o).
% 9.54/1.98 thf(func_def_189, type, kfstsingleton: $o).
% 9.54/1.98 thf(func_def_190, type, theprop: $o).
% 9.54/1.98 thf(func_def_191, type, kfst: ($i > $i)).
% 9.54/1.98 thf(func_def_192, type, kfstpairEq: $o).
% 9.54/1.98 thf(func_def_193, type, cartprodfstin: $o).
% 9.54/1.98 thf(func_def_194, type, setukpairinjL2: $o).
% 9.54/1.98 thf(func_def_195, type, setukpairinjL: $o).
% 9.54/1.98 thf(func_def_196, type, setukpairinjR11: $o).
% 9.54/1.98 thf(func_def_197, type, setukpairinjR12: $o).
% 9.54/1.98 thf(func_def_198, type, setukpairinjR1: $o).
% 9.54/1.98 thf(func_def_199, type, upairequniteq: $o).
% 9.54/1.98 thf(func_def_200, type, setukpairinjR2: $o).
% 9.54/1.98 thf(func_def_201, type, setukpairinjR: $o).
% 9.54/1.98 thf(func_def_202, type, ksndsingleton: $o).
% 9.54/1.98 thf(func_def_203, type, ksnd: ($i > $i)).
% 9.54/1.98 thf(func_def_204, type, ksndpairEq: $o).
% 9.54/1.98 thf(func_def_205, type, kpairsurjEq: $o).
% 9.54/1.98 thf(func_def_206, type, cartprodsndin: $o).
% 9.54/1.98 thf(func_def_207, type, cartprodpairmemEL: $o).
% 9.54/1.98 thf(func_def_208, type, cartprodpairmemER: $o).
% 9.54/1.98 thf(func_def_209, type, cartprodmempaircEq: $o).
% 9.54/1.98 thf(func_def_210, type, cartprodfstpairEq: $o).
% 9.54/1.98 thf(func_def_211, type, cartprodsndpairEq: $o).
% 9.54/1.98 thf(func_def_212, type, cartprodpairsurjEq: $o).
% 9.54/1.98 thf(func_def_213, type, breln: ($i > $i > $i > $o)).
% 9.54/1.98 thf(func_def_214, type, dpsetconstr: ($i > $i > ($i > $i > $o) > $i)).
% 9.54/1.98 thf(func_def_215, type, dpsetconstrI: $o).
% 9.54/1.98 thf(func_def_216, type, dpsetconstrSub: $o).
% 9.54/1.98 thf(func_def_217, type, setOfPairsIsBReln: $o).
% 9.54/1.98 thf(func_def_218, type, dpsetconstrERa: $o).
% 9.54/1.98 thf(func_def_219, type, dpsetconstrEL1: $o).
% 9.54/1.98 thf(func_def_220, type, dpsetconstrEL2: $o).
% 9.54/1.98 thf(func_def_221, type, dpsetconstrER: $o).
% 9.54/1.98 thf(func_def_222, type, func: ($i > $i > $i > $o)).
% 9.54/1.98 thf(func_def_223, type, funcSet: ($i > $i > $i)).
% 9.54/1.98 thf(func_def_224, type, funcImageSingleton: $o).
% 9.54/1.98 thf(func_def_225, type, apProp: $o).
% 9.54/1.98 thf(func_def_226, type, ap: ($i > $i > $i > $i > $i)).
% 9.54/1.98 thf(func_def_227, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 9.54/1.98 thf(func_def_228, type, vIMP: ($o > $o > $o)).
% 9.54/1.98 thf(func_def_229, type, db0: !>[X0: $tType]:(X0)).
% 9.54/1.98 thf(func_def_230, type, db1: !>[X0: $tType]:(X0)).
% 9.54/1.98 thf(func_def_231, type, db2: !>[X0: $tType]:(X0)).
% 9.54/1.98 thf(func_def_232, type, vNOT: ($o > $o)).
% 9.54/1.98 thf(func_def_233, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 9.54/1.98 thf(func_def_234, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 9.54/1.98 thf(func_def_235, type, vAND: ($o > $o > $o)).
% 9.54/1.98 thf(func_def_236, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 9.54/1.98 thf(func_def_237, type, db3: !>[X0: $tType]:(X0)).
% 9.54/1.98 thf(func_def_238, type, db6: !>[X0: $tType]:(X0)).
% 9.54/1.98 thf(func_def_239, type, db4: !>[X0: $tType]:(X0)).
% 9.54/1.98 thf(func_def_240, type, vOR: ($o > $o > $o)).
% 9.54/1.98 thf(func_def_241, type, vIFF: ($o > $o > $o)).
% 9.54/1.98 thf(func_def_242, type, db5: !>[X0: $tType]:(X0)).
% 9.54/1.98 thf(func_def_245, type, sF0: $o).
% 9.54/1.98 thf(func_def_246, type, sF1: $o).
% 9.54/1.98 thf(func_def_247, type, sF2: $o).
% 9.54/1.98 thf(func_def_248, type, sF3: $o).
% 9.54/1.98 thf(func_def_249, type, sF4: $o).
% 9.54/1.98 thf(func_def_250, type, sF5: $o).
% 9.54/1.98 thf(func_def_251, type, sF6: $o).
% 9.54/1.98 thf(func_def_252, type, sF7: $o).
% 9.54/1.98 thf(func_def_253, type, sF8: $o).
% 9.54/1.98 thf(func_def_254, type, sF9: $o).
% 9.54/1.98 thf(func_def_255, type, sF10: $o).
% 9.54/1.98 thf(func_def_256, type, sF11: $o).
% 9.54/1.98 thf(func_def_257, type, sF12: $o).
% 9.54/1.98 thf(func_def_258, type, sF13: $o).
% 9.54/1.98 thf(func_def_259, type, sF14: $o).
% 9.54/1.98 thf(func_def_260, type, sF15: $o).
% 9.54/1.98 thf(func_def_261, type, sF16: $o).
% 9.54/1.98 thf(func_def_262, type, sF17: $o).
% 9.54/1.98 thf(func_def_263, type, sF18: $o).
% 9.54/1.98 thf(func_def_264, type, sF19: $o).
% 9.54/1.98 thf(func_def_265, type, sF20: $o).
% 9.54/1.98 thf(func_def_266, type, sF21: $o).
% 9.54/1.98 thf(func_def_267, type, sF22: $o).
% 9.54/1.98 thf(func_def_268, type, sF23: $o).
% 9.54/1.98 thf(func_def_269, type, sF24: $o).
% 9.54/1.98 thf(func_def_270, type, sF25: $o).
% 9.54/1.98 thf(func_def_271, type, sF26: $o).
% 9.54/1.98 thf(func_def_272, type, sF27: $o).
% 9.54/1.98 thf(func_def_273, type, sF28: $o).
% 9.54/1.98 thf(func_def_274, type, sF29: $o).
% 9.54/1.98 thf(func_def_275, type, sF30: $o).
% 9.54/1.98 thf(func_def_276, type, sF31: $o).
% 9.54/1.98 thf(func_def_277, type, sF32: $o).
% 9.54/1.98 thf(func_def_278, type, sF33: $o).
% 9.54/1.98 thf(func_def_279, type, sF34: $o).
% 9.54/1.98 thf(func_def_280, type, sF35: $o).
% 9.54/1.98 thf(func_def_281, type, sF36: $o).
% 9.54/1.98 thf(func_def_282, type, sF37: $o).
% 9.54/1.98 thf(func_def_283, type, sF38: $o).
% 9.54/1.98 thf(func_def_284, type, sF39: $o).
% 9.54/1.98 thf(func_def_285, type, sF40: $o).
% 9.54/1.98 thf(func_def_286, type, sF41: $o).
% 9.54/1.98 thf(func_def_287, type, sF42: $o).
% 9.54/1.98 thf(func_def_288, type, sF43: $o).
% 9.54/1.98 thf(func_def_289, type, sF44: $o).
% 9.54/1.98 thf(func_def_290, type, sF45: $o).
% 9.54/1.98 thf(func_def_291, type, sF46: $o).
% 9.54/1.98 thf(func_def_292, type, sF47: $o).
% 9.54/1.98 thf(func_def_293, type, sF48: $o).
% 9.54/1.98 thf(func_def_294, type, sF49: $o).
% 9.54/1.98 thf(func_def_295, type, sF50: $o).
% 9.54/1.98 thf(func_def_296, type, sF51: $o).
% 9.54/1.98 thf(func_def_297, type, sF52: $o).
% 9.54/1.98 thf(func_def_298, type, sF53: $o).
% 9.54/1.98 thf(func_def_299, type, sF54: $o).
% 9.54/1.98 thf(func_def_300, type, sF55: $o).
% 9.54/1.98 thf(func_def_301, type, sF56: $o).
% 9.54/1.98 thf(func_def_302, type, sF57: $o).
% 9.54/1.98 thf(func_def_303, type, sF58: $o).
% 9.54/1.98 thf(func_def_304, type, sF59: $o).
% 9.54/1.98 thf(func_def_305, type, sF60: $o).
% 9.54/1.98 thf(func_def_306, type, sF61: $o).
% 9.54/1.98 thf(func_def_307, type, sF62: $o).
% 9.54/1.98 thf(func_def_308, type, sF63: $o).
% 9.54/1.98 thf(func_def_309, type, sF64: $o).
% 9.54/1.98 thf(func_def_310, type, sF65: $o).
% 9.54/1.98 thf(func_def_311, type, sF66: $o).
% 9.54/1.98 thf(func_def_312, type, sF67: $o).
% 9.54/1.98 thf(func_def_313, type, sF68: $o).
% 9.54/1.98 thf(func_def_314, type, sF69: $o).
% 9.54/1.98 thf(func_def_315, type, sF70: $o).
% 9.54/1.98 thf(func_def_316, type, sF71: $o).
% 9.54/1.98 thf(func_def_317, type, sF72: $o).
% 9.54/1.98 thf(func_def_318, type, sF73: $o).
% 9.54/1.98 thf(func_def_319, type, sF74: $o).
% 9.54/1.98 thf(func_def_320, type, sF75: $o).
% 9.54/1.98 thf(func_def_321, type, sF76: $o).
% 9.54/1.98 thf(func_def_322, type, sF77: $o).
% 9.54/1.98 thf(func_def_323, type, sF78: $o).
% 9.54/1.98 thf(func_def_324, type, sF79: $o).
% 9.54/1.98 thf(func_def_325, type, sF80: $o).
% 9.54/1.98 thf(func_def_326, type, sF81: $o).
% 9.54/1.98 thf(func_def_327, type, sF82: $o).
% 9.54/1.98 thf(func_def_328, type, sF83: $o).
% 9.54/1.98 thf(func_def_329, type, sF84: $o).
% 9.54/1.98 thf(func_def_330, type, sF85: $o).
% 9.54/1.98 thf(func_def_331, type, sF86: $o).
% 9.54/1.98 thf(func_def_332, type, sF87: $o).
% 9.54/1.98 thf(func_def_333, type, sF88: $o).
% 9.54/1.98 thf(func_def_334, type, sF89: $o).
% 9.54/1.98 thf(func_def_335, type, sF90: $o).
% 9.54/1.98 thf(func_def_336, type, sF91: $o).
% 9.54/1.98 thf(func_def_337, type, sF92: $o).
% 9.54/1.98 thf(func_def_338, type, sF93: $o).
% 9.54/1.98 thf(func_def_339, type, sF94: $o).
% 9.54/1.98 thf(func_def_340, type, sF95: $o).
% 9.54/1.98 thf(func_def_341, type, sF96: $o).
% 9.54/1.98 thf(func_def_342, type, sF97: $o).
% 9.54/1.98 thf(func_def_343, type, sF98: $o).
% 9.54/1.98 thf(func_def_344, type, sF99: $o).
% 9.54/1.98 thf(func_def_345, type, sF100: $o).
% 9.54/1.98 thf(func_def_346, type, sF101: $o).
% 9.54/1.98 thf(func_def_347, type, sF102: $o).
% 9.54/1.98 thf(func_def_348, type, sF103: $o).
% 9.54/1.98 thf(func_def_349, type, sF104: $o).
% 9.54/1.98 thf(func_def_350, type, sF105: $o).
% 9.54/1.98 thf(func_def_351, type, sF106: $o).
% 9.54/1.98 thf(func_def_352, type, sF107: $o).
% 9.54/1.98 thf(func_def_353, type, sF108: $o).
% 9.54/1.98 thf(func_def_354, type, sF109: $o).
% 9.54/1.98 thf(func_def_355, type, sF110: $o).
% 9.54/1.98 thf(func_def_356, type, sF111: $o).
% 9.54/1.98 thf(func_def_357, type, sF112: $o).
% 9.54/1.98 thf(func_def_358, type, sF113: $o).
% 9.54/1.98 thf(func_def_359, type, sF114: $o).
% 9.54/1.98 thf(func_def_360, type, sF115: $o).
% 9.54/1.98 thf(func_def_361, type, sF116: $o).
% 9.54/1.98 thf(func_def_362, type, sF117: $o).
% 9.54/1.98 thf(func_def_363, type, sF118: $o).
% 9.54/1.98 thf(func_def_364, type, sF119: $o).
% 9.54/1.98 thf(func_def_365, type, sF120: $o).
% 9.54/1.98 thf(func_def_366, type, sF121: $o).
% 9.54/1.98 thf(func_def_367, type, sF122: $o).
% 9.54/1.98 thf(func_def_368, type, sF123: $o).
% 9.54/1.98 thf(func_def_369, type, sF124: $o).
% 9.54/1.98 thf(func_def_370, type, sF125: $o).
% 9.54/1.98 thf(func_def_371, type, sF126: $o).
% 9.54/1.98 thf(func_def_372, type, sF127: $o).
% 9.54/1.98 thf(func_def_373, type, sF128: $o).
% 9.54/1.98 thf(func_def_374, type, sF129: $o).
% 9.54/1.98 thf(func_def_375, type, sF130: $o).
% 9.54/1.98 thf(func_def_376, type, sF131: $o).
% 9.54/1.98 thf(func_def_377, type, sF132: $o).
% 9.54/1.98 thf(func_def_378, type, sF133: $o).
% 9.54/1.98 thf(func_def_379, type, sF134: $o).
% 9.54/1.98 thf(func_def_380, type, sF135: $o).
% 9.54/1.98 thf(func_def_381, type, sF136: $o).
% 9.54/1.98 thf(func_def_382, type, sF137: $o).
% 9.54/1.98 thf(func_def_383, type, sF138: $o).
% 9.54/1.98 thf(func_def_384, type, sF139: $o).
% 9.54/1.98 thf(func_def_385, type, sF140: $o).
% 9.54/1.98 thf(func_def_386, type, sF141: $o).
% 9.54/1.98 thf(func_def_387, type, sF142: $o).
% 9.54/1.98 thf(func_def_388, type, sF143: $o).
% 9.54/1.98 thf(func_def_389, type, sF144: $o).
% 9.54/1.98 thf(func_def_390, type, sF145: $o).
% 9.54/1.98 thf(func_def_391, type, sF146: $o).
% 9.54/1.98 thf(func_def_392, type, sF147: $o).
% 9.54/1.98 thf(func_def_393, type, sF148: $o).
% 9.54/1.98 thf(func_def_394, type, sF149: $o).
% 9.54/1.98 thf(func_def_395, type, sF150: $o).
% 9.54/1.98 thf(func_def_396, type, sF151: $o).
% 9.54/1.98 thf(func_def_397, type, sF152: $o).
% 9.54/1.98 thf(func_def_398, type, sF153: $o).
% 9.54/1.98 thf(func_def_399, type, sF154: $o).
% 9.54/1.98 thf(func_def_400, type, sF155: $o).
% 9.54/1.98 thf(func_def_401, type, sF156: $o).
% 9.54/1.98 thf(func_def_402, type, sF157: $o).
% 9.54/1.98 thf(func_def_403, type, sF158: $o).
% 9.54/1.98 thf(func_def_404, type, sF159: $o).
% 9.54/1.98 thf(func_def_405, type, sF160: $o).
% 9.54/1.98 thf(func_def_406, type, sF161: $o).
% 9.54/1.98 thf(func_def_407, type, sF162: $o).
% 9.54/1.98 thf(func_def_408, type, sF163: $o).
% 9.54/1.98 thf(func_def_409, type, sF164: $o).
% 9.54/1.98 thf(func_def_410, type, sF165: $o).
% 9.54/1.98 thf(func_def_411, type, sF166: $o).
% 9.54/1.98 thf(func_def_412, type, sF167: $o).
% 9.54/1.98 thf(func_def_413, type, sF168: $o).
% 9.54/1.98 thf(func_def_414, type, sF169: $o).
% 9.54/1.98 thf(func_def_415, type, sF170: $o).
% 9.54/1.98 thf(func_def_416, type, sF171: $o).
% 9.54/1.98 thf(func_def_417, type, sF172: $o).
% 9.54/1.98 thf(func_def_418, type, sF173: $o).
% 9.54/1.98 thf(func_def_419, type, sF174: $o).
% 9.54/1.98 thf(func_def_420, type, sF175: $o).
% 9.54/1.98 thf(func_def_421, type, sF176: $o).
% 9.54/1.98 thf(func_def_422, type, sF177: $o).
% 9.54/1.98 thf(func_def_423, type, sF178: $o).
% 9.54/1.98 thf(func_def_424, type, sF179: $o).
% 9.54/1.98 thf(func_def_425, type, sF180: $o).
% 9.54/1.98 thf(func_def_426, type, sF181: $o).
% 9.54/1.98 thf(func_def_427, type, sF182: $o).
% 9.54/1.98 thf(func_def_428, type, sF183: $o).
% 9.54/1.98 thf(func_def_429, type, sF184: $o).
% 9.54/1.98 thf(func_def_430, type, sF185: $o).
% 9.54/1.98 thf(func_def_431, type, sF186: $o).
% 9.54/1.98 thf(func_def_432, type, sF187: $o).
% 9.54/1.98 thf(func_def_433, type, sF188: $o).
% 9.54/1.98 thf(func_def_434, type, sF189: $o).
% 9.54/1.98 thf(func_def_435, type, sF190: $o).
% 9.54/1.98 thf(func_def_436, type, sF191: $o).
% 9.54/1.98 thf(f1,axiom,(
% 9.54/1.98 (exu = (^[X0 : ($i > $o)] : (? [X1 : $i] : (! [X2 : $i] : ((X0 @ X2) => (X1 = X2)) & (X0 @ X1)))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',exu)).
% 9.54/1.98 thf(f2,axiom,(
% 9.54/1.98 (setextAx = ! [X1 : $i,X0 : $i] : (! [X2 : $i] : ((in @ X2 @ X1) <=> (in @ X2 @ X0)) => (X0 = X1)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setextAx)).
% 9.54/1.98 thf(f3,axiom,(
% 9.54/1.98 (emptysetAx = ! [X0 : $i] : ~(in @ X0 @ emptyset))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetAx)).
% 9.54/1.98 thf(f4,axiom,(
% 9.54/1.98 (! [X1 : $i,X2 : $i,X0 : $i] : ((in @ X2 @ (setadjoin @ X0 @ X1)) <=> ((in @ X2 @ X1) | (X2 = X0))) = setadjoinAx)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinAx)).
% 9.54/1.98 thf(f6,axiom,(
% 9.54/1.98 (! [X1 : $i,X0 : $i] : ((in @ X1 @ (setunion @ X0)) <=> ? [X2 : $i] : ((in @ X2 @ X0) & (in @ X1 @ X2))) = setunionAx)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionAx)).
% 9.54/1.98 thf(f7,axiom,(
% 9.54/1.98 (omega0Ax = ((in @ emptyset @ omega)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',omega0Ax)).
% 9.54/1.98 thf(f8,axiom,(
% 9.54/1.98 (omegaSAx = ! [X0 : $i] : ((in @ X0 @ omega) => (in @ (setadjoin @ X0 @ X0) @ omega)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',omegaSAx)).
% 9.54/1.98 thf(f9,axiom,(
% 9.54/1.98 (! [X0 : $i] : ((! [X1 : $i] : (((in @ X1 @ X0) & (in @ X1 @ omega)) => (in @ (setadjoin @ X1 @ X1) @ X0)) & (in @ emptyset @ X0)) => ! [X1 : $i] : ((in @ X1 @ omega) => (in @ X1 @ X0))) = omegaIndAx)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',omegaIndAx)).
% 9.54/1.98 thf(f11,axiom,(
% 9.54/1.98 (! [X0 : $i] : (? [X1 : $i] : (in @ X1 @ X0) => ? [X2 : $i] : (~ ? [X1 : $i] : ((in @ X1 @ X2) & (in @ X1 @ X0)) & (in @ X2 @ X0))) = foundationAx)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',foundationAx)).
% 9.54/1.98 thf(f14,axiom,(
% 9.54/1.98 (dsetconstrI = ! [X0 : $i,X1 : ($i > $o),X2 : $i] : ((in @ X2 @ X0) => ((X1 @ X2) => (in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : ((X1 @ X3))))))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrI)).
% 9.54/1.98 thf(f15,axiom,(
% 9.54/1.98 (! [X1 : ($i > $o),X2 : $i,X0 : $i] : ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : ((X1 @ X3))))) => (in @ X2 @ X0)) = dsetconstrEL)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrEL)).
% 9.54/1.98 thf(f16,axiom,(
% 9.54/1.98 (dsetconstrER = ! [X0 : $i,X2 : $i,X1 : ($i > $o)] : ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : ((X1 @ X3))))) => (X1 @ X2)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrER)).
% 9.54/1.98 thf(f17,axiom,(
% 9.54/1.98 (! [X0 : ($i > $o)] : ((exu @ (^[X1 : $i] : ((X0 @ X1)))) => ? [X1 : $i] : (! [X2 : $i] : ((X0 @ X2) => (X1 = X2)) & (X0 @ X1))) = exuE1)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',exuE1)).
% 9.54/1.98 thf(f18,axiom,(
% 9.54/1.98 (! [X1 : $i,X0 : $o] : ((in @ X1 @ (prop2set @ X0)) => X0) = prop2setE)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',prop2setE)).
% 9.54/1.98 thf(f20,axiom,(
% 9.54/1.98 (emptysetimpfalse = ! [X0 : $i] : ((in @ X0 @ emptyset) => $false))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetimpfalse)).
% 9.54/1.98 thf(f21,axiom,(
% 9.54/1.98 (! [X0 : $i] : ~(in @ X0 @ emptyset) = notinemptyset)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',notinemptyset)).
% 9.54/1.98 thf(f24,axiom,(
% 9.54/1.98 (! [X0 : $i] : (! [X1 : $i] : ~(in @ X1 @ X0) => (X0 = emptyset)) = emptyI)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptyI)).
% 9.54/1.98 thf(f25,axiom,(
% 9.54/1.98 (! [X0 : $i] : (! [X1 : $i] : ~(in @ X1 @ X0) => (X0 = emptyset)) = noeltsimpempty)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',noeltsimpempty)).
% 9.54/1.98 thf(f26,axiom,(
% 9.54/1.98 (setbeta = ! [X0 : $i,X1 : ($i > $o),X2 : $i] : ((in @ X2 @ X0) => ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : ((X1 @ X3))))) <=> (X1 @ X2))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setbeta)).
% 9.54/1.98 thf(f27,axiom,(
% 9.54/1.98 ((^[X0 : $i] : ((X0 != emptyset))) = nonempty)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonempty)).
% 9.54/1.98 thf(f28,axiom,(
% 9.54/1.98 (nonemptyE1 = ! [X0 : $i] : ((nonempty @ X0) => ? [X1 : $i] : (in @ X1 @ X0)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonemptyE1)).
% 9.54/1.98 thf(f29,axiom,(
% 9.54/1.98 (nonemptyI = ! [X1 : ($i > $o),X2 : $i,X0 : $i] : ((in @ X2 @ X0) => ((X1 @ X2) => (nonempty @ (dsetconstr @ X0 @ (^[X3 : $i] : ((X1 @ X3))))))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonemptyI)).
% 9.54/1.98 thf(f30,axiom,(
% 9.54/1.98 (! [X0 : $i] : (? [X1 : $i] : (in @ X1 @ X0) => (nonempty @ X0)) = nonemptyI1)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonemptyI1)).
% 9.54/1.98 thf(f31,axiom,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (in @ X0 @ (setadjoin @ X0 @ X1)) = setadjoinIL)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinIL)).
% 9.54/1.98 thf(f32,axiom,(
% 9.54/1.98 (emptyinunitempty = ((in @ emptyset @ (setadjoin @ emptyset @ emptyset))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptyinunitempty)).
% 9.54/1.98 thf(f33,axiom,(
% 9.54/1.98 (setadjoinIR = ! [X0 : $i,X2 : $i,X1 : $i] : ((in @ X2 @ X1) => (in @ X2 @ (setadjoin @ X0 @ X1))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinIR)).
% 9.54/1.98 thf(f35,axiom,(
% 9.54/1.98 (setadjoinOr = ! [X0 : $i,X2 : $i,X1 : $i] : ((in @ X2 @ (setadjoin @ X0 @ X1)) => ((in @ X2 @ X1) | (X2 = X0))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinOr)).
% 9.54/1.98 thf(f36,axiom,(
% 9.54/1.98 (! [X0 : $i] : (((dsetconstr @ X0 @ (^[X1 : $i] : ($true)))) = X0) = setoftrueEq)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setoftrueEq)).
% 9.54/1.98 thf(f37,axiom,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (! [X2 : $i] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (in @ X1 @ (powerset @ X0))) = powersetI)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',powersetI)).
% 9.54/1.98 thf(f38,axiom,(
% 9.54/1.98 (emptyinPowerset = ! [X0 : $i] : (in @ emptyset @ (powerset @ X0)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptyinPowerset)).
% 9.54/1.98 thf(f39,axiom,(
% 9.54/1.98 (! [X0 : $i] : (in @ emptyset @ (powerset @ X0)) = emptyInPowerset)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptyInPowerset)).
% 9.54/1.98 thf(f42,axiom,(
% 9.54/1.98 (setunionE = ! [X0 : $i,X1 : $i] : ((in @ X1 @ (setunion @ X0)) => ! [X2 : $o] : (! [X3 : $i] : ((in @ X1 @ X3) => ((in @ X3 @ X0) => X2)) => X2)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionE)).
% 9.54/1.98 thf(f43,axiom,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : ((in @ X1 @ X0) => (in @ X1 @ (powerset @ (setunion @ X0)))) = subPowSU)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subPowSU)).
% 9.54/1.98 thf(f44,axiom,(
% 9.54/1.98 (! [X0 : ($i > $o)] : ((exu @ (^[X1 : $i] : ((X0 @ X1)))) => ? [X1 : $i] : ! [X2 : $i] : ((X0 @ X2) <=> (X2 = X1))) = exuE2)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',exuE2)).
% 9.54/1.98 thf(f45,axiom,(
% 9.54/1.98 (nonemptyImpWitness = ! [X0 : $i] : ((nonempty @ X0) => ? [X1 : $i] : ((in @ X1 @ X0) & $true)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonemptyImpWitness)).
% 9.54/1.98 thf(f46,axiom,(
% 9.54/1.98 (uniqinunit = ! [X0 : $i,X1 : $i] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',uniqinunit)).
% 9.54/1.98 thf(f47,axiom,(
% 9.54/1.98 (! [X1 : $i,X0 : $i] : ((X0 != X1) => ~(in @ X1 @ (setadjoin @ X0 @ emptyset))) = notinsingleton)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',notinsingleton)).
% 9.54/1.98 thf(f48,axiom,(
% 9.54/1.98 (! [X1 : $i,X0 : $i] : ((X0 = X1) => (in @ X0 @ (setadjoin @ X1 @ emptyset))) = eqinunit)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',eqinunit)).
% 9.54/1.98 thf(f49,axiom,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (in @ X1 @ (setadjoin @ X0 @ emptyset))) = singletonsswitch)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',singletonsswitch)).
% 9.54/1.98 thf(f50,axiom,(
% 9.54/1.98 (upairsetE = ! [X0 : $i,X2 : $i,X1 : $i] : ((in @ X2 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) => ((X2 = X1) | (X2 = X0))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairsetE)).
% 9.54/1.98 thf(f51,axiom,(
% 9.54/1.98 (! [X1 : $i,X0 : $i] : (in @ X0 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) = upairsetIL)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairsetIL)).
% 9.54/1.98 thf(f52,axiom,(
% 9.54/1.98 (upairsetIR = ! [X1 : $i,X0 : $i] : (in @ X1 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairsetIR)).
% 9.54/1.98 thf(f54,axiom,(
% 9.54/1.98 (! [X1 : $i,X0 : ($i > $o)] : ((in @ X1 @ emptyset) => (X0 @ X1)) = vacuousDall)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',vacuousDall)).
% 9.54/1.98 thf(f56,axiom,(
% 9.54/1.98 (quantDeMorgan2 = ! [X0 : $i,X1 : ($i > $o)] : (! [X2 : $i] : ((in @ X2 @ X0) => ~(X1 @ X2)) => ~ ? [X2 : $i] : ((X1 @ X2) & (in @ X2 @ X0))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',quantDeMorgan2)).
% 9.54/1.98 thf(f57,axiom,(
% 9.54/1.98 (quantDeMorgan3 = ! [X1 : ($i > $o),X0 : $i] : (~ ? [X2 : $i] : ((X1 @ X2) & (in @ X2 @ X0)) => ! [X2 : $i] : ((in @ X2 @ X0) => ~(X1 @ X2))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',quantDeMorgan3)).
% 9.54/1.98 thf(f61,axiom,(
% 9.54/1.98 (notdexE = ! [X1 : ($i > $o),X0 : $i] : (~ ? [X2 : $i] : ((X1 @ X2) & (in @ X2 @ X0)) => ! [X2 : $i] : ((in @ X2 @ X0) => ~(X1 @ X2))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',notdexE)).
% 9.54/1.98 thf(f64,axiom,(
% 9.54/1.98 (exuI3 = ! [X0 : ($i > $o)] : (? [X1 : $i] : (X0 @ X1) => (! [X2 : $i,X1 : $i] : ((X0 @ X1) => ((X0 @ X2) => (X1 = X2))) => (exu @ (^[X1 : $i] : ((X0 @ X1)))))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',exuI3)).
% 9.54/1.98 thf(f65,axiom,(
% 9.54/1.98 (exuI2 = ! [X0 : ($i > $o)] : (? [X1 : $i] : ! [X2 : $i] : ((X2 = X1) <=> (X0 @ X2)) => (exu @ (^[X1 : $i] : ((X0 @ X1))))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',exuI2)).
% 9.54/1.98 thf(f66,axiom,(
% 9.54/1.98 (inCongP = ! [X1 : $i,X0 : $i] : ((X0 = X1) => ! [X2 : $i,X3 : $i] : ((X2 = X3) => ((in @ X2 @ X0) => (in @ X3 @ X1)))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',inCongP)).
% 9.54/1.98 thf(f70,axiom,(
% 9.54/1.98 (emptyset__Cong = (emptyset = emptyset))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptyset__Cong)).
% 9.54/1.98 thf(f71,axiom,(
% 9.54/1.98 (! [X1 : $i,X0 : $i] : ((X0 = X1) => ! [X2 : $i,X3 : $i] : ((X2 = X3) => (((setadjoin @ X0 @ X2)) = ((setadjoin @ X1 @ X3))))) = setadjoin__Cong)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoin__Cong)).
% 9.54/1.98 thf(f72,axiom,(
% 9.54/1.98 (powerset__Cong = ! [X0 : $i,X1 : $i] : ((X0 = X1) => (((powerset @ X0)) = ((powerset @ X1)))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',powerset__Cong)).
% 9.54/1.98 thf(f74,axiom,(
% 9.54/1.98 ((omega = omega) = omega__Cong)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',omega__Cong)).
% 9.54/1.98 thf(f78,axiom,(
% 9.54/1.98 (subsetI1 = ! [X0 : $i,X1 : $i] : (! [X2 : $i] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (subset @ X0 @ X1)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetI1)).
% 9.54/1.98 thf(f79,axiom,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : ((X0 = X1) => (subset @ X1 @ X0)) = eqimpsubset2)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',eqimpsubset2)).
% 9.54/1.98 thf(f80,axiom,(
% 9.54/1.98 (eqimpsubset1 = ! [X1 : $i,X0 : $i] : ((X0 = X1) => (subset @ X0 @ X1)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',eqimpsubset1)).
% 9.54/1.98 thf(f82,axiom,(
% 9.54/1.98 (emptysetsubset = ! [X0 : $i] : (subset @ emptyset @ X0))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetsubset)).
% 9.54/1.98 thf(f83,axiom,(
% 9.54/1.98 (! [X2 : $i,X1 : $i,X0 : $i] : ((subset @ X0 @ X1) => ((in @ X2 @ X0) => (in @ X2 @ X1))) = subsetE)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetE)).
% 9.54/1.98 thf(f84,axiom,(
% 9.54/1.98 (! [X0 : $i,X2 : $i,X1 : $i] : ((subset @ X0 @ X1) => (~(in @ X2 @ X1) => ~(in @ X2 @ X0))) = subsetE2)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetE2)).
% 9.54/1.98 thf(f88,axiom,(
% 9.54/1.98 (subsetRefl = ! [X0 : $i] : (subset @ X0 @ X0))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetRefl)).
% 9.54/1.98 thf(f89,axiom,(
% 9.54/1.98 (subsetTrans = ! [X1 : $i,X2 : $i,X0 : $i] : ((subset @ X0 @ X1) => ((subset @ X1 @ X2) => (subset @ X0 @ X2))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetTrans)).
% 9.54/1.98 thf(f90,axiom,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (subset @ X1 @ (setadjoin @ X0 @ X1)) = setadjoinSub)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinSub)).
% 9.54/1.98 thf(f91,axiom,(
% 9.54/1.98 (! [X2 : $i,X0 : $i,X1 : $i] : ((subset @ X0 @ X2) => (subset @ X0 @ (setadjoin @ X1 @ X2))) = setadjoinSub2)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinSub2)).
% 9.54/1.98 thf(f92,axiom,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : ((subset @ X0 @ X1) => (in @ X0 @ (powerset @ X1))) = subset2powerset)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset2powerset)).
% 9.54/1.98 thf(f94,axiom,(
% 9.54/1.98 (subsetemptysetimpeq = ! [X0 : $i] : ((subset @ X0 @ emptyset) => (X0 = emptyset)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetemptysetimpeq)).
% 9.54/1.98 thf(f97,axiom,(
% 9.54/1.98 (inPowerset = ! [X0 : $i] : (in @ X0 @ (powerset @ X0)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',inPowerset)).
% 9.54/1.98 thf(f98,axiom,(
% 9.54/1.98 (powersetsubset = ! [X1 : $i,X0 : $i] : ((subset @ X0 @ X1) => (subset @ (powerset @ X0) @ (powerset @ X1))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',powersetsubset)).
% 9.54/1.98 thf(f99,axiom,(
% 9.54/1.98 (sepInPowerset = ! [X0 : $i,X1 : ($i > $o)] : (in @ (dsetconstr @ X0 @ (^[X2 : $i] : ((X1 @ X2)))) @ (powerset @ X0)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',sepInPowerset)).
% 9.54/1.98 thf(f100,axiom,(
% 9.54/1.98 (! [X1 : ($i > $o),X0 : $i] : (subset @ (dsetconstr @ X0 @ (^[X2 : $i] : ((X1 @ X2)))) @ X0) = sepSubset)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',sepSubset)).
% 9.54/1.98 thf(f102,axiom,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (in @ X1 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) = upairset2IR)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairset2IR)).
% 9.54/1.98 thf(f105,axiom,(
% 9.54/1.98 (! [X2 : $i,X1 : $i,X0 : $i] : ((in @ X2 @ (binunion @ X0 @ X1)) => ((in @ X2 @ X1) | (in @ X2 @ X0))) = binunionE)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binunionE)).
% 9.54/1.98 thf(f106,axiom,(
% 9.54/1.98 (! [X1 : $i,X0 : $i] : (subset @ X0 @ (binunion @ X0 @ X1)) = binunionLsub)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binunionLsub)).
% 9.54/1.98 thf(f107,axiom,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (subset @ X1 @ (binunion @ X0 @ X1)) = binunionRsub)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binunionRsub)).
% 9.54/1.98 thf(f108,axiom,(
% 9.54/1.98 (! [X1 : $i,X2 : $i,X0 : $i] : ((in @ X2 @ X0) => ((in @ X2 @ X1) => (in @ X2 @ (binintersect @ X0 @ X1)))) = binintersectI)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectI)).
% 9.54/1.98 thf(f110,axiom,(
% 9.54/1.98 (binintersectEL = ! [X0 : $i,X2 : $i,X1 : $i] : ((in @ X2 @ (binintersect @ X0 @ X1)) => (in @ X2 @ X0)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectEL)).
% 9.54/1.98 thf(f111,axiom,(
% 9.54/1.98 (binintersectLsub = ! [X0 : $i,X1 : $i] : (subset @ (binintersect @ X0 @ X1) @ X0))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectLsub)).
% 9.54/1.98 thf(f113,axiom,(
% 9.54/1.98 (binintersectSubset3 = ! [X0 : $i,X1 : $i] : ((((binintersect @ X0 @ X1)) = X1) => (subset @ X1 @ X0)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectSubset3)).
% 9.54/1.98 thf(f116,axiom,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (subset @ (binintersect @ X0 @ X1) @ X1) = binintersectRsub)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectRsub)).
% 9.54/1.98 thf(f117,axiom,(
% 9.54/1.98 (binintersectSubset4 = ! [X1 : $i,X0 : $i] : ((subset @ X1 @ X0) => (((binintersect @ X0 @ X1)) = X1)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectSubset4)).
% 9.54/1.98 thf(f118,axiom,(
% 9.54/1.98 (binintersectSubset1 = ! [X0 : $i,X1 : $i] : ((((binintersect @ X0 @ X1)) = X0) => (subset @ X0 @ X1)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectSubset1)).
% 9.54/1.98 thf(f119,axiom,(
% 9.54/1.98 (! [X1 : $i,X0 : $i,X2 : $i] : (((binintersect @ X0 @ (binunion @ X1 @ X2))) = ((binunion @ (binintersect @ X0 @ X1) @ (binintersect @ X0 @ X2)))) = bs114d)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',bs114d)).
% 9.54/1.98 thf(f120,axiom,(
% 9.54/1.98 (setminusI = ! [X2 : $i,X0 : $i,X1 : $i] : ((in @ X2 @ X0) => (~(in @ X2 @ X1) => (in @ X2 @ (setminus @ X0 @ X1)))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusI)).
% 9.54/1.98 thf(f122,axiom,(
% 9.54/1.98 (! [X1 : $i,X0 : $i,X2 : $i] : ((in @ X2 @ (setminus @ X0 @ X1)) => ~(in @ X2 @ X1)) = setminusER)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusER)).
% 9.54/1.98 thf(f124,axiom,(
% 9.54/1.98 (! [X0 : $i,X1 : $i,X2 : $i] : (~(in @ X2 @ (setminus @ X0 @ X1)) => ((in @ X2 @ X0) => (in @ X2 @ X1))) = setminusERneg)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusERneg)).
% 9.54/1.98 thf(f126,axiom,(
% 9.54/1.98 (setminusILneg = ! [X1 : $i,X2 : $i,X0 : $i] : (~(in @ X2 @ X0) => ~(in @ X2 @ (setminus @ X0 @ X1))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusILneg)).
% 9.54/1.98 thf(f128,axiom,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (subset @ (setminus @ X0 @ X1) @ X0) = setminusLsub)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusLsub)).
% 9.54/1.98 thf(f129,axiom,(
% 9.54/1.98 (setminusSubset1 = ! [X0 : $i,X1 : $i] : ((((setminus @ X0 @ X1)) = emptyset) => (subset @ X0 @ X1)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusSubset1)).
% 9.54/1.98 thf(f133,axiom,(
% 9.54/1.98 (symdiffIneg1 = ! [X2 : $i,X0 : $i,X1 : $i] : ((in @ X2 @ X0) => ((in @ X2 @ X1) => ~(in @ X2 @ (symdiff @ X0 @ X1)))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',symdiffIneg1)).
% 9.54/1.98 thf(f135,axiom,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (in @ X1 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) = secondinupair)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',secondinupair)).
% 9.54/1.98 thf(f137,axiom,(
% 9.54/1.98 (setukpairIR = ! [X0 : $i,X1 : $i] : (in @ X1 @ (setunion @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairIR)).
% 9.54/1.98 thf(f138,axiom,(
% 9.54/1.98 (kpairiskpair = ! [X0 : $i,X1 : $i] : (iskpair @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',kpairiskpair)).
% 9.54/1.98 thf(f139,axiom,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (iskpair @ (kpair @ X0 @ X1)) = kpairp)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',kpairp)).
% 9.54/1.98 thf(f141,axiom,(
% 9.54/1.98 (singletoninpowerset = ! [X0 : $i,X1 : $i] : ((in @ X1 @ X0) => (in @ (setadjoin @ X1 @ emptyset) @ (powerset @ X0))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',singletoninpowerset)).
% 9.54/1.98 thf(f143,axiom,(
% 9.54/1.98 (upairset2E = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X2 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) => ((X2 = X1) | (X2 = X0))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairset2E)).
% 9.54/1.98 thf(f146,axiom,(
% 9.54/1.98 (ubforcartprodlem1 = ! [X0 : $i,X2 : $i,X1 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X1) => (subset @ (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ X0 @ X1))))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ubforcartprodlem1)).
% 9.54/1.98 thf(f148,axiom,(
% 9.54/1.98 (ubforcartprodlem3 = ! [X2 : $i,X0 : $i,X1 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X1) => (in @ (kpair @ X2 @ X3) @ (powerset @ (powerset @ (binunion @ X0 @ X1)))))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ubforcartprodlem3)).
% 9.54/1.98 thf(f151,axiom,(
% 9.54/1.98 (cartprodmempair = ! [X2 : $i,X0 : $i,X1 : $i] : ((in @ X2 @ (cartprod @ X0 @ X1)) => (iskpair @ X2)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartprodmempair)).
% 9.54/1.98 thf(f152,axiom,(
% 9.54/1.98 (setunionE2 = ! [X1 : $i,X0 : $i] : ((in @ X1 @ (setunion @ X0)) => ? [X2 : $i] : ((in @ X2 @ X0) & (in @ X1 @ X2))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionE2)).
% 9.54/1.98 thf(f153,axiom,(
% 9.54/1.98 (setunionsingleton1 = ! [X0 : $i] : (subset @ (setunion @ (setadjoin @ X0 @ emptyset)) @ X0))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionsingleton1)).
% 9.54/1.98 thf(f155,axiom,(
% 9.54/1.98 (setunionsingleton = ! [X0 : $i] : (((setunion @ (setadjoin @ X0 @ emptyset))) = X0))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionsingleton)).
% 9.54/1.98 thf(f156,axiom,(
% 9.54/1.98 (singleton = (^[X0 : $i] : (? [X1 : $i] : ((X0 = ((setadjoin @ X1 @ emptyset))) & (in @ X1 @ X0)))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton)).
% 9.54/1.98 thf(f158,axiom,(
% 9.54/1.98 (ex1 = (^[X0 : $i, X1 : ($i > $o)] : ((singleton @ (dsetconstr @ X0 @ (^[X2 : $i] : ((X1 @ X2))))))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ex1)).
% 9.54/1.98 thf(f159,axiom,(
% 9.54/1.98 (ex1E1 = ! [X0 : $i,X1 : ($i > $o)] : ((ex1 @ X0 @ (^[X2 : $i] : ((X1 @ X2)))) => ? [X2 : $i] : ((in @ X2 @ X0) & (X1 @ X2))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ex1E1)).
% 9.54/1.98 thf(f162,axiom,(
% 9.54/1.98 (singletonsuniq = ! [X0 : $i,X1 : $i] : ((((setadjoin @ X0 @ emptyset)) = ((setadjoin @ X1 @ emptyset))) => (X0 = X1)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',singletonsuniq)).
% 9.54/1.98 thf(f163,axiom,(
% 9.54/1.98 (setukpairinjL1 = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) => (X0 = X2)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairinjL1)).
% 9.54/1.98 thf(f165,axiom,(
% 9.54/1.98 (! [X0 : $i] : ((singleton @ X0) => (in @ (setunion @ X0) @ X0)) = theprop)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',theprop)).
% 9.54/1.98 thf(f166,axiom,(
% 9.54/1.98 (kfstpairEq = ! [X0 : $i,X1 : $i] : (((kfst @ (kpair @ X0 @ X1))) = X0))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',kfstpairEq)).
% 9.54/1.98 thf(f167,axiom,(
% 9.54/1.98 (cartprodfstin = ! [X1 : $i,X2 : $i,X0 : $i] : ((in @ X2 @ (cartprod @ X0 @ X1)) => (in @ (kfst @ X2) @ X0)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartprodfstin)).
% 9.54/1.98 thf(f170,axiom,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : ((X0 = X1) => (((setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) = ((setadjoin @ X0 @ emptyset)))) = setukpairinjR11)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairinjR11)).
% 9.54/1.98 thf(f173,axiom,(
% 9.54/1.98 (upairequniteq = ! [X1 : $i,X2 : $i,X0 : $i] : ((((setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) = ((setadjoin @ X2 @ emptyset))) => (X0 = X1)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairequniteq)).
% 9.54/1.98 thf(f179,axiom,(
% 9.54/1.98 (cartprodsndin = ! [X0 : $i,X2 : $i,X1 : $i] : ((in @ X2 @ (cartprod @ X0 @ X1)) => (in @ (ksnd @ X2) @ X1)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartprodsndin)).
% 9.54/1.98 thf(f181,axiom,(
% 9.54/1.98 (cartprodpairmemER = ! [X3 : $i,X0 : $i,X2 : $i,X1 : $i] : ((in @ (kpair @ X2 @ X3) @ (cartprod @ X0 @ X1)) => (in @ X3 @ X1)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartprodpairmemER)).
% 9.54/1.98 thf(f182,axiom,(
% 9.54/1.98 (cartprodmempaircEq = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X1) => (((kpair @ X2 @ X3)) = ((kpair @ X2 @ X3))))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartprodmempaircEq)).
% 9.54/1.98 thf(f183,axiom,(
% 9.54/1.98 (! [X2 : $i,X1 : $i,X0 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X1) => (((kfst @ (kpair @ X2 @ X3))) = X2))) = cartprodfstpairEq)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartprodfstpairEq)).
% 9.54/1.98 thf(f184,axiom,(
% 9.54/1.98 (! [X2 : $i,X1 : $i,X0 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X1) => (((ksnd @ (kpair @ X2 @ X3))) = X3))) = cartprodsndpairEq)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartprodsndpairEq)).
% 9.54/1.98 thf(f185,axiom,(
% 9.54/1.98 (cartprodpairsurjEq = ! [X1 : $i,X0 : $i,X2 : $i] : ((in @ X2 @ (cartprod @ X0 @ X1)) => (((kpair @ (kfst @ X2) @ (ksnd @ X2))) = X2)))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartprodpairsurjEq)).
% 9.54/1.98 thf(f186,axiom,(
% 9.54/1.98 ((^[X0 : $i, X1 : $i, X2 : $i] : ((subset @ X2 @ (cartprod @ X0 @ X1)))) = breln)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln)).
% 9.54/1.98 thf(f188,axiom,(
% 9.54/1.98 (! [X0 : $i,X2 : ($i > $i > $o),X1 : $i] : (subset @ (dpsetconstr @ X0 @ X1 @ (^[X3 : $i, X4 : $i] : ((X2 @ X3 @ X4)))) @ (cartprod @ X0 @ X1)) = dpsetconstrSub)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',dpsetconstrSub)).
% 9.54/1.98 thf(f194,axiom,(
% 9.54/1.98 (func = (^[X0 : $i, X1 : $i, X2 : $i] : (! [X3 : $i] : ((in @ X3 @ X0) => (ex1 @ X1 @ (^[X4 : $i] : ((in @ (kpair @ X3 @ X4) @ X2))))) & (breln @ X0 @ X1 @ X2))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',func)).
% 9.54/1.98 thf(f197,axiom,(
% 9.54/1.98 (! [X1 : $i,X0 : $i,X2 : $i] : ((func @ X0 @ X1 @ X2) => ! [X3 : $i] : ((in @ X3 @ X0) => (in @ (setunion @ (dsetconstr @ X1 @ (^[X4 : $i] : ((in @ (kpair @ X3 @ X4) @ X2))))) @ X1))) = apProp)),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',apProp)).
% 9.54/1.98 thf(f198,axiom,(
% 9.54/1.98 (ap = (^[X0 : $i, X1 : $i, X2 : $i, X3 : $i] : ((setunion @ (dsetconstr @ X1 @ (^[X4 : $i] : ((in @ (kpair @ X3 @ X4) @ X2))))))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap)).
% 9.54/1.98 thf(f199,conjecture,(
% 9.54/1.98 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 => (binunionIL => (upairset2IR => (binunionIR => (binunionEcases => (binunionE => (binunionLsub => (binunionRsub => (binintersectI => (binintersectSubset5 => (binintersectEL => (binintersectLsub => (binintersectSubset2 => (binintersectSubset3 => (binintersectER => (disjointsetsI1 => (binintersectRsub => (binintersectSubset4 => (binintersectSubset1 => (bs114d => (setminusI => (setminusEL => (setminusER => (setminusSubset2 => (setminusERneg => (setminusELneg => (setminusILneg => (setminusIRneg => (setminusLsub => (setminusSubset1 => (symdiffE => (symdiffI1 => (symdiffI2 => (symdiffIneg1 => (symdiffIneg2 => (secondinupair => (setukpairIL => (setukpairIR => (kpairiskpair => (kpairp => (singletonsubset => (singletoninpowerset => (singletoninpowunion => (upairset2E => (upairsubunion => (upairinpowunion => (ubforcartprodlem1 => (ubforcartprodlem2 => (ubforcartprodlem3 => (cartprodpairin => (cartprodmempair1 => (cartprodmempair => (setunionE2 => (setunionsingleton1 => (setunionsingleton2 => (setunionsingleton => (singletonprop => (ex1E1 => (ex1I => (ex1I2 => (singletonsuniq => (setukpairinjL1 => (kfstsingleton => (theprop => (kfstpairEq => (cartprodfstin => (setukpairinjL2 => (setukpairinjL => (setukpairinjR11 => (setukpairinjR12 => (setukpairinjR1 => (upairequniteq => (setukpairinjR2 => (setukpairinjR => (ksndsingleton => (ksndpairEq => (kpairsurjEq => (cartprodsndin => (cartprodpairmemEL => (cartprodpairmemER => (cartprodmempaircEq => (cartprodfstpairEq => (cartprodsndpairEq => (cartprodpairsurjEq => (dpsetconstrI => (dpsetconstrSub => (setOfPairsIsBReln => (dpsetconstrERa => (dpsetconstrEL1 => (dpsetconstrEL2 => (dpsetconstrER => (funcImageSingleton => (apProp => ! [X1 : $i,X0 : $i,X2 : $i] : ((func @ X0 @ X1 @ X2) => ! [X3 : $i] : ((in @ X3 @ X0) => (in @ (ap @ X0 @ X1 @ X2 @ X3) @ X1))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),
% 9.54/1.98 file('/export/starexec/sandbox/benchmark/theBenchmark.p',app)).
% 9.54/1.98 thf(f200,negated_conjecture,(
% 9.54/1.98 ~(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 => (binunionIL => (upairset2IR => (binunionIR => (binunionEcases => (binunionE => (binunionLsub => (binunionRsub => (binintersectI => (binintersectSubset5 => (binintersectEL => (binintersectLsub => (binintersectSubset2 => (binintersectSubset3 => (binintersectER => (disjointsetsI1 => (binintersectRsub => (binintersectSubset4 => (binintersectSubset1 => (bs114d => (setminusI => (setminusEL => (setminusER => (setminusSubset2 => (setminusERneg => (setminusELneg => (setminusILneg => (setminusIRneg => (setminusLsub => (setminusSubset1 => (symdiffE => (symdiffI1 => (symdiffI2 => (symdiffIneg1 => (symdiffIneg2 => (secondinupair => (setukpairIL => (setukpairIR => (kpairiskpair => (kpairp => (singletonsubset => (singletoninpowerset => (singletoninpowunion => (upairset2E => (upairsubunion => (upairinpowunion => (ubforcartprodlem1 => (ubforcartprodlem2 => (ubforcartprodlem3 => (cartprodpairin => (cartprodmempair1 => (cartprodmempair => (setunionE2 => (setunionsingleton1 => (setunionsingleton2 => (setunionsingleton => (singletonprop => (ex1E1 => (ex1I => (ex1I2 => (singletonsuniq => (setukpairinjL1 => (kfstsingleton => (theprop => (kfstpairEq => (cartprodfstin => (setukpairinjL2 => (setukpairinjL => (setukpairinjR11 => (setukpairinjR12 => (setukpairinjR1 => (upairequniteq => (setukpairinjR2 => (setukpairinjR => (ksndsingleton => (ksndpairEq => (kpairsurjEq => (cartprodsndin => (cartprodpairmemEL => (cartprodpairmemER => (cartprodmempaircEq => (cartprodfstpairEq => (cartprodsndpairEq => (cartprodpairsurjEq => (dpsetconstrI => (dpsetconstrSub => (setOfPairsIsBReln => (dpsetconstrERa => (dpsetconstrEL1 => (dpsetconstrEL2 => (dpsetconstrER => (funcImageSingleton => (apProp => ! [X1 : $i,X0 : $i,X2 : $i] : ((func @ X0 @ X1 @ X2) => ! [X3 : $i] : ((in @ X3 @ X0) => (in @ (ap @ X0 @ X1 @ X2 @ X3) @ X1)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),
% 9.54/1.98 inference(negated_conjecture,[status(cth)],[f199])).
% 9.54/1.98 thf(f201,plain,(
% 9.54/1.98 (symdiffIneg1 = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X0 @ X1) => ((in @ X0 @ X2) => ~(in @ X0 @ (symdiff @ X1 @ X2)))))),
% 9.54/1.98 inference(rectify,[],[f133])).
% 9.54/1.98 thf(f202,plain,(
% 9.54/1.98 (symdiffIneg1 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => ((in @ Y2 @ Y0) => (~ (in @ Y2 @ (symdiff @ Y1 @ Y0)))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f201])).
% 9.54/1.98 thf(f205,plain,(
% 9.54/1.98 (singleton = (^[X0 : $i] : (? [X1 : $i] : ((X0 = ((setadjoin @ X1 @ emptyset))) & (in @ X1 @ X0)))))),
% 9.54/1.98 inference(rectify,[],[f156])).
% 9.54/1.98 thf(f206,plain,(
% 9.54/1.98 (singleton = (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))))),
% 9.54/1.98 inference(fool_elimination,[],[f205])).
% 9.54/1.98 thf(f209,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X0 @ (binunion @ X2 @ X1)) => ((in @ X0 @ X1) | (in @ X0 @ X2))) = binunionE)),
% 9.54/1.98 inference(rectify,[],[f105])).
% 9.54/1.98 thf(f210,plain,(
% 9.54/1.98 (binunionE = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (binunion @ Y0 @ Y1)) => ((in @ Y2 @ Y0) | (in @ Y2 @ Y1)))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f209])).
% 9.54/1.98 thf(f211,plain,(
% 9.54/1.98 (ubforcartprodlem3 = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X0 @ X1) => ! [X3 : $i] : ((in @ X3 @ X2) => (in @ (kpair @ X0 @ X3) @ (powerset @ (powerset @ (binunion @ X1 @ X2)))))))),
% 9.54/1.98 inference(rectify,[],[f148])).
% 9.54/1.98 thf(f212,plain,(
% 9.54/1.98 (ubforcartprodlem3 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => (in @ (kpair @ Y2 @ Y3) @ (powerset @ (powerset @ (binunion @ Y1 @ Y0))))))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f211])).
% 9.54/1.98 thf(f213,plain,(
% 9.54/1.98 (! [X0 : ($i > $o),X1 : $i] : (subset @ (dsetconstr @ X1 @ (^[X2 : $i] : ((X0 @ X2)))) @ X1) = sepSubset)),
% 9.54/1.98 inference(rectify,[],[f100])).
% 9.54/1.98 thf(f214,plain,(
% 9.54/1.98 (sepSubset = ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (subset @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (Y1 @ Y2))) @ Y0)))))))),
% 9.54/1.98 inference(fool_elimination,[],[f213])).
% 9.54/1.98 thf(f217,plain,(
% 9.54/1.98 (setukpairinjR11 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => ((setadjoin @ Y1 @ emptyset) = (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f170])).
% 9.54/1.98 thf(f218,plain,(
% 9.54/1.98 (binintersectSubset3 = ! [X0 : $i,X1 : $i] : ((((binintersect @ X0 @ X1)) = X1) => (subset @ X1 @ X0)))),
% 9.54/1.98 inference(rectify,[],[f113])).
% 9.54/1.98 thf(f219,plain,(
% 9.54/1.98 (binintersectSubset3 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((binintersect @ Y1 @ Y0) = Y0) => (subset @ Y0 @ Y1))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f218])).
% 9.54/1.98 thf(f220,plain,(
% 9.54/1.98 (singletoninpowerset = ! [X0 : $i,X1 : $i] : ((in @ X1 @ X0) => (in @ (setadjoin @ X1 @ emptyset) @ (powerset @ X0))))),
% 9.54/1.98 inference(rectify,[],[f141])).
% 9.54/1.98 thf(f221,plain,(
% 9.54/1.98 (singletoninpowerset = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ Y1) => (in @ (setadjoin @ Y0 @ emptyset) @ (powerset @ Y1)))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f220])).
% 9.54/1.98 thf(f222,plain,(
% 9.54/1.98 (quantDeMorgan2 = ! [X0 : $i,X1 : ($i > $o)] : (! [X2 : $i] : ((in @ X2 @ X0) => ~(X1 @ X2)) => ~ ? [X3 : $i] : ((X1 @ X3) & (in @ X3 @ X0))))),
% 9.54/1.98 inference(rectify,[],[f56])).
% 9.54/1.98 thf(f223,plain,(
% 9.54/1.98 (quantDeMorgan2 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (~ (Y0 @ Y2))))) => (~ (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) & (Y0 @ Y2))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f222])).
% 9.54/1.98 thf(f224,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i,X2 : $i] : ((subset @ X0 @ X2) => (~(in @ X1 @ X2) => ~(in @ X1 @ X0))) = subsetE2)),
% 9.54/1.98 inference(rectify,[],[f84])).
% 9.54/1.98 thf(f225,plain,(
% 9.54/1.98 (subsetE2 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y2 @ Y0) => ((~ (in @ Y1 @ Y0)) => (~ (in @ Y1 @ Y2))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f224])).
% 9.54/1.98 thf(f228,plain,(
% 9.54/1.98 (emptysetAx = ! [X0 : $i] : ~(in @ X0 @ emptyset))),
% 9.54/1.98 inference(rectify,[],[f3])).
% 9.54/1.98 thf(f229,plain,(
% 9.54/1.98 (emptysetAx = ((!! @ $i @ (^[Y0 : $i]: (~ (in @ Y0 @ emptyset))))))),
% 9.54/1.98 inference(fool_elimination,[],[f228])).
% 9.54/1.98 thf(f238,plain,(
% 9.54/1.98 (! [X0 : $i] : (in @ emptyset @ (powerset @ X0)) = emptyInPowerset)),
% 9.54/1.98 inference(rectify,[],[f39])).
% 9.54/1.98 thf(f239,plain,(
% 9.54/1.98 (emptyInPowerset = ((!! @ $i @ (^[Y0 : $i]: (in @ emptyset @ (powerset @ Y0))))))),
% 9.54/1.98 inference(fool_elimination,[],[f238])).
% 9.54/1.98 thf(f240,plain,(
% 9.54/1.98 (exu = (^[X0 : ($i > $o)] : (? [X1 : $i] : (! [X2 : $i] : ((X0 @ X2) => (X1 = X2)) & (X0 @ X1)))))),
% 9.54/1.98 inference(rectify,[],[f1])).
% 9.54/1.98 thf(f241,plain,(
% 9.54/1.98 (exu = (^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2)))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f240])).
% 9.54/1.98 thf(f242,plain,(
% 9.54/1.98 (ap = (^[X0 : $i, X1 : $i, X2 : $i, X3 : $i] : ((setunion @ (dsetconstr @ X1 @ (^[X4 : $i] : ((in @ (kpair @ X3 @ X4) @ X2))))))))),
% 9.54/1.98 inference(rectify,[],[f198])).
% 9.54/1.98 thf(f243,plain,(
% 9.54/1.98 (ap = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((^[Y3 : $i]: (setunion @ (dsetconstr @ Y1 @ (^[Y4 : $i]: (in @ (kpair @ Y3 @ Y4) @ Y2))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f242])).
% 9.54/1.98 thf(f244,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : ((in @ X1 @ X0) => (in @ X1 @ (powerset @ (setunion @ X0)))) = subPowSU)),
% 9.54/1.98 inference(rectify,[],[f43])).
% 9.54/1.98 thf(f245,plain,(
% 9.54/1.98 (subPowSU = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ Y1) => (in @ Y0 @ (powerset @ (setunion @ Y1))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f244])).
% 9.54/1.98 thf(f250,plain,(
% 9.54/1.98 (subsetemptysetimpeq = ! [X0 : $i] : ((subset @ X0 @ emptyset) => (X0 = emptyset)))),
% 9.54/1.98 inference(rectify,[],[f94])).
% 9.54/1.98 thf(f251,plain,(
% 9.54/1.98 (subsetemptysetimpeq = ((!! @ $i @ (^[Y0 : $i]: ((subset @ Y0 @ emptyset) => (emptyset = Y0))))))),
% 9.54/1.98 inference(fool_elimination,[],[f250])).
% 9.54/1.98 thf(f252,plain,(
% 9.54/1.98 (dsetconstrI = ! [X0 : $i,X1 : ($i > $o),X2 : $i] : ((in @ X2 @ X0) => ((X1 @ X2) => (in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : ((X1 @ X3))))))))),
% 9.54/1.98 inference(rectify,[],[f14])).
% 9.54/1.98 thf(f253,plain,(
% 9.54/1.98 (dsetconstrI = ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((Y1 @ Y0) => (in @ Y0 @ (dsetconstr @ Y2 @ (^[Y3 : $i]: (Y1 @ Y3))))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f252])).
% 9.54/1.98 thf(f260,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : ((in @ X0 @ (setunion @ X1)) <=> ? [X2 : $i] : ((in @ X2 @ X1) & (in @ X0 @ X2))) = setunionAx)),
% 9.54/1.98 inference(rectify,[],[f6])).
% 9.54/1.98 thf(f261,plain,(
% 9.54/1.98 (setunionAx = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setunion @ Y0)) = (?? @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) & (in @ Y2 @ Y0)))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f260])).
% 9.54/1.98 thf(f266,plain,(
% 9.54/1.98 (! [X0 : $i] : ~(in @ X0 @ emptyset) = notinemptyset)),
% 9.54/1.98 inference(rectify,[],[f21])).
% 9.54/1.98 thf(f267,plain,(
% 9.54/1.98 (notinemptyset = ((!! @ $i @ (^[Y0 : $i]: (~ (in @ Y0 @ emptyset))))))),
% 9.54/1.98 inference(fool_elimination,[],[f266])).
% 9.54/1.98 thf(f268,plain,(
% 9.54/1.98 (ex1E1 = ! [X0 : $i,X1 : ($i > $o)] : ((ex1 @ X0 @ (^[X2 : $i] : ((X1 @ X2)))) => ? [X3 : $i] : ((in @ X3 @ X0) & (X1 @ X3))))),
% 9.54/1.98 inference(rectify,[],[f159])).
% 9.54/1.98 thf(f269,plain,(
% 9.54/1.98 (ex1E1 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((ex1 @ Y1 @ (^[Y2 : $i]: (Y0 @ Y2))) => (?? @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) & (in @ Y2 @ Y1)))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f268])).
% 9.54/1.98 thf(f270,plain,(
% 9.54/1.98 (emptyinPowerset = ! [X0 : $i] : (in @ emptyset @ (powerset @ X0)))),
% 9.54/1.98 inference(rectify,[],[f38])).
% 9.54/1.98 thf(f271,plain,(
% 9.54/1.98 (emptyinPowerset = ((!! @ $i @ (^[Y0 : $i]: (in @ emptyset @ (powerset @ Y0))))))),
% 9.54/1.98 inference(fool_elimination,[],[f270])).
% 9.54/1.98 thf(f272,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (in @ X1 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) = upairset2IR)),
% 9.54/1.98 inference(rectify,[],[f102])).
% 9.54/1.98 thf(f273,plain,(
% 9.54/1.98 (upairset2IR = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y0 @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset)))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f272])).
% 9.54/1.98 thf(f280,plain,(
% 9.54/1.98 (cartprodpairmemER = ! [X0 : $i,X1 : $i,X2 : $i,X3 : $i] : ((in @ (kpair @ X2 @ X0) @ (cartprod @ X1 @ X3)) => (in @ X0 @ X3)))),
% 9.54/1.98 inference(rectify,[],[f181])).
% 9.54/1.98 thf(f281,plain,(
% 9.54/1.98 (cartprodpairmemER = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((in @ (kpair @ Y1 @ Y3) @ (cartprod @ Y2 @ Y0)) => (in @ Y3 @ Y0))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f280])).
% 9.54/1.98 thf(f288,plain,(
% 9.54/1.98 (binintersectSubset1 = ! [X0 : $i,X1 : $i] : ((((binintersect @ X0 @ X1)) = X0) => (subset @ X0 @ X1)))),
% 9.54/1.98 inference(rectify,[],[f118])).
% 9.54/1.98 thf(f289,plain,(
% 9.54/1.98 (binintersectSubset1 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((binintersect @ Y1 @ Y0) = Y1) => (subset @ Y1 @ Y0))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f288])).
% 9.54/1.98 thf(f292,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (! [X2 : $i] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (in @ X1 @ (powerset @ X0))) = powersetI)),
% 9.54/1.98 inference(rectify,[],[f37])).
% 9.54/1.98 thf(f293,plain,(
% 9.54/1.98 (powersetI = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (in @ Y2 @ Y1)))) => (in @ Y0 @ (powerset @ Y1)))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f292])).
% 9.54/1.98 thf(f294,plain,(
% 9.54/1.98 (upairsetE = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X1 @ (setadjoin @ X0 @ (setadjoin @ X2 @ emptyset))) => ((X2 = X1) | (X0 = X1))))),
% 9.54/1.98 inference(rectify,[],[f50])).
% 9.54/1.98 thf(f295,plain,(
% 9.54/1.98 (upairsetE = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setadjoin @ Y2 @ (setadjoin @ Y0 @ emptyset))) => ((Y2 = Y1) | (Y1 = Y0)))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f294])).
% 9.54/1.98 thf(f296,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : ($i > $i > $o),X2 : $i] : (subset @ (dpsetconstr @ X0 @ X2 @ (^[X3 : $i, X4 : $i] : ((X1 @ X3 @ X4)))) @ (cartprod @ X0 @ X2)) = dpsetconstrSub)),
% 9.54/1.98 inference(rectify,[],[f188])).
% 9.54/1.98 thf(f297,plain,(
% 9.54/1.98 (dpsetconstrSub = ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $i > $o) @ (^[Y1 : $i > $i > $o]: (!! @ $i @ (^[Y2 : $i]: (subset @ (dpsetconstr @ Y2 @ Y0 @ (^[Y3 : $i]: ((^[Y4 : $i]: (Y1 @ Y3 @ Y4))))) @ (cartprod @ Y2 @ Y0))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f296])).
% 9.54/1.98 thf(f300,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (in @ X0 @ (setadjoin @ X0 @ X1)) = setadjoinIL)),
% 9.54/1.98 inference(rectify,[],[f31])).
% 9.54/1.98 thf(f301,plain,(
% 9.54/1.98 (setadjoinIL = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ Y0))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f300])).
% 9.54/1.98 thf(f302,plain,(
% 9.54/1.98 (setminusILneg = ! [X0 : $i,X1 : $i,X2 : $i] : (~(in @ X1 @ X2) => ~(in @ X1 @ (setminus @ X2 @ X0))))),
% 9.54/1.98 inference(rectify,[],[f126])).
% 9.54/1.98 thf(f303,plain,(
% 9.54/1.98 (setminusILneg = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (in @ Y1 @ Y0)) => (~ (in @ Y1 @ (setminus @ Y0 @ Y2))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f302])).
% 9.54/1.98 thf(f305,plain,(
% 9.54/1.98 (cartprodpairsurjEq = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X2 @ (cartprod @ X1 @ X0)) => (((kpair @ (kfst @ X2) @ (ksnd @ X2))) = X2)))),
% 9.54/1.98 inference(rectify,[],[f185])).
% 9.54/1.98 thf(f306,plain,(
% 9.54/1.98 (cartprodpairsurjEq = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (cartprod @ Y1 @ Y2)) => ((kpair @ (kfst @ Y0) @ (ksnd @ Y0)) = Y0))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f305])).
% 9.54/1.98 thf(f307,plain,(
% 9.54/1.98 (emptysetimpfalse = ! [X0 : $i] : ((in @ X0 @ emptyset) => $false))),
% 9.54/1.98 inference(rectify,[],[f20])).
% 9.54/1.98 thf(f308,plain,(
% 9.54/1.98 (emptysetimpfalse = ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ emptyset) => $false)))))),
% 9.54/1.98 inference(fool_elimination,[],[f307])).
% 9.54/1.98 thf(f309,plain,(
% 9.54/1.98 (setextAx = ! [X0 : $i,X1 : $i] : (! [X2 : $i] : ((in @ X2 @ X0) <=> (in @ X2 @ X1)) => (X0 = X1)))),
% 9.54/1.98 inference(rectify,[],[f2])).
% 9.54/1.98 thf(f310,plain,(
% 9.54/1.98 (setextAx = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) = (in @ Y2 @ Y0)))) => (Y1 = Y0))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f309])).
% 9.54/1.98 thf(f311,plain,(
% 9.54/1.98 (notdexE = ! [X0 : ($i > $o),X1 : $i] : (~ ? [X2 : $i] : ((X0 @ X2) & (in @ X2 @ X1)) => ! [X3 : $i] : ((in @ X3 @ X1) => ~(X0 @ X3))))),
% 9.54/1.98 inference(rectify,[],[f61])).
% 9.54/1.98 thf(f312,plain,(
% 9.54/1.98 (notdexE = ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((~ (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) & (Y1 @ Y2))))) => (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (~ (Y1 @ Y2))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f311])).
% 9.54/1.98 thf(f313,plain,(
% 9.54/1.98 (sepInPowerset = ! [X0 : $i,X1 : ($i > $o)] : (in @ (dsetconstr @ X0 @ (^[X2 : $i] : ((X1 @ X2)))) @ (powerset @ X0)))),
% 9.54/1.98 inference(rectify,[],[f99])).
% 9.54/1.98 thf(f314,plain,(
% 9.54/1.98 (sepInPowerset = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (in @ (dsetconstr @ Y1 @ (^[Y2 : $i]: (Y0 @ Y2))) @ (powerset @ Y1))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f313])).
% 9.54/1.98 thf(f317,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : ((X0 = X1) => (subset @ X1 @ X0)) = eqimpsubset2)),
% 9.54/1.98 inference(rectify,[],[f79])).
% 9.54/1.98 thf(f318,plain,(
% 9.54/1.98 (eqimpsubset2 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (subset @ Y0 @ Y1))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f317])).
% 9.54/1.98 thf(f321,plain,(
% 9.54/1.98 (! [X0 : $i] : (! [X1 : $i] : ~(in @ X1 @ X0) => (X0 = emptyset)) = noeltsimpempty)),
% 9.54/1.98 inference(rectify,[],[f25])).
% 9.54/1.98 thf(f322,plain,(
% 9.54/1.98 (noeltsimpempty = ((!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: (~ (in @ Y1 @ Y0)))) => (emptyset = Y0))))))),
% 9.54/1.98 inference(fool_elimination,[],[f321])).
% 9.54/1.98 thf(f325,plain,(
% 9.54/1.98 (! [X0 : $i] : ((singleton @ X0) => (in @ (setunion @ X0) @ X0)) = theprop)),
% 9.54/1.98 inference(rectify,[],[f165])).
% 9.54/1.98 thf(f326,plain,(
% 9.54/1.98 (theprop = ((!! @ $i @ (^[Y0 : $i]: ((singleton @ Y0) => (in @ (setunion @ Y0) @ Y0))))))),
% 9.54/1.98 inference(fool_elimination,[],[f325])).
% 9.54/1.98 thf(f331,plain,(
% 9.54/1.98 (inPowerset = ! [X0 : $i] : (in @ X0 @ (powerset @ X0)))),
% 9.54/1.98 inference(rectify,[],[f97])).
% 9.54/1.98 thf(f332,plain,(
% 9.54/1.98 (inPowerset = ((!! @ $i @ (^[Y0 : $i]: (in @ Y0 @ (powerset @ Y0))))))),
% 9.54/1.98 inference(fool_elimination,[],[f331])).
% 9.54/1.98 thf(f333,plain,(
% 9.54/1.98 (! [X0 : ($i > $o)] : ((exu @ (^[X1 : $i] : ((X0 @ X1)))) => ? [X2 : $i] : (! [X3 : $i] : ((X0 @ X3) => (X2 = X3)) & (X0 @ X2))) = exuE1)),
% 9.54/1.98 inference(rectify,[],[f17])).
% 9.54/1.98 thf(f334,plain,(
% 9.54/1.98 (exuE1 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((exu @ (^[Y1 : $i]: (Y0 @ Y1))) => (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f333])).
% 9.54/1.98 thf(f337,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : ($i > $o)] : ((in @ X0 @ emptyset) => (X1 @ X0)) = vacuousDall)),
% 9.54/1.98 inference(rectify,[],[f54])).
% 9.54/1.98 thf(f338,plain,(
% 9.54/1.98 (vacuousDall = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ emptyset) => (Y0 @ Y1))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f337])).
% 9.54/1.98 thf(f345,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i,X2 : $i] : (((binintersect @ X1 @ (binunion @ X0 @ X2))) = ((binunion @ (binintersect @ X1 @ X0) @ (binintersect @ X1 @ X2)))) = bs114d)),
% 9.54/1.98 inference(rectify,[],[f119])).
% 9.54/1.98 thf(f346,plain,(
% 9.54/1.98 (bs114d = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((binintersect @ Y1 @ (binunion @ Y2 @ Y0)) = (binunion @ (binintersect @ Y1 @ Y2) @ (binintersect @ Y1 @ Y0)))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f345])).
% 9.54/1.98 thf(f347,plain,(
% 9.54/1.98 (subsetRefl = ! [X0 : $i] : (subset @ X0 @ X0))),
% 9.54/1.98 inference(rectify,[],[f88])).
% 9.54/1.98 thf(f348,plain,(
% 9.54/1.98 (subsetRefl = ((!! @ $i @ (^[Y0 : $i]: (subset @ Y0 @ Y0)))))),
% 9.54/1.98 inference(fool_elimination,[],[f347])).
% 9.54/1.98 thf(f351,plain,(
% 9.54/1.98 (omega0Ax = ((in @ emptyset @ omega)))),
% 9.54/1.98 inference(fool_elimination,[],[f7])).
% 9.54/1.98 thf(f354,plain,(
% 9.54/1.98 (! [X0 : $i] : ((! [X1 : $i] : (((in @ X1 @ X0) & (in @ X1 @ omega)) => (in @ (setadjoin @ X1 @ X1) @ X0)) & (in @ emptyset @ X0)) => ! [X2 : $i] : ((in @ X2 @ omega) => (in @ X2 @ X0))) = omegaIndAx)),
% 9.54/1.98 inference(rectify,[],[f9])).
% 9.54/1.98 thf(f355,plain,(
% 9.54/1.98 (omegaIndAx = ((!! @ $i @ (^[Y0 : $i]: (((in @ emptyset @ Y0) & (!! @ $i @ (^[Y1 : $i]: (((in @ Y1 @ omega) & (in @ Y1 @ Y0)) => (in @ (setadjoin @ Y1 @ Y1) @ Y0))))) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ omega) => (in @ Y1 @ Y0)))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f354])).
% 9.54/1.98 thf(f356,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : ((subset @ X0 @ X1) => (in @ X0 @ (powerset @ X1))) = subset2powerset)),
% 9.54/1.98 inference(rectify,[],[f92])).
% 9.54/1.98 thf(f357,plain,(
% 9.54/1.98 (subset2powerset = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((subset @ Y1 @ Y0) => (in @ Y1 @ (powerset @ Y0)))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f356])).
% 9.54/1.98 thf(f358,plain,(
% 9.54/1.98 (cartprodfstin = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X1 @ (cartprod @ X2 @ X0)) => (in @ (kfst @ X1) @ X2)))),
% 9.54/1.98 inference(rectify,[],[f167])).
% 9.54/1.98 thf(f359,plain,(
% 9.54/1.98 (cartprodfstin = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (cartprod @ Y0 @ Y2)) => (in @ (kfst @ Y1) @ Y0))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f358])).
% 9.54/1.98 thf(f360,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i,X2 : $i] : ((subset @ X2 @ X1) => ((in @ X0 @ X2) => (in @ X0 @ X1))) = subsetE)),
% 9.54/1.98 inference(rectify,[],[f83])).
% 9.54/1.98 thf(f361,plain,(
% 9.54/1.98 (subsetE = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y0 @ Y1) => ((in @ Y2 @ Y0) => (in @ Y2 @ Y1)))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f360])).
% 9.54/1.98 thf(f362,plain,(
% 9.54/1.98 (upairset2E = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X2 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) => ((X2 = X1) | (X2 = X0))))),
% 9.54/1.98 inference(rectify,[],[f143])).
% 9.54/1.98 thf(f363,plain,(
% 9.54/1.98 (upairset2E = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (setadjoin @ Y2 @ (setadjoin @ Y1 @ emptyset))) => ((Y2 = Y0) | (Y1 = Y0)))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f362])).
% 9.54/1.98 thf(f370,plain,(
% 9.54/1.98 (binintersectLsub = ! [X0 : $i,X1 : $i] : (subset @ (binintersect @ X0 @ X1) @ X0))),
% 9.54/1.98 inference(rectify,[],[f111])).
% 9.54/1.98 thf(f371,plain,(
% 9.54/1.98 (binintersectLsub = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ (binintersect @ Y1 @ Y0) @ Y1)))))))),
% 9.54/1.98 inference(fool_elimination,[],[f370])).
% 9.54/1.98 thf(f372,plain,(
% 9.54/1.98 (setbeta = ! [X0 : $i,X1 : ($i > $o),X2 : $i] : ((in @ X2 @ X0) => ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : ((X1 @ X3))))) <=> (X1 @ X2))))),
% 9.54/1.98 inference(rectify,[],[f26])).
% 9.54/1.98 thf(f373,plain,(
% 9.54/1.98 (setbeta = ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((in @ Y0 @ (dsetconstr @ Y2 @ (^[Y3 : $i]: (Y1 @ Y3)))) = (Y1 @ Y0)))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f372])).
% 9.54/1.98 thf(f374,plain,(
% 9.54/1.98 (! [X0 : ($i > $o)] : ((exu @ (^[X1 : $i] : ((X0 @ X1)))) => ? [X2 : $i] : ! [X3 : $i] : ((X0 @ X3) <=> (X2 = X3))) = exuE2)),
% 9.54/1.98 inference(rectify,[],[f44])).
% 9.54/1.98 thf(f375,plain,(
% 9.54/1.98 (exuE2 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((exu @ (^[Y1 : $i]: (Y0 @ Y1))) => (?? @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) = (Y1 = Y2)))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f374])).
% 9.54/1.98 thf(f380,plain,(
% 9.54/1.98 (powersetsubset = ! [X0 : $i,X1 : $i] : ((subset @ X1 @ X0) => (subset @ (powerset @ X1) @ (powerset @ X0))))),
% 9.54/1.98 inference(rectify,[],[f98])).
% 9.54/1.98 thf(f381,plain,(
% 9.54/1.98 (powersetsubset = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((subset @ Y0 @ Y1) => (subset @ (powerset @ Y0) @ (powerset @ Y1)))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f380])).
% 9.54/1.98 thf(f382,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (in @ X1 @ (setadjoin @ X0 @ emptyset))) = singletonsswitch)),
% 9.54/1.98 inference(rectify,[],[f49])).
% 9.54/1.98 thf(f383,plain,(
% 9.54/1.98 (singletonsswitch = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ emptyset)) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset)))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f382])).
% 9.54/1.98 thf(f386,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i,X2 : $i] : ((subset @ X1 @ X0) => (subset @ X1 @ (setadjoin @ X2 @ X0))) = setadjoinSub2)),
% 9.54/1.98 inference(rectify,[],[f91])).
% 9.54/1.98 thf(f387,plain,(
% 9.54/1.98 (setadjoinSub2 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y1 @ Y2) => (subset @ Y1 @ (setadjoin @ Y0 @ Y2)))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f386])).
% 9.54/1.98 thf(f388,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (in @ X1 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset))) = upairsetIL)),
% 9.54/1.98 inference(rectify,[],[f51])).
% 9.54/1.98 thf(f389,plain,(
% 9.54/1.98 (upairsetIL = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y0 @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f388])).
% 9.54/1.98 thf(f390,plain,(
% 9.54/1.98 (exuI3 = ! [X0 : ($i > $o)] : (? [X1 : $i] : (X0 @ X1) => (! [X2 : $i,X3 : $i] : ((X0 @ X3) => ((X0 @ X2) => (X2 = X3))) => (exu @ (^[X4 : $i] : ((X0 @ X4)))))))),
% 9.54/1.98 inference(rectify,[],[f64])).
% 9.54/1.98 thf(f391,plain,(
% 9.54/1.98 (exuI3 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((?? @ $i @ (^[Y1 : $i]: (Y0 @ Y1))) => ((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y1) => ((Y0 @ Y2) => (Y2 = Y1))))))) => (exu @ (^[Y1 : $i]: (Y0 @ Y1)))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f390])).
% 9.54/1.98 thf(f396,plain,(
% 9.54/1.98 (upairsetIR = ! [X0 : $i,X1 : $i] : (in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset))))),
% 9.54/1.98 inference(rectify,[],[f52])).
% 9.54/1.98 thf(f397,plain,(
% 9.54/1.98 (upairsetIR = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f396])).
% 9.54/1.98 thf(f398,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (subset @ (setminus @ X0 @ X1) @ X0) = setminusLsub)),
% 9.54/1.98 inference(rectify,[],[f128])).
% 9.54/1.98 thf(f399,plain,(
% 9.54/1.98 (setminusLsub = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ (setminus @ Y1 @ Y0) @ Y1)))))))),
% 9.54/1.98 inference(fool_elimination,[],[f398])).
% 9.54/1.98 thf(f400,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i,X2 : $i] : (~(in @ X2 @ (setminus @ X0 @ X1)) => ((in @ X2 @ X0) => (in @ X2 @ X1))) = setminusERneg)),
% 9.54/1.98 inference(rectify,[],[f124])).
% 9.54/1.98 thf(f401,plain,(
% 9.54/1.98 (setminusERneg = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (in @ Y0 @ (setminus @ Y2 @ Y1))) => ((in @ Y0 @ Y2) => (in @ Y0 @ Y1)))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f400])).
% 9.54/1.98 thf(f402,plain,(
% 9.54/1.98 (setadjoinOr = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X1 @ (setadjoin @ X0 @ X2)) => ((in @ X1 @ X2) | (X0 = X1))))),
% 9.54/1.98 inference(rectify,[],[f35])).
% 9.54/1.98 thf(f403,plain,(
% 9.54/1.98 (setadjoinOr = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setadjoin @ Y2 @ Y0)) => ((Y2 = Y1) | (in @ Y1 @ Y0)))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f402])).
% 9.54/1.98 thf(f404,plain,(
% 9.54/1.98 (eqimpsubset1 = ! [X0 : $i,X1 : $i] : ((X0 = X1) => (subset @ X1 @ X0)))),
% 9.54/1.98 inference(rectify,[],[f80])).
% 9.54/1.98 thf(f405,plain,(
% 9.54/1.98 (eqimpsubset1 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (subset @ Y0 @ Y1))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f404])).
% 9.54/1.98 thf(f406,plain,(
% 9.54/1.98 (ex1 = (^[X0 : $i, X1 : ($i > $o)] : ((singleton @ (dsetconstr @ X0 @ (^[X2 : $i] : ((X1 @ X2))))))))),
% 9.54/1.98 inference(rectify,[],[f158])).
% 9.54/1.98 thf(f407,plain,(
% 9.54/1.98 (ex1 = (^[Y0 : $i]: ((^[Y1 : $i > $o]: (singleton @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (Y1 @ Y2))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f406])).
% 9.54/1.98 thf(f408,plain,(
% 9.54/1.98 (kfstpairEq = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((kfst @ (kpair @ Y1 @ Y0)) = Y1)))))))),
% 9.54/1.98 inference(fool_elimination,[],[f166])).
% 9.54/1.98 thf(f411,plain,(
% 9.54/1.98 (omega__Cong = ((omega = omega)))),
% 9.54/1.98 inference(fool_elimination,[],[f74])).
% 9.54/1.98 thf(f414,plain,(
% 9.54/1.98 (! [X0 : $i] : (! [X1 : $i] : ~(in @ X1 @ X0) => (X0 = emptyset)) = emptyI)),
% 9.54/1.98 inference(rectify,[],[f24])).
% 9.54/1.98 thf(f415,plain,(
% 9.54/1.98 (emptyI = ((!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: (~ (in @ Y1 @ Y0)))) => (emptyset = Y0))))))),
% 9.54/1.98 inference(fool_elimination,[],[f414])).
% 9.54/1.98 thf(f418,plain,(
% 9.54/1.98 (setadjoinIR = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X1 @ X2) => (in @ X1 @ (setadjoin @ X0 @ X2))))),
% 9.54/1.98 inference(rectify,[],[f33])).
% 9.54/1.98 thf(f419,plain,(
% 9.54/1.98 (setadjoinIR = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ (setadjoin @ Y2 @ Y0)))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f418])).
% 9.54/1.98 thf(f420,plain,(
% 9.54/1.98 ~(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 => (binunionIL => (upairset2IR => (binunionIR => (binunionEcases => (binunionE => (binunionLsub => (binunionRsub => (binintersectI => (binintersectSubset5 => (binintersectEL => (binintersectLsub => (binintersectSubset2 => (binintersectSubset3 => (binintersectER => (disjointsetsI1 => (binintersectRsub => (binintersectSubset4 => (binintersectSubset1 => (bs114d => (setminusI => (setminusEL => (setminusER => (setminusSubset2 => (setminusERneg => (setminusELneg => (setminusILneg => (setminusIRneg => (setminusLsub => (setminusSubset1 => (symdiffE => (symdiffI1 => (symdiffI2 => (symdiffIneg1 => (symdiffIneg2 => (secondinupair => (setukpairIL => (setukpairIR => (kpairiskpair => (kpairp => (singletonsubset => (singletoninpowerset => (singletoninpowunion => (upairset2E => (upairsubunion => (upairinpowunion => (ubforcartprodlem1 => (ubforcartprodlem2 => (ubforcartprodlem3 => (cartprodpairin => (cartprodmempair1 => (cartprodmempair => (setunionE2 => (setunionsingleton1 => (setunionsingleton2 => (setunionsingleton => (singletonprop => (ex1E1 => (ex1I => (ex1I2 => (singletonsuniq => (setukpairinjL1 => (kfstsingleton => (theprop => (kfstpairEq => (cartprodfstin => (setukpairinjL2 => (setukpairinjL => (setukpairinjR11 => (setukpairinjR12 => (setukpairinjR1 => (upairequniteq => (setukpairinjR2 => (setukpairinjR => (ksndsingleton => (ksndpairEq => (kpairsurjEq => (cartprodsndin => (cartprodpairmemEL => (cartprodpairmemER => (cartprodmempaircEq => (cartprodfstpairEq => (cartprodsndpairEq => (cartprodpairsurjEq => (dpsetconstrI => (dpsetconstrSub => (setOfPairsIsBReln => (dpsetconstrERa => (dpsetconstrEL1 => (dpsetconstrEL2 => (dpsetconstrER => (funcImageSingleton => (apProp => ! [X0 : $i,X1 : $i,X2 : $i] : ((func @ X1 @ X0 @ X2) => ! [X3 : $i] : ((in @ X3 @ X1) => (in @ (ap @ X1 @ X0 @ X2 @ X3) @ X0)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),
% 9.54/1.98 inference(rectify,[],[f200])).
% 9.54/1.98 thf(f421,plain,(
% 9.54/1.98 ($true = ((~ (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 => (binunionIL => (upairset2IR => (binunionIR => (binunionEcases => (binunionE => (binunionLsub => (binunionRsub => (binintersectI => (binintersectSubset5 => (binintersectEL => (binintersectLsub => (binintersectSubset2 => (binintersectSubset3 => (binintersectER => (disjointsetsI1 => (binintersectRsub => (binintersectSubset4 => (binintersectSubset1 => (bs114d => (setminusI => (setminusEL => (setminusER => (setminusSubset2 => (setminusERneg => (setminusELneg => (setminusILneg => (setminusIRneg => (setminusLsub => (setminusSubset1 => (symdiffE => (symdiffI1 => (symdiffI2 => (symdiffIneg1 => (symdiffIneg2 => (secondinupair => (setukpairIL => (setukpairIR => (kpairiskpair => (kpairp => (singletonsubset => (singletoninpowerset => (singletoninpowunion => (upairset2E => (upairsubunion => (upairinpowunion => (ubforcartprodlem1 => (ubforcartprodlem2 => (ubforcartprodlem3 => (cartprodpairin => (cartprodmempair1 => (cartprodmempair => (setunionE2 => (setunionsingleton1 => (setunionsingleton2 => (setunionsingleton => (singletonprop => (ex1E1 => (ex1I => (ex1I2 => (singletonsuniq => (setukpairinjL1 => (kfstsingleton => (theprop => (kfstpairEq => (cartprodfstin => (setukpairinjL2 => (setukpairinjL => (setukpairinjR11 => (setukpairinjR12 => (setukpairinjR1 => (upairequniteq => (setukpairinjR2 => (setukpairinjR => (ksndsingleton => (ksndpairEq => (kpairsurjEq => (cartprodsndin => (cartprodpairmemEL => (cartprodpairmemER => (cartprodmempaircEq => (cartprodfstpairEq => (cartprodsndpairEq => (cartprodpairsurjEq => (dpsetconstrI => (dpsetconstrSub => (setOfPairsIsBReln => (dpsetconstrERa => (dpsetconstrEL1 => (dpsetconstrEL2 => (dpsetconstrER => (funcImageSingleton => (apProp => (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((func @ Y1 @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => (in @ (ap @ Y1 @ Y2 @ Y0 @ Y3) @ Y2))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f420])).
% 9.54/1.98 thf(f422,plain,(
% 9.54/1.98 (! [X0 : $i] : (? [X1 : $i] : (in @ X1 @ X0) => (nonempty @ X0)) = nonemptyI1)),
% 9.54/1.98 inference(rectify,[],[f30])).
% 9.54/1.98 thf(f423,plain,(
% 9.54/1.98 (nonemptyI1 = ((!! @ $i @ (^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: (in @ Y1 @ Y0))) => (nonempty @ Y0))))))),
% 9.54/1.98 inference(fool_elimination,[],[f422])).
% 9.54/1.98 thf(f424,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $o] : ((in @ X0 @ (prop2set @ X1)) => X1) = prop2setE)),
% 9.54/1.98 inference(rectify,[],[f18])).
% 9.54/1.98 thf(f425,plain,(
% 9.54/1.98 (prop2setE = ((!! @ $o @ (^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (prop2set @ Y0)) => Y0)))))))),
% 9.54/1.98 inference(fool_elimination,[],[f424])).
% 9.54/1.98 thf(f430,plain,(
% 9.54/1.98 (binintersectEL = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X1 @ (binintersect @ X0 @ X2)) => (in @ X1 @ X0)))),
% 9.54/1.98 inference(rectify,[],[f110])).
% 9.54/1.98 thf(f431,plain,(
% 9.54/1.98 (binintersectEL = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (binintersect @ Y2 @ Y0)) => (in @ Y1 @ Y2))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f430])).
% 9.54/1.98 thf(f432,plain,(
% 9.54/1.98 (emptysetsubset = ! [X0 : $i] : (subset @ emptyset @ X0))),
% 9.54/1.98 inference(rectify,[],[f82])).
% 9.54/1.98 thf(f433,plain,(
% 9.54/1.98 (emptysetsubset = ((!! @ $i @ (^[Y0 : $i]: (subset @ emptyset @ Y0)))))),
% 9.54/1.98 inference(fool_elimination,[],[f432])).
% 9.54/1.98 thf(f436,plain,(
% 9.54/1.98 (setunionE2 = ! [X0 : $i,X1 : $i] : ((in @ X0 @ (setunion @ X1)) => ? [X2 : $i] : ((in @ X2 @ X1) & (in @ X0 @ X2))))),
% 9.54/1.98 inference(rectify,[],[f152])).
% 9.54/1.98 thf(f437,plain,(
% 9.54/1.98 (setunionE2 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setunion @ Y0)) => (?? @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) & (in @ Y2 @ Y0)))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f436])).
% 9.54/1.98 thf(f444,plain,(
% 9.54/1.98 (emptyinunitempty = ((in @ emptyset @ (setadjoin @ emptyset @ emptyset))))),
% 9.54/1.98 inference(fool_elimination,[],[f32])).
% 9.54/1.98 thf(f445,plain,(
% 9.54/1.98 (nonemptyImpWitness = ! [X0 : $i] : ((nonempty @ X0) => ? [X1 : $i] : ((in @ X1 @ X0) & $true)))),
% 9.54/1.98 inference(rectify,[],[f45])).
% 9.54/1.98 thf(f446,plain,(
% 9.54/1.98 (nonemptyImpWitness = ((!! @ $i @ (^[Y0 : $i]: ((nonempty @ Y0) => (?? @ $i @ (^[Y1 : $i]: ($true & (in @ Y1 @ Y0)))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f445])).
% 9.54/1.98 thf(f449,plain,(
% 9.54/1.98 (! [X0 : $i] : (((dsetconstr @ X0 @ (^[X1 : $i] : ($true)))) = X0) = setoftrueEq)),
% 9.54/1.98 inference(rectify,[],[f36])).
% 9.54/1.98 thf(f450,plain,(
% 9.54/1.98 (setoftrueEq = ((!! @ $i @ (^[Y0 : $i]: ((dsetconstr @ Y0 @ (^[Y1 : $i]: ($true))) = Y0)))))),
% 9.54/1.98 inference(fool_elimination,[],[f449])).
% 9.54/1.98 thf(f455,plain,(
% 9.54/1.98 (quantDeMorgan3 = ! [X0 : ($i > $o),X1 : $i] : (~ ? [X2 : $i] : ((X0 @ X2) & (in @ X2 @ X1)) => ! [X3 : $i] : ((in @ X3 @ X1) => ~(X0 @ X3))))),
% 9.54/1.98 inference(rectify,[],[f57])).
% 9.54/1.98 thf(f456,plain,(
% 9.54/1.98 (quantDeMorgan3 = ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((~ (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) & (Y1 @ Y2))))) => (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (~ (Y1 @ Y2))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f455])).
% 9.54/1.98 thf(f459,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (in @ X1 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) = secondinupair)),
% 9.54/1.98 inference(rectify,[],[f135])).
% 9.54/1.98 thf(f460,plain,(
% 9.54/1.98 (secondinupair = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y0 @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset)))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f459])).
% 9.54/1.98 thf(f461,plain,(
% 9.54/1.98 (setunionsingleton1 = ! [X0 : $i] : (subset @ (setunion @ (setadjoin @ X0 @ emptyset)) @ X0))),
% 9.54/1.98 inference(rectify,[],[f153])).
% 9.54/1.98 thf(f462,plain,(
% 9.54/1.98 (setunionsingleton1 = ((!! @ $i @ (^[Y0 : $i]: (subset @ (setunion @ (setadjoin @ Y0 @ emptyset)) @ Y0)))))),
% 9.54/1.98 inference(fool_elimination,[],[f461])).
% 9.54/1.98 thf(f463,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X2 @ (setminus @ X1 @ X0)) => ~(in @ X2 @ X0)) = setminusER)),
% 9.54/1.98 inference(rectify,[],[f122])).
% 9.54/1.98 thf(f464,plain,(
% 9.54/1.98 (setminusER = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (setminus @ Y1 @ Y2)) => (~ (in @ Y0 @ Y2)))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f463])).
% 9.54/1.98 thf(f465,plain,(
% 9.54/1.98 (nonemptyI = ! [X0 : ($i > $o),X1 : $i,X2 : $i] : ((in @ X1 @ X2) => ((X0 @ X1) => (nonempty @ (dsetconstr @ X2 @ (^[X3 : $i] : ((X0 @ X3))))))))),
% 9.54/1.98 inference(rectify,[],[f29])).
% 9.54/1.98 thf(f466,plain,(
% 9.54/1.98 (nonemptyI = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ Y0) => ((Y2 @ Y1) => (nonempty @ (dsetconstr @ Y0 @ (^[Y3 : $i]: (Y2 @ Y3))))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f465])).
% 9.54/1.98 thf(f469,plain,(
% 9.54/1.98 (singletonsuniq = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((setadjoin @ Y0 @ emptyset) = (setadjoin @ Y1 @ emptyset)) => (Y1 = Y0))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f162])).
% 9.54/1.98 thf(f470,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X0 @ X2) => ! [X3 : $i] : ((in @ X3 @ X1) => (((kfst @ (kpair @ X0 @ X3))) = X0))) = cartprodfstpairEq)),
% 9.54/1.98 inference(rectify,[],[f183])).
% 9.54/1.98 thf(f471,plain,(
% 9.54/1.98 (cartprodfstpairEq = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((kfst @ (kpair @ Y2 @ Y3)) = Y2)))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f470])).
% 9.54/1.98 thf(f474,plain,(
% 9.54/1.98 (kpairiskpair = ! [X0 : $i,X1 : $i] : (iskpair @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))))),
% 9.54/1.98 inference(rectify,[],[f138])).
% 9.54/1.98 thf(f475,plain,(
% 9.54/1.98 (kpairiskpair = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (iskpair @ (setadjoin @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset)) @ emptyset)))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f474])).
% 9.54/1.98 thf(f476,plain,(
% 9.54/1.98 (setminusI = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X0 @ X1) => (~(in @ X0 @ X2) => (in @ X0 @ (setminus @ X1 @ X2)))))),
% 9.54/1.98 inference(rectify,[],[f120])).
% 9.54/1.98 thf(f477,plain,(
% 9.54/1.98 (setminusI = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => ((~ (in @ Y2 @ Y0)) => (in @ Y2 @ (setminus @ Y1 @ Y0))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f476])).
% 9.54/1.98 thf(f482,plain,(
% 9.54/1.98 (breln = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: (subset @ Y2 @ (cartprod @ Y0 @ Y1))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f186])).
% 9.54/1.98 thf(f483,plain,(
% 9.54/1.98 (cartprodmempair = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X0 @ (cartprod @ X1 @ X2)) => (iskpair @ X0)))),
% 9.54/1.98 inference(rectify,[],[f151])).
% 9.54/1.98 thf(f484,plain,(
% 9.54/1.98 (cartprodmempair = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (cartprod @ Y1 @ Y0)) => (iskpair @ Y2))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f483])).
% 9.54/1.98 thf(f485,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (subset @ X1 @ (setadjoin @ X0 @ X1)) = setadjoinSub)),
% 9.54/1.98 inference(rectify,[],[f90])).
% 9.54/1.98 thf(f486,plain,(
% 9.54/1.98 (setadjoinSub = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ Y0 @ (setadjoin @ Y1 @ Y0))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f485])).
% 9.54/1.98 thf(f489,plain,(
% 9.54/1.98 (cartprodmempaircEq = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X1) => (((kpair @ X2 @ X3)) = ((kpair @ X2 @ X3))))))),
% 9.54/1.98 inference(rectify,[],[f182])).
% 9.54/1.98 thf(f490,plain,(
% 9.54/1.98 (cartprodmempaircEq = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((kpair @ Y0 @ Y3) = (kpair @ Y0 @ Y3))))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f489])).
% 9.54/1.98 thf(f493,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (subset @ X1 @ (binunion @ X1 @ X0)) = binunionLsub)),
% 9.54/1.98 inference(rectify,[],[f106])).
% 9.54/1.98 thf(f494,plain,(
% 9.54/1.98 (binunionLsub = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ Y0 @ (binunion @ Y0 @ Y1))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f493])).
% 9.54/1.98 thf(f495,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : ((X0 = X1) => (in @ X1 @ (setadjoin @ X0 @ emptyset))) = eqinunit)),
% 9.54/1.98 inference(rectify,[],[f48])).
% 9.54/1.98 thf(f496,plain,(
% 9.54/1.98 (eqinunit = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset)))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f495])).
% 9.54/1.98 thf(f497,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X1 @ (setadjoin @ X2 @ X0)) <=> ((in @ X1 @ X0) | (X1 = X2))) = setadjoinAx)),
% 9.54/1.98 inference(rectify,[],[f4])).
% 9.54/1.98 thf(f498,plain,(
% 9.54/1.98 (setadjoinAx = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ Y2)) = ((Y1 = Y0) | (in @ Y1 @ Y2)))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f497])).
% 9.54/1.98 thf(f499,plain,(
% 9.54/1.98 (setukpairIR = ! [X0 : $i,X1 : $i] : (in @ X1 @ (setunion @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))))),
% 9.54/1.98 inference(rectify,[],[f137])).
% 9.54/1.98 thf(f500,plain,(
% 9.54/1.98 (setukpairIR = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y0 @ (setunion @ (setadjoin @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset)) @ emptyset))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f499])).
% 9.54/1.98 thf(f501,plain,(
% 9.54/1.98 (nonemptyE1 = ! [X0 : $i] : ((nonempty @ X0) => ? [X1 : $i] : (in @ X1 @ X0)))),
% 9.54/1.98 inference(rectify,[],[f28])).
% 9.54/1.98 thf(f502,plain,(
% 9.54/1.98 (nonemptyE1 = ((!! @ $i @ (^[Y0 : $i]: ((nonempty @ Y0) => (?? @ $i @ (^[Y1 : $i]: (in @ Y1 @ Y0))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f501])).
% 9.54/1.98 thf(f503,plain,(
% 9.54/1.98 (setunionE = ! [X0 : $i,X1 : $i] : ((in @ X1 @ (setunion @ X0)) => ! [X2 : $o] : (! [X3 : $i] : ((in @ X1 @ X3) => ((in @ X3 @ X0) => X2)) => X2)))),
% 9.54/1.98 inference(rectify,[],[f42])).
% 9.54/1.98 thf(f504,plain,(
% 9.54/1.98 (setunionE = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setunion @ Y1)) => (!! @ $o @ (^[Y2 : $o]: ((!! @ $i @ (^[Y3 : $i]: ((in @ Y0 @ Y3) => ((in @ Y3 @ Y1) => Y2)))) => Y2))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f503])).
% 9.54/1.98 thf(f505,plain,(
% 9.54/1.98 (! [X0 : ($i > $o),X1 : $i,X2 : $i] : ((in @ X1 @ (dsetconstr @ X2 @ (^[X3 : $i] : ((X0 @ X3))))) => (in @ X1 @ X2)) = dsetconstrEL)),
% 9.54/1.98 inference(rectify,[],[f15])).
% 9.54/1.98 thf(f506,plain,(
% 9.54/1.98 (dsetconstrEL = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ (dsetconstr @ Y0 @ (^[Y3 : $i]: (Y2 @ Y3)))) => (in @ Y1 @ Y0))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f505])).
% 9.54/1.98 thf(f507,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (iskpair @ (kpair @ X0 @ X1)) = kpairp)),
% 9.54/1.98 inference(rectify,[],[f139])).
% 9.54/1.98 thf(f508,plain,(
% 9.54/1.98 (kpairp = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (iskpair @ (kpair @ Y1 @ Y0))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f507])).
% 9.54/1.98 thf(f509,plain,(
% 9.54/1.98 (setminusSubset1 = ! [X0 : $i,X1 : $i] : ((((setminus @ X0 @ X1)) = emptyset) => (subset @ X0 @ X1)))),
% 9.54/1.98 inference(rectify,[],[f129])).
% 9.54/1.98 thf(f510,plain,(
% 9.54/1.98 (setminusSubset1 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((emptyset = (setminus @ Y1 @ Y0)) => (subset @ Y1 @ Y0))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f509])).
% 9.54/1.98 thf(f515,plain,(
% 9.54/1.98 (subsetI1 = ! [X0 : $i,X1 : $i] : (! [X2 : $i] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (subset @ X0 @ X1)))),
% 9.54/1.98 inference(rectify,[],[f78])).
% 9.54/1.98 thf(f516,plain,(
% 9.54/1.98 (subsetI1 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (subset @ Y1 @ Y0))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f515])).
% 9.54/1.98 thf(f519,plain,(
% 9.54/1.98 (setukpairinjL1 = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) => (X0 = X2)))),
% 9.54/1.98 inference(rectify,[],[f163])).
% 9.54/1.98 thf(f520,plain,(
% 9.54/1.98 (setukpairinjL1 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y2 @ emptyset) @ (setadjoin @ (setadjoin @ Y2 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))) => (Y2 = Y0))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f519])).
% 9.54/1.98 thf(f523,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (subset @ X1 @ (binunion @ X0 @ X1)) = binunionRsub)),
% 9.54/1.98 inference(rectify,[],[f107])).
% 9.54/1.98 thf(f524,plain,(
% 9.54/1.98 (binunionRsub = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ Y0 @ (binunion @ Y1 @ Y0))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f523])).
% 9.54/1.98 thf(f525,plain,(
% 9.54/1.98 (binintersectSubset4 = ! [X0 : $i,X1 : $i] : ((subset @ X0 @ X1) => (((binintersect @ X1 @ X0)) = X0)))),
% 9.54/1.98 inference(rectify,[],[f117])).
% 9.54/1.98 thf(f526,plain,(
% 9.54/1.98 (binintersectSubset4 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((subset @ Y1 @ Y0) => ((binintersect @ Y0 @ Y1) = Y1))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f525])).
% 9.54/1.98 thf(f527,plain,(
% 9.54/1.98 (powerset__Cong = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => ((powerset @ Y1) = (powerset @ Y0)))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f72])).
% 9.54/1.98 thf(f530,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : ((X0 != X1) => ~(in @ X0 @ (setadjoin @ X1 @ emptyset))) = notinsingleton)),
% 9.54/1.98 inference(rectify,[],[f47])).
% 9.54/1.98 thf(f531,plain,(
% 9.54/1.98 (notinsingleton = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (Y1 = Y0)) => (~ (in @ Y1 @ (setadjoin @ Y0 @ emptyset))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f530])).
% 9.54/1.98 thf(f532,plain,(
% 9.54/1.98 (upairequniteq = ! [X0 : $i,X1 : $i,X2 : $i] : ((((setadjoin @ X1 @ emptyset)) = ((setadjoin @ X2 @ (setadjoin @ X0 @ emptyset)))) => (X0 = X2)))),
% 9.54/1.98 inference(rectify,[],[f173])).
% 9.54/1.98 thf(f533,plain,(
% 9.54/1.98 (upairequniteq = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((setadjoin @ Y1 @ emptyset) = (setadjoin @ Y0 @ (setadjoin @ Y2 @ emptyset))) => (Y2 = Y0))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f532])).
% 9.54/1.98 thf(f536,plain,(
% 9.54/1.98 (subsetTrans = ! [X0 : $i,X1 : $i,X2 : $i] : ((subset @ X2 @ X0) => ((subset @ X0 @ X1) => (subset @ X2 @ X1))))),
% 9.54/1.98 inference(rectify,[],[f89])).
% 9.54/1.98 thf(f537,plain,(
% 9.54/1.98 (subsetTrans = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y0 @ Y2) => ((subset @ Y2 @ Y1) => (subset @ Y0 @ Y1)))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f536])).
% 9.54/1.98 thf(f540,plain,(
% 9.54/1.98 (exuI2 = ! [X0 : ($i > $o)] : (? [X1 : $i] : ! [X2 : $i] : ((X2 = X1) <=> (X0 @ X2)) => (exu @ (^[X3 : $i] : ((X0 @ X3))))))),
% 9.54/1.98 inference(rectify,[],[f65])).
% 9.54/1.98 thf(f541,plain,(
% 9.54/1.98 (exuI2 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((?? @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y1 = Y2) = (Y0 @ Y2)))))) => (exu @ (^[Y1 : $i]: (Y0 @ Y1))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f540])).
% 9.54/1.98 thf(f542,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X1 @ X2) => ((in @ X1 @ X0) => (in @ X1 @ (binintersect @ X2 @ X0)))) = binintersectI)),
% 9.54/1.98 inference(rectify,[],[f108])).
% 9.54/1.98 thf(f543,plain,(
% 9.54/1.98 (binintersectI = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => ((in @ Y1 @ Y2) => (in @ Y1 @ (binintersect @ Y0 @ Y2))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f542])).
% 9.54/1.98 thf(f544,plain,(
% 9.54/1.98 (omegaSAx = ! [X0 : $i] : ((in @ X0 @ omega) => (in @ (setadjoin @ X0 @ X0) @ omega)))),
% 9.54/1.98 inference(rectify,[],[f8])).
% 9.54/1.98 thf(f545,plain,(
% 9.54/1.98 (omegaSAx = ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ omega) => (in @ (setadjoin @ Y0 @ Y0) @ omega))))))),
% 9.54/1.98 inference(fool_elimination,[],[f544])).
% 9.54/1.98 thf(f554,plain,(
% 9.54/1.98 (func = (^[X0 : $i, X1 : $i, X2 : $i] : (! [X3 : $i] : ((in @ X3 @ X0) => (ex1 @ X1 @ (^[X4 : $i] : ((in @ (kpair @ X3 @ X4) @ X2))))) & (breln @ X0 @ X1 @ X2))))),
% 9.54/1.98 inference(rectify,[],[f194])).
% 9.54/1.98 thf(f555,plain,(
% 9.54/1.98 (func = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((breln @ Y0 @ Y1 @ Y2) & (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => (ex1 @ Y1 @ (^[Y4 : $i]: (in @ (kpair @ Y3 @ Y4) @ Y2)))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f554])).
% 9.54/1.98 thf(f556,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X0 @ X2) => ! [X3 : $i] : ((in @ X3 @ X1) => (((ksnd @ (kpair @ X0 @ X3))) = X3))) = cartprodsndpairEq)),
% 9.54/1.98 inference(rectify,[],[f184])).
% 9.54/1.98 thf(f557,plain,(
% 9.54/1.98 (cartprodsndpairEq = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((ksnd @ (kpair @ Y2 @ Y3)) = Y3)))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f556])).
% 9.54/1.98 thf(f558,plain,(
% 9.54/1.98 (dsetconstrER = ! [X0 : $i,X1 : $i,X2 : ($i > $o)] : ((in @ X1 @ (dsetconstr @ X0 @ (^[X3 : $i] : ((X2 @ X3))))) => (X2 @ X1)))),
% 9.54/1.98 inference(rectify,[],[f16])).
% 9.54/1.98 thf(f559,plain,(
% 9.54/1.98 (dsetconstrER = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (dsetconstr @ Y2 @ (^[Y3 : $i]: (Y0 @ Y3)))) => (Y0 @ Y1))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f558])).
% 9.54/1.98 thf(f560,plain,(
% 9.54/1.98 (ubforcartprodlem1 = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X1 @ X0) => ! [X3 : $i] : ((in @ X3 @ X2) => (subset @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ X0 @ X2))))))),
% 9.54/1.98 inference(rectify,[],[f146])).
% 9.54/1.98 thf(f561,plain,(
% 9.54/1.98 (ubforcartprodlem1 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => (subset @ (setadjoin @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y1 @ (setadjoin @ Y3 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ Y2 @ Y0)))))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f560])).
% 9.54/1.98 thf(f566,plain,(
% 9.54/1.98 (inCongP = ! [X0 : $i,X1 : $i] : ((X0 = X1) => ! [X2 : $i,X3 : $i] : ((X2 = X3) => ((in @ X2 @ X1) => (in @ X3 @ X0)))))),
% 9.54/1.98 inference(rectify,[],[f66])).
% 9.54/1.98 thf(f567,plain,(
% 9.54/1.98 (inCongP = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y3 = Y2) => ((in @ Y3 @ Y0) => (in @ Y2 @ Y1))))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f566])).
% 9.54/1.98 thf(f568,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : ((X0 = X1) => ! [X2 : $i,X3 : $i] : ((X2 = X3) => (((setadjoin @ X1 @ X2)) = ((setadjoin @ X0 @ X3))))) = setadjoin__Cong)),
% 9.54/1.98 inference(rectify,[],[f71])).
% 9.54/1.98 thf(f569,plain,(
% 9.54/1.98 (setadjoin__Cong = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y3 = Y2) => ((setadjoin @ Y0 @ Y3) = (setadjoin @ Y1 @ Y2))))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f568])).
% 9.54/1.98 thf(f570,plain,(
% 9.54/1.98 (setunionsingleton = ((!! @ $i @ (^[Y0 : $i]: ((setunion @ (setadjoin @ Y0 @ emptyset)) = Y0)))))),
% 9.54/1.98 inference(fool_elimination,[],[f155])).
% 9.54/1.98 thf(f571,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i] : (subset @ (binintersect @ X0 @ X1) @ X1) = binintersectRsub)),
% 9.54/1.98 inference(rectify,[],[f116])).
% 9.54/1.98 thf(f572,plain,(
% 9.54/1.98 (binintersectRsub = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ (binintersect @ Y1 @ Y0) @ Y0)))))))),
% 9.54/1.98 inference(fool_elimination,[],[f571])).
% 9.54/1.98 thf(f575,plain,(
% 9.54/1.98 (uniqinunit = ! [X0 : $i,X1 : $i] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1)))),
% 9.54/1.98 inference(rectify,[],[f46])).
% 9.54/1.98 thf(f576,plain,(
% 9.54/1.98 (uniqinunit = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ emptyset)) => (Y1 = Y0))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f575])).
% 9.54/1.98 thf(f577,plain,(
% 9.54/1.98 (emptyset__Cong = ((emptyset = emptyset)))),
% 9.54/1.98 inference(fool_elimination,[],[f70])).
% 9.54/1.98 thf(f578,plain,(
% 9.54/1.98 (cartprodsndin = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X1 @ (cartprod @ X0 @ X2)) => (in @ (ksnd @ X1) @ X2)))),
% 9.54/1.98 inference(rectify,[],[f179])).
% 9.54/1.98 thf(f579,plain,(
% 9.54/1.98 (cartprodsndin = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (cartprod @ Y2 @ Y0)) => (in @ (ksnd @ Y1) @ Y0))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f578])).
% 9.54/1.98 thf(f580,plain,(
% 9.54/1.98 (! [X0 : $i] : (? [X1 : $i] : (in @ X1 @ X0) => ? [X2 : $i] : (~ ? [X3 : $i] : ((in @ X3 @ X2) & (in @ X3 @ X0)) & (in @ X2 @ X0))) = foundationAx)),
% 9.54/1.98 inference(rectify,[],[f11])).
% 9.54/1.98 thf(f581,plain,(
% 9.54/1.98 (foundationAx = ((!! @ $i @ (^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: (in @ Y1 @ Y0))) => (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & (~ (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) & (in @ Y2 @ Y1)))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f580])).
% 9.54/1.98 thf(f584,plain,(
% 9.54/1.98 (nonempty = (^[Y0 : $i]: (~ (emptyset = Y0))))),
% 9.54/1.98 inference(fool_elimination,[],[f27])).
% 9.54/1.98 thf(f585,plain,(
% 9.54/1.98 (! [X0 : $i,X1 : $i,X2 : $i] : ((func @ X1 @ X0 @ X2) => ! [X3 : $i] : ((in @ X3 @ X1) => (in @ (setunion @ (dsetconstr @ X0 @ (^[X4 : $i] : ((in @ (kpair @ X3 @ X4) @ X2))))) @ X0))) = apProp)),
% 9.54/1.98 inference(rectify,[],[f197])).
% 9.54/1.98 thf(f586,plain,(
% 9.54/1.98 (apProp = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((func @ Y1 @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => (in @ (setunion @ (dsetconstr @ Y2 @ (^[Y4 : $i]: (in @ (kpair @ Y3 @ Y4) @ Y0)))) @ Y2)))))))))))))),
% 9.54/1.98 inference(fool_elimination,[],[f585])).
% 9.54/1.98 thf(f587,plain,(
% 9.54/1.98 (ex1E1 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((ex1 @ Y1 @ (^[Y2 : $i]: (Y0 @ Y2))) => (?? @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) & (in @ Y2 @ Y1)))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f269])).
% 9.54/1.98 thf(f589,plain,(
% 9.54/1.98 (cartprodsndpairEq = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((ksnd @ (kpair @ Y2 @ Y3)) = Y3)))))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f557])).
% 9.54/1.98 thf(f590,plain,(
% 9.54/1.98 (setminusLsub = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ (setminus @ Y1 @ Y0) @ Y1)))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f399])).
% 9.54/1.98 thf(f592,plain,(
% 9.54/1.98 (symdiffIneg1 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => ((in @ Y2 @ Y0) => (~ (in @ Y2 @ (symdiff @ Y1 @ Y0)))))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f202])).
% 9.54/1.98 thf(f596,plain,(
% 9.54/1.98 (binintersectI = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => ((in @ Y1 @ Y2) => (in @ Y1 @ (binintersect @ Y0 @ Y2))))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f543])).
% 9.54/1.98 thf(f598,plain,(
% 9.54/1.98 (kpairp = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (iskpair @ (kpair @ Y1 @ Y0))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f508])).
% 9.54/1.98 thf(f600,plain,(
% 9.54/1.98 (eqimpsubset2 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (subset @ Y0 @ Y1))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f318])).
% 9.54/1.98 thf(f601,plain,(
% 9.54/1.98 (subsetI1 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (subset @ Y1 @ Y0))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f516])).
% 9.54/1.98 thf(f602,plain,(
% 9.54/1.98 (nonemptyImpWitness = ((!! @ $i @ (^[Y0 : $i]: ((nonempty @ Y0) => (?? @ $i @ (^[Y1 : $i]: ($true & (in @ Y1 @ Y0)))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f446])).
% 9.54/1.98 thf(f603,plain,(
% 9.54/1.98 (omegaIndAx = ((!! @ $i @ (^[Y0 : $i]: (((in @ emptyset @ Y0) & (!! @ $i @ (^[Y1 : $i]: (((in @ Y1 @ omega) & (in @ Y1 @ Y0)) => (in @ (setadjoin @ Y1 @ Y1) @ Y0))))) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ omega) => (in @ Y1 @ Y0)))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f355])).
% 9.54/1.98 thf(f604,plain,(
% 9.54/1.98 (uniqinunit = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ emptyset)) => (Y1 = Y0))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f576])).
% 9.54/1.98 thf(f605,plain,(
% 9.54/1.98 (kpairiskpair = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (iskpair @ (setadjoin @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset)) @ emptyset)))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f475])).
% 9.54/1.98 thf(f607,plain,(
% 9.54/1.98 ($true = ((~ (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 => (binunionIL => (upairset2IR => (binunionIR => (binunionEcases => (binunionE => (binunionLsub => (binunionRsub => (binintersectI => (binintersectSubset5 => (binintersectEL => (binintersectLsub => (binintersectSubset2 => (binintersectSubset3 => (binintersectER => (disjointsetsI1 => (binintersectRsub => (binintersectSubset4 => (binintersectSubset1 => (bs114d => (setminusI => (setminusEL => (setminusER => (setminusSubset2 => (setminusERneg => (setminusELneg => (setminusILneg => (setminusIRneg => (setminusLsub => (setminusSubset1 => (symdiffE => (symdiffI1 => (symdiffI2 => (symdiffIneg1 => (symdiffIneg2 => (secondinupair => (setukpairIL => (setukpairIR => (kpairiskpair => (kpairp => (singletonsubset => (singletoninpowerset => (singletoninpowunion => (upairset2E => (upairsubunion => (upairinpowunion => (ubforcartprodlem1 => (ubforcartprodlem2 => (ubforcartprodlem3 => (cartprodpairin => (cartprodmempair1 => (cartprodmempair => (setunionE2 => (setunionsingleton1 => (setunionsingleton2 => (setunionsingleton => (singletonprop => (ex1E1 => (ex1I => (ex1I2 => (singletonsuniq => (setukpairinjL1 => (kfstsingleton => (theprop => (kfstpairEq => (cartprodfstin => (setukpairinjL2 => (setukpairinjL => (setukpairinjR11 => (setukpairinjR12 => (setukpairinjR1 => (upairequniteq => (setukpairinjR2 => (setukpairinjR => (ksndsingleton => (ksndpairEq => (kpairsurjEq => (cartprodsndin => (cartprodpairmemEL => (cartprodpairmemER => (cartprodmempaircEq => (cartprodfstpairEq => (cartprodsndpairEq => (cartprodpairsurjEq => (dpsetconstrI => (dpsetconstrSub => (setOfPairsIsBReln => (dpsetconstrERa => (dpsetconstrEL1 => (dpsetconstrEL2 => (dpsetconstrER => (funcImageSingleton => (apProp => (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((func @ Y1 @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => (in @ (ap @ Y1 @ Y2 @ Y0 @ Y3) @ Y2))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f421])).
% 9.54/1.98 thf(f608,plain,(
% 9.54/1.98 (nonemptyE1 = ((!! @ $i @ (^[Y0 : $i]: ((nonempty @ Y0) => (?? @ $i @ (^[Y1 : $i]: (in @ Y1 @ Y0))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f502])).
% 9.54/1.98 thf(f609,plain,(
% 9.54/1.98 (exuI2 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((?? @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y1 = Y2) = (Y0 @ Y2)))))) => (exu @ (^[Y1 : $i]: (Y0 @ Y1))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f541])).
% 9.54/1.98 thf(f612,plain,(
% 9.54/1.98 (setminusER = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (setminus @ Y1 @ Y2)) => (~ (in @ Y0 @ Y2)))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f464])).
% 9.54/1.98 thf(f613,plain,(
% 9.54/1.98 (inCongP = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y3 = Y2) => ((in @ Y3 @ Y0) => (in @ Y2 @ Y1))))))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f567])).
% 9.54/1.98 thf(f614,plain,(
% 9.54/1.98 (subsetemptysetimpeq = ((!! @ $i @ (^[Y0 : $i]: ((subset @ Y0 @ emptyset) => (emptyset = Y0))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f251])).
% 9.54/1.98 thf(f618,plain,(
% 9.54/1.98 (omega0Ax = ((in @ emptyset @ omega)))),
% 9.54/1.98 inference(cnf_transformation,[],[f351])).
% 9.54/1.98 thf(f620,plain,(
% 9.54/1.98 (ex1 = (^[Y0 : $i]: ((^[Y1 : $i > $o]: (singleton @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (Y1 @ Y2))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f407])).
% 9.54/1.98 thf(f621,plain,(
% 9.54/1.98 (nonemptyI = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ Y0) => ((Y2 @ Y1) => (nonempty @ (dsetconstr @ Y0 @ (^[Y3 : $i]: (Y2 @ Y3))))))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f466])).
% 9.54/1.98 thf(f622,plain,(
% 9.54/1.98 (subsetE2 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y2 @ Y0) => ((~ (in @ Y1 @ Y0)) => (~ (in @ Y1 @ Y2))))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f225])).
% 9.54/1.98 thf(f623,plain,(
% 9.54/1.98 (setminusILneg = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (in @ Y1 @ Y0)) => (~ (in @ Y1 @ (setminus @ Y0 @ Y2))))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f303])).
% 9.54/1.98 thf(f626,plain,(
% 9.54/1.98 (setadjoinIR = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ (setadjoin @ Y2 @ Y0)))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f419])).
% 9.54/1.98 thf(f627,plain,(
% 9.54/1.98 (setadjoinAx = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ Y2)) = ((Y1 = Y0) | (in @ Y1 @ Y2)))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f498])).
% 9.54/1.98 thf(f629,plain,(
% 9.54/1.98 (binunionE = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (binunion @ Y0 @ Y1)) => ((in @ Y2 @ Y0) | (in @ Y2 @ Y1)))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f210])).
% 9.54/1.98 thf(f631,plain,(
% 9.54/1.98 (binintersectEL = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (binintersect @ Y2 @ Y0)) => (in @ Y1 @ Y2))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f431])).
% 9.54/1.98 thf(f632,plain,(
% 9.54/1.98 (quantDeMorgan2 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (~ (Y0 @ Y2))))) => (~ (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) & (Y0 @ Y2))))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f223])).
% 9.54/1.98 thf(f634,plain,(
% 9.54/1.98 (binunionLsub = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ Y0 @ (binunion @ Y0 @ Y1))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f494])).
% 9.54/1.98 thf(f635,plain,(
% 9.54/1.98 (emptysetimpfalse = ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ emptyset) => $false)))))),
% 9.54/1.98 inference(cnf_transformation,[],[f308])).
% 9.54/1.98 thf(f636,plain,(
% 9.54/1.98 (omega__Cong = ((omega = omega)))),
% 9.54/1.98 inference(cnf_transformation,[],[f411])).
% 9.54/1.98 thf(f639,plain,(
% 9.54/1.98 (singleton = (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f206])).
% 9.54/1.98 thf(f641,plain,(
% 9.54/1.98 (cartprodsndin = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (cartprod @ Y2 @ Y0)) => (in @ (ksnd @ Y1) @ Y0))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f579])).
% 9.54/1.98 thf(f642,plain,(
% 9.54/1.98 (setunionAx = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setunion @ Y0)) = (?? @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) & (in @ Y2 @ Y0)))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f261])).
% 9.54/1.98 thf(f643,plain,(
% 9.54/1.98 (bs114d = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((binintersect @ Y1 @ (binunion @ Y2 @ Y0)) = (binunion @ (binintersect @ Y1 @ Y2) @ (binintersect @ Y1 @ Y0)))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f346])).
% 9.54/1.98 thf(f644,plain,(
% 9.54/1.98 (eqimpsubset1 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (subset @ Y0 @ Y1))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f405])).
% 9.54/1.98 thf(f645,plain,(
% 9.54/1.98 (ap = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((^[Y3 : $i]: (setunion @ (dsetconstr @ Y1 @ (^[Y4 : $i]: (in @ (kpair @ Y3 @ Y4) @ Y2))))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f243])).
% 9.54/1.98 thf(f646,plain,(
% 9.54/1.98 (emptyset__Cong = ((emptyset = emptyset)))),
% 9.54/1.98 inference(cnf_transformation,[],[f577])).
% 9.54/1.98 thf(f647,plain,(
% 9.54/1.98 (apProp = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((func @ Y1 @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => (in @ (setunion @ (dsetconstr @ Y2 @ (^[Y4 : $i]: (in @ (kpair @ Y3 @ Y4) @ Y0)))) @ Y2)))))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f586])).
% 9.54/1.98 thf(f648,plain,(
% 9.54/1.98 (subset2powerset = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((subset @ Y1 @ Y0) => (in @ Y1 @ (powerset @ Y0)))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f357])).
% 9.54/1.98 thf(f650,plain,(
% 9.54/1.98 (notinsingleton = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (Y1 = Y0)) => (~ (in @ Y1 @ (setadjoin @ Y0 @ emptyset))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f531])).
% 9.54/1.98 thf(f653,plain,(
% 9.54/1.98 (powerset__Cong = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => ((powerset @ Y1) = (powerset @ Y0)))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f527])).
% 9.54/1.98 thf(f655,plain,(
% 9.54/1.98 (notdexE = ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((~ (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) & (Y1 @ Y2))))) => (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (~ (Y1 @ Y2))))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f312])).
% 9.54/1.98 thf(f656,plain,(
% 9.54/1.98 (secondinupair = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y0 @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset)))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f460])).
% 9.54/1.98 thf(f658,plain,(
% 9.54/1.98 (emptysetsubset = ((!! @ $i @ (^[Y0 : $i]: (subset @ emptyset @ Y0)))))),
% 9.54/1.98 inference(cnf_transformation,[],[f433])).
% 9.54/1.98 thf(f659,plain,(
% 9.54/1.98 (setadjoin__Cong = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y3 = Y2) => ((setadjoin @ Y0 @ Y3) = (setadjoin @ Y1 @ Y2))))))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f569])).
% 9.54/1.98 thf(f660,plain,(
% 9.54/1.98 (exu = (^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2)))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f241])).
% 9.54/1.98 thf(f663,plain,(
% 9.54/1.98 (inPowerset = ((!! @ $i @ (^[Y0 : $i]: (in @ Y0 @ (powerset @ Y0))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f332])).
% 9.54/1.98 thf(f665,plain,(
% 9.54/1.98 (powersetsubset = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((subset @ Y0 @ Y1) => (subset @ (powerset @ Y0) @ (powerset @ Y1)))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f381])).
% 9.54/1.98 thf(f666,plain,(
% 9.54/1.98 (nonempty = (^[Y0 : $i]: (~ (emptyset = Y0))))),
% 9.54/1.98 inference(cnf_transformation,[],[f584])).
% 9.54/1.98 thf(f667,plain,(
% 9.54/1.98 (setbeta = ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((in @ Y0 @ (dsetconstr @ Y2 @ (^[Y3 : $i]: (Y1 @ Y3)))) = (Y1 @ Y0)))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f373])).
% 9.54/1.98 thf(f668,plain,(
% 9.54/1.98 (subsetTrans = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y0 @ Y2) => ((subset @ Y2 @ Y1) => (subset @ Y0 @ Y1)))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f537])).
% 9.54/1.98 thf(f670,plain,(
% 9.54/1.98 (binintersectSubset3 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((binintersect @ Y1 @ Y0) = Y0) => (subset @ Y0 @ Y1))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f219])).
% 9.54/1.98 thf(f671,plain,(
% 9.54/1.98 (vacuousDall = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ emptyset) => (Y0 @ Y1))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f338])).
% 9.54/1.98 thf(f672,plain,(
% 9.54/1.98 (setukpairinjR11 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => ((setadjoin @ Y1 @ emptyset) = (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f217])).
% 9.54/1.98 thf(f673,plain,(
% 9.54/1.98 (theprop = ((!! @ $i @ (^[Y0 : $i]: ((singleton @ Y0) => (in @ (setunion @ Y0) @ Y0))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f326])).
% 9.54/1.98 thf(f675,plain,(
% 9.54/1.98 (singletonsswitch = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ emptyset)) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset)))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f383])).
% 9.54/1.98 thf(f676,plain,(
% 9.54/1.98 (ubforcartprodlem3 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => (in @ (kpair @ Y2 @ Y3) @ (powerset @ (powerset @ (binunion @ Y1 @ Y0))))))))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f212])).
% 9.54/1.98 thf(f677,plain,(
% 9.54/1.98 (cartprodpairsurjEq = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (cartprod @ Y1 @ Y2)) => ((kpair @ (kfst @ Y0) @ (ksnd @ Y0)) = Y0))))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f306])).
% 9.54/1.98 thf(f679,plain,(
% 9.54/1.98 (binintersectRsub = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ (binintersect @ Y1 @ Y0) @ Y0)))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f572])).
% 9.54/1.98 thf(f683,plain,(
% 9.54/1.98 (prop2setE = ((!! @ $o @ (^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (prop2set @ Y0)) => Y0)))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f425])).
% 9.54/1.98 thf(f684,plain,(
% 9.54/1.98 (setadjoinSub = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ Y0 @ (setadjoin @ Y1 @ Y0))))))))),
% 9.54/1.98 inference(cnf_transformation,[],[f486])).
% 9.54/1.98 thf(f685,plain,(
% 9.54/1.98 (setminusERneg = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (in @ Y0 @ (setminus @ Y2 @ Y1))) => ((in @ Y0 @ Y2) => (in @ Y0 @ Y1)))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f401])).
% 9.54/1.99 thf(f687,plain,(
% 9.54/1.99 (dsetconstrI = ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((Y1 @ Y0) => (in @ Y0 @ (dsetconstr @ Y2 @ (^[Y3 : $i]: (Y1 @ Y3))))))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f253])).
% 9.54/1.99 thf(f689,plain,(
% 9.54/1.99 (sepSubset = ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (subset @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (Y1 @ Y2))) @ Y0)))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f214])).
% 9.54/1.99 thf(f690,plain,(
% 9.54/1.99 (emptyinunitempty = ((in @ emptyset @ (setadjoin @ emptyset @ emptyset))))),
% 9.54/1.99 inference(cnf_transformation,[],[f444])).
% 9.54/1.99 thf(f691,plain,(
% 9.54/1.99 (cartprodfstin = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (cartprod @ Y0 @ Y2)) => (in @ (kfst @ Y1) @ Y0))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f359])).
% 9.54/1.99 thf(f693,plain,(
% 9.54/1.99 (kfstpairEq = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((kfst @ (kpair @ Y1 @ Y0)) = Y1)))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f408])).
% 9.54/1.99 thf(f697,plain,(
% 9.54/1.99 (func = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((breln @ Y0 @ Y1 @ Y2) & (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => (ex1 @ Y1 @ (^[Y4 : $i]: (in @ (kpair @ Y3 @ Y4) @ Y2)))))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f555])).
% 9.54/1.99 thf(f701,plain,(
% 9.54/1.99 (setadjoinOr = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setadjoin @ Y2 @ Y0)) => ((Y2 = Y1) | (in @ Y1 @ Y0)))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f403])).
% 9.54/1.99 thf(f702,plain,(
% 9.54/1.99 (binunionRsub = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ Y0 @ (binunion @ Y1 @ Y0))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f524])).
% 9.54/1.99 thf(f703,plain,(
% 9.54/1.99 (cartprodmempaircEq = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((kpair @ Y0 @ Y3) = (kpair @ Y0 @ Y3))))))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f490])).
% 9.54/1.99 thf(f707,plain,(
% 9.54/1.99 (sepInPowerset = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (in @ (dsetconstr @ Y1 @ (^[Y2 : $i]: (Y0 @ Y2))) @ (powerset @ Y1))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f314])).
% 9.54/1.99 thf(f708,plain,(
% 9.54/1.99 (setunionsingleton1 = ((!! @ $i @ (^[Y0 : $i]: (subset @ (setunion @ (setadjoin @ Y0 @ emptyset)) @ Y0)))))),
% 9.54/1.99 inference(cnf_transformation,[],[f462])).
% 9.54/1.99 thf(f709,plain,(
% 9.54/1.99 (setextAx = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) = (in @ Y2 @ Y0)))) => (Y1 = Y0))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f310])).
% 9.54/1.99 thf(f710,plain,(
% 9.54/1.99 (subsetRefl = ((!! @ $i @ (^[Y0 : $i]: (subset @ Y0 @ Y0)))))),
% 9.54/1.99 inference(cnf_transformation,[],[f348])).
% 9.54/1.99 thf(f711,plain,(
% 9.54/1.99 (setunionsingleton = ((!! @ $i @ (^[Y0 : $i]: ((setunion @ (setadjoin @ Y0 @ emptyset)) = Y0)))))),
% 9.54/1.99 inference(cnf_transformation,[],[f570])).
% 9.54/1.99 thf(f712,plain,(
% 9.54/1.99 (binintersectSubset4 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((subset @ Y1 @ Y0) => ((binintersect @ Y0 @ Y1) = Y1))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f526])).
% 9.54/1.99 thf(f713,plain,(
% 9.54/1.99 (breln = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: (subset @ Y2 @ (cartprod @ Y0 @ Y1))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f482])).
% 9.54/1.99 thf(f714,plain,(
% 9.54/1.99 (upairsetIL = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y0 @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f389])).
% 9.54/1.99 thf(f716,plain,(
% 9.54/1.99 (emptysetAx = ((!! @ $i @ (^[Y0 : $i]: (~ (in @ Y0 @ emptyset))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f229])).
% 9.54/1.99 thf(f717,plain,(
% 9.54/1.99 (setadjoinIL = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ Y0))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f301])).
% 9.54/1.99 thf(f718,plain,(
% 9.54/1.99 (upairset2IR = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y0 @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset)))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f273])).
% 9.54/1.99 thf(f719,plain,(
% 9.54/1.99 (upairsetIR = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f397])).
% 9.54/1.99 thf(f721,plain,(
% 9.54/1.99 (setoftrueEq = ((!! @ $i @ (^[Y0 : $i]: ((dsetconstr @ Y0 @ (^[Y1 : $i]: ($true))) = Y0)))))),
% 9.54/1.99 inference(cnf_transformation,[],[f450])).
% 9.54/1.99 thf(f724,plain,(
% 9.54/1.99 (omegaSAx = ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ omega) => (in @ (setadjoin @ Y0 @ Y0) @ omega))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f545])).
% 9.54/1.99 thf(f725,plain,(
% 9.54/1.99 (setukpairinjL1 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y2 @ emptyset) @ (setadjoin @ (setadjoin @ Y2 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))) => (Y2 = Y0))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f520])).
% 9.54/1.99 thf(f727,plain,(
% 9.54/1.99 (cartprodfstpairEq = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((kfst @ (kpair @ Y2 @ Y3)) = Y2)))))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f471])).
% 9.54/1.99 thf(f730,plain,(
% 9.54/1.99 (exuI3 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((?? @ $i @ (^[Y1 : $i]: (Y0 @ Y1))) => ((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y1) => ((Y0 @ Y2) => (Y2 = Y1))))))) => (exu @ (^[Y1 : $i]: (Y0 @ Y1)))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f391])).
% 9.54/1.99 thf(f731,plain,(
% 9.54/1.99 (foundationAx = ((!! @ $i @ (^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: (in @ Y1 @ Y0))) => (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & (~ (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) & (in @ Y2 @ Y1)))))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f581])).
% 9.54/1.99 thf(f732,plain,(
% 9.54/1.99 (cartprodmempair = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (cartprod @ Y1 @ Y0)) => (iskpair @ Y2))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f484])).
% 9.54/1.99 thf(f733,plain,(
% 9.54/1.99 (subsetE = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y0 @ Y1) => ((in @ Y2 @ Y0) => (in @ Y2 @ Y1)))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f361])).
% 9.54/1.99 thf(f734,plain,(
% 9.54/1.99 (notinemptyset = ((!! @ $i @ (^[Y0 : $i]: (~ (in @ Y0 @ emptyset))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f267])).
% 9.54/1.99 thf(f735,plain,(
% 9.54/1.99 (cartprodpairmemER = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((in @ (kpair @ Y1 @ Y3) @ (cartprod @ Y2 @ Y0)) => (in @ Y3 @ Y0))))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f281])).
% 9.54/1.99 thf(f736,plain,(
% 9.54/1.99 (setukpairIR = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y0 @ (setunion @ (setadjoin @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset)) @ emptyset))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f500])).
% 9.54/1.99 thf(f737,plain,(
% 9.54/1.99 (eqinunit = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset)))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f496])).
% 9.54/1.99 thf(f740,plain,(
% 9.54/1.99 (binintersectSubset1 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((binintersect @ Y1 @ Y0) = Y1) => (subset @ Y1 @ Y0))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f289])).
% 9.54/1.99 thf(f741,plain,(
% 9.54/1.99 (dpsetconstrSub = ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $i > $o) @ (^[Y1 : $i > $i > $o]: (!! @ $i @ (^[Y2 : $i]: (subset @ (dpsetconstr @ Y2 @ Y0 @ (^[Y3 : $i]: ((^[Y4 : $i]: (Y1 @ Y3 @ Y4))))) @ (cartprod @ Y2 @ Y0))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f297])).
% 9.54/1.99 thf(f742,plain,(
% 9.54/1.99 (upairsetE = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setadjoin @ Y2 @ (setadjoin @ Y0 @ emptyset))) => ((Y2 = Y1) | (Y1 = Y0)))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f295])).
% 9.54/1.99 thf(f743,plain,(
% 9.54/1.99 (nonemptyI1 = ((!! @ $i @ (^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: (in @ Y1 @ Y0))) => (nonempty @ Y0))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f423])).
% 9.54/1.99 thf(f744,plain,(
% 9.54/1.99 (subPowSU = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ Y1) => (in @ Y0 @ (powerset @ (setunion @ Y1))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f245])).
% 9.54/1.99 thf(f745,plain,(
% 9.54/1.99 (emptyI = ((!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: (~ (in @ Y1 @ Y0)))) => (emptyset = Y0))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f415])).
% 9.54/1.99 thf(f747,plain,(
% 9.54/1.99 (emptyinPowerset = ((!! @ $i @ (^[Y0 : $i]: (in @ emptyset @ (powerset @ Y0))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f271])).
% 9.54/1.99 thf(f750,plain,(
% 9.54/1.99 (emptyInPowerset = ((!! @ $i @ (^[Y0 : $i]: (in @ emptyset @ (powerset @ Y0))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f239])).
% 9.54/1.99 thf(f751,plain,(
% 9.54/1.99 (setunionE2 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setunion @ Y0)) => (?? @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) & (in @ Y2 @ Y0)))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f437])).
% 9.54/1.99 thf(f753,plain,(
% 9.54/1.99 (upairequniteq = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((setadjoin @ Y1 @ emptyset) = (setadjoin @ Y0 @ (setadjoin @ Y2 @ emptyset))) => (Y2 = Y0))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f533])).
% 9.54/1.99 thf(f754,plain,(
% 9.54/1.99 (powersetI = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (in @ Y2 @ Y1)))) => (in @ Y0 @ (powerset @ Y1)))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f293])).
% 9.54/1.99 thf(f756,plain,(
% 9.54/1.99 (exuE1 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((exu @ (^[Y1 : $i]: (Y0 @ Y1))) => (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2))))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f334])).
% 9.54/1.99 thf(f757,plain,(
% 9.54/1.99 (dsetconstrEL = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ (dsetconstr @ Y0 @ (^[Y3 : $i]: (Y2 @ Y3)))) => (in @ Y1 @ Y0))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f506])).
% 9.54/1.99 thf(f758,plain,(
% 9.54/1.99 (setminusI = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => ((~ (in @ Y2 @ Y0)) => (in @ Y2 @ (setminus @ Y1 @ Y0))))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f477])).
% 9.54/1.99 thf(f759,plain,(
% 9.54/1.99 (dsetconstrER = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (dsetconstr @ Y2 @ (^[Y3 : $i]: (Y0 @ Y3)))) => (Y0 @ Y1))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f559])).
% 9.54/1.99 thf(f760,plain,(
% 9.54/1.99 (setadjoinSub2 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y1 @ Y2) => (subset @ Y1 @ (setadjoin @ Y0 @ Y2)))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f387])).
% 9.54/1.99 thf(f761,plain,(
% 9.54/1.99 (exuE2 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((exu @ (^[Y1 : $i]: (Y0 @ Y1))) => (?? @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) = (Y1 = Y2)))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f375])).
% 9.54/1.99 thf(f763,plain,(
% 9.54/1.99 (quantDeMorgan3 = ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((~ (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) & (Y1 @ Y2))))) => (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (~ (Y1 @ Y2))))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f456])).
% 9.54/1.99 thf(f765,plain,(
% 9.54/1.99 (setunionE = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setunion @ Y1)) => (!! @ $o @ (^[Y2 : $o]: ((!! @ $i @ (^[Y3 : $i]: ((in @ Y0 @ Y3) => ((in @ Y3 @ Y1) => Y2)))) => Y2))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f504])).
% 9.54/1.99 thf(f767,plain,(
% 9.54/1.99 (binintersectLsub = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ (binintersect @ Y1 @ Y0) @ Y1)))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f371])).
% 9.54/1.99 thf(f769,plain,(
% 9.54/1.99 (ubforcartprodlem1 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => (subset @ (setadjoin @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y1 @ (setadjoin @ Y3 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ Y2 @ Y0)))))))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f561])).
% 9.54/1.99 thf(f771,plain,(
% 9.54/1.99 (noeltsimpempty = ((!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: (~ (in @ Y1 @ Y0)))) => (emptyset = Y0))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f322])).
% 9.54/1.99 thf(f773,plain,(
% 9.54/1.99 (setminusSubset1 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((emptyset = (setminus @ Y1 @ Y0)) => (subset @ Y1 @ Y0))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f510])).
% 9.54/1.99 thf(f774,plain,(
% 9.54/1.99 (upairset2E = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (setadjoin @ Y2 @ (setadjoin @ Y1 @ emptyset))) => ((Y2 = Y0) | (Y1 = Y0)))))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f363])).
% 9.54/1.99 thf(f782,plain,(
% 9.54/1.99 (singletoninpowerset = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ Y1) => (in @ (setadjoin @ Y0 @ emptyset) @ (powerset @ Y1)))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f221])).
% 9.54/1.99 thf(f783,plain,(
% 9.54/1.99 (singletonsuniq = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((setadjoin @ Y0 @ emptyset) = (setadjoin @ Y1 @ emptyset)) => (Y1 = Y0))))))))),
% 9.54/1.99 inference(cnf_transformation,[],[f469])).
% 9.54/1.99 thf(f787,definition,(
% 9.54/1.99 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 9.54/1.99 introduced(theory,[fool_exhaustiveness_axiom])).
% 9.54/1.99 thf(f788,plain,(
% 9.54/1.99 (ex1 = (^[Y0 : $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) & ((setadjoin @ Y3 @ emptyset) = Y2))))) @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (Y1 @ Y2))))))))),
% 9.54/1.99 inference(definition_unfolding,[],[f620,f639])).
% 9.54/1.99 thf(f789,plain,(
% 9.54/1.99 (func = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: (((^[Y3 : $i]: ((^[Y4 : $i]: ((^[Y5 : $i]: (subset @ Y5 @ (cartprod @ Y3 @ Y4))))))) @ Y0 @ Y1 @ Y2) & (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((^[Y4 : $i]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: (?? @ $i @ (^[Y7 : $i]: ((in @ Y7 @ Y6) & ((setadjoin @ Y7 @ emptyset) = Y6))))) @ (dsetconstr @ Y4 @ (^[Y6 : $i]: (Y5 @ Y6))))))) @ Y1 @ (^[Y4 : $i]: (in @ (kpair @ Y3 @ Y4) @ Y2)))))))))))))),
% 9.54/1.99 inference(definition_unfolding,[],[f697,f713,f788])).
% 9.54/1.99 thf(f791,plain,(
% 9.54/1.99 (ex1E1 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (((^[Y2 : $i]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (?? @ $i @ (^[Y5 : $i]: ((in @ Y5 @ Y4) & ((setadjoin @ Y5 @ emptyset) = Y4))))) @ (dsetconstr @ Y2 @ (^[Y4 : $i]: (Y3 @ Y4))))))) @ Y1 @ (^[Y2 : $i]: (Y0 @ Y2))) => (?? @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) & (in @ Y2 @ Y1)))))))))))),
% 9.54/1.99 inference(definition_unfolding,[],[f587,f788])).
% 9.54/1.99 thf(f792,plain,(
% 9.54/1.99 (nonemptyImpWitness = ((!! @ $i @ (^[Y0 : $i]: (((^[Y1 : $i]: (~ (emptyset = Y1))) @ Y0) => (?? @ $i @ (^[Y1 : $i]: ($true & (in @ Y1 @ Y0)))))))))),
% 9.54/1.99 inference(definition_unfolding,[],[f602,f666])).
% 9.54/1.99 thf(f793,plain,(
% 9.54/1.99 ($true = ((~ (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 => (binunionIL => (upairset2IR => (binunionIR => (binunionEcases => (binunionE => (binunionLsub => (binunionRsub => (binintersectI => (binintersectSubset5 => (binintersectEL => (binintersectLsub => (binintersectSubset2 => (binintersectSubset3 => (binintersectER => (disjointsetsI1 => (binintersectRsub => (binintersectSubset4 => (binintersectSubset1 => (bs114d => (setminusI => (setminusEL => (setminusER => (setminusSubset2 => (setminusERneg => (setminusELneg => (setminusILneg => (setminusIRneg => (setminusLsub => (setminusSubset1 => (symdiffE => (symdiffI1 => (symdiffI2 => (symdiffIneg1 => (symdiffIneg2 => (secondinupair => (setukpairIL => (setukpairIR => (kpairiskpair => (kpairp => (singletonsubset => (singletoninpowerset => (singletoninpowunion => (upairset2E => (upairsubunion => (upairinpowunion => (ubforcartprodlem1 => (ubforcartprodlem2 => (ubforcartprodlem3 => (cartprodpairin => (cartprodmempair1 => (cartprodmempair => (setunionE2 => (setunionsingleton1 => (setunionsingleton2 => (setunionsingleton => (singletonprop => (ex1E1 => (ex1I => (ex1I2 => (singletonsuniq => (setukpairinjL1 => (kfstsingleton => (theprop => (kfstpairEq => (cartprodfstin => (setukpairinjL2 => (setukpairinjL => (setukpairinjR11 => (setukpairinjR12 => (setukpairinjR1 => (upairequniteq => (setukpairinjR2 => (setukpairinjR => (ksndsingleton => (ksndpairEq => (kpairsurjEq => (cartprodsndin => (cartprodpairmemEL => (cartprodpairmemER => (cartprodmempaircEq => (cartprodfstpairEq => (cartprodsndpairEq => (cartprodpairsurjEq => (dpsetconstrI => (dpsetconstrSub => (setOfPairsIsBReln => (dpsetconstrERa => (dpsetconstrEL1 => (dpsetconstrEL2 => (dpsetconstrER => (funcImageSingleton => (apProp => (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((^[Y3 : $i]: ((^[Y4 : $i]: ((^[Y5 : $i]: (((^[Y6 : $i]: ((^[Y7 : $i]: ((^[Y8 : $i]: (subset @ Y8 @ (cartprod @ Y6 @ Y7))))))) @ Y3 @ Y4 @ Y5) & (!! @ $i @ (^[Y6 : $i]: ((in @ Y6 @ Y3) => ((^[Y7 : $i]: ((^[Y8 : $i > $o]: ((^[Y9 : $i]: (?? @ $i @ (^[Y10 : $i]: ((in @ Y10 @ Y9) & ((setadjoin @ Y10 @ emptyset) = Y9))))) @ (dsetconstr @ Y7 @ (^[Y9 : $i]: (Y8 @ Y9))))))) @ Y4 @ (^[Y7 : $i]: (in @ (kpair @ Y6 @ Y7) @ Y5)))))))))))) @ Y1 @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => (in @ ((^[Y4 : $i]: ((^[Y5 : $i]: ((^[Y6 : $i]: ((^[Y7 : $i]: (setunion @ (dsetconstr @ Y5 @ (^[Y8 : $i]: (in @ (kpair @ Y7 @ Y8) @ Y6))))))))))) @ Y1 @ Y2 @ Y0 @ Y3) @ Y2))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),
% 9.54/1.99 inference(definition_unfolding,[],[f607,f789,f645])).
% 9.54/1.99 thf(f794,plain,(
% 9.54/1.99 (nonemptyE1 = ((!! @ $i @ (^[Y0 : $i]: (((^[Y1 : $i]: (~ (emptyset = Y1))) @ Y0) => (?? @ $i @ (^[Y1 : $i]: (in @ Y1 @ Y0))))))))),
% 9.54/1.99 inference(definition_unfolding,[],[f608,f666])).
% 9.54/1.99 thf(f795,plain,(
% 9.54/1.99 (exuI2 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((?? @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y1 = Y2) = (Y0 @ Y2)))))) => ((^[Y1 : $i > $o]: (?? @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) & (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) => (Y2 = Y3)))))))) @ (^[Y1 : $i]: (Y0 @ Y1))))))))),
% 9.54/1.99 inference(definition_unfolding,[],[f609,f660])).
% 9.54/1.99 thf(f797,plain,(
% 9.54/1.99 (nonemptyI = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ Y0) => ((Y2 @ Y1) => ((^[Y3 : $i]: (~ (emptyset = Y3))) @ (dsetconstr @ Y0 @ (^[Y3 : $i]: (Y2 @ Y3))))))))))))))),
% 9.54/1.99 inference(definition_unfolding,[],[f621,f666])).
% 9.54/1.99 thf(f799,plain,(
% 9.54/1.99 (apProp = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((^[Y3 : $i]: ((^[Y4 : $i]: ((^[Y5 : $i]: (((^[Y6 : $i]: ((^[Y7 : $i]: ((^[Y8 : $i]: (subset @ Y8 @ (cartprod @ Y6 @ Y7))))))) @ Y3 @ Y4 @ Y5) & (!! @ $i @ (^[Y6 : $i]: ((in @ Y6 @ Y3) => ((^[Y7 : $i]: ((^[Y8 : $i > $o]: ((^[Y9 : $i]: (?? @ $i @ (^[Y10 : $i]: ((in @ Y10 @ Y9) & ((setadjoin @ Y10 @ emptyset) = Y9))))) @ (dsetconstr @ Y7 @ (^[Y9 : $i]: (Y8 @ Y9))))))) @ Y4 @ (^[Y7 : $i]: (in @ (kpair @ Y6 @ Y7) @ Y5)))))))))))) @ Y1 @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => (in @ (setunion @ (dsetconstr @ Y2 @ (^[Y4 : $i]: (in @ (kpair @ Y3 @ Y4) @ Y0)))) @ Y2)))))))))))))),
% 9.54/1.99 inference(definition_unfolding,[],[f647,f789])).
% 9.54/1.99 thf(f802,plain,(
% 9.54/1.99 (theprop = ((!! @ $i @ (^[Y0 : $i]: (((^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) & ((setadjoin @ Y2 @ emptyset) = Y1))))) @ Y0) => (in @ (setunion @ Y0) @ Y0))))))),
% 9.54/1.99 inference(definition_unfolding,[],[f673,f639])).
% 9.54/1.99 thf(f809,plain,(
% 9.54/1.99 (exuI3 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((?? @ $i @ (^[Y1 : $i]: (Y0 @ Y1))) => ((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y1) => ((Y0 @ Y2) => (Y2 = Y1))))))) => ((^[Y1 : $i > $o]: (?? @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) & (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) => (Y2 = Y3)))))))) @ (^[Y1 : $i]: (Y0 @ Y1)))))))))),
% 9.54/1.99 inference(definition_unfolding,[],[f730,f660])).
% 9.54/1.99 thf(f810,plain,(
% 9.54/1.99 (nonemptyI1 = ((!! @ $i @ (^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: (in @ Y1 @ Y0))) => ((^[Y1 : $i]: (~ (emptyset = Y1))) @ Y0))))))),
% 9.54/1.99 inference(definition_unfolding,[],[f743,f666])).
% 9.54/1.99 thf(f813,plain,(
% 9.54/1.99 (exuE1 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (((^[Y1 : $i > $o]: (?? @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) & (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) => (Y2 = Y3)))))))) @ (^[Y1 : $i]: (Y0 @ Y1))) => (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2))))))))))))),
% 9.54/1.99 inference(definition_unfolding,[],[f756,f660])).
% 9.54/1.99 thf(f814,plain,(
% 9.54/1.99 (exuE2 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (((^[Y1 : $i > $o]: (?? @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) & (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) => (Y2 = Y3)))))))) @ (^[Y1 : $i]: (Y0 @ Y1))) => (?? @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) = (Y1 = Y2)))))))))))),
% 9.54/1.99 inference(definition_unfolding,[],[f761,f660])).
% 9.54/1.99 thf(f818,definition,(
% 9.54/1.99 (sF0 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((^[Y3 : $i]: ((^[Y4 : $i]: ((^[Y5 : $i]: (((^[Y6 : $i]: ((^[Y7 : $i]: ((^[Y8 : $i]: (subset @ Y8 @ (cartprod @ Y6 @ Y7))))))) @ Y3 @ Y4 @ Y5) & (!! @ $i @ (^[Y6 : $i]: ((in @ Y6 @ Y3) => ((^[Y7 : $i]: ((^[Y8 : $i > $o]: ((^[Y9 : $i]: (?? @ $i @ (^[Y10 : $i]: ((in @ Y10 @ Y9) & ((setadjoin @ Y10 @ emptyset) = Y9))))) @ (dsetconstr @ Y7 @ (^[Y9 : $i]: (Y8 @ Y9))))))) @ Y4 @ (^[Y7 : $i]: (in @ (kpair @ Y6 @ Y7) @ Y5)))))))))))) @ Y1 @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => (in @ ((^[Y4 : $i]: ((^[Y5 : $i]: ((^[Y6 : $i]: ((^[Y7 : $i]: (setunion @ (dsetconstr @ Y5 @ (^[Y8 : $i]: (in @ (kpair @ Y7 @ Y8) @ Y6))))))))))) @ Y1 @ Y2 @ Y0 @ Y3) @ Y2)))))))))))))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF0])],[function_definition])).
% 9.54/1.99 thf(f819,definition,(
% 9.54/1.99 (sF1 = ((apProp => sF0)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF1])],[function_definition])).
% 9.54/1.99 thf(f820,definition,(
% 9.54/1.99 (sF2 = ((funcImageSingleton => sF1)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF2])],[function_definition])).
% 9.54/1.99 thf(f821,plain,(
% 9.54/1.99 (((funcImageSingleton => sF1)) = sF2)),
% 9.54/1.99 inference(reorient_equations,[],[f820])).
% 9.54/1.99 thf(f822,definition,(
% 9.54/1.99 (sF3 = ((dpsetconstrER => sF2)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF3])],[function_definition])).
% 9.54/1.99 thf(f823,definition,(
% 9.54/1.99 (sF4 = ((dpsetconstrEL2 => sF3)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF4])],[function_definition])).
% 9.54/1.99 thf(f824,plain,(
% 9.54/1.99 (((dpsetconstrEL2 => sF3)) = sF4)),
% 9.54/1.99 inference(reorient_equations,[],[f823])).
% 9.54/1.99 thf(f825,definition,(
% 9.54/1.99 (sF5 = ((dpsetconstrEL1 => sF4)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF5])],[function_definition])).
% 9.54/1.99 thf(f826,plain,(
% 9.54/1.99 (((dpsetconstrEL1 => sF4)) = sF5)),
% 9.54/1.99 inference(reorient_equations,[],[f825])).
% 9.54/1.99 thf(f827,definition,(
% 9.54/1.99 (sF6 = ((dpsetconstrERa => sF5)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF6])],[function_definition])).
% 9.54/1.99 thf(f828,definition,(
% 9.54/1.99 (sF7 = ((setOfPairsIsBReln => sF6)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF7])],[function_definition])).
% 9.54/1.99 thf(f829,plain,(
% 9.54/1.99 (((setOfPairsIsBReln => sF6)) = sF7)),
% 9.54/1.99 inference(reorient_equations,[],[f828])).
% 9.54/1.99 thf(f830,definition,(
% 9.54/1.99 (sF8 = ((dpsetconstrSub => sF7)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF8])],[function_definition])).
% 9.54/1.99 thf(f831,definition,(
% 9.54/1.99 (sF9 = ((dpsetconstrI => sF8)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF9])],[function_definition])).
% 9.54/1.99 thf(f832,definition,(
% 9.54/1.99 (sF10 = ((cartprodpairsurjEq => sF9)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF10])],[function_definition])).
% 9.54/1.99 thf(f833,definition,(
% 9.54/1.99 (sF11 = ((cartprodsndpairEq => sF10)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF11])],[function_definition])).
% 9.54/1.99 thf(f834,plain,(
% 9.54/1.99 (((cartprodsndpairEq => sF10)) = sF11)),
% 9.54/1.99 inference(reorient_equations,[],[f833])).
% 9.54/1.99 thf(f835,definition,(
% 9.54/1.99 (sF12 = ((cartprodfstpairEq => sF11)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF12])],[function_definition])).
% 9.54/1.99 thf(f836,plain,(
% 9.54/1.99 (((cartprodfstpairEq => sF11)) = sF12)),
% 9.54/1.99 inference(reorient_equations,[],[f835])).
% 9.54/1.99 thf(f837,definition,(
% 9.54/1.99 (sF13 = ((cartprodmempaircEq => sF12)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF13])],[function_definition])).
% 9.54/1.99 thf(f838,plain,(
% 9.54/1.99 (((cartprodmempaircEq => sF12)) = sF13)),
% 9.54/1.99 inference(reorient_equations,[],[f837])).
% 9.54/1.99 thf(f839,definition,(
% 9.54/1.99 (sF14 = ((cartprodpairmemER => sF13)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF14])],[function_definition])).
% 9.54/1.99 thf(f840,plain,(
% 9.54/1.99 (((cartprodpairmemER => sF13)) = sF14)),
% 9.54/1.99 inference(reorient_equations,[],[f839])).
% 9.54/1.99 thf(f841,definition,(
% 9.54/1.99 (sF15 = ((cartprodpairmemEL => sF14)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF15])],[function_definition])).
% 9.54/1.99 thf(f842,definition,(
% 9.54/1.99 (sF16 = ((cartprodsndin => sF15)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF16])],[function_definition])).
% 9.54/1.99 thf(f843,plain,(
% 9.54/1.99 (((cartprodsndin => sF15)) = sF16)),
% 9.54/1.99 inference(reorient_equations,[],[f842])).
% 9.54/1.99 thf(f844,definition,(
% 9.54/1.99 (sF17 = ((kpairsurjEq => sF16)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF17])],[function_definition])).
% 9.54/1.99 thf(f845,definition,(
% 9.54/1.99 (sF18 = ((ksndpairEq => sF17)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF18])],[function_definition])).
% 9.54/1.99 thf(f846,plain,(
% 9.54/1.99 (((ksndpairEq => sF17)) = sF18)),
% 9.54/1.99 inference(reorient_equations,[],[f845])).
% 9.54/1.99 thf(f847,definition,(
% 9.54/1.99 (sF19 = ((ksndsingleton => sF18)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF19])],[function_definition])).
% 9.54/1.99 thf(f848,plain,(
% 9.54/1.99 (((ksndsingleton => sF18)) = sF19)),
% 9.54/1.99 inference(reorient_equations,[],[f847])).
% 9.54/1.99 thf(f849,definition,(
% 9.54/1.99 (sF20 = ((setukpairinjR => sF19)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF20])],[function_definition])).
% 9.54/1.99 thf(f850,plain,(
% 9.54/1.99 (((setukpairinjR => sF19)) = sF20)),
% 9.54/1.99 inference(reorient_equations,[],[f849])).
% 9.54/1.99 thf(f851,definition,(
% 9.54/1.99 (sF21 = ((setukpairinjR2 => sF20)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF21])],[function_definition])).
% 9.54/1.99 thf(f852,definition,(
% 9.54/1.99 (sF22 = ((upairequniteq => sF21)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF22])],[function_definition])).
% 9.54/1.99 thf(f853,definition,(
% 9.54/1.99 (sF23 = ((setukpairinjR1 => sF22)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF23])],[function_definition])).
% 9.54/1.99 thf(f854,definition,(
% 9.54/1.99 (sF24 = ((setukpairinjR12 => sF23)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF24])],[function_definition])).
% 9.54/1.99 thf(f855,definition,(
% 9.54/1.99 (sF25 = ((setukpairinjR11 => sF24)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF25])],[function_definition])).
% 9.54/1.99 thf(f856,plain,(
% 9.54/1.99 (((setukpairinjR11 => sF24)) = sF25)),
% 9.54/1.99 inference(reorient_equations,[],[f855])).
% 9.54/1.99 thf(f857,definition,(
% 9.54/1.99 (sF26 = ((setukpairinjL => sF25)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF26])],[function_definition])).
% 9.54/1.99 thf(f858,plain,(
% 9.54/1.99 (((setukpairinjL => sF25)) = sF26)),
% 9.54/1.99 inference(reorient_equations,[],[f857])).
% 9.54/1.99 thf(f859,definition,(
% 9.54/1.99 (sF27 = ((setukpairinjL2 => sF26)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF27])],[function_definition])).
% 9.54/1.99 thf(f860,plain,(
% 9.54/1.99 (((setukpairinjL2 => sF26)) = sF27)),
% 9.54/1.99 inference(reorient_equations,[],[f859])).
% 9.54/1.99 thf(f861,definition,(
% 9.54/1.99 (sF28 = ((cartprodfstin => sF27)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF28])],[function_definition])).
% 9.54/1.99 thf(f862,definition,(
% 9.54/1.99 (sF29 = ((kfstpairEq => sF28)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF29])],[function_definition])).
% 9.54/1.99 thf(f863,definition,(
% 9.54/1.99 (sF30 = ((theprop => sF29)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF30])],[function_definition])).
% 9.54/1.99 thf(f864,definition,(
% 9.54/1.99 (sF31 = ((kfstsingleton => sF30)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF31])],[function_definition])).
% 9.54/1.99 thf(f865,plain,(
% 9.54/1.99 (((kfstsingleton => sF30)) = sF31)),
% 9.54/1.99 inference(reorient_equations,[],[f864])).
% 9.54/1.99 thf(f866,definition,(
% 9.54/1.99 (sF32 = ((setukpairinjL1 => sF31)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF32])],[function_definition])).
% 9.54/1.99 thf(f867,definition,(
% 9.54/1.99 (sF33 = ((singletonsuniq => sF32)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF33])],[function_definition])).
% 9.54/1.99 thf(f868,plain,(
% 9.54/1.99 (((singletonsuniq => sF32)) = sF33)),
% 9.54/1.99 inference(reorient_equations,[],[f867])).
% 9.54/1.99 thf(f869,definition,(
% 9.54/1.99 (sF34 = ((ex1I2 => sF33)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF34])],[function_definition])).
% 9.54/1.99 thf(f870,plain,(
% 9.54/1.99 (((ex1I2 => sF33)) = sF34)),
% 9.54/1.99 inference(reorient_equations,[],[f869])).
% 9.54/1.99 thf(f871,definition,(
% 9.54/1.99 (sF35 = ((ex1I => sF34)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF35])],[function_definition])).
% 9.54/1.99 thf(f872,definition,(
% 9.54/1.99 (sF36 = ((ex1E1 => sF35)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF36])],[function_definition])).
% 9.54/1.99 thf(f873,plain,(
% 9.54/1.99 (((ex1E1 => sF35)) = sF36)),
% 9.54/1.99 inference(reorient_equations,[],[f872])).
% 9.54/1.99 thf(f874,definition,(
% 9.54/1.99 (sF37 = ((singletonprop => sF36)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF37])],[function_definition])).
% 9.54/1.99 thf(f875,definition,(
% 9.54/1.99 (sF38 = ((setunionsingleton => sF37)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF38])],[function_definition])).
% 9.54/1.99 thf(f876,plain,(
% 9.54/1.99 (((setunionsingleton => sF37)) = sF38)),
% 9.54/1.99 inference(reorient_equations,[],[f875])).
% 9.54/1.99 thf(f877,definition,(
% 9.54/1.99 (sF39 = ((setunionsingleton2 => sF38)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF39])],[function_definition])).
% 9.54/1.99 thf(f878,plain,(
% 9.54/1.99 (((setunionsingleton2 => sF38)) = sF39)),
% 9.54/1.99 inference(reorient_equations,[],[f877])).
% 9.54/1.99 thf(f879,definition,(
% 9.54/1.99 (sF40 = ((setunionsingleton1 => sF39)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF40])],[function_definition])).
% 9.54/1.99 thf(f880,definition,(
% 9.54/1.99 (sF41 = ((setunionE2 => sF40)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF41])],[function_definition])).
% 9.54/1.99 thf(f881,definition,(
% 9.54/1.99 (sF42 = ((cartprodmempair => sF41)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF42])],[function_definition])).
% 9.54/1.99 thf(f882,definition,(
% 9.54/1.99 (sF43 = ((cartprodmempair1 => sF42)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF43])],[function_definition])).
% 9.54/1.99 thf(f883,definition,(
% 9.54/1.99 (sF44 = ((cartprodpairin => sF43)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF44])],[function_definition])).
% 9.54/1.99 thf(f884,definition,(
% 9.54/1.99 (sF45 = ((ubforcartprodlem3 => sF44)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF45])],[function_definition])).
% 9.54/1.99 thf(f885,plain,(
% 9.54/1.99 (((ubforcartprodlem3 => sF44)) = sF45)),
% 9.54/1.99 inference(reorient_equations,[],[f884])).
% 9.54/1.99 thf(f886,definition,(
% 9.54/1.99 (sF46 = ((ubforcartprodlem2 => sF45)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF46])],[function_definition])).
% 9.54/1.99 thf(f887,definition,(
% 9.54/1.99 (sF47 = ((ubforcartprodlem1 => sF46)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF47])],[function_definition])).
% 9.54/1.99 thf(f888,plain,(
% 9.54/1.99 (((ubforcartprodlem1 => sF46)) = sF47)),
% 9.54/1.99 inference(reorient_equations,[],[f887])).
% 9.54/1.99 thf(f889,definition,(
% 9.54/1.99 (sF48 = ((upairinpowunion => sF47)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF48])],[function_definition])).
% 9.54/1.99 thf(f890,plain,(
% 9.54/1.99 (((upairinpowunion => sF47)) = sF48)),
% 9.54/1.99 inference(reorient_equations,[],[f889])).
% 9.54/1.99 thf(f891,definition,(
% 9.54/1.99 (sF49 = ((upairsubunion => sF48)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF49])],[function_definition])).
% 9.54/1.99 thf(f892,plain,(
% 9.54/1.99 (((upairsubunion => sF48)) = sF49)),
% 9.54/1.99 inference(reorient_equations,[],[f891])).
% 9.54/1.99 thf(f893,definition,(
% 9.54/1.99 (sF50 = ((upairset2E => sF49)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF50])],[function_definition])).
% 9.54/1.99 thf(f894,definition,(
% 9.54/1.99 (sF51 = ((singletoninpowunion => sF50)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF51])],[function_definition])).
% 9.54/1.99 thf(f895,definition,(
% 9.54/1.99 (sF52 = ((singletoninpowerset => sF51)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF52])],[function_definition])).
% 9.54/1.99 thf(f896,definition,(
% 9.54/1.99 (sF53 = ((singletonsubset => sF52)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF53])],[function_definition])).
% 9.54/1.99 thf(f897,plain,(
% 9.54/1.99 (((singletonsubset => sF52)) = sF53)),
% 9.54/1.99 inference(reorient_equations,[],[f896])).
% 9.54/1.99 thf(f898,definition,(
% 9.54/1.99 (sF54 = ((kpairp => sF53)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF54])],[function_definition])).
% 9.54/1.99 thf(f899,definition,(
% 9.54/1.99 (sF55 = ((kpairiskpair => sF54)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF55])],[function_definition])).
% 9.54/1.99 thf(f900,definition,(
% 9.54/1.99 (sF56 = ((setukpairIR => sF55)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF56])],[function_definition])).
% 9.54/1.99 thf(f901,definition,(
% 9.54/1.99 (sF57 = ((setukpairIL => sF56)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF57])],[function_definition])).
% 9.54/1.99 thf(f902,definition,(
% 9.54/1.99 (sF58 = ((secondinupair => sF57)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF58])],[function_definition])).
% 9.54/1.99 thf(f903,plain,(
% 9.54/1.99 (((secondinupair => sF57)) = sF58)),
% 9.54/1.99 inference(reorient_equations,[],[f902])).
% 9.54/1.99 thf(f904,definition,(
% 9.54/1.99 (sF59 = ((symdiffIneg2 => sF58)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF59])],[function_definition])).
% 9.54/1.99 thf(f905,plain,(
% 9.54/1.99 (((symdiffIneg2 => sF58)) = sF59)),
% 9.54/1.99 inference(reorient_equations,[],[f904])).
% 9.54/1.99 thf(f906,definition,(
% 9.54/1.99 (sF60 = ((symdiffIneg1 => sF59)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF60])],[function_definition])).
% 9.54/1.99 thf(f907,plain,(
% 9.54/1.99 (((symdiffIneg1 => sF59)) = sF60)),
% 9.54/1.99 inference(reorient_equations,[],[f906])).
% 9.54/1.99 thf(f908,definition,(
% 9.54/1.99 (sF61 = ((symdiffI2 => sF60)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF61])],[function_definition])).
% 9.54/1.99 thf(f909,plain,(
% 9.54/1.99 (((symdiffI2 => sF60)) = sF61)),
% 9.54/1.99 inference(reorient_equations,[],[f908])).
% 9.54/1.99 thf(f910,definition,(
% 9.54/1.99 (sF62 = ((symdiffI1 => sF61)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF62])],[function_definition])).
% 9.54/1.99 thf(f911,plain,(
% 9.54/1.99 (((symdiffI1 => sF61)) = sF62)),
% 9.54/1.99 inference(reorient_equations,[],[f910])).
% 9.54/1.99 thf(f912,definition,(
% 9.54/1.99 (sF63 = ((symdiffE => sF62)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF63])],[function_definition])).
% 9.54/1.99 thf(f913,definition,(
% 9.54/1.99 (sF64 = ((setminusSubset1 => sF63)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF64])],[function_definition])).
% 9.54/1.99 thf(f914,plain,(
% 9.54/1.99 (((setminusSubset1 => sF63)) = sF64)),
% 9.54/1.99 inference(reorient_equations,[],[f913])).
% 9.54/1.99 thf(f915,definition,(
% 9.54/1.99 (sF65 = ((setminusLsub => sF64)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF65])],[function_definition])).
% 9.54/1.99 thf(f916,definition,(
% 9.54/1.99 (sF66 = ((setminusIRneg => sF65)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF66])],[function_definition])).
% 9.54/1.99 thf(f917,plain,(
% 9.54/1.99 (((setminusIRneg => sF65)) = sF66)),
% 9.54/1.99 inference(reorient_equations,[],[f916])).
% 9.54/1.99 thf(f918,definition,(
% 9.54/1.99 (sF67 = ((setminusILneg => sF66)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF67])],[function_definition])).
% 9.54/1.99 thf(f919,plain,(
% 9.54/1.99 (((setminusILneg => sF66)) = sF67)),
% 9.54/1.99 inference(reorient_equations,[],[f918])).
% 9.54/1.99 thf(f920,definition,(
% 9.54/1.99 (sF68 = ((setminusELneg => sF67)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF68])],[function_definition])).
% 9.54/1.99 thf(f921,plain,(
% 9.54/1.99 (((setminusELneg => sF67)) = sF68)),
% 9.54/1.99 inference(reorient_equations,[],[f920])).
% 9.54/1.99 thf(f922,definition,(
% 9.54/1.99 (sF69 = ((setminusERneg => sF68)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF69])],[function_definition])).
% 9.54/1.99 thf(f923,definition,(
% 9.54/1.99 (sF70 = ((setminusSubset2 => sF69)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF70])],[function_definition])).
% 9.54/1.99 thf(f924,plain,(
% 9.54/1.99 (((setminusSubset2 => sF69)) = sF70)),
% 9.54/1.99 inference(reorient_equations,[],[f923])).
% 9.54/1.99 thf(f925,definition,(
% 9.54/1.99 (sF71 = ((setminusER => sF70)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF71])],[function_definition])).
% 9.54/1.99 thf(f926,plain,(
% 9.54/1.99 (((setminusER => sF70)) = sF71)),
% 9.54/1.99 inference(reorient_equations,[],[f925])).
% 9.54/1.99 thf(f927,definition,(
% 9.54/1.99 (sF72 = ((setminusEL => sF71)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF72])],[function_definition])).
% 9.54/1.99 thf(f928,plain,(
% 9.54/1.99 (((setminusEL => sF71)) = sF72)),
% 9.54/1.99 inference(reorient_equations,[],[f927])).
% 9.54/1.99 thf(f929,definition,(
% 9.54/1.99 (sF73 = ((setminusI => sF72)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF73])],[function_definition])).
% 9.54/1.99 thf(f930,plain,(
% 9.54/1.99 (((setminusI => sF72)) = sF73)),
% 9.54/1.99 inference(reorient_equations,[],[f929])).
% 9.54/1.99 thf(f931,definition,(
% 9.54/1.99 (sF74 = ((bs114d => sF73)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF74])],[function_definition])).
% 9.54/1.99 thf(f932,plain,(
% 9.54/1.99 (((bs114d => sF73)) = sF74)),
% 9.54/1.99 inference(reorient_equations,[],[f931])).
% 9.54/1.99 thf(f933,definition,(
% 9.54/1.99 (sF75 = ((binintersectSubset1 => sF74)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF75])],[function_definition])).
% 9.54/1.99 thf(f934,plain,(
% 9.54/1.99 (((binintersectSubset1 => sF74)) = sF75)),
% 9.54/1.99 inference(reorient_equations,[],[f933])).
% 9.54/1.99 thf(f935,definition,(
% 9.54/1.99 (sF76 = ((binintersectSubset4 => sF75)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF76])],[function_definition])).
% 9.54/1.99 thf(f936,plain,(
% 9.54/1.99 (((binintersectSubset4 => sF75)) = sF76)),
% 9.54/1.99 inference(reorient_equations,[],[f935])).
% 9.54/1.99 thf(f937,definition,(
% 9.54/1.99 (sF77 = ((binintersectRsub => sF76)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF77])],[function_definition])).
% 9.54/1.99 thf(f938,definition,(
% 9.54/1.99 (sF78 = ((disjointsetsI1 => sF77)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF78])],[function_definition])).
% 9.54/1.99 thf(f939,definition,(
% 9.54/1.99 (sF79 = ((binintersectER => sF78)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF79])],[function_definition])).
% 9.54/1.99 thf(f940,definition,(
% 9.54/1.99 (sF80 = ((binintersectSubset3 => sF79)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF80])],[function_definition])).
% 9.54/1.99 thf(f941,definition,(
% 9.54/1.99 (sF81 = ((binintersectSubset2 => sF80)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF81])],[function_definition])).
% 9.54/1.99 thf(f942,definition,(
% 9.54/1.99 (sF82 = ((binintersectLsub => sF81)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF82])],[function_definition])).
% 9.54/1.99 thf(f943,definition,(
% 9.54/1.99 (sF83 = ((binintersectEL => sF82)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF83])],[function_definition])).
% 9.54/1.99 thf(f944,definition,(
% 9.54/1.99 (sF84 = ((binintersectSubset5 => sF83)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF84])],[function_definition])).
% 9.54/1.99 thf(f945,definition,(
% 9.54/1.99 (sF85 = ((binintersectI => sF84)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF85])],[function_definition])).
% 9.54/1.99 thf(f946,definition,(
% 9.54/1.99 (sF86 = ((binunionRsub => sF85)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF86])],[function_definition])).
% 9.54/1.99 thf(f947,plain,(
% 9.54/1.99 (((binunionRsub => sF85)) = sF86)),
% 9.54/1.99 inference(reorient_equations,[],[f946])).
% 9.54/1.99 thf(f948,definition,(
% 9.54/1.99 (sF87 = ((binunionLsub => sF86)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF87])],[function_definition])).
% 9.54/1.99 thf(f949,definition,(
% 9.54/1.99 (sF88 = ((binunionE => sF87)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF88])],[function_definition])).
% 9.54/1.99 thf(f950,definition,(
% 9.54/1.99 (sF89 = ((binunionEcases => sF88)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF89])],[function_definition])).
% 9.54/1.99 thf(f951,definition,(
% 9.54/1.99 (sF90 = ((binunionIR => sF89)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF90])],[function_definition])).
% 9.54/1.99 thf(f952,definition,(
% 9.54/1.99 (sF91 = ((upairset2IR => sF90)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF91])],[function_definition])).
% 9.54/1.99 thf(f953,plain,(
% 9.54/1.99 (((upairset2IR => sF90)) = sF91)),
% 9.54/1.99 inference(reorient_equations,[],[f952])).
% 9.54/1.99 thf(f954,definition,(
% 9.54/1.99 (sF92 = ((binunionIL => sF91)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF92])],[function_definition])).
% 9.54/1.99 thf(f955,plain,(
% 9.54/1.99 (((binunionIL => sF91)) = sF92)),
% 9.54/1.99 inference(reorient_equations,[],[f954])).
% 9.54/1.99 thf(f956,definition,(
% 9.54/1.99 (sF93 = ((sepSubset => sF92)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF93])],[function_definition])).
% 9.54/1.99 thf(f957,definition,(
% 9.54/1.99 (sF94 = ((sepInPowerset => sF93)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF94])],[function_definition])).
% 9.54/1.99 thf(f958,definition,(
% 9.54/1.99 (sF95 = ((powersetsubset => sF94)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF95])],[function_definition])).
% 9.54/1.99 thf(f959,plain,(
% 9.54/1.99 (((powersetsubset => sF94)) = sF95)),
% 9.54/1.99 inference(reorient_equations,[],[f958])).
% 9.54/1.99 thf(f960,definition,(
% 9.54/1.99 (sF96 = ((inPowerset => sF95)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF96])],[function_definition])).
% 9.54/1.99 thf(f961,definition,(
% 9.54/1.99 (sF97 = ((powersetE1 => sF96)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF97])],[function_definition])).
% 9.54/1.99 thf(f962,plain,(
% 9.54/1.99 (((powersetE1 => sF96)) = sF97)),
% 9.54/1.99 inference(reorient_equations,[],[f961])).
% 9.54/1.99 thf(f963,definition,(
% 9.54/1.99 (sF98 = ((powersetI1 => sF97)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF98])],[function_definition])).
% 9.54/1.99 thf(f964,definition,(
% 9.54/1.99 (sF99 = ((subsetemptysetimpeq => sF98)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF99])],[function_definition])).
% 9.54/1.99 thf(f965,definition,(
% 9.54/1.99 (sF100 = ((setextsub => sF99)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF100])],[function_definition])).
% 9.54/1.99 thf(f966,definition,(
% 9.54/1.99 (sF101 = ((subset2powerset => sF100)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF101])],[function_definition])).
% 9.54/1.99 thf(f967,plain,(
% 9.54/1.99 (((subset2powerset => sF100)) = sF101)),
% 9.54/1.99 inference(reorient_equations,[],[f966])).
% 9.54/1.99 thf(f968,definition,(
% 9.54/1.99 (sF102 = ((setadjoinSub2 => sF101)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF102])],[function_definition])).
% 9.54/1.99 thf(f969,definition,(
% 9.54/1.99 (sF103 = ((setadjoinSub => sF102)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF103])],[function_definition])).
% 9.54/1.99 thf(f970,plain,(
% 9.54/1.99 (((setadjoinSub => sF102)) = sF103)),
% 9.54/1.99 inference(reorient_equations,[],[f969])).
% 9.54/1.99 thf(f971,definition,(
% 9.54/1.99 (sF104 = ((subsetTrans => sF103)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF104])],[function_definition])).
% 9.54/1.99 thf(f972,plain,(
% 9.54/1.99 (((subsetTrans => sF103)) = sF104)),
% 9.54/1.99 inference(reorient_equations,[],[f971])).
% 9.54/1.99 thf(f973,definition,(
% 9.54/1.99 (sF105 = ((subsetRefl => sF104)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF105])],[function_definition])).
% 9.54/1.99 thf(f974,plain,(
% 9.54/1.99 (((subsetRefl => sF104)) = sF105)),
% 9.54/1.99 inference(reorient_equations,[],[f973])).
% 9.54/1.99 thf(f975,definition,(
% 9.54/1.99 (sF106 = ((notequalI2 => sF105)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF106])],[function_definition])).
% 9.54/1.99 thf(f976,plain,(
% 9.54/1.99 (((notequalI2 => sF105)) = sF106)),
% 9.54/1.99 inference(reorient_equations,[],[f975])).
% 9.54/1.99 thf(f977,definition,(
% 9.54/1.99 (sF107 = ((notequalI1 => sF106)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF107])],[function_definition])).
% 9.54/1.99 thf(f978,definition,(
% 9.54/1.99 (sF108 = ((notsubsetI => sF107)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF108])],[function_definition])).
% 9.54/1.99 thf(f979,plain,(
% 9.54/1.99 (((notsubsetI => sF107)) = sF108)),
% 9.54/1.99 inference(reorient_equations,[],[f978])).
% 9.54/1.99 thf(f980,definition,(
% 9.54/1.99 (sF109 = ((subsetE2 => sF108)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF109])],[function_definition])).
% 9.54/1.99 thf(f981,definition,(
% 9.54/1.99 (sF110 = ((subsetE => sF109)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF110])],[function_definition])).
% 9.54/1.99 thf(f982,plain,(
% 9.54/1.99 (((subsetE => sF109)) = sF110)),
% 9.54/1.99 inference(reorient_equations,[],[f981])).
% 9.54/1.99 thf(f983,definition,(
% 9.54/1.99 (sF111 = ((emptysetsubset => sF110)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF111])],[function_definition])).
% 9.54/1.99 thf(f984,definition,(
% 9.54/1.99 (sF112 = ((subsetI2 => sF111)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF112])],[function_definition])).
% 9.54/1.99 thf(f985,plain,(
% 9.54/1.99 (((subsetI2 => sF111)) = sF112)),
% 9.54/1.99 inference(reorient_equations,[],[f984])).
% 9.54/1.99 thf(f986,definition,(
% 9.54/1.99 (sF113 = ((eqimpsubset1 => sF112)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF113])],[function_definition])).
% 9.54/1.99 thf(f987,definition,(
% 9.54/1.99 (sF114 = ((eqimpsubset2 => sF113)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF114])],[function_definition])).
% 9.54/1.99 thf(f988,definition,(
% 9.54/1.99 (sF115 = ((subsetI1 => sF114)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF115])],[function_definition])).
% 9.54/1.99 thf(f989,definition,(
% 9.54/1.99 (sF116 = ((dsetconstr__Cong => sF115)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF116])],[function_definition])).
% 9.54/1.99 thf(f990,plain,(
% 9.54/1.99 (((dsetconstr__Cong => sF115)) = sF116)),
% 9.54/1.99 inference(reorient_equations,[],[f989])).
% 9.54/1.99 thf(f991,definition,(
% 9.54/1.99 (sF117 = ((descr__Cong => sF116)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF117])],[function_definition])).
% 9.54/1.99 thf(f992,definition,(
% 9.54/1.99 (sF118 = ((exuEu => sF117)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF118])],[function_definition])).
% 9.54/1.99 thf(f993,plain,(
% 9.54/1.99 (((exuEu => sF117)) = sF118)),
% 9.54/1.99 inference(reorient_equations,[],[f992])).
% 9.54/1.99 thf(f994,definition,(
% 9.54/1.99 (sF119 = ((omega__Cong => sF118)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF119])],[function_definition])).
% 9.54/1.99 thf(f995,plain,(
% 9.54/1.99 (((omega__Cong => sF118)) = sF119)),
% 9.54/1.99 inference(reorient_equations,[],[f994])).
% 9.54/1.99 thf(f996,definition,(
% 9.54/1.99 (sF120 = ((setunion__Cong => sF119)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF120])],[function_definition])).
% 9.54/1.99 thf(f997,definition,(
% 9.54/1.99 (sF121 = ((powerset__Cong => sF120)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF121])],[function_definition])).
% 9.54/1.99 thf(f998,plain,(
% 9.54/1.99 (((powerset__Cong => sF120)) = sF121)),
% 9.54/1.99 inference(reorient_equations,[],[f997])).
% 9.54/1.99 thf(f999,definition,(
% 9.54/1.99 (sF122 = ((setadjoin__Cong => sF121)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF122])],[function_definition])).
% 9.54/1.99 thf(f1000,definition,(
% 9.54/1.99 (sF123 = ((emptyset__Cong => sF122)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF123])],[function_definition])).
% 9.54/1.99 thf(f1001,plain,(
% 9.54/1.99 (((emptyset__Cong => sF122)) = sF123)),
% 9.54/1.99 inference(reorient_equations,[],[f1000])).
% 9.54/1.99 thf(f1002,definition,(
% 9.54/1.99 (sF124 = ((exu__Cong => sF123)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF124])],[function_definition])).
% 9.54/1.99 thf(f1003,definition,(
% 9.54/1.99 (sF125 = ((exuE3u => sF124)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF125])],[function_definition])).
% 9.54/1.99 thf(f1004,plain,(
% 9.54/1.99 (((exuE3u => sF124)) = sF125)),
% 9.54/1.99 inference(reorient_equations,[],[f1003])).
% 9.54/1.99 thf(f1005,definition,(
% 9.54/1.99 (sF126 = ((in__Cong => sF125)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF126])],[function_definition])).
% 9.54/1.99 thf(f1006,plain,(
% 9.54/1.99 (((in__Cong => sF125)) = sF126)),
% 9.54/1.99 inference(reorient_equations,[],[f1005])).
% 9.54/1.99 thf(f1007,definition,(
% 9.54/1.99 (sF127 = ((inCongP => sF126)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF127])],[function_definition])).
% 9.54/1.99 thf(f1008,plain,(
% 9.54/1.99 (((inCongP => sF126)) = sF127)),
% 9.54/1.99 inference(reorient_equations,[],[f1007])).
% 9.54/1.99 thf(f1009,definition,(
% 9.54/1.99 (sF128 = ((exuI2 => sF127)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF128])],[function_definition])).
% 9.54/1.99 thf(f1010,definition,(
% 9.54/1.99 (sF129 = ((exuI3 => sF128)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF129])],[function_definition])).
% 9.54/1.99 thf(f1011,definition,(
% 9.54/1.99 (sF130 = ((exuI1 => sF129)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF130])],[function_definition])).
% 9.54/1.99 thf(f1012,plain,(
% 9.54/1.99 (((exuI1 => sF129)) = sF130)),
% 9.54/1.99 inference(reorient_equations,[],[f1011])).
% 9.54/1.99 thf(f1013,definition,(
% 9.54/1.99 (sF131 = ((notdallE => sF130)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF131])],[function_definition])).
% 9.54/1.99 thf(f1014,definition,(
% 9.54/1.99 (sF132 = ((notdexE => sF131)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF132])],[function_definition])).
% 9.54/1.99 thf(f1015,plain,(
% 9.54/1.99 (((notdexE => sF131)) = sF132)),
% 9.54/1.99 inference(reorient_equations,[],[f1014])).
% 9.54/1.99 thf(f1016,definition,(
% 9.54/1.99 (sF133 = ((prop2set2propI => sF132)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF133])],[function_definition])).
% 9.54/1.99 thf(f1017,definition,(
% 9.54/1.99 (sF134 = ((prop2setI => sF133)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF134])],[function_definition])).
% 9.54/1.99 thf(f1018,plain,(
% 9.54/1.99 (((prop2setI => sF133)) = sF134)),
% 9.54/1.99 inference(reorient_equations,[],[f1017])).
% 9.54/1.99 thf(f1019,definition,(
% 9.54/1.99 (sF135 = ((quantDeMorgan4 => sF134)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF135])],[function_definition])).
% 9.54/1.99 thf(f1020,definition,(
% 9.54/1.99 (sF136 = ((quantDeMorgan3 => sF135)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF136])],[function_definition])).
% 9.54/1.99 thf(f1021,definition,(
% 9.54/1.99 (sF137 = ((quantDeMorgan2 => sF136)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF137])],[function_definition])).
% 9.54/1.99 thf(f1022,definition,(
% 9.54/1.99 (sF138 = ((quantDeMorgan1 => sF137)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF138])],[function_definition])).
% 9.54/1.99 thf(f1023,definition,(
% 9.54/1.99 (sF139 = ((vacuousDall => sF138)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF139])],[function_definition])).
% 9.54/1.99 thf(f1024,plain,(
% 9.54/1.99 (((vacuousDall => sF138)) = sF139)),
% 9.54/1.99 inference(reorient_equations,[],[f1023])).
% 9.54/1.99 thf(f1025,definition,(
% 9.54/1.99 (sF140 = ((emptyE1 => sF139)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF140])],[function_definition])).
% 9.54/1.99 thf(f1026,definition,(
% 9.54/1.99 (sF141 = ((upairsetIR => sF140)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF141])],[function_definition])).
% 9.54/1.99 thf(f1027,definition,(
% 9.54/1.99 (sF142 = ((upairsetIL => sF141)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF142])],[function_definition])).
% 9.54/1.99 thf(f1028,plain,(
% 9.54/1.99 (((upairsetIL => sF141)) = sF142)),
% 9.54/1.99 inference(reorient_equations,[],[f1027])).
% 9.54/1.99 thf(f1029,definition,(
% 9.54/1.99 (sF143 = ((upairsetE => sF142)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF143])],[function_definition])).
% 9.54/1.99 thf(f1030,definition,(
% 9.54/1.99 (sF144 = ((singletonsswitch => sF143)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF144])],[function_definition])).
% 9.54/1.99 thf(f1031,definition,(
% 9.54/1.99 (sF145 = ((eqinunit => sF144)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF145])],[function_definition])).
% 9.54/1.99 thf(f1032,plain,(
% 9.54/1.99 (((eqinunit => sF144)) = sF145)),
% 9.54/1.99 inference(reorient_equations,[],[f1031])).
% 9.54/1.99 thf(f1033,definition,(
% 9.54/1.99 (sF146 = ((notinsingleton => sF145)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF146])],[function_definition])).
% 9.54/1.99 thf(f1034,definition,(
% 9.54/1.99 (sF147 = ((uniqinunit => sF146)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF147])],[function_definition])).
% 9.54/1.99 thf(f1035,definition,(
% 9.54/1.99 (sF148 = ((nonemptyImpWitness => sF147)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF148])],[function_definition])).
% 9.54/1.99 thf(f1036,definition,(
% 9.54/1.99 (sF149 = ((exuE2 => sF148)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF149])],[function_definition])).
% 9.54/1.99 thf(f1037,plain,(
% 9.54/1.99 (((exuE2 => sF148)) = sF149)),
% 9.54/1.99 inference(reorient_equations,[],[f1036])).
% 9.54/1.99 thf(f1038,definition,(
% 9.54/1.99 (sF150 = ((subPowSU => sF149)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF150])],[function_definition])).
% 9.54/1.99 thf(f1039,plain,(
% 9.54/1.99 (((subPowSU => sF149)) = sF150)),
% 9.54/1.99 inference(reorient_equations,[],[f1038])).
% 9.54/1.99 thf(f1040,definition,(
% 9.54/1.99 (sF151 = ((setunionE => sF150)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF151])],[function_definition])).
% 9.54/1.99 thf(f1041,definition,(
% 9.54/1.99 (sF152 = ((setunionI => sF151)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF152])],[function_definition])).
% 9.54/1.99 thf(f1042,plain,(
% 9.54/1.99 (((setunionI => sF151)) = sF152)),
% 9.54/1.99 inference(reorient_equations,[],[f1041])).
% 9.54/1.99 thf(f1043,definition,(
% 9.54/1.99 (sF153 = ((powersetE => sF152)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF153])],[function_definition])).
% 9.54/1.99 thf(f1044,definition,(
% 9.54/1.99 (sF154 = ((emptyInPowerset => sF153)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF154])],[function_definition])).
% 9.54/1.99 thf(f1045,plain,(
% 9.54/1.99 (((emptyInPowerset => sF153)) = sF154)),
% 9.54/1.99 inference(reorient_equations,[],[f1044])).
% 9.54/1.99 thf(f1046,definition,(
% 9.54/1.99 (sF155 = ((emptyinPowerset => sF154)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF155])],[function_definition])).
% 9.54/1.99 thf(f1047,plain,(
% 9.54/1.99 (((emptyinPowerset => sF154)) = sF155)),
% 9.54/1.99 inference(reorient_equations,[],[f1046])).
% 9.54/1.99 thf(f1048,definition,(
% 9.54/1.99 (sF156 = ((powersetI => sF155)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF156])],[function_definition])).
% 9.54/1.99 thf(f1049,definition,(
% 9.54/1.99 (sF157 = ((setoftrueEq => sF156)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF157])],[function_definition])).
% 9.54/1.99 thf(f1050,definition,(
% 9.54/1.99 (sF158 = ((setadjoinOr => sF157)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF158])],[function_definition])).
% 9.54/1.99 thf(f1051,definition,(
% 9.54/1.99 (sF159 = ((setadjoinE => sF158)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF159])],[function_definition])).
% 9.54/1.99 thf(f1052,plain,(
% 9.54/1.99 (((setadjoinE => sF158)) = sF159)),
% 9.54/1.99 inference(reorient_equations,[],[f1051])).
% 9.54/1.99 thf(f1053,definition,(
% 9.54/1.99 (sF160 = ((setadjoinIR => sF159)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF160])],[function_definition])).
% 9.54/1.99 thf(f1054,plain,(
% 9.54/1.99 (((setadjoinIR => sF159)) = sF160)),
% 9.54/1.99 inference(reorient_equations,[],[f1053])).
% 9.54/1.99 thf(f1055,definition,(
% 9.54/1.99 (sF161 = ((emptyinunitempty => sF160)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF161])],[function_definition])).
% 9.54/1.99 thf(f1056,plain,(
% 9.54/1.99 (((emptyinunitempty => sF160)) = sF161)),
% 9.54/1.99 inference(reorient_equations,[],[f1055])).
% 9.54/1.99 thf(f1057,definition,(
% 9.54/1.99 (sF162 = ((setadjoinIL => sF161)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF162])],[function_definition])).
% 9.54/1.99 thf(f1058,definition,(
% 9.54/1.99 (sF163 = ((nonemptyI1 => sF162)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF163])],[function_definition])).
% 9.54/1.99 thf(f1059,definition,(
% 9.54/1.99 (sF164 = ((nonemptyI => sF163)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF164])],[function_definition])).
% 9.54/1.99 thf(f1060,definition,(
% 9.54/1.99 (sF165 = ((nonemptyE1 => sF164)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF165])],[function_definition])).
% 9.54/1.99 thf(f1061,definition,(
% 9.54/1.99 (sF166 = ((setbeta => sF165)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF166])],[function_definition])).
% 9.54/1.99 thf(f1062,plain,(
% 9.54/1.99 (((setbeta => sF165)) = sF166)),
% 9.54/1.99 inference(reorient_equations,[],[f1061])).
% 9.54/1.99 thf(f1063,definition,(
% 9.54/1.99 (sF167 = ((noeltsimpempty => sF166)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF167])],[function_definition])).
% 9.54/1.99 thf(f1064,plain,(
% 9.54/1.99 (((noeltsimpempty => sF166)) = sF167)),
% 9.54/1.99 inference(reorient_equations,[],[f1063])).
% 9.54/1.99 thf(f1065,definition,(
% 9.54/1.99 (sF168 = ((emptyI => sF167)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF168])],[function_definition])).
% 9.54/1.99 thf(f1066,definition,(
% 9.54/1.99 (sF169 = ((setext => sF168)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF169])],[function_definition])).
% 9.54/1.99 thf(f1067,plain,(
% 9.54/1.99 (((setext => sF168)) = sF169)),
% 9.54/1.99 inference(reorient_equations,[],[f1066])).
% 9.54/1.99 thf(f1068,definition,(
% 9.54/1.99 (sF170 = ((exuE3e => sF169)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF170])],[function_definition])).
% 9.54/1.99 thf(f1069,definition,(
% 9.54/1.99 (sF171 = ((notinemptyset => sF170)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF171])],[function_definition])).
% 9.54/1.99 thf(f1070,definition,(
% 9.54/1.99 (sF172 = ((emptysetimpfalse => sF171)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF172])],[function_definition])).
% 9.54/1.99 thf(f1071,definition,(
% 9.54/1.99 (sF173 = ((emptysetE => sF172)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF173])],[function_definition])).
% 9.54/1.99 thf(f1072,definition,(
% 9.54/1.99 (sF174 = ((prop2setE => sF173)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF174])],[function_definition])).
% 9.54/1.99 thf(f1073,definition,(
% 9.54/1.99 (sF175 = ((exuE1 => sF174)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF175])],[function_definition])).
% 9.54/1.99 thf(f1074,definition,(
% 9.54/1.99 (sF176 = ((dsetconstrER => sF175)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF176])],[function_definition])).
% 9.54/1.99 thf(f1075,definition,(
% 9.54/1.99 (sF177 = ((dsetconstrEL => sF176)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF177])],[function_definition])).
% 9.54/1.99 thf(f1076,definition,(
% 9.54/1.99 (sF178 = ((dsetconstrI => sF177)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF178])],[function_definition])).
% 9.54/1.99 thf(f1077,definition,(
% 9.54/1.99 (sF179 = ((descrp => sF178)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF179])],[function_definition])).
% 9.54/1.99 thf(f1078,plain,(
% 9.54/1.99 (((descrp => sF178)) = sF179)),
% 9.54/1.99 inference(reorient_equations,[],[f1077])).
% 9.54/1.99 thf(f1079,definition,(
% 9.54/1.99 (sF180 = ((wellorderingAx => sF179)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF180])],[function_definition])).
% 9.54/1.99 thf(f1080,definition,(
% 9.54/1.99 (sF181 = ((foundationAx => sF180)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF181])],[function_definition])).
% 9.54/1.99 thf(f1081,definition,(
% 9.54/1.99 (sF182 = ((replAx => sF181)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF182])],[function_definition])).
% 9.54/1.99 thf(f1082,plain,(
% 9.54/1.99 (((replAx => sF181)) = sF182)),
% 9.54/1.99 inference(reorient_equations,[],[f1081])).
% 9.54/1.99 thf(f1083,definition,(
% 9.54/1.99 (sF183 = ((omegaIndAx => sF182)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF183])],[function_definition])).
% 9.54/1.99 thf(f1084,definition,(
% 9.54/1.99 (sF184 = ((omegaSAx => sF183)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF184])],[function_definition])).
% 9.54/1.99 thf(f1085,definition,(
% 9.54/1.99 (sF185 = ((omega0Ax => sF184)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF185])],[function_definition])).
% 9.54/1.99 thf(f1086,definition,(
% 9.54/1.99 (sF186 = ((setunionAx => sF185)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF186])],[function_definition])).
% 9.54/1.99 thf(f1087,plain,(
% 9.54/1.99 (((setunionAx => sF185)) = sF186)),
% 9.54/1.99 inference(reorient_equations,[],[f1086])).
% 9.54/1.99 thf(f1088,definition,(
% 9.54/1.99 (sF187 = ((powersetAx => sF186)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF187])],[function_definition])).
% 9.54/1.99 thf(f1089,plain,(
% 9.54/1.99 (((powersetAx => sF186)) = sF187)),
% 9.54/1.99 inference(reorient_equations,[],[f1088])).
% 9.54/1.99 thf(f1090,definition,(
% 9.54/1.99 (sF188 = ((setadjoinAx => sF187)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF188])],[function_definition])).
% 9.54/1.99 thf(f1091,definition,(
% 9.54/1.99 (sF189 = ((emptysetAx => sF188)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF189])],[function_definition])).
% 9.54/1.99 thf(f1092,definition,(
% 9.54/1.99 (sF190 = ((setextAx => sF189)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF190])],[function_definition])).
% 9.54/1.99 thf(f1093,plain,(
% 9.54/1.99 (((setextAx => sF189)) = sF190)),
% 9.54/1.99 inference(reorient_equations,[],[f1092])).
% 9.54/1.99 thf(f1094,definition,(
% 9.54/1.99 (sF191 = ((~ sF190)))),
% 9.54/1.99 introduced(definition,[new_symbols(definition,[sF191])],[function_definition])).
% 9.54/1.99 thf(f1095,plain,(
% 9.54/1.99 (sF191 = $true)),
% 9.54/1.99 inference(definition_folding,[],[f793,f1094,f1093,f1091,f1090,f1089,f1087,f1085,f1084,f1083,f1082,f1080,f1079,f1078,f1076,f1075,f1074,f1073,f1072,f1071,f1070,f1069,f1068,f1067,f1065,f1064,f1062,f1060,f1059,f1058,f1057,f1056,f1054,f1052,f1050,f1049,f1048,f1047,f1045,f1043,f1042,f1040,f1039,f1037,f1035,f1034,f1033,f1032,f1030,f1029,f1028,f1026,f1025,f1024,f1022,f1021,f1020,f1019,f1018,f1016,f1015,f1013,f1012,f1010,f1009,f1008,f1006,f1004,f1002,f1001,f999,f998,f996,f995,f993,f991,f990,f988,f987,f986,f985,f983,f982,f980,f979,f977,f976,f974,f972,f970,f968,f967,f965,f964,f963,f962,f960,f959,f957,f956,f955,f953,f951,f950,f949,f948,f947,f945,f944,f943,f942,f941,f940,f939,f938,f937,f936,f934,f932,f930,f928,f926,f924,f922,f921,f919,f917,f915,f914,f912,f911,f909,f907,f905,f903,f901,f900,f899,f898,f897,f895,f894,f893,f892,f890,f888,f886,f885,f883,f882,f881,f880,f879,f878,f876,f874,f873,f871,f870,f868,f866,f865,f863,f862,f861,f860,f858,f856,f854,f853,f852,f851,f850,f848,f846,f844,f843,f841,f840,f838,f836,f834,f832,f831,f830,f829,f827,f826,f824,f822,f821,f819,f818])).
% 9.54/1.99 thf(f1096,plain,(
% 9.54/1.99 (exuE1 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2))))))) => (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2))))))))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f813])).
% 9.54/1.99 thf(f1097,plain,(
% 9.54/1.99 (exuE1 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ($true)))))),
% 9.54/1.99 inference(boolean_simplification,[],[f1096])).
% 9.54/1.99 thf(f1099,plain,(
% 9.54/1.99 (setbeta = ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((in @ Y0 @ (dsetconstr @ Y2 @ Y1)) = (Y1 @ Y0)))))))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f667])).
% 9.54/1.99 thf(f1100,plain,(
% 9.54/1.99 (dsetconstrEL = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ (dsetconstr @ Y0 @ Y2)) => (in @ Y1 @ Y0))))))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f757])).
% 9.54/1.99 thf(f1104,plain,(
% 9.54/1.99 (dpsetconstrSub = ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $i > $o) @ (^[Y1 : $i > $i > $o]: (!! @ $i @ (^[Y2 : $i]: (subset @ (dpsetconstr @ Y2 @ Y0 @ Y1) @ (cartprod @ Y2 @ Y0))))))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f741])).
% 9.54/1.99 thf(f1107,plain,(
% 9.54/1.99 (sepSubset = ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (subset @ (dsetconstr @ Y0 @ Y1) @ Y0)))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f689])).
% 9.54/1.99 thf(f1109,plain,(
% 9.54/1.99 (sepInPowerset = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (in @ (dsetconstr @ Y1 @ Y0) @ (powerset @ Y1))))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f707])).
% 9.54/1.99 thf(f1110,plain,(
% 9.54/1.99 (sF0 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((subset @ Y0 @ (cartprod @ Y1 @ Y2)) & (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => (?? @ $i @ (^[Y4 : $i]: ((in @ Y4 @ (dsetconstr @ Y2 @ (^[Y5 : $i]: (in @ (kpair @ Y3 @ Y5) @ Y0)))) & ((setadjoin @ Y4 @ emptyset) = (dsetconstr @ Y2 @ (^[Y5 : $i]: (in @ (kpair @ Y3 @ Y5) @ Y0))))))))))) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => (in @ (setunion @ (dsetconstr @ Y2 @ (^[Y4 : $i]: (in @ (kpair @ Y3 @ Y4) @ Y0)))) @ Y2)))))))))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f818])).
% 9.54/1.99 thf(f1111,plain,(
% 9.54/1.99 (emptysetimpfalse = ((!! @ $i @ (^[Y0 : $i]: (~ (in @ Y0 @ emptyset))))))),
% 9.54/1.99 inference(boolean_simplification,[],[f635])).
% 9.54/1.99 thf(f1113,plain,(
% 9.54/1.99 (nonemptyE1 = ((!! @ $i @ (^[Y0 : $i]: ((~ (emptyset = Y0)) => (?? @ $i @ (^[Y1 : $i]: (in @ Y1 @ Y0))))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f794])).
% 9.54/1.99 thf(f1114,plain,(
% 9.54/1.99 (nonemptyI1 = ((!! @ $i @ (^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: (in @ Y1 @ Y0))) => (~ (emptyset = Y0)))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f810])).
% 9.54/1.99 thf(f1115,plain,(
% 9.54/1.99 (dsetconstrI = ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((Y1 @ Y0) => (in @ Y0 @ (dsetconstr @ Y2 @ Y1))))))))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f687])).
% 9.54/1.99 thf(f1117,plain,(
% 9.54/1.99 (nonemptyI = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ Y0) => ((Y2 @ Y1) => (~ (emptyset = (dsetconstr @ Y0 @ Y2)))))))))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f797])).
% 9.54/1.99 thf(f1118,plain,(
% 9.54/1.99 (omega__Cong = $true)),
% 9.54/1.99 inference(boolean_simplification,[],[f636])).
% 9.54/1.99 thf(f1119,plain,(
% 9.54/1.99 (cartprodmempaircEq = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => $true))))))))))))),
% 9.54/1.99 inference(boolean_simplification,[],[f703])).
% 9.54/1.99 thf(f1120,plain,(
% 9.54/1.99 (cartprodmempaircEq = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ($true))))))))))))),
% 9.54/1.99 inference(boolean_simplification,[],[f1119])).
% 9.54/1.99 thf(f1125,plain,(
% 9.54/1.99 (exuI3 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((?? @ $i @ Y0) => ((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y1) => ((Y0 @ Y2) => (Y2 = Y1))))))) => (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2)))))))))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f809])).
% 9.54/1.99 thf(f1129,plain,(
% 9.54/1.99 (theprop = ((!! @ $i @ (^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0)))) => (in @ (setunion @ Y0) @ Y0))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f802])).
% 9.54/1.99 thf(f1131,plain,(
% 9.54/1.99 (dsetconstrER = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (dsetconstr @ Y2 @ Y0)) => (Y0 @ Y1))))))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f759])).
% 9.54/1.99 thf(f1132,plain,(
% 9.54/1.99 (nonemptyImpWitness = ((!! @ $i @ (^[Y0 : $i]: ((~ (emptyset = Y0)) => (?? @ $i @ (^[Y1 : $i]: ($true & (in @ Y1 @ Y0)))))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f792])).
% 9.54/1.99 thf(f1133,plain,(
% 9.54/1.99 (nonemptyImpWitness = ((!! @ $i @ (^[Y0 : $i]: ((~ (emptyset = Y0)) => (?? @ $i @ (^[Y1 : $i]: (in @ Y1 @ Y0))))))))),
% 9.54/1.99 inference(boolean_simplification,[],[f1132])).
% 9.54/1.99 thf(f1137,plain,(
% 9.54/1.99 (emptysetsubset = ((!! @ $i @ (subset @ emptyset))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f658])).
% 9.54/1.99 thf(f1138,plain,(
% 9.54/1.99 (emptyset__Cong = $true)),
% 9.54/1.99 inference(boolean_simplification,[],[f646])).
% 9.54/1.99 thf(f1141,plain,(
% 9.54/1.99 (ex1E1 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (dsetconstr @ Y1 @ Y0)) & ((setadjoin @ Y2 @ emptyset) = (dsetconstr @ Y1 @ Y0))))) => (?? @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) & (in @ Y2 @ Y1)))))))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f791])).
% 9.54/1.99 thf(f1142,plain,(
% 9.54/1.99 (exuE2 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2))))))) => (?? @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) = (Y1 = Y2)))))))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f814])).
% 9.54/1.99 thf(f1143,plain,(
% 9.54/1.99 (exuI2 = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((?? @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y1 = Y2) = (Y0 @ Y2)))))) => (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2))))))))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f795])).
% 9.54/1.99 thf(f1145,plain,(
% 9.54/1.99 (apProp = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((subset @ Y0 @ (cartprod @ Y1 @ Y2)) & (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => (?? @ $i @ (^[Y4 : $i]: ((in @ Y4 @ (dsetconstr @ Y2 @ (^[Y5 : $i]: (in @ (kpair @ Y3 @ Y5) @ Y0)))) & ((setadjoin @ Y4 @ emptyset) = (dsetconstr @ Y2 @ (^[Y5 : $i]: (in @ (kpair @ Y3 @ Y5) @ Y0))))))))))) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => (in @ (setunion @ (dsetconstr @ Y2 @ (^[Y4 : $i]: (in @ (kpair @ Y3 @ Y4) @ Y0)))) @ Y2)))))))))))))),
% 9.54/1.99 inference(beta-eta_normalization,[],[f799])).
% 9.54/1.99 thf(f1146,plain,(
% 9.54/1.99 ($true = ((~ sF190)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1094,f1095])).
% 9.54/1.99 thf(f1148,plain,(
% 9.54/1.99 ($true = ((~ $true))) | ($false = sF190)),
% 9.54/1.99 inference(superposition,[],[f1146,f787])).
% 9.54/1.99 thf(f1149,plain,(
% 9.54/1.99 ($false = sF190) | ($true = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f1148])).
% 9.54/1.99 thf(f1150,plain,(
% 9.54/1.99 ($false = sF190)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1149])).
% 9.54/1.99 thf(f1152,plain,(
% 9.54/1.99 (((setextAx => sF189)) = $false)),
% 9.54/1.99 inference(backward_demodulation,[],[f1093,f1150])).
% 9.54/1.99 thf(f1154,plain,(
% 9.54/1.99 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) = (in @ Y2 @ Y0)))) => (Y1 = Y0)))))) => sF189)) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f1152,f709])).
% 9.54/1.99 thf(f1157,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) = (in @ Y2 @ Y0)))) => (Y1 = Y0)))))) => $true))) | (sF189 = $false)),
% 9.54/1.99 inference(superposition,[],[f1154,f787])).
% 9.54/1.99 thf(f1160,plain,(
% 9.54/1.99 (sF189 = $false) | ($true = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f1157])).
% 9.54/1.99 thf(f1161,plain,(
% 9.54/1.99 (sF189 = $false)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1160])).
% 9.54/1.99 thf(f1167,plain,(
% 9.54/1.99 ($false = ((emptysetAx => sF188)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1091,f1161])).
% 9.54/1.99 thf(f1171,plain,(
% 9.54/1.99 (emptysetAx = $true)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f1167])).
% 9.54/1.99 thf(f1172,plain,(
% 9.54/1.99 (sF188 = $false) | (((emptysetAx => $true)) = $false)),
% 9.54/1.99 inference(superposition,[],[f1167,f787])).
% 9.54/1.99 thf(f1176,plain,(
% 9.54/1.99 ($true = $false) | (sF188 = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f1172])).
% 9.54/1.99 thf(f1177,plain,(
% 9.54/1.99 (sF188 = $false)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1176])).
% 9.54/1.99 thf(f1180,plain,(
% 9.54/1.99 ($false = ((setadjoinAx => sF187)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1090,f1177])).
% 9.54/1.99 thf(f1184,plain,(
% 9.54/1.99 (((!! @ $i @ (^[Y0 : $i]: (~ (in @ Y0 @ emptyset))))) = $true)),
% 9.54/1.99 inference(backward_demodulation,[],[f716,f1171])).
% 9.54/1.99 thf(f1185,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ Y2)) = ((Y1 = Y0) | (in @ Y1 @ Y2))))))))) => sF187)))),
% 9.54/1.99 inference(forward_demodulation,[],[f1180,f627])).
% 9.54/1.99 thf(f1190,plain,(
% 9.54/1.99 (notinemptyset = $true)),
% 9.54/1.99 inference(backward_demodulation,[],[f734,f1184])).
% 9.54/1.99 thf(f1191,plain,(
% 9.54/1.99 (emptysetimpfalse = $true)),
% 9.54/1.99 inference(backward_demodulation,[],[f1111,f1184])).
% 9.54/1.99 thf(f1192,plain,(
% 9.54/1.99 (sF172 = (($true => sF171)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1070,f1191])).
% 9.54/1.99 thf(f1193,plain,(
% 9.54/1.99 (sF172 = sF171)),
% 9.54/1.99 inference(boolean_simplification,[],[f1192])).
% 9.54/1.99 thf(f1194,plain,(
% 9.54/1.99 ((($true => sF170)) = sF171)),
% 9.54/1.99 inference(backward_demodulation,[],[f1069,f1190])).
% 9.54/1.99 thf(f1195,plain,(
% 9.54/1.99 (sF170 = sF171)),
% 9.54/1.99 inference(boolean_simplification,[],[f1194])).
% 9.54/1.99 thf(f1196,plain,(
% 9.54/1.99 (sF172 = sF170)),
% 9.54/1.99 inference(forward_demodulation,[],[f1195,f1193])).
% 9.54/1.99 thf(f1197,plain,(
% 9.54/1.99 (sF172 = ((exuE3e => sF169)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1068,f1196])).
% 9.54/1.99 thf(f1212,plain,(
% 9.54/1.99 (sF172 = ((exuE3e => $true))) | ($false = sF169)),
% 9.54/1.99 inference(superposition,[],[f1197,f787])).
% 9.54/1.99 thf(f1215,plain,(
% 9.54/1.99 (sF172 = $true) | ($false = sF169)),
% 9.54/1.99 inference(boolean_simplification,[],[f1212])).
% 9.54/1.99 thf(f1234,plain,(
% 9.54/1.99 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ Y2)) = ((Y1 = Y0) | (in @ Y1 @ Y2))))))))) => $true)) = $false) | ($false = sF187)),
% 9.54/1.99 inference(superposition,[],[f1185,f787])).
% 9.54/1.99 thf(f1237,plain,(
% 9.54/1.99 ($true = $false) | ($false = sF187)),
% 9.54/1.99 inference(boolean_simplification,[],[f1234])).
% 9.54/1.99 thf(f1238,plain,(
% 9.54/1.99 ($false = sF187)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1237])).
% 9.54/1.99 thf(f1242,plain,(
% 9.54/1.99 ($false = ((powersetAx => sF186)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1089,f1238])).
% 9.54/1.99 thf(f1249,plain,(
% 9.54/1.99 ($false = sF186)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f1242])).
% 9.54/1.99 thf(f1259,plain,(
% 9.54/1.99 ($false = ((setunionAx => sF185)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1087,f1249])).
% 9.54/1.99 thf(f1266,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setunion @ Y0)) = (?? @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) & (in @ Y2 @ Y0))))))))) => sF185)))),
% 9.54/1.99 inference(forward_demodulation,[],[f1259,f642])).
% 9.54/1.99 thf(f1282,plain,(
% 9.54/1.99 ($false = sF185)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f1266])).
% 9.54/1.99 thf(f1292,plain,(
% 9.54/1.99 ($false = ((omega0Ax => sF184)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1085,f1282])).
% 9.54/1.99 thf(f1297,plain,(
% 9.54/1.99 ($false = (((in @ emptyset @ omega) => sF184)))),
% 9.54/1.99 inference(forward_demodulation,[],[f1292,f618])).
% 9.54/1.99 thf(f1300,plain,(
% 9.54/1.99 ($false = sF184)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f1297])).
% 9.54/1.99 thf(f1310,plain,(
% 9.54/1.99 ($false = ((omegaSAx => sF183)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1084,f1300])).
% 9.54/1.99 thf(f1317,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ omega) => (in @ (setadjoin @ Y0 @ Y0) @ omega)))) => sF183)))),
% 9.54/1.99 inference(forward_demodulation,[],[f1310,f724])).
% 9.54/1.99 thf(f1320,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ omega) => (in @ (setadjoin @ Y0 @ Y0) @ omega)))) => $true))) | ($false = sF183)),
% 9.54/1.99 inference(superposition,[],[f1317,f787])).
% 9.54/1.99 thf(f1323,plain,(
% 9.54/1.99 ($true = $false) | ($false = sF183)),
% 9.54/1.99 inference(boolean_simplification,[],[f1320])).
% 9.54/1.99 thf(f1324,plain,(
% 9.54/1.99 ($false = sF183)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1323])).
% 9.54/1.99 thf(f1328,plain,(
% 9.54/1.99 ($false = ((omegaIndAx => sF182)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1083,f1324])).
% 9.54/1.99 thf(f1333,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (((in @ emptyset @ Y0) & (!! @ $i @ (^[Y1 : $i]: (((in @ Y1 @ omega) & (in @ Y1 @ Y0)) => (in @ (setadjoin @ Y1 @ Y1) @ Y0))))) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ omega) => (in @ Y1 @ Y0))))))) => sF182)))),
% 9.54/1.99 inference(forward_demodulation,[],[f1328,f603])).
% 9.54/1.99 thf(f1336,plain,(
% 9.54/1.99 ($false = sF182)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f1333])).
% 9.54/1.99 thf(f1346,plain,(
% 9.54/1.99 (((replAx => sF181)) = $false)),
% 9.54/1.99 inference(backward_demodulation,[],[f1082,f1336])).
% 9.54/1.99 thf(f1357,plain,(
% 9.54/1.99 ($false = sF181) | ($false = ((replAx => $true)))),
% 9.54/1.99 inference(superposition,[],[f1346,f787])).
% 9.54/1.99 thf(f1361,plain,(
% 9.54/1.99 ($false = sF181) | ($true = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f1357])).
% 9.54/1.99 thf(f1362,plain,(
% 9.54/1.99 ($false = sF181)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1361])).
% 9.54/1.99 thf(f1365,plain,(
% 9.54/1.99 ($false = ((foundationAx => sF180)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1080,f1362])).
% 9.54/1.99 thf(f1370,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: (in @ Y1 @ Y0))) => (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & (~ (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) & (in @ Y2 @ Y1))))))))))) => sF180)))),
% 9.54/1.99 inference(forward_demodulation,[],[f1365,f731])).
% 9.54/1.99 thf(f1375,plain,(
% 9.54/1.99 (sF180 = $false)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f1370])).
% 9.54/1.99 thf(f1389,plain,(
% 9.54/1.99 ($false = ((wellorderingAx => sF179)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1079,f1375])).
% 9.54/1.99 thf(f1390,plain,(
% 9.54/1.99 ($false = sF179)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f1389])).
% 9.54/1.99 thf(f1404,plain,(
% 9.54/1.99 ($false = ((descrp => sF178)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1078,f1390])).
% 9.54/1.99 thf(f1409,plain,(
% 9.54/1.99 ($false = ((descrp => $true))) | (sF178 = $false)),
% 9.54/1.99 inference(superposition,[],[f1404,f787])).
% 9.54/1.99 thf(f1412,plain,(
% 9.54/1.99 ($true = $false) | (sF178 = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f1409])).
% 9.54/1.99 thf(f1413,plain,(
% 9.54/1.99 (sF178 = $false)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1412])).
% 9.54/1.99 thf(f1417,plain,(
% 9.54/1.99 ($false = ((dsetconstrI => sF177)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1076,f1413])).
% 9.54/1.99 thf(f1422,plain,(
% 9.54/1.99 ((((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((Y1 @ Y0) => (in @ Y0 @ (dsetconstr @ Y2 @ Y1)))))))))) => sF177)) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f1417,f1115])).
% 9.54/1.99 thf(f1436,plain,(
% 9.54/1.99 (sF177 = $false) | ((((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((Y1 @ Y0) => (in @ Y0 @ (dsetconstr @ Y2 @ Y1)))))))))) => $true)) = $false)),
% 9.54/1.99 inference(superposition,[],[f1422,f787])).
% 9.54/1.99 thf(f1439,plain,(
% 9.54/1.99 (sF177 = $false) | ($true = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f1436])).
% 9.54/1.99 thf(f1440,plain,(
% 9.54/1.99 (sF177 = $false)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1439])).
% 9.54/1.99 thf(f1444,plain,(
% 9.54/1.99 ($false = ((dsetconstrEL => sF176)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1075,f1440])).
% 9.54/1.99 thf(f1449,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ (dsetconstr @ Y0 @ Y2)) => (in @ Y1 @ Y0)))))))) => sF176)))),
% 9.54/1.99 inference(forward_demodulation,[],[f1444,f1100])).
% 9.54/1.99 thf(f1454,plain,(
% 9.54/1.99 (sF176 = $false) | ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ (dsetconstr @ Y0 @ Y2)) => (in @ Y1 @ Y0)))))))) => $true)))),
% 9.54/1.99 inference(superposition,[],[f1449,f787])).
% 9.54/1.99 thf(f1457,plain,(
% 9.54/1.99 ($true = $false) | (sF176 = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f1454])).
% 9.54/1.99 thf(f1458,plain,(
% 9.54/1.99 (sF176 = $false)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1457])).
% 9.54/1.99 thf(f1462,plain,(
% 9.54/1.99 ($false = ((dsetconstrER => sF175)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1074,f1458])).
% 9.54/1.99 thf(f1469,plain,(
% 9.54/1.99 ((((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (dsetconstr @ Y2 @ Y0)) => (Y0 @ Y1)))))))) => sF175)) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f1462,f1131])).
% 9.54/1.99 thf(f1472,plain,(
% 9.54/1.99 ($false = sF175) | ($false = (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (dsetconstr @ Y2 @ Y0)) => (Y0 @ Y1)))))))) => $true)))),
% 9.54/1.99 inference(superposition,[],[f1469,f787])).
% 9.54/1.99 thf(f1475,plain,(
% 9.54/1.99 ($true = $false) | ($false = sF175)),
% 9.54/1.99 inference(boolean_simplification,[],[f1472])).
% 9.54/1.99 thf(f1476,plain,(
% 9.54/1.99 ($false = sF175)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1475])).
% 9.54/1.99 thf(f1480,plain,(
% 9.54/1.99 ($false = ((exuE1 => sF174)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1073,f1476])).
% 9.54/1.99 thf(f1485,plain,(
% 9.54/1.99 ($false = (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ($true))) => sF174)))),
% 9.54/1.99 inference(forward_demodulation,[],[f1480,f1097])).
% 9.54/1.99 thf(f1492,plain,(
% 9.54/1.99 ($false = (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ($true))) => $true))) | ($false = sF174)),
% 9.54/1.99 inference(superposition,[],[f1485,f787])).
% 9.54/1.99 thf(f1496,plain,(
% 9.54/1.99 ($false = sF174) | ($true = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f1492])).
% 9.54/1.99 thf(f1497,plain,(
% 9.54/1.99 ($false = sF174)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1496])).
% 9.54/1.99 thf(f1504,plain,(
% 9.54/1.99 ($false = ((prop2setE => sF173)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1072,f1497])).
% 9.54/1.99 thf(f1507,plain,(
% 9.54/1.99 ($false = (((!! @ $o @ (^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (prop2set @ Y0)) => Y0))))) => sF173)))),
% 9.54/1.99 inference(forward_demodulation,[],[f1504,f683])).
% 9.54/1.99 thf(f1508,plain,(
% 9.54/1.99 ((((!! @ $o @ (^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (prop2set @ Y0)) => Y0))))) => (emptysetE => sF172))) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f1507,f1071])).
% 9.54/1.99 thf(f1511,plain,(
% 9.54/1.99 (sF172 = $false) | ($false = (((!! @ $o @ (^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (prop2set @ Y0)) => Y0))))) => (emptysetE => $true))))),
% 9.54/1.99 inference(superposition,[],[f1508,f787])).
% 9.54/1.99 thf(f1520,plain,(
% 9.54/1.99 (sF172 = $false) | ($false = (((!! @ $o @ (^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (prop2set @ Y0)) => Y0))))) => $true)))),
% 9.54/1.99 inference(boolean_simplification,[],[f1511])).
% 9.54/1.99 thf(f1521,plain,(
% 9.54/1.99 ($true = $false) | (sF172 = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f1520])).
% 9.54/1.99 thf(f1522,plain,(
% 9.54/1.99 (sF172 = $false)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1521])).
% 9.54/1.99 thf(f1533,plain,(
% 9.54/1.99 ($true = $false) | ($false = sF169)),
% 9.54/1.99 inference(backward_demodulation,[],[f1215,f1522])).
% 9.54/1.99 thf(f1537,plain,(
% 9.54/1.99 ($false = sF169)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1533])).
% 9.54/1.99 thf(f1545,plain,(
% 9.54/1.99 (((setext => sF168)) = $false)),
% 9.54/1.99 inference(backward_demodulation,[],[f1067,f1537])).
% 9.54/1.99 thf(f1565,plain,(
% 9.54/1.99 ($false = sF168) | ($false = ((setext => $true)))),
% 9.54/1.99 inference(superposition,[],[f1545,f787])).
% 9.54/1.99 thf(f1569,plain,(
% 9.54/1.99 ($true = $false) | ($false = sF168)),
% 9.54/1.99 inference(boolean_simplification,[],[f1565])).
% 9.54/1.99 thf(f1570,plain,(
% 9.54/1.99 ($false = sF168)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1569])).
% 9.54/1.99 thf(f1577,plain,(
% 9.54/1.99 ($false = ((emptyI => sF167)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1065,f1570])).
% 9.54/1.99 thf(f1578,plain,(
% 9.54/1.99 ((((!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: (~ (in @ Y1 @ Y0)))) => (emptyset = Y0)))) => sF167)) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f1577,f745])).
% 9.54/1.99 thf(f1579,plain,(
% 9.54/1.99 ($false = sF167)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f1578])).
% 9.54/1.99 thf(f1580,plain,(
% 9.54/1.99 ($true = ((!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: (~ (in @ Y1 @ Y0)))) => (emptyset = Y0))))))),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f1578])).
% 9.54/1.99 thf(f1589,plain,(
% 9.54/1.99 (noeltsimpempty = $true)),
% 9.54/1.99 inference(backward_demodulation,[],[f771,f1580])).
% 9.54/1.99 thf(f1592,plain,(
% 9.54/1.99 ($false = ((noeltsimpempty => sF166)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1064,f1579])).
% 9.54/1.99 thf(f1595,plain,(
% 9.54/1.99 ((($true => sF166)) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f1592,f1589])).
% 9.54/1.99 thf(f1596,plain,(
% 9.54/1.99 ($false = sF166)),
% 9.54/1.99 inference(boolean_simplification,[],[f1595])).
% 9.54/1.99 thf(f1597,plain,(
% 9.54/1.99 ($false = ((setbeta => sF165)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1062,f1596])).
% 9.54/1.99 thf(f1598,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((in @ Y0 @ (dsetconstr @ Y2 @ Y1)) = (Y1 @ Y0))))))))) => sF165)))),
% 9.54/1.99 inference(forward_demodulation,[],[f1597,f1099])).
% 9.54/1.99 thf(f1610,plain,(
% 9.54/1.99 ($false = sF165) | ((((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((in @ Y0 @ (dsetconstr @ Y2 @ Y1)) = (Y1 @ Y0))))))))) => $true)) = $false)),
% 9.54/1.99 inference(superposition,[],[f1598,f787])).
% 9.54/1.99 thf(f1613,plain,(
% 9.54/1.99 ($false = sF165) | ($true = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f1610])).
% 9.54/1.99 thf(f1614,plain,(
% 9.54/1.99 ($false = sF165)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1613])).
% 9.54/1.99 thf(f1620,plain,(
% 9.54/1.99 ($false = ((nonemptyE1 => sF164)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1060,f1614])).
% 9.54/1.99 thf(f1623,plain,(
% 9.54/1.99 ($false = ((nonemptyE1 => (nonemptyI => sF163))))),
% 9.54/1.99 inference(forward_demodulation,[],[f1620,f1059])).
% 9.54/1.99 thf(f1624,plain,(
% 9.54/1.99 ($false = ((nonemptyE1 => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ Y0) => ((Y2 @ Y1) => (~ (emptyset = (dsetconstr @ Y0 @ Y2))))))))))) => sF163))))),
% 9.54/1.99 inference(forward_demodulation,[],[f1623,f1117])).
% 9.54/1.99 thf(f1626,plain,(
% 9.54/1.99 (nonemptyE1 = $true)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f1624])).
% 9.54/1.99 thf(f1627,plain,(
% 9.54/1.99 ($false = sF163) | ($false = ((nonemptyE1 => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ Y0) => ((Y2 @ Y1) => (~ (emptyset = (dsetconstr @ Y0 @ Y2))))))))))) => $true))))),
% 9.54/1.99 inference(superposition,[],[f1624,f787])).
% 9.54/1.99 thf(f1636,plain,(
% 9.54/1.99 ($false = sF163) | ($false = ((nonemptyE1 => $true)))),
% 9.54/1.99 inference(boolean_simplification,[],[f1627])).
% 9.54/1.99 thf(f1637,plain,(
% 9.54/1.99 ($false = sF163) | ($true = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f1636])).
% 9.54/1.99 thf(f1638,plain,(
% 9.54/1.99 ($false = sF163)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1637])).
% 9.54/1.99 thf(f1644,plain,(
% 9.54/1.99 ($false = ((nonemptyI1 => sF162)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1058,f1638])).
% 9.54/1.99 thf(f1649,plain,(
% 9.54/1.99 (((!! @ $i @ (^[Y0 : $i]: ((~ (emptyset = Y0)) => (?? @ $i @ (^[Y1 : $i]: (in @ Y1 @ Y0))))))) = $true)),
% 9.54/1.99 inference(backward_demodulation,[],[f1113,f1626])).
% 9.54/1.99 thf(f1656,plain,(
% 9.54/1.99 ((((!! @ $i @ (^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: (in @ Y1 @ Y0))) => (~ (emptyset = Y0))))) => sF162)) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f1644,f1114])).
% 9.54/1.99 thf(f1660,plain,(
% 9.54/1.99 (nonemptyImpWitness = $true)),
% 9.54/1.99 inference(backward_demodulation,[],[f1133,f1649])).
% 9.54/1.99 thf(f1664,plain,(
% 9.54/1.99 (sF148 = (($true => sF147)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1035,f1660])).
% 9.54/1.99 thf(f1665,plain,(
% 9.54/1.99 (sF147 = sF148)),
% 9.54/1.99 inference(boolean_simplification,[],[f1664])).
% 9.54/1.99 thf(f1666,plain,(
% 9.54/1.99 (((exuE2 => sF147)) = sF149)),
% 9.54/1.99 inference(backward_demodulation,[],[f1037,f1665])).
% 9.54/1.99 thf(f1667,plain,(
% 9.54/1.99 (sF149 = (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2))))))) => (?? @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) = (Y1 = Y2))))))))) => sF147)))),
% 9.54/1.99 inference(forward_demodulation,[],[f1666,f1142])).
% 9.54/1.99 thf(f1686,plain,(
% 9.54/1.99 (sF162 = $false)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f1656])).
% 9.54/1.99 thf(f1698,plain,(
% 9.54/1.99 ($false = ((setadjoinIL => sF161)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1057,f1686])).
% 9.54/1.99 thf(f1699,plain,(
% 9.54/1.99 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ Y0)))))) => sF161)) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f1698,f717])).
% 9.54/1.99 thf(f1700,plain,(
% 9.54/1.99 ($false = sF161)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f1699])).
% 9.54/1.99 thf(f1712,plain,(
% 9.54/1.99 (((emptyinunitempty => sF160)) = $false)),
% 9.54/1.99 inference(backward_demodulation,[],[f1056,f1700])).
% 9.54/1.99 thf(f1713,plain,(
% 9.54/1.99 ((((in @ emptyset @ (setadjoin @ emptyset @ emptyset)) => sF160)) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f1712,f690])).
% 9.54/1.99 thf(f1714,plain,(
% 9.54/1.99 ($false = sF160)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f1713])).
% 9.54/1.99 thf(f1724,plain,(
% 9.54/1.99 ($false = ((setadjoinIR => sF159)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1054,f1714])).
% 9.54/1.99 thf(f1731,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ (setadjoin @ Y2 @ Y0))))))))) => sF159)))),
% 9.54/1.99 inference(forward_demodulation,[],[f1724,f626])).
% 9.54/1.99 thf(f1736,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ (setadjoin @ Y2 @ Y0))))))))) => $true))) | ($false = sF159)),
% 9.54/1.99 inference(superposition,[],[f1731,f787])).
% 9.54/1.99 thf(f1740,plain,(
% 9.54/1.99 ($false = sF159) | ($true = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f1736])).
% 9.54/1.99 thf(f1741,plain,(
% 9.54/1.99 ($false = sF159)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1740])).
% 9.54/1.99 thf(f1744,plain,(
% 9.54/1.99 ($false = ((setadjoinE => sF158)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1052,f1741])).
% 9.54/1.99 thf(f1755,plain,(
% 9.54/1.99 (sF158 = $false) | ($false = ((setadjoinE => $true)))),
% 9.54/1.99 inference(superposition,[],[f1744,f787])).
% 9.54/1.99 thf(f1759,plain,(
% 9.54/1.99 ($true = $false) | (sF158 = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f1755])).
% 9.54/1.99 thf(f1760,plain,(
% 9.54/1.99 (sF158 = $false)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1759])).
% 9.54/1.99 thf(f1767,plain,(
% 9.54/1.99 ($false = ((setadjoinOr => sF157)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1050,f1760])).
% 9.54/1.99 thf(f1770,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setadjoin @ Y2 @ Y0)) => ((Y2 = Y1) | (in @ Y1 @ Y0))))))))) => sF157)))),
% 9.54/1.99 inference(forward_demodulation,[],[f1767,f701])).
% 9.54/1.99 thf(f1771,plain,(
% 9.54/1.99 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setadjoin @ Y2 @ Y0)) => ((Y2 = Y1) | (in @ Y1 @ Y0))))))))) => (setoftrueEq => sF156))) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f1770,f1049])).
% 9.54/1.99 thf(f1772,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setadjoin @ Y2 @ Y0)) => ((Y2 = Y1) | (in @ Y1 @ Y0))))))))) => ((!! @ $i @ (^[Y0 : $i]: ((dsetconstr @ Y0 @ (^[Y1 : $i]: ($true))) = Y0))) => sF156))))),
% 9.54/1.99 inference(forward_demodulation,[],[f1771,f721])).
% 9.54/1.99 thf(f1804,plain,(
% 9.54/1.99 (sF147 = $false) | ((((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2))))))) => (?? @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) = (Y1 = Y2))))))))) => $true)) = sF149)),
% 9.54/1.99 inference(superposition,[],[f1667,f787])).
% 9.54/1.99 thf(f1808,plain,(
% 9.54/1.99 (sF147 = $false) | ($true = sF149)),
% 9.54/1.99 inference(boolean_simplification,[],[f1804])).
% 9.54/1.99 thf(f1814,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setadjoin @ Y2 @ Y0)) => ((Y2 = Y1) | (in @ Y1 @ Y0))))))))) => ((!! @ $i @ (^[Y0 : $i]: ((dsetconstr @ Y0 @ (^[Y1 : $i]: ($true))) = Y0))) => $true)))) | ($false = sF156)),
% 9.54/1.99 inference(superposition,[],[f1772,f787])).
% 9.54/1.99 thf(f1821,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setadjoin @ Y2 @ Y0)) => ((Y2 = Y1) | (in @ Y1 @ Y0))))))))) => $true))) | ($false = sF156)),
% 9.54/1.99 inference(boolean_simplification,[],[f1814])).
% 9.54/1.99 thf(f1822,plain,(
% 9.54/1.99 ($true = $false) | ($false = sF156)),
% 9.54/1.99 inference(boolean_simplification,[],[f1821])).
% 9.54/1.99 thf(f1823,plain,(
% 9.54/1.99 ($false = sF156)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1822])).
% 9.54/1.99 thf(f1834,plain,(
% 9.54/1.99 ($false = ((powersetI => sF155)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1048,f1823])).
% 9.54/1.99 thf(f1843,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (in @ Y2 @ Y1)))) => (in @ Y0 @ (powerset @ Y1))))))) => sF155)))),
% 9.54/1.99 inference(forward_demodulation,[],[f1834,f754])).
% 9.54/1.99 thf(f1850,plain,(
% 9.54/1.99 ($false = sF155)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f1843])).
% 9.54/1.99 thf(f1860,plain,(
% 9.54/1.99 (((emptyinPowerset => sF154)) = $false)),
% 9.54/1.99 inference(backward_demodulation,[],[f1047,f1850])).
% 9.54/1.99 thf(f1872,plain,(
% 9.54/1.99 (emptyinPowerset = $true)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f1860])).
% 9.54/1.99 thf(f1873,plain,(
% 9.54/1.99 (sF154 = $false) | ($false = ((emptyinPowerset => $true)))),
% 9.54/1.99 inference(superposition,[],[f1860,f787])).
% 9.54/1.99 thf(f1876,plain,(
% 9.54/1.99 (sF154 = $false) | ($true = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f1873])).
% 9.54/1.99 thf(f1877,plain,(
% 9.54/1.99 (sF154 = $false)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1876])).
% 9.54/1.99 thf(f1881,plain,(
% 9.54/1.99 (((emptyInPowerset => sF153)) = $false)),
% 9.54/1.99 inference(backward_demodulation,[],[f1045,f1877])).
% 9.54/1.99 thf(f1885,plain,(
% 9.54/1.99 ($true = ((!! @ $i @ (^[Y0 : $i]: (in @ emptyset @ (powerset @ Y0))))))),
% 9.54/1.99 inference(backward_demodulation,[],[f747,f1872])).
% 9.54/1.99 thf(f1888,plain,(
% 9.54/1.99 ((((!! @ $i @ (^[Y0 : $i]: (in @ emptyset @ (powerset @ Y0)))) => sF153)) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f1881,f750])).
% 9.54/1.99 thf(f1892,plain,(
% 9.54/1.99 ($false = (($true => sF153)))),
% 9.54/1.99 inference(forward_demodulation,[],[f1888,f1885])).
% 9.54/1.99 thf(f1893,plain,(
% 9.54/1.99 (sF153 = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f1892])).
% 9.54/1.99 thf(f1894,plain,(
% 9.54/1.99 ($false = ((powersetE => sF152)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1043,f1893])).
% 9.54/1.99 thf(f1897,plain,(
% 9.54/1.99 ($false = sF152)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f1894])).
% 9.54/1.99 thf(f1907,plain,(
% 9.54/1.99 ($false = ((setunionI => sF151)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1042,f1897])).
% 9.54/1.99 thf(f1918,plain,(
% 9.54/1.99 ($false = sF151) | ($false = ((setunionI => $true)))),
% 9.54/1.99 inference(superposition,[],[f1907,f787])).
% 9.54/1.99 thf(f1921,plain,(
% 9.54/1.99 ($true = $false) | ($false = sF151)),
% 9.54/1.99 inference(boolean_simplification,[],[f1918])).
% 9.54/1.99 thf(f1922,plain,(
% 9.54/1.99 ($false = sF151)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f1921])).
% 9.54/1.99 thf(f1926,plain,(
% 9.54/1.99 ($false = ((setunionE => sF150)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1040,f1922])).
% 9.54/1.99 thf(f1933,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setunion @ Y1)) => (!! @ $o @ (^[Y2 : $o]: ((!! @ $i @ (^[Y3 : $i]: ((in @ Y0 @ Y3) => ((in @ Y3 @ Y1) => Y2)))) => Y2)))))))) => sF150)))),
% 9.54/1.99 inference(forward_demodulation,[],[f1926,f765])).
% 9.54/1.99 thf(f1934,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setunion @ Y1)) => (!! @ $o @ (^[Y2 : $o]: ((!! @ $i @ (^[Y3 : $i]: ((in @ Y0 @ Y3) => ((in @ Y3 @ Y1) => Y2)))) => Y2)))))))) => (subPowSU => sF149))))),
% 9.54/1.99 inference(forward_demodulation,[],[f1933,f1039])).
% 9.54/1.99 thf(f1935,plain,(
% 9.54/1.99 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setunion @ Y1)) => (!! @ $o @ (^[Y2 : $o]: ((!! @ $i @ (^[Y3 : $i]: ((in @ Y0 @ Y3) => ((in @ Y3 @ Y1) => Y2)))) => Y2)))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ Y1) => (in @ Y0 @ (powerset @ (setunion @ Y1)))))))) => sF149))) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f1934,f744])).
% 9.54/1.99 thf(f2001,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setunion @ Y1)) => (!! @ $o @ (^[Y2 : $o]: ((!! @ $i @ (^[Y3 : $i]: ((in @ Y0 @ Y3) => ((in @ Y3 @ Y1) => Y2)))) => Y2)))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ Y1) => (in @ Y0 @ (powerset @ (setunion @ Y1)))))))) => $true)))) | ($false = sF149)),
% 9.54/1.99 inference(superposition,[],[f1935,f787])).
% 9.54/1.99 thf(f2007,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setunion @ Y1)) => (!! @ $o @ (^[Y2 : $o]: ((!! @ $i @ (^[Y3 : $i]: ((in @ Y0 @ Y3) => ((in @ Y3 @ Y1) => Y2)))) => Y2)))))))) => $true))) | ($false = sF149)),
% 9.54/1.99 inference(boolean_simplification,[],[f2001])).
% 9.54/1.99 thf(f2008,plain,(
% 9.54/1.99 ($false = sF149) | ($true = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f2007])).
% 9.54/1.99 thf(f2009,plain,(
% 9.54/1.99 ($false = sF149)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f2008])).
% 9.54/1.99 thf(f2016,plain,(
% 9.54/1.99 ($true = $false) | (sF147 = $false)),
% 9.54/1.99 inference(backward_demodulation,[],[f1808,f2009])).
% 9.54/1.99 thf(f2020,plain,(
% 9.54/1.99 (sF147 = $false)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f2016])).
% 9.54/1.99 thf(f2034,plain,(
% 9.54/1.99 (((uniqinunit => sF146)) = $false)),
% 9.54/1.99 inference(backward_demodulation,[],[f1034,f2020])).
% 9.54/1.99 thf(f2044,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ emptyset)) => (Y1 = Y0)))))) => sF146)))),
% 9.54/1.99 inference(forward_demodulation,[],[f2034,f604])).
% 9.54/1.99 thf(f2050,plain,(
% 9.54/1.99 ($false = sF146)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f2044])).
% 9.54/1.99 thf(f2060,plain,(
% 9.54/1.99 ($false = ((notinsingleton => sF145)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1033,f2050])).
% 9.54/1.99 thf(f2065,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (Y1 = Y0)) => (~ (in @ Y1 @ (setadjoin @ Y0 @ emptyset)))))))) => sF145)))),
% 9.54/1.99 inference(forward_demodulation,[],[f2060,f650])).
% 9.54/1.99 thf(f2072,plain,(
% 9.54/1.99 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (Y1 = Y0)) => (~ (in @ Y1 @ (setadjoin @ Y0 @ emptyset)))))))) => $true)) = $false) | ($false = sF145)),
% 9.54/1.99 inference(superposition,[],[f2065,f787])).
% 9.54/1.99 thf(f2075,plain,(
% 9.54/1.99 ($false = sF145) | ($true = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f2072])).
% 9.54/1.99 thf(f2076,plain,(
% 9.54/1.99 ($false = sF145)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f2075])).
% 9.54/1.99 thf(f2080,plain,(
% 9.54/1.99 ($false = ((eqinunit => sF144)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1032,f2076])).
% 9.54/1.99 thf(f2085,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset))))))) => sF144)))),
% 9.54/1.99 inference(forward_demodulation,[],[f2080,f737])).
% 9.54/1.99 thf(f2090,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset))))))) => $true))) | ($false = sF144)),
% 9.54/1.99 inference(superposition,[],[f2085,f787])).
% 9.54/1.99 thf(f2095,plain,(
% 9.54/1.99 ($true = $false) | ($false = sF144)),
% 9.54/1.99 inference(boolean_simplification,[],[f2090])).
% 9.54/1.99 thf(f2096,plain,(
% 9.54/1.99 ($false = sF144)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f2095])).
% 9.54/1.99 thf(f2098,plain,(
% 9.54/1.99 ($false = ((singletonsswitch => sF143)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1030,f2096])).
% 9.54/1.99 thf(f2103,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ emptyset)) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset))))))) => sF143)))),
% 9.54/1.99 inference(forward_demodulation,[],[f2098,f675])).
% 9.54/1.99 thf(f2106,plain,(
% 9.54/1.99 (sF143 = $false)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f2103])).
% 9.54/1.99 thf(f2122,plain,(
% 9.54/1.99 ($false = ((upairsetE => sF142)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1029,f2106])).
% 9.54/1.99 thf(f2123,plain,(
% 9.54/1.99 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setadjoin @ Y2 @ (setadjoin @ Y0 @ emptyset))) => ((Y2 = Y1) | (Y1 = Y0))))))))) => sF142)) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f2122,f742])).
% 9.54/1.99 thf(f2124,plain,(
% 9.54/1.99 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setadjoin @ Y2 @ (setadjoin @ Y0 @ emptyset))) => ((Y2 = Y1) | (Y1 = Y0))))))))) => (upairsetIL => sF141))) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f2123,f1028])).
% 9.54/1.99 thf(f2125,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setadjoin @ Y2 @ (setadjoin @ Y0 @ emptyset))) => ((Y2 = Y1) | (Y1 = Y0))))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y0 @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset))))))) => sF141))))),
% 9.54/1.99 inference(forward_demodulation,[],[f2124,f714])).
% 9.54/1.99 thf(f2143,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setadjoin @ Y2 @ (setadjoin @ Y0 @ emptyset))) => ((Y2 = Y1) | (Y1 = Y0))))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y0 @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset))))))) => $true)))) | (sF141 = $false)),
% 9.54/1.99 inference(superposition,[],[f2125,f787])).
% 9.54/1.99 thf(f2149,plain,(
% 9.54/1.99 (sF141 = $false) | ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setadjoin @ Y2 @ (setadjoin @ Y0 @ emptyset))) => ((Y2 = Y1) | (Y1 = Y0))))))))) => $true)))),
% 9.54/1.99 inference(boolean_simplification,[],[f2143])).
% 9.54/1.99 thf(f2150,plain,(
% 9.54/1.99 (sF141 = $false) | ($true = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f2149])).
% 9.54/1.99 thf(f2151,plain,(
% 9.54/1.99 (sF141 = $false)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f2150])).
% 9.54/1.99 thf(f2158,plain,(
% 9.54/1.99 (((upairsetIR => sF140)) = $false)),
% 9.54/1.99 inference(backward_demodulation,[],[f1026,f2151])).
% 9.54/1.99 thf(f2173,plain,(
% 9.54/1.99 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset))))))) => sF140)) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f2158,f719])).
% 9.54/1.99 thf(f2185,plain,(
% 9.54/1.99 ($false = sF140)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f2173])).
% 9.54/1.99 thf(f2195,plain,(
% 9.54/1.99 ($false = ((emptyE1 => sF139)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1025,f2185])).
% 9.54/1.99 thf(f2204,plain,(
% 9.54/1.99 ($false = sF139)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f2195])).
% 9.54/1.99 thf(f2214,plain,(
% 9.54/1.99 (((vacuousDall => sF138)) = $false)),
% 9.54/1.99 inference(backward_demodulation,[],[f1024,f2204])).
% 9.54/1.99 thf(f2219,plain,(
% 9.54/1.99 ($false = (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ emptyset) => (Y0 @ Y1)))))) => sF138)))),
% 9.54/1.99 inference(forward_demodulation,[],[f2214,f671])).
% 9.54/1.99 thf(f2224,plain,(
% 9.54/1.99 ((((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ emptyset) => (Y0 @ Y1)))))) => (quantDeMorgan1 => sF137))) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f2219,f1022])).
% 9.54/1.99 thf(f2227,plain,(
% 9.54/1.99 ($false = sF137) | ((((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ emptyset) => (Y0 @ Y1)))))) => (quantDeMorgan1 => $true))) = $false)),
% 9.54/1.99 inference(superposition,[],[f2224,f787])).
% 9.54/1.99 thf(f2233,plain,(
% 9.54/1.99 ($false = (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ emptyset) => (Y0 @ Y1)))))) => $true))) | ($false = sF137)),
% 9.54/1.99 inference(boolean_simplification,[],[f2227])).
% 9.54/1.99 thf(f2234,plain,(
% 9.54/1.99 ($true = $false) | ($false = sF137)),
% 9.54/1.99 inference(boolean_simplification,[],[f2233])).
% 9.54/1.99 thf(f2235,plain,(
% 9.54/1.99 ($false = sF137)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f2234])).
% 9.54/1.99 thf(f2243,plain,(
% 9.54/1.99 ($false = ((quantDeMorgan2 => sF136)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1021,f2235])).
% 9.54/1.99 thf(f2256,plain,(
% 9.54/1.99 ($false = (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (~ (Y0 @ Y2))))) => (~ (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) & (Y0 @ Y2)))))))))) => sF136)))),
% 9.54/1.99 inference(forward_demodulation,[],[f2243,f632])).
% 9.54/1.99 thf(f2264,plain,(
% 9.54/1.99 ($false = (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (~ (Y0 @ Y2))))) => (~ (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) & (Y0 @ Y2)))))))))) => (quantDeMorgan3 => sF135))))),
% 9.54/1.99 inference(forward_demodulation,[],[f2256,f1020])).
% 9.54/1.99 thf(f2283,plain,(
% 9.54/1.99 ($false = (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (~ (Y0 @ Y2))))) => (~ (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) & (Y0 @ Y2)))))))))) => (quantDeMorgan3 => $true)))) | (sF135 = $false)),
% 9.54/1.99 inference(superposition,[],[f2264,f787])).
% 9.54/1.99 thf(f2290,plain,(
% 9.54/1.99 ($false = (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (~ (Y0 @ Y2))))) => (~ (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) & (Y0 @ Y2)))))))))) => $true))) | (sF135 = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f2283])).
% 9.54/1.99 thf(f2291,plain,(
% 9.54/1.99 (sF135 = $false) | ($true = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f2290])).
% 9.54/1.99 thf(f2292,plain,(
% 9.54/1.99 (sF135 = $false)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f2291])).
% 9.54/1.99 thf(f2300,plain,(
% 9.54/1.99 ($false = ((quantDeMorgan4 => sF134)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1019,f2292])).
% 9.54/1.99 thf(f2319,plain,(
% 9.54/1.99 ($false = sF134) | (((quantDeMorgan4 => $true)) = $false)),
% 9.54/1.99 inference(superposition,[],[f2300,f787])).
% 9.54/1.99 thf(f2323,plain,(
% 9.54/1.99 ($false = sF134) | ($true = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f2319])).
% 9.54/1.99 thf(f2324,plain,(
% 9.54/1.99 ($false = sF134)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f2323])).
% 9.54/1.99 thf(f2331,plain,(
% 9.54/1.99 ($false = ((prop2setI => sF133)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1018,f2324])).
% 9.54/1.99 thf(f2332,plain,(
% 9.54/1.99 (sF133 = $false)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f2331])).
% 9.54/1.99 thf(f2346,plain,(
% 9.54/1.99 (((prop2set2propI => sF132)) = $false)),
% 9.54/1.99 inference(backward_demodulation,[],[f1016,f2332])).
% 9.54/1.99 thf(f2347,plain,(
% 9.54/1.99 ($false = sF132)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f2346])).
% 9.54/1.99 thf(f2357,plain,(
% 9.54/1.99 ($false = ((notdexE => sF131)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1015,f2347])).
% 9.54/1.99 thf(f2364,plain,(
% 9.54/1.99 ((((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((~ (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) & (Y1 @ Y2))))) => (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (~ (Y1 @ Y2)))))))))) => sF131)) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f2357,f655])).
% 9.54/1.99 thf(f2365,plain,(
% 9.54/1.99 (((quantDeMorgan3 => sF131)) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f2364,f763])).
% 9.54/1.99 thf(f2368,plain,(
% 9.54/1.99 ($false = ((quantDeMorgan3 => $true))) | (sF131 = $false)),
% 9.54/1.99 inference(superposition,[],[f2365,f787])).
% 9.54/1.99 thf(f2371,plain,(
% 9.54/1.99 ($true = $false) | (sF131 = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f2368])).
% 9.54/1.99 thf(f2372,plain,(
% 9.54/1.99 (sF131 = $false)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f2371])).
% 9.54/1.99 thf(f2380,plain,(
% 9.54/1.99 ($false = ((notdallE => sF130)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1013,f2372])).
% 9.54/1.99 thf(f2384,plain,(
% 9.54/1.99 ($false = sF130)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f2380])).
% 9.54/1.99 thf(f2394,plain,(
% 9.54/1.99 ($false = ((exuI1 => sF129)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1012,f2384])).
% 9.54/1.99 thf(f2405,plain,(
% 9.54/1.99 ($false = sF129) | (((exuI1 => $true)) = $false)),
% 9.54/1.99 inference(superposition,[],[f2394,f787])).
% 9.54/1.99 thf(f2408,plain,(
% 9.54/1.99 ($true = $false) | ($false = sF129)),
% 9.54/1.99 inference(boolean_simplification,[],[f2405])).
% 9.54/1.99 thf(f2409,plain,(
% 9.54/1.99 ($false = sF129)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f2408])).
% 9.54/1.99 thf(f2415,plain,(
% 9.54/1.99 ($false = ((exuI3 => sF128)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1010,f2409])).
% 9.54/1.99 thf(f2418,plain,(
% 9.54/1.99 ((((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((?? @ $i @ Y0) => ((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y1) => ((Y0 @ Y2) => (Y2 = Y1))))))) => (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2))))))))))) => sF128)) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f2415,f1125])).
% 9.54/1.99 thf(f2478,plain,(
% 9.54/1.99 (sF128 = $false)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f2418])).
% 9.54/1.99 thf(f2488,plain,(
% 9.54/1.99 ($false = ((exuI2 => sF127)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1009,f2478])).
% 9.54/1.99 thf(f2495,plain,(
% 9.54/1.99 ($false = (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((?? @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y1 = Y2) = (Y0 @ Y2)))))) => (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2)))))))))) => sF127)))),
% 9.54/1.99 inference(forward_demodulation,[],[f2488,f1143])).
% 9.54/1.99 thf(f2498,plain,(
% 9.54/1.99 ($false = sF127)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f2495])).
% 9.54/1.99 thf(f2508,plain,(
% 9.54/1.99 ($false = ((inCongP => sF126)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1008,f2498])).
% 9.54/1.99 thf(f2515,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y3 = Y2) => ((in @ Y3 @ Y0) => (in @ Y2 @ Y1)))))))))))) => sF126)))),
% 9.54/1.99 inference(forward_demodulation,[],[f2508,f613])).
% 9.54/1.99 thf(f2516,plain,(
% 9.54/1.99 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y3 = Y2) => ((in @ Y3 @ Y0) => (in @ Y2 @ Y1)))))))))))) => (in__Cong => sF125))) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f2515,f1006])).
% 9.54/1.99 thf(f2519,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y3 = Y2) => ((in @ Y3 @ Y0) => (in @ Y2 @ Y1)))))))))))) => (in__Cong => $true)))) | ($false = sF125)),
% 9.54/1.99 inference(superposition,[],[f2516,f787])).
% 9.54/1.99 thf(f2525,plain,(
% 9.54/1.99 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y3 = Y2) => ((in @ Y3 @ Y0) => (in @ Y2 @ Y1)))))))))))) => $true))) | ($false = sF125)),
% 9.54/1.99 inference(boolean_simplification,[],[f2519])).
% 9.54/1.99 thf(f2526,plain,(
% 9.54/1.99 ($true = $false) | ($false = sF125)),
% 9.54/1.99 inference(boolean_simplification,[],[f2525])).
% 9.54/1.99 thf(f2527,plain,(
% 9.54/1.99 ($false = sF125)),
% 9.54/1.99 inference(trivial_inequality_removal,[],[f2526])).
% 9.54/1.99 thf(f2537,plain,(
% 9.54/1.99 ($false = ((exuE3u => sF124)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1004,f2527])).
% 9.54/1.99 thf(f2557,plain,(
% 9.54/1.99 ($false = sF124)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f2537])).
% 9.54/1.99 thf(f2569,plain,(
% 9.54/1.99 ($false = ((exu__Cong => sF123)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1002,f2557])).
% 9.54/1.99 thf(f2570,plain,(
% 9.54/1.99 ($false = sF123)),
% 9.54/1.99 inference(imp_proxy_clausification,[],[f2569])).
% 9.54/1.99 thf(f2580,plain,(
% 9.54/1.99 ($false = ((emptyset__Cong => sF122)))),
% 9.54/1.99 inference(backward_demodulation,[],[f1001,f2570])).
% 9.54/1.99 thf(f2585,plain,(
% 9.54/1.99 ((($true => sF122)) = $false)),
% 9.54/1.99 inference(forward_demodulation,[],[f2580,f1138])).
% 9.54/1.99 thf(f2586,plain,(
% 9.54/1.99 (sF122 = $false)),
% 9.54/1.99 inference(boolean_simplification,[],[f2585])).
% 9.54/1.99 thf(f2589,plain,(
% 9.54/1.99 (((setadjoin__Cong => sF121)) = $false)),
% 9.54/1.99 inference(backward_demodulation,[],[f999,f2586])).
% 9.54/1.99 thf(f2590,plain,(
% 9.54/1.99 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y3 = Y2) => ((setadjoin @ Y0 @ Y3) = (setadjoin @ Y1 @ Y2)))))))))))) => sF121)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f2589,f659])).
% 9.54/2.00 thf(f2595,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y3 = Y2) => ((setadjoin @ Y0 @ Y3) = (setadjoin @ Y1 @ Y2)))))))))))) => $true))) | (sF121 = $false)),
% 9.54/2.00 inference(superposition,[],[f2590,f787])).
% 9.54/2.00 thf(f2598,plain,(
% 9.54/2.00 (sF121 = $false) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f2595])).
% 9.54/2.00 thf(f2599,plain,(
% 9.54/2.00 (sF121 = $false)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f2598])).
% 9.54/2.00 thf(f2603,plain,(
% 9.54/2.00 (((powerset__Cong => sF120)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f998,f2599])).
% 9.54/2.00 thf(f2608,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => ((powerset @ Y1) = (powerset @ Y0))))))) => sF120)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f2603,f653])).
% 9.54/2.00 thf(f2613,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => ((powerset @ Y1) = (powerset @ Y0))))))) => (setunion__Cong => sF119))))),
% 9.54/2.00 inference(forward_demodulation,[],[f2608,f996])).
% 9.54/2.00 thf(f2616,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => ((powerset @ Y1) = (powerset @ Y0))))))) => (setunion__Cong => $true)))) | ($false = sF119)),
% 9.54/2.00 inference(superposition,[],[f2613,f787])).
% 9.54/2.00 thf(f2623,plain,(
% 9.54/2.00 ($false = sF119) | ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => ((powerset @ Y1) = (powerset @ Y0))))))) => $true)) = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f2616])).
% 9.54/2.00 thf(f2624,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF119)),
% 9.54/2.00 inference(boolean_simplification,[],[f2623])).
% 9.54/2.00 thf(f2625,plain,(
% 9.54/2.00 ($false = sF119)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f2624])).
% 9.54/2.00 thf(f2632,plain,(
% 9.54/2.00 ($false = ((omega__Cong => sF118)))),
% 9.54/2.00 inference(backward_demodulation,[],[f995,f2625])).
% 9.54/2.00 thf(f2647,plain,(
% 9.54/2.00 ($false = (($true => sF118)))),
% 9.54/2.00 inference(forward_demodulation,[],[f2632,f1118])).
% 9.54/2.00 thf(f2648,plain,(
% 9.54/2.00 ($false = sF118)),
% 9.54/2.00 inference(boolean_simplification,[],[f2647])).
% 9.54/2.00 thf(f2656,plain,(
% 9.54/2.00 (((exuEu => sF117)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f993,f2648])).
% 9.54/2.00 thf(f2657,plain,(
% 9.54/2.00 ($false = ((exuEu => (descr__Cong => sF116))))),
% 9.54/2.00 inference(forward_demodulation,[],[f2656,f991])).
% 9.54/2.00 thf(f2664,plain,(
% 9.54/2.00 ($false = ((exuEu => (descr__Cong => $true)))) | (sF116 = $false)),
% 9.54/2.00 inference(superposition,[],[f2657,f787])).
% 9.54/2.00 thf(f2672,plain,(
% 9.54/2.00 (((exuEu => $true)) = $false) | (sF116 = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f2664])).
% 9.54/2.00 thf(f2673,plain,(
% 9.54/2.00 ($true = $false) | (sF116 = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f2672])).
% 9.54/2.00 thf(f2674,plain,(
% 9.54/2.00 (sF116 = $false)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f2673])).
% 9.54/2.00 thf(f2681,plain,(
% 9.54/2.00 (((dsetconstr__Cong => sF115)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f990,f2674])).
% 9.54/2.00 thf(f2696,plain,(
% 9.54/2.00 ($false = sF115)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f2681])).
% 9.54/2.00 thf(f2706,plain,(
% 9.54/2.00 ($false = ((subsetI1 => sF114)))),
% 9.54/2.00 inference(backward_demodulation,[],[f988,f2696])).
% 9.54/2.00 thf(f2711,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (subset @ Y1 @ Y0)))))) => sF114)))),
% 9.54/2.00 inference(forward_demodulation,[],[f2706,f601])).
% 9.54/2.00 thf(f2716,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (subset @ Y1 @ Y0)))))) => $true)) = $false) | ($false = sF114)),
% 9.54/2.00 inference(superposition,[],[f2711,f787])).
% 9.54/2.00 thf(f2720,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF114)),
% 9.54/2.00 inference(boolean_simplification,[],[f2716])).
% 9.54/2.00 thf(f2721,plain,(
% 9.54/2.00 ($false = sF114)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f2720])).
% 9.54/2.00 thf(f2728,plain,(
% 9.54/2.00 ($false = ((eqimpsubset2 => sF113)))),
% 9.54/2.00 inference(backward_demodulation,[],[f987,f2721])).
% 9.54/2.00 thf(f2731,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (subset @ Y0 @ Y1)))))) => sF113)))),
% 9.54/2.00 inference(forward_demodulation,[],[f2728,f600])).
% 9.54/2.00 thf(f2732,plain,(
% 9.54/2.00 (((eqimpsubset1 => sF113)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f2731,f644])).
% 9.54/2.00 thf(f2734,plain,(
% 9.54/2.00 (eqimpsubset1 = $true)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f2732])).
% 9.54/2.00 thf(f2735,plain,(
% 9.54/2.00 (sF113 = $false) | ($false = ((eqimpsubset1 => $true)))),
% 9.54/2.00 inference(superposition,[],[f2732,f787])).
% 9.54/2.00 thf(f2738,plain,(
% 9.54/2.00 (sF113 = $false) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f2735])).
% 9.54/2.00 thf(f2739,plain,(
% 9.54/2.00 (sF113 = $false)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f2738])).
% 9.54/2.00 thf(f2743,plain,(
% 9.54/2.00 ($false = ((eqimpsubset1 => sF112)))),
% 9.54/2.00 inference(backward_demodulation,[],[f986,f2739])).
% 9.54/2.00 thf(f2748,plain,(
% 9.54/2.00 ($false = (($true => sF112)))),
% 9.54/2.00 inference(forward_demodulation,[],[f2743,f2734])).
% 9.54/2.00 thf(f2749,plain,(
% 9.54/2.00 ($false = sF112)),
% 9.54/2.00 inference(boolean_simplification,[],[f2748])).
% 9.54/2.00 thf(f2753,plain,(
% 9.54/2.00 ($false = ((subsetI2 => sF111)))),
% 9.54/2.00 inference(backward_demodulation,[],[f985,f2749])).
% 9.54/2.00 thf(f2754,plain,(
% 9.54/2.00 ($false = ((subsetI2 => (emptysetsubset => sF110))))),
% 9.54/2.00 inference(forward_demodulation,[],[f2753,f983])).
% 9.54/2.00 thf(f2755,plain,(
% 9.54/2.00 ($false = ((subsetI2 => ((!! @ $i @ (subset @ emptyset)) => sF110))))),
% 9.54/2.00 inference(forward_demodulation,[],[f2754,f1137])).
% 9.54/2.00 thf(f2762,plain,(
% 9.54/2.00 ($false = sF110) | (((subsetI2 => ((!! @ $i @ (subset @ emptyset)) => $true))) = $false)),
% 9.54/2.00 inference(superposition,[],[f2755,f787])).
% 9.54/2.00 thf(f2770,plain,(
% 9.54/2.00 (((subsetI2 => $true)) = $false) | ($false = sF110)),
% 9.54/2.00 inference(boolean_simplification,[],[f2762])).
% 9.54/2.00 thf(f2771,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF110)),
% 9.54/2.00 inference(boolean_simplification,[],[f2770])).
% 9.54/2.00 thf(f2772,plain,(
% 9.54/2.00 ($false = sF110)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f2771])).
% 9.54/2.00 thf(f2783,plain,(
% 9.54/2.00 ($false = ((subsetE => sF109)))),
% 9.54/2.00 inference(backward_demodulation,[],[f982,f2772])).
% 9.54/2.00 thf(f2793,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y0 @ Y1) => ((in @ Y2 @ Y0) => (in @ Y2 @ Y1))))))))) => sF109)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f2783,f733])).
% 9.54/2.00 thf(f2821,plain,(
% 9.54/2.00 ($false = sF109)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f2793])).
% 9.54/2.00 thf(f2837,plain,(
% 9.54/2.00 ($false = ((subsetE2 => sF108)))),
% 9.54/2.00 inference(backward_demodulation,[],[f980,f2821])).
% 9.54/2.00 thf(f2838,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y2 @ Y0) => ((~ (in @ Y1 @ Y0)) => (~ (in @ Y1 @ Y2)))))))))) => sF108)))),
% 9.54/2.00 inference(forward_demodulation,[],[f2837,f622])).
% 9.54/2.00 thf(f2839,plain,(
% 9.54/2.00 ($false = sF108)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f2838])).
% 9.54/2.00 thf(f2849,plain,(
% 9.54/2.00 ($false = ((notsubsetI => sF107)))),
% 9.54/2.00 inference(backward_demodulation,[],[f979,f2839])).
% 9.54/2.00 thf(f2856,plain,(
% 9.54/2.00 ($false = sF107)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f2849])).
% 9.54/2.00 thf(f2866,plain,(
% 9.54/2.00 ($false = ((notequalI1 => sF106)))),
% 9.54/2.00 inference(backward_demodulation,[],[f977,f2856])).
% 9.54/2.00 thf(f2873,plain,(
% 9.54/2.00 (sF106 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f2866])).
% 9.54/2.00 thf(f2885,plain,(
% 9.54/2.00 (((notequalI2 => sF105)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f976,f2873])).
% 9.54/2.00 thf(f2890,plain,(
% 9.54/2.00 ($false = sF105) | (((notequalI2 => $true)) = $false)),
% 9.54/2.00 inference(superposition,[],[f2885,f787])).
% 9.54/2.00 thf(f2895,plain,(
% 9.54/2.00 ($false = sF105) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f2890])).
% 9.54/2.00 thf(f2896,plain,(
% 9.54/2.00 ($false = sF105)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f2895])).
% 9.54/2.00 thf(f2898,plain,(
% 9.54/2.00 ($false = ((subsetRefl => sF104)))),
% 9.54/2.00 inference(backward_demodulation,[],[f974,f2896])).
% 9.54/2.00 thf(f2903,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (subset @ Y0 @ Y0))) => sF104)))),
% 9.54/2.00 inference(forward_demodulation,[],[f2898,f710])).
% 9.54/2.00 thf(f2904,plain,(
% 9.54/2.00 ($false = sF104)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f2903])).
% 9.54/2.00 thf(f2914,plain,(
% 9.54/2.00 ($false = ((subsetTrans => sF103)))),
% 9.54/2.00 inference(backward_demodulation,[],[f972,f2904])).
% 9.54/2.00 thf(f2919,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y0 @ Y2) => ((subset @ Y2 @ Y1) => (subset @ Y0 @ Y1))))))))) => sF103)))),
% 9.54/2.00 inference(forward_demodulation,[],[f2914,f668])).
% 9.54/2.00 thf(f3014,plain,(
% 9.54/2.00 ($false = sF103) | ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y0 @ Y2) => ((subset @ Y2 @ Y1) => (subset @ Y0 @ Y1))))))))) => $true)))),
% 9.54/2.00 inference(superposition,[],[f2919,f787])).
% 9.54/2.00 thf(f3017,plain,(
% 9.54/2.00 ($false = sF103) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f3014])).
% 9.54/2.00 thf(f3018,plain,(
% 9.54/2.00 ($false = sF103)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3017])).
% 9.54/2.00 thf(f3022,plain,(
% 9.54/2.00 ($false = ((setadjoinSub => sF102)))),
% 9.54/2.00 inference(backward_demodulation,[],[f970,f3018])).
% 9.54/2.00 thf(f3029,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ Y0 @ (setadjoin @ Y1 @ Y0)))))) => sF102)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3022,f684])).
% 9.54/2.00 thf(f3030,plain,(
% 9.54/2.00 (sF102 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3029])).
% 9.54/2.00 thf(f3044,plain,(
% 9.54/2.00 ($false = ((setadjoinSub2 => sF101)))),
% 9.54/2.00 inference(backward_demodulation,[],[f968,f3030])).
% 9.54/2.00 thf(f3047,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y1 @ Y2) => (subset @ Y1 @ (setadjoin @ Y0 @ Y2))))))))) => sF101)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3044,f760])).
% 9.54/2.00 thf(f3048,plain,(
% 9.54/2.00 ($false = sF101)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3047])).
% 9.54/2.00 thf(f3062,plain,(
% 9.54/2.00 ($false = ((subset2powerset => sF100)))),
% 9.54/2.00 inference(backward_demodulation,[],[f967,f3048])).
% 9.54/2.00 thf(f3063,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((subset @ Y1 @ Y0) => (in @ Y1 @ (powerset @ Y0))))))) => sF100)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3062,f648])).
% 9.54/2.00 thf(f3066,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((subset @ Y1 @ Y0) => (in @ Y1 @ (powerset @ Y0))))))) => $true))) | ($false = sF100)),
% 9.54/2.00 inference(superposition,[],[f3063,f787])).
% 9.54/2.00 thf(f3069,plain,(
% 9.54/2.00 ($false = sF100) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f3066])).
% 9.54/2.00 thf(f3070,plain,(
% 9.54/2.00 ($false = sF100)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3069])).
% 9.54/2.00 thf(f3074,plain,(
% 9.54/2.00 ($false = ((setextsub => sF99)))),
% 9.54/2.00 inference(backward_demodulation,[],[f965,f3070])).
% 9.54/2.00 thf(f3081,plain,(
% 9.54/2.00 (sF99 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3074])).
% 9.54/2.00 thf(f3091,plain,(
% 9.54/2.00 ($false = ((subsetemptysetimpeq => sF98)))),
% 9.54/2.00 inference(backward_demodulation,[],[f964,f3081])).
% 9.54/2.00 thf(f3096,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: ((subset @ Y0 @ emptyset) => (emptyset = Y0)))) => sF98)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3091,f614])).
% 9.54/2.00 thf(f3101,plain,(
% 9.54/2.00 (sF98 = $false) | ($false = (((!! @ $i @ (^[Y0 : $i]: ((subset @ Y0 @ emptyset) => (emptyset = Y0)))) => $true)))),
% 9.54/2.00 inference(superposition,[],[f3096,f787])).
% 9.54/2.00 thf(f3104,plain,(
% 9.54/2.00 (sF98 = $false) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f3101])).
% 9.54/2.00 thf(f3105,plain,(
% 9.54/2.00 (sF98 = $false)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3104])).
% 9.54/2.00 thf(f3109,plain,(
% 9.54/2.00 ($false = ((powersetI1 => sF97)))),
% 9.54/2.00 inference(backward_demodulation,[],[f963,f3105])).
% 9.54/2.00 thf(f3118,plain,(
% 9.54/2.00 ($false = sF97)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3109])).
% 9.54/2.00 thf(f3130,plain,(
% 9.54/2.00 ($false = ((powersetE1 => sF96)))),
% 9.54/2.00 inference(backward_demodulation,[],[f962,f3118])).
% 9.54/2.00 thf(f3131,plain,(
% 9.54/2.00 (sF96 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3130])).
% 9.54/2.00 thf(f3145,plain,(
% 9.54/2.00 ($false = ((inPowerset => sF95)))),
% 9.54/2.00 inference(backward_demodulation,[],[f960,f3131])).
% 9.54/2.00 thf(f3148,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (in @ Y0 @ (powerset @ Y0)))) => sF95)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3145,f663])).
% 9.54/2.00 thf(f3149,plain,(
% 9.54/2.00 ($false = sF95)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3148])).
% 9.54/2.00 thf(f3159,plain,(
% 9.54/2.00 (((powersetsubset => sF94)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f959,f3149])).
% 9.54/2.00 thf(f3166,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((subset @ Y0 @ Y1) => (subset @ (powerset @ Y0) @ (powerset @ Y1))))))) => sF94)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3159,f665])).
% 9.54/2.00 thf(f3186,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((subset @ Y0 @ Y1) => (subset @ (powerset @ Y0) @ (powerset @ Y1))))))) => $true))) | (sF94 = $false)),
% 9.54/2.00 inference(superposition,[],[f3166,f787])).
% 9.54/2.00 thf(f3189,plain,(
% 9.54/2.00 (sF94 = $false) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f3186])).
% 9.54/2.00 thf(f3190,plain,(
% 9.54/2.00 (sF94 = $false)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3189])).
% 9.54/2.00 thf(f3196,plain,(
% 9.54/2.00 ($false = ((sepInPowerset => sF93)))),
% 9.54/2.00 inference(backward_demodulation,[],[f957,f3190])).
% 9.54/2.00 thf(f3199,plain,(
% 9.54/2.00 ($false = (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (in @ (dsetconstr @ Y1 @ Y0) @ (powerset @ Y1)))))) => sF93)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3196,f1109])).
% 9.54/2.00 thf(f3200,plain,(
% 9.54/2.00 (sF93 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3199])).
% 9.54/2.00 thf(f3214,plain,(
% 9.54/2.00 (((sepSubset => sF92)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f956,f3200])).
% 9.54/2.00 thf(f3215,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (subset @ (dsetconstr @ Y0 @ Y1) @ Y0))))) => sF92)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f3214,f1107])).
% 9.54/2.00 thf(f3216,plain,(
% 9.54/2.00 (sF92 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3215])).
% 9.54/2.00 thf(f3230,plain,(
% 9.54/2.00 (((binunionIL => sF91)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f955,f3216])).
% 9.54/2.00 thf(f3231,plain,(
% 9.54/2.00 ($false = sF91)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3230])).
% 9.54/2.00 thf(f3245,plain,(
% 9.54/2.00 (((upairset2IR => sF90)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f953,f3231])).
% 9.54/2.00 thf(f3248,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y0 @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset))))))) => sF90)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3245,f718])).
% 9.54/2.00 thf(f3249,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y0 @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset))))))) => (binunionIR => sF89))))),
% 9.54/2.00 inference(forward_demodulation,[],[f3248,f951])).
% 9.54/2.00 thf(f3251,plain,(
% 9.54/2.00 (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y0 @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset)))))))) = $true)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3249])).
% 9.54/2.00 thf(f3252,plain,(
% 9.54/2.00 ($false = sF89) | ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y0 @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset))))))) => (binunionIR => $true))))),
% 9.54/2.00 inference(superposition,[],[f3249,f787])).
% 9.54/2.00 thf(f3257,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y0 @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset))))))) => $true))) | ($false = sF89)),
% 9.54/2.00 inference(boolean_simplification,[],[f3252])).
% 9.54/2.00 thf(f3258,plain,(
% 9.54/2.00 ($false = sF89) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f3257])).
% 9.54/2.00 thf(f3259,plain,(
% 9.54/2.00 ($false = sF89)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3258])).
% 9.54/2.00 thf(f3267,plain,(
% 9.54/2.00 ($false = ((binunionEcases => sF88)))),
% 9.54/2.00 inference(backward_demodulation,[],[f950,f3259])).
% 9.54/2.00 thf(f3281,plain,(
% 9.54/2.00 (secondinupair = $true)),
% 9.54/2.00 inference(backward_demodulation,[],[f656,f3251])).
% 9.54/2.00 thf(f3289,plain,(
% 9.54/2.00 ((($true => sF57)) = sF58)),
% 9.54/2.00 inference(backward_demodulation,[],[f903,f3281])).
% 9.54/2.00 thf(f3290,plain,(
% 9.54/2.00 (sF57 = sF58)),
% 9.54/2.00 inference(boolean_simplification,[],[f3289])).
% 9.54/2.00 thf(f3291,plain,(
% 9.54/2.00 (sF58 = ((setukpairIL => sF56)))),
% 9.54/2.00 inference(backward_demodulation,[],[f901,f3290])).
% 9.54/2.00 thf(f3302,plain,(
% 9.54/2.00 (sF88 = $false) | (((binunionEcases => $true)) = $false)),
% 9.54/2.00 inference(superposition,[],[f3267,f787])).
% 9.54/2.00 thf(f3306,plain,(
% 9.54/2.00 ($true = $false) | (sF88 = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f3302])).
% 9.54/2.00 thf(f3307,plain,(
% 9.54/2.00 (sF88 = $false)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3306])).
% 9.54/2.00 thf(f3310,plain,(
% 9.54/2.00 ($false = ((binunionE => sF87)))),
% 9.54/2.00 inference(backward_demodulation,[],[f949,f3307])).
% 9.54/2.00 thf(f3315,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (binunion @ Y0 @ Y1)) => ((in @ Y2 @ Y0) | (in @ Y2 @ Y1))))))))) => sF87)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f3310,f629])).
% 9.54/2.00 thf(f3318,plain,(
% 9.54/2.00 (((setukpairIL => $true)) = sF58) | ($false = sF56)),
% 9.54/2.00 inference(superposition,[],[f3291,f787])).
% 9.54/2.00 thf(f3321,plain,(
% 9.54/2.00 ($true = sF58) | ($false = sF56)),
% 9.54/2.00 inference(boolean_simplification,[],[f3318])).
% 9.54/2.00 thf(f3359,plain,(
% 9.54/2.00 ($false = sF87)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3315])).
% 9.54/2.00 thf(f3373,plain,(
% 9.54/2.00 ($false = ((binunionLsub => sF86)))),
% 9.54/2.00 inference(backward_demodulation,[],[f948,f3359])).
% 9.54/2.00 thf(f3376,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ Y0 @ (binunion @ Y0 @ Y1)))))) => sF86)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3373,f634])).
% 9.54/2.00 thf(f3379,plain,(
% 9.54/2.00 ($false = sF86) | ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ Y0 @ (binunion @ Y0 @ Y1)))))) => $true)))),
% 9.54/2.00 inference(superposition,[],[f3376,f787])).
% 9.54/2.00 thf(f3384,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF86)),
% 9.54/2.00 inference(boolean_simplification,[],[f3379])).
% 9.54/2.00 thf(f3385,plain,(
% 9.54/2.00 ($false = sF86)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3384])).
% 9.54/2.00 thf(f3391,plain,(
% 9.54/2.00 ($false = ((binunionRsub => sF85)))),
% 9.54/2.00 inference(backward_demodulation,[],[f947,f3385])).
% 9.54/2.00 thf(f3392,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ Y0 @ (binunion @ Y1 @ Y0)))))) => sF85)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3391,f702])).
% 9.54/2.00 thf(f3393,plain,(
% 9.54/2.00 (sF85 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3392])).
% 9.54/2.00 thf(f3403,plain,(
% 9.54/2.00 ($false = ((binintersectI => sF84)))),
% 9.54/2.00 inference(backward_demodulation,[],[f945,f3393])).
% 9.54/2.00 thf(f3410,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => ((in @ Y1 @ Y2) => (in @ Y1 @ (binintersect @ Y0 @ Y2)))))))))) => sF84)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3403,f596])).
% 9.54/2.00 thf(f3413,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => ((in @ Y1 @ Y2) => (in @ Y1 @ (binintersect @ Y0 @ Y2)))))))))) => $true)) = $false) | (sF84 = $false)),
% 9.54/2.00 inference(superposition,[],[f3410,f787])).
% 9.54/2.00 thf(f3416,plain,(
% 9.54/2.00 (sF84 = $false) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f3413])).
% 9.54/2.00 thf(f3417,plain,(
% 9.54/2.00 (sF84 = $false)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3416])).
% 9.54/2.00 thf(f3423,plain,(
% 9.54/2.00 ($false = ((binintersectSubset5 => sF83)))),
% 9.54/2.00 inference(backward_demodulation,[],[f944,f3417])).
% 9.54/2.00 thf(f3428,plain,(
% 9.54/2.00 ($false = ((binintersectSubset5 => $true))) | (sF83 = $false)),
% 9.54/2.00 inference(superposition,[],[f3423,f787])).
% 9.54/2.00 thf(f3431,plain,(
% 9.54/2.00 (sF83 = $false) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f3428])).
% 9.54/2.00 thf(f3432,plain,(
% 9.54/2.00 (sF83 = $false)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3431])).
% 9.54/2.00 thf(f3436,plain,(
% 9.54/2.00 ($false = ((binintersectEL => sF82)))),
% 9.54/2.00 inference(backward_demodulation,[],[f943,f3432])).
% 9.54/2.00 thf(f3441,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (binintersect @ Y2 @ Y0)) => (in @ Y1 @ Y2)))))))) => sF82)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f3436,f631])).
% 9.54/2.00 thf(f3444,plain,(
% 9.54/2.00 ($false = sF82)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3441])).
% 9.54/2.00 thf(f3454,plain,(
% 9.54/2.00 ($false = ((binintersectLsub => sF81)))),
% 9.54/2.00 inference(backward_demodulation,[],[f942,f3444])).
% 9.54/2.00 thf(f3459,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ (binintersect @ Y1 @ Y0) @ Y1))))) => sF81)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3454,f767])).
% 9.54/2.00 thf(f3462,plain,(
% 9.54/2.00 ($false = sF81) | ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ (binintersect @ Y1 @ Y0) @ Y1))))) => $true)) = $false)),
% 9.54/2.00 inference(superposition,[],[f3459,f787])).
% 9.54/2.00 thf(f3465,plain,(
% 9.54/2.00 ($false = sF81) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f3462])).
% 9.54/2.00 thf(f3466,plain,(
% 9.54/2.00 ($false = sF81)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3465])).
% 9.54/2.00 thf(f3472,plain,(
% 9.54/2.00 ($false = ((binintersectSubset2 => sF80)))),
% 9.54/2.00 inference(backward_demodulation,[],[f941,f3466])).
% 9.54/2.00 thf(f3477,plain,(
% 9.54/2.00 (((binintersectSubset2 => $true)) = $false) | ($false = sF80)),
% 9.54/2.00 inference(superposition,[],[f3472,f787])).
% 9.54/2.00 thf(f3482,plain,(
% 9.54/2.00 ($false = sF80) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f3477])).
% 9.54/2.00 thf(f3483,plain,(
% 9.54/2.00 ($false = sF80)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3482])).
% 9.54/2.00 thf(f3489,plain,(
% 9.54/2.00 ($false = ((binintersectSubset3 => sF79)))),
% 9.54/2.00 inference(backward_demodulation,[],[f940,f3483])).
% 9.54/2.00 thf(f3490,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((binintersect @ Y1 @ Y0) = Y0) => (subset @ Y0 @ Y1)))))) => sF79)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f3489,f670])).
% 9.54/2.00 thf(f3504,plain,(
% 9.54/2.00 (sF79 = $false) | ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((binintersect @ Y1 @ Y0) = Y0) => (subset @ Y0 @ Y1)))))) => $true)))),
% 9.54/2.00 inference(superposition,[],[f3490,f787])).
% 9.54/2.00 thf(f3507,plain,(
% 9.54/2.00 ($true = $false) | (sF79 = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f3504])).
% 9.54/2.00 thf(f3508,plain,(
% 9.54/2.00 (sF79 = $false)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3507])).
% 9.54/2.00 thf(f3512,plain,(
% 9.54/2.00 ($false = ((binintersectER => sF78)))),
% 9.54/2.00 inference(backward_demodulation,[],[f939,f3508])).
% 9.54/2.00 thf(f3519,plain,(
% 9.54/2.00 (sF78 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3512])).
% 9.54/2.00 thf(f3529,plain,(
% 9.54/2.00 ($false = ((disjointsetsI1 => sF77)))),
% 9.54/2.00 inference(backward_demodulation,[],[f938,f3519])).
% 9.54/2.00 thf(f3538,plain,(
% 9.54/2.00 ($false = sF77)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3529])).
% 9.54/2.00 thf(f3548,plain,(
% 9.54/2.00 ($false = ((binintersectRsub => sF76)))),
% 9.54/2.00 inference(backward_demodulation,[],[f937,f3538])).
% 9.54/2.00 thf(f3553,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ (binintersect @ Y1 @ Y0) @ Y0))))) => sF76)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3548,f679])).
% 9.54/2.00 thf(f3558,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ (binintersect @ Y1 @ Y0) @ Y0))))) => $true))) | (sF76 = $false)),
% 9.54/2.00 inference(superposition,[],[f3553,f787])).
% 9.54/2.00 thf(f3561,plain,(
% 9.54/2.00 (sF76 = $false) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f3558])).
% 9.54/2.00 thf(f3562,plain,(
% 9.54/2.00 (sF76 = $false)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3561])).
% 9.54/2.00 thf(f3566,plain,(
% 9.54/2.00 (((binintersectSubset4 => sF75)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f936,f3562])).
% 9.54/2.00 thf(f3571,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((subset @ Y1 @ Y0) => ((binintersect @ Y0 @ Y1) = Y1)))))) => sF75)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f3566,f712])).
% 9.54/2.00 thf(f3616,plain,(
% 9.54/2.00 (sF75 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3571])).
% 9.54/2.00 thf(f3630,plain,(
% 9.54/2.00 (((binintersectSubset1 => sF74)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f934,f3616])).
% 9.54/2.00 thf(f3631,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((binintersect @ Y1 @ Y0) = Y1) => (subset @ Y1 @ Y0)))))) => sF74)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3630,f740])).
% 9.54/2.00 thf(f3634,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((binintersect @ Y1 @ Y0) = Y1) => (subset @ Y1 @ Y0)))))) => $true))) | ($false = sF74)),
% 9.54/2.00 inference(superposition,[],[f3631,f787])).
% 9.54/2.00 thf(f3638,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF74)),
% 9.54/2.00 inference(boolean_simplification,[],[f3634])).
% 9.54/2.00 thf(f3639,plain,(
% 9.54/2.00 ($false = sF74)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3638])).
% 9.54/2.00 thf(f3646,plain,(
% 9.54/2.00 ($false = ((bs114d => sF73)))),
% 9.54/2.00 inference(backward_demodulation,[],[f932,f3639])).
% 9.54/2.00 thf(f3647,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((binintersect @ Y1 @ (binunion @ Y2 @ Y0)) = (binunion @ (binintersect @ Y1 @ Y2) @ (binintersect @ Y1 @ Y0))))))))) => sF73)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3646,f643])).
% 9.54/2.00 thf(f3680,plain,(
% 9.54/2.00 ($false = sF73) | ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((binintersect @ Y1 @ (binunion @ Y2 @ Y0)) = (binunion @ (binintersect @ Y1 @ Y2) @ (binintersect @ Y1 @ Y0))))))))) => $true)) = $false)),
% 9.54/2.00 inference(superposition,[],[f3647,f787])).
% 9.54/2.00 thf(f3684,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF73)),
% 9.54/2.00 inference(boolean_simplification,[],[f3680])).
% 9.54/2.00 thf(f3685,plain,(
% 9.54/2.00 ($false = sF73)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3684])).
% 9.54/2.00 thf(f3688,plain,(
% 9.54/2.00 ($false = ((setminusI => sF72)))),
% 9.54/2.00 inference(backward_demodulation,[],[f930,f3685])).
% 9.54/2.00 thf(f3695,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => ((~ (in @ Y2 @ Y0)) => (in @ Y2 @ (setminus @ Y1 @ Y0)))))))))) => sF72)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3688,f758])).
% 9.54/2.00 thf(f3698,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => ((~ (in @ Y2 @ Y0)) => (in @ Y2 @ (setminus @ Y1 @ Y0)))))))))) => (setminusEL => sF71))) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f3695,f928])).
% 9.54/2.00 thf(f3701,plain,(
% 9.54/2.00 ($false = sF71) | ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => ((~ (in @ Y2 @ Y0)) => (in @ Y2 @ (setminus @ Y1 @ Y0)))))))))) => (setminusEL => $true))) = $false)),
% 9.54/2.00 inference(superposition,[],[f3698,f787])).
% 9.54/2.00 thf(f3707,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => ((~ (in @ Y2 @ Y0)) => (in @ Y2 @ (setminus @ Y1 @ Y0)))))))))) => $true))) | ($false = sF71)),
% 9.54/2.00 inference(boolean_simplification,[],[f3701])).
% 9.54/2.00 thf(f3708,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF71)),
% 9.54/2.00 inference(boolean_simplification,[],[f3707])).
% 9.54/2.00 thf(f3709,plain,(
% 9.54/2.00 ($false = sF71)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3708])).
% 9.54/2.00 thf(f3719,plain,(
% 9.54/2.00 ($false = ((setminusER => sF70)))),
% 9.54/2.00 inference(backward_demodulation,[],[f926,f3709])).
% 9.54/2.00 thf(f3734,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (setminus @ Y1 @ Y2)) => (~ (in @ Y0 @ Y2))))))))) => sF70)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f3719,f612])).
% 9.54/2.00 thf(f3738,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (setminus @ Y1 @ Y2)) => (~ (in @ Y0 @ Y2))))))))) => (setminusSubset2 => sF69))) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f3734,f924])).
% 9.54/2.00 thf(f3743,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (setminus @ Y1 @ Y2)) => (~ (in @ Y0 @ Y2))))))))) => (setminusSubset2 => $true)))) | (sF69 = $false)),
% 9.54/2.00 inference(superposition,[],[f3738,f787])).
% 9.54/2.00 thf(f3753,plain,(
% 9.54/2.00 (sF69 = $false) | ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (setminus @ Y1 @ Y2)) => (~ (in @ Y0 @ Y2))))))))) => $true)))),
% 9.54/2.00 inference(boolean_simplification,[],[f3743])).
% 9.54/2.00 thf(f3754,plain,(
% 9.54/2.00 ($true = $false) | (sF69 = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f3753])).
% 9.54/2.00 thf(f3755,plain,(
% 9.54/2.00 (sF69 = $false)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3754])).
% 9.54/2.00 thf(f3765,plain,(
% 9.54/2.00 ($false = ((setminusERneg => sF68)))),
% 9.54/2.00 inference(backward_demodulation,[],[f922,f3755])).
% 9.54/2.00 thf(f3771,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (in @ Y0 @ (setminus @ Y2 @ Y1))) => ((in @ Y0 @ Y2) => (in @ Y0 @ Y1))))))))) => sF68)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f3765,f685])).
% 9.54/2.00 thf(f3774,plain,(
% 9.54/2.00 ($false = sF68)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3771])).
% 9.54/2.00 thf(f3784,plain,(
% 9.54/2.00 ($false = ((setminusELneg => sF67)))),
% 9.54/2.00 inference(backward_demodulation,[],[f921,f3774])).
% 9.54/2.00 thf(f3793,plain,(
% 9.54/2.00 ($false = sF67) | ($false = ((setminusELneg => $true)))),
% 9.54/2.00 inference(superposition,[],[f3784,f787])).
% 9.54/2.00 thf(f3797,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF67)),
% 9.54/2.00 inference(boolean_simplification,[],[f3793])).
% 9.54/2.00 thf(f3798,plain,(
% 9.54/2.00 ($false = sF67)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3797])).
% 9.54/2.00 thf(f3801,plain,(
% 9.54/2.00 (((setminusILneg => sF66)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f919,f3798])).
% 9.54/2.00 thf(f3808,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (in @ Y1 @ Y0)) => (~ (in @ Y1 @ (setminus @ Y0 @ Y2)))))))))) => sF66)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3801,f623])).
% 9.54/2.00 thf(f3809,plain,(
% 9.54/2.00 ($false = sF66)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3808])).
% 9.54/2.00 thf(f3819,plain,(
% 9.54/2.00 ($false = ((setminusIRneg => sF65)))),
% 9.54/2.00 inference(backward_demodulation,[],[f917,f3809])).
% 9.54/2.00 thf(f3828,plain,(
% 9.54/2.00 ($false = sF65) | (((setminusIRneg => $true)) = $false)),
% 9.54/2.00 inference(superposition,[],[f3819,f787])).
% 9.54/2.00 thf(f3832,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF65)),
% 9.54/2.00 inference(boolean_simplification,[],[f3828])).
% 9.54/2.00 thf(f3833,plain,(
% 9.54/2.00 ($false = sF65)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3832])).
% 9.54/2.00 thf(f3840,plain,(
% 9.54/2.00 ($false = ((setminusLsub => sF64)))),
% 9.54/2.00 inference(backward_demodulation,[],[f915,f3833])).
% 9.54/2.00 thf(f3841,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ (setminus @ Y1 @ Y0) @ Y1))))) => sF64)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3840,f590])).
% 9.54/2.00 thf(f3844,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (subset @ (setminus @ Y1 @ Y0) @ Y1))))) => $true))) | ($false = sF64)),
% 9.54/2.00 inference(superposition,[],[f3841,f787])).
% 9.54/2.00 thf(f3849,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF64)),
% 9.54/2.00 inference(boolean_simplification,[],[f3844])).
% 9.54/2.00 thf(f3850,plain,(
% 9.54/2.00 ($false = sF64)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3849])).
% 9.54/2.00 thf(f3858,plain,(
% 9.54/2.00 ($false = ((setminusSubset1 => sF63)))),
% 9.54/2.00 inference(backward_demodulation,[],[f914,f3850])).
% 9.54/2.00 thf(f3859,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((emptyset = (setminus @ Y1 @ Y0)) => (subset @ Y1 @ Y0)))))) => sF63)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f3858,f773])).
% 9.54/2.00 thf(f3862,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((emptyset = (setminus @ Y1 @ Y0)) => (subset @ Y1 @ Y0)))))) => $true)) = $false) | ($false = sF63)),
% 9.54/2.00 inference(superposition,[],[f3859,f787])).
% 9.54/2.00 thf(f3865,plain,(
% 9.54/2.00 ($false = sF63) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f3862])).
% 9.54/2.00 thf(f3866,plain,(
% 9.54/2.00 ($false = sF63)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3865])).
% 9.54/2.00 thf(f3870,plain,(
% 9.54/2.00 ($false = ((symdiffE => sF62)))),
% 9.54/2.00 inference(backward_demodulation,[],[f912,f3866])).
% 9.54/2.00 thf(f3879,plain,(
% 9.54/2.00 (((symdiffE => $true)) = $false) | ($false = sF62)),
% 9.54/2.00 inference(superposition,[],[f3870,f787])).
% 9.54/2.00 thf(f3882,plain,(
% 9.54/2.00 ($false = sF62) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f3879])).
% 9.54/2.00 thf(f3883,plain,(
% 9.54/2.00 ($false = sF62)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3882])).
% 9.54/2.00 thf(f3887,plain,(
% 9.54/2.00 ($false = ((symdiffI1 => sF61)))),
% 9.54/2.00 inference(backward_demodulation,[],[f911,f3883])).
% 9.54/2.00 thf(f3898,plain,(
% 9.54/2.00 ($false = ((symdiffI1 => $true))) | ($false = sF61)),
% 9.54/2.00 inference(superposition,[],[f3887,f787])).
% 9.54/2.00 thf(f3901,plain,(
% 9.54/2.00 ($false = sF61) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f3898])).
% 9.54/2.00 thf(f3902,plain,(
% 9.54/2.00 ($false = sF61)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3901])).
% 9.54/2.00 thf(f3906,plain,(
% 9.54/2.00 ($false = ((symdiffI2 => sF60)))),
% 9.54/2.00 inference(backward_demodulation,[],[f909,f3902])).
% 9.54/2.00 thf(f3915,plain,(
% 9.54/2.00 ($false = sF60) | (((symdiffI2 => $true)) = $false)),
% 9.54/2.00 inference(superposition,[],[f3906,f787])).
% 9.54/2.00 thf(f3918,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF60)),
% 9.54/2.00 inference(boolean_simplification,[],[f3915])).
% 9.54/2.00 thf(f3919,plain,(
% 9.54/2.00 ($false = sF60)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f3918])).
% 9.54/2.00 thf(f3923,plain,(
% 9.54/2.00 (((symdiffIneg1 => sF59)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f907,f3919])).
% 9.54/2.00 thf(f3930,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => ((in @ Y2 @ Y0) => (~ (in @ Y2 @ (symdiff @ Y1 @ Y0))))))))))) => sF59)))),
% 9.54/2.00 inference(forward_demodulation,[],[f3923,f592])).
% 9.54/2.00 thf(f4081,plain,(
% 9.54/2.00 ($false = sF59)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f3930])).
% 9.54/2.00 thf(f4091,plain,(
% 9.54/2.00 ($false = ((symdiffIneg2 => sF58)))),
% 9.54/2.00 inference(backward_demodulation,[],[f905,f4081])).
% 9.54/2.00 thf(f4100,plain,(
% 9.54/2.00 ($false = sF58) | (((symdiffIneg2 => $true)) = $false)),
% 9.54/2.00 inference(superposition,[],[f4091,f787])).
% 9.54/2.00 thf(f4104,plain,(
% 9.54/2.00 ($false = sF58) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f4100])).
% 9.54/2.00 thf(f4105,plain,(
% 9.54/2.00 ($false = sF58)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f4104])).
% 9.54/2.00 thf(f4113,plain,(
% 9.54/2.00 ($false = sF56) | ($true = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f3321,f4105])).
% 9.54/2.00 thf(f4116,plain,(
% 9.54/2.00 ($false = sF56)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f4113])).
% 9.54/2.00 thf(f4117,plain,(
% 9.54/2.00 ($false = ((setukpairIR => sF55)))),
% 9.54/2.00 inference(backward_demodulation,[],[f900,f4116])).
% 9.54/2.00 thf(f4120,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y0 @ (setunion @ (setadjoin @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset)) @ emptyset)))))))) => sF55)))),
% 9.54/2.00 inference(forward_demodulation,[],[f4117,f736])).
% 9.54/2.00 thf(f4186,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y0 @ (setunion @ (setadjoin @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset)) @ emptyset)))))))) => $true))) | ($false = sF55)),
% 9.54/2.00 inference(superposition,[],[f4120,f787])).
% 9.54/2.00 thf(f4189,plain,(
% 9.54/2.00 ($false = sF55) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f4186])).
% 9.54/2.00 thf(f4190,plain,(
% 9.54/2.00 ($false = sF55)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f4189])).
% 9.54/2.00 thf(f4194,plain,(
% 9.54/2.00 ($false = ((kpairiskpair => sF54)))),
% 9.54/2.00 inference(backward_demodulation,[],[f899,f4190])).
% 9.54/2.00 thf(f4201,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (iskpair @ (setadjoin @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset)) @ emptyset))))))) => sF54)))),
% 9.54/2.00 inference(forward_demodulation,[],[f4194,f605])).
% 9.54/2.00 thf(f4204,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (iskpair @ (setadjoin @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset)) @ emptyset))))))) => $true)) = $false) | ($false = sF54)),
% 9.54/2.00 inference(superposition,[],[f4201,f787])).
% 9.54/2.00 thf(f4207,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF54)),
% 9.54/2.00 inference(boolean_simplification,[],[f4204])).
% 9.54/2.00 thf(f4208,plain,(
% 9.54/2.00 ($false = sF54)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f4207])).
% 9.54/2.00 thf(f4212,plain,(
% 9.54/2.00 ($false = ((kpairp => sF53)))),
% 9.54/2.00 inference(backward_demodulation,[],[f898,f4208])).
% 9.54/2.00 thf(f4219,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (iskpair @ (kpair @ Y1 @ Y0)))))) => sF53)))),
% 9.54/2.00 inference(forward_demodulation,[],[f4212,f598])).
% 9.54/2.00 thf(f4222,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (iskpair @ (kpair @ Y1 @ Y0)))))) => (singletonsubset => sF52))))),
% 9.54/2.00 inference(forward_demodulation,[],[f4219,f897])).
% 9.54/2.00 thf(f4225,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (iskpair @ (kpair @ Y1 @ Y0)))))) => (singletonsubset => $true)))) | ($false = sF52)),
% 9.54/2.00 inference(superposition,[],[f4222,f787])).
% 9.54/2.00 thf(f4232,plain,(
% 9.54/2.00 ($false = sF52) | ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (iskpair @ (kpair @ Y1 @ Y0)))))) => $true)))),
% 9.54/2.00 inference(boolean_simplification,[],[f4225])).
% 9.54/2.00 thf(f4233,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF52)),
% 9.54/2.00 inference(boolean_simplification,[],[f4232])).
% 9.54/2.00 thf(f4234,plain,(
% 9.54/2.00 ($false = sF52)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f4233])).
% 9.54/2.00 thf(f4245,plain,(
% 9.54/2.00 ($false = ((singletoninpowerset => sF51)))),
% 9.54/2.00 inference(backward_demodulation,[],[f895,f4234])).
% 9.54/2.00 thf(f4253,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ Y1) => (in @ (setadjoin @ Y0 @ emptyset) @ (powerset @ Y1))))))) => sF51)))),
% 9.54/2.00 inference(forward_demodulation,[],[f4245,f782])).
% 9.54/2.00 thf(f4258,plain,(
% 9.54/2.00 (sF51 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f4253])).
% 9.54/2.00 thf(f4268,plain,(
% 9.54/2.00 ($false = ((singletoninpowunion => sF50)))),
% 9.54/2.00 inference(backward_demodulation,[],[f894,f4258])).
% 9.54/2.00 thf(f4273,plain,(
% 9.54/2.00 (sF50 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f4268])).
% 9.54/2.00 thf(f4287,plain,(
% 9.54/2.00 ($false = ((upairset2E => sF49)))),
% 9.54/2.00 inference(backward_demodulation,[],[f893,f4273])).
% 9.54/2.00 thf(f4288,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (setadjoin @ Y2 @ (setadjoin @ Y1 @ emptyset))) => ((Y2 = Y0) | (Y1 = Y0))))))))) => sF49)))),
% 9.54/2.00 inference(forward_demodulation,[],[f4287,f774])).
% 9.54/2.00 thf(f4364,plain,(
% 9.54/2.00 ($false = sF49)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f4288])).
% 9.54/2.00 thf(f4380,plain,(
% 9.54/2.00 ($false = ((upairsubunion => sF48)))),
% 9.54/2.00 inference(backward_demodulation,[],[f892,f4364])).
% 9.54/2.00 thf(f4381,plain,(
% 9.54/2.00 ($false = sF48)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f4380])).
% 9.54/2.00 thf(f4393,plain,(
% 9.54/2.00 (((upairinpowunion => sF47)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f890,f4381])).
% 9.54/2.00 thf(f4398,plain,(
% 9.54/2.00 (((upairinpowunion => $true)) = $false) | ($false = sF47)),
% 9.54/2.00 inference(superposition,[],[f4393,f787])).
% 9.54/2.00 thf(f4403,plain,(
% 9.54/2.00 ($false = sF47) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f4398])).
% 9.54/2.00 thf(f4404,plain,(
% 9.54/2.00 ($false = sF47)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f4403])).
% 9.54/2.00 thf(f4406,plain,(
% 9.54/2.00 (((ubforcartprodlem1 => sF46)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f888,f4404])).
% 9.54/2.00 thf(f4409,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => (subset @ (setadjoin @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y1 @ (setadjoin @ Y3 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ Y2 @ Y0))))))))))))) => sF46)))),
% 9.54/2.00 inference(forward_demodulation,[],[f4406,f769])).
% 9.54/2.00 thf(f4594,plain,(
% 9.54/2.00 (sF46 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f4409])).
% 9.54/2.00 thf(f4604,plain,(
% 9.54/2.00 ($false = ((ubforcartprodlem2 => sF45)))),
% 9.54/2.00 inference(backward_demodulation,[],[f886,f4594])).
% 9.54/2.00 thf(f4613,plain,(
% 9.54/2.00 (((ubforcartprodlem2 => $true)) = $false) | ($false = sF45)),
% 9.54/2.00 inference(superposition,[],[f4604,f787])).
% 9.54/2.00 thf(f4616,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF45)),
% 9.54/2.00 inference(boolean_simplification,[],[f4613])).
% 9.54/2.00 thf(f4617,plain,(
% 9.54/2.00 ($false = sF45)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f4616])).
% 9.54/2.00 thf(f4621,plain,(
% 9.54/2.00 ($false = ((ubforcartprodlem3 => sF44)))),
% 9.54/2.00 inference(backward_demodulation,[],[f885,f4617])).
% 9.54/2.00 thf(f4626,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => (in @ (kpair @ Y2 @ Y3) @ (powerset @ (powerset @ (binunion @ Y1 @ Y0)))))))))))))) => sF44)))),
% 9.54/2.00 inference(forward_demodulation,[],[f4621,f676])).
% 9.54/2.00 thf(f4631,plain,(
% 9.54/2.00 (sF44 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f4626])).
% 9.54/2.00 thf(f4641,plain,(
% 9.54/2.00 ($false = ((cartprodpairin => sF43)))),
% 9.54/2.00 inference(backward_demodulation,[],[f883,f4631])).
% 9.54/2.00 thf(f4652,plain,(
% 9.54/2.00 ($false = ((cartprodpairin => $true))) | ($false = sF43)),
% 9.54/2.00 inference(superposition,[],[f4641,f787])).
% 9.54/2.00 thf(f4656,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF43)),
% 9.54/2.00 inference(boolean_simplification,[],[f4652])).
% 9.54/2.00 thf(f4657,plain,(
% 9.54/2.00 ($false = sF43)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f4656])).
% 9.54/2.00 thf(f4664,plain,(
% 9.54/2.00 ($false = ((cartprodmempair1 => sF42)))),
% 9.54/2.00 inference(backward_demodulation,[],[f882,f4657])).
% 9.54/2.00 thf(f4665,plain,(
% 9.54/2.00 (sF42 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f4664])).
% 9.54/2.00 thf(f4677,plain,(
% 9.54/2.00 ($false = ((cartprodmempair => sF41)))),
% 9.54/2.00 inference(backward_demodulation,[],[f881,f4665])).
% 9.54/2.00 thf(f4678,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (cartprod @ Y1 @ Y0)) => (iskpair @ Y2)))))))) => sF41)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f4677,f732])).
% 9.54/2.00 thf(f4681,plain,(
% 9.54/2.00 (sF41 = $false) | ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (cartprod @ Y1 @ Y0)) => (iskpair @ Y2)))))))) => $true)))),
% 9.54/2.00 inference(superposition,[],[f4678,f787])).
% 9.54/2.00 thf(f4686,plain,(
% 9.54/2.00 (sF41 = $false) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f4681])).
% 9.54/2.00 thf(f4687,plain,(
% 9.54/2.00 (sF41 = $false)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f4686])).
% 9.54/2.00 thf(f4695,plain,(
% 9.54/2.00 (((setunionE2 => sF40)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f880,f4687])).
% 9.54/2.00 thf(f4696,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setunion @ Y0)) => (?? @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) & (in @ Y2 @ Y0))))))))) => sF40)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f4695,f751])).
% 9.54/2.00 thf(f4697,plain,(
% 9.54/2.00 (sF40 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f4696])).
% 9.54/2.00 thf(f4707,plain,(
% 9.54/2.00 ($false = ((setunionsingleton1 => sF39)))),
% 9.54/2.00 inference(backward_demodulation,[],[f879,f4697])).
% 9.54/2.00 thf(f4712,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (subset @ (setunion @ (setadjoin @ Y0 @ emptyset)) @ Y0))) => sF39)))),
% 9.54/2.00 inference(forward_demodulation,[],[f4707,f708])).
% 9.54/2.00 thf(f4717,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (subset @ (setunion @ (setadjoin @ Y0 @ emptyset)) @ Y0))) => (setunionsingleton2 => sF38))))),
% 9.54/2.00 inference(forward_demodulation,[],[f4712,f878])).
% 9.54/2.00 thf(f4720,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (subset @ (setunion @ (setadjoin @ Y0 @ emptyset)) @ Y0))) => (setunionsingleton2 => $true)))) | ($false = sF38)),
% 9.54/2.00 inference(superposition,[],[f4717,f787])).
% 9.54/2.00 thf(f4725,plain,(
% 9.54/2.00 ($false = sF38) | ((((!! @ $i @ (^[Y0 : $i]: (subset @ (setunion @ (setadjoin @ Y0 @ emptyset)) @ Y0))) => $true)) = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f4720])).
% 9.54/2.00 thf(f4726,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF38)),
% 9.54/2.00 inference(boolean_simplification,[],[f4725])).
% 9.54/2.00 thf(f4727,plain,(
% 9.54/2.00 ($false = sF38)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f4726])).
% 9.54/2.00 thf(f4734,plain,(
% 9.54/2.00 ($false = ((setunionsingleton => sF37)))),
% 9.54/2.00 inference(backward_demodulation,[],[f876,f4727])).
% 9.54/2.00 thf(f4749,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: ((setunion @ (setadjoin @ Y0 @ emptyset)) = Y0))) => sF37)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f4734,f711])).
% 9.54/2.00 thf(f4761,plain,(
% 9.54/2.00 (sF37 = $false) | ($false = (((!! @ $i @ (^[Y0 : $i]: ((setunion @ (setadjoin @ Y0 @ emptyset)) = Y0))) => $true)))),
% 9.54/2.00 inference(superposition,[],[f4749,f787])).
% 9.54/2.00 thf(f4766,plain,(
% 9.54/2.00 ($true = $false) | (sF37 = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f4761])).
% 9.54/2.00 thf(f4767,plain,(
% 9.54/2.00 (sF37 = $false)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f4766])).
% 9.54/2.00 thf(f4775,plain,(
% 9.54/2.00 ($false = ((singletonprop => sF36)))),
% 9.54/2.00 inference(backward_demodulation,[],[f874,f4767])).
% 9.54/2.00 thf(f4776,plain,(
% 9.54/2.00 ($false = sF36)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f4775])).
% 9.54/2.00 thf(f4786,plain,(
% 9.54/2.00 ($false = ((ex1E1 => sF35)))),
% 9.54/2.00 inference(backward_demodulation,[],[f873,f4776])).
% 9.54/2.00 thf(f4791,plain,(
% 9.54/2.00 ($false = (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (dsetconstr @ Y1 @ Y0)) & ((setadjoin @ Y2 @ emptyset) = (dsetconstr @ Y1 @ Y0))))) => (?? @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) & (in @ Y2 @ Y1))))))))) => sF35)))),
% 9.54/2.00 inference(forward_demodulation,[],[f4786,f1141])).
% 9.54/2.00 thf(f4863,plain,(
% 9.54/2.00 ((((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (dsetconstr @ Y1 @ Y0)) & ((setadjoin @ Y2 @ emptyset) = (dsetconstr @ Y1 @ Y0))))) => (?? @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) & (in @ Y2 @ Y1))))))))) => $true)) = $false) | ($false = sF35)),
% 9.54/2.00 inference(superposition,[],[f4791,f787])).
% 9.54/2.00 thf(f4867,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF35)),
% 9.54/2.00 inference(boolean_simplification,[],[f4863])).
% 9.54/2.00 thf(f4868,plain,(
% 9.54/2.00 ($false = sF35)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f4867])).
% 9.54/2.00 thf(f4873,plain,(
% 9.54/2.00 ($false = ((ex1I => sF34)))),
% 9.54/2.00 inference(backward_demodulation,[],[f871,f4868])).
% 9.54/2.00 thf(f4874,plain,(
% 9.54/2.00 (sF34 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f4873])).
% 9.54/2.00 thf(f4884,plain,(
% 9.54/2.00 (((ex1I2 => sF33)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f870,f4874])).
% 9.54/2.00 thf(f4893,plain,(
% 9.54/2.00 ($false = sF33) | ($false = ((ex1I2 => $true)))),
% 9.54/2.00 inference(superposition,[],[f4884,f787])).
% 9.54/2.00 thf(f4897,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF33)),
% 9.54/2.00 inference(boolean_simplification,[],[f4893])).
% 9.54/2.00 thf(f4898,plain,(
% 9.54/2.00 ($false = sF33)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f4897])).
% 9.54/2.00 thf(f4901,plain,(
% 9.54/2.00 (((singletonsuniq => sF32)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f868,f4898])).
% 9.54/2.00 thf(f4904,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((setadjoin @ Y0 @ emptyset) = (setadjoin @ Y1 @ emptyset)) => (Y1 = Y0)))))) => sF32)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f4901,f783])).
% 9.54/2.00 thf(f4911,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((setadjoin @ Y0 @ emptyset) = (setadjoin @ Y1 @ emptyset)) => (Y1 = Y0)))))) => $true))) | ($false = sF32)),
% 9.54/2.00 inference(superposition,[],[f4904,f787])).
% 9.54/2.00 thf(f4914,plain,(
% 9.54/2.00 ($false = sF32) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f4911])).
% 9.54/2.00 thf(f4915,plain,(
% 9.54/2.00 ($false = sF32)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f4914])).
% 9.54/2.00 thf(f4919,plain,(
% 9.54/2.00 ($false = ((setukpairinjL1 => sF31)))),
% 9.54/2.00 inference(backward_demodulation,[],[f866,f4915])).
% 9.54/2.00 thf(f4926,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y2 @ emptyset) @ (setadjoin @ (setadjoin @ Y2 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))) => (Y2 = Y0)))))))) => sF31)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f4919,f725])).
% 9.54/2.00 thf(f4929,plain,(
% 9.54/2.00 ($false = sF31)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f4926])).
% 9.54/2.00 thf(f4939,plain,(
% 9.54/2.00 ($false = ((kfstsingleton => sF30)))),
% 9.54/2.00 inference(backward_demodulation,[],[f865,f4929])).
% 9.54/2.00 thf(f4946,plain,(
% 9.54/2.00 (((kfstsingleton => $true)) = $false) | ($false = sF30)),
% 9.54/2.00 inference(superposition,[],[f4939,f787])).
% 9.54/2.00 thf(f4949,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF30)),
% 9.54/2.00 inference(boolean_simplification,[],[f4946])).
% 9.54/2.00 thf(f4950,plain,(
% 9.54/2.00 ($false = sF30)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f4949])).
% 9.54/2.00 thf(f4954,plain,(
% 9.54/2.00 ($false = ((theprop => sF29)))),
% 9.54/2.00 inference(backward_demodulation,[],[f863,f4950])).
% 9.54/2.00 thf(f4961,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0)))) => (in @ (setunion @ Y0) @ Y0)))) => sF29)))),
% 9.54/2.00 inference(forward_demodulation,[],[f4954,f1129])).
% 9.54/2.00 thf(f4964,plain,(
% 9.54/2.00 (sF29 = $false) | ($false = (((!! @ $i @ (^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0)))) => (in @ (setunion @ Y0) @ Y0)))) => $true)))),
% 9.54/2.00 inference(superposition,[],[f4961,f787])).
% 9.54/2.00 thf(f4968,plain,(
% 9.54/2.00 ($true = $false) | (sF29 = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f4964])).
% 9.54/2.00 thf(f4969,plain,(
% 9.54/2.00 (sF29 = $false)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f4968])).
% 9.54/2.00 thf(f4972,plain,(
% 9.54/2.00 (((kfstpairEq => sF28)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f862,f4969])).
% 9.54/2.00 thf(f4979,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((kfst @ (kpair @ Y1 @ Y0)) = Y1))))) => sF28)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f4972,f693])).
% 9.54/2.00 thf(f4984,plain,(
% 9.54/2.00 ($false = sF28) | ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((kfst @ (kpair @ Y1 @ Y0)) = Y1))))) => $true)))),
% 9.54/2.00 inference(superposition,[],[f4979,f787])).
% 9.54/2.00 thf(f4989,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF28)),
% 9.54/2.00 inference(boolean_simplification,[],[f4984])).
% 9.54/2.00 thf(f4990,plain,(
% 9.54/2.00 ($false = sF28)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f4989])).
% 9.54/2.00 thf(f4992,plain,(
% 9.54/2.00 ($false = ((cartprodfstin => sF27)))),
% 9.54/2.00 inference(backward_demodulation,[],[f861,f4990])).
% 9.54/2.00 thf(f4997,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (cartprod @ Y0 @ Y2)) => (in @ (kfst @ Y1) @ Y0)))))))) => sF27)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f4992,f691])).
% 9.54/2.00 thf(f4998,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (cartprod @ Y0 @ Y2)) => (in @ (kfst @ Y1) @ Y0)))))))) => (setukpairinjL2 => sF26))))),
% 9.54/2.00 inference(forward_demodulation,[],[f4997,f860])).
% 9.54/2.00 thf(f5001,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (cartprod @ Y0 @ Y2)) => (in @ (kfst @ Y1) @ Y0)))))))) => (setukpairinjL2 => $true)))) | ($false = sF26)),
% 9.54/2.00 inference(superposition,[],[f4998,f787])).
% 9.54/2.00 thf(f5010,plain,(
% 9.54/2.00 ($false = sF26) | ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (cartprod @ Y0 @ Y2)) => (in @ (kfst @ Y1) @ Y0)))))))) => $true)))),
% 9.54/2.00 inference(boolean_simplification,[],[f5001])).
% 9.54/2.00 thf(f5011,plain,(
% 9.54/2.00 ($false = sF26) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f5010])).
% 9.54/2.00 thf(f5012,plain,(
% 9.54/2.00 ($false = sF26)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f5011])).
% 9.54/2.00 thf(f5023,plain,(
% 9.54/2.00 ($false = ((setukpairinjL => sF25)))),
% 9.54/2.00 inference(backward_demodulation,[],[f858,f5012])).
% 9.54/2.00 thf(f5035,plain,(
% 9.54/2.00 ($false = sF25) | (((setukpairinjL => $true)) = $false)),
% 9.54/2.00 inference(superposition,[],[f5023,f787])).
% 9.54/2.00 thf(f5039,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF25)),
% 9.54/2.00 inference(boolean_simplification,[],[f5035])).
% 9.54/2.00 thf(f5040,plain,(
% 9.54/2.00 ($false = sF25)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f5039])).
% 9.54/2.00 thf(f5043,plain,(
% 9.54/2.00 (((setukpairinjR11 => sF24)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f856,f5040])).
% 9.54/2.00 thf(f5046,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => ((setadjoin @ Y1 @ emptyset) = (setadjoin @ Y1 @ (setadjoin @ Y0 @ emptyset)))))))) => sF24)))),
% 9.54/2.00 inference(forward_demodulation,[],[f5043,f672])).
% 9.54/2.00 thf(f5049,plain,(
% 9.54/2.00 (sF24 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f5046])).
% 9.54/2.00 thf(f5059,plain,(
% 9.54/2.00 ($false = ((setukpairinjR12 => sF23)))),
% 9.54/2.00 inference(backward_demodulation,[],[f854,f5049])).
% 9.54/2.00 thf(f5068,plain,(
% 9.54/2.00 (sF23 = $false) | (((setukpairinjR12 => $true)) = $false)),
% 9.54/2.00 inference(superposition,[],[f5059,f787])).
% 9.54/2.00 thf(f5073,plain,(
% 9.54/2.00 ($true = $false) | (sF23 = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f5068])).
% 9.54/2.00 thf(f5074,plain,(
% 9.54/2.00 (sF23 = $false)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f5073])).
% 9.54/2.00 thf(f5076,plain,(
% 9.54/2.00 ($false = ((setukpairinjR1 => sF22)))),
% 9.54/2.00 inference(backward_demodulation,[],[f853,f5074])).
% 9.54/2.00 thf(f5081,plain,(
% 9.54/2.00 ($false = sF22)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f5076])).
% 9.54/2.00 thf(f5091,plain,(
% 9.54/2.00 ($false = ((upairequniteq => sF21)))),
% 9.54/2.00 inference(backward_demodulation,[],[f852,f5081])).
% 9.54/2.00 thf(f5096,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((setadjoin @ Y1 @ emptyset) = (setadjoin @ Y0 @ (setadjoin @ Y2 @ emptyset))) => (Y2 = Y0)))))))) => sF21)))),
% 9.54/2.00 inference(forward_demodulation,[],[f5091,f753])).
% 9.54/2.00 thf(f5099,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((setadjoin @ Y1 @ emptyset) = (setadjoin @ Y0 @ (setadjoin @ Y2 @ emptyset))) => (Y2 = Y0)))))))) => (setukpairinjR2 => sF20))))),
% 9.54/2.00 inference(forward_demodulation,[],[f5096,f851])).
% 9.54/2.00 thf(f5117,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((setadjoin @ Y1 @ emptyset) = (setadjoin @ Y0 @ (setadjoin @ Y2 @ emptyset))) => (Y2 = Y0)))))))) => (setukpairinjR2 => $true)))) | ($false = sF20)),
% 9.54/2.00 inference(superposition,[],[f5099,f787])).
% 9.54/2.00 thf(f5125,plain,(
% 9.54/2.00 ($false = sF20) | ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((setadjoin @ Y1 @ emptyset) = (setadjoin @ Y0 @ (setadjoin @ Y2 @ emptyset))) => (Y2 = Y0)))))))) => $true)))),
% 9.54/2.00 inference(boolean_simplification,[],[f5117])).
% 9.54/2.00 thf(f5126,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF20)),
% 9.54/2.00 inference(boolean_simplification,[],[f5125])).
% 9.54/2.00 thf(f5127,plain,(
% 9.54/2.00 ($false = sF20)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f5126])).
% 9.54/2.00 thf(f5135,plain,(
% 9.54/2.00 (((setukpairinjR => sF19)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f850,f5127])).
% 9.54/2.00 thf(f5151,plain,(
% 9.54/2.00 (((setukpairinjR => $true)) = $false) | (sF19 = $false)),
% 9.54/2.00 inference(superposition,[],[f5135,f787])).
% 9.54/2.00 thf(f5155,plain,(
% 9.54/2.00 ($true = $false) | (sF19 = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f5151])).
% 9.54/2.00 thf(f5156,plain,(
% 9.54/2.00 (sF19 = $false)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f5155])).
% 9.54/2.00 thf(f5159,plain,(
% 9.54/2.00 (((ksndsingleton => sF18)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f848,f5156])).
% 9.54/2.00 thf(f5164,plain,(
% 9.54/2.00 ($false = sF18)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f5159])).
% 9.54/2.00 thf(f5174,plain,(
% 9.54/2.00 (((ksndpairEq => sF17)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f846,f5164])).
% 9.54/2.00 thf(f5179,plain,(
% 9.54/2.00 ($false = ((ksndpairEq => (kpairsurjEq => sF16))))),
% 9.54/2.00 inference(forward_demodulation,[],[f5174,f844])).
% 9.54/2.00 thf(f5186,plain,(
% 9.54/2.00 ($false = sF16) | (((ksndpairEq => (kpairsurjEq => $true))) = $false)),
% 9.54/2.00 inference(superposition,[],[f5179,f787])).
% 9.54/2.00 thf(f5195,plain,(
% 9.54/2.00 ($false = sF16) | ($false = ((ksndpairEq => $true)))),
% 9.54/2.00 inference(boolean_simplification,[],[f5186])).
% 9.54/2.00 thf(f5196,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF16)),
% 9.54/2.00 inference(boolean_simplification,[],[f5195])).
% 9.54/2.00 thf(f5197,plain,(
% 9.54/2.00 ($false = sF16)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f5196])).
% 9.54/2.00 thf(f5204,plain,(
% 9.54/2.00 (((cartprodsndin => sF15)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f843,f5197])).
% 9.54/2.00 thf(f5212,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (cartprod @ Y2 @ Y0)) => (in @ (ksnd @ Y1) @ Y0)))))))) => sF15)))),
% 9.54/2.00 inference(forward_demodulation,[],[f5204,f641])).
% 9.54/2.00 thf(f5213,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (cartprod @ Y2 @ Y0)) => (in @ (ksnd @ Y1) @ Y0)))))))) => (cartprodpairmemEL => sF14))))),
% 9.54/2.00 inference(forward_demodulation,[],[f5212,f841])).
% 9.54/2.00 thf(f5260,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (cartprod @ Y2 @ Y0)) => (in @ (ksnd @ Y1) @ Y0)))))))) => (cartprodpairmemEL => $true)))) | ($false = sF14)),
% 9.54/2.00 inference(superposition,[],[f5213,f787])).
% 9.54/2.00 thf(f5268,plain,(
% 9.54/2.00 ($false = sF14) | ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (cartprod @ Y2 @ Y0)) => (in @ (ksnd @ Y1) @ Y0)))))))) => $true)))),
% 9.54/2.00 inference(boolean_simplification,[],[f5260])).
% 9.54/2.00 thf(f5269,plain,(
% 9.54/2.00 ($false = sF14) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f5268])).
% 9.54/2.00 thf(f5270,plain,(
% 9.54/2.00 ($false = sF14)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f5269])).
% 9.54/2.00 thf(f5279,plain,(
% 9.54/2.00 (((cartprodpairmemER => sF13)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f840,f5270])).
% 9.54/2.00 thf(f5290,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((in @ (kpair @ Y1 @ Y3) @ (cartprod @ Y2 @ Y0)) => (in @ Y3 @ Y0)))))))))) => sF13)))),
% 9.54/2.00 inference(forward_demodulation,[],[f5279,f735])).
% 9.54/2.00 thf(f5297,plain,(
% 9.54/2.00 ($false = sF13)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f5290])).
% 9.54/2.00 thf(f5309,plain,(
% 9.54/2.00 (((cartprodmempaircEq => sF12)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f838,f5297])).
% 9.54/2.00 thf(f5312,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ($true)))))))))) => sF12)))),
% 9.54/2.00 inference(forward_demodulation,[],[f5309,f1120])).
% 9.54/2.00 thf(f5315,plain,(
% 9.54/2.00 ($false = sF12) | ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ($true)))))))))) => $true)))),
% 9.54/2.00 inference(superposition,[],[f5312,f787])).
% 9.54/2.00 thf(f5318,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF12)),
% 9.54/2.00 inference(boolean_simplification,[],[f5315])).
% 9.54/2.00 thf(f5319,plain,(
% 9.54/2.00 ($false = sF12)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f5318])).
% 9.54/2.00 thf(f5323,plain,(
% 9.54/2.00 ($false = ((cartprodfstpairEq => sF11)))),
% 9.54/2.00 inference(backward_demodulation,[],[f836,f5319])).
% 9.54/2.00 thf(f5330,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((kfst @ (kpair @ Y2 @ Y3)) = Y2))))))))))) => sF11)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f5323,f727])).
% 9.54/2.00 thf(f5333,plain,(
% 9.54/2.00 ($false = sF11)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f5330])).
% 9.54/2.00 thf(f5343,plain,(
% 9.54/2.00 ($false = ((cartprodsndpairEq => sF10)))),
% 9.54/2.00 inference(backward_demodulation,[],[f834,f5333])).
% 9.54/2.00 thf(f5348,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((ksnd @ (kpair @ Y2 @ Y3)) = Y3))))))))))) => sF10)))),
% 9.54/2.00 inference(forward_demodulation,[],[f5343,f589])).
% 9.54/2.00 thf(f5351,plain,(
% 9.54/2.00 (sF10 = $false) | ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((ksnd @ (kpair @ Y2 @ Y3)) = Y3))))))))))) => $true)))),
% 9.54/2.00 inference(superposition,[],[f5348,f787])).
% 9.54/2.00 thf(f5355,plain,(
% 9.54/2.00 (sF10 = $false) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f5351])).
% 9.54/2.00 thf(f5356,plain,(
% 9.54/2.00 (sF10 = $false)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f5355])).
% 9.54/2.00 thf(f5363,plain,(
% 9.54/2.00 (((cartprodpairsurjEq => sF9)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f832,f5356])).
% 9.54/2.00 thf(f5366,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (cartprod @ Y1 @ Y2)) => ((kpair @ (kfst @ Y0) @ (ksnd @ Y0)) = Y0)))))))) => sF9)))),
% 9.54/2.00 inference(forward_demodulation,[],[f5363,f677])).
% 9.54/2.00 thf(f5371,plain,(
% 9.54/2.00 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (cartprod @ Y1 @ Y2)) => ((kpair @ (kfst @ Y0) @ (ksnd @ Y0)) = Y0)))))))) => $true))) | ($false = sF9)),
% 9.54/2.00 inference(superposition,[],[f5366,f787])).
% 9.54/2.00 thf(f5374,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF9)),
% 9.54/2.00 inference(boolean_simplification,[],[f5371])).
% 9.54/2.00 thf(f5375,plain,(
% 9.54/2.00 ($false = sF9)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f5374])).
% 9.54/2.00 thf(f5379,plain,(
% 9.54/2.00 ($false = ((dpsetconstrI => sF8)))),
% 9.54/2.00 inference(backward_demodulation,[],[f831,f5375])).
% 9.54/2.00 thf(f5386,plain,(
% 9.54/2.00 (sF8 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f5379])).
% 9.54/2.00 thf(f5396,plain,(
% 9.54/2.00 ($false = ((dpsetconstrSub => sF7)))),
% 9.54/2.00 inference(backward_demodulation,[],[f830,f5386])).
% 9.54/2.00 thf(f5401,plain,(
% 9.54/2.00 ((((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $i > $o) @ (^[Y1 : $i > $i > $o]: (!! @ $i @ (^[Y2 : $i]: (subset @ (dpsetconstr @ Y2 @ Y0 @ Y1) @ (cartprod @ Y2 @ Y0)))))))) => sF7)) = $false)),
% 9.54/2.00 inference(forward_demodulation,[],[f5396,f1104])).
% 9.54/2.00 thf(f5406,plain,(
% 9.54/2.00 ($false = sF7)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f5401])).
% 9.54/2.00 thf(f5416,plain,(
% 9.54/2.00 ($false = ((setOfPairsIsBReln => sF6)))),
% 9.54/2.00 inference(backward_demodulation,[],[f829,f5406])).
% 9.54/2.00 thf(f5425,plain,(
% 9.54/2.00 ($false = ((setOfPairsIsBReln => $true))) | (sF6 = $false)),
% 9.54/2.00 inference(superposition,[],[f5416,f787])).
% 9.54/2.00 thf(f5428,plain,(
% 9.54/2.00 (sF6 = $false) | ($true = $false)),
% 9.54/2.00 inference(boolean_simplification,[],[f5425])).
% 9.54/2.00 thf(f5429,plain,(
% 9.54/2.00 (sF6 = $false)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f5428])).
% 9.54/2.00 thf(f5435,plain,(
% 9.54/2.00 ($false = ((dpsetconstrERa => sF5)))),
% 9.54/2.00 inference(backward_demodulation,[],[f827,f5429])).
% 9.54/2.00 thf(f5438,plain,(
% 9.54/2.00 (sF5 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f5435])).
% 9.54/2.00 thf(f5448,plain,(
% 9.54/2.00 (((dpsetconstrEL1 => sF4)) = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f826,f5438])).
% 9.54/2.00 thf(f5457,plain,(
% 9.54/2.00 ($false = sF4)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f5448])).
% 9.54/2.00 thf(f5467,plain,(
% 9.54/2.00 ($false = ((dpsetconstrEL2 => sF3)))),
% 9.54/2.00 inference(backward_demodulation,[],[f824,f5457])).
% 9.54/2.00 thf(f5478,plain,(
% 9.54/2.00 ($false = ((dpsetconstrEL2 => $true))) | ($false = sF3)),
% 9.54/2.00 inference(superposition,[],[f5467,f787])).
% 9.54/2.00 thf(f5482,plain,(
% 9.54/2.00 ($true = $false) | ($false = sF3)),
% 9.54/2.00 inference(boolean_simplification,[],[f5478])).
% 9.54/2.00 thf(f5483,plain,(
% 9.54/2.00 ($false = sF3)),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f5482])).
% 9.54/2.00 thf(f5486,plain,(
% 9.54/2.00 ($false = ((dpsetconstrER => sF2)))),
% 9.54/2.00 inference(backward_demodulation,[],[f822,f5483])).
% 9.54/2.00 thf(f5493,plain,(
% 9.54/2.00 ($false = sF2)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f5486])).
% 9.54/2.00 thf(f5503,plain,(
% 9.54/2.00 ($false = ((funcImageSingleton => sF1)))),
% 9.54/2.00 inference(backward_demodulation,[],[f821,f5493])).
% 9.54/2.00 thf(f5510,plain,(
% 9.54/2.00 ($false = sF1)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f5503])).
% 9.54/2.00 thf(f5520,plain,(
% 9.54/2.00 ($false = ((apProp => sF0)))),
% 9.54/2.00 inference(backward_demodulation,[],[f819,f5510])).
% 9.54/2.00 thf(f5529,plain,(
% 9.54/2.00 (sF0 = $false)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f5520])).
% 9.54/2.00 thf(f5530,plain,(
% 9.54/2.00 (apProp = $true)),
% 9.54/2.00 inference(imp_proxy_clausification,[],[f5520])).
% 9.54/2.00 thf(f5539,plain,(
% 9.54/2.00 ($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((subset @ Y0 @ (cartprod @ Y1 @ Y2)) & (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => (?? @ $i @ (^[Y4 : $i]: ((in @ Y4 @ (dsetconstr @ Y2 @ (^[Y5 : $i]: (in @ (kpair @ Y3 @ Y5) @ Y0)))) & ((setadjoin @ Y4 @ emptyset) = (dsetconstr @ Y2 @ (^[Y5 : $i]: (in @ (kpair @ Y3 @ Y5) @ Y0))))))))))) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => (in @ (setunion @ (dsetconstr @ Y2 @ (^[Y4 : $i]: (in @ (kpair @ Y3 @ Y4) @ Y0)))) @ Y2)))))))))))))),
% 9.54/2.00 inference(backward_demodulation,[],[f1145,f5530])).
% 9.54/2.00 thf(f5541,plain,(
% 9.54/2.00 ($false = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((subset @ Y0 @ (cartprod @ Y1 @ Y2)) & (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => (?? @ $i @ (^[Y4 : $i]: ((in @ Y4 @ (dsetconstr @ Y2 @ (^[Y5 : $i]: (in @ (kpair @ Y3 @ Y5) @ Y0)))) & ((setadjoin @ Y4 @ emptyset) = (dsetconstr @ Y2 @ (^[Y5 : $i]: (in @ (kpair @ Y3 @ Y5) @ Y0))))))))))) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => (in @ (setunion @ (dsetconstr @ Y2 @ (^[Y4 : $i]: (in @ (kpair @ Y3 @ Y4) @ Y0)))) @ Y2)))))))))))))),
% 9.54/2.00 inference(backward_demodulation,[],[f1110,f5529])).
% 9.54/2.00 thf(f5542,plain,(
% 9.54/2.00 ($true = $false)),
% 9.54/2.00 inference(backward_demodulation,[],[f5539,f5541])).
% 9.54/2.00 thf(f5543,plain,(
% 9.54/2.00 $false),
% 9.54/2.00 inference(trivial_inequality_removal,[],[f5542])).
% 9.54/2.00 % SZS output end Proof for theBenchmark
% 9.54/2.00 % (3420608)------------------------------
% 9.54/2.00 % (3420608)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.54/2.00 % (3420608)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.54/2.00 % (3420608)CaDiCaL version: 2.1.3
% 9.54/2.00 % (3420608)Termination reason: Refutation
% 9.54/2.00 % (3420608)Time elapsed: 0.169 s
% 9.54/2.00 % (3420608)Peak memory usage: 17 MB
% 9.54/2.00 % (3420608)Instructions burned: 599 (million)
% 9.54/2.00 % (3420418)Success in time 1.752 s
% 9.54/2.00 % Vampire exiting
%------------------------------------------------------------------------------