TSTP Solution File: SEU753^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU753^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 : n015.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:16 EDT 2024
% Result : Theorem 0.21s 0.49s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU753^2 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.15 % 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.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 16:31:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_EQU_NAR problem
% 0.15/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.21/0.38 % (28671)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.21/0.38 % (28674)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.38 % (28672)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.21/0.38 % (28675)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.21/0.38 % (28676)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.21/0.38 % (28677)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.38 % (28673)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.21/0.38 % (28678)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.21/0.38 % (28674)Instruction limit reached!
% 0.21/0.38 % (28674)------------------------------
% 0.21/0.38 % (28674)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (28674)Termination reason: Unknown
% 0.21/0.38 % (28674)Termination phase: shuffling
% 0.21/0.38 % (28675)Instruction limit reached!
% 0.21/0.38 % (28675)------------------------------
% 0.21/0.38 % (28675)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38
% 0.21/0.38 % (28674)Memory used [KB]: 895
% 0.21/0.38 % (28674)Time elapsed: 0.003 s
% 0.21/0.38 % (28674)Instructions burned: 2 (million)
% 0.21/0.38 % (28674)------------------------------
% 0.21/0.38 % (28674)------------------------------
% 0.21/0.38 % (28675)Termination reason: Unknown
% 0.21/0.38 % (28675)Termination phase: shuffling
% 0.21/0.38
% 0.21/0.38 % (28675)Memory used [KB]: 895
% 0.21/0.38 % (28675)Time elapsed: 0.003 s
% 0.21/0.38 % (28675)Instructions burned: 2 (million)
% 0.21/0.38 % (28675)------------------------------
% 0.21/0.38 % (28675)------------------------------
% 0.21/0.39 % (28678)Instruction limit reached!
% 0.21/0.39 % (28678)------------------------------
% 0.21/0.39 % (28678)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (28678)Termination reason: Unknown
% 0.21/0.39 % (28678)Termination phase: Property scanning
% 0.21/0.39
% 0.21/0.39 % (28678)Memory used [KB]: 1023
% 0.21/0.39 % (28678)Time elapsed: 0.004 s
% 0.21/0.39 % (28678)Instructions burned: 3 (million)
% 0.21/0.39 % (28678)------------------------------
% 0.21/0.39 % (28678)------------------------------
% 0.21/0.39 % (28672)Instruction limit reached!
% 0.21/0.39 % (28672)------------------------------
% 0.21/0.39 % (28672)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (28672)Termination reason: Unknown
% 0.21/0.39 % (28672)Termination phase: Saturation
% 0.21/0.39
% 0.21/0.39 % (28672)Memory used [KB]: 1023
% 0.21/0.39 % (28672)Time elapsed: 0.004 s
% 0.21/0.39 % (28672)Instructions burned: 5 (million)
% 0.21/0.39 % (28672)------------------------------
% 0.21/0.39 % (28672)------------------------------
% 0.21/0.40 % (28677)Instruction limit reached!
% 0.21/0.40 % (28677)------------------------------
% 0.21/0.40 % (28677)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (28677)Termination reason: Unknown
% 0.21/0.40 % (28677)Termination phase: Saturation
% 0.21/0.40
% 0.21/0.40 % (28677)Memory used [KB]: 5628
% 0.21/0.40 % (28677)Time elapsed: 0.014 s
% 0.21/0.40 % (28677)Instructions burned: 19 (million)
% 0.21/0.40 % (28677)------------------------------
% 0.21/0.40 % (28677)------------------------------
% 0.21/0.40 % (28679)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.40 % (28680)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.40 % (28673)Instruction limit reached!
% 0.21/0.40 % (28673)------------------------------
% 0.21/0.40 % (28673)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (28673)Termination reason: Unknown
% 0.21/0.40 % (28673)Termination phase: Saturation
% 0.21/0.40
% 0.21/0.40 % (28673)Memory used [KB]: 5628
% 0.21/0.40 % (28673)Time elapsed: 0.018 s
% 0.21/0.40 % (28673)Instructions burned: 28 (million)
% 0.21/0.40 % (28673)------------------------------
% 0.21/0.40 % (28673)------------------------------
% 0.21/0.40 % (28681)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.40 % (28682)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.40 % (28681)Instruction limit reached!
% 0.21/0.40 % (28681)------------------------------
% 0.21/0.40 % (28681)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (28681)Termination reason: Unknown
% 0.21/0.40 % (28681)Termination phase: Preprocessing 3
% 0.21/0.40
% 0.21/0.40 % (28681)Memory used [KB]: 1023
% 0.21/0.40 % (28681)Time elapsed: 0.004 s
% 0.21/0.40 % (28681)Instructions burned: 4 (million)
% 0.21/0.40 % (28681)------------------------------
% 0.21/0.40 % (28681)------------------------------
% 0.21/0.41 % (28680)Instruction limit reached!
% 0.21/0.41 % (28680)------------------------------
% 0.21/0.41 % (28680)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41 % (28680)Termination reason: Unknown
% 0.21/0.41 % (28680)Termination phase: Saturation
% 0.21/0.41
% 0.21/0.41 % (28680)Memory used [KB]: 5628
% 0.21/0.41 % (28680)Time elapsed: 0.012 s
% 0.21/0.41 % (28680)Instructions burned: 16 (million)
% 0.21/0.41 % (28680)------------------------------
% 0.21/0.41 % (28680)------------------------------
% 0.21/0.41 % (28683)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.41 % (28683)Instruction limit reached!
% 0.21/0.41 % (28683)------------------------------
% 0.21/0.41 % (28683)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41 % (28683)Termination reason: Unknown
% 0.21/0.41 % (28683)Termination phase: Saturation
% 0.21/0.41
% 0.21/0.41 % (28683)Memory used [KB]: 1023
% 0.21/0.41 % (28683)Time elapsed: 0.006 s
% 0.21/0.41 % (28683)Instructions burned: 7 (million)
% 0.21/0.41 % (28683)------------------------------
% 0.21/0.41 % (28683)------------------------------
% 0.21/0.41 % (28684)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.42 % (28685)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.42 % (28685)Instruction limit reached!
% 0.21/0.42 % (28685)------------------------------
% 0.21/0.42 % (28685)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (28685)Termination reason: Unknown
% 0.21/0.42 % (28685)Termination phase: SInE selection
% 0.21/0.42
% 0.21/0.42 % (28679)Instruction limit reached!
% 0.21/0.42 % (28679)------------------------------
% 0.21/0.42 % (28679)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (28685)Memory used [KB]: 1023
% 0.21/0.42 % (28685)Time elapsed: 0.004 s
% 0.21/0.42 % (28685)Instructions burned: 4 (million)
% 0.21/0.42 % (28685)------------------------------
% 0.21/0.42 % (28685)------------------------------
% 0.21/0.42 % (28679)Termination reason: Unknown
% 0.21/0.42 % (28679)Termination phase: Saturation
% 0.21/0.42
% 0.21/0.42 % (28679)Memory used [KB]: 5628
% 0.21/0.42 % (28679)Time elapsed: 0.022 s
% 0.21/0.42 % (28679)Instructions burned: 37 (million)
% 0.21/0.42 % (28679)------------------------------
% 0.21/0.42 % (28679)------------------------------
% 0.21/0.42 % (28686)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.42 % (28684)Instruction limit reached!
% 0.21/0.42 % (28684)------------------------------
% 0.21/0.42 % (28684)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (28684)Termination reason: Unknown
% 0.21/0.42 % (28684)Termination phase: Saturation
% 0.21/0.42
% 0.21/0.42 % (28684)Memory used [KB]: 5884
% 0.21/0.42 % (28684)Time elapsed: 0.012 s
% 0.21/0.42 % (28684)Instructions burned: 16 (million)
% 0.21/0.42 % (28684)------------------------------
% 0.21/0.42 % (28684)------------------------------
% 0.21/0.43 % (28686)Instruction limit reached!
% 0.21/0.43 % (28686)------------------------------
% 0.21/0.43 % (28686)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.43 % (28686)Termination reason: Unknown
% 0.21/0.43 % (28686)Termination phase: Property scanning
% 0.21/0.43
% 0.21/0.43 % (28686)Memory used [KB]: 1023
% 0.21/0.43 % (28686)Time elapsed: 0.003 s
% 0.21/0.43 % (28686)Instructions burned: 3 (million)
% 0.21/0.43 % (28686)------------------------------
% 0.21/0.43 % (28686)------------------------------
% 0.21/0.43 % (28687)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.43 % (28687)Instruction limit reached!
% 0.21/0.43 % (28687)------------------------------
% 0.21/0.43 % (28687)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.43 % (28687)Termination reason: Unknown
% 0.21/0.43 % (28687)Termination phase: Saturation
% 0.21/0.43
% 0.21/0.43 % (28687)Memory used [KB]: 5500
% 0.21/0.43 % (28687)Time elapsed: 0.006 s
% 0.21/0.43 % (28687)Instructions burned: 7 (million)
% 0.21/0.43 % (28687)------------------------------
% 0.21/0.43 % (28687)------------------------------
% 0.21/0.43 % (28688)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.43 % (28689)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.43 % (28688)Instruction limit reached!
% 0.21/0.43 % (28688)------------------------------
% 0.21/0.43 % (28688)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.44 % (28688)Termination reason: Unknown
% 0.21/0.44 % (28688)Termination phase: Property scanning
% 0.21/0.44
% 0.21/0.44 % (28688)Memory used [KB]: 1023
% 0.21/0.44 % (28688)Time elapsed: 0.004 s
% 0.21/0.44 % (28688)Instructions burned: 4 (million)
% 0.21/0.44 % (28688)------------------------------
% 0.21/0.44 % (28688)------------------------------
% 0.21/0.44 % (28689)Instruction limit reached!
% 0.21/0.44 % (28689)------------------------------
% 0.21/0.44 % (28689)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.44 % (28689)Termination reason: Unknown
% 0.21/0.44 % (28689)Termination phase: Property scanning
% 0.21/0.44
% 0.21/0.44 % (28689)Memory used [KB]: 1023
% 0.21/0.44 % (28689)Time elapsed: 0.004 s
% 0.21/0.44 % (28689)Instructions burned: 4 (million)
% 0.21/0.44 % (28689)------------------------------
% 0.21/0.44 % (28689)------------------------------
% 0.21/0.44 % (28690)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.44 % (28691)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.45 % (28694)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.21/0.45 % (28690)Instruction limit reached!
% 0.21/0.45 % (28690)------------------------------
% 0.21/0.45 % (28690)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.45 % (28690)Termination reason: Unknown
% 0.21/0.45 % (28690)Termination phase: Saturation
% 0.21/0.45
% 0.21/0.45 % (28690)Memory used [KB]: 5628
% 0.21/0.45 % (28690)Time elapsed: 0.012 s
% 0.21/0.45 % (28690)Instructions burned: 18 (million)
% 0.21/0.45 % (28690)------------------------------
% 0.21/0.45 % (28690)------------------------------
% 0.21/0.45 % (28695)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.45 % (28696)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.45 % (28694)Instruction limit reached!
% 0.21/0.45 % (28694)------------------------------
% 0.21/0.45 % (28694)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.45 % (28694)Termination reason: Unknown
% 0.21/0.45 % (28694)Termination phase: Property scanning
% 0.21/0.45
% 0.21/0.45 % (28694)Memory used [KB]: 1023
% 0.21/0.45 % (28694)Time elapsed: 0.007 s
% 0.21/0.45 % (28694)Instructions burned: 6 (million)
% 0.21/0.45 % (28694)------------------------------
% 0.21/0.45 % (28694)------------------------------
% 0.21/0.46 % (28695)Refutation not found, incomplete strategy
% 0.21/0.46 % (28695)------------------------------
% 0.21/0.46 % (28695)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.46 % (28695)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46 % (28695)Memory used [KB]: 5628
% 0.21/0.46 % (28695)Time elapsed: 0.007 s
% 0.21/0.46 % (28695)Instructions burned: 9 (million)
% 0.21/0.46 % (28695)------------------------------
% 0.21/0.46 % (28695)------------------------------
% 0.21/0.46 % (28696)Instruction limit reached!
% 0.21/0.46 % (28696)------------------------------
% 0.21/0.46 % (28696)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.46 % (28696)Termination reason: Unknown
% 0.21/0.46 % (28696)Termination phase: Saturation
% 0.21/0.47
% 0.21/0.47 % (28696)Memory used [KB]: 5628
% 0.21/0.47 % (28696)Time elapsed: 0.016 s
% 0.21/0.47 % (28696)Instructions burned: 21 (million)
% 0.21/0.47 % (28696)------------------------------
% 0.21/0.47 % (28696)------------------------------
% 0.21/0.47 % (28702)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2999ds/5Mi)
% 0.21/0.47 % (28702)Instruction limit reached!
% 0.21/0.47 % (28702)------------------------------
% 0.21/0.47 % (28702)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.47 % (28702)Termination reason: Unknown
% 0.21/0.47 % (28702)Termination phase: Property scanning
% 0.21/0.47
% 0.21/0.47 % (28702)Memory used [KB]: 1023
% 0.21/0.47 % (28702)Time elapsed: 0.006 s
% 0.21/0.47 % (28702)Instructions burned: 6 (million)
% 0.21/0.47 % (28702)------------------------------
% 0.21/0.47 % (28702)------------------------------
% 0.21/0.47 % (28704)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.47 % (28705)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.47 % (28704)Instruction limit reached!
% 0.21/0.47 % (28704)------------------------------
% 0.21/0.47 % (28704)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.47 % (28704)Termination reason: Unknown
% 0.21/0.47 % (28704)Termination phase: Property scanning
% 0.21/0.47
% 0.21/0.47 % (28704)Memory used [KB]: 1023
% 0.21/0.47 % (28704)Time elapsed: 0.005 s
% 0.21/0.47 % (28704)Instructions burned: 6 (million)
% 0.21/0.47 % (28704)------------------------------
% 0.21/0.47 % (28704)------------------------------
% 0.21/0.48 % (28707)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.48 % (28676)First to succeed.
% 0.21/0.49 % (28671)Instruction limit reached!
% 0.21/0.49 % (28671)------------------------------
% 0.21/0.49 % (28671)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.49 % (28671)Termination reason: Unknown
% 0.21/0.49 % (28671)Termination phase: Saturation
% 0.21/0.49
% 0.21/0.49 % (28671)Memory used [KB]: 6140
% 0.21/0.49 % (28671)Time elapsed: 0.106 s
% 0.21/0.49 % (28671)Instructions burned: 183 (million)
% 0.21/0.49 % (28671)------------------------------
% 0.21/0.49 % (28671)------------------------------
% 0.21/0.49 % (28712)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on theBenchmark for (2998ds/879Mi)
% 0.21/0.49 % (28710)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 (2998ds/19Mi)
% 0.21/0.49 % (28676)Refutation found. Thanks to Tanya!
% 0.21/0.49 % SZS status Theorem for theBenchmark
% 0.21/0.49 % SZS output start Proof for theBenchmark
% 0.21/0.49 thf(func_def_0, type, in: $i > $i > $o).
% 0.21/0.49 thf(func_def_1, type, powerset: $i > $i).
% 0.21/0.49 thf(func_def_2, type, binunion: $i > $i > $i).
% 0.21/0.49 thf(func_def_3, type, binintersect: $i > $i > $i).
% 0.21/0.49 thf(func_def_4, type, setminus: $i > $i > $i).
% 0.21/0.49 thf(func_def_14, type, sP0: $i > $i > $i > $o).
% 0.21/0.49 thf(func_def_15, type, sK1: $i > $i > $i > $i).
% 0.21/0.49 thf(func_def_16, type, sK2: $i > $i > $i > $i).
% 0.21/0.49 thf(f412,plain,(
% 0.21/0.49 $false),
% 0.21/0.49 inference(avatar_sat_refutation,[],[f342,f368,f385,f395,f411])).
% 0.21/0.49 thf(f411,plain,(
% 0.21/0.49 spl25_4),
% 0.21/0.49 inference(avatar_contradiction_clause,[],[f410])).
% 0.21/0.49 thf(f410,plain,(
% 0.21/0.49 $false | spl25_4),
% 0.21/0.49 inference(subsumption_resolution,[],[f409,f115])).
% 0.21/0.49 thf(f115,plain,(
% 0.21/0.49 ($true = (in @ sK24 @ (powerset @ sK22)))),
% 0.21/0.49 inference(cnf_transformation,[],[f75])).
% 0.21/0.49 thf(f75,plain,(
% 0.21/0.49 (complementT_lem = $true) & (demorgan1b = $true) & (($true = (in @ sK23 @ (powerset @ sK22))) & (((binunion @ (setminus @ sK22 @ sK23) @ (setminus @ sK22 @ sK24)) != (setminus @ sK22 @ (binintersect @ sK23 @ sK24))) & ($true = (in @ sK24 @ (powerset @ sK22))))) & (demorgan1a = $true) & (setextT = $true) & (binunionT_lem = $true) & (binintersectT_lem = $true)),
% 0.21/0.49 inference(skolemisation,[status(esa),new_symbols(skolem,[sK22,sK23,sK24])],[f32,f74,f73])).
% 0.21/0.49 thf(f73,plain,(
% 0.21/0.49 ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (((setminus @ X0 @ (binintersect @ X1 @ X2)) != (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) & ((in @ X2 @ (powerset @ X0)) = $true))) => (($true = (in @ sK23 @ (powerset @ sK22))) & ? [X2] : (((setminus @ sK22 @ (binintersect @ sK23 @ X2)) != (binunion @ (setminus @ sK22 @ sK23) @ (setminus @ sK22 @ X2))) & ($true = (in @ X2 @ (powerset @ sK22)))))),
% 0.21/0.49 introduced(choice_axiom,[])).
% 0.21/0.49 thf(f74,plain,(
% 0.21/0.49 ? [X2] : (((setminus @ sK22 @ (binintersect @ sK23 @ X2)) != (binunion @ (setminus @ sK22 @ sK23) @ (setminus @ sK22 @ X2))) & ($true = (in @ X2 @ (powerset @ sK22)))) => (((binunion @ (setminus @ sK22 @ sK23) @ (setminus @ sK22 @ sK24)) != (setminus @ sK22 @ (binintersect @ sK23 @ sK24))) & ($true = (in @ sK24 @ (powerset @ sK22))))),
% 0.21/0.49 introduced(choice_axiom,[])).
% 0.21/0.49 thf(f32,plain,(
% 0.21/0.49 (complementT_lem = $true) & (demorgan1b = $true) & ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (((setminus @ X0 @ (binintersect @ X1 @ X2)) != (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) & ((in @ X2 @ (powerset @ X0)) = $true))) & (demorgan1a = $true) & (setextT = $true) & (binunionT_lem = $true) & (binintersectT_lem = $true)),
% 0.21/0.49 inference(flattening,[],[f31])).
% 0.21/0.49 thf(f31,plain,(
% 0.21/0.49 (((((? [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (((setminus @ X0 @ (binintersect @ X1 @ X2)) != (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) & ((in @ X2 @ (powerset @ X0)) = $true))) & (demorgan1b = $true)) & (demorgan1a = $true)) & (setextT = $true)) & (complementT_lem = $true)) & (binunionT_lem = $true)) & (binintersectT_lem = $true)),
% 0.21/0.49 inference(ennf_transformation,[],[f21])).
% 0.21/0.49 thf(f21,plain,(
% 0.21/0.49 ~((binintersectT_lem = $true) => ((binunionT_lem = $true) => ((complementT_lem = $true) => ((setextT = $true) => ((demorgan1a = $true) => ((demorgan1b = $true) => ! [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X0)) = $true) => ((setminus @ X0 @ (binintersect @ X1 @ X2)) = (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)))))))))))),
% 0.21/0.49 inference(fool_elimination,[],[f20])).
% 0.21/0.49 thf(f20,plain,(
% 0.21/0.49 ~(binintersectT_lem => (binunionT_lem => (complementT_lem => (setextT => (demorgan1a => (demorgan1b => ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ((setminus @ X0 @ (binintersect @ X1 @ X2)) = (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)))))))))))),
% 0.21/0.49 inference(rectify,[],[f8])).
% 0.21/0.49 thf(f8,negated_conjecture,(
% 0.21/0.49 ~(binintersectT_lem => (binunionT_lem => (complementT_lem => (setextT => (demorgan1a => (demorgan1b => ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ((setminus @ X0 @ (binintersect @ X1 @ X2)) = (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)))))))))))),
% 0.21/0.49 inference(negated_conjecture,[],[f7])).
% 0.21/0.49 thf(f7,conjecture,(
% 0.21/0.49 binintersectT_lem => (binunionT_lem => (complementT_lem => (setextT => (demorgan1a => (demorgan1b => ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ((setminus @ X0 @ (binintersect @ X1 @ X2)) = (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))))))))))),
% 0.21/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',demorgan1)).
% 0.21/0.49 thf(f409,plain,(
% 0.21/0.49 ($true != (in @ sK24 @ (powerset @ sK22))) | spl25_4),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f408])).
% 0.21/0.49 thf(f408,plain,(
% 0.21/0.49 ($true != $true) | ($true != (in @ sK24 @ (powerset @ sK22))) | spl25_4),
% 0.21/0.49 inference(superposition,[],[f384,f153])).
% 0.21/0.49 thf(f153,plain,(
% 0.21/0.49 ( ! [X0 : $i,X1 : $i] : (($true = (in @ (setminus @ X1 @ X0) @ (powerset @ X1))) | ($true != (in @ X0 @ (powerset @ X1)))) )),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f148])).
% 0.21/0.49 thf(f148,plain,(
% 0.21/0.49 ( ! [X0 : $i,X1 : $i] : (($true = (in @ (setminus @ X1 @ X0) @ (powerset @ X1))) | ($true != $true) | ($true != (in @ X0 @ (powerset @ X1)))) )),
% 0.21/0.49 inference(definition_unfolding,[],[f110,f119])).
% 0.21/0.49 thf(f119,plain,(
% 0.21/0.49 (complementT_lem = $true)),
% 0.21/0.49 inference(cnf_transformation,[],[f75])).
% 0.21/0.49 thf(f110,plain,(
% 0.21/0.49 ( ! [X0 : $i,X1 : $i] : (($true = (in @ (setminus @ X1 @ X0) @ (powerset @ X1))) | ($true != (in @ X0 @ (powerset @ X1))) | (complementT_lem != $true)) )),
% 0.21/0.49 inference(cnf_transformation,[],[f72])).
% 0.21/0.49 thf(f72,plain,(
% 0.21/0.49 (! [X0,X1] : (($true = (in @ (setminus @ X1 @ X0) @ (powerset @ X1))) | ($true != (in @ X0 @ (powerset @ X1)))) | (complementT_lem != $true)) & ((complementT_lem = $true) | (((in @ (setminus @ sK21 @ sK20) @ (powerset @ sK21)) != $true) & ((in @ sK20 @ (powerset @ sK21)) = $true)))),
% 0.21/0.49 inference(skolemisation,[status(esa),new_symbols(skolem,[sK20,sK21])],[f70,f71])).
% 0.21/0.49 thf(f71,plain,(
% 0.21/0.49 ? [X2,X3] : (($true != (in @ (setminus @ X3 @ X2) @ (powerset @ X3))) & ($true = (in @ X2 @ (powerset @ X3)))) => (((in @ (setminus @ sK21 @ sK20) @ (powerset @ sK21)) != $true) & ((in @ sK20 @ (powerset @ sK21)) = $true))),
% 0.21/0.49 introduced(choice_axiom,[])).
% 0.21/0.49 thf(f70,plain,(
% 0.21/0.49 (! [X0,X1] : (($true = (in @ (setminus @ X1 @ X0) @ (powerset @ X1))) | ($true != (in @ X0 @ (powerset @ X1)))) | (complementT_lem != $true)) & ((complementT_lem = $true) | ? [X2,X3] : (($true != (in @ (setminus @ X3 @ X2) @ (powerset @ X3))) & ($true = (in @ X2 @ (powerset @ X3)))))),
% 0.21/0.49 inference(rectify,[],[f69])).
% 0.21/0.49 thf(f69,plain,(
% 0.21/0.49 (! [X1,X0] : (((in @ (setminus @ X0 @ X1) @ (powerset @ X0)) = $true) | ((in @ X1 @ (powerset @ X0)) != $true)) | (complementT_lem != $true)) & ((complementT_lem = $true) | ? [X1,X0] : (((in @ (setminus @ X0 @ X1) @ (powerset @ X0)) != $true) & ((in @ X1 @ (powerset @ X0)) = $true)))),
% 0.21/0.49 inference(nnf_transformation,[],[f28])).
% 0.21/0.49 thf(f28,plain,(
% 0.21/0.49 ! [X1,X0] : (((in @ (setminus @ X0 @ X1) @ (powerset @ X0)) = $true) | ((in @ X1 @ (powerset @ X0)) != $true)) <=> (complementT_lem = $true)),
% 0.21/0.49 inference(ennf_transformation,[],[f11])).
% 0.21/0.49 thf(f11,plain,(
% 0.21/0.49 (complementT_lem = $true) <=> ! [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) => ((in @ (setminus @ X0 @ X1) @ (powerset @ X0)) = $true))),
% 0.21/0.49 inference(fool_elimination,[],[f10])).
% 0.21/0.49 thf(f10,plain,(
% 0.21/0.49 (! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => (in @ (setminus @ X0 @ X1) @ (powerset @ X0))) = complementT_lem)),
% 0.21/0.49 inference(rectify,[],[f3])).
% 0.21/0.49 thf(f3,axiom,(
% 0.21/0.49 (! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => (in @ (setminus @ X0 @ X1) @ (powerset @ X0))) = complementT_lem)),
% 0.21/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',complementT_lem)).
% 0.21/0.49 thf(f384,plain,(
% 0.21/0.49 ($true != (in @ (setminus @ sK22 @ sK24) @ (powerset @ sK22))) | spl25_4),
% 0.21/0.49 inference(avatar_component_clause,[],[f382])).
% 0.21/0.49 thf(f382,plain,(
% 0.21/0.49 spl25_4 <=> ($true = (in @ (setminus @ sK22 @ sK24) @ (powerset @ sK22)))),
% 0.21/0.49 introduced(avatar_definition,[new_symbols(naming,[spl25_4])])).
% 0.21/0.49 thf(f395,plain,(
% 0.21/0.49 spl25_3),
% 0.21/0.49 inference(avatar_contradiction_clause,[],[f394])).
% 0.21/0.49 thf(f394,plain,(
% 0.21/0.49 $false | spl25_3),
% 0.21/0.49 inference(subsumption_resolution,[],[f393,f117])).
% 0.21/0.49 thf(f117,plain,(
% 0.21/0.49 ($true = (in @ sK23 @ (powerset @ sK22)))),
% 0.21/0.49 inference(cnf_transformation,[],[f75])).
% 0.21/0.49 thf(f393,plain,(
% 0.21/0.49 ($true != (in @ sK23 @ (powerset @ sK22))) | spl25_3),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f392])).
% 0.21/0.49 thf(f392,plain,(
% 0.21/0.49 ($true != (in @ sK23 @ (powerset @ sK22))) | ($true != $true) | spl25_3),
% 0.21/0.49 inference(superposition,[],[f380,f153])).
% 0.21/0.49 thf(f380,plain,(
% 0.21/0.49 ($true != (in @ (setminus @ sK22 @ sK23) @ (powerset @ sK22))) | spl25_3),
% 0.21/0.49 inference(avatar_component_clause,[],[f378])).
% 0.21/0.49 thf(f378,plain,(
% 0.21/0.49 spl25_3 <=> ($true = (in @ (setminus @ sK22 @ sK23) @ (powerset @ sK22)))),
% 0.21/0.49 introduced(avatar_definition,[new_symbols(naming,[spl25_3])])).
% 0.21/0.49 thf(f385,plain,(
% 0.21/0.49 ~spl25_3 | ~spl25_4 | spl25_2),
% 0.21/0.49 inference(avatar_split_clause,[],[f375,f339,f382,f378])).
% 0.21/0.49 thf(f339,plain,(
% 0.21/0.49 spl25_2 <=> ($true = (in @ (binunion @ (setminus @ sK22 @ sK23) @ (setminus @ sK22 @ sK24)) @ (powerset @ sK22)))),
% 0.21/0.49 introduced(avatar_definition,[new_symbols(naming,[spl25_2])])).
% 0.21/0.49 thf(f375,plain,(
% 0.21/0.49 ($true != (in @ (setminus @ sK22 @ sK24) @ (powerset @ sK22))) | ($true != (in @ (setminus @ sK22 @ sK23) @ (powerset @ sK22))) | spl25_2),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f374])).
% 0.21/0.49 thf(f374,plain,(
% 0.21/0.49 ($true != (in @ (setminus @ sK22 @ sK23) @ (powerset @ sK22))) | ($true != (in @ (setminus @ sK22 @ sK24) @ (powerset @ sK22))) | ($true != $true) | spl25_2),
% 0.21/0.49 inference(superposition,[],[f341,f157])).
% 0.21/0.49 thf(f157,plain,(
% 0.21/0.49 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true = (in @ (binunion @ X4 @ X5) @ (powerset @ X3))) | ($true != (in @ X5 @ (powerset @ X3))) | ($true != (in @ X4 @ (powerset @ X3)))) )),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f135])).
% 0.21/0.49 thf(f135,plain,(
% 0.21/0.49 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true = (in @ (binunion @ X4 @ X5) @ (powerset @ X3))) | ($true != (in @ X5 @ (powerset @ X3))) | ($true != (in @ X4 @ (powerset @ X3))) | ($true != $true)) )),
% 0.21/0.49 inference(definition_unfolding,[],[f92,f112])).
% 0.21/0.49 thf(f112,plain,(
% 0.21/0.49 (binunionT_lem = $true)),
% 0.21/0.49 inference(cnf_transformation,[],[f75])).
% 0.21/0.49 thf(f92,plain,(
% 0.21/0.49 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (in @ X4 @ (powerset @ X3))) | ($true = (in @ (binunion @ X4 @ X5) @ (powerset @ X3))) | ($true != (in @ X5 @ (powerset @ X3))) | (binunionT_lem != $true)) )),
% 0.21/0.49 inference(cnf_transformation,[],[f56])).
% 0.21/0.49 thf(f56,plain,(
% 0.21/0.49 ((binunionT_lem = $true) | (($true = (in @ sK10 @ (powerset @ sK9))) & (($true != (in @ (binunion @ sK10 @ sK11) @ (powerset @ sK9))) & ($true = (in @ sK11 @ (powerset @ sK9)))))) & (! [X3,X4] : (($true != (in @ X4 @ (powerset @ X3))) | ! [X5] : (($true = (in @ (binunion @ X4 @ X5) @ (powerset @ X3))) | ($true != (in @ X5 @ (powerset @ X3))))) | (binunionT_lem != $true))),
% 0.21/0.49 inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11])],[f53,f55,f54])).
% 0.21/0.49 thf(f54,plain,(
% 0.21/0.49 ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (((in @ (binunion @ X1 @ X2) @ (powerset @ X0)) != $true) & ((in @ X2 @ (powerset @ X0)) = $true))) => (($true = (in @ sK10 @ (powerset @ sK9))) & ? [X2] : (($true != (in @ (binunion @ sK10 @ X2) @ (powerset @ sK9))) & ($true = (in @ X2 @ (powerset @ sK9)))))),
% 0.21/0.49 introduced(choice_axiom,[])).
% 0.21/0.49 thf(f55,plain,(
% 0.21/0.49 ? [X2] : (($true != (in @ (binunion @ sK10 @ X2) @ (powerset @ sK9))) & ($true = (in @ X2 @ (powerset @ sK9)))) => (($true != (in @ (binunion @ sK10 @ sK11) @ (powerset @ sK9))) & ($true = (in @ sK11 @ (powerset @ sK9))))),
% 0.21/0.49 introduced(choice_axiom,[])).
% 0.21/0.49 thf(f53,plain,(
% 0.21/0.49 ((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] : (($true = (in @ (binunion @ X4 @ X5) @ (powerset @ X3))) | ($true != (in @ X5 @ (powerset @ X3))))) | (binunionT_lem != $true))),
% 0.21/0.49 inference(rectify,[],[f52])).
% 0.21/0.49 thf(f52,plain,(
% 0.21/0.49 ((binunionT_lem = $true) | ? [X1,X0] : (($true = (in @ X0 @ (powerset @ X1))) & ? [X2] : (($true != (in @ (binunion @ X0 @ X2) @ (powerset @ X1))) & ($true = (in @ X2 @ (powerset @ X1)))))) & (! [X1,X0] : (($true != (in @ X0 @ (powerset @ X1))) | ! [X2] : (($true = (in @ (binunion @ X0 @ X2) @ (powerset @ X1))) | ($true != (in @ X2 @ (powerset @ X1))))) | (binunionT_lem != $true))),
% 0.21/0.49 inference(nnf_transformation,[],[f33])).
% 0.21/0.49 thf(f33,plain,(
% 0.21/0.49 (binunionT_lem = $true) <=> ! [X1,X0] : (($true != (in @ X0 @ (powerset @ X1))) | ! [X2] : (($true = (in @ (binunion @ X0 @ X2) @ (powerset @ X1))) | ($true != (in @ X2 @ (powerset @ X1)))))),
% 0.21/0.49 inference(ennf_transformation,[],[f13])).
% 0.21/0.49 thf(f13,plain,(
% 0.21/0.49 ! [X0,X1] : (($true = (in @ X0 @ (powerset @ X1))) => ! [X2] : (($true = (in @ X2 @ (powerset @ X1))) => ($true = (in @ (binunion @ X0 @ X2) @ (powerset @ X1))))) <=> (binunionT_lem = $true)),
% 0.21/0.49 inference(fool_elimination,[],[f12])).
% 0.21/0.49 thf(f12,plain,(
% 0.21/0.49 (binunionT_lem = ! [X0,X1] : ((in @ X0 @ (powerset @ X1)) => ! [X2] : ((in @ X2 @ (powerset @ X1)) => (in @ (binunion @ X0 @ X2) @ (powerset @ X1)))))),
% 0.21/0.49 inference(rectify,[],[f2])).
% 0.21/0.49 thf(f2,axiom,(
% 0.21/0.49 (binunionT_lem = ! [X1,X0] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => (in @ (binunion @ X1 @ X2) @ (powerset @ X0)))))),
% 0.21/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binunionT_lem)).
% 0.21/0.49 thf(f341,plain,(
% 0.21/0.49 ($true != (in @ (binunion @ (setminus @ sK22 @ sK23) @ (setminus @ sK22 @ sK24)) @ (powerset @ sK22))) | spl25_2),
% 0.21/0.49 inference(avatar_component_clause,[],[f339])).
% 0.21/0.49 thf(f368,plain,(
% 0.21/0.49 spl25_1),
% 0.21/0.49 inference(avatar_contradiction_clause,[],[f367])).
% 0.21/0.49 thf(f367,plain,(
% 0.21/0.49 $false | spl25_1),
% 0.21/0.49 inference(subsumption_resolution,[],[f366,f117])).
% 0.21/0.49 thf(f366,plain,(
% 0.21/0.49 ($true != (in @ sK23 @ (powerset @ sK22))) | spl25_1),
% 0.21/0.49 inference(subsumption_resolution,[],[f365,f115])).
% 0.21/0.49 thf(f365,plain,(
% 0.21/0.49 ($true != (in @ sK24 @ (powerset @ sK22))) | ($true != (in @ sK23 @ (powerset @ sK22))) | spl25_1),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f364])).
% 0.21/0.49 thf(f364,plain,(
% 0.21/0.49 ($true != $true) | ($true != (in @ sK24 @ (powerset @ sK22))) | ($true != (in @ sK23 @ (powerset @ sK22))) | spl25_1),
% 0.21/0.49 inference(superposition,[],[f353,f155])).
% 0.21/0.49 thf(f155,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ (binintersect @ X1 @ X2) @ (powerset @ X0)) = $true) | ((in @ X2 @ (powerset @ X0)) != $true) | ((in @ X1 @ (powerset @ X0)) != $true)) )),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f128])).
% 0.21/0.49 thf(f128,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X1 @ (powerset @ X0)) != $true) | ((in @ X2 @ (powerset @ X0)) != $true) | ($true != $true) | ((in @ (binintersect @ X1 @ X2) @ (powerset @ X0)) = $true)) )),
% 0.21/0.49 inference(definition_unfolding,[],[f91,f111])).
% 0.21/0.49 thf(f111,plain,(
% 0.21/0.49 (binintersectT_lem = $true)),
% 0.21/0.49 inference(cnf_transformation,[],[f75])).
% 0.21/0.49 thf(f91,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X1 @ (powerset @ X0)) != $true) | ((in @ (binintersect @ X1 @ X2) @ (powerset @ X0)) = $true) | ((in @ X2 @ (powerset @ X0)) != $true) | (binintersectT_lem != $true)) )),
% 0.21/0.49 inference(cnf_transformation,[],[f51])).
% 0.21/0.49 thf(f51,plain,(
% 0.21/0.49 (! [X0,X1] : (((in @ X1 @ (powerset @ X0)) != $true) | ! [X2] : (((in @ (binintersect @ X1 @ X2) @ (powerset @ X0)) = $true) | ((in @ X2 @ (powerset @ X0)) != $true))) | (binintersectT_lem != $true)) & ((binintersectT_lem = $true) | (($true = (in @ sK7 @ (powerset @ sK6))) & (($true != (in @ (binintersect @ sK7 @ sK8) @ (powerset @ sK6))) & ($true = (in @ sK8 @ (powerset @ sK6))))))),
% 0.21/0.49 inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f48,f50,f49])).
% 0.21/0.49 thf(f49,plain,(
% 0.21/0.49 ? [X3,X4] : (($true = (in @ X4 @ (powerset @ X3))) & ? [X5] : (($true != (in @ (binintersect @ X4 @ X5) @ (powerset @ X3))) & ($true = (in @ X5 @ (powerset @ X3))))) => (($true = (in @ sK7 @ (powerset @ sK6))) & ? [X5] : (($true != (in @ (binintersect @ sK7 @ X5) @ (powerset @ sK6))) & ($true = (in @ X5 @ (powerset @ sK6)))))),
% 0.21/0.49 introduced(choice_axiom,[])).
% 0.21/0.49 thf(f50,plain,(
% 0.21/0.49 ? [X5] : (($true != (in @ (binintersect @ sK7 @ X5) @ (powerset @ sK6))) & ($true = (in @ X5 @ (powerset @ sK6)))) => (($true != (in @ (binintersect @ sK7 @ sK8) @ (powerset @ sK6))) & ($true = (in @ sK8 @ (powerset @ sK6))))),
% 0.21/0.49 introduced(choice_axiom,[])).
% 0.21/0.49 thf(f48,plain,(
% 0.21/0.49 (! [X0,X1] : (((in @ X1 @ (powerset @ X0)) != $true) | ! [X2] : (((in @ (binintersect @ X1 @ X2) @ (powerset @ X0)) = $true) | ((in @ X2 @ (powerset @ X0)) != $true))) | (binintersectT_lem != $true)) & ((binintersectT_lem = $true) | ? [X3,X4] : (($true = (in @ X4 @ (powerset @ X3))) & ? [X5] : (($true != (in @ (binintersect @ X4 @ X5) @ (powerset @ X3))) & ($true = (in @ X5 @ (powerset @ X3))))))),
% 0.21/0.49 inference(rectify,[],[f47])).
% 0.21/0.49 thf(f47,plain,(
% 0.21/0.49 (! [X1,X0] : (($true != (in @ X0 @ (powerset @ X1))) | ! [X2] : (($true = (in @ (binintersect @ X0 @ X2) @ (powerset @ X1))) | ($true != (in @ X2 @ (powerset @ X1))))) | (binintersectT_lem != $true)) & ((binintersectT_lem = $true) | ? [X1,X0] : (($true = (in @ X0 @ (powerset @ X1))) & ? [X2] : (($true != (in @ (binintersect @ X0 @ X2) @ (powerset @ X1))) & ($true = (in @ X2 @ (powerset @ X1))))))),
% 0.21/0.49 inference(nnf_transformation,[],[f34])).
% 0.21/0.49 thf(f34,plain,(
% 0.21/0.49 ! [X1,X0] : (($true != (in @ X0 @ (powerset @ X1))) | ! [X2] : (($true = (in @ (binintersect @ X0 @ X2) @ (powerset @ X1))) | ($true != (in @ X2 @ (powerset @ X1))))) <=> (binintersectT_lem = $true)),
% 0.21/0.49 inference(ennf_transformation,[],[f17])).
% 0.21/0.49 thf(f17,plain,(
% 0.21/0.49 (binintersectT_lem = $true) <=> ! [X0,X1] : (($true = (in @ X0 @ (powerset @ X1))) => ! [X2] : (($true = (in @ X2 @ (powerset @ X1))) => ($true = (in @ (binintersect @ X0 @ X2) @ (powerset @ X1)))))),
% 0.21/0.49 inference(fool_elimination,[],[f16])).
% 0.21/0.49 thf(f16,plain,(
% 0.21/0.49 (! [X0,X1] : ((in @ X0 @ (powerset @ X1)) => ! [X2] : ((in @ X2 @ (powerset @ X1)) => (in @ (binintersect @ X0 @ X2) @ (powerset @ X1)))) = binintersectT_lem)),
% 0.21/0.49 inference(rectify,[],[f1])).
% 0.21/0.49 thf(f1,axiom,(
% 0.21/0.49 (! [X1,X0] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => (in @ (binintersect @ X1 @ X2) @ (powerset @ X0)))) = binintersectT_lem)),
% 0.21/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectT_lem)).
% 0.21/0.49 thf(f353,plain,(
% 0.21/0.49 ((in @ (binintersect @ sK23 @ sK24) @ (powerset @ sK22)) != $true) | spl25_1),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f352])).
% 0.21/0.49 thf(f352,plain,(
% 0.21/0.49 ($true != $true) | ((in @ (binintersect @ sK23 @ sK24) @ (powerset @ sK22)) != $true) | spl25_1),
% 0.21/0.49 inference(superposition,[],[f337,f153])).
% 0.21/0.49 thf(f337,plain,(
% 0.21/0.49 ($true != (in @ (setminus @ sK22 @ (binintersect @ sK23 @ sK24)) @ (powerset @ sK22))) | spl25_1),
% 0.21/0.49 inference(avatar_component_clause,[],[f335])).
% 0.21/0.49 thf(f335,plain,(
% 0.21/0.49 spl25_1 <=> ($true = (in @ (setminus @ sK22 @ (binintersect @ sK23 @ sK24)) @ (powerset @ sK22)))),
% 0.21/0.49 introduced(avatar_definition,[new_symbols(naming,[spl25_1])])).
% 0.21/0.49 thf(f342,plain,(
% 0.21/0.49 ~spl25_1 | ~spl25_2),
% 0.21/0.49 inference(avatar_split_clause,[],[f333,f339,f335])).
% 0.21/0.49 thf(f333,plain,(
% 0.21/0.49 ($true != (in @ (binunion @ (setminus @ sK22 @ sK23) @ (setminus @ sK22 @ sK24)) @ (powerset @ sK22))) | ($true != (in @ (setminus @ sK22 @ (binintersect @ sK23 @ sK24)) @ (powerset @ sK22)))),
% 0.21/0.49 inference(subsumption_resolution,[],[f332,f115])).
% 0.21/0.49 thf(f332,plain,(
% 0.21/0.49 ($true != (in @ (setminus @ sK22 @ (binintersect @ sK23 @ sK24)) @ (powerset @ sK22))) | ($true != (in @ sK24 @ (powerset @ sK22))) | ($true != (in @ (binunion @ (setminus @ sK22 @ sK23) @ (setminus @ sK22 @ sK24)) @ (powerset @ sK22)))),
% 0.21/0.49 inference(subsumption_resolution,[],[f325,f117])).
% 0.21/0.49 thf(f325,plain,(
% 0.21/0.49 ($true != (in @ sK23 @ (powerset @ sK22))) | ($true != (in @ sK24 @ (powerset @ sK22))) | ($true != (in @ (binunion @ (setminus @ sK22 @ sK23) @ (setminus @ sK22 @ sK24)) @ (powerset @ sK22))) | ($true != (in @ (setminus @ sK22 @ (binintersect @ sK23 @ sK24)) @ (powerset @ sK22)))),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f286])).
% 0.21/0.49 thf(f286,plain,(
% 0.21/0.49 ($true != (in @ (binunion @ (setminus @ sK22 @ sK23) @ (setminus @ sK22 @ sK24)) @ (powerset @ sK22))) | ($true != (in @ sK23 @ (powerset @ sK22))) | ($true != (in @ sK24 @ (powerset @ sK22))) | ((setminus @ sK22 @ (binintersect @ sK23 @ sK24)) != (setminus @ sK22 @ (binintersect @ sK23 @ sK24))) | ($true != (in @ (setminus @ sK22 @ (binintersect @ sK23 @ sK24)) @ (powerset @ sK22)))),
% 0.21/0.49 inference(superposition,[],[f116,f276])).
% 0.21/0.49 thf(f276,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((setminus @ X0 @ (binintersect @ X1 @ X2)) = (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) | ((in @ X2 @ (powerset @ X0)) != $true) | ($true != (in @ (setminus @ X0 @ (binintersect @ X1 @ X2)) @ (powerset @ X0))) | ((in @ X1 @ (powerset @ X0)) != $true) | ($true != (in @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ (powerset @ X0)))) )),
% 0.21/0.49 inference(subsumption_resolution,[],[f273,f236])).
% 0.21/0.49 thf(f236,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (sP0 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X0 @ (setminus @ X0 @ (binintersect @ X1 @ X2)))) | ((in @ X1 @ (powerset @ X0)) != $true) | ((in @ X2 @ (powerset @ X0)) != $true)) )),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f235])).
% 0.21/0.49 thf(f235,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != $true) | ($true != (sP0 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X0 @ (setminus @ X0 @ (binintersect @ X1 @ X2)))) | ((in @ X1 @ (powerset @ X0)) != $true) | ((in @ X2 @ (powerset @ X0)) != $true)) )),
% 0.21/0.49 inference(duplicate_literal_removal,[],[f231])).
% 0.21/0.49 thf(f231,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (sP0 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X0 @ (setminus @ X0 @ (binintersect @ X1 @ X2)))) | ((in @ X2 @ (powerset @ X0)) != $true) | ($true != $true) | ((in @ X1 @ (powerset @ X0)) != $true) | ($true != (sP0 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X0 @ (setminus @ X0 @ (binintersect @ X1 @ X2))))) )),
% 0.21/0.49 inference(superposition,[],[f198,f77])).
% 0.21/0.49 thf(f77,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (in @ (sK1 @ X2 @ X1 @ X0) @ X1)) | ($true != (sP0 @ X2 @ X1 @ X0))) )),
% 0.21/0.49 inference(cnf_transformation,[],[f40])).
% 0.21/0.49 thf(f40,plain,(
% 0.21/0.49 ! [X0,X1,X2] : ((($true = (sP0 @ X2 @ X1 @ X0)) | ! [X3] : (((in @ X3 @ X0) != $true) | ((in @ X3 @ X1) != $true) | ((in @ X3 @ X2) = $true))) & ((($true = (in @ (sK1 @ X2 @ X1 @ X0) @ X0)) & ($true = (in @ (sK1 @ X2 @ X1 @ X0) @ X1)) & ($true != (in @ (sK1 @ X2 @ X1 @ X0) @ X2))) | ($true != (sP0 @ X2 @ X1 @ X0))))),
% 0.21/0.49 inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f38,f39])).
% 0.21/0.49 thf(f39,plain,(
% 0.21/0.49 ! [X0,X1,X2] : (? [X4] : (($true = (in @ X4 @ X0)) & ($true = (in @ X4 @ X1)) & ($true != (in @ X4 @ X2))) => (($true = (in @ (sK1 @ X2 @ X1 @ X0) @ X0)) & ($true = (in @ (sK1 @ X2 @ X1 @ X0) @ X1)) & ($true != (in @ (sK1 @ X2 @ X1 @ X0) @ X2))))),
% 0.21/0.49 introduced(choice_axiom,[])).
% 0.21/0.49 thf(f38,plain,(
% 0.21/0.49 ! [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)) & ($true = (in @ X4 @ X1)) & ($true != (in @ X4 @ X2))) | ($true != (sP0 @ X2 @ X1 @ X0))))),
% 0.21/0.49 inference(rectify,[],[f37])).
% 0.21/0.49 thf(f37,plain,(
% 0.21/0.49 ! [X2,X1,X0] : ((($true = (sP0 @ X0 @ X1 @ X2)) | ! [X4] : (($true != (in @ X4 @ X2)) | ($true != (in @ X4 @ X1)) | ($true = (in @ X4 @ X0)))) & (? [X4] : (($true = (in @ X4 @ X2)) & ($true = (in @ X4 @ X1)) & ($true != (in @ X4 @ X0))) | ($true != (sP0 @ X0 @ X1 @ X2))))),
% 0.21/0.49 inference(nnf_transformation,[],[f35])).
% 0.21/0.49 thf(f35,plain,(
% 0.21/0.49 ! [X2,X1,X0] : (($true = (sP0 @ X0 @ X1 @ X2)) <=> ? [X4] : (($true = (in @ X4 @ X2)) & ($true = (in @ X4 @ X1)) & ($true != (in @ X4 @ X0))))),
% 0.21/0.49 introduced(predicate_definition_introduction,[new_symbols(naming,[=])])).
% 0.21/0.49 thf(f198,plain,(
% 0.21/0.49 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (($true != (in @ (sK1 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) @ X0)) | ($true != (sP0 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2)))) | ((in @ X2 @ (powerset @ X0)) != $true) | ((in @ X1 @ (powerset @ X0)) != $true)) )),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f197])).
% 0.21/0.49 thf(f197,plain,(
% 0.21/0.49 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (($true != $true) | ($true != (in @ (sK1 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) @ X0)) | ((in @ X2 @ (powerset @ X0)) != $true) | ($true != (sP0 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2)))) | ((in @ X1 @ (powerset @ X0)) != $true)) )),
% 0.21/0.49 inference(duplicate_literal_removal,[],[f193])).
% 0.21/0.49 thf(f193,plain,(
% 0.21/0.49 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (($true != $true) | ($true != (sP0 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2)))) | ($true != (in @ (sK1 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) @ X0)) | ((in @ X2 @ (powerset @ X0)) != $true) | ($true != (sP0 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2)))) | ((in @ X1 @ (powerset @ X0)) != $true)) )),
% 0.21/0.49 inference(superposition,[],[f174,f78])).
% 0.21/0.49 thf(f78,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (in @ (sK1 @ X2 @ X1 @ X0) @ X0)) | ($true != (sP0 @ X2 @ X1 @ X0))) )),
% 0.21/0.49 inference(cnf_transformation,[],[f40])).
% 0.21/0.49 thf(f174,plain,(
% 0.21/0.49 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (($true != (in @ (sK1 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X3 @ X4) @ (setminus @ X0 @ (binintersect @ X1 @ X2)))) | ((in @ X2 @ (powerset @ X0)) != $true) | ((in @ X1 @ (powerset @ X0)) != $true) | ((in @ (sK1 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X3 @ X4) @ X0) != $true) | ($true != (sP0 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X3 @ X4))) )),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f172])).
% 0.21/0.49 thf(f172,plain,(
% 0.21/0.49 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (((in @ X1 @ (powerset @ X0)) != $true) | ((in @ X2 @ (powerset @ X0)) != $true) | ($true != (in @ (sK1 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X3 @ X4) @ (setminus @ X0 @ (binintersect @ X1 @ X2)))) | ($true != $true) | ((in @ (sK1 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X3 @ X4) @ X0) != $true) | ($true != (sP0 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X3 @ X4))) )),
% 0.21/0.49 inference(superposition,[],[f76,f158])).
% 0.21/0.49 thf(f158,plain,(
% 0.21/0.49 ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $i] : (($true = (in @ X7 @ (binunion @ (setminus @ X4 @ X5) @ (setminus @ X4 @ X6)))) | ((in @ X6 @ (powerset @ X4)) != $true) | ($true != (in @ X7 @ (setminus @ X4 @ (binintersect @ X5 @ X6)))) | ($true != (in @ X7 @ X4)) | ($true != (in @ X5 @ (powerset @ X4)))) )),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f141])).
% 0.21/0.49 thf(f141,plain,(
% 0.21/0.49 ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $i] : (($true = (in @ X7 @ (binunion @ (setminus @ X4 @ X5) @ (setminus @ X4 @ X6)))) | ($true != (in @ X5 @ (powerset @ X4))) | ($true != (in @ X7 @ X4)) | ($true != $true) | ($true != (in @ X7 @ (setminus @ X4 @ (binintersect @ X5 @ X6)))) | ((in @ X6 @ (powerset @ X4)) != $true)) )),
% 0.21/0.49 inference(definition_unfolding,[],[f96,f114])).
% 0.21/0.49 thf(f114,plain,(
% 0.21/0.49 (demorgan1a = $true)),
% 0.21/0.49 inference(cnf_transformation,[],[f75])).
% 0.21/0.49 thf(f96,plain,(
% 0.21/0.49 ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $i] : (($true != (in @ X7 @ X4)) | ($true = (in @ X7 @ (binunion @ (setminus @ X4 @ X5) @ (setminus @ X4 @ X6)))) | ($true != (in @ X7 @ (setminus @ X4 @ (binintersect @ X5 @ X6)))) | ((in @ X6 @ (powerset @ X4)) != $true) | ($true != (in @ X5 @ (powerset @ X4))) | (demorgan1a != $true)) )),
% 0.21/0.49 inference(cnf_transformation,[],[f62])).
% 0.21/0.49 thf(f62,plain,(
% 0.21/0.49 ((demorgan1a = $true) | (((($true = (in @ sK15 @ sK12)) & ($true != (in @ sK15 @ (binunion @ (setminus @ sK12 @ sK13) @ (setminus @ sK12 @ sK14)))) & ($true = (in @ sK15 @ (setminus @ sK12 @ (binintersect @ sK13 @ sK14))))) & ($true = (in @ sK14 @ (powerset @ sK12)))) & ((in @ sK13 @ (powerset @ sK12)) = $true))) & (! [X4,X5] : (! [X6] : (! [X7] : (($true != (in @ X7 @ X4)) | ($true = (in @ X7 @ (binunion @ (setminus @ X4 @ X5) @ (setminus @ X4 @ X6)))) | ($true != (in @ X7 @ (setminus @ X4 @ (binintersect @ X5 @ X6))))) | ((in @ X6 @ (powerset @ X4)) != $true)) | ($true != (in @ X5 @ (powerset @ X4)))) | (demorgan1a != $true))),
% 0.21/0.49 inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13,sK14,sK15])],[f58,f61,f60,f59])).
% 0.21/0.49 thf(f59,plain,(
% 0.21/0.49 ? [X0,X1] : (? [X2] : (? [X3] : (((in @ X3 @ X0) = $true) & ((in @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) != $true) & ((in @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) = $true)) & ((in @ X2 @ (powerset @ X0)) = $true)) & ((in @ X1 @ (powerset @ X0)) = $true)) => (? [X2] : (? [X3] : (($true = (in @ X3 @ sK12)) & ((in @ X3 @ (binunion @ (setminus @ sK12 @ sK13) @ (setminus @ sK12 @ X2))) != $true) & ($true = (in @ X3 @ (setminus @ sK12 @ (binintersect @ sK13 @ X2))))) & ($true = (in @ X2 @ (powerset @ sK12)))) & ((in @ sK13 @ (powerset @ sK12)) = $true))),
% 0.21/0.49 introduced(choice_axiom,[])).
% 0.21/0.49 thf(f60,plain,(
% 0.21/0.49 ? [X2] : (? [X3] : (($true = (in @ X3 @ sK12)) & ((in @ X3 @ (binunion @ (setminus @ sK12 @ sK13) @ (setminus @ sK12 @ X2))) != $true) & ($true = (in @ X3 @ (setminus @ sK12 @ (binintersect @ sK13 @ X2))))) & ($true = (in @ X2 @ (powerset @ sK12)))) => (? [X3] : (($true = (in @ X3 @ sK12)) & ($true != (in @ X3 @ (binunion @ (setminus @ sK12 @ sK13) @ (setminus @ sK12 @ sK14)))) & ($true = (in @ X3 @ (setminus @ sK12 @ (binintersect @ sK13 @ sK14))))) & ($true = (in @ sK14 @ (powerset @ sK12))))),
% 0.21/0.49 introduced(choice_axiom,[])).
% 0.21/0.49 thf(f61,plain,(
% 0.21/0.49 ? [X3] : (($true = (in @ X3 @ sK12)) & ($true != (in @ X3 @ (binunion @ (setminus @ sK12 @ sK13) @ (setminus @ sK12 @ sK14)))) & ($true = (in @ X3 @ (setminus @ sK12 @ (binintersect @ sK13 @ sK14))))) => (($true = (in @ sK15 @ sK12)) & ($true != (in @ sK15 @ (binunion @ (setminus @ sK12 @ sK13) @ (setminus @ sK12 @ sK14)))) & ($true = (in @ sK15 @ (setminus @ sK12 @ (binintersect @ sK13 @ sK14)))))),
% 0.21/0.49 introduced(choice_axiom,[])).
% 0.21/0.49 thf(f58,plain,(
% 0.21/0.49 ((demorgan1a = $true) | ? [X0,X1] : (? [X2] : (? [X3] : (((in @ X3 @ X0) = $true) & ((in @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) != $true) & ((in @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) = $true)) & ((in @ X2 @ (powerset @ X0)) = $true)) & ((in @ X1 @ (powerset @ X0)) = $true))) & (! [X4,X5] : (! [X6] : (! [X7] : (($true != (in @ X7 @ X4)) | ($true = (in @ X7 @ (binunion @ (setminus @ X4 @ X5) @ (setminus @ X4 @ X6)))) | ($true != (in @ X7 @ (setminus @ X4 @ (binintersect @ X5 @ X6))))) | ((in @ X6 @ (powerset @ X4)) != $true)) | ($true != (in @ X5 @ (powerset @ X4)))) | (demorgan1a != $true))),
% 0.21/0.49 inference(rectify,[],[f57])).
% 0.21/0.49 thf(f57,plain,(
% 0.21/0.49 ((demorgan1a = $true) | ? [X0,X1] : (? [X2] : (? [X3] : (((in @ X3 @ X0) = $true) & ((in @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) != $true) & ((in @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) = $true)) & ((in @ X2 @ (powerset @ X0)) = $true)) & ((in @ X1 @ (powerset @ X0)) = $true))) & (! [X0,X1] : (! [X2] : (! [X3] : (((in @ X3 @ X0) != $true) | ((in @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true) | ((in @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) != $true)) | ((in @ X2 @ (powerset @ X0)) != $true)) | ((in @ X1 @ (powerset @ X0)) != $true)) | (demorgan1a != $true))),
% 0.21/0.49 inference(nnf_transformation,[],[f25])).
% 0.21/0.49 thf(f25,plain,(
% 0.21/0.49 (demorgan1a = $true) <=> ! [X0,X1] : (! [X2] : (! [X3] : (((in @ X3 @ X0) != $true) | ((in @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true) | ((in @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) != $true)) | ((in @ X2 @ (powerset @ X0)) != $true)) | ((in @ X1 @ (powerset @ X0)) != $true))),
% 0.21/0.49 inference(flattening,[],[f24])).
% 0.21/0.49 thf(f24,plain,(
% 0.21/0.49 ! [X1,X0] : (! [X2] : (! [X3] : ((((in @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true) | ((in @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) != $true)) | ((in @ X3 @ X0) != $true)) | ((in @ X2 @ (powerset @ X0)) != $true)) | ((in @ X1 @ (powerset @ X0)) != $true)) <=> (demorgan1a = $true)),
% 0.21/0.49 inference(ennf_transformation,[],[f19])).
% 0.21/0.49 thf(f19,plain,(
% 0.21/0.49 ! [X1,X0] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X0)) = $true) => ! [X3] : (((in @ X3 @ X0) = $true) => (((in @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) = $true) => ((in @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true))))) <=> (demorgan1a = $true)),
% 0.21/0.49 inference(fool_elimination,[],[f18])).
% 0.21/0.49 thf(f18,plain,(
% 0.21/0.49 (demorgan1a = ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X3] : ((in @ X3 @ X0) => ((in @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) => (in @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))))))))),
% 0.21/0.49 inference(rectify,[],[f5])).
% 0.21/0.49 thf(f5,axiom,(
% 0.21/0.49 (demorgan1a = ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X3] : ((in @ X3 @ X0) => ((in @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) => (in @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))))))))),
% 0.21/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',demorgan1a)).
% 0.21/0.49 thf(f76,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ (sK1 @ X2 @ X1 @ X0) @ X2)) | ($true != (sP0 @ X2 @ X1 @ X0))) )),
% 0.21/0.49 inference(cnf_transformation,[],[f40])).
% 0.21/0.49 thf(f273,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ (setminus @ X0 @ (binintersect @ X1 @ X2)) @ (powerset @ X0))) | ((in @ X1 @ (powerset @ X0)) != $true) | ((in @ X2 @ (powerset @ X0)) != $true) | ((setminus @ X0 @ (binintersect @ X1 @ X2)) = (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) | ($true = (sP0 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X0 @ (setminus @ X0 @ (binintersect @ X1 @ X2)))) | ($true != (in @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ (powerset @ X0)))) )),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f272])).
% 0.21/0.49 thf(f272,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != $true) | ($true = (sP0 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X0 @ (setminus @ X0 @ (binintersect @ X1 @ X2)))) | ((in @ X2 @ (powerset @ X0)) != $true) | ((setminus @ X0 @ (binintersect @ X1 @ X2)) = (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) | ($true != (in @ (setminus @ X0 @ (binintersect @ X1 @ X2)) @ (powerset @ X0))) | ((in @ X1 @ (powerset @ X0)) != $true) | ($true != (in @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ (powerset @ X0)))) )),
% 0.21/0.49 inference(duplicate_literal_removal,[],[f268])).
% 0.21/0.49 thf(f268,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X2 @ (powerset @ X0)) != $true) | ($true != (in @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ (powerset @ X0))) | ((setminus @ X0 @ (binintersect @ X1 @ X2)) = (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) | ($true != (in @ (setminus @ X0 @ (binintersect @ X1 @ X2)) @ (powerset @ X0))) | ($true = (sP0 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X0 @ (setminus @ X0 @ (binintersect @ X1 @ X2)))) | ((setminus @ X0 @ (binintersect @ X1 @ X2)) = (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) | ((in @ X1 @ (powerset @ X0)) != $true) | ($true != (in @ (setminus @ X0 @ (binintersect @ X1 @ X2)) @ (powerset @ X0))) | ($true != $true) | ($true = (sP0 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X0 @ (setminus @ X0 @ (binintersect @ X1 @ X2)))) | ($true != (in @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ (powerset @ X0)))) )),
% 0.21/0.49 inference(superposition,[],[f207,f156])).
% 0.21/0.49 thf(f156,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (in @ (sK2 @ X2 @ X1 @ X0) @ X1)) | ($true != (in @ X0 @ (powerset @ X1))) | (X0 = X2) | ($true != (in @ X2 @ (powerset @ X1))) | ($true = (sP0 @ X0 @ X1 @ X2))) )),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f122])).
% 0.21/0.49 thf(f122,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != $true) | (X0 = X2) | ($true != (in @ X0 @ (powerset @ X1))) | ($true = (in @ (sK2 @ X2 @ X1 @ X0) @ X1)) | ($true = (sP0 @ X0 @ X1 @ X2)) | ($true != (in @ X2 @ (powerset @ X1)))) )),
% 0.21/0.49 inference(definition_unfolding,[],[f85,f113])).
% 0.21/0.49 thf(f113,plain,(
% 0.21/0.49 (setextT = $true)),
% 0.21/0.49 inference(cnf_transformation,[],[f75])).
% 0.21/0.49 thf(f85,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (in @ (sK2 @ X2 @ X1 @ X0) @ X1)) | (X0 = X2) | ($true = (sP0 @ X0 @ X1 @ X2)) | ($true != (in @ X2 @ (powerset @ X1))) | ($true != (in @ X0 @ (powerset @ X1))) | (setextT != $true)) )),
% 0.21/0.49 inference(cnf_transformation,[],[f46])).
% 0.21/0.49 thf(f46,plain,(
% 0.21/0.49 (! [X0,X1] : (! [X2] : ((($true != (in @ (sK2 @ X2 @ X1 @ X0) @ X2)) & ($true = (in @ (sK2 @ X2 @ X1 @ X0) @ X0)) & ($true = (in @ (sK2 @ X2 @ X1 @ X0) @ X1))) | (X0 = X2) | ($true = (sP0 @ X0 @ X1 @ X2)) | ($true != (in @ X2 @ (powerset @ X1)))) | ($true != (in @ X0 @ (powerset @ X1)))) | (setextT != $true)) & ((setextT = $true) | ((! [X7] : (($true = (in @ X7 @ sK5)) | ($true != (in @ X7 @ sK3)) | ($true != (in @ X7 @ sK4))) & (sK5 != sK3) & ((sP0 @ sK3 @ sK4 @ sK5) != $true) & ($true = (in @ sK5 @ (powerset @ sK4)))) & ($true = (in @ sK3 @ (powerset @ sK4)))))),
% 0.21/0.49 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f42,f45,f44,f43])).
% 0.21/0.49 thf(f43,plain,(
% 0.21/0.49 ! [X0,X1,X2] : (? [X3] : (((in @ X3 @ X2) != $true) & ((in @ X3 @ X0) = $true) & ((in @ X3 @ X1) = $true)) => (($true != (in @ (sK2 @ X2 @ X1 @ X0) @ X2)) & ($true = (in @ (sK2 @ X2 @ X1 @ X0) @ X0)) & ($true = (in @ (sK2 @ X2 @ X1 @ X0) @ X1))))),
% 0.21/0.49 introduced(choice_axiom,[])).
% 0.21/0.49 thf(f44,plain,(
% 0.21/0.49 ? [X4,X5] : (? [X6] : (! [X7] : (($true = (in @ X7 @ X6)) | ($true != (in @ X7 @ X4)) | ($true != (in @ X7 @ X5))) & (X4 != X6) & ($true != (sP0 @ X4 @ X5 @ X6)) & ($true = (in @ X6 @ (powerset @ X5)))) & ($true = (in @ X4 @ (powerset @ X5)))) => (? [X6] : (! [X7] : (($true = (in @ X7 @ X6)) | ($true != (in @ X7 @ sK3)) | ($true != (in @ X7 @ sK4))) & (sK3 != X6) & ($true != (sP0 @ sK3 @ sK4 @ X6)) & ((in @ X6 @ (powerset @ sK4)) = $true)) & ($true = (in @ sK3 @ (powerset @ sK4))))),
% 0.21/0.49 introduced(choice_axiom,[])).
% 0.21/0.49 thf(f45,plain,(
% 0.21/0.49 ? [X6] : (! [X7] : (($true = (in @ X7 @ X6)) | ($true != (in @ X7 @ sK3)) | ($true != (in @ X7 @ sK4))) & (sK3 != X6) & ($true != (sP0 @ sK3 @ sK4 @ X6)) & ((in @ X6 @ (powerset @ sK4)) = $true)) => (! [X7] : (($true = (in @ X7 @ sK5)) | ($true != (in @ X7 @ sK3)) | ($true != (in @ X7 @ sK4))) & (sK5 != sK3) & ((sP0 @ sK3 @ sK4 @ sK5) != $true) & ($true = (in @ sK5 @ (powerset @ sK4))))),
% 0.21/0.49 introduced(choice_axiom,[])).
% 0.21/0.49 thf(f42,plain,(
% 0.21/0.49 (! [X0,X1] : (! [X2] : (? [X3] : (((in @ X3 @ X2) != $true) & ((in @ X3 @ X0) = $true) & ((in @ X3 @ X1) = $true)) | (X0 = X2) | ($true = (sP0 @ X0 @ X1 @ X2)) | ($true != (in @ X2 @ (powerset @ X1)))) | ($true != (in @ X0 @ (powerset @ X1)))) | (setextT != $true)) & ((setextT = $true) | ? [X4,X5] : (? [X6] : (! [X7] : (($true = (in @ X7 @ X6)) | ($true != (in @ X7 @ X4)) | ($true != (in @ X7 @ X5))) & (X4 != X6) & ($true != (sP0 @ X4 @ X5 @ X6)) & ($true = (in @ X6 @ (powerset @ X5)))) & ($true = (in @ X4 @ (powerset @ X5)))))),
% 0.21/0.49 inference(rectify,[],[f41])).
% 0.21/0.49 thf(f41,plain,(
% 0.21/0.49 (! [X0,X1] : (! [X2] : (? [X3] : (((in @ X3 @ X2) != $true) & ((in @ X3 @ X0) = $true) & ((in @ X3 @ X1) = $true)) | (X0 = X2) | ($true = (sP0 @ X0 @ X1 @ X2)) | ($true != (in @ X2 @ (powerset @ X1)))) | ($true != (in @ X0 @ (powerset @ X1)))) | (setextT != $true)) & ((setextT = $true) | ? [X0,X1] : (? [X2] : (! [X3] : (((in @ X3 @ X2) = $true) | ((in @ X3 @ X0) != $true) | ((in @ X3 @ X1) != $true)) & (X0 != X2) & ($true != (sP0 @ X0 @ X1 @ X2)) & ($true = (in @ X2 @ (powerset @ X1)))) & ($true = (in @ X0 @ (powerset @ X1)))))),
% 0.21/0.49 inference(nnf_transformation,[],[f36])).
% 0.21/0.49 thf(f36,plain,(
% 0.21/0.49 ! [X0,X1] : (! [X2] : (? [X3] : (((in @ X3 @ X2) != $true) & ((in @ X3 @ X0) = $true) & ((in @ X3 @ X1) = $true)) | (X0 = X2) | ($true = (sP0 @ X0 @ X1 @ X2)) | ($true != (in @ X2 @ (powerset @ X1)))) | ($true != (in @ X0 @ (powerset @ X1)))) <=> (setextT = $true)),
% 0.21/0.49 inference(definition_folding,[],[f30,f35])).
% 0.21/0.49 thf(f30,plain,(
% 0.21/0.49 ! [X0,X1] : (! [X2] : (? [X3] : (((in @ X3 @ X2) != $true) & ((in @ X3 @ X0) = $true) & ((in @ X3 @ X1) = $true)) | (X0 = X2) | ? [X4] : (($true = (in @ X4 @ X2)) & ($true = (in @ X4 @ X1)) & ($true != (in @ X4 @ X0))) | ($true != (in @ X2 @ (powerset @ X1)))) | ($true != (in @ X0 @ (powerset @ X1)))) <=> (setextT = $true)),
% 0.21/0.49 inference(flattening,[],[f29])).
% 0.21/0.49 thf(f29,plain,(
% 0.21/0.49 (setextT = $true) <=> ! [X1,X0] : (! [X2] : ((((X0 = X2) | ? [X4] : ((($true != (in @ X4 @ X0)) & ($true = (in @ X4 @ X2))) & ($true = (in @ X4 @ X1)))) | ? [X3] : ((((in @ X3 @ X2) != $true) & ((in @ X3 @ X0) = $true)) & ((in @ X3 @ X1) = $true))) | ($true != (in @ X2 @ (powerset @ X1)))) | ($true != (in @ X0 @ (powerset @ X1))))),
% 0.21/0.49 inference(ennf_transformation,[],[f23])).
% 0.21/0.49 thf(f23,plain,(
% 0.21/0.49 (setextT = $true) <=> ! [X1,X0] : (($true = (in @ X0 @ (powerset @ X1))) => ! [X2] : (($true = (in @ X2 @ (powerset @ X1))) => (! [X3] : (((in @ X3 @ X1) = $true) => (((in @ X3 @ X0) = $true) => ((in @ X3 @ X2) = $true))) => (! [X4] : (($true = (in @ X4 @ X1)) => (($true = (in @ X4 @ X2)) => ($true = (in @ X4 @ X0)))) => (X0 = X2)))))),
% 0.21/0.49 inference(fool_elimination,[],[f22])).
% 0.21/0.49 thf(f22,plain,(
% 0.21/0.49 (! [X0,X1] : ((in @ X0 @ (powerset @ X1)) => ! [X2] : ((in @ X2 @ (powerset @ X1)) => (! [X3] : ((in @ X3 @ X1) => ((in @ X3 @ X0) => (in @ X3 @ X2))) => (! [X4] : ((in @ X4 @ X1) => ((in @ X4 @ X2) => (in @ X4 @ X0))) => (X0 = X2))))) = setextT)),
% 0.21/0.49 inference(rectify,[],[f4])).
% 0.21/0.49 thf(f4,axiom,(
% 0.21/0.49 (! [X1,X0] : ((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))))) = setextT)),
% 0.21/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setextT)).
% 0.21/0.49 thf(f207,plain,(
% 0.21/0.49 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (($true != (in @ (sK2 @ (setminus @ X0 @ (binintersect @ X1 @ X2)) @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) @ X0)) | ($true != (in @ (setminus @ X0 @ (binintersect @ X1 @ X2)) @ (powerset @ X3))) | ((setminus @ X0 @ (binintersect @ X1 @ X2)) = (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) | ((in @ X2 @ (powerset @ X0)) != $true) | ((in @ X1 @ (powerset @ X0)) != $true) | ($true = (sP0 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2)))) | ($true != (in @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ (powerset @ X3)))) )),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f206])).
% 0.21/0.49 thf(f206,plain,(
% 0.21/0.49 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (((in @ X2 @ (powerset @ X0)) != $true) | ($true != (in @ (setminus @ X0 @ (binintersect @ X1 @ X2)) @ (powerset @ X3))) | ($true != $true) | ($true != (in @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ (powerset @ X3))) | ((in @ X1 @ (powerset @ X0)) != $true) | ($true = (sP0 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2)))) | ($true != (in @ (sK2 @ (setminus @ X0 @ (binintersect @ X1 @ X2)) @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) @ X0)) | ((setminus @ X0 @ (binintersect @ X1 @ X2)) = (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)))) )),
% 0.21/0.49 inference(duplicate_literal_removal,[],[f205])).
% 0.21/0.49 thf(f205,plain,(
% 0.21/0.49 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (($true != (in @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ (powerset @ X3))) | ($true != $true) | ($true != (in @ (setminus @ X0 @ (binintersect @ X1 @ X2)) @ (powerset @ X3))) | ($true != (in @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ (powerset @ X3))) | ($true = (sP0 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2)))) | ((in @ X2 @ (powerset @ X0)) != $true) | ($true != (in @ (sK2 @ (setminus @ X0 @ (binintersect @ X1 @ X2)) @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) @ X0)) | ((in @ X1 @ (powerset @ X0)) != $true) | ($true = (sP0 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)) @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2)))) | ($true != (in @ (setminus @ X0 @ (binintersect @ X1 @ X2)) @ (powerset @ X3))) | ((setminus @ X0 @ (binintersect @ X1 @ X2)) = (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) | ((setminus @ X0 @ (binintersect @ X1 @ X2)) = (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2)))) )),
% 0.21/0.49 inference(superposition,[],[f151,f168])).
% 0.21/0.49 thf(f168,plain,(
% 0.21/0.49 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (($true = (in @ (sK2 @ X0 @ X1 @ (binunion @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4))) @ (setminus @ X2 @ (binintersect @ X3 @ X4)))) | ($true != (in @ (binunion @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4)) @ (powerset @ X1))) | ($true != (in @ X0 @ (powerset @ X1))) | ((in @ X3 @ (powerset @ X2)) != $true) | ((binunion @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4)) = X0) | ($true != (in @ (sK2 @ X0 @ X1 @ (binunion @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4))) @ X2)) | ($true = (sP0 @ (binunion @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4)) @ X1 @ X0)) | ($true != (in @ X4 @ (powerset @ X2)))) )),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f164])).
% 0.21/0.49 thf(f164,plain,(
% 0.21/0.49 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (($true = (sP0 @ (binunion @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4)) @ X1 @ X0)) | ((in @ X3 @ (powerset @ X2)) != $true) | ($true != (in @ (sK2 @ X0 @ X1 @ (binunion @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4))) @ X2)) | ($true != (in @ X0 @ (powerset @ X1))) | ($true != $true) | ($true != (in @ X4 @ (powerset @ X2))) | ($true != (in @ (binunion @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4)) @ (powerset @ X1))) | ($true = (in @ (sK2 @ X0 @ X1 @ (binunion @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4))) @ (setminus @ X2 @ (binintersect @ X3 @ X4)))) | ((binunion @ (setminus @ X2 @ X3) @ (setminus @ X2 @ X4)) = X0)) )),
% 0.21/0.49 inference(superposition,[],[f154,f152])).
% 0.21/0.49 thf(f152,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (in @ (sK2 @ X2 @ X1 @ X0) @ X0)) | ($true != (in @ X0 @ (powerset @ X1))) | ($true = (sP0 @ X0 @ X1 @ X2)) | (X0 = X2) | ($true != (in @ X2 @ (powerset @ X1)))) )),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f121])).
% 0.21/0.49 thf(f121,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ X0 @ (powerset @ X1))) | ($true != $true) | (X0 = X2) | ($true != (in @ X2 @ (powerset @ X1))) | ($true = (sP0 @ X0 @ X1 @ X2)) | ($true = (in @ (sK2 @ X2 @ X1 @ X0) @ X0))) )),
% 0.21/0.49 inference(definition_unfolding,[],[f86,f113])).
% 0.21/0.49 thf(f86,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (in @ (sK2 @ X2 @ X1 @ X0) @ X0)) | (X0 = X2) | ($true = (sP0 @ X0 @ X1 @ X2)) | ($true != (in @ X2 @ (powerset @ X1))) | ($true != (in @ X0 @ (powerset @ X1))) | (setextT != $true)) )),
% 0.21/0.49 inference(cnf_transformation,[],[f46])).
% 0.21/0.49 thf(f154,plain,(
% 0.21/0.49 ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $i] : (($true != (in @ X7 @ (binunion @ (setminus @ X4 @ X5) @ (setminus @ X4 @ X6)))) | ($true != (in @ X5 @ (powerset @ X4))) | ($true = (in @ X7 @ (setminus @ X4 @ (binintersect @ X5 @ X6)))) | ($true != (in @ X7 @ X4)) | ((in @ X6 @ (powerset @ X4)) != $true)) )),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f147])).
% 0.21/0.49 thf(f147,plain,(
% 0.21/0.49 ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $i] : (($true != (in @ X7 @ (binunion @ (setminus @ X4 @ X5) @ (setminus @ X4 @ X6)))) | ($true != (in @ X5 @ (powerset @ X4))) | ($true = (in @ X7 @ (setminus @ X4 @ (binintersect @ X5 @ X6)))) | ((in @ X6 @ (powerset @ X4)) != $true) | ($true != (in @ X7 @ X4)) | ($true != $true)) )),
% 0.21/0.49 inference(definition_unfolding,[],[f102,f118])).
% 0.21/0.49 thf(f118,plain,(
% 0.21/0.49 (demorgan1b = $true)),
% 0.21/0.49 inference(cnf_transformation,[],[f75])).
% 0.21/0.49 thf(f102,plain,(
% 0.21/0.49 ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $i] : (($true != (in @ X5 @ (powerset @ X4))) | ((in @ X6 @ (powerset @ X4)) != $true) | ($true != (in @ X7 @ X4)) | ($true = (in @ X7 @ (setminus @ X4 @ (binintersect @ X5 @ X6)))) | ($true != (in @ X7 @ (binunion @ (setminus @ X4 @ X5) @ (setminus @ X4 @ X6)))) | (demorgan1b != $true)) )),
% 0.21/0.49 inference(cnf_transformation,[],[f68])).
% 0.21/0.49 thf(f68,plain,(
% 0.21/0.49 ((demorgan1b = $true) | (($true = (in @ sK17 @ (powerset @ sK16))) & (($true = (in @ sK18 @ (powerset @ sK16))) & (($true = (in @ sK19 @ sK16)) & ($true != (in @ sK19 @ (setminus @ sK16 @ (binintersect @ sK17 @ sK18)))) & ($true = (in @ sK19 @ (binunion @ (setminus @ sK16 @ sK17) @ (setminus @ sK16 @ sK18)))))))) & (! [X4,X5] : (($true != (in @ X5 @ (powerset @ X4))) | ! [X6] : (((in @ X6 @ (powerset @ X4)) != $true) | ! [X7] : (($true != (in @ X7 @ X4)) | ($true = (in @ X7 @ (setminus @ X4 @ (binintersect @ X5 @ X6)))) | ($true != (in @ X7 @ (binunion @ (setminus @ X4 @ X5) @ (setminus @ X4 @ X6))))))) | (demorgan1b != $true))),
% 0.21/0.49 inference(skolemisation,[status(esa),new_symbols(skolem,[sK16,sK17,sK18,sK19])],[f64,f67,f66,f65])).
% 0.21/0.49 thf(f65,plain,(
% 0.21/0.49 ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (((in @ X2 @ (powerset @ X0)) = $true) & ? [X3] : (((in @ X3 @ X0) = $true) & ((in @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) != $true) & ((in @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true)))) => (($true = (in @ sK17 @ (powerset @ sK16))) & ? [X2] : (($true = (in @ X2 @ (powerset @ sK16))) & ? [X3] : (($true = (in @ X3 @ sK16)) & ($true != (in @ X3 @ (setminus @ sK16 @ (binintersect @ sK17 @ X2)))) & ($true = (in @ X3 @ (binunion @ (setminus @ sK16 @ sK17) @ (setminus @ sK16 @ X2)))))))),
% 0.21/0.49 introduced(choice_axiom,[])).
% 0.21/0.49 thf(f66,plain,(
% 0.21/0.49 ? [X2] : (($true = (in @ X2 @ (powerset @ sK16))) & ? [X3] : (($true = (in @ X3 @ sK16)) & ($true != (in @ X3 @ (setminus @ sK16 @ (binintersect @ sK17 @ X2)))) & ($true = (in @ X3 @ (binunion @ (setminus @ sK16 @ sK17) @ (setminus @ sK16 @ X2)))))) => (($true = (in @ sK18 @ (powerset @ sK16))) & ? [X3] : (($true = (in @ X3 @ sK16)) & ($true != (in @ X3 @ (setminus @ sK16 @ (binintersect @ sK17 @ sK18)))) & ($true = (in @ X3 @ (binunion @ (setminus @ sK16 @ sK17) @ (setminus @ sK16 @ sK18))))))),
% 0.21/0.49 introduced(choice_axiom,[])).
% 0.21/0.49 thf(f67,plain,(
% 0.21/0.49 ? [X3] : (($true = (in @ X3 @ sK16)) & ($true != (in @ X3 @ (setminus @ sK16 @ (binintersect @ sK17 @ sK18)))) & ($true = (in @ X3 @ (binunion @ (setminus @ sK16 @ sK17) @ (setminus @ sK16 @ sK18))))) => (($true = (in @ sK19 @ sK16)) & ($true != (in @ sK19 @ (setminus @ sK16 @ (binintersect @ sK17 @ sK18)))) & ($true = (in @ sK19 @ (binunion @ (setminus @ sK16 @ sK17) @ (setminus @ sK16 @ sK18)))))),
% 0.21/0.49 introduced(choice_axiom,[])).
% 0.21/0.49 thf(f64,plain,(
% 0.21/0.49 ((demorgan1b = $true) | ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (((in @ X2 @ (powerset @ X0)) = $true) & ? [X3] : (((in @ X3 @ X0) = $true) & ((in @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) != $true) & ((in @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true))))) & (! [X4,X5] : (($true != (in @ X5 @ (powerset @ X4))) | ! [X6] : (((in @ X6 @ (powerset @ X4)) != $true) | ! [X7] : (($true != (in @ X7 @ X4)) | ($true = (in @ X7 @ (setminus @ X4 @ (binintersect @ X5 @ X6)))) | ($true != (in @ X7 @ (binunion @ (setminus @ X4 @ X5) @ (setminus @ X4 @ X6))))))) | (demorgan1b != $true))),
% 0.21/0.49 inference(rectify,[],[f63])).
% 0.21/0.49 thf(f63,plain,(
% 0.21/0.49 ((demorgan1b = $true) | ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (((in @ X2 @ (powerset @ X0)) = $true) & ? [X3] : (((in @ X3 @ X0) = $true) & ((in @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) != $true) & ((in @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true))))) & (! [X0,X1] : (((in @ X1 @ (powerset @ X0)) != $true) | ! [X2] : (((in @ X2 @ (powerset @ X0)) != $true) | ! [X3] : (((in @ X3 @ X0) != $true) | ((in @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) = $true) | ((in @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) != $true)))) | (demorgan1b != $true))),
% 0.21/0.49 inference(nnf_transformation,[],[f27])).
% 0.21/0.49 thf(f27,plain,(
% 0.21/0.49 (demorgan1b = $true) <=> ! [X0,X1] : (((in @ X1 @ (powerset @ X0)) != $true) | ! [X2] : (((in @ X2 @ (powerset @ X0)) != $true) | ! [X3] : (((in @ X3 @ X0) != $true) | ((in @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) = $true) | ((in @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) != $true))))),
% 0.21/0.49 inference(flattening,[],[f26])).
% 0.21/0.49 thf(f26,plain,(
% 0.21/0.49 ! [X0,X1] : (! [X2] : (! [X3] : ((((in @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) = $true) | ((in @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) != $true)) | ((in @ X3 @ X0) != $true)) | ((in @ X2 @ (powerset @ X0)) != $true)) | ((in @ X1 @ (powerset @ X0)) != $true)) <=> (demorgan1b = $true)),
% 0.21/0.49 inference(ennf_transformation,[],[f15])).
% 0.21/0.49 thf(f15,plain,(
% 0.21/0.49 ! [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X0)) = $true) => ! [X3] : (((in @ X3 @ X0) = $true) => (((in @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) = $true) => ((in @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))) = $true))))) <=> (demorgan1b = $true)),
% 0.21/0.49 inference(fool_elimination,[],[f14])).
% 0.21/0.49 thf(f14,plain,(
% 0.21/0.49 (! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X3] : ((in @ X3 @ X0) => ((in @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) => (in @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))))))) = demorgan1b)),
% 0.21/0.49 inference(rectify,[],[f6])).
% 0.21/0.49 thf(f6,axiom,(
% 0.21/0.49 (! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X3] : ((in @ X3 @ X0) => ((in @ X3 @ (binunion @ (setminus @ X0 @ X1) @ (setminus @ X0 @ X2))) => (in @ X3 @ (setminus @ X0 @ (binintersect @ X1 @ X2))))))) = demorgan1b)),
% 0.21/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',demorgan1b)).
% 0.21/0.49 thf(f151,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ (sK2 @ X2 @ X1 @ X0) @ X2)) | (X0 = X2) | ($true != (in @ X0 @ (powerset @ X1))) | ($true != (in @ X2 @ (powerset @ X1))) | ($true = (sP0 @ X0 @ X1 @ X2))) )),
% 0.21/0.49 inference(trivial_inequality_removal,[],[f120])).
% 0.21/0.49 thf(f120,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != $true) | (X0 = X2) | ($true != (in @ X0 @ (powerset @ X1))) | ($true != (in @ (sK2 @ X2 @ X1 @ X0) @ X2)) | ($true = (sP0 @ X0 @ X1 @ X2)) | ($true != (in @ X2 @ (powerset @ X1)))) )),
% 0.21/0.49 inference(definition_unfolding,[],[f87,f113])).
% 0.21/0.49 thf(f87,plain,(
% 0.21/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ (sK2 @ X2 @ X1 @ X0) @ X2)) | (X0 = X2) | ($true = (sP0 @ X0 @ X1 @ X2)) | ($true != (in @ X2 @ (powerset @ X1))) | ($true != (in @ X0 @ (powerset @ X1))) | (setextT != $true)) )),
% 0.21/0.49 inference(cnf_transformation,[],[f46])).
% 0.21/0.49 thf(f116,plain,(
% 0.21/0.49 ((binunion @ (setminus @ sK22 @ sK23) @ (setminus @ sK22 @ sK24)) != (setminus @ sK22 @ (binintersect @ sK23 @ sK24)))),
% 0.21/0.49 inference(cnf_transformation,[],[f75])).
% 0.21/0.49 % SZS output end Proof for theBenchmark
% 0.21/0.49 % (28676)------------------------------
% 0.21/0.49 % (28676)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.49 % (28676)Termination reason: Refutation
% 0.21/0.49
% 0.21/0.49 % (28676)Memory used [KB]: 6140
% 0.21/0.49 % (28676)Time elapsed: 0.110 s
% 0.21/0.49 % (28676)Instructions burned: 168 (million)
% 0.21/0.49 % (28676)------------------------------
% 0.21/0.49 % (28676)------------------------------
% 0.21/0.49 % (28670)Success in time 0.125 s
% 0.21/0.49 % Vampire---4.8 exiting
%------------------------------------------------------------------------------