TSTP Solution File: SEU757^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU757^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 : n019.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:51:18 EDT 2024
% Result : Theorem 0.21s 0.48s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU757^2 : TPTP v8.2.0. Released v3.7.0.
% 0.14/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.15/0.35 % Computer : n019.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 17:35:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH0_THM_EQU_NAR problem
% 0.15/0.35 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.21/0.36 % (941)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.21/0.37 % (941)Instruction limit reached!
% 0.21/0.37 % (941)------------------------------
% 0.21/0.37 % (941)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (941)Termination reason: Unknown
% 0.21/0.37 % (941)Termination phase: Property scanning
% 0.21/0.37
% 0.21/0.37 % (941)Memory used [KB]: 1023
% 0.21/0.37 % (941)Time elapsed: 0.002 s
% 0.21/0.37 % (941)Instructions burned: 4 (million)
% 0.21/0.37 % (941)------------------------------
% 0.21/0.37 % (941)------------------------------
% 0.21/0.37 % (935)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 (3000ds/4Mi)
% 0.21/0.37 % (934)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.21/0.37 % (937)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.21/0.37 % (938)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 (3000ds/2Mi)
% 0.21/0.37 % (939)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 (3000ds/275Mi)
% 0.21/0.37 % (936)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 (3000ds/27Mi)
% 0.21/0.37 % (940)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.21/0.37 % (938)Instruction limit reached!
% 0.21/0.37 % (938)------------------------------
% 0.21/0.37 % (938)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (938)Termination reason: Unknown
% 0.21/0.37 % (938)Termination phase: shuffling
% 0.21/0.37
% 0.21/0.37 % (938)Memory used [KB]: 895
% 0.21/0.37 % (938)Time elapsed: 0.003 s
% 0.21/0.37 % (938)Instructions burned: 2 (million)
% 0.21/0.37 % (938)------------------------------
% 0.21/0.37 % (938)------------------------------
% 0.21/0.37 % (937)Instruction limit reached!
% 0.21/0.37 % (937)------------------------------
% 0.21/0.37 % (937)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (937)Termination reason: Unknown
% 0.21/0.37 % (937)Termination phase: Property scanning
% 0.21/0.37
% 0.21/0.37 % (937)Memory used [KB]: 1023
% 0.21/0.37 % (937)Time elapsed: 0.004 s
% 0.21/0.37 % (937)Instructions burned: 3 (million)
% 0.21/0.37 % (937)------------------------------
% 0.21/0.37 % (937)------------------------------
% 0.21/0.37 % (935)Instruction limit reached!
% 0.21/0.37 % (935)------------------------------
% 0.21/0.37 % (935)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (935)Termination reason: Unknown
% 0.21/0.37 % (935)Termination phase: Property scanning
% 0.21/0.37
% 0.21/0.37 % (935)Memory used [KB]: 1023
% 0.21/0.37 % (935)Time elapsed: 0.005 s
% 0.21/0.37 % (935)Instructions burned: 5 (million)
% 0.21/0.37 % (935)------------------------------
% 0.21/0.37 % (935)------------------------------
% 0.21/0.37 % (942)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.21/0.38 % (940)Instruction limit reached!
% 0.21/0.38 % (940)------------------------------
% 0.21/0.38 % (940)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (940)Termination reason: Unknown
% 0.21/0.38 % (940)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (940)Memory used [KB]: 5628
% 0.21/0.38 % (940)Time elapsed: 0.014 s
% 0.21/0.38 % (940)Instructions burned: 19 (million)
% 0.21/0.38 % (940)------------------------------
% 0.21/0.38 % (940)------------------------------
% 0.21/0.38 % (942)Instruction limit reached!
% 0.21/0.38 % (942)------------------------------
% 0.21/0.38 % (942)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (942)Termination reason: Unknown
% 0.21/0.38 % (942)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (942)Memory used [KB]: 5628
% 0.21/0.38 % (942)Time elapsed: 0.012 s
% 0.21/0.38 % (942)Instructions burned: 37 (million)
% 0.21/0.38 % (942)------------------------------
% 0.21/0.38 % (942)------------------------------
% 0.21/0.39 % (943)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.21/0.39 % (944)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.21/0.39 % (936)Instruction limit reached!
% 0.21/0.39 % (936)------------------------------
% 0.21/0.39 % (936)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (936)Termination reason: Unknown
% 0.21/0.39 % (936)Termination phase: Saturation
% 0.21/0.39
% 0.21/0.39 % (936)Memory used [KB]: 5628
% 0.21/0.39 % (936)Time elapsed: 0.018 s
% 0.21/0.39 % (936)Instructions burned: 28 (million)
% 0.21/0.39 % (936)------------------------------
% 0.21/0.39 % (936)------------------------------
% 0.21/0.39 % (945)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.21/0.39 % (944)Instruction limit reached!
% 0.21/0.39 % (944)------------------------------
% 0.21/0.39 % (944)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (944)Termination reason: Unknown
% 0.21/0.39 % (944)Termination phase: Property scanning
% 0.21/0.39
% 0.21/0.39 % (944)Memory used [KB]: 1023
% 0.21/0.39 % (944)Time elapsed: 0.004 s
% 0.21/0.39 % (944)Instructions burned: 4 (million)
% 0.21/0.39 % (944)------------------------------
% 0.21/0.39 % (944)------------------------------
% 0.21/0.39 % (947)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.21/0.39 % (943)Instruction limit reached!
% 0.21/0.39 % (943)------------------------------
% 0.21/0.39 % (943)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (943)Termination reason: Unknown
% 0.21/0.39 % (943)Termination phase: Saturation
% 0.21/0.39
% 0.21/0.39 % (943)Memory used [KB]: 5628
% 0.21/0.39 % (943)Time elapsed: 0.011 s
% 0.21/0.39 % (943)Instructions burned: 15 (million)
% 0.21/0.39 % (943)------------------------------
% 0.21/0.39 % (943)------------------------------
% 0.21/0.40 % (946)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.21/0.40 % (947)Instruction limit reached!
% 0.21/0.40 % (947)------------------------------
% 0.21/0.40 % (947)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (947)Termination reason: Unknown
% 0.21/0.40 % (947)Termination phase: Saturation
% 0.21/0.40
% 0.21/0.40 % (947)Memory used [KB]: 5884
% 0.21/0.40 % (947)Time elapsed: 0.007 s
% 0.21/0.40 % (947)Instructions burned: 16 (million)
% 0.21/0.40 % (947)------------------------------
% 0.21/0.40 % (947)------------------------------
% 0.21/0.40 % (946)Instruction limit reached!
% 0.21/0.40 % (946)------------------------------
% 0.21/0.40 % (946)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (946)Termination reason: Unknown
% 0.21/0.40 % (946)Termination phase: Saturation
% 0.21/0.40
% 0.21/0.40 % (946)Memory used [KB]: 1023
% 0.21/0.40 % (946)Time elapsed: 0.006 s
% 0.21/0.40 % (946)Instructions burned: 8 (million)
% 0.21/0.40 % (946)------------------------------
% 0.21/0.40 % (946)------------------------------
% 0.21/0.40 % (948)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.21/0.40 % (949)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.21/0.40 % (948)Instruction limit reached!
% 0.21/0.40 % (948)------------------------------
% 0.21/0.40 % (948)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (948)Termination reason: Unknown
% 0.21/0.40 % (948)Termination phase: Preprocessing 3
% 0.21/0.40
% 0.21/0.40 % (948)Memory used [KB]: 1023
% 0.21/0.40 % (948)Time elapsed: 0.004 s
% 0.21/0.40 % (948)Instructions burned: 4 (million)
% 0.21/0.40 % (948)------------------------------
% 0.21/0.40 % (948)------------------------------
% 0.21/0.41 % (951)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.21/0.41 % (949)Instruction limit reached!
% 0.21/0.41 % (949)------------------------------
% 0.21/0.41 % (949)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41 % (949)Termination reason: Unknown
% 0.21/0.41 % (949)Termination phase: Preprocessing 3
% 0.21/0.41
% 0.21/0.41 % (949)Memory used [KB]: 1023
% 0.21/0.41 % (949)Time elapsed: 0.004 s
% 0.21/0.41 % (949)Instructions burned: 4 (million)
% 0.21/0.41 % (949)------------------------------
% 0.21/0.41 % (949)------------------------------
% 0.21/0.41 % (951)Instruction limit reached!
% 0.21/0.41 % (951)------------------------------
% 0.21/0.41 % (951)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41 % (951)Termination reason: Unknown
% 0.21/0.41 % (951)Termination phase: shuffling
% 0.21/0.41
% 0.21/0.41 % (951)Memory used [KB]: 1023
% 0.21/0.41 % (951)Time elapsed: 0.002 s
% 0.21/0.41 % (951)Instructions burned: 3 (million)
% 0.21/0.41 % (951)------------------------------
% 0.21/0.41 % (951)------------------------------
% 0.21/0.41 % (950)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.21/0.41 % (950)Instruction limit reached!
% 0.21/0.41 % (950)------------------------------
% 0.21/0.41 % (950)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41 % (957)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.21/0.41 % (950)Termination reason: Unknown
% 0.21/0.41 % (950)Termination phase: Saturation
% 0.21/0.41
% 0.21/0.41 % (950)Memory used [KB]: 5500
% 0.21/0.41 % (950)Time elapsed: 0.006 s
% 0.21/0.41 % (950)Instructions burned: 7 (million)
% 0.21/0.41 % (950)------------------------------
% 0.21/0.41 % (950)------------------------------
% 0.21/0.41 % (957)Instruction limit reached!
% 0.21/0.41 % (957)------------------------------
% 0.21/0.41 % (957)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (957)Termination reason: Unknown
% 0.21/0.42 % (957)Termination phase: Saturation
% 0.21/0.42
% 0.21/0.42 % (957)Memory used [KB]: 1023
% 0.21/0.42 % (957)Time elapsed: 0.003 s
% 0.21/0.42 % (957)Instructions burned: 6 (million)
% 0.21/0.42 % (957)------------------------------
% 0.21/0.42 % (957)------------------------------
% 0.21/0.42 % (954)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.21/0.42 % (954)Instruction limit reached!
% 0.21/0.42 % (954)------------------------------
% 0.21/0.42 % (954)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (954)Termination reason: Unknown
% 0.21/0.42 % (954)Termination phase: Property scanning
% 0.21/0.42
% 0.21/0.42 % (954)Memory used [KB]: 1023
% 0.21/0.42 % (954)Time elapsed: 0.004 s
% 0.21/0.42 % (954)Instructions burned: 4 (million)
% 0.21/0.42 % (954)------------------------------
% 0.21/0.42 % (954)------------------------------
% 0.21/0.42 % (955)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.21/0.42 % (956)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.21/0.42 % (960)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.21/0.43 % (955)Instruction limit reached!
% 0.21/0.43 % (955)------------------------------
% 0.21/0.43 % (955)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.43 % (955)Termination reason: Unknown
% 0.21/0.43 % (955)Termination phase: Saturation
% 0.21/0.43
% 0.21/0.43 % (955)Memory used [KB]: 5628
% 0.21/0.43 % (955)Time elapsed: 0.012 s
% 0.21/0.43 % (955)Instructions burned: 18 (million)
% 0.21/0.43 % (955)------------------------------
% 0.21/0.43 % (955)------------------------------
% 0.21/0.43 % (958)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.21/0.43 % (960)Instruction limit reached!
% 0.21/0.43 % (960)------------------------------
% 0.21/0.43 % (960)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.43 % (960)Termination reason: Unknown
% 0.21/0.43 % (960)Termination phase: Saturation
% 0.21/0.43
% 0.21/0.43 % (960)Memory used [KB]: 5628
% 0.21/0.43 % (960)Time elapsed: 0.009 s
% 0.21/0.43 % (960)Instructions burned: 22 (million)
% 0.21/0.43 % (960)------------------------------
% 0.21/0.43 % (960)------------------------------
% 0.21/0.43 % (961)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2999ds/5Mi)
% 0.21/0.44 % (958)Refutation not found, incomplete strategy
% 0.21/0.44 % (958)------------------------------
% 0.21/0.44 % (958)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.44 % (958)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.44
% 0.21/0.44 % (961)Instruction limit reached!
% 0.21/0.44 % (961)------------------------------
% 0.21/0.44 % (961)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.44 % (961)Termination reason: Unknown
% 0.21/0.44 % (961)Termination phase: Property scanning
% 0.21/0.44
% 0.21/0.44 % (961)Memory used [KB]: 1023
% 0.21/0.44 % (961)Time elapsed: 0.005 s
% 0.21/0.44 % (961)Instructions burned: 6 (million)
% 0.21/0.44 % (961)------------------------------
% 0.21/0.44 % (961)------------------------------
% 0.21/0.44
% 0.21/0.44 % (958)Memory used [KB]: 5628
% 0.21/0.44 % (958)Time elapsed: 0.008 s
% 0.21/0.44 % (958)Instructions burned: 8 (million)
% 0.21/0.44 % (958)------------------------------
% 0.21/0.44 % (958)------------------------------
% 0.21/0.44 % (972)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on theBenchmark for (2999ds/377Mi)
% 0.21/0.45 % (975)dis+1010_1:4_atotf=0.2:c=on:cbe=off:cnfonf=lazy_simp:fe=off:ins=2:ntd=on:s2a=on:s2at=5.0:sgt=5:ss=axioms:st=1.5:i=779:si=on:rtra=on_0 on theBenchmark for (2999ds/779Mi)
% 0.21/0.45 % (969)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 (2999ds/6Mi)
% 0.21/0.45 % (976)lrs+10_1:1_cnfonf=lazy_not_be_gen:ntd=on:sp=const_min:ss=axioms:sup=off:i=19:si=on:rtra=on_0 on theBenchmark for (2999ds/19Mi)
% 0.21/0.46 % (969)Instruction limit reached!
% 0.21/0.46 % (969)------------------------------
% 0.21/0.46 % (969)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.46 % (969)Termination reason: Unknown
% 0.21/0.46 % (969)Termination phase: Property scanning
% 0.21/0.46
% 0.21/0.46 % (969)Memory used [KB]: 1023
% 0.21/0.46 % (969)Time elapsed: 0.007 s
% 0.21/0.46 % (969)Instructions burned: 6 (million)
% 0.21/0.46 % (969)------------------------------
% 0.21/0.46 % (969)------------------------------
% 0.21/0.46 % (976)Instruction limit reached!
% 0.21/0.46 % (976)------------------------------
% 0.21/0.46 % (976)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.46 % (976)Termination reason: Unknown
% 0.21/0.46 % (976)Termination phase: Saturation
% 0.21/0.46
% 0.21/0.46 % (976)Memory used [KB]: 5500
% 0.21/0.46 % (976)Time elapsed: 0.034 s
% 0.21/0.46 % (976)Instructions burned: 19 (million)
% 0.21/0.46 % (976)------------------------------
% 0.21/0.46 % (976)------------------------------
% 0.21/0.47 % (939)First to succeed.
% 0.21/0.47 % (934)Instruction limit reached!
% 0.21/0.47 % (934)------------------------------
% 0.21/0.47 % (934)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.47 % (934)Termination reason: Unknown
% 0.21/0.47 % (934)Termination phase: Saturation
% 0.21/0.47
% 0.21/0.47 % (934)Memory used [KB]: 6140
% 0.21/0.47 % (934)Time elapsed: 0.106 s
% 0.21/0.47 % (934)Instructions burned: 184 (million)
% 0.21/0.47 % (934)------------------------------
% 0.21/0.47 % (934)------------------------------
% 0.21/0.48 % (978)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on theBenchmark for (2998ds/17Mi)
% 0.21/0.48 % (939)Refutation found. Thanks to Tanya!
% 0.21/0.48 % SZS status Theorem for theBenchmark
% 0.21/0.48 % SZS output start Proof for theBenchmark
% 0.21/0.48 thf(func_def_0, type, in: $i > $i > $o).
% 0.21/0.48 thf(func_def_1, type, powerset: $i > $i).
% 0.21/0.48 thf(func_def_2, type, binunion: $i > $i > $i).
% 0.21/0.48 thf(func_def_3, type, binintersect: $i > $i > $i).
% 0.21/0.48 thf(func_def_4, type, setminus: $i > $i > $i).
% 0.21/0.48 thf(func_def_14, type, sP0: $i > $i > $i > $o).
% 0.21/0.48 thf(func_def_15, type, sK1: $i > $i > $i > $i).
% 0.21/0.48 thf(func_def_16, type, sK2: $i > $i > $i > $i).
% 0.21/0.48 thf(f412,plain,(
% 0.21/0.48 $false),
% 0.21/0.48 inference(avatar_sat_refutation,[],[f342,f368,f385,f395,f411])).
% 0.21/0.48 thf(f411,plain,(
% 0.21/0.48 spl25_4),
% 0.21/0.48 inference(avatar_contradiction_clause,[],[f410])).
% 0.21/0.48 thf(f410,plain,(
% 0.21/0.48 $false | spl25_4),
% 0.21/0.48 inference(subsumption_resolution,[],[f409,f108])).
% 0.21/0.48 thf(f108,plain,(
% 0.21/0.48 ((in @ sK21 @ (powerset @ sK19)) = $true)),
% 0.21/0.48 inference(cnf_transformation,[],[f70])).
% 0.21/0.48 thf(f70,plain,(
% 0.21/0.48 (complementT_lem = $true) & (binintersectT_lem = $true) & (setextT = $true) & (binunionT_lem = $true) & (demorgan2a = $true) & (((in @ sK20 @ (powerset @ sK19)) = $true) & (((binintersect @ (setminus @ sK19 @ sK20) @ (setminus @ sK19 @ sK21)) != (setminus @ sK19 @ (binunion @ sK20 @ sK21))) & ((in @ sK21 @ (powerset @ sK19)) = $true))) & (demorgan2b = $true)),
% 0.21/0.48 inference(skolemisation,[status(esa),new_symbols(skolem,[sK19,sK20,sK21])],[f30,f69,f68])).
% 0.21/0.48 thf(f68,plain,(
% 0.21/0.48 ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (((setminus @ X0 @ (binunion @ X1 @ X2)) != (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) & ((in @ X2 @ (powerset @ X0)) = $true))) => (((in @ sK20 @ (powerset @ sK19)) = $true) & ? [X2] : (((binintersect @ (setminus @ sK19 @ sK20) @ (setminus @ sK19 @ X2)) != (setminus @ sK19 @ (binunion @ sK20 @ X2))) & ($true = (in @ X2 @ (powerset @ sK19)))))),
% 0.21/0.48 introduced(choice_axiom,[])).
% 0.21/0.48 thf(f69,plain,(
% 0.21/0.48 ? [X2] : (((binintersect @ (setminus @ sK19 @ sK20) @ (setminus @ sK19 @ X2)) != (setminus @ sK19 @ (binunion @ sK20 @ X2))) & ($true = (in @ X2 @ (powerset @ sK19)))) => (((binintersect @ (setminus @ sK19 @ sK20) @ (setminus @ sK19 @ sK21)) != (setminus @ sK19 @ (binunion @ sK20 @ sK21))) & ((in @ sK21 @ (powerset @ sK19)) = $true))),
% 0.21/0.48 introduced(choice_axiom,[])).
% 0.21/0.48 thf(f30,plain,(
% 0.21/0.48 (complementT_lem = $true) & (binintersectT_lem = $true) & (setextT = $true) & (binunionT_lem = $true) & (demorgan2a = $true) & ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (((setminus @ X0 @ (binunion @ X1 @ X2)) != (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) & ((in @ X2 @ (powerset @ X0)) = $true))) & (demorgan2b = $true)),
% 0.21/0.48 inference(flattening,[],[f29])).
% 0.21/0.48 thf(f29,plain,(
% 0.21/0.48 (((((? [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (((setminus @ X0 @ (binunion @ X1 @ X2)) != (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) & ((in @ X2 @ (powerset @ X0)) = $true))) & (demorgan2b = $true)) & (demorgan2a = $true)) & (setextT = $true)) & (complementT_lem = $true)) & (binunionT_lem = $true)) & (binintersectT_lem = $true)),
% 0.21/0.48 inference(ennf_transformation,[],[f15])).
% 0.21/0.48 thf(f15,plain,(
% 0.21/0.48 ~((binintersectT_lem = $true) => ((binunionT_lem = $true) => ((complementT_lem = $true) => ((setextT = $true) => ((demorgan2a = $true) => ((demorgan2b = $true) => ! [X1,X0] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X0)) = $true) => ((setminus @ X0 @ (binunion @ X1 @ X2)) = (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)))))))))))),
% 0.21/0.48 inference(fool_elimination,[],[f14])).
% 0.21/0.48 thf(f14,plain,(
% 0.21/0.48 ~(binintersectT_lem => (binunionT_lem => (complementT_lem => (setextT => (demorgan2a => (demorgan2b => ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ((setminus @ X0 @ (binunion @ X1 @ X2)) = (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)))))))))))),
% 0.21/0.48 inference(rectify,[],[f8])).
% 0.21/0.48 thf(f8,negated_conjecture,(
% 0.21/0.48 ~(binintersectT_lem => (binunionT_lem => (complementT_lem => (setextT => (demorgan2a => (demorgan2b => ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ((setminus @ X0 @ (binunion @ X1 @ X2)) = (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)))))))))))),
% 0.21/0.48 inference(negated_conjecture,[],[f7])).
% 0.21/0.48 thf(f7,conjecture,(
% 0.21/0.48 binintersectT_lem => (binunionT_lem => (complementT_lem => (setextT => (demorgan2a => (demorgan2b => ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ((setminus @ X0 @ (binunion @ X1 @ X2)) = (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))))))))))),
% 0.21/0.48 file('/export/starexec/sandbox/benchmark/theBenchmark.p',demorgan2)).
% 0.21/0.48 thf(f409,plain,(
% 0.21/0.48 ((in @ sK21 @ (powerset @ sK19)) != $true) | spl25_4),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f408])).
% 0.21/0.48 thf(f408,plain,(
% 0.21/0.48 ($true != $true) | ((in @ sK21 @ (powerset @ sK19)) != $true) | spl25_4),
% 0.21/0.48 inference(superposition,[],[f384,f156])).
% 0.21/0.48 thf(f156,plain,(
% 0.21/0.48 ( ! [X0 : $i,X1 : $i] : (((in @ (setminus @ X1 @ X0) @ (powerset @ X1)) = $true) | ((in @ X0 @ (powerset @ X1)) != $true)) )),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f144])).
% 0.21/0.48 thf(f144,plain,(
% 0.21/0.48 ( ! [X0 : $i,X1 : $i] : (((in @ X0 @ (powerset @ X1)) != $true) | ((in @ (setminus @ X1 @ X0) @ (powerset @ X1)) = $true) | ($true != $true)) )),
% 0.21/0.48 inference(definition_unfolding,[],[f106,f115])).
% 0.21/0.48 thf(f115,plain,(
% 0.21/0.48 (complementT_lem = $true)),
% 0.21/0.48 inference(cnf_transformation,[],[f70])).
% 0.21/0.48 thf(f106,plain,(
% 0.21/0.48 ( ! [X0 : $i,X1 : $i] : (((in @ X0 @ (powerset @ X1)) != $true) | ((in @ (setminus @ X1 @ X0) @ (powerset @ X1)) = $true) | (complementT_lem != $true)) )),
% 0.21/0.48 inference(cnf_transformation,[],[f67])).
% 0.21/0.48 thf(f67,plain,(
% 0.21/0.48 (! [X0,X1] : (((in @ X0 @ (powerset @ X1)) != $true) | ((in @ (setminus @ X1 @ X0) @ (powerset @ X1)) = $true)) | (complementT_lem != $true)) & ((complementT_lem = $true) | (((in @ sK17 @ (powerset @ sK18)) = $true) & ((in @ (setminus @ sK18 @ sK17) @ (powerset @ sK18)) != $true)))),
% 0.21/0.48 inference(skolemisation,[status(esa),new_symbols(skolem,[sK17,sK18])],[f65,f66])).
% 0.21/0.48 thf(f66,plain,(
% 0.21/0.48 ? [X2,X3] : (((in @ X2 @ (powerset @ X3)) = $true) & ($true != (in @ (setminus @ X3 @ X2) @ (powerset @ X3)))) => (((in @ sK17 @ (powerset @ sK18)) = $true) & ((in @ (setminus @ sK18 @ sK17) @ (powerset @ sK18)) != $true))),
% 0.21/0.48 introduced(choice_axiom,[])).
% 0.21/0.48 thf(f65,plain,(
% 0.21/0.48 (! [X0,X1] : (((in @ X0 @ (powerset @ X1)) != $true) | ((in @ (setminus @ X1 @ X0) @ (powerset @ X1)) = $true)) | (complementT_lem != $true)) & ((complementT_lem = $true) | ? [X2,X3] : (((in @ X2 @ (powerset @ X3)) = $true) & ($true != (in @ (setminus @ X3 @ X2) @ (powerset @ X3)))))),
% 0.21/0.48 inference(rectify,[],[f64])).
% 0.21/0.48 thf(f64,plain,(
% 0.21/0.48 (! [X0,X1] : (((in @ X0 @ (powerset @ X1)) != $true) | ((in @ (setminus @ X1 @ X0) @ (powerset @ X1)) = $true)) | (complementT_lem != $true)) & ((complementT_lem = $true) | ? [X0,X1] : (((in @ X0 @ (powerset @ X1)) = $true) & ((in @ (setminus @ X1 @ X0) @ (powerset @ X1)) != $true)))),
% 0.21/0.48 inference(nnf_transformation,[],[f31])).
% 0.21/0.48 thf(f31,plain,(
% 0.21/0.48 ! [X0,X1] : (((in @ X0 @ (powerset @ X1)) != $true) | ((in @ (setminus @ X1 @ X0) @ (powerset @ X1)) = $true)) <=> (complementT_lem = $true)),
% 0.21/0.48 inference(ennf_transformation,[],[f13])).
% 0.21/0.48 thf(f13,plain,(
% 0.21/0.48 (complementT_lem = $true) <=> ! [X1,X0] : (((in @ X0 @ (powerset @ X1)) = $true) => ((in @ (setminus @ X1 @ X0) @ (powerset @ X1)) = $true))),
% 0.21/0.48 inference(fool_elimination,[],[f12])).
% 0.21/0.48 thf(f12,plain,(
% 0.21/0.48 (! [X0,X1] : ((in @ X0 @ (powerset @ X1)) => (in @ (setminus @ X1 @ X0) @ (powerset @ X1))) = complementT_lem)),
% 0.21/0.48 inference(rectify,[],[f3])).
% 0.21/0.48 thf(f3,axiom,(
% 0.21/0.48 (! [X1,X0] : ((in @ X1 @ (powerset @ X0)) => (in @ (setminus @ X0 @ X1) @ (powerset @ X0))) = complementT_lem)),
% 0.21/0.48 file('/export/starexec/sandbox/benchmark/theBenchmark.p',complementT_lem)).
% 0.21/0.48 thf(f384,plain,(
% 0.21/0.48 ((in @ (setminus @ sK19 @ sK21) @ (powerset @ sK19)) != $true) | spl25_4),
% 0.21/0.48 inference(avatar_component_clause,[],[f382])).
% 0.21/0.48 thf(f382,plain,(
% 0.21/0.48 spl25_4 <=> ((in @ (setminus @ sK19 @ sK21) @ (powerset @ sK19)) = $true)),
% 0.21/0.48 introduced(avatar_definition,[new_symbols(naming,[spl25_4])])).
% 0.21/0.48 thf(f395,plain,(
% 0.21/0.48 spl25_3),
% 0.21/0.48 inference(avatar_contradiction_clause,[],[f394])).
% 0.21/0.48 thf(f394,plain,(
% 0.21/0.48 $false | spl25_3),
% 0.21/0.48 inference(subsumption_resolution,[],[f393,f110])).
% 0.21/0.48 thf(f110,plain,(
% 0.21/0.48 ((in @ sK20 @ (powerset @ sK19)) = $true)),
% 0.21/0.48 inference(cnf_transformation,[],[f70])).
% 0.21/0.48 thf(f393,plain,(
% 0.21/0.48 ((in @ sK20 @ (powerset @ sK19)) != $true) | spl25_3),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f392])).
% 0.21/0.48 thf(f392,plain,(
% 0.21/0.48 ($true != $true) | ((in @ sK20 @ (powerset @ sK19)) != $true) | spl25_3),
% 0.21/0.48 inference(superposition,[],[f380,f156])).
% 0.21/0.48 thf(f380,plain,(
% 0.21/0.48 ((in @ (setminus @ sK19 @ sK20) @ (powerset @ sK19)) != $true) | spl25_3),
% 0.21/0.48 inference(avatar_component_clause,[],[f378])).
% 0.21/0.48 thf(f378,plain,(
% 0.21/0.48 spl25_3 <=> ((in @ (setminus @ sK19 @ sK20) @ (powerset @ sK19)) = $true)),
% 0.21/0.48 introduced(avatar_definition,[new_symbols(naming,[spl25_3])])).
% 0.21/0.48 thf(f385,plain,(
% 0.21/0.48 ~spl25_3 | ~spl25_4 | spl25_2),
% 0.21/0.48 inference(avatar_split_clause,[],[f376,f339,f382,f378])).
% 0.21/0.48 thf(f339,plain,(
% 0.21/0.48 spl25_2 <=> ($true = (in @ (binintersect @ (setminus @ sK19 @ sK20) @ (setminus @ sK19 @ sK21)) @ (powerset @ sK19)))),
% 0.21/0.48 introduced(avatar_definition,[new_symbols(naming,[spl25_2])])).
% 0.21/0.48 thf(f376,plain,(
% 0.21/0.48 ((in @ (setminus @ sK19 @ sK21) @ (powerset @ sK19)) != $true) | ((in @ (setminus @ sK19 @ sK20) @ (powerset @ sK19)) != $true) | spl25_2),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f374])).
% 0.21/0.48 thf(f374,plain,(
% 0.21/0.48 ($true != $true) | ((in @ (setminus @ sK19 @ sK20) @ (powerset @ sK19)) != $true) | ((in @ (setminus @ sK19 @ sK21) @ (powerset @ sK19)) != $true) | spl25_2),
% 0.21/0.48 inference(superposition,[],[f341,f158])).
% 0.21/0.48 thf(f158,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (in @ (binintersect @ X0 @ X2) @ (powerset @ X1))) | ($true != (in @ X2 @ (powerset @ X1))) | ((in @ X0 @ (powerset @ X1)) != $true)) )),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f147])).
% 0.21/0.48 thf(f147,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X0 @ (powerset @ X1)) != $true) | ($true = (in @ (binintersect @ X0 @ X2) @ (powerset @ X1))) | ($true != $true) | ($true != (in @ X2 @ (powerset @ X1)))) )),
% 0.21/0.48 inference(definition_unfolding,[],[f119,f114])).
% 0.21/0.48 thf(f114,plain,(
% 0.21/0.48 (binintersectT_lem = $true)),
% 0.21/0.48 inference(cnf_transformation,[],[f70])).
% 0.21/0.48 thf(f119,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X0 @ (powerset @ X1)) != $true) | ($true != (in @ X2 @ (powerset @ X1))) | ($true = (in @ (binintersect @ X0 @ X2) @ (powerset @ X1))) | (binintersectT_lem != $true)) )),
% 0.21/0.48 inference(cnf_transformation,[],[f75])).
% 0.21/0.48 thf(f75,plain,(
% 0.21/0.48 (! [X0,X1] : (((in @ X0 @ (powerset @ X1)) != $true) | ! [X2] : (($true != (in @ X2 @ (powerset @ X1))) | ($true = (in @ (binintersect @ X0 @ X2) @ (powerset @ X1))))) | (binintersectT_lem != $true)) & ((binintersectT_lem = $true) | (((in @ sK22 @ (powerset @ sK23)) = $true) & (((in @ sK24 @ (powerset @ sK23)) = $true) & ($true != (in @ (binintersect @ sK22 @ sK24) @ (powerset @ sK23))))))),
% 0.21/0.48 inference(skolemisation,[status(esa),new_symbols(skolem,[sK22,sK23,sK24])],[f72,f74,f73])).
% 0.21/0.48 thf(f73,plain,(
% 0.21/0.48 ? [X3,X4] : (((in @ X3 @ (powerset @ X4)) = $true) & ? [X5] : (((in @ X5 @ (powerset @ X4)) = $true) & ((in @ (binintersect @ X3 @ X5) @ (powerset @ X4)) != $true))) => (((in @ sK22 @ (powerset @ sK23)) = $true) & ? [X5] : (((in @ X5 @ (powerset @ sK23)) = $true) & ((in @ (binintersect @ sK22 @ X5) @ (powerset @ sK23)) != $true)))),
% 0.21/0.48 introduced(choice_axiom,[])).
% 0.21/0.48 thf(f74,plain,(
% 0.21/0.48 ? [X5] : (((in @ X5 @ (powerset @ sK23)) = $true) & ((in @ (binintersect @ sK22 @ X5) @ (powerset @ sK23)) != $true)) => (((in @ sK24 @ (powerset @ sK23)) = $true) & ($true != (in @ (binintersect @ sK22 @ sK24) @ (powerset @ sK23))))),
% 0.21/0.48 introduced(choice_axiom,[])).
% 0.21/0.48 thf(f72,plain,(
% 0.21/0.48 (! [X0,X1] : (((in @ X0 @ (powerset @ X1)) != $true) | ! [X2] : (($true != (in @ X2 @ (powerset @ X1))) | ($true = (in @ (binintersect @ X0 @ X2) @ (powerset @ X1))))) | (binintersectT_lem != $true)) & ((binintersectT_lem = $true) | ? [X3,X4] : (((in @ X3 @ (powerset @ X4)) = $true) & ? [X5] : (((in @ X5 @ (powerset @ X4)) = $true) & ((in @ (binintersect @ X3 @ X5) @ (powerset @ X4)) != $true))))),
% 0.21/0.48 inference(rectify,[],[f71])).
% 0.21/0.48 thf(f71,plain,(
% 0.21/0.48 (! [X0,X1] : (((in @ X0 @ (powerset @ X1)) != $true) | ! [X2] : (($true != (in @ X2 @ (powerset @ X1))) | ($true = (in @ (binintersect @ X0 @ X2) @ (powerset @ X1))))) | (binintersectT_lem != $true)) & ((binintersectT_lem = $true) | ? [X0,X1] : (((in @ X0 @ (powerset @ X1)) = $true) & ? [X2] : (($true = (in @ X2 @ (powerset @ X1))) & ($true != (in @ (binintersect @ X0 @ X2) @ (powerset @ X1))))))),
% 0.21/0.48 inference(nnf_transformation,[],[f26])).
% 0.21/0.48 thf(f26,plain,(
% 0.21/0.48 ! [X0,X1] : (((in @ X0 @ (powerset @ X1)) != $true) | ! [X2] : (($true != (in @ X2 @ (powerset @ X1))) | ($true = (in @ (binintersect @ X0 @ X2) @ (powerset @ X1))))) <=> (binintersectT_lem = $true)),
% 0.21/0.48 inference(ennf_transformation,[],[f17])).
% 0.21/0.48 thf(f17,plain,(
% 0.21/0.48 (binintersectT_lem = $true) <=> ! [X0,X1] : (((in @ X0 @ (powerset @ X1)) = $true) => ! [X2] : (($true = (in @ X2 @ (powerset @ X1))) => ($true = (in @ (binintersect @ X0 @ X2) @ (powerset @ X1)))))),
% 0.21/0.48 inference(fool_elimination,[],[f16])).
% 0.21/0.48 thf(f16,plain,(
% 0.21/0.48 (binintersectT_lem = ! [X0,X1] : ((in @ X0 @ (powerset @ X1)) => ! [X2] : ((in @ X2 @ (powerset @ X1)) => (in @ (binintersect @ X0 @ X2) @ (powerset @ X1)))))),
% 0.21/0.48 inference(rectify,[],[f1])).
% 0.21/0.48 thf(f1,axiom,(
% 0.21/0.48 (binintersectT_lem = ! [X1,X0] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => (in @ (binintersect @ X1 @ X2) @ (powerset @ X0)))))),
% 0.21/0.48 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectT_lem)).
% 0.21/0.48 thf(f341,plain,(
% 0.21/0.48 ($true != (in @ (binintersect @ (setminus @ sK19 @ sK20) @ (setminus @ sK19 @ sK21)) @ (powerset @ sK19))) | spl25_2),
% 0.21/0.48 inference(avatar_component_clause,[],[f339])).
% 0.21/0.48 thf(f368,plain,(
% 0.21/0.48 spl25_1),
% 0.21/0.48 inference(avatar_contradiction_clause,[],[f367])).
% 0.21/0.48 thf(f367,plain,(
% 0.21/0.48 $false | spl25_1),
% 0.21/0.48 inference(subsumption_resolution,[],[f366,f110])).
% 0.21/0.48 thf(f366,plain,(
% 0.21/0.48 ((in @ sK20 @ (powerset @ sK19)) != $true) | spl25_1),
% 0.21/0.48 inference(subsumption_resolution,[],[f365,f108])).
% 0.21/0.48 thf(f365,plain,(
% 0.21/0.48 ((in @ sK21 @ (powerset @ sK19)) != $true) | ((in @ sK20 @ (powerset @ sK19)) != $true) | spl25_1),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f364])).
% 0.21/0.48 thf(f364,plain,(
% 0.21/0.48 ((in @ sK20 @ (powerset @ sK19)) != $true) | ($true != $true) | ((in @ sK21 @ (powerset @ sK19)) != $true) | spl25_1),
% 0.21/0.48 inference(superposition,[],[f353,f155])).
% 0.21/0.48 thf(f155,plain,(
% 0.21/0.48 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ (binunion @ X4 @ X5) @ (powerset @ X3)) = $true) | ((in @ X5 @ (powerset @ X3)) != $true) | ($true != (in @ X4 @ (powerset @ X3)))) )),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f143])).
% 0.21/0.48 thf(f143,plain,(
% 0.21/0.48 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != $true) | ((in @ (binunion @ X4 @ X5) @ (powerset @ X3)) = $true) | ((in @ X5 @ (powerset @ X3)) != $true) | ($true != (in @ X4 @ (powerset @ X3)))) )),
% 0.21/0.48 inference(definition_unfolding,[],[f100,f112])).
% 0.21/0.48 thf(f112,plain,(
% 0.21/0.48 (binunionT_lem = $true)),
% 0.21/0.48 inference(cnf_transformation,[],[f70])).
% 0.21/0.48 thf(f100,plain,(
% 0.21/0.48 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (in @ X4 @ (powerset @ X3))) | ((in @ (binunion @ X4 @ X5) @ (powerset @ X3)) = $true) | ((in @ X5 @ (powerset @ X3)) != $true) | (binunionT_lem != $true)) )),
% 0.21/0.48 inference(cnf_transformation,[],[f63])).
% 0.21/0.48 thf(f63,plain,(
% 0.21/0.48 ((binunionT_lem = $true) | (((in @ sK15 @ (powerset @ sK14)) = $true) & (($true != (in @ (binunion @ sK15 @ sK16) @ (powerset @ sK14))) & ((in @ sK16 @ (powerset @ sK14)) = $true)))) & (! [X3,X4] : (($true != (in @ X4 @ (powerset @ X3))) | ! [X5] : (((in @ (binunion @ X4 @ X5) @ (powerset @ X3)) = $true) | ((in @ X5 @ (powerset @ X3)) != $true))) | (binunionT_lem != $true))),
% 0.21/0.48 inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15,sK16])],[f60,f62,f61])).
% 0.21/0.48 thf(f61,plain,(
% 0.21/0.48 ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (((in @ (binunion @ X1 @ X2) @ (powerset @ X0)) != $true) & ((in @ X2 @ (powerset @ X0)) = $true))) => (((in @ sK15 @ (powerset @ sK14)) = $true) & ? [X2] : (((in @ (binunion @ sK15 @ X2) @ (powerset @ sK14)) != $true) & ((in @ X2 @ (powerset @ sK14)) = $true)))),
% 0.21/0.48 introduced(choice_axiom,[])).
% 0.21/0.48 thf(f62,plain,(
% 0.21/0.48 ? [X2] : (((in @ (binunion @ sK15 @ X2) @ (powerset @ sK14)) != $true) & ((in @ X2 @ (powerset @ sK14)) = $true)) => (($true != (in @ (binunion @ sK15 @ sK16) @ (powerset @ sK14))) & ((in @ sK16 @ (powerset @ sK14)) = $true))),
% 0.21/0.48 introduced(choice_axiom,[])).
% 0.21/0.48 thf(f60,plain,(
% 0.21/0.48 ((binunionT_lem = $true) | ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (((in @ (binunion @ X1 @ X2) @ (powerset @ X0)) != $true) & ((in @ X2 @ (powerset @ X0)) = $true)))) & (! [X3,X4] : (($true != (in @ X4 @ (powerset @ X3))) | ! [X5] : (((in @ (binunion @ X4 @ X5) @ (powerset @ X3)) = $true) | ((in @ X5 @ (powerset @ X3)) != $true))) | (binunionT_lem != $true))),
% 0.21/0.48 inference(rectify,[],[f59])).
% 0.21/0.48 thf(f59,plain,(
% 0.21/0.48 ((binunionT_lem = $true) | ? [X1,X0] : (((in @ X0 @ (powerset @ X1)) = $true) & ? [X2] : (((in @ (binunion @ X0 @ X2) @ (powerset @ X1)) != $true) & ($true = (in @ X2 @ (powerset @ X1)))))) & (! [X1,X0] : (((in @ X0 @ (powerset @ X1)) != $true) | ! [X2] : (((in @ (binunion @ X0 @ X2) @ (powerset @ X1)) = $true) | ($true != (in @ X2 @ (powerset @ X1))))) | (binunionT_lem != $true))),
% 0.21/0.48 inference(nnf_transformation,[],[f32])).
% 0.21/0.48 thf(f32,plain,(
% 0.21/0.48 (binunionT_lem = $true) <=> ! [X1,X0] : (((in @ X0 @ (powerset @ X1)) != $true) | ! [X2] : (((in @ (binunion @ X0 @ X2) @ (powerset @ X1)) = $true) | ($true != (in @ X2 @ (powerset @ X1)))))),
% 0.21/0.48 inference(ennf_transformation,[],[f19])).
% 0.21/0.48 thf(f19,plain,(
% 0.21/0.48 ! [X0,X1] : (((in @ X0 @ (powerset @ X1)) = $true) => ! [X2] : (($true = (in @ X2 @ (powerset @ X1))) => ((in @ (binunion @ X0 @ X2) @ (powerset @ X1)) = $true))) <=> (binunionT_lem = $true)),
% 0.21/0.48 inference(fool_elimination,[],[f18])).
% 0.21/0.48 thf(f18,plain,(
% 0.21/0.48 (! [X0,X1] : ((in @ X0 @ (powerset @ X1)) => ! [X2] : ((in @ X2 @ (powerset @ X1)) => (in @ (binunion @ X0 @ X2) @ (powerset @ X1)))) = binunionT_lem)),
% 0.21/0.48 inference(rectify,[],[f2])).
% 0.21/0.48 thf(f2,axiom,(
% 0.21/0.48 (! [X1,X0] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => (in @ (binunion @ X1 @ X2) @ (powerset @ X0)))) = binunionT_lem)),
% 0.21/0.48 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binunionT_lem)).
% 0.21/0.48 thf(f353,plain,(
% 0.21/0.48 ((in @ (binunion @ sK20 @ sK21) @ (powerset @ sK19)) != $true) | spl25_1),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f352])).
% 0.21/0.48 thf(f352,plain,(
% 0.21/0.48 ($true != $true) | ((in @ (binunion @ sK20 @ sK21) @ (powerset @ sK19)) != $true) | spl25_1),
% 0.21/0.48 inference(superposition,[],[f337,f156])).
% 0.21/0.48 thf(f337,plain,(
% 0.21/0.48 ((in @ (setminus @ sK19 @ (binunion @ sK20 @ sK21)) @ (powerset @ sK19)) != $true) | spl25_1),
% 0.21/0.48 inference(avatar_component_clause,[],[f335])).
% 0.21/0.48 thf(f335,plain,(
% 0.21/0.48 spl25_1 <=> ((in @ (setminus @ sK19 @ (binunion @ sK20 @ sK21)) @ (powerset @ sK19)) = $true)),
% 0.21/0.48 introduced(avatar_definition,[new_symbols(naming,[spl25_1])])).
% 0.21/0.48 thf(f342,plain,(
% 0.21/0.48 ~spl25_1 | ~spl25_2),
% 0.21/0.48 inference(avatar_split_clause,[],[f333,f339,f335])).
% 0.21/0.48 thf(f333,plain,(
% 0.21/0.48 ((in @ (setminus @ sK19 @ (binunion @ sK20 @ sK21)) @ (powerset @ sK19)) != $true) | ($true != (in @ (binintersect @ (setminus @ sK19 @ sK20) @ (setminus @ sK19 @ sK21)) @ (powerset @ sK19)))),
% 0.21/0.48 inference(subsumption_resolution,[],[f332,f108])).
% 0.21/0.48 thf(f332,plain,(
% 0.21/0.48 ($true != (in @ (binintersect @ (setminus @ sK19 @ sK20) @ (setminus @ sK19 @ sK21)) @ (powerset @ sK19))) | ((in @ sK21 @ (powerset @ sK19)) != $true) | ((in @ (setminus @ sK19 @ (binunion @ sK20 @ sK21)) @ (powerset @ sK19)) != $true)),
% 0.21/0.48 inference(subsumption_resolution,[],[f321,f110])).
% 0.21/0.48 thf(f321,plain,(
% 0.21/0.48 ((in @ sK20 @ (powerset @ sK19)) != $true) | ((in @ sK21 @ (powerset @ sK19)) != $true) | ($true != (in @ (binintersect @ (setminus @ sK19 @ sK20) @ (setminus @ sK19 @ sK21)) @ (powerset @ sK19))) | ((in @ (setminus @ sK19 @ (binunion @ sK20 @ sK21)) @ (powerset @ sK19)) != $true)),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f286])).
% 0.21/0.48 thf(f286,plain,(
% 0.21/0.48 ((in @ (setminus @ sK19 @ (binunion @ sK20 @ sK21)) @ (powerset @ sK19)) != $true) | ((in @ sK20 @ (powerset @ sK19)) != $true) | ($true != (in @ (binintersect @ (setminus @ sK19 @ sK20) @ (setminus @ sK19 @ sK21)) @ (powerset @ sK19))) | ((in @ sK21 @ (powerset @ sK19)) != $true) | ((setminus @ sK19 @ (binunion @ sK20 @ sK21)) != (setminus @ sK19 @ (binunion @ sK20 @ sK21)))),
% 0.21/0.48 inference(superposition,[],[f109,f285])).
% 0.21/0.48 thf(f285,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((setminus @ X0 @ (binunion @ X1 @ X2)) = (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) | ((in @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ (powerset @ X0)) != $true) | ((in @ X2 @ (powerset @ X0)) != $true) | ((in @ X1 @ (powerset @ X0)) != $true) | ($true != (in @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ (powerset @ X0)))) )),
% 0.21/0.48 inference(subsumption_resolution,[],[f281,f236])).
% 0.21/0.48 thf(f236,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((sP0 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X0 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) != $true) | ((in @ X1 @ (powerset @ X0)) != $true) | ((in @ X2 @ (powerset @ X0)) != $true)) )),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f235])).
% 0.21/0.48 thf(f235,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X1 @ (powerset @ X0)) != $true) | ((in @ X2 @ (powerset @ X0)) != $true) | ($true != $true) | ((sP0 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X0 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) != $true)) )),
% 0.21/0.48 inference(duplicate_literal_removal,[],[f231])).
% 0.21/0.48 thf(f231,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((sP0 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X0 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) != $true) | ((sP0 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X0 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) != $true) | ((in @ X2 @ (powerset @ X0)) != $true) | ((in @ X1 @ (powerset @ X0)) != $true) | ($true != $true)) )),
% 0.21/0.48 inference(superposition,[],[f188,f77])).
% 0.21/0.48 thf(f77,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (in @ (sK1 @ X2 @ X1 @ X0) @ X1)) | ($true != (sP0 @ X2 @ X1 @ X0))) )),
% 0.21/0.48 inference(cnf_transformation,[],[f40])).
% 0.21/0.48 thf(f40,plain,(
% 0.21/0.48 ! [X0,X1,X2] : ((($true = (sP0 @ X2 @ X1 @ X0)) | ! [X3] : (((in @ X3 @ X0) != $true) | ((in @ X3 @ X1) != $true) | ((in @ X3 @ X2) = $true))) & ((((in @ (sK1 @ X2 @ X1 @ X0) @ X0) = $true) & ($true = (in @ (sK1 @ X2 @ X1 @ X0) @ X1)) & ($true != (in @ (sK1 @ X2 @ X1 @ X0) @ X2))) | ($true != (sP0 @ X2 @ X1 @ X0))))),
% 0.21/0.48 inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f38,f39])).
% 0.21/0.48 thf(f39,plain,(
% 0.21/0.48 ! [X0,X1,X2] : (? [X4] : (($true = (in @ X4 @ X0)) & ((in @ X4 @ X1) = $true) & ((in @ X4 @ X2) != $true)) => (((in @ (sK1 @ X2 @ X1 @ X0) @ X0) = $true) & ($true = (in @ (sK1 @ X2 @ X1 @ X0) @ X1)) & ($true != (in @ (sK1 @ X2 @ X1 @ X0) @ X2))))),
% 0.21/0.48 introduced(choice_axiom,[])).
% 0.21/0.48 thf(f38,plain,(
% 0.21/0.48 ! [X0,X1,X2] : ((($true = (sP0 @ X2 @ X1 @ X0)) | ! [X3] : (((in @ X3 @ X0) != $true) | ((in @ X3 @ X1) != $true) | ((in @ X3 @ X2) = $true))) & (? [X4] : (($true = (in @ X4 @ X0)) & ((in @ X4 @ X1) = $true) & ((in @ X4 @ X2) != $true)) | ($true != (sP0 @ X2 @ X1 @ X0))))),
% 0.21/0.48 inference(rectify,[],[f37])).
% 0.21/0.48 thf(f37,plain,(
% 0.21/0.48 ! [X1,X0,X2] : ((((sP0 @ X2 @ X0 @ X1) = $true) | ! [X3] : (((in @ X3 @ X1) != $true) | ((in @ X3 @ X0) != $true) | ((in @ X3 @ X2) = $true))) & (? [X3] : (((in @ X3 @ X1) = $true) & ((in @ X3 @ X0) = $true) & ((in @ X3 @ X2) != $true)) | ((sP0 @ X2 @ X0 @ X1) != $true)))),
% 0.21/0.48 inference(nnf_transformation,[],[f35])).
% 0.21/0.48 thf(f35,plain,(
% 0.21/0.48 ! [X1,X0,X2] : (((sP0 @ X2 @ X0 @ X1) = $true) <=> ? [X3] : (((in @ X3 @ X1) = $true) & ((in @ X3 @ X0) = $true) & ((in @ X3 @ X2) != $true)))),
% 0.21/0.48 introduced(predicate_definition_introduction,[new_symbols(naming,[=])])).
% 0.21/0.48 thf(f188,plain,(
% 0.21/0.48 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (((in @ (sK1 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) @ X0) != $true) | ((sP0 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) != $true) | ((in @ X1 @ (powerset @ X0)) != $true) | ((in @ X2 @ (powerset @ X0)) != $true)) )),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f187])).
% 0.21/0.48 thf(f187,plain,(
% 0.21/0.48 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (((in @ X1 @ (powerset @ X0)) != $true) | ((in @ (sK1 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) @ X0) != $true) | ((in @ X2 @ (powerset @ X0)) != $true) | ((sP0 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) != $true) | ($true != $true)) )),
% 0.21/0.48 inference(duplicate_literal_removal,[],[f183])).
% 0.21/0.48 thf(f183,plain,(
% 0.21/0.48 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (((sP0 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) != $true) | ($true != $true) | ((in @ X1 @ (powerset @ X0)) != $true) | ((in @ X2 @ (powerset @ X0)) != $true) | ((sP0 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) != $true) | ((in @ (sK1 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) @ X0) != $true)) )),
% 0.21/0.48 inference(superposition,[],[f76,f173])).
% 0.21/0.48 thf(f173,plain,(
% 0.21/0.48 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (($true = (in @ (sK1 @ X0 @ X1 @ (binintersect @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4))) @ (setminus @ X2 @ (binunion @ X3 @ X4)))) | ((in @ (sK1 @ X0 @ X1 @ (binintersect @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4))) @ X2) != $true) | ((in @ X4 @ (powerset @ X2)) != $true) | ($true != (sP0 @ X0 @ X1 @ (binintersect @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4)))) | ((in @ X3 @ (powerset @ X2)) != $true)) )),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f169])).
% 0.21/0.48 thf(f169,plain,(
% 0.21/0.48 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (((in @ X3 @ (powerset @ X2)) != $true) | ((in @ X4 @ (powerset @ X2)) != $true) | ($true != $true) | ($true = (in @ (sK1 @ X0 @ X1 @ (binintersect @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4))) @ (setminus @ X2 @ (binunion @ X3 @ X4)))) | ($true != (sP0 @ X0 @ X1 @ (binintersect @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4)))) | ((in @ (sK1 @ X0 @ X1 @ (binintersect @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4))) @ X2) != $true)) )),
% 0.21/0.48 inference(superposition,[],[f152,f78])).
% 0.21/0.48 thf(f78,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ (sK1 @ X2 @ X1 @ X0) @ X0) = $true) | ($true != (sP0 @ X2 @ X1 @ X0))) )),
% 0.21/0.48 inference(cnf_transformation,[],[f40])).
% 0.21/0.48 thf(f152,plain,(
% 0.21/0.48 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (((in @ X3 @ (binintersect @ (setminus @ X1 @ X0) @ (setminus @ X1 @ X2))) != $true) | ($true != (in @ X2 @ (powerset @ X1))) | ((in @ X3 @ (setminus @ X1 @ (binunion @ X0 @ X2))) = $true) | ((in @ X0 @ (powerset @ X1)) != $true) | ((in @ X3 @ X1) != $true)) )),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f134])).
% 0.21/0.48 thf(f134,plain,(
% 0.21/0.48 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (($true != (in @ X2 @ (powerset @ X1))) | ($true != $true) | ((in @ X0 @ (powerset @ X1)) != $true) | ((in @ X3 @ X1) != $true) | ((in @ X3 @ (setminus @ X1 @ (binunion @ X0 @ X2))) = $true) | ((in @ X3 @ (binintersect @ (setminus @ X1 @ X0) @ (setminus @ X1 @ X2))) != $true)) )),
% 0.21/0.48 inference(definition_unfolding,[],[f99,f107])).
% 0.21/0.48 thf(f107,plain,(
% 0.21/0.48 (demorgan2b = $true)),
% 0.21/0.48 inference(cnf_transformation,[],[f70])).
% 0.21/0.48 thf(f99,plain,(
% 0.21/0.48 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (((in @ X0 @ (powerset @ X1)) != $true) | ($true != (in @ X2 @ (powerset @ X1))) | ((in @ X3 @ (binintersect @ (setminus @ X1 @ X0) @ (setminus @ X1 @ X2))) != $true) | ((in @ X3 @ (setminus @ X1 @ (binunion @ X0 @ X2))) = $true) | ((in @ X3 @ X1) != $true) | (demorgan2b != $true)) )),
% 0.21/0.48 inference(cnf_transformation,[],[f58])).
% 0.21/0.48 thf(f58,plain,(
% 0.21/0.48 (! [X0,X1] : (((in @ X0 @ (powerset @ X1)) != $true) | ! [X2] : (($true != (in @ X2 @ (powerset @ X1))) | ! [X3] : (((in @ X3 @ (binintersect @ (setminus @ X1 @ X0) @ (setminus @ X1 @ X2))) != $true) | ((in @ X3 @ (setminus @ X1 @ (binunion @ X0 @ X2))) = $true) | ((in @ X3 @ X1) != $true)))) | (demorgan2b != $true)) & ((demorgan2b = $true) | (((in @ sK10 @ (powerset @ sK11)) = $true) & (((in @ sK12 @ (powerset @ sK11)) = $true) & (((in @ sK13 @ (binintersect @ (setminus @ sK11 @ sK10) @ (setminus @ sK11 @ sK12))) = $true) & ((in @ sK13 @ (setminus @ sK11 @ (binunion @ sK10 @ sK12))) != $true) & ((in @ sK13 @ sK11) = $true)))))),
% 0.21/0.48 inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11,sK12,sK13])],[f54,f57,f56,f55])).
% 0.21/0.48 thf(f55,plain,(
% 0.21/0.48 ? [X4,X5] : (((in @ X4 @ (powerset @ X5)) = $true) & ? [X6] : (($true = (in @ X6 @ (powerset @ X5))) & ? [X7] : (((in @ X7 @ (binintersect @ (setminus @ X5 @ X4) @ (setminus @ X5 @ X6))) = $true) & ((in @ X7 @ (setminus @ X5 @ (binunion @ X4 @ X6))) != $true) & ((in @ X7 @ X5) = $true)))) => (((in @ sK10 @ (powerset @ sK11)) = $true) & ? [X6] : (((in @ X6 @ (powerset @ sK11)) = $true) & ? [X7] : (($true = (in @ X7 @ (binintersect @ (setminus @ sK11 @ sK10) @ (setminus @ sK11 @ X6)))) & ((in @ X7 @ (setminus @ sK11 @ (binunion @ sK10 @ X6))) != $true) & ((in @ X7 @ sK11) = $true))))),
% 0.21/0.48 introduced(choice_axiom,[])).
% 0.21/0.48 thf(f56,plain,(
% 0.21/0.48 ? [X6] : (((in @ X6 @ (powerset @ sK11)) = $true) & ? [X7] : (($true = (in @ X7 @ (binintersect @ (setminus @ sK11 @ sK10) @ (setminus @ sK11 @ X6)))) & ((in @ X7 @ (setminus @ sK11 @ (binunion @ sK10 @ X6))) != $true) & ((in @ X7 @ sK11) = $true))) => (((in @ sK12 @ (powerset @ sK11)) = $true) & ? [X7] : (((in @ X7 @ (binintersect @ (setminus @ sK11 @ sK10) @ (setminus @ sK11 @ sK12))) = $true) & ((in @ X7 @ (setminus @ sK11 @ (binunion @ sK10 @ sK12))) != $true) & ((in @ X7 @ sK11) = $true)))),
% 0.21/0.48 introduced(choice_axiom,[])).
% 0.21/0.48 thf(f57,plain,(
% 0.21/0.48 ? [X7] : (((in @ X7 @ (binintersect @ (setminus @ sK11 @ sK10) @ (setminus @ sK11 @ sK12))) = $true) & ((in @ X7 @ (setminus @ sK11 @ (binunion @ sK10 @ sK12))) != $true) & ((in @ X7 @ sK11) = $true)) => (((in @ sK13 @ (binintersect @ (setminus @ sK11 @ sK10) @ (setminus @ sK11 @ sK12))) = $true) & ((in @ sK13 @ (setminus @ sK11 @ (binunion @ sK10 @ sK12))) != $true) & ((in @ sK13 @ sK11) = $true))),
% 0.21/0.48 introduced(choice_axiom,[])).
% 0.21/0.48 thf(f54,plain,(
% 0.21/0.48 (! [X0,X1] : (((in @ X0 @ (powerset @ X1)) != $true) | ! [X2] : (($true != (in @ X2 @ (powerset @ X1))) | ! [X3] : (((in @ X3 @ (binintersect @ (setminus @ X1 @ X0) @ (setminus @ X1 @ X2))) != $true) | ((in @ X3 @ (setminus @ X1 @ (binunion @ X0 @ X2))) = $true) | ((in @ X3 @ X1) != $true)))) | (demorgan2b != $true)) & ((demorgan2b = $true) | ? [X4,X5] : (((in @ X4 @ (powerset @ X5)) = $true) & ? [X6] : (($true = (in @ X6 @ (powerset @ X5))) & ? [X7] : (((in @ X7 @ (binintersect @ (setminus @ X5 @ X4) @ (setminus @ X5 @ X6))) = $true) & ((in @ X7 @ (setminus @ X5 @ (binunion @ X4 @ X6))) != $true) & ((in @ X7 @ X5) = $true)))))),
% 0.21/0.48 inference(rectify,[],[f53])).
% 0.21/0.48 thf(f53,plain,(
% 0.21/0.48 (! [X1,X0] : (((in @ X1 @ (powerset @ X0)) != $true) | ! [X2] : (((in @ X2 @ (powerset @ X0)) != $true) | ! [X3] : (((in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) != $true) | ((in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))) = $true) | ((in @ X3 @ X0) != $true)))) | (demorgan2b != $true)) & ((demorgan2b = $true) | ? [X1,X0] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (((in @ X2 @ (powerset @ X0)) = $true) & ? [X3] : (((in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true) & ((in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))) != $true) & ((in @ X3 @ X0) = $true)))))),
% 0.21/0.48 inference(nnf_transformation,[],[f28])).
% 0.21/0.48 thf(f28,plain,(
% 0.21/0.48 ! [X1,X0] : (((in @ X1 @ (powerset @ X0)) != $true) | ! [X2] : (((in @ X2 @ (powerset @ X0)) != $true) | ! [X3] : (((in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) != $true) | ((in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))) = $true) | ((in @ X3 @ X0) != $true)))) <=> (demorgan2b = $true)),
% 0.21/0.48 inference(flattening,[],[f27])).
% 0.21/0.48 thf(f27,plain,(
% 0.21/0.48 (demorgan2b = $true) <=> ! [X1,X0] : (! [X2] : (! [X3] : ((((in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))) = $true) | ((in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) != $true)) | ((in @ X3 @ X0) != $true)) | ((in @ X2 @ (powerset @ X0)) != $true)) | ((in @ X1 @ (powerset @ X0)) != $true))),
% 0.21/0.48 inference(ennf_transformation,[],[f23])).
% 0.21/0.48 thf(f23,plain,(
% 0.21/0.48 (demorgan2b = $true) <=> ! [X1,X0] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X0)) = $true) => ! [X3] : (((in @ X3 @ X0) = $true) => (((in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true) => ((in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))) = $true)))))),
% 0.21/0.48 inference(fool_elimination,[],[f22])).
% 0.21/0.48 thf(f22,plain,(
% 0.21/0.48 (demorgan2b = ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X3] : ((in @ X3 @ X0) => ((in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) => (in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))))))))),
% 0.21/0.48 inference(rectify,[],[f6])).
% 0.21/0.48 thf(f6,axiom,(
% 0.21/0.48 (demorgan2b = ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X3] : ((in @ X3 @ X0) => ((in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) => (in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))))))))),
% 0.21/0.48 file('/export/starexec/sandbox/benchmark/theBenchmark.p',demorgan2b)).
% 0.21/0.48 thf(f76,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ (sK1 @ X2 @ X1 @ X0) @ X2)) | ($true != (sP0 @ X2 @ X1 @ X0))) )),
% 0.21/0.48 inference(cnf_transformation,[],[f40])).
% 0.21/0.48 thf(f281,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((setminus @ X0 @ (binunion @ X1 @ X2)) = (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) | ((in @ X1 @ (powerset @ X0)) != $true) | ((sP0 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X0 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true) | ((in @ X2 @ (powerset @ X0)) != $true) | ($true != (in @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ (powerset @ X0))) | ((in @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ (powerset @ X0)) != $true)) )),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f280])).
% 0.21/0.48 thf(f280,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X1 @ (powerset @ X0)) != $true) | ($true != $true) | ((setminus @ X0 @ (binunion @ X1 @ X2)) = (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) | ((in @ X2 @ (powerset @ X0)) != $true) | ((in @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ (powerset @ X0)) != $true) | ($true != (in @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ (powerset @ X0))) | ((sP0 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X0 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true)) )),
% 0.21/0.48 inference(duplicate_literal_removal,[],[f277])).
% 0.21/0.48 thf(f277,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ (powerset @ X0))) | ((setminus @ X0 @ (binunion @ X1 @ X2)) = (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) | ((in @ X1 @ (powerset @ X0)) != $true) | ((sP0 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X0 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true) | ((in @ X2 @ (powerset @ X0)) != $true) | ($true != (in @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ (powerset @ X0))) | ((setminus @ X0 @ (binunion @ X1 @ X2)) = (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) | ($true != $true) | ((in @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ (powerset @ X0)) != $true) | ((sP0 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X0 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true) | ((in @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ (powerset @ X0)) != $true)) )),
% 0.21/0.48 inference(superposition,[],[f210,f157])).
% 0.21/0.48 thf(f157,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (in @ (sK2 @ X2 @ X1 @ X0) @ X1)) | ($true != (in @ X2 @ (powerset @ X1))) | ($true = (sP0 @ X2 @ X1 @ X0)) | ((in @ X0 @ (powerset @ X1)) != $true) | (X0 = X2)) )),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f120])).
% 0.21/0.48 thf(f120,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : ((X0 = X2) | ($true != (in @ X2 @ (powerset @ X1))) | ($true = (in @ (sK2 @ X2 @ X1 @ X0) @ X1)) | ($true = (sP0 @ X2 @ X1 @ X0)) | ((in @ X0 @ (powerset @ X1)) != $true) | ($true != $true)) )),
% 0.21/0.48 inference(definition_unfolding,[],[f87,f113])).
% 0.21/0.48 thf(f113,plain,(
% 0.21/0.48 (setextT = $true)),
% 0.21/0.48 inference(cnf_transformation,[],[f70])).
% 0.21/0.48 thf(f87,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (in @ (sK2 @ X2 @ X1 @ X0) @ X1)) | ($true != (in @ X2 @ (powerset @ X1))) | ($true = (sP0 @ X2 @ X1 @ X0)) | (X0 = X2) | ((in @ X0 @ (powerset @ X1)) != $true) | (setextT != $true)) )),
% 0.21/0.48 inference(cnf_transformation,[],[f46])).
% 0.21/0.48 thf(f46,plain,(
% 0.21/0.48 (! [X0,X1] : (! [X2] : ((($true = (in @ (sK2 @ X2 @ X1 @ X0) @ X1)) & ((in @ (sK2 @ X2 @ X1 @ X0) @ X2) = $true) & ((in @ (sK2 @ X2 @ X1 @ X0) @ X0) != $true)) | ($true != (in @ X2 @ (powerset @ X1))) | ($true = (sP0 @ X2 @ X1 @ X0)) | (X0 = X2)) | ((in @ X0 @ (powerset @ X1)) != $true)) | (setextT != $true)) & ((setextT = $true) | ((! [X7] : (($true != (in @ X7 @ sK4)) | ((in @ X7 @ sK5) != $true) | ((in @ X7 @ sK3) = $true)) & ((in @ sK5 @ (powerset @ sK4)) = $true) & ($true != (sP0 @ sK5 @ sK4 @ sK3)) & (sK5 != sK3)) & ($true = (in @ sK3 @ (powerset @ sK4)))))),
% 0.21/0.48 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f42,f45,f44,f43])).
% 0.21/0.48 thf(f43,plain,(
% 0.21/0.48 ! [X0,X1,X2] : (? [X3] : (((in @ X3 @ X1) = $true) & ((in @ X3 @ X2) = $true) & ((in @ X3 @ X0) != $true)) => (($true = (in @ (sK2 @ X2 @ X1 @ X0) @ X1)) & ((in @ (sK2 @ X2 @ X1 @ X0) @ X2) = $true) & ((in @ (sK2 @ X2 @ X1 @ X0) @ X0) != $true)))),
% 0.21/0.48 introduced(choice_axiom,[])).
% 0.21/0.48 thf(f44,plain,(
% 0.21/0.48 ? [X4,X5] : (? [X6] : (! [X7] : (((in @ X7 @ X5) != $true) | ((in @ X7 @ X6) != $true) | ($true = (in @ X7 @ X4))) & ($true = (in @ X6 @ (powerset @ X5))) & ((sP0 @ X6 @ X5 @ X4) != $true) & (X4 != X6)) & ((in @ X4 @ (powerset @ X5)) = $true)) => (? [X6] : (! [X7] : (($true != (in @ X7 @ sK4)) | ((in @ X7 @ X6) != $true) | ((in @ X7 @ sK3) = $true)) & ((in @ X6 @ (powerset @ sK4)) = $true) & ((sP0 @ X6 @ sK4 @ sK3) != $true) & (sK3 != X6)) & ($true = (in @ sK3 @ (powerset @ sK4))))),
% 0.21/0.48 introduced(choice_axiom,[])).
% 0.21/0.48 thf(f45,plain,(
% 0.21/0.48 ? [X6] : (! [X7] : (($true != (in @ X7 @ sK4)) | ((in @ X7 @ X6) != $true) | ((in @ X7 @ sK3) = $true)) & ((in @ X6 @ (powerset @ sK4)) = $true) & ((sP0 @ X6 @ sK4 @ sK3) != $true) & (sK3 != X6)) => (! [X7] : (($true != (in @ X7 @ sK4)) | ((in @ X7 @ sK5) != $true) | ((in @ X7 @ sK3) = $true)) & ((in @ sK5 @ (powerset @ sK4)) = $true) & ($true != (sP0 @ sK5 @ sK4 @ sK3)) & (sK5 != sK3))),
% 0.21/0.48 introduced(choice_axiom,[])).
% 0.21/0.48 thf(f42,plain,(
% 0.21/0.48 (! [X0,X1] : (! [X2] : (? [X3] : (((in @ X3 @ X1) = $true) & ((in @ X3 @ X2) = $true) & ((in @ X3 @ X0) != $true)) | ($true != (in @ X2 @ (powerset @ X1))) | ($true = (sP0 @ X2 @ X1 @ X0)) | (X0 = X2)) | ((in @ X0 @ (powerset @ X1)) != $true)) | (setextT != $true)) & ((setextT = $true) | ? [X4,X5] : (? [X6] : (! [X7] : (((in @ X7 @ X5) != $true) | ((in @ X7 @ X6) != $true) | ($true = (in @ X7 @ X4))) & ($true = (in @ X6 @ (powerset @ X5))) & ((sP0 @ X6 @ X5 @ X4) != $true) & (X4 != X6)) & ((in @ X4 @ (powerset @ X5)) = $true)))),
% 0.21/0.48 inference(rectify,[],[f41])).
% 0.21/0.48 thf(f41,plain,(
% 0.21/0.48 (! [X1,X0] : (! [X2] : (? [X4] : (($true = (in @ X4 @ X0)) & ((in @ X4 @ X2) = $true) & ((in @ X4 @ X1) != $true)) | ((in @ X2 @ (powerset @ X0)) != $true) | ((sP0 @ X2 @ X0 @ X1) = $true) | (X1 = X2)) | ((in @ X1 @ (powerset @ X0)) != $true)) | (setextT != $true)) & ((setextT = $true) | ? [X1,X0] : (? [X2] : (! [X4] : (($true != (in @ X4 @ X0)) | ((in @ X4 @ X2) != $true) | ((in @ X4 @ X1) = $true)) & ((in @ X2 @ (powerset @ X0)) = $true) & ((sP0 @ X2 @ X0 @ X1) != $true) & (X1 != X2)) & ((in @ X1 @ (powerset @ X0)) = $true)))),
% 0.21/0.48 inference(nnf_transformation,[],[f36])).
% 0.21/0.48 thf(f36,plain,(
% 0.21/0.48 ! [X1,X0] : (! [X2] : (? [X4] : (($true = (in @ X4 @ X0)) & ((in @ X4 @ X2) = $true) & ((in @ X4 @ X1) != $true)) | ((in @ X2 @ (powerset @ X0)) != $true) | ((sP0 @ X2 @ X0 @ X1) = $true) | (X1 = X2)) | ((in @ X1 @ (powerset @ X0)) != $true)) <=> (setextT = $true)),
% 0.21/0.48 inference(definition_folding,[],[f34,f35])).
% 0.21/0.48 thf(f34,plain,(
% 0.21/0.48 ! [X1,X0] : (! [X2] : (? [X4] : (($true = (in @ X4 @ X0)) & ((in @ X4 @ X2) = $true) & ((in @ X4 @ X1) != $true)) | ((in @ X2 @ (powerset @ X0)) != $true) | ? [X3] : (((in @ X3 @ X1) = $true) & ((in @ X3 @ X0) = $true) & ((in @ X3 @ X2) != $true)) | (X1 = X2)) | ((in @ X1 @ (powerset @ X0)) != $true)) <=> (setextT = $true)),
% 0.21/0.48 inference(flattening,[],[f33])).
% 0.21/0.48 thf(f33,plain,(
% 0.21/0.48 ! [X0,X1] : (! [X2] : ((((X1 = X2) | ? [X4] : ((((in @ X4 @ X1) != $true) & ((in @ X4 @ X2) = $true)) & ($true = (in @ X4 @ X0)))) | ? [X3] : ((((in @ X3 @ X2) != $true) & ((in @ X3 @ X1) = $true)) & ((in @ X3 @ X0) = $true))) | ((in @ X2 @ (powerset @ X0)) != $true)) | ((in @ X1 @ (powerset @ X0)) != $true)) <=> (setextT = $true)),
% 0.21/0.48 inference(ennf_transformation,[],[f11])).
% 0.21/0.48 thf(f11,plain,(
% 0.21/0.48 ! [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X0)) = $true) => (! [X3] : (((in @ X3 @ X0) = $true) => (((in @ X3 @ X1) = $true) => ((in @ X3 @ X2) = $true))) => (! [X4] : (($true = (in @ X4 @ X0)) => (((in @ X4 @ X2) = $true) => ((in @ X4 @ X1) = $true))) => (X1 = X2))))) <=> (setextT = $true)),
% 0.21/0.48 inference(fool_elimination,[],[f10])).
% 0.21/0.48 thf(f10,plain,(
% 0.21/0.48 (setextT = ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => (! [X3] : ((in @ X3 @ X0) => ((in @ X3 @ X1) => (in @ X3 @ X2))) => (! [X4] : ((in @ X4 @ X0) => ((in @ X4 @ X2) => (in @ X4 @ X1))) => (X1 = X2))))))),
% 0.21/0.48 inference(rectify,[],[f4])).
% 0.21/0.48 thf(f4,axiom,(
% 0.21/0.48 (setextT = ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => (! [X3] : ((in @ X3 @ X0) => ((in @ X3 @ X1) => (in @ X3 @ X2))) => (! [X3] : ((in @ X3 @ X0) => ((in @ X3 @ X2) => (in @ X3 @ X1))) => (X1 = X2))))))),
% 0.21/0.48 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setextT)).
% 0.21/0.48 thf(f210,plain,(
% 0.21/0.48 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (((in @ (sK2 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) @ X0) != $true) | ((in @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ (powerset @ X3)) != $true) | ((in @ X1 @ (powerset @ X0)) != $true) | ((sP0 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true) | ((in @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ (powerset @ X3)) != $true) | ((setminus @ X0 @ (binunion @ X1 @ X2)) = (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) | ((in @ X2 @ (powerset @ X0)) != $true)) )),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f209])).
% 0.21/0.48 thf(f209,plain,(
% 0.21/0.48 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (((in @ X1 @ (powerset @ X0)) != $true) | ((sP0 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true) | ((in @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ (powerset @ X3)) != $true) | ((setminus @ X0 @ (binunion @ X1 @ X2)) = (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) | ((in @ (sK2 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) @ X0) != $true) | ((in @ X2 @ (powerset @ X0)) != $true) | ($true != $true) | ((in @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ (powerset @ X3)) != $true)) )),
% 0.21/0.48 inference(duplicate_literal_removal,[],[f205])).
% 0.21/0.48 thf(f205,plain,(
% 0.21/0.48 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (((in @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ (powerset @ X3)) != $true) | ($true != $true) | ((in @ X1 @ (powerset @ X0)) != $true) | ((in @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ (powerset @ X3)) != $true) | ((in @ X2 @ (powerset @ X0)) != $true) | ((in @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ (powerset @ X3)) != $true) | ((setminus @ X0 @ (binunion @ X1 @ X2)) = (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) | ((setminus @ X0 @ (binunion @ X1 @ X2)) = (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) | ((in @ (sK2 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) @ X0) != $true) | ((sP0 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true) | ((in @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ (powerset @ X3)) != $true) | ((sP0 @ (setminus @ X0 @ (binunion @ X1 @ X2)) @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true)) )),
% 0.21/0.48 inference(superposition,[],[f165,f154])).
% 0.21/0.48 thf(f154,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ (sK2 @ X2 @ X1 @ X0) @ X2) = $true) | ((in @ X0 @ (powerset @ X1)) != $true) | ($true != (in @ X2 @ (powerset @ X1))) | (X0 = X2) | ($true = (sP0 @ X2 @ X1 @ X0))) )),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f121])).
% 0.21/0.48 thf(f121,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X0 @ (powerset @ X1)) != $true) | (X0 = X2) | ($true != $true) | ((in @ (sK2 @ X2 @ X1 @ X0) @ X2) = $true) | ($true != (in @ X2 @ (powerset @ X1))) | ($true = (sP0 @ X2 @ X1 @ X0))) )),
% 0.21/0.48 inference(definition_unfolding,[],[f86,f113])).
% 0.21/0.48 thf(f86,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ (sK2 @ X2 @ X1 @ X0) @ X2) = $true) | ($true != (in @ X2 @ (powerset @ X1))) | ($true = (sP0 @ X2 @ X1 @ X0)) | (X0 = X2) | ((in @ X0 @ (powerset @ X1)) != $true) | (setextT != $true)) )),
% 0.21/0.48 inference(cnf_transformation,[],[f46])).
% 0.21/0.48 thf(f165,plain,(
% 0.21/0.48 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (((in @ (sK2 @ X0 @ X1 @ (binintersect @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4))) @ (setminus @ X2 @ (binunion @ X3 @ X4))) != $true) | ((in @ (binintersect @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4)) @ (powerset @ X1)) != $true) | ((in @ X4 @ (powerset @ X2)) != $true) | ((in @ X3 @ (powerset @ X2)) != $true) | ((binintersect @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4)) = X0) | ($true = (sP0 @ X0 @ X1 @ (binintersect @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4)))) | ($true != (in @ (sK2 @ X0 @ X1 @ (binintersect @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4))) @ X2)) | ((in @ X0 @ (powerset @ X1)) != $true)) )),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f164])).
% 0.21/0.48 thf(f164,plain,(
% 0.21/0.48 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (((in @ (sK2 @ X0 @ X1 @ (binintersect @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4))) @ (setminus @ X2 @ (binunion @ X3 @ X4))) != $true) | ((in @ X4 @ (powerset @ X2)) != $true) | ($true != (in @ (sK2 @ X0 @ X1 @ (binintersect @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4))) @ X2)) | ((binintersect @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4)) = X0) | ((in @ X0 @ (powerset @ X1)) != $true) | ($true = (sP0 @ X0 @ X1 @ (binintersect @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4)))) | ((in @ (binintersect @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4)) @ (powerset @ X1)) != $true) | ((in @ X3 @ (powerset @ X2)) != $true) | ($true != $true)) )),
% 0.21/0.48 inference(superposition,[],[f153,f151])).
% 0.21/0.48 thf(f151,plain,(
% 0.21/0.48 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (((in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true) | ((in @ X3 @ X0) != $true) | ((in @ X2 @ (powerset @ X0)) != $true) | ((in @ X1 @ (powerset @ X0)) != $true) | ((in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))) != $true)) )),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f128])).
% 0.21/0.48 thf(f128,plain,(
% 0.21/0.48 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (($true != $true) | ((in @ X3 @ X0) != $true) | ((in @ X2 @ (powerset @ X0)) != $true) | ((in @ X1 @ (powerset @ X0)) != $true) | ((in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))) != $true) | ((in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true)) )),
% 0.21/0.48 inference(definition_unfolding,[],[f93,f111])).
% 0.21/0.48 thf(f111,plain,(
% 0.21/0.48 (demorgan2a = $true)),
% 0.21/0.48 inference(cnf_transformation,[],[f70])).
% 0.21/0.48 thf(f93,plain,(
% 0.21/0.48 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (((in @ X3 @ X0) != $true) | ((in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))) != $true) | ((in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true) | ((in @ X2 @ (powerset @ X0)) != $true) | ((in @ X1 @ (powerset @ X0)) != $true) | (demorgan2a != $true)) )),
% 0.21/0.48 inference(cnf_transformation,[],[f52])).
% 0.21/0.48 thf(f52,plain,(
% 0.21/0.48 (! [X0,X1] : (! [X2] : (! [X3] : (((in @ X3 @ X0) != $true) | ((in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))) != $true) | ((in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true)) | ((in @ X2 @ (powerset @ X0)) != $true)) | ((in @ X1 @ (powerset @ X0)) != $true)) | (demorgan2a != $true)) & ((demorgan2a = $true) | (((((in @ sK9 @ sK6) = $true) & ((in @ sK9 @ (setminus @ sK6 @ (binunion @ sK7 @ sK8))) = $true) & ((in @ sK9 @ (binintersect @ (setminus @ sK6 @ sK7) @ (setminus @ sK6 @ sK8))) != $true)) & ((in @ sK8 @ (powerset @ sK6)) = $true)) & ((in @ sK7 @ (powerset @ sK6)) = $true)))),
% 0.21/0.48 inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9])],[f48,f51,f50,f49])).
% 0.21/0.48 thf(f49,plain,(
% 0.21/0.48 ? [X4,X5] : (? [X6] : (? [X7] : (($true = (in @ X7 @ X4)) & ((in @ X7 @ (setminus @ X4 @ (binunion @ X5 @ X6))) = $true) & ($true != (in @ X7 @ (binintersect @ (setminus @ X4 @ X5) @ (setminus @ X4 @ X6))))) & ((in @ X6 @ (powerset @ X4)) = $true)) & ((in @ X5 @ (powerset @ X4)) = $true)) => (? [X6] : (? [X7] : (((in @ X7 @ sK6) = $true) & ((in @ X7 @ (setminus @ sK6 @ (binunion @ sK7 @ X6))) = $true) & ((in @ X7 @ (binintersect @ (setminus @ sK6 @ sK7) @ (setminus @ sK6 @ X6))) != $true)) & ((in @ X6 @ (powerset @ sK6)) = $true)) & ((in @ sK7 @ (powerset @ sK6)) = $true))),
% 0.21/0.48 introduced(choice_axiom,[])).
% 0.21/0.48 thf(f50,plain,(
% 0.21/0.48 ? [X6] : (? [X7] : (((in @ X7 @ sK6) = $true) & ((in @ X7 @ (setminus @ sK6 @ (binunion @ sK7 @ X6))) = $true) & ((in @ X7 @ (binintersect @ (setminus @ sK6 @ sK7) @ (setminus @ sK6 @ X6))) != $true)) & ((in @ X6 @ (powerset @ sK6)) = $true)) => (? [X7] : (((in @ X7 @ sK6) = $true) & ($true = (in @ X7 @ (setminus @ sK6 @ (binunion @ sK7 @ sK8)))) & ($true != (in @ X7 @ (binintersect @ (setminus @ sK6 @ sK7) @ (setminus @ sK6 @ sK8))))) & ((in @ sK8 @ (powerset @ sK6)) = $true))),
% 0.21/0.48 introduced(choice_axiom,[])).
% 0.21/0.48 thf(f51,plain,(
% 0.21/0.48 ? [X7] : (((in @ X7 @ sK6) = $true) & ($true = (in @ X7 @ (setminus @ sK6 @ (binunion @ sK7 @ sK8)))) & ($true != (in @ X7 @ (binintersect @ (setminus @ sK6 @ sK7) @ (setminus @ sK6 @ sK8))))) => (((in @ sK9 @ sK6) = $true) & ((in @ sK9 @ (setminus @ sK6 @ (binunion @ sK7 @ sK8))) = $true) & ((in @ sK9 @ (binintersect @ (setminus @ sK6 @ sK7) @ (setminus @ sK6 @ sK8))) != $true))),
% 0.21/0.48 introduced(choice_axiom,[])).
% 0.21/0.48 thf(f48,plain,(
% 0.21/0.48 (! [X0,X1] : (! [X2] : (! [X3] : (((in @ X3 @ X0) != $true) | ((in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))) != $true) | ((in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true)) | ((in @ X2 @ (powerset @ X0)) != $true)) | ((in @ X1 @ (powerset @ X0)) != $true)) | (demorgan2a != $true)) & ((demorgan2a = $true) | ? [X4,X5] : (? [X6] : (? [X7] : (($true = (in @ X7 @ X4)) & ((in @ X7 @ (setminus @ X4 @ (binunion @ X5 @ X6))) = $true) & ($true != (in @ X7 @ (binintersect @ (setminus @ X4 @ X5) @ (setminus @ X4 @ X6))))) & ((in @ X6 @ (powerset @ X4)) = $true)) & ((in @ X5 @ (powerset @ X4)) = $true)))),
% 0.21/0.48 inference(rectify,[],[f47])).
% 0.21/0.48 thf(f47,plain,(
% 0.21/0.48 (! [X0,X1] : (! [X2] : (! [X3] : (((in @ X3 @ X0) != $true) | ((in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))) != $true) | ((in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true)) | ((in @ X2 @ (powerset @ X0)) != $true)) | ((in @ X1 @ (powerset @ X0)) != $true)) | (demorgan2a != $true)) & ((demorgan2a = $true) | ? [X0,X1] : (? [X2] : (? [X3] : (((in @ X3 @ X0) = $true) & ((in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))) = $true) & ((in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) != $true)) & ((in @ X2 @ (powerset @ X0)) = $true)) & ((in @ X1 @ (powerset @ X0)) = $true)))),
% 0.21/0.48 inference(nnf_transformation,[],[f25])).
% 0.21/0.48 thf(f25,plain,(
% 0.21/0.48 ! [X0,X1] : (! [X2] : (! [X3] : (((in @ X3 @ X0) != $true) | ((in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))) != $true) | ((in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true)) | ((in @ X2 @ (powerset @ X0)) != $true)) | ((in @ X1 @ (powerset @ X0)) != $true)) <=> (demorgan2a = $true)),
% 0.21/0.48 inference(flattening,[],[f24])).
% 0.21/0.48 thf(f24,plain,(
% 0.21/0.48 (demorgan2a = $true) <=> ! [X1,X0] : (! [X2] : (! [X3] : ((((in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true) | ((in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))) != $true)) | ((in @ X3 @ X0) != $true)) | ((in @ X2 @ (powerset @ X0)) != $true)) | ((in @ X1 @ (powerset @ X0)) != $true))),
% 0.21/0.48 inference(ennf_transformation,[],[f21])).
% 0.21/0.48 thf(f21,plain,(
% 0.21/0.48 (demorgan2a = $true) <=> ! [X1,X0] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X0)) = $true) => ! [X3] : (((in @ X3 @ X0) = $true) => (((in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))) = $true) => ((in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true)))))),
% 0.21/0.48 inference(fool_elimination,[],[f20])).
% 0.21/0.48 thf(f20,plain,(
% 0.21/0.48 (demorgan2a = ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X3] : ((in @ X3 @ X0) => ((in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))) => (in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))))))))),
% 0.21/0.48 inference(rectify,[],[f5])).
% 0.21/0.48 thf(f5,axiom,(
% 0.21/0.48 (demorgan2a = ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X3] : ((in @ X3 @ X0) => ((in @ X3 @ (setminus @ X0 @ (binunion @ X1 @ X2))) => (in @ X3 @ (binintersect @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))))))))),
% 0.21/0.48 file('/export/starexec/sandbox/benchmark/theBenchmark.p',demorgan2a)).
% 0.21/0.48 thf(f153,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ (sK2 @ X2 @ X1 @ X0) @ X0) != $true) | ($true != (in @ X2 @ (powerset @ X1))) | ($true = (sP0 @ X2 @ X1 @ X0)) | (X0 = X2) | ((in @ X0 @ (powerset @ X1)) != $true)) )),
% 0.21/0.48 inference(trivial_inequality_removal,[],[f122])).
% 0.21/0.48 thf(f122,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X0 @ (powerset @ X1)) != $true) | ((in @ (sK2 @ X2 @ X1 @ X0) @ X0) != $true) | (X0 = X2) | ($true != (in @ X2 @ (powerset @ X1))) | ($true != $true) | ($true = (sP0 @ X2 @ X1 @ X0))) )),
% 0.21/0.48 inference(definition_unfolding,[],[f85,f113])).
% 0.21/0.48 thf(f85,plain,(
% 0.21/0.48 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ (sK2 @ X2 @ X1 @ X0) @ X0) != $true) | ($true != (in @ X2 @ (powerset @ X1))) | ($true = (sP0 @ X2 @ X1 @ X0)) | (X0 = X2) | ((in @ X0 @ (powerset @ X1)) != $true) | (setextT != $true)) )),
% 0.21/0.48 inference(cnf_transformation,[],[f46])).
% 0.21/0.48 thf(f109,plain,(
% 0.21/0.48 ((binintersect @ (setminus @ sK19 @ sK20) @ (setminus @ sK19 @ sK21)) != (setminus @ sK19 @ (binunion @ sK20 @ sK21)))),
% 0.21/0.48 inference(cnf_transformation,[],[f70])).
% 0.21/0.48 % SZS output end Proof for theBenchmark
% 0.21/0.48 % (939)------------------------------
% 0.21/0.48 % (939)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.48 % (939)Termination reason: Refutation
% 0.21/0.48
% 0.21/0.48 % (939)Memory used [KB]: 6140
% 0.21/0.48 % (939)Time elapsed: 0.110 s
% 0.21/0.48 % (939)Instructions burned: 168 (million)
% 0.21/0.48 % (939)------------------------------
% 0.21/0.48 % (939)------------------------------
% 0.21/0.48 % (933)Success in time 0.122 s
% 0.21/0.48 % Vampire---4.8 exiting
%------------------------------------------------------------------------------