TSTP Solution File: SEU639^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU639^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:50:12 EDT 2024
% Result : Theorem 0.23s 0.49s
% Output : Refutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU639^2 : TPTP v8.2.0. Released v3.7.0.
% 0.12/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 16:26:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 % (2527)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.14/0.39 % (2526)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.14/0.39 % (2528)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.14/0.39 % (2529)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.39 % (2530)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.39 % (2532)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.39 % (2531)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.14/0.39 % (2529)Instruction limit reached!
% 0.14/0.39 % (2529)------------------------------
% 0.14/0.39 % (2529)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (2529)Termination reason: Unknown
% 0.14/0.39 % (2529)Termination phase: shuffling
% 0.14/0.39 % (2530)Instruction limit reached!
% 0.14/0.39 % (2530)------------------------------
% 0.14/0.39 % (2530)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (2530)Termination reason: Unknown
% 0.14/0.39 % (2530)Termination phase: shuffling
% 0.14/0.39
% 0.14/0.39 % (2530)Memory used [KB]: 895
% 0.14/0.39 % (2530)Time elapsed: 0.004 s
% 0.14/0.39 % (2530)Instructions burned: 2 (million)
% 0.14/0.39 % (2530)------------------------------
% 0.14/0.39 % (2530)------------------------------
% 0.14/0.39
% 0.14/0.39 % (2533)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.39 % (2529)Memory used [KB]: 895
% 0.14/0.39 % (2529)Time elapsed: 0.004 s
% 0.14/0.39 % (2529)Instructions burned: 2 (million)
% 0.14/0.39 % (2529)------------------------------
% 0.14/0.39 % (2529)------------------------------
% 0.14/0.40 % (2533)Instruction limit reached!
% 0.14/0.40 % (2533)------------------------------
% 0.14/0.40 % (2533)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (2533)Termination reason: Unknown
% 0.14/0.40 % (2527)Instruction limit reached!
% 0.14/0.40 % (2527)------------------------------
% 0.14/0.40 % (2527)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (2527)Termination reason: Unknown
% 0.14/0.40 % (2527)Termination phase: Property scanning
% 0.14/0.40
% 0.14/0.40 % (2527)Memory used [KB]: 1023
% 0.14/0.40 % (2527)Time elapsed: 0.007 s
% 0.14/0.40 % (2527)Instructions burned: 4 (million)
% 0.14/0.40 % (2527)------------------------------
% 0.14/0.40 % (2527)------------------------------
% 0.14/0.40 % (2533)Termination phase: Preprocessing 3
% 0.14/0.40
% 0.14/0.40 % (2533)Memory used [KB]: 1023
% 0.14/0.40 % (2533)Time elapsed: 0.005 s
% 0.14/0.40 % (2533)Instructions burned: 3 (million)
% 0.14/0.40 % (2533)------------------------------
% 0.14/0.40 % (2533)------------------------------
% 0.14/0.41 % (2532)Instruction limit reached!
% 0.14/0.41 % (2532)------------------------------
% 0.14/0.41 % (2532)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.41 % (2532)Termination reason: Unknown
% 0.14/0.41 % (2532)Termination phase: Saturation
% 0.14/0.41
% 0.14/0.41 % (2532)Memory used [KB]: 5628
% 0.14/0.41 % (2532)Time elapsed: 0.021 s
% 0.14/0.41 % (2532)Instructions burned: 18 (million)
% 0.14/0.41 % (2532)------------------------------
% 0.14/0.41 % (2532)------------------------------
% 0.23/0.42 % (2528)Instruction limit reached!
% 0.23/0.42 % (2528)------------------------------
% 0.23/0.42 % (2528)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.42 % (2528)Termination reason: Unknown
% 0.23/0.42 % (2528)Termination phase: Saturation
% 0.23/0.42
% 0.23/0.42 % (2528)Memory used [KB]: 5628
% 0.23/0.42 % (2528)Time elapsed: 0.029 s
% 0.23/0.42 % (2528)Instructions burned: 27 (million)
% 0.23/0.42 % (2528)------------------------------
% 0.23/0.42 % (2528)------------------------------
% 0.23/0.42 % (2537)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.23/0.42 % (2534)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.23/0.42 % (2535)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.23/0.42 % (2536)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.23/0.42 % (2536)Instruction limit reached!
% 0.23/0.42 % (2536)------------------------------
% 0.23/0.42 % (2536)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.42 % (2536)Termination reason: Unknown
% 0.23/0.42 % (2536)Termination phase: Preprocessing 3
% 0.23/0.42
% 0.23/0.42 % (2536)Memory used [KB]: 1023
% 0.23/0.42 % (2536)Time elapsed: 0.005 s
% 0.23/0.42 % (2536)Instructions burned: 3 (million)
% 0.23/0.42 % (2536)------------------------------
% 0.23/0.42 % (2536)------------------------------
% 0.23/0.43 % (2538)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.23/0.43 % (2538)Instruction limit reached!
% 0.23/0.43 % (2538)------------------------------
% 0.23/0.43 % (2538)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.43 % (2538)Termination reason: Unknown
% 0.23/0.43 % (2538)Termination phase: Saturation
% 0.23/0.43
% 0.23/0.43 % (2538)Memory used [KB]: 1023
% 0.23/0.43 % (2538)Time elapsed: 0.006 s
% 0.23/0.43 % (2538)Instructions burned: 8 (million)
% 0.23/0.43 % (2538)------------------------------
% 0.23/0.43 % (2538)------------------------------
% 0.23/0.43 % (2539)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.23/0.43 % (2535)Instruction limit reached!
% 0.23/0.43 % (2535)------------------------------
% 0.23/0.43 % (2535)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.43 % (2535)Termination reason: Unknown
% 0.23/0.43 % (2535)Termination phase: Saturation
% 0.23/0.43
% 0.23/0.43 % (2535)Memory used [KB]: 5628
% 0.23/0.43 % (2535)Time elapsed: 0.018 s
% 0.23/0.43 % (2535)Instructions burned: 15 (million)
% 0.23/0.43 % (2535)------------------------------
% 0.23/0.43 % (2535)------------------------------
% 0.23/0.44 % (2534)Instruction limit reached!
% 0.23/0.44 % (2534)------------------------------
% 0.23/0.44 % (2534)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.44 % (2534)Termination reason: Unknown
% 0.23/0.44 % (2534)Termination phase: Saturation
% 0.23/0.44
% 0.23/0.44 % (2534)Memory used [KB]: 5756
% 0.23/0.44 % (2534)Time elapsed: 0.023 s
% 0.23/0.44 % (2534)Instructions burned: 37 (million)
% 0.23/0.44 % (2534)------------------------------
% 0.23/0.44 % (2534)------------------------------
% 0.23/0.44 % (2539)Instruction limit reached!
% 0.23/0.44 % (2539)------------------------------
% 0.23/0.44 % (2539)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.44 % (2539)Termination reason: Unknown
% 0.23/0.44 % (2539)Termination phase: Saturation
% 0.23/0.44
% 0.23/0.44 % (2539)Memory used [KB]: 5884
% 0.23/0.44 % (2539)Time elapsed: 0.012 s
% 0.23/0.44 % (2539)Instructions burned: 16 (million)
% 0.23/0.44 % (2539)------------------------------
% 0.23/0.44 % (2539)------------------------------
% 0.23/0.44 % (2540)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.23/0.45 % (2540)Instruction limit reached!
% 0.23/0.45 % (2540)------------------------------
% 0.23/0.45 % (2540)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.45 % (2540)Termination reason: Unknown
% 0.23/0.45 % (2540)Termination phase: Function definition elimination
% 0.23/0.45
% 0.23/0.45 % (2540)Memory used [KB]: 1023
% 0.23/0.45 % (2540)Time elapsed: 0.004 s
% 0.23/0.45 % (2540)Instructions burned: 4 (million)
% 0.23/0.45 % (2540)------------------------------
% 0.23/0.45 % (2540)------------------------------
% 0.23/0.45 % (2541)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.23/0.45 % (2541)Instruction limit reached!
% 0.23/0.45 % (2541)------------------------------
% 0.23/0.45 % (2541)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.45 % (2541)Termination reason: Unknown
% 0.23/0.45 % (2541)Termination phase: Property scanning
% 0.23/0.45
% 0.23/0.45 % (2541)Memory used [KB]: 1023
% 0.23/0.45 % (2541)Time elapsed: 0.004 s
% 0.23/0.45 % (2541)Instructions burned: 4 (million)
% 0.23/0.45 % (2541)------------------------------
% 0.23/0.45 % (2541)------------------------------
% 0.23/0.45 % (2542)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.23/0.45 % (2543)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.23/0.46 % (2542)Refutation not found, incomplete strategy
% 0.23/0.46 % (2542)------------------------------
% 0.23/0.46 % (2542)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.46 % (2542)Termination reason: Refutation not found, incomplete strategy
% 0.23/0.46
% 0.23/0.46
% 0.23/0.46 % (2542)Memory used [KB]: 5500
% 0.23/0.46 % (2542)Time elapsed: 0.006 s
% 0.23/0.46 % (2542)Instructions burned: 6 (million)
% 0.23/0.46 % (2542)------------------------------
% 0.23/0.46 % (2542)------------------------------
% 0.23/0.46 % (2543)Instruction limit reached!
% 0.23/0.46 % (2543)------------------------------
% 0.23/0.46 % (2543)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.46 % (2543)Termination reason: Unknown
% 0.23/0.46 % (2543)Termination phase: Property scanning
% 0.23/0.46
% 0.23/0.46 % (2543)Memory used [KB]: 1023
% 0.23/0.46 % (2543)Time elapsed: 0.004 s
% 0.23/0.46 % (2543)Instructions burned: 4 (million)
% 0.23/0.46 % (2543)------------------------------
% 0.23/0.46 % (2543)------------------------------
% 0.23/0.46 % (2544)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.23/0.46 % (2544)Instruction limit reached!
% 0.23/0.46 % (2544)------------------------------
% 0.23/0.46 % (2544)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.46 % (2544)Termination reason: Unknown
% 0.23/0.46 % (2544)Termination phase: Function definition elimination
% 0.23/0.46
% 0.23/0.46 % (2544)Memory used [KB]: 1023
% 0.23/0.46 % (2544)Time elapsed: 0.004 s
% 0.23/0.46 % (2544)Instructions burned: 4 (million)
% 0.23/0.46 % (2544)------------------------------
% 0.23/0.46 % (2544)------------------------------
% 0.23/0.46 % (2545)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.23/0.46 % (2546)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on theBenchmark for (2999ds/710Mi)
% 0.23/0.47 % (2547)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.23/0.47 % (2548)dis+1002_5:1_au=on:bd=off:e2e=on:fde=none:fs=off:fsr=off:sos=on:i=902:si=on:rtra=on_0 on theBenchmark for (2999ds/902Mi)
% 0.23/0.47 % (2545)Instruction limit reached!
% 0.23/0.47 % (2545)------------------------------
% 0.23/0.47 % (2545)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.47 % (2545)Termination reason: Unknown
% 0.23/0.47 % (2545)Termination phase: Saturation
% 0.23/0.47
% 0.23/0.47 % (2545)Memory used [KB]: 5628
% 0.23/0.47 % (2545)Time elapsed: 0.012 s
% 0.23/0.47 % (2545)Instructions burned: 18 (million)
% 0.23/0.47 % (2545)------------------------------
% 0.23/0.47 % (2545)------------------------------
% 0.23/0.47 % (2547)Instruction limit reached!
% 0.23/0.47 % (2547)------------------------------
% 0.23/0.47 % (2547)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.47 % (2547)Termination reason: Unknown
% 0.23/0.47 % (2547)Termination phase: Saturation
% 0.23/0.47
% 0.23/0.47 % (2547)Memory used [KB]: 5500
% 0.23/0.47 % (2547)Time elapsed: 0.005 s
% 0.23/0.47 % (2547)Instructions burned: 6 (million)
% 0.23/0.47 % (2547)------------------------------
% 0.23/0.47 % (2547)------------------------------
% 0.23/0.48 % (2549)dis+21_1:8_apa=on:cnfonf=off:fd=off:fsr=off:hud=0:ins=1:kws=inv_frequency:nwc=10.0:ss=axioms:st=5.0:i=21:si=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.23/0.49 % (2550)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2998ds/5Mi)
% 0.23/0.49 % (2537)First to succeed.
% 0.23/0.49 % (2551)lrs+2_1:1_cnfonf=lazy_not_gen_be_off:cs=on:fe=off:hud=10:inj=on:ins=3:plsq=on:plsqc=1:sd=10:ss=axioms:tnu=1:i=6:si=on:rtra=on_0 on theBenchmark for (2998ds/6Mi)
% 0.23/0.49 % (2549)Instruction limit reached!
% 0.23/0.49 % (2549)------------------------------
% 0.23/0.49 % (2549)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.49 % (2549)Termination reason: Unknown
% 0.23/0.49 % (2549)Termination phase: Saturation
% 0.23/0.49
% 0.23/0.49 % (2549)Memory used [KB]: 5628
% 0.23/0.49 % (2549)Time elapsed: 0.014 s
% 0.23/0.49 % (2549)Instructions burned: 22 (million)
% 0.23/0.49 % (2549)------------------------------
% 0.23/0.49 % (2549)------------------------------
% 0.23/0.49 % (2550)Instruction limit reached!
% 0.23/0.49 % (2550)------------------------------
% 0.23/0.49 % (2550)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.49 % (2550)Termination reason: Unknown
% 0.23/0.49 % (2550)Termination phase: Saturation
% 0.23/0.49
% 0.23/0.49 % (2550)Memory used [KB]: 5500
% 0.23/0.49 % (2550)Time elapsed: 0.005 s
% 0.23/0.49 % (2550)Instructions burned: 6 (million)
% 0.23/0.49 % (2550)------------------------------
% 0.23/0.49 % (2550)------------------------------
% 0.23/0.49 % (2551)Instruction limit reached!
% 0.23/0.49 % (2551)------------------------------
% 0.23/0.49 % (2551)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.49 % (2551)Termination reason: Unknown
% 0.23/0.49 % (2551)Termination phase: Saturation
% 0.23/0.49
% 0.23/0.49 % (2551)Memory used [KB]: 5500
% 0.23/0.49 % (2551)Time elapsed: 0.004 s
% 0.23/0.49 % (2551)Instructions burned: 6 (million)
% 0.23/0.49 % (2551)------------------------------
% 0.23/0.49 % (2551)------------------------------
% 0.23/0.49 % (2537)Refutation found. Thanks to Tanya!
% 0.23/0.49 % SZS status Theorem for theBenchmark
% 0.23/0.49 % SZS output start Proof for theBenchmark
% 0.23/0.49 thf(func_def_0, type, in: $i > $i > $o).
% 0.23/0.49 thf(func_def_2, type, setadjoin: $i > $i > $i).
% 0.23/0.49 thf(func_def_3, type, dsetconstr: $i > ($i > $o) > $i).
% 0.23/0.49 thf(func_def_11, type, singleton: $i > $o).
% 0.23/0.49 thf(func_def_12, type, ex1: $i > ($i > $o) > $o).
% 0.23/0.49 thf(func_def_28, type, ph1: !>[X0: $tType]:(X0)).
% 0.23/0.49 thf(func_def_30, type, sK3: $i > $o).
% 0.23/0.49 thf(f606,plain,(
% 0.23/0.49 $false),
% 0.23/0.49 inference(avatar_sat_refutation,[],[f338,f492,f605])).
% 0.23/0.49 thf(f605,plain,(
% 0.23/0.49 ~spl0_1),
% 0.23/0.49 inference(avatar_contradiction_clause,[],[f604])).
% 0.23/0.49 thf(f604,plain,(
% 0.23/0.49 $false | ~spl0_1),
% 0.23/0.49 inference(trivial_inequality_removal,[],[f603])).
% 0.23/0.49 thf(f603,plain,(
% 0.23/0.49 ($false = $true) | ~spl0_1),
% 0.23/0.49 inference(boolean_simplification,[],[f602])).
% 0.23/0.49 thf(f602,plain,(
% 0.23/0.49 ((~ $true) = $true) | ~spl0_1),
% 0.23/0.49 inference(backward_demodulation,[],[f560,f597])).
% 0.23/0.49 thf(f597,plain,(
% 0.23/0.49 ((in @ sK6 @ sK2) = $true) | ~spl0_1),
% 0.23/0.49 inference(boolean_simplification,[],[f586])).
% 0.23/0.49 thf(f586,plain,(
% 0.23/0.49 ($true = ($true => (in @ sK6 @ sK2))) | ~spl0_1),
% 0.23/0.49 inference(superposition,[],[f59,f532])).
% 0.23/0.49 thf(f532,plain,(
% 0.23/0.49 ((in @ sK6 @ (dsetconstr @ sK2 @ sK3)) = $true) | ~spl0_1),
% 0.23/0.49 inference(binary_proxy_clausification,[],[f527])).
% 0.23/0.49 thf(f527,plain,(
% 0.23/0.49 ($false = ((in @ sK6 @ (dsetconstr @ sK2 @ sK3)) => (in @ sK6 @ (setadjoin @ sK4 @ emptyset)))) | ~spl0_1),
% 0.23/0.49 inference(beta_eta_normalization,[],[f524])).
% 0.23/0.49 thf(f524,plain,(
% 0.23/0.49 ($false = ((^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK2 @ sK3)) => (in @ Y0 @ (setadjoin @ sK4 @ emptyset)))) @ sK6)) | ~spl0_1),
% 0.23/0.49 inference(sigma_clausification,[],[f334])).
% 0.23/0.49 thf(f334,plain,(
% 0.23/0.49 ($false = (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK2 @ sK3)) => (in @ Y0 @ (setadjoin @ sK4 @ emptyset)))))) | ~spl0_1),
% 0.23/0.49 inference(avatar_component_clause,[],[f333])).
% 0.23/0.49 thf(f333,plain,(
% 0.23/0.49 spl0_1 <=> ($false = (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK2 @ sK3)) => (in @ Y0 @ (setadjoin @ sK4 @ emptyset))))))),
% 0.23/0.49 introduced(avatar_definition,[new_symbols(naming,[spl0_1])])).
% 0.23/0.49 thf(f59,plain,(
% 0.23/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : ((((in @ X1 @ (dsetconstr @ X3 @ X2)) => (in @ X1 @ X3)) = $true)) )),
% 0.23/0.49 inference(beta_eta_normalization,[],[f58])).
% 0.23/0.49 thf(f58,plain,(
% 0.23/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((in @ X1 @ (dsetconstr @ Y0 @ X2)) => (in @ X1 @ Y0))) @ X3))) )),
% 0.23/0.49 inference(pi_clausification,[],[f57])).
% 0.23/0.49 thf(f57,plain,(
% 0.23/0.49 ( ! [X2 : $i > $o,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((in @ X1 @ (dsetconstr @ Y0 @ X2)) => (in @ X1 @ Y0)))) = $true)) )),
% 0.23/0.49 inference(beta_eta_normalization,[],[f56])).
% 0.23/0.49 thf(f56,plain,(
% 0.23/0.49 ( ! [X2 : $i > $o,X1 : $i] : ((((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ (dsetconstr @ Y1 @ Y0)) => (in @ X1 @ Y1))))) @ X2) = $true)) )),
% 0.23/0.49 inference(pi_clausification,[],[f55])).
% 0.23/0.49 thf(f55,plain,(
% 0.23/0.49 ( ! [X1 : $i] : (($true = (!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ (dsetconstr @ Y1 @ Y0)) => (in @ X1 @ Y1)))))))) )),
% 0.23/0.49 inference(beta_eta_normalization,[],[f54])).
% 0.23/0.49 thf(f54,plain,(
% 0.23/0.49 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (dsetconstr @ Y2 @ Y1)) => (in @ Y0 @ Y2))))))) @ X1))) )),
% 0.23/0.49 inference(pi_clausification,[],[f49])).
% 0.23/0.49 thf(f49,plain,(
% 0.23/0.49 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (dsetconstr @ Y2 @ Y1)) => (in @ Y0 @ Y2)))))))))),
% 0.23/0.49 inference(binary_proxy_clausification,[],[f47])).
% 0.23/0.49 thf(f47,plain,(
% 0.23/0.49 ($false = ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (dsetconstr @ Y2 @ Y1)) => (in @ Y0 @ Y2)))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ (dsetconstr @ Y1 @ Y2)) => (Y2 @ Y0)))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (in @ Y2 @ Y1)))) => ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (Y1 = Y0))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setadjoin @ Y1 @ emptyset)) => (Y1 = Y0)))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset))))))) => (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((Y1 @ Y2) => ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((Y1 @ Y3) => (Y2 = Y3))))) => (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ (dsetconstr @ Y0 @ Y1)) & ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y0 @ Y1))))))))))))))))))))),
% 0.23/0.49 inference(boolean_simplification,[],[f46])).
% 0.23/0.49 thf(f46,plain,(
% 0.23/0.49 ($false = ($true => ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (dsetconstr @ Y2 @ Y1)) => (in @ Y0 @ Y2)))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ (dsetconstr @ Y1 @ Y2)) => (Y2 @ Y0)))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (in @ Y2 @ Y1)))) => ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (Y1 = Y0))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setadjoin @ Y1 @ emptyset)) => (Y1 = Y0)))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset))))))) => (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((Y1 @ Y2) => ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((Y1 @ Y3) => (Y2 = Y3))))) => (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ (dsetconstr @ Y0 @ Y1)) & ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y0 @ Y1)))))))))))))))))))))),
% 0.23/0.49 inference(backward_demodulation,[],[f41,f45])).
% 0.23/0.49 thf(f45,plain,(
% 0.23/0.49 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ Y0) => ((Y2 @ Y1) => (in @ Y1 @ (dsetconstr @ Y0 @ Y2)))))))))) = $true)),
% 0.23/0.49 inference(binary_proxy_clausification,[],[f41])).
% 0.23/0.49 thf(f41,plain,(
% 0.23/0.49 ($false = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ Y0) => ((Y2 @ Y1) => (in @ Y1 @ (dsetconstr @ Y0 @ Y2)))))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (dsetconstr @ Y2 @ Y1)) => (in @ Y0 @ Y2)))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ (dsetconstr @ Y1 @ Y2)) => (Y2 @ Y0)))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (in @ Y2 @ Y1)))) => ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (Y1 = Y0))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setadjoin @ Y1 @ emptyset)) => (Y1 = Y0)))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset))))))) => (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((Y1 @ Y2) => ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((Y1 @ Y3) => (Y2 = Y3))))) => (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ (dsetconstr @ Y0 @ Y1)) & ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y0 @ Y1)))))))))))))))))))))),
% 0.23/0.49 inference(not_proxy_clausification,[],[f40])).
% 0.23/0.49 thf(f40,plain,(
% 0.23/0.49 ($true = (~ ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ Y0) => ((Y2 @ Y1) => (in @ Y1 @ (dsetconstr @ Y0 @ Y2)))))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (dsetconstr @ Y2 @ Y1)) => (in @ Y0 @ Y2)))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ (dsetconstr @ Y1 @ Y2)) => (Y2 @ Y0)))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (in @ Y2 @ Y1)))) => ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (Y1 = Y0))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setadjoin @ Y1 @ emptyset)) => (Y1 = Y0)))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset))))))) => (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((Y1 @ Y2) => ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((Y1 @ Y3) => (Y2 = Y3))))) => (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ (dsetconstr @ Y0 @ Y1)) & ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y0 @ Y1))))))))))))))))))))))),
% 0.23/0.49 inference(beta_eta_normalization,[],[f39])).
% 0.23/0.49 thf(f39,plain,(
% 0.23/0.49 ($true = (~ ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ Y0) => ((Y2 @ Y1) => (in @ Y1 @ (dsetconstr @ Y0 @ (^[Y3 : $i]: (Y2 @ Y3)))))))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (dsetconstr @ Y2 @ (^[Y3 : $i]: (Y1 @ Y3)))) => (in @ Y0 @ Y2)))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ (dsetconstr @ Y1 @ (^[Y3 : $i]: (Y2 @ Y3)))) => (Y2 @ Y0)))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (in @ Y2 @ Y1)))) => ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (Y1 = Y0))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setadjoin @ Y1 @ emptyset)) => (Y1 = Y0)))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset))))))) => (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((Y1 @ Y2) => ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((Y1 @ Y3) => (Y2 = Y3))))) => ((^[Y3 : $i]: ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (?? @ $i @ (^[Y6 : $i]: ((in @ Y6 @ Y5) & ((setadjoin @ Y6 @ emptyset) = Y5))))) @ (dsetconstr @ Y3 @ (^[Y5 : $i]: (Y4 @ Y5))))))) @ Y0 @ (^[Y3 : $i]: (Y1 @ Y3))))))))))))))))))))),
% 0.23/0.49 inference(definition_unfolding,[],[f37,f34,f31,f29,f35,f33,f30,f38])).
% 0.23/0.49 thf(f38,plain,(
% 0.23/0.49 (ex1 = (^[Y0 : $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) & ((setadjoin @ Y3 @ emptyset) = Y2))))) @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (Y1 @ Y2))))))))),
% 0.23/0.49 inference(definition_unfolding,[],[f32,f36])).
% 0.23/0.49 thf(f36,plain,(
% 0.23/0.49 (singleton = (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))))),
% 0.23/0.49 inference(cnf_transformation,[],[f17])).
% 0.23/0.49 thf(f17,plain,(
% 0.23/0.49 (singleton = (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))))),
% 0.23/0.49 inference(fool_elimination,[],[f16])).
% 0.23/0.49 thf(f16,plain,(
% 0.23/0.49 ((^[X0 : $i] : (? [X1] : (((setadjoin @ X1 @ emptyset) = X0) & (in @ X1 @ X0)))) = singleton)),
% 0.23/0.49 inference(rectify,[],[f7])).
% 0.23/0.49 thf(f7,axiom,(
% 0.23/0.49 ((^[X0 : $i] : (? [X2] : (((setadjoin @ X2 @ emptyset) = X0) & (in @ X2 @ X0)))) = singleton)),
% 0.23/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton)).
% 0.23/0.49 thf(f32,plain,(
% 0.23/0.49 (ex1 = (^[Y0 : $i]: ((^[Y1 : $i > $o]: (singleton @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (Y1 @ Y2))))))))),
% 0.23/0.49 inference(cnf_transformation,[],[f18])).
% 0.23/0.49 thf(f18,plain,(
% 0.23/0.49 (ex1 = (^[Y0 : $i]: ((^[Y1 : $i > $o]: (singleton @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (Y1 @ Y2))))))))),
% 0.23/0.49 inference(fool_elimination,[],[f8])).
% 0.23/0.49 thf(f8,axiom,(
% 0.23/0.49 ((^[X0 : $i, X1 : $i > $o] : (singleton @ (dsetconstr @ X0 @ (^[X2 : $i] : (X1 @ X2))))) = ex1)),
% 0.23/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ex1)).
% 0.23/0.49 thf(f30,plain,(
% 0.23/0.49 (eqinunit = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset))))))))),
% 0.23/0.49 inference(cnf_transformation,[],[f20])).
% 0.23/0.49 thf(f20,plain,(
% 0.23/0.49 (eqinunit = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset))))))))),
% 0.23/0.49 inference(fool_elimination,[],[f19])).
% 0.23/0.49 thf(f19,plain,(
% 0.23/0.49 (! [X0,X1] : ((X0 = X1) => (in @ X1 @ (setadjoin @ X0 @ emptyset))) = eqinunit)),
% 0.23/0.49 inference(rectify,[],[f6])).
% 0.23/0.49 thf(f6,axiom,(
% 0.23/0.49 (! [X3,X2] : ((X2 = X3) => (in @ X2 @ (setadjoin @ X3 @ emptyset))) = eqinunit)),
% 0.23/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',eqinunit)).
% 0.23/0.49 thf(f33,plain,(
% 0.23/0.49 (uniqinunit = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setadjoin @ Y1 @ emptyset)) => (Y1 = Y0)))))))),
% 0.23/0.49 inference(cnf_transformation,[],[f24])).
% 0.23/0.49 thf(f24,plain,(
% 0.23/0.49 (uniqinunit = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setadjoin @ Y1 @ emptyset)) => (Y1 = Y0)))))))),
% 0.23/0.49 inference(fool_elimination,[],[f23])).
% 0.23/0.49 thf(f23,plain,(
% 0.23/0.49 (! [X0,X1] : ((in @ X1 @ (setadjoin @ X0 @ emptyset)) => (X0 = X1)) = uniqinunit)),
% 0.23/0.49 inference(rectify,[],[f5])).
% 0.23/0.49 thf(f5,axiom,(
% 0.23/0.49 (! [X3,X2] : ((in @ X2 @ (setadjoin @ X3 @ emptyset)) => (X2 = X3)) = uniqinunit)),
% 0.23/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',uniqinunit)).
% 0.23/0.49 thf(f35,plain,(
% 0.23/0.49 (setext = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (in @ Y2 @ Y1)))) => ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (Y1 = Y0))))))))),
% 0.23/0.49 inference(cnf_transformation,[],[f22])).
% 0.23/0.49 thf(f22,plain,(
% 0.23/0.49 (setext = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (in @ Y2 @ Y1)))) => ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (Y1 = Y0))))))))),
% 0.23/0.49 inference(fool_elimination,[],[f21])).
% 0.23/0.49 thf(f21,plain,(
% 0.23/0.49 (setext = ! [X0,X1] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (! [X3] : ((in @ X3 @ X0) => (in @ X3 @ X1)) => (X0 = X1))))),
% 0.23/0.49 inference(rectify,[],[f4])).
% 0.23/0.49 thf(f4,axiom,(
% 0.23/0.49 (setext = ! [X4,X0] : (! [X2] : ((in @ X2 @ X0) => (in @ X2 @ X4)) => (! [X2] : ((in @ X2 @ X4) => (in @ X2 @ X0)) => (X0 = X4))))),
% 0.23/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setext)).
% 0.23/0.49 thf(f29,plain,(
% 0.23/0.49 (dsetconstrER = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ (dsetconstr @ Y1 @ (^[Y3 : $i]: (Y2 @ Y3)))) => (Y2 @ Y0)))))))))),
% 0.23/0.49 inference(cnf_transformation,[],[f15])).
% 0.23/0.49 thf(f15,plain,(
% 0.23/0.49 (dsetconstrER = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ (dsetconstr @ Y1 @ (^[Y3 : $i]: (Y2 @ Y3)))) => (Y2 @ Y0)))))))))),
% 0.23/0.49 inference(fool_elimination,[],[f14])).
% 0.23/0.49 thf(f14,plain,(
% 0.23/0.49 (dsetconstrER = ! [X0 : $i > $o,X1,X2] : ((in @ X2 @ (dsetconstr @ X1 @ (^[X3 : $i] : (X0 @ X3)))) => (X0 @ X2)))),
% 0.23/0.49 inference(rectify,[],[f3])).
% 0.23/0.50 thf(f3,axiom,(
% 0.23/0.50 (dsetconstrER = ! [X1 : $i > $o,X0,X2] : ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))) => (X1 @ X2)))),
% 0.23/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrER)).
% 0.23/0.50 thf(f31,plain,(
% 0.23/0.50 (dsetconstrEL = (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (dsetconstr @ Y2 @ (^[Y3 : $i]: (Y1 @ Y3)))) => (in @ Y0 @ Y2)))))))))),
% 0.23/0.50 inference(cnf_transformation,[],[f13])).
% 0.23/0.50 thf(f13,plain,(
% 0.23/0.50 (dsetconstrEL = (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (dsetconstr @ Y2 @ (^[Y3 : $i]: (Y1 @ Y3)))) => (in @ Y0 @ Y2)))))))))),
% 0.23/0.50 inference(fool_elimination,[],[f12])).
% 0.23/0.50 thf(f12,plain,(
% 0.23/0.50 (dsetconstrEL = ! [X0,X1 : $i > $o,X2] : ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))) => (in @ X2 @ X0)))),
% 0.23/0.50 inference(rectify,[],[f2])).
% 0.23/0.50 thf(f2,axiom,(
% 0.23/0.50 (dsetconstrEL = ! [X0,X1 : $i > $o,X2] : ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))) => (in @ X2 @ X0)))),
% 0.23/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrEL)).
% 0.23/0.50 thf(f34,plain,(
% 0.23/0.50 (dsetconstrI = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ Y0) => ((Y2 @ Y1) => (in @ Y1 @ (dsetconstr @ Y0 @ (^[Y3 : $i]: (Y2 @ Y3)))))))))))))),
% 0.23/0.50 inference(cnf_transformation,[],[f28])).
% 0.23/0.50 thf(f28,plain,(
% 0.23/0.50 (dsetconstrI = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ Y0) => ((Y2 @ Y1) => (in @ Y1 @ (dsetconstr @ Y0 @ (^[Y3 : $i]: (Y2 @ Y3)))))))))))))),
% 0.23/0.50 inference(fool_elimination,[],[f27])).
% 0.23/0.50 thf(f27,plain,(
% 0.23/0.50 (! [X0 : $i > $o,X1,X2] : ((in @ X1 @ X2) => ((X0 @ X1) => (in @ X1 @ (dsetconstr @ X2 @ (^[X3 : $i] : (X0 @ X3)))))) = dsetconstrI)),
% 0.23/0.50 inference(rectify,[],[f1])).
% 0.23/0.50 thf(f1,axiom,(
% 0.23/0.50 (! [X1 : $i > $o,X2,X0] : ((in @ X2 @ X0) => ((X1 @ X2) => (in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))))) = dsetconstrI)),
% 0.23/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrI)).
% 0.23/0.50 thf(f37,plain,(
% 0.23/0.50 ((~ (dsetconstrI => (dsetconstrEL => (dsetconstrER => (setext => (uniqinunit => (eqinunit => (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((Y1 @ Y2) => ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((Y1 @ Y3) => (Y2 = Y3))))) => (ex1 @ Y0 @ (^[Y3 : $i]: (Y1 @ Y3))))))))))))))))))) = $true)),
% 0.23/0.50 inference(cnf_transformation,[],[f26])).
% 0.23/0.50 thf(f26,plain,(
% 0.23/0.50 ((~ (dsetconstrI => (dsetconstrEL => (dsetconstrER => (setext => (uniqinunit => (eqinunit => (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((Y1 @ Y2) => ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((Y1 @ Y3) => (Y2 = Y3))))) => (ex1 @ Y0 @ (^[Y3 : $i]: (Y1 @ Y3))))))))))))))))))) = $true)),
% 0.23/0.50 inference(fool_elimination,[],[f25])).
% 0.23/0.50 thf(f25,plain,(
% 0.23/0.50 ~(dsetconstrI => (dsetconstrEL => (dsetconstrER => (setext => (uniqinunit => (eqinunit => ! [X0,X1 : $i > $o,X2] : ((in @ X0 @ X2) => ((X1 @ X0) => (! [X3] : ((in @ X3 @ X2) => ((X1 @ X3) => (X0 = X3))) => (ex1 @ X2 @ (^[X4 : $i] : (X1 @ X4))))))))))))),
% 0.23/0.50 inference(rectify,[],[f10])).
% 0.23/0.50 thf(f10,negated_conjecture,(
% 0.23/0.50 ~(dsetconstrI => (dsetconstrEL => (dsetconstrER => (setext => (uniqinunit => (eqinunit => ! [X2,X1 : $i > $o,X0] : ((in @ X2 @ X0) => ((X1 @ X2) => (! [X3] : ((in @ X3 @ X0) => ((X1 @ X3) => (X2 = X3))) => (ex1 @ X0 @ (^[X3 : $i] : (X1 @ X3))))))))))))),
% 0.23/0.50 inference(negated_conjecture,[],[f9])).
% 0.23/0.50 thf(f9,conjecture,(
% 0.23/0.50 dsetconstrI => (dsetconstrEL => (dsetconstrER => (setext => (uniqinunit => (eqinunit => ! [X2,X1 : $i > $o,X0] : ((in @ X2 @ X0) => ((X1 @ X2) => (! [X3] : ((in @ X3 @ X0) => ((X1 @ X3) => (X2 = X3))) => (ex1 @ X0 @ (^[X3 : $i] : (X1 @ X3)))))))))))),
% 0.23/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ex1I)).
% 0.23/0.50 thf(f560,plain,(
% 0.23/0.50 ($true = (~ (in @ sK6 @ sK2))) | ~spl0_1),
% 0.23/0.50 inference(boolean_simplification,[],[f559])).
% 0.23/0.50 thf(f559,plain,(
% 0.23/0.50 (((in @ sK6 @ sK2) => $false) = $true) | ~spl0_1),
% 0.23/0.50 inference(backward_demodulation,[],[f541,f557])).
% 0.23/0.50 thf(f557,plain,(
% 0.23/0.50 ($false = (sK4 = sK6)) | ~spl0_1),
% 0.23/0.50 inference(not_proxy_clausification,[],[f552])).
% 0.23/0.50 thf(f552,plain,(
% 0.23/0.50 ((~ (sK4 = sK6)) = $true) | ~spl0_1),
% 0.23/0.50 inference(boolean_simplification,[],[f544])).
% 0.23/0.50 thf(f544,plain,(
% 0.23/0.50 ($true = ((sK4 = sK6) => $false)) | ~spl0_1),
% 0.23/0.50 inference(superposition,[],[f108,f537])).
% 0.23/0.50 thf(f537,plain,(
% 0.23/0.50 ($false = (in @ sK6 @ (setadjoin @ sK4 @ emptyset))) | ~spl0_1),
% 0.23/0.50 inference(boolean_simplification,[],[f536])).
% 0.23/0.50 thf(f536,plain,(
% 0.23/0.50 ($false = ($true => (in @ sK6 @ (setadjoin @ sK4 @ emptyset)))) | ~spl0_1),
% 0.23/0.50 inference(backward_demodulation,[],[f527,f532])).
% 0.23/0.50 thf(f108,plain,(
% 0.23/0.50 ( ! [X2 : $i,X1 : $i] : ((((X2 = X1) => (in @ X1 @ (setadjoin @ X2 @ emptyset))) = $true)) )),
% 0.23/0.50 inference(beta_eta_normalization,[],[f107])).
% 0.23/0.50 thf(f107,plain,(
% 0.23/0.50 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: ((Y0 = X1) => (in @ X1 @ (setadjoin @ Y0 @ emptyset)))) @ X2) = $true)) )),
% 0.23/0.50 inference(pi_clausification,[],[f106])).
% 0.23/0.50 thf(f106,plain,(
% 0.23/0.50 ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((Y0 = X1) => (in @ X1 @ (setadjoin @ Y0 @ emptyset))))))) )),
% 0.23/0.50 inference(beta_eta_normalization,[],[f105])).
% 0.23/0.50 thf(f105,plain,(
% 0.23/0.50 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset)))))) @ X1) = $true)) )),
% 0.23/0.50 inference(pi_clausification,[],[f100])).
% 0.23/0.50 thf(f100,plain,(
% 0.23/0.50 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset))))))) = $true)),
% 0.23/0.50 inference(binary_proxy_clausification,[],[f78])).
% 0.23/0.50 thf(f78,plain,(
% 0.23/0.50 ($false = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset))))))) => (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((Y1 @ Y2) => ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((Y1 @ Y3) => (Y2 = Y3))))) => (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ (dsetconstr @ Y0 @ Y1)) & ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y0 @ Y1))))))))))))))))),
% 0.23/0.50 inference(binary_proxy_clausification,[],[f75])).
% 0.23/0.50 thf(f75,plain,(
% 0.23/0.50 ($false = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setadjoin @ Y1 @ emptyset)) => (Y1 = Y0)))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset))))))) => (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((Y1 @ Y2) => ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((Y1 @ Y3) => (Y2 = Y3))))) => (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ (dsetconstr @ Y0 @ Y1)) & ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y0 @ Y1)))))))))))))))))),
% 0.23/0.50 inference(boolean_simplification,[],[f74])).
% 0.23/0.50 thf(f74,plain,(
% 0.23/0.50 ($false = ($true => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setadjoin @ Y1 @ emptyset)) => (Y1 = Y0)))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset))))))) => (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((Y1 @ Y2) => ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((Y1 @ Y3) => (Y2 = Y3))))) => (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ (dsetconstr @ Y0 @ Y1)) & ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y0 @ Y1))))))))))))))))))),
% 0.23/0.50 inference(backward_demodulation,[],[f71,f73])).
% 0.23/0.50 thf(f73,plain,(
% 0.23/0.50 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (in @ Y2 @ Y1)))) => ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (Y1 = Y0))))))))),
% 0.23/0.50 inference(binary_proxy_clausification,[],[f71])).
% 0.23/0.50 thf(f71,plain,(
% 0.23/0.50 ($false = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (in @ Y2 @ Y1)))) => ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (Y1 = Y0))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setadjoin @ Y1 @ emptyset)) => (Y1 = Y0)))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset))))))) => (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((Y1 @ Y2) => ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((Y1 @ Y3) => (Y2 = Y3))))) => (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ (dsetconstr @ Y0 @ Y1)) & ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y0 @ Y1))))))))))))))))))),
% 0.23/0.50 inference(boolean_simplification,[],[f70])).
% 0.23/0.50 thf(f70,plain,(
% 0.23/0.50 ($false = ($true => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (in @ Y2 @ Y1)))) => ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (Y1 = Y0))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setadjoin @ Y1 @ emptyset)) => (Y1 = Y0)))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset))))))) => (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((Y1 @ Y2) => ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((Y1 @ Y3) => (Y2 = Y3))))) => (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ (dsetconstr @ Y0 @ Y1)) & ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y0 @ Y1)))))))))))))))))))),
% 0.23/0.50 inference(backward_demodulation,[],[f48,f69])).
% 0.23/0.50 thf(f69,plain,(
% 0.23/0.50 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ (dsetconstr @ Y1 @ Y2)) => (Y2 @ Y0)))))))) = $true)),
% 0.23/0.50 inference(binary_proxy_clausification,[],[f48])).
% 0.23/0.50 thf(f48,plain,(
% 0.23/0.50 ($false = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ (dsetconstr @ Y1 @ Y2)) => (Y2 @ Y0)))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (in @ Y2 @ Y1)))) => ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (Y1 = Y0))))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setadjoin @ Y1 @ emptyset)) => (Y1 = Y0)))))) => ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((Y1 = Y0) => (in @ Y0 @ (setadjoin @ Y1 @ emptyset))))))) => (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((Y1 @ Y2) => ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((Y1 @ Y3) => (Y2 = Y3))))) => (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ (dsetconstr @ Y0 @ Y1)) & ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y0 @ Y1)))))))))))))))))))),
% 0.23/0.50 inference(binary_proxy_clausification,[],[f47])).
% 0.23/0.50 thf(f541,plain,(
% 0.23/0.50 (((in @ sK6 @ sK2) => (sK4 = sK6)) = $true) | ~spl0_1),
% 0.23/0.50 inference(boolean_simplification,[],[f538])).
% 0.23/0.50 thf(f538,plain,(
% 0.23/0.50 ($true = ((in @ sK6 @ sK2) => ($true => (sK4 = sK6)))) | ~spl0_1),
% 0.23/0.50 inference(superposition,[],[f177,f535])).
% 0.23/0.50 thf(f535,plain,(
% 0.23/0.50 ($true = (sK3 @ sK6)) | ~spl0_1),
% 0.23/0.50 inference(trivial_inequality_removal,[],[f534])).
% 0.23/0.50 thf(f534,plain,(
% 0.23/0.50 ($false = $true) | ($true = (sK3 @ sK6)) | ~spl0_1),
% 0.23/0.50 inference(boolean_simplification,[],[f533])).
% 0.23/0.50 thf(f533,plain,(
% 0.23/0.50 ($false = ($false => (in @ sK6 @ (setadjoin @ sK4 @ emptyset)))) | ($true = (sK3 @ sK6)) | ~spl0_1),
% 0.23/0.50 inference(superposition,[],[f527,f93])).
% 0.23/0.50 thf(f93,plain,(
% 0.23/0.50 ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : (($false = (in @ X1 @ (dsetconstr @ X2 @ X3))) | ($true = (X3 @ X1))) )),
% 0.23/0.50 inference(binary_proxy_clausification,[],[f92])).
% 0.23/0.50 thf(f92,plain,(
% 0.23/0.50 ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : ((((in @ X1 @ (dsetconstr @ X2 @ X3)) => (X3 @ X1)) = $true)) )),
% 0.23/0.50 inference(beta_eta_normalization,[],[f91])).
% 0.23/0.50 thf(f91,plain,(
% 0.23/0.50 ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : ((((^[Y0 : $i > $o]: ((in @ X1 @ (dsetconstr @ X2 @ Y0)) => (Y0 @ X1))) @ X3) = $true)) )),
% 0.23/0.50 inference(pi_clausification,[],[f90])).
% 0.23/0.50 thf(f90,plain,(
% 0.23/0.50 ( ! [X2 : $i,X1 : $i] : (($true = (!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((in @ X1 @ (dsetconstr @ X2 @ Y0)) => (Y0 @ X1)))))) )),
% 0.23/0.50 inference(beta_eta_normalization,[],[f89])).
% 0.23/0.50 thf(f89,plain,(
% 0.23/0.50 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((in @ X1 @ (dsetconstr @ Y0 @ Y1)) => (Y1 @ X1))))) @ X2) = $true)) )),
% 0.23/0.50 inference(pi_clausification,[],[f77])).
% 0.23/0.50 thf(f77,plain,(
% 0.23/0.50 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((in @ X1 @ (dsetconstr @ Y0 @ Y1)) => (Y1 @ X1)))))) = $true)) )),
% 0.23/0.50 inference(beta_eta_normalization,[],[f76])).
% 0.23/0.50 thf(f76,plain,(
% 0.23/0.50 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ (dsetconstr @ Y1 @ Y2)) => (Y2 @ Y0))))))) @ X1))) )),
% 0.23/0.50 inference(pi_clausification,[],[f69])).
% 0.23/0.50 thf(f177,plain,(
% 0.23/0.50 ( ! [X1 : $i] : (($true = ((in @ X1 @ sK2) => ((sK3 @ X1) => (sK4 = X1))))) )),
% 0.23/0.50 inference(beta_eta_normalization,[],[f176])).
% 0.23/0.50 thf(f176,plain,(
% 0.23/0.50 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ((in @ Y0 @ sK2) => ((sK3 @ Y0) => (sK4 = Y0)))) @ X1))) )),
% 0.23/0.50 inference(pi_clausification,[],[f164])).
% 0.23/0.50 thf(f164,plain,(
% 0.23/0.50 ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ sK2) => ((sK3 @ Y0) => (sK4 = Y0))))) = $true)),
% 0.23/0.50 inference(binary_proxy_clausification,[],[f133])).
% 0.23/0.50 thf(f133,plain,(
% 0.23/0.50 (((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ sK2) => ((sK3 @ Y0) => (sK4 = Y0))))) => (?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK2 @ sK3)) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ sK2 @ sK3)))))) = $false)),
% 0.23/0.50 inference(binary_proxy_clausification,[],[f116])).
% 0.23/0.50 thf(f116,plain,(
% 0.23/0.50 (((sK3 @ sK4) => ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ sK2) => ((sK3 @ Y0) => (sK4 = Y0))))) => (?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK2 @ sK3)) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ sK2 @ sK3))))))) = $false)),
% 0.23/0.50 inference(binary_proxy_clausification,[],[f115])).
% 0.23/0.50 thf(f115,plain,(
% 0.23/0.50 ($false = ((in @ sK4 @ sK2) => ((sK3 @ sK4) => ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ sK2) => ((sK3 @ Y0) => (sK4 = Y0))))) => (?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK2 @ sK3)) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ sK2 @ sK3)))))))))),
% 0.23/0.50 inference(beta_eta_normalization,[],[f114])).
% 0.23/0.50 thf(f114,plain,(
% 0.23/0.50 ($false = ((^[Y0 : $i]: ((in @ Y0 @ sK2) => ((sK3 @ Y0) => ((!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ sK2) => ((sK3 @ Y1) => (Y0 = Y1))))) => (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (dsetconstr @ sK2 @ sK3)) & ((setadjoin @ Y1 @ emptyset) = (dsetconstr @ sK2 @ sK3))))))))) @ sK4))),
% 0.23/0.50 inference(sigma_clausification,[],[f113])).
% 0.23/0.50 thf(f113,plain,(
% 0.23/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ sK2) => ((sK3 @ Y0) => ((!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ sK2) => ((sK3 @ Y1) => (Y0 = Y1))))) => (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (dsetconstr @ sK2 @ sK3)) & ((setadjoin @ Y1 @ emptyset) = (dsetconstr @ sK2 @ sK3)))))))))))),
% 0.23/0.50 inference(beta_eta_normalization,[],[f112])).
% 0.23/0.50 thf(f112,plain,(
% 0.23/0.50 ($false = ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ sK2) => ((Y0 @ Y1) => ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ sK2) => ((Y0 @ Y2) => (Y1 = Y2))))) => (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (dsetconstr @ sK2 @ Y0)) & ((setadjoin @ Y2 @ emptyset) = (dsetconstr @ sK2 @ Y0))))))))))) @ sK3))),
% 0.23/0.50 inference(sigma_clausification,[],[f111])).
% 0.23/0.50 thf(f111,plain,(
% 0.23/0.50 ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ sK2) => ((Y0 @ Y1) => ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ sK2) => ((Y0 @ Y2) => (Y1 = Y2))))) => (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (dsetconstr @ sK2 @ Y0)) & ((setadjoin @ Y2 @ emptyset) = (dsetconstr @ sK2 @ Y0)))))))))))) = $false)),
% 0.23/0.50 inference(beta_eta_normalization,[],[f110])).
% 0.23/0.50 thf(f110,plain,(
% 0.23/0.50 ($false = ((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((Y1 @ Y2) => ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((Y1 @ Y3) => (Y2 = Y3))))) => (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ (dsetconstr @ Y0 @ Y1)) & ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y0 @ Y1))))))))))))) @ sK2))),
% 0.23/0.50 inference(sigma_clausification,[],[f99])).
% 0.23/0.50 thf(f99,plain,(
% 0.23/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((Y1 @ Y2) => ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((Y1 @ Y3) => (Y2 = Y3))))) => (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ (dsetconstr @ Y0 @ Y1)) & ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y0 @ Y1)))))))))))))))),
% 0.23/0.50 inference(binary_proxy_clausification,[],[f78])).
% 0.23/0.50 thf(f492,plain,(
% 0.23/0.50 ~spl0_2),
% 0.23/0.50 inference(avatar_contradiction_clause,[],[f491])).
% 0.23/0.50 thf(f491,plain,(
% 0.23/0.50 $false | ~spl0_2),
% 0.23/0.50 inference(trivial_inequality_removal,[],[f490])).
% 0.23/0.50 thf(f490,plain,(
% 0.23/0.50 ($false = $true) | ~spl0_2),
% 0.23/0.50 inference(boolean_simplification,[],[f489])).
% 0.23/0.50 thf(f489,plain,(
% 0.23/0.50 ((~ $true) = $true) | ~spl0_2),
% 0.23/0.50 inference(forward_demodulation,[],[f488,f134])).
% 0.23/0.50 thf(f134,plain,(
% 0.23/0.50 ((sK3 @ sK4) = $true)),
% 0.23/0.50 inference(binary_proxy_clausification,[],[f116])).
% 0.23/0.50 thf(f488,plain,(
% 0.23/0.50 ((~ (sK3 @ sK4)) = $true) | ~spl0_2),
% 0.23/0.50 inference(boolean_simplification,[],[f487])).
% 0.23/0.50 thf(f487,plain,(
% 0.23/0.50 (($true => (~ (sK3 @ sK4))) = $true) | ~spl0_2),
% 0.23/0.50 inference(forward_demodulation,[],[f481,f117])).
% 0.23/0.50 thf(f117,plain,(
% 0.23/0.50 ((in @ sK4 @ sK2) = $true)),
% 0.23/0.50 inference(binary_proxy_clausification,[],[f115])).
% 0.23/0.50 thf(f481,plain,(
% 0.23/0.50 (((in @ sK4 @ sK2) => (~ (sK3 @ sK4))) = $true) | ~spl0_2),
% 0.23/0.50 inference(backward_demodulation,[],[f399,f460])).
% 0.23/0.50 thf(f460,plain,(
% 0.23/0.50 (sK5 = sK4) | ~spl0_2),
% 0.23/0.50 inference(equality_proxy_clausification,[],[f384])).
% 0.23/0.50 thf(f384,plain,(
% 0.23/0.50 ((sK4 = sK5) = $true) | ~spl0_2),
% 0.23/0.50 inference(boolean_simplification,[],[f377])).
% 0.23/0.50 thf(f377,plain,(
% 0.23/0.50 (($true => (sK4 = sK5)) = $true) | ~spl0_2),
% 0.23/0.50 inference(superposition,[],[f87,f371])).
% 0.23/0.50 thf(f371,plain,(
% 0.23/0.50 ((in @ sK5 @ (setadjoin @ sK4 @ emptyset)) = $true) | ~spl0_2),
% 0.23/0.50 inference(binary_proxy_clausification,[],[f369])).
% 0.23/0.50 thf(f369,plain,(
% 0.23/0.50 ($false = ((in @ sK5 @ (setadjoin @ sK4 @ emptyset)) => (in @ sK5 @ (dsetconstr @ sK2 @ sK3)))) | ~spl0_2),
% 0.23/0.50 inference(beta_eta_normalization,[],[f363])).
% 0.23/0.50 thf(f363,plain,(
% 0.23/0.50 ($false = ((^[Y0 : $i]: ((in @ Y0 @ (setadjoin @ sK4 @ emptyset)) => (in @ Y0 @ (dsetconstr @ sK2 @ sK3)))) @ sK5)) | ~spl0_2),
% 0.23/0.50 inference(sigma_clausification,[],[f360])).
% 0.23/0.50 thf(f360,plain,(
% 0.23/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (setadjoin @ sK4 @ emptyset)) => (in @ Y0 @ (dsetconstr @ sK2 @ sK3)))))) | ~spl0_2),
% 0.23/0.50 inference(not_proxy_clausification,[],[f337])).
% 0.23/0.50 thf(f337,plain,(
% 0.23/0.50 ((~ (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (setadjoin @ sK4 @ emptyset)) => (in @ Y0 @ (dsetconstr @ sK2 @ sK3)))))) = $true) | ~spl0_2),
% 0.23/0.50 inference(avatar_component_clause,[],[f336])).
% 0.23/0.50 thf(f336,plain,(
% 0.23/0.50 spl0_2 <=> ((~ (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (setadjoin @ sK4 @ emptyset)) => (in @ Y0 @ (dsetconstr @ sK2 @ sK3)))))) = $true)),
% 0.23/0.50 introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
% 0.23/0.50 thf(f87,plain,(
% 0.23/0.50 ( ! [X2 : $i,X1 : $i] : ((((in @ X1 @ (setadjoin @ X2 @ emptyset)) => (X2 = X1)) = $true)) )),
% 0.23/0.50 inference(beta_eta_normalization,[],[f86])).
% 0.23/0.50 thf(f86,plain,(
% 0.23/0.50 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: ((in @ X1 @ (setadjoin @ Y0 @ emptyset)) => (Y0 = X1))) @ X2) = $true)) )),
% 0.23/0.50 inference(pi_clausification,[],[f85])).
% 0.23/0.50 thf(f85,plain,(
% 0.23/0.50 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((in @ X1 @ (setadjoin @ Y0 @ emptyset)) => (Y0 = X1)))) = $true)) )),
% 0.23/0.50 inference(beta_eta_normalization,[],[f84])).
% 0.23/0.50 thf(f84,plain,(
% 0.23/0.50 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setadjoin @ Y1 @ emptyset)) => (Y1 = Y0))))) @ X1))) )),
% 0.23/0.50 inference(pi_clausification,[],[f79])).
% 0.23/0.50 thf(f79,plain,(
% 0.23/0.50 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setadjoin @ Y1 @ emptyset)) => (Y1 = Y0)))))) = $true)),
% 0.23/0.50 inference(binary_proxy_clausification,[],[f75])).
% 0.23/0.50 thf(f399,plain,(
% 0.23/0.50 ($true = ((in @ sK5 @ sK2) => (~ (sK3 @ sK5)))) | ~spl0_2),
% 0.23/0.50 inference(boolean_simplification,[],[f390])).
% 0.23/0.50 thf(f390,plain,(
% 0.23/0.50 (((in @ sK5 @ sK2) => ((sK3 @ sK5) => $false)) = $true) | ~spl0_2),
% 0.23/0.50 inference(superposition,[],[f66,f370])).
% 0.23/0.50 thf(f370,plain,(
% 0.23/0.50 ($false = (in @ sK5 @ (dsetconstr @ sK2 @ sK3))) | ~spl0_2),
% 0.23/0.50 inference(binary_proxy_clausification,[],[f369])).
% 0.23/0.50 thf(f66,plain,(
% 0.23/0.50 ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : (($true = ((in @ X2 @ X1) => ((X3 @ X2) => (in @ X2 @ (dsetconstr @ X1 @ X3)))))) )),
% 0.23/0.50 inference(beta_eta_normalization,[],[f65])).
% 0.23/0.50 thf(f65,plain,(
% 0.23/0.50 ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : (($true = ((^[Y0 : $i > $o]: ((in @ X2 @ X1) => ((Y0 @ X2) => (in @ X2 @ (dsetconstr @ X1 @ Y0))))) @ X3))) )),
% 0.23/0.50 inference(pi_clausification,[],[f64])).
% 0.23/0.50 thf(f64,plain,(
% 0.23/0.50 ( ! [X2 : $i,X1 : $i] : (($true = (!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((in @ X2 @ X1) => ((Y0 @ X2) => (in @ X2 @ (dsetconstr @ X1 @ Y0)))))))) )),
% 0.23/0.50 inference(beta_eta_normalization,[],[f63])).
% 0.23/0.50 thf(f63,plain,(
% 0.23/0.50 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((in @ Y0 @ X1) => ((Y1 @ Y0) => (in @ Y0 @ (dsetconstr @ X1 @ Y1))))))) @ X2) = $true)) )),
% 0.23/0.50 inference(pi_clausification,[],[f62])).
% 0.23/0.50 thf(f62,plain,(
% 0.23/0.50 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((in @ Y0 @ X1) => ((Y1 @ Y0) => (in @ Y0 @ (dsetconstr @ X1 @ Y1)))))))) = $true)) )),
% 0.23/0.50 inference(beta_eta_normalization,[],[f61])).
% 0.23/0.50 thf(f61,plain,(
% 0.23/0.50 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ Y0) => ((Y2 @ Y1) => (in @ Y1 @ (dsetconstr @ Y0 @ Y2))))))))) @ X1))) )),
% 0.23/0.50 inference(pi_clausification,[],[f45])).
% 0.23/0.50 thf(f338,plain,(
% 0.23/0.50 spl0_1 | spl0_2),
% 0.23/0.50 inference(avatar_split_clause,[],[f331,f336,f333])).
% 0.23/0.50 thf(f331,plain,(
% 0.23/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK2 @ sK3)) => (in @ Y0 @ (setadjoin @ sK4 @ emptyset)))))) | ((~ (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (setadjoin @ sK4 @ emptyset)) => (in @ Y0 @ (dsetconstr @ sK2 @ sK3)))))) = $true)),
% 0.23/0.50 inference(binary_proxy_clausification,[],[f250])).
% 0.23/0.50 thf(f250,plain,(
% 0.23/0.50 (((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK2 @ sK3)) => (in @ Y0 @ (setadjoin @ sK4 @ emptyset))))) => (~ (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (setadjoin @ sK4 @ emptyset)) => (in @ Y0 @ (dsetconstr @ sK2 @ sK3))))))) = $true)),
% 0.23/0.50 inference(boolean_simplification,[],[f240])).
% 0.23/0.50 thf(f240,plain,(
% 0.23/0.50 (((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK2 @ sK3)) => (in @ Y0 @ (setadjoin @ sK4 @ emptyset))))) => ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (setadjoin @ sK4 @ emptyset)) => (in @ Y0 @ (dsetconstr @ sK2 @ sK3))))) => $false)) = $true)),
% 0.23/0.50 inference(superposition,[],[f97,f236])).
% 0.23/0.50 thf(f236,plain,(
% 0.23/0.50 (((setadjoin @ sK4 @ emptyset) = (dsetconstr @ sK2 @ sK3)) = $false)),
% 0.23/0.50 inference(boolean_simplification,[],[f235])).
% 0.23/0.50 thf(f235,plain,(
% 0.23/0.50 ($false = ($true & ((setadjoin @ sK4 @ emptyset) = (dsetconstr @ sK2 @ sK3))))),
% 0.23/0.50 inference(superposition,[],[f214,f142])).
% 0.23/0.50 thf(f142,plain,(
% 0.23/0.50 ((in @ sK4 @ (dsetconstr @ sK2 @ sK3)) = $true)),
% 0.23/0.50 inference(boolean_simplification,[],[f139])).
% 0.23/0.50 thf(f139,plain,(
% 0.23/0.50 ($true = ($true => (in @ sK4 @ (dsetconstr @ sK2 @ sK3))))),
% 0.23/0.50 inference(superposition,[],[f127,f134])).
% 0.23/0.50 thf(f127,plain,(
% 0.23/0.50 ( ! [X0 : $i > $o] : (($true = ((X0 @ sK4) => (in @ sK4 @ (dsetconstr @ sK2 @ X0))))) )),
% 0.23/0.50 inference(boolean_simplification,[],[f122])).
% 0.23/0.50 thf(f122,plain,(
% 0.23/0.50 ( ! [X0 : $i > $o] : (($true = ($true => ((X0 @ sK4) => (in @ sK4 @ (dsetconstr @ sK2 @ X0)))))) )),
% 0.23/0.50 inference(superposition,[],[f66,f117])).
% 0.23/0.50 thf(f214,plain,(
% 0.23/0.50 ( ! [X1 : $i] : (($false = ((in @ X1 @ (dsetconstr @ sK2 @ sK3)) & ((setadjoin @ X1 @ emptyset) = (dsetconstr @ sK2 @ sK3))))) )),
% 0.23/0.50 inference(beta_eta_normalization,[],[f213])).
% 0.23/0.50 thf(f213,plain,(
% 0.23/0.50 ( ! [X1 : $i] : (($false = ((^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK2 @ sK3)) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ sK2 @ sK3)))) @ X1))) )),
% 0.23/0.50 inference(pi_clausification,[],[f163])).
% 0.23/0.50 thf(f163,plain,(
% 0.23/0.50 ($false = (?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK2 @ sK3)) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ sK2 @ sK3))))))),
% 0.23/0.50 inference(binary_proxy_clausification,[],[f133])).
% 0.23/0.50 thf(f97,plain,(
% 0.23/0.50 ( ! [X2 : $i,X1 : $i] : ((((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X1) => (in @ Y0 @ X2)))) => ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X2) => (in @ Y0 @ X1)))) => (X2 = X1))) = $true)) )),
% 0.23/0.50 inference(beta_eta_normalization,[],[f96])).
% 0.23/0.50 thf(f96,plain,(
% 0.23/0.50 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ X1) => (in @ Y1 @ Y0)))) => ((!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ X1)))) => (Y0 = X1)))) @ X2) = $true)) )),
% 0.23/0.50 inference(pi_clausification,[],[f95])).
% 0.23/0.50 thf(f95,plain,(
% 0.23/0.50 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ X1) => (in @ Y1 @ Y0)))) => ((!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ X1)))) => (Y0 = X1))))) = $true)) )),
% 0.23/0.50 inference(beta_eta_normalization,[],[f94])).
% 0.23/0.50 thf(f94,plain,(
% 0.23/0.50 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (in @ Y2 @ Y1)))) => ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (Y1 = Y0)))))) @ X1) = $true)) )),
% 0.23/0.50 inference(pi_clausification,[],[f73])).
% 0.23/0.50 % SZS output end Proof for theBenchmark
% 0.23/0.50 % (2537)------------------------------
% 0.23/0.50 % (2537)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.50 % (2537)Termination reason: Refutation
% 0.23/0.50
% 0.23/0.50 % (2537)Memory used [KB]: 6268
% 0.23/0.50 % (2537)Time elapsed: 0.076 s
% 0.23/0.50 % (2537)Instructions burned: 117 (million)
% 0.23/0.50 % (2537)------------------------------
% 0.23/0.50 % (2537)------------------------------
% 0.23/0.50 % (2525)Success in time 0.129 s
% 0.23/0.50 % Vampire---4.8 exiting
%------------------------------------------------------------------------------