TSTP Solution File: SEU636^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU636^1 : 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:50:11 EDT 2024
% Result : Theorem 1.48s 0.59s
% Output : Refutation 1.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU636^1 : TPTP v8.2.0. Released v3.7.0.
% 0.04/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.38 % Computer : n025.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 300
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Sun May 19 16:54:08 EDT 2024
% 0.15/0.38 % CPUTime :
% 0.15/0.38 This is a TH0_THM_EQU_NAR problem
% 0.15/0.38 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/sandbox2/benchmark/theBenchmark.p
% 0.15/0.41 % (22903)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.15/0.41 % (22904)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.15/0.41 % (22905)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.15/0.41 % (22907)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.15/0.41 % (22906)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.41 % (22908)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.15/0.41 % (22909)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.41 % (22906)Instruction limit reached!
% 0.15/0.41 % (22906)------------------------------
% 0.15/0.41 % (22906)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.41 % (22906)Termination reason: Unknown
% 0.15/0.41 % (22906)Termination phase: shuffling
% 0.15/0.41
% 0.15/0.41 % (22906)Memory used [KB]: 1279
% 0.15/0.41 % (22907)Instruction limit reached!
% 0.15/0.41 % (22907)------------------------------
% 0.15/0.41 % (22907)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.41 % (22907)Termination reason: Unknown
% 0.15/0.41 % (22907)Termination phase: shuffling
% 0.15/0.41
% 0.15/0.41 % (22907)Memory used [KB]: 1279
% 0.15/0.41 % (22907)Time elapsed: 0.003 s
% 0.15/0.41 % (22907)Instructions burned: 2 (million)
% 0.15/0.41 % (22907)------------------------------
% 0.15/0.41 % (22907)------------------------------
% 0.15/0.41 % (22906)Time elapsed: 0.003 s
% 0.15/0.41 % (22906)Instructions burned: 2 (million)
% 0.15/0.41 % (22906)------------------------------
% 0.15/0.41 % (22906)------------------------------
% 0.15/0.41 % (22910)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.15/0.42 % (22904)Instruction limit reached!
% 0.15/0.42 % (22904)------------------------------
% 0.15/0.42 % (22904)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.42 % (22904)Termination reason: Unknown
% 0.15/0.42 % (22904)Termination phase: shuffling
% 0.15/0.42
% 0.15/0.42 % (22904)Memory used [KB]: 1279
% 0.15/0.42 % (22904)Time elapsed: 0.004 s
% 0.15/0.42 % (22904)Instructions burned: 5 (million)
% 0.15/0.42 % (22904)------------------------------
% 0.15/0.42 % (22904)------------------------------
% 0.15/0.42 % (22910)Instruction limit reached!
% 0.15/0.42 % (22910)------------------------------
% 0.15/0.42 % (22910)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.42 % (22910)Termination reason: Unknown
% 0.15/0.42 % (22910)Termination phase: shuffling
% 0.15/0.42
% 0.15/0.42 % (22910)Memory used [KB]: 1279
% 0.15/0.42 % (22910)Time elapsed: 0.004 s
% 0.15/0.42 % (22910)Instructions burned: 4 (million)
% 0.15/0.42 % (22910)------------------------------
% 0.15/0.42 % (22910)------------------------------
% 0.15/0.42 % (22909)Instruction limit reached!
% 0.15/0.42 % (22909)------------------------------
% 0.15/0.42 % (22909)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.42 % (22909)Termination reason: Unknown
% 0.15/0.42 % (22909)Termination phase: Property scanning
% 0.15/0.42
% 0.15/0.42 % (22909)Memory used [KB]: 1535
% 0.15/0.42 % (22909)Time elapsed: 0.012 s
% 0.15/0.42 % (22909)Instructions burned: 18 (million)
% 0.15/0.42 % (22909)------------------------------
% 0.15/0.42 % (22909)------------------------------
% 0.15/0.43 % (22905)Instruction limit reached!
% 0.15/0.43 % (22905)------------------------------
% 0.15/0.43 % (22905)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.43 % (22905)Termination reason: Unknown
% 0.15/0.43 % (22905)Termination phase: Property scanning
% 0.15/0.43
% 0.15/0.43 % (22905)Memory used [KB]: 1791
% 0.15/0.43 % (22905)Time elapsed: 0.016 s
% 0.15/0.43 % (22905)Instructions burned: 27 (million)
% 0.15/0.43 % (22905)------------------------------
% 0.15/0.43 % (22905)------------------------------
% 0.15/0.43 % (22911)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.15/0.43 % (22912)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.15/0.43 % (22913)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.15/0.43 % (22914)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.15/0.43 % (22913)Instruction limit reached!
% 0.15/0.43 % (22913)------------------------------
% 0.15/0.43 % (22913)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.43 % (22913)Termination reason: Unknown
% 0.15/0.43 % (22913)Termination phase: shuffling
% 0.15/0.43
% 0.15/0.43 % (22913)Memory used [KB]: 1279
% 0.15/0.43 % (22913)Time elapsed: 0.003 s
% 0.15/0.43 % (22913)Instructions burned: 3 (million)
% 0.15/0.43 % (22913)------------------------------
% 0.15/0.43 % (22913)------------------------------
% 0.15/0.44 % (22912)Instruction limit reached!
% 0.15/0.44 % (22912)------------------------------
% 0.15/0.44 % (22912)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.44 % (22912)Termination reason: Unknown
% 0.15/0.44 % (22912)Termination phase: Property scanning
% 0.15/0.44
% 0.15/0.44 % (22912)Memory used [KB]: 1535
% 0.15/0.44 % (22912)Time elapsed: 0.010 s
% 0.15/0.44 % (22912)Instructions burned: 15 (million)
% 0.15/0.44 % (22912)------------------------------
% 0.15/0.44 % (22912)------------------------------
% 0.15/0.44 % (22915)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.15/0.44 % (22916)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.15/0.44 % (22915)Instruction limit reached!
% 0.15/0.44 % (22915)------------------------------
% 0.15/0.44 % (22915)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.44 % (22915)Termination reason: Unknown
% 0.15/0.44 % (22915)Termination phase: shuffling
% 0.15/0.44
% 0.15/0.44 % (22915)Memory used [KB]: 1407
% 0.15/0.44 % (22915)Time elapsed: 0.006 s
% 0.15/0.44 % (22915)Instructions burned: 8 (million)
% 0.15/0.44 % (22915)------------------------------
% 0.15/0.44 % (22915)------------------------------
% 0.15/0.45 % (22917)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.15/0.45 % (22911)Instruction limit reached!
% 0.15/0.45 % (22911)------------------------------
% 0.15/0.45 % (22911)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.45 % (22911)Termination reason: Unknown
% 0.15/0.45 % (22911)Termination phase: Clausification
% 0.15/0.45
% 0.15/0.45 % (22911)Memory used [KB]: 1663
% 0.15/0.45 % (22911)Time elapsed: 0.020 s
% 0.15/0.45 % (22911)Instructions burned: 38 (million)
% 0.15/0.45 % (22911)------------------------------
% 0.15/0.45 % (22911)------------------------------
% 0.15/0.45 % (22917)Instruction limit reached!
% 0.15/0.45 % (22917)------------------------------
% 0.15/0.45 % (22917)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.45 % (22917)Termination reason: Unknown
% 0.15/0.45 % (22917)Termination phase: shuffling
% 0.15/0.45
% 0.15/0.45 % (22917)Memory used [KB]: 1279
% 0.15/0.45 % (22917)Time elapsed: 0.004 s
% 0.15/0.45 % (22917)Instructions burned: 4 (million)
% 0.15/0.45 % (22917)------------------------------
% 0.15/0.45 % (22917)------------------------------
% 0.15/0.45 % (22916)Instruction limit reached!
% 0.15/0.45 % (22916)------------------------------
% 0.15/0.45 % (22916)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.45 % (22916)Termination reason: Unknown
% 0.15/0.45 % (22916)Termination phase: shuffling
% 0.15/0.45
% 0.15/0.45 % (22916)Memory used [KB]: 1535
% 0.15/0.45 % (22916)Time elapsed: 0.010 s
% 0.15/0.45 % (22916)Instructions burned: 16 (million)
% 0.15/0.45 % (22916)------------------------------
% 0.15/0.45 % (22916)------------------------------
% 0.24/0.45 % (22918)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.24/0.45 % (22918)Instruction limit reached!
% 0.24/0.45 % (22918)------------------------------
% 0.24/0.45 % (22918)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.45 % (22918)Termination reason: Unknown
% 0.24/0.45 % (22918)Termination phase: shuffling
% 0.24/0.45
% 0.24/0.45 % (22918)Memory used [KB]: 1279
% 0.24/0.45 % (22918)Time elapsed: 0.004 s
% 0.24/0.45 % (22918)Instructions burned: 4 (million)
% 0.24/0.45 % (22918)------------------------------
% 0.24/0.45 % (22918)------------------------------
% 0.24/0.46 % (22919)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.24/0.46 % (22919)Instruction limit reached!
% 0.24/0.46 % (22919)------------------------------
% 0.24/0.46 % (22919)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.46 % (22919)Termination reason: Unknown
% 0.24/0.46 % (22919)Termination phase: shuffling
% 0.24/0.46
% 0.24/0.46 % (22919)Memory used [KB]: 1407
% 0.24/0.46 % (22919)Time elapsed: 0.006 s
% 0.24/0.46 % (22919)Instructions burned: 8 (million)
% 0.24/0.46 % (22919)------------------------------
% 0.24/0.46 % (22919)------------------------------
% 0.24/0.46 % (22920)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.24/0.46 % (22921)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.24/0.46 % (22920)Instruction limit reached!
% 0.24/0.46 % (22920)------------------------------
% 0.24/0.46 % (22920)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.46 % (22920)Termination reason: Unknown
% 0.24/0.46 % (22920)Termination phase: shuffling
% 0.24/0.46
% 0.24/0.46 % (22920)Memory used [KB]: 1279
% 0.24/0.46 % (22920)Time elapsed: 0.004 s
% 0.24/0.46 % (22920)Instructions burned: 4 (million)
% 0.24/0.46 % (22920)------------------------------
% 0.24/0.46 % (22920)------------------------------
% 0.24/0.46 % (22922)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.24/0.46 % (22921)Instruction limit reached!
% 0.24/0.46 % (22921)------------------------------
% 0.24/0.46 % (22921)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.46 % (22921)Termination reason: Unknown
% 0.24/0.46 % (22921)Termination phase: shuffling
% 0.24/0.46
% 0.24/0.46 % (22921)Memory used [KB]: 1279
% 0.24/0.46 % (22921)Time elapsed: 0.004 s
% 0.24/0.46 % (22921)Instructions burned: 4 (million)
% 0.24/0.46 % (22921)------------------------------
% 0.24/0.46 % (22921)------------------------------
% 0.24/0.47 % (22923)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.24/0.47 % (22922)Instruction limit reached!
% 0.24/0.47 % (22922)------------------------------
% 0.24/0.47 % (22922)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.47 % (22922)Termination reason: Unknown
% 0.24/0.47 % (22922)Termination phase: shuffling
% 0.24/0.47
% 0.24/0.47 % (22922)Memory used [KB]: 1663
% 0.24/0.47 % (22922)Time elapsed: 0.011 s
% 0.24/0.47 % (22922)Instructions burned: 18 (million)
% 0.24/0.47 % (22922)------------------------------
% 0.24/0.47 % (22922)------------------------------
% 0.24/0.48 % (22924)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.24/0.48 % (22925)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.24/0.48 % (22924)Instruction limit reached!
% 0.24/0.48 % (22924)------------------------------
% 0.24/0.48 % (22924)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.48 % (22924)Termination reason: Unknown
% 0.24/0.48 % (22924)Termination phase: shuffling
% 0.24/0.48
% 0.24/0.48 % (22924)Memory used [KB]: 1279
% 0.24/0.48 % (22924)Time elapsed: 0.005 s
% 0.24/0.48 % (22924)Instructions burned: 6 (million)
% 0.24/0.48 % (22924)------------------------------
% 0.24/0.48 % (22924)------------------------------
% 0.24/0.48 % (22926)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.24/0.49 % (22927)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2999ds/5Mi)
% 0.24/0.49 % (22926)Instruction limit reached!
% 0.24/0.49 % (22926)------------------------------
% 0.24/0.49 % (22926)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.49 % (22926)Termination reason: Unknown
% 0.24/0.49 % (22926)Termination phase: shuffling
% 0.24/0.49
% 0.24/0.49 % (22926)Memory used [KB]: 1791
% 0.24/0.49 % (22926)Time elapsed: 0.013 s
% 0.24/0.49 % (22926)Instructions burned: 21 (million)
% 0.24/0.49 % (22926)------------------------------
% 0.24/0.49 % (22926)------------------------------
% 0.24/0.49 % (22927)Instruction limit reached!
% 0.24/0.49 % (22927)------------------------------
% 0.24/0.49 % (22927)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.49 % (22927)Termination reason: Unknown
% 0.24/0.49 % (22927)Termination phase: shuffling
% 0.24/0.49
% 0.24/0.49 % (22927)Memory used [KB]: 1279
% 0.24/0.49 % (22927)Time elapsed: 0.005 s
% 0.24/0.49 % (22927)Instructions burned: 6 (million)
% 0.24/0.49 % (22927)------------------------------
% 0.24/0.49 % (22927)------------------------------
% 0.24/0.49 % (22928)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.24/0.50 % (22928)Instruction limit reached!
% 0.24/0.50 % (22928)------------------------------
% 0.24/0.50 % (22928)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.50 % (22928)Termination reason: Unknown
% 0.24/0.50 % (22928)Termination phase: shuffling
% 0.24/0.50
% 0.24/0.50 % (22928)Memory used [KB]: 1279
% 0.24/0.50 % (22928)Time elapsed: 0.005 s
% 0.24/0.50 % (22928)Instructions burned: 6 (million)
% 0.24/0.50 % (22928)------------------------------
% 0.24/0.50 % (22928)------------------------------
% 0.24/0.50 % (22903)Instruction limit reached!
% 0.24/0.50 % (22903)------------------------------
% 0.24/0.50 % (22903)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.50 % (22903)Termination reason: Unknown
% 0.24/0.50 % (22903)Termination phase: Saturation
% 0.24/0.50
% 0.24/0.50 % (22903)Memory used [KB]: 7419
% 0.24/0.50 % (22903)Time elapsed: 0.091 s
% 0.24/0.50 % (22903)Instructions burned: 183 (million)
% 0.24/0.50 % (22903)------------------------------
% 0.24/0.50 % (22903)------------------------------
% 0.24/0.50 % (22929)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.24/0.51 % (22930)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.24/0.51 % (22931)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.24/0.52 % (22932)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.24/0.52 % (22931)Instruction limit reached!
% 0.24/0.52 % (22931)------------------------------
% 0.24/0.52 % (22931)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.52 % (22931)Termination reason: Unknown
% 0.24/0.52 % (22931)Termination phase: shuffling
% 0.24/0.52
% 0.24/0.52 % (22931)Memory used [KB]: 1663
% 0.24/0.52 % (22931)Time elapsed: 0.012 s
% 0.24/0.52 % (22931)Instructions burned: 20 (million)
% 0.24/0.52 % (22931)------------------------------
% 0.24/0.52 % (22931)------------------------------
% 0.24/0.54 % (22933)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on theBenchmark for (2998ds/17Mi)
% 1.30/0.54 % (22933)Instruction limit reached!
% 1.30/0.54 % (22933)------------------------------
% 1.30/0.54 % (22933)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.30/0.54 % (22933)Termination reason: Unknown
% 1.30/0.54 % (22933)Termination phase: shuffling
% 1.30/0.54
% 1.30/0.54 % (22933)Memory used [KB]: 1663
% 1.30/0.54 % (22933)Time elapsed: 0.011 s
% 1.30/0.54 % (22933)Instructions burned: 17 (million)
% 1.30/0.54 % (22933)------------------------------
% 1.30/0.54 % (22933)------------------------------
% 1.30/0.56 % (22925)Refutation not found, incomplete strategy
% 1.30/0.56 % (22925)------------------------------
% 1.30/0.56 % (22925)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.30/0.56 % (22925)Termination reason: Refutation not found, incomplete strategy
% 1.30/0.56
% 1.30/0.56
% 1.30/0.56 % (22925)Memory used [KB]: 7675
% 1.30/0.56 % (22925)Time elapsed: 0.103 s
% 1.30/0.56 % (22925)Instructions burned: 144 (million)
% 1.30/0.56 % (22925)------------------------------
% 1.30/0.56 % (22925)------------------------------
% 1.30/0.56 % (22934)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2998ds/3Mi)
% 1.30/0.56 % (22934)Instruction limit reached!
% 1.30/0.56 % (22934)------------------------------
% 1.30/0.56 % (22934)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.30/0.56 % (22934)Termination reason: Unknown
% 1.30/0.56 % (22934)Termination phase: shuffling
% 1.30/0.56
% 1.30/0.56 % (22934)Memory used [KB]: 1279
% 1.30/0.56 % (22934)Time elapsed: 0.004 s
% 1.30/0.56 % (22934)Instructions burned: 4 (million)
% 1.30/0.56 % (22934)------------------------------
% 1.30/0.56 % (22934)------------------------------
% 1.30/0.56 % (22908)Instruction limit reached!
% 1.30/0.56 % (22908)------------------------------
% 1.30/0.56 % (22908)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.30/0.56 % (22908)Termination reason: Unknown
% 1.30/0.56 % (22908)Termination phase: Saturation
% 1.30/0.56
% 1.30/0.56 % (22908)Memory used [KB]: 8059
% 1.30/0.56 % (22908)Time elapsed: 0.151 s
% 1.30/0.56 % (22908)Instructions burned: 275 (million)
% 1.30/0.56 % (22908)------------------------------
% 1.30/0.56 % (22908)------------------------------
% 1.48/0.57 % (22935)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on theBenchmark for (2998ds/30Mi)
% 1.48/0.58 % (22936)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on theBenchmark for (2998ds/127Mi)
% 1.48/0.58 % (22937)lrs+1002_1:1_au=on:cbe=off:cnfonf=conj_eager:cond=on:hi=on:i=100:si=on:rtra=on_0 on theBenchmark for (2998ds/100Mi)
% 1.48/0.59 % (22923)First to succeed.
% 1.48/0.59 % (22935)Instruction limit reached!
% 1.48/0.59 % (22935)------------------------------
% 1.48/0.59 % (22935)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.48/0.59 % (22935)Termination reason: Unknown
% 1.48/0.59 % (22935)Termination phase: Property scanning
% 1.48/0.59
% 1.48/0.59 % (22935)Memory used [KB]: 1791
% 1.48/0.59 % (22935)Time elapsed: 0.017 s
% 1.48/0.59 % (22935)Instructions burned: 31 (million)
% 1.48/0.59 % (22935)------------------------------
% 1.48/0.59 % (22935)------------------------------
% 1.48/0.59 % (22923)Refutation found. Thanks to Tanya!
% 1.48/0.59 % SZS status Theorem for theBenchmark
% 1.48/0.59 % SZS output start Proof for theBenchmark
% 1.48/0.59 thf(func_def_0, type, in: $i > $i > $o).
% 1.48/0.59 thf(func_def_1, type, exu: ($i > $o) > $o).
% 1.48/0.59 thf(func_def_6, type, setadjoin: $i > $i > $i).
% 1.48/0.59 thf(func_def_8, type, powerset: $i > $i).
% 1.48/0.59 thf(func_def_10, type, setunion: $i > $i).
% 1.48/0.59 thf(func_def_19, type, descr: ($i > $o) > $i).
% 1.48/0.59 thf(func_def_21, type, dsetconstr: $i > ($i > $o) > $i).
% 1.48/0.59 thf(func_def_26, type, prop2set: $o > $i).
% 1.48/0.59 thf(func_def_36, type, nonempty: $i > $o).
% 1.48/0.59 thf(func_def_69, type, set2prop: $i > $o).
% 1.48/0.59 thf(func_def_88, type, subset: $i > $i > $o).
% 1.48/0.59 thf(func_def_89, type, disjoint: $i > $i > $o).
% 1.48/0.59 thf(func_def_90, type, setsmeet: $i > $i > $o).
% 1.48/0.59 thf(func_def_114, type, binunion: $i > $i > $i).
% 1.48/0.59 thf(func_def_122, type, binintersect: $i > $i > $i).
% 1.48/0.59 thf(func_def_135, type, regular: $i > $o).
% 1.48/0.59 thf(func_def_136, type, setminus: $i > $i > $i).
% 1.48/0.59 thf(func_def_147, type, symdiff: $i > $i > $i).
% 1.48/0.59 thf(func_def_153, type, iskpair: $i > $o).
% 1.48/0.59 thf(func_def_158, type, kpair: $i > $i > $i).
% 1.48/0.59 thf(func_def_160, type, cartprod: $i > $i > $i).
% 1.48/0.59 thf(func_def_188, type, sP0: $i > $i > $o).
% 1.48/0.59 thf(func_def_189, type, sP1: $i > $o).
% 1.48/0.59 thf(func_def_190, type, sP2: $i > $i > $o).
% 1.48/0.59 thf(func_def_191, type, sP3: $i > $i > $o).
% 1.48/0.59 thf(func_def_192, type, sP4: $i > $o > $i > $i > $o).
% 1.48/0.59 thf(func_def_197, type, sK9: ($i > $o) > $i > $i).
% 1.48/0.59 thf(func_def_199, type, sK11: $i > $o).
% 1.48/0.59 thf(func_def_201, type, sK13: $i > $o).
% 1.48/0.59 thf(func_def_206, type, sK18: $i > $i).
% 1.48/0.59 thf(func_def_209, type, sK21: $i > $o).
% 1.48/0.59 thf(func_def_210, type, sK22: $i > $o).
% 1.48/0.59 thf(func_def_211, type, sK23: ($i > $o) > ($i > $o) > $i).
% 1.48/0.59 thf(func_def_212, type, sK24: ($i > $o) > ($i > $o) > $i).
% 1.48/0.59 thf(func_def_213, type, sK25: $i > $i).
% 1.48/0.59 thf(func_def_215, type, sK27: ($i > $o) > $i).
% 1.48/0.59 thf(func_def_216, type, sK28: $i > $o).
% 1.48/0.59 thf(func_def_217, type, sK29: $i > $i).
% 1.48/0.59 thf(func_def_223, type, sK35: $i > $o).
% 1.48/0.59 thf(func_def_225, type, sK37: ($i > $o) > $i).
% 1.48/0.59 thf(func_def_226, type, sK38: ($i > $o) > $i).
% 1.48/0.59 thf(func_def_227, type, sK39: $i > $o).
% 1.48/0.59 thf(func_def_230, type, sK42: $i > $i).
% 1.48/0.59 thf(func_def_236, type, sK48: $i > $i > $i).
% 1.48/0.59 thf(func_def_237, type, sK49: $i > ($i > $o) > $i).
% 1.48/0.59 thf(func_def_238, type, sK50: $i > $o).
% 1.48/0.59 thf(func_def_240, type, sK52: $i > ($i > $o) > $i).
% 1.48/0.59 thf(func_def_241, type, sK53: $i > $o).
% 1.48/0.59 thf(func_def_277, type, sK89: $i > $o).
% 1.48/0.59 thf(func_def_293, type, sK105: $i > $i).
% 1.48/0.59 thf(func_def_303, type, sK115: $i > $o).
% 1.48/0.59 thf(func_def_306, type, sK118: $i > ($i > $o) > $i).
% 1.48/0.59 thf(func_def_307, type, sK119: $i > $i).
% 1.48/0.59 thf(func_def_313, type, sK125: $i > $o).
% 1.48/0.59 thf(func_def_315, type, sK127: ($i > $o) > $i > $i).
% 1.48/0.59 thf(func_def_317, type, sK129: $i > $i > $i).
% 1.48/0.59 thf(func_def_344, type, sK156: $i > $o).
% 1.48/0.59 thf(func_def_359, type, sK171: $i > $i > $i).
% 1.48/0.59 thf(func_def_360, type, sK172: $i > $i > $i).
% 1.48/0.59 thf(func_def_361, type, sK173: $i > $i > $i).
% 1.48/0.59 thf(func_def_362, type, sK174: $i > $i > $i).
% 1.48/0.59 thf(func_def_363, type, sK175: $i > $i > $i).
% 1.48/0.59 thf(func_def_364, type, sK176: $i > $i > $i > $i).
% 1.48/0.59 thf(func_def_365, type, sK177: $i > $i).
% 1.48/0.59 thf(func_def_366, type, sK178: $i > $i).
% 1.48/0.59 thf(func_def_367, type, sK179: $i > $i).
% 1.48/0.59 thf(func_def_368, type, sK180: $i > $i).
% 1.48/0.59 thf(func_def_369, type, sK181: $i > $i > $i > $i).
% 1.48/0.59 thf(func_def_370, type, sK182: $i > $i > $i > $i).
% 1.48/0.59 thf(func_def_371, type, sK183: $i > $i > $i).
% 1.48/0.59 thf(func_def_372, type, sK184: $i > $i > $i).
% 1.48/0.59 thf(func_def_373, type, sK185: $i > $i > $i).
% 1.48/0.59 thf(func_def_375, type, sK187: $i > $i).
% 1.48/0.59 thf(func_def_376, type, sK188: $i > $i).
% 1.48/0.59 thf(func_def_377, type, sK189: $i > $i).
% 1.48/0.59 thf(func_def_388, type, sK200: $i > $o).
% 1.48/0.59 thf(func_def_389, type, sK201: ($i > $o) > $i).
% 1.48/0.59 thf(func_def_390, type, sK202: $i > $i > $o).
% 1.48/0.59 thf(func_def_392, type, sK204: $i > $i).
% 1.48/0.59 thf(func_def_393, type, sK205: $i > $i).
% 1.48/0.59 thf(func_def_394, type, sK206: $i > ($i > $i > $o) > $i).
% 1.48/0.59 thf(func_def_395, type, sK207: $i > ($i > $i > $o) > $i).
% 1.48/0.59 thf(func_def_396, type, sK208: $i > $i > ($i > $i > $o) > $i).
% 1.48/0.59 thf(func_def_397, type, sK209: $i > $o).
% 1.48/0.59 thf(func_def_399, type, sK211: $i > $i > $i).
% 1.48/0.59 thf(func_def_400, type, sK212: $i > $i > $i).
% 1.48/0.59 thf(func_def_426, type, sK238: $i > $o).
% 1.48/0.59 thf(func_def_429, type, sK241: $i > $i > $i).
% 1.48/0.59 thf(func_def_445, type, sK257: $o > $i > $i > $i).
% 1.48/0.59 thf(func_def_446, type, sK258: $i > $o).
% 1.48/0.59 thf(func_def_448, type, sK260: $i > ($i > $o) > $i).
% 1.48/0.59 thf(func_def_464, type, sK276: $i > $o).
% 1.48/0.59 thf(func_def_465, type, sK277: $i > $i).
% 1.48/0.59 thf(func_def_466, type, sK278: ($i > $o) > $i).
% 1.48/0.59 thf(func_def_467, type, sK279: $i > $o).
% 1.48/0.59 thf(func_def_473, type, sK285: $i > $i > $i).
% 1.48/0.59 thf(func_def_483, type, sK295: $i > $o).
% 1.48/0.59 thf(func_def_485, type, sK297: $i > ($i > $o) > $i).
% 1.48/0.59 thf(func_def_486, type, sK298: $i > $o).
% 1.48/0.59 thf(func_def_492, type, sK304: $i > $o).
% 1.48/0.59 thf(func_def_495, type, sK307: $i > ($i > $o) > $i).
% 1.48/0.59 thf(func_def_496, type, sK308: $i > $i).
% 1.48/0.59 thf(func_def_499, type, sK311: $i > $i).
% 1.48/0.59 thf(func_def_512, type, sK324: $i > $i > $i).
% 1.48/0.59 thf(func_def_513, type, sK325: ($i > $o) > ($i > $o) > $i > $i > $i).
% 1.48/0.59 thf(func_def_514, type, sK326: ($i > $o) > ($i > $o) > $i > $i > $i).
% 1.48/0.59 thf(func_def_517, type, sK329: $i > $o).
% 1.48/0.59 thf(func_def_518, type, sK330: $i > $o).
% 1.48/0.59 thf(func_def_521, type, sK333: $i > $i > $i).
% 1.48/0.59 thf(func_def_534, type, sK346: $i > $i > $i > $i).
% 1.48/0.59 thf(func_def_535, type, sK347: $i > $i > $i > $i).
% 1.48/0.59 thf(func_def_542, type, sK354: $i > $o).
% 1.48/0.59 thf(func_def_566, type, sK378: $i > $o).
% 1.48/0.59 thf(func_def_578, type, sK390: $i > $i > $i).
% 1.48/0.59 thf(func_def_585, type, sK397: $i > $o).
% 1.48/0.59 thf(func_def_589, type, sK401: $i > $i > $i).
% 1.48/0.59 thf(func_def_600, type, sK412: $i > $o).
% 1.48/0.59 thf(func_def_601, type, sK413: $i > $o).
% 1.48/0.59 thf(func_def_602, type, sK414: ($i > $o) > ($i > $o) > $i).
% 1.48/0.59 thf(func_def_603, type, sK415: ($i > $o) > ($i > $o) > $i).
% 1.48/0.59 thf(func_def_606, type, sK418: $i > $o).
% 1.48/0.59 thf(func_def_610, type, ph422: !>[X0: $tType]:(X0)).
% 1.48/0.59 thf(f3185,plain,(
% 1.48/0.59 $false),
% 1.48/0.59 inference(trivial_inequality_removal,[],[f3184])).
% 1.48/0.59 thf(f3184,plain,(
% 1.48/0.59 (sK45 != sK45)),
% 1.48/0.59 inference(superposition,[],[f1558,f3176])).
% 1.48/0.59 thf(f3176,plain,(
% 1.48/0.59 ( ! [X0 : $i] : (((setunion @ (setadjoin @ X0 @ emptyset)) = X0)) )),
% 1.48/0.59 inference(forward_demodulation,[],[f3175,f3152])).
% 1.48/0.59 thf(f3152,plain,(
% 1.48/0.59 ( ! [X0 : $i] : (((binintersect @ X0 @ (setunion @ (setadjoin @ X0 @ emptyset))) = X0)) )),
% 1.48/0.59 inference(trivial_inequality_removal,[],[f3151])).
% 1.48/0.59 thf(f3151,plain,(
% 1.48/0.59 ( ! [X0 : $i] : (($true != $true) | ((binintersect @ X0 @ (setunion @ (setadjoin @ X0 @ emptyset))) = X0)) )),
% 1.48/0.59 inference(superposition,[],[f2797,f2757])).
% 1.48/0.59 thf(f2757,plain,(
% 1.48/0.59 ( ! [X1 : $i] : (((subset @ X1 @ (setunion @ (setadjoin @ X1 @ emptyset))) = $true)) )),
% 1.48/0.59 inference(trivial_inequality_removal,[],[f2593])).
% 1.48/0.59 thf(f2593,plain,(
% 1.48/0.59 ( ! [X1 : $i] : (((subset @ X1 @ (setunion @ (setadjoin @ X1 @ emptyset))) = $true) | ($true != $true)) )),
% 1.48/0.59 inference(definition_unfolding,[],[f2056,f1501])).
% 1.48/0.59 thf(f1501,plain,(
% 1.48/0.59 (setunionsingleton2 = $true)),
% 1.48/0.59 inference(cnf_transformation,[],[f742])).
% 1.48/0.59 thf(f742,plain,(
% 1.48/0.59 (emptyinunitempty = $true) & (symdiffE = $true) & (powersetI = $true) & (setadjoinSub2 = $true) & (setunionAx = $true) & (descrp = $true) & (singletonsubset = $true) & (setext = $true) & (symdiffIneg2 = $true) & (emptysetsubset = $true) & (subsetE = $true) & (in__Cong = $true) & (kpairp = $true) & (ubforcartprodlem3 = $true) & (notequalI1 = $true) & (binunionE = $true) & (setminusER = $true) & (cartprodpairin = $true) & (sepInPowerset = $true) & (powersetE1 = $true) & (powerset__Cong = $true) & ((setunion @ (setadjoin @ sK45 @ emptyset)) != sK45) & (eqinunit = $true) & (replAx = $true) & (notsubsetI = $true) & (exuI1 = $true) & (symdiffI1 = $true) & (setunion__Cong = $true) & (setadjoin__Cong = $true) & (dsetconstr__Cong = $true) & (notdexE = $true) & (setminusIRneg = $true) & (noeltsimpempty = $true) & (ubforcartprodlem1 = $true) & (inPowerset = $true) & (singletonsswitch = $true) & (setoftrueEq = $true) & (setminusI = $true) & (subsetRefl = $true) & (setadjoinE = $true) & (emptyE1 = $true) & (wellorderingAx = $true) & (setadjoinAx = $true) & (exuE3u = $true) & (emptyI = $true) & (binunionRsub = $true) & (nonemptyI1 = $true) & (subsetI2 = $true) & (inCongP = $true) & (singletoninpowerset = $true) & (eqimpsubset1 = $true) & (omegaSAx = $true) & (symdiffIneg1 = $true) & (setunionsingleton1 = $true) & (notdallE = $true) & (dsetconstrER = $true) & (nonemptyImpWitness = $true) & (ubforcartprodlem2 = $true) & (setbeta = $true) & (omega0Ax = $true) & (quantDeMorgan2 = $true) & (prop2setE = $true) & (setextsub = $true) & (nonemptyE1 = $true) & (dsetconstrI = $true) & (setextAx = $true) & (setadjoinIR = $true) & (subsetI1 = $true) & (upairsetIL = $true) & (setukpairIR = $true) & (dsetconstrEL = $true) & (powersetE = $true) & (binintersectSubset4 = $true) & (quantDeMorgan1 = $true) & (omegaIndAx = $true) & (vacuousDall = $true) & (setukpairIL = $true) & (emptyset__Cong = $true) & (setunionsingleton2 = $true) & (exuE3e = $true) & (setadjoinOr = $true) & (subsetE2 = $true) & (setminusELneg = $true) & (exuI2 = $true) & (powersetAx = $true) & (setminusILneg = $true) & (cartprodmempair = $true) & (notinsingleton = $true) & (nonemptyI = $true) & (exuI3 = $true) & (omega__Cong = $true) & (foundationAx = $true) & (binintersectSubset3 = $true) & (uniqinunit = $true) & (cartprodmempair1 = $true) & (binunionIR = $true) & (eqimpsubset2 = $true) & (setadjoinIL = $true) & (setminusSubset1 = $true) & (binintersectER = $true) & (binintersectSubset2 = $true) & (exuE2 = $true) & (emptyinPowerset = $true) & (symdiffI2 = $true) & (subPowSU = $true) & (setadjoinSub = $true) & (upairinpowunion = $true) & (setminusLsub = $true) & (subsetTrans = $true) & (notinemptyset = $true) & (kpairiskpair = $true) & (descr__Cong = $true) & (quantDeMorgan4 = $true) & (emptysetAx = $true) & (bs114d = $true) & (upairset2E = $true) & (upairsetE = $true) & (binintersectEL = $true) & (setunionE = $true) & (singletoninpowunion = $true) & (prop2set2propI = $true) & (sepSubset = $true) & (emptysetimpfalse = $true) & (exuE1 = $true) & (exu__Cong = $true) & (setminusERneg = $true) & (binintersectSubset5 = $true) & (subset2powerset = $true) & (powersetsubset = $true) & (setminusEL = $true) & (binintersectSubset1 = $true) & (quantDeMorgan3 = $true) & (binintersectLsub = $true) & (prop2setI = $true) & (secondinupair = $true) & (binintersectRsub = $true) & (exuEu = $true) & (setminusSubset2 = $true) & (notequalI2 = $true) & (subsetemptysetimpeq = $true) & (setunionE2 = $true) & (binunionIL = $true) & (powersetI1 = $true) & (disjointsetsI1 = $true) & (binunionLsub = $true) & (emptysetE = $true) & (emptyInPowerset = $true) & (binintersectI = $true) & (upairset2IR = $true) & (setunionI = $true) & (binunionEcases = $true) & (upairsetIR = $true) & (upairsubunion = $true)),
% 1.48/0.59 inference(skolemisation,[status(esa),new_symbols(skolem,[sK45])],[f620,f741])).
% 1.48/0.59 thf(f741,plain,(
% 1.48/0.59 ? [X0] : ((setunion @ (setadjoin @ X0 @ emptyset)) != X0) => ((setunion @ (setadjoin @ sK45 @ emptyset)) != sK45)),
% 1.48/0.59 introduced(choice_axiom,[])).
% 1.48/0.59 thf(f620,plain,(
% 1.48/0.59 (emptyinunitempty = $true) & (symdiffE = $true) & (powersetI = $true) & (setadjoinSub2 = $true) & (setunionAx = $true) & (descrp = $true) & (singletonsubset = $true) & (setext = $true) & (symdiffIneg2 = $true) & (emptysetsubset = $true) & (subsetE = $true) & (in__Cong = $true) & (kpairp = $true) & (ubforcartprodlem3 = $true) & (notequalI1 = $true) & (binunionE = $true) & (setminusER = $true) & (cartprodpairin = $true) & (sepInPowerset = $true) & (powersetE1 = $true) & (powerset__Cong = $true) & ? [X0] : ((setunion @ (setadjoin @ X0 @ emptyset)) != X0) & (eqinunit = $true) & (replAx = $true) & (notsubsetI = $true) & (exuI1 = $true) & (symdiffI1 = $true) & (setunion__Cong = $true) & (setadjoin__Cong = $true) & (dsetconstr__Cong = $true) & (notdexE = $true) & (setminusIRneg = $true) & (noeltsimpempty = $true) & (ubforcartprodlem1 = $true) & (inPowerset = $true) & (singletonsswitch = $true) & (setoftrueEq = $true) & (setminusI = $true) & (subsetRefl = $true) & (setadjoinE = $true) & (emptyE1 = $true) & (wellorderingAx = $true) & (setadjoinAx = $true) & (exuE3u = $true) & (emptyI = $true) & (binunionRsub = $true) & (nonemptyI1 = $true) & (subsetI2 = $true) & (inCongP = $true) & (singletoninpowerset = $true) & (eqimpsubset1 = $true) & (omegaSAx = $true) & (symdiffIneg1 = $true) & (setunionsingleton1 = $true) & (notdallE = $true) & (dsetconstrER = $true) & (nonemptyImpWitness = $true) & (ubforcartprodlem2 = $true) & (setbeta = $true) & (omega0Ax = $true) & (quantDeMorgan2 = $true) & (prop2setE = $true) & (setextsub = $true) & (nonemptyE1 = $true) & (dsetconstrI = $true) & (setextAx = $true) & (setadjoinIR = $true) & (subsetI1 = $true) & (upairsetIL = $true) & (setukpairIR = $true) & (dsetconstrEL = $true) & (powersetE = $true) & (binintersectSubset4 = $true) & (quantDeMorgan1 = $true) & (omegaIndAx = $true) & (vacuousDall = $true) & (setukpairIL = $true) & (emptyset__Cong = $true) & (setunionsingleton2 = $true) & (exuE3e = $true) & (setadjoinOr = $true) & (subsetE2 = $true) & (setminusELneg = $true) & (exuI2 = $true) & (powersetAx = $true) & (setminusILneg = $true) & (cartprodmempair = $true) & (notinsingleton = $true) & (nonemptyI = $true) & (exuI3 = $true) & (omega__Cong = $true) & (foundationAx = $true) & (binintersectSubset3 = $true) & (uniqinunit = $true) & (cartprodmempair1 = $true) & (binunionIR = $true) & (eqimpsubset2 = $true) & (setadjoinIL = $true) & (setminusSubset1 = $true) & (binintersectER = $true) & (binintersectSubset2 = $true) & (exuE2 = $true) & (emptyinPowerset = $true) & (symdiffI2 = $true) & (subPowSU = $true) & (setadjoinSub = $true) & (upairinpowunion = $true) & (setminusLsub = $true) & (subsetTrans = $true) & (notinemptyset = $true) & (kpairiskpair = $true) & (descr__Cong = $true) & (quantDeMorgan4 = $true) & (emptysetAx = $true) & (bs114d = $true) & (upairset2E = $true) & (upairsetE = $true) & (binintersectEL = $true) & (setunionE = $true) & (singletoninpowunion = $true) & (prop2set2propI = $true) & (sepSubset = $true) & (emptysetimpfalse = $true) & (exuE1 = $true) & (exu__Cong = $true) & (setminusERneg = $true) & (binintersectSubset5 = $true) & (subset2powerset = $true) & (powersetsubset = $true) & (setminusEL = $true) & (binintersectSubset1 = $true) & (quantDeMorgan3 = $true) & (binintersectLsub = $true) & (prop2setI = $true) & (secondinupair = $true) & (binintersectRsub = $true) & (exuEu = $true) & (setminusSubset2 = $true) & (notequalI2 = $true) & (subsetemptysetimpeq = $true) & (setunionE2 = $true) & (binunionIL = $true) & (powersetI1 = $true) & (disjointsetsI1 = $true) & (binunionLsub = $true) & (emptysetE = $true) & (emptyInPowerset = $true) & (binintersectI = $true) & (upairset2IR = $true) & (setunionI = $true) & (binunionEcases = $true) & (upairsetIR = $true) & (upairsubunion = $true)),
% 1.48/0.59 inference(flattening,[],[f619])).
% 1.48/0.59 thf(f619,plain,(
% 1.48/0.59 (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((? [X0] : ((setunion @ (setadjoin @ X0 @ emptyset)) != X0) & (setunionsingleton2 = $true)) & (setunionsingleton1 = $true)) & (setunionE2 = $true)) & (cartprodmempair = $true)) & (cartprodmempair1 = $true)) & (cartprodpairin = $true)) & (ubforcartprodlem3 = $true)) & (ubforcartprodlem2 = $true)) & (ubforcartprodlem1 = $true)) & (upairinpowunion = $true)) & (upairsubunion = $true)) & (upairset2E = $true)) & (singletoninpowunion = $true)) & (singletoninpowerset = $true)) & (singletonsubset = $true)) & (kpairp = $true)) & (kpairiskpair = $true)) & (setukpairIR = $true)) & (setukpairIL = $true)) & (secondinupair = $true)) & (symdiffIneg2 = $true)) & (symdiffIneg1 = $true)) & (symdiffI2 = $true)) & (symdiffI1 = $true)) & (symdiffE = $true)) & (setminusSubset1 = $true)) & (setminusLsub = $true)) & (setminusIRneg = $true)) & (setminusILneg = $true)) & (setminusELneg = $true)) & (setminusERneg = $true)) & (setminusSubset2 = $true)) & (setminusER = $true)) & (setminusEL = $true)) & (setminusI = $true)) & (bs114d = $true)) & (binintersectSubset1 = $true)) & (binintersectSubset4 = $true)) & (binintersectRsub = $true)) & (disjointsetsI1 = $true)) & (binintersectER = $true)) & (binintersectSubset3 = $true)) & (binintersectSubset2 = $true)) & (binintersectLsub = $true)) & (binintersectEL = $true)) & (binintersectSubset5 = $true)) & (binintersectI = $true)) & (binunionRsub = $true)) & (binunionLsub = $true)) & (binunionE = $true)) & (binunionEcases = $true)) & (binunionIR = $true)) & (upairset2IR = $true)) & (binunionIL = $true)) & (sepSubset = $true)) & (sepInPowerset = $true)) & (powersetsubset = $true)) & (inPowerset = $true)) & (powersetE1 = $true)) & (powersetI1 = $true)) & (subsetemptysetimpeq = $true)) & (setextsub = $true)) & (subset2powerset = $true)) & (setadjoinSub2 = $true)) & (setadjoinSub = $true)) & (subsetTrans = $true)) & (subsetRefl = $true)) & (notequalI2 = $true)) & (notequalI1 = $true)) & (notsubsetI = $true)) & (subsetE2 = $true)) & (subsetE = $true)) & (emptysetsubset = $true)) & (subsetI2 = $true)) & (eqimpsubset1 = $true)) & (eqimpsubset2 = $true)) & (subsetI1 = $true)) & (dsetconstr__Cong = $true)) & (descr__Cong = $true)) & (exuEu = $true)) & (omega__Cong = $true)) & (setunion__Cong = $true)) & (powerset__Cong = $true)) & (setadjoin__Cong = $true)) & (emptyset__Cong = $true)) & (exu__Cong = $true)) & (exuE3u = $true)) & (in__Cong = $true)) & (inCongP = $true)) & (exuI2 = $true)) & (exuI3 = $true)) & (exuI1 = $true)) & (notdallE = $true)) & (notdexE = $true)) & (prop2set2propI = $true)) & (prop2setI = $true)) & (quantDeMorgan4 = $true)) & (quantDeMorgan3 = $true)) & (quantDeMorgan2 = $true)) & (quantDeMorgan1 = $true)) & (vacuousDall = $true)) & (emptyE1 = $true)) & (upairsetIR = $true)) & (upairsetIL = $true)) & (upairsetE = $true)) & (singletonsswitch = $true)) & (eqinunit = $true)) & (notinsingleton = $true)) & (uniqinunit = $true)) & (nonemptyImpWitness = $true)) & (exuE2 = $true)) & (subPowSU = $true)) & (setunionE = $true)) & (setunionI = $true)) & (powersetE = $true)) & (emptyInPowerset = $true)) & (emptyinPowerset = $true)) & (powersetI = $true)) & (setoftrueEq = $true)) & (setadjoinOr = $true)) & (setadjoinE = $true)) & (setadjoinIR = $true)) & (emptyinunitempty = $true)) & (setadjoinIL = $true)) & (nonemptyI1 = $true)) & (nonemptyI = $true)) & (nonemptyE1 = $true)) & (setbeta = $true)) & (noeltsimpempty = $true)) & (emptyI = $true)) & (setext = $true)) & (exuE3e = $true)) & (notinemptyset = $true)) & (emptysetimpfalse = $true)) & (emptysetE = $true)) & (prop2setE = $true)) & (exuE1 = $true)) & (dsetconstrER = $true)) & (dsetconstrEL = $true)) & (dsetconstrI = $true)) & (descrp = $true)) & (wellorderingAx = $true)) & (foundationAx = $true)) & (replAx = $true)) & (omegaIndAx = $true)) & (omegaSAx = $true)) & (omega0Ax = $true)) & (setunionAx = $true)) & (powersetAx = $true)) & (setadjoinAx = $true)) & (emptysetAx = $true)) & (setextAx = $true)),
% 1.48/0.59 inference(ennf_transformation,[],[f374])).
% 1.48/0.59 thf(f374,plain,(
% 1.48/0.59 ~((setextAx = $true) => ((emptysetAx = $true) => ((setadjoinAx = $true) => ((powersetAx = $true) => ((setunionAx = $true) => ((omega0Ax = $true) => ((omegaSAx = $true) => ((omegaIndAx = $true) => ((replAx = $true) => ((foundationAx = $true) => ((wellorderingAx = $true) => ((descrp = $true) => ((dsetconstrI = $true) => ((dsetconstrEL = $true) => ((dsetconstrER = $true) => ((exuE1 = $true) => ((prop2setE = $true) => ((emptysetE = $true) => ((emptysetimpfalse = $true) => ((notinemptyset = $true) => ((exuE3e = $true) => ((setext = $true) => ((emptyI = $true) => ((noeltsimpempty = $true) => ((setbeta = $true) => ((nonemptyE1 = $true) => ((nonemptyI = $true) => ((nonemptyI1 = $true) => ((setadjoinIL = $true) => ((emptyinunitempty = $true) => ((setadjoinIR = $true) => ((setadjoinE = $true) => ((setadjoinOr = $true) => ((setoftrueEq = $true) => ((powersetI = $true) => ((emptyinPowerset = $true) => ((emptyInPowerset = $true) => ((powersetE = $true) => ((setunionI = $true) => ((setunionE = $true) => ((subPowSU = $true) => ((exuE2 = $true) => ((nonemptyImpWitness = $true) => ((uniqinunit = $true) => ((notinsingleton = $true) => ((eqinunit = $true) => ((singletonsswitch = $true) => ((upairsetE = $true) => ((upairsetIL = $true) => ((upairsetIR = $true) => ((emptyE1 = $true) => ((vacuousDall = $true) => ((quantDeMorgan1 = $true) => ((quantDeMorgan2 = $true) => ((quantDeMorgan3 = $true) => ((quantDeMorgan4 = $true) => ((prop2setI = $true) => ((prop2set2propI = $true) => ((notdexE = $true) => ((notdallE = $true) => ((exuI1 = $true) => ((exuI3 = $true) => ((exuI2 = $true) => ((inCongP = $true) => ((in__Cong = $true) => ((exuE3u = $true) => ((exu__Cong = $true) => ((emptyset__Cong = $true) => ((setadjoin__Cong = $true) => ((powerset__Cong = $true) => ((setunion__Cong = $true) => ((omega__Cong = $true) => ((exuEu = $true) => ((descr__Cong = $true) => ((dsetconstr__Cong = $true) => ((subsetI1 = $true) => ((eqimpsubset2 = $true) => ((eqimpsubset1 = $true) => ((subsetI2 = $true) => ((emptysetsubset = $true) => ((subsetE = $true) => ((subsetE2 = $true) => ((notsubsetI = $true) => ((notequalI1 = $true) => ((notequalI2 = $true) => ((subsetRefl = $true) => ((subsetTrans = $true) => ((setadjoinSub = $true) => ((setadjoinSub2 = $true) => ((subset2powerset = $true) => ((setextsub = $true) => ((subsetemptysetimpeq = $true) => ((powersetI1 = $true) => ((powersetE1 = $true) => ((inPowerset = $true) => ((powersetsubset = $true) => ((sepInPowerset = $true) => ((sepSubset = $true) => ((binunionIL = $true) => ((upairset2IR = $true) => ((binunionIR = $true) => ((binunionEcases = $true) => ((binunionE = $true) => ((binunionLsub = $true) => ((binunionRsub = $true) => ((binintersectI = $true) => ((binintersectSubset5 = $true) => ((binintersectEL = $true) => ((binintersectLsub = $true) => ((binintersectSubset2 = $true) => ((binintersectSubset3 = $true) => ((binintersectER = $true) => ((disjointsetsI1 = $true) => ((binintersectRsub = $true) => ((binintersectSubset4 = $true) => ((binintersectSubset1 = $true) => ((bs114d = $true) => ((setminusI = $true) => ((setminusEL = $true) => ((setminusER = $true) => ((setminusSubset2 = $true) => ((setminusERneg = $true) => ((setminusELneg = $true) => ((setminusILneg = $true) => ((setminusIRneg = $true) => ((setminusLsub = $true) => ((setminusSubset1 = $true) => ((symdiffE = $true) => ((symdiffI1 = $true) => ((symdiffI2 = $true) => ((symdiffIneg1 = $true) => ((symdiffIneg2 = $true) => ((secondinupair = $true) => ((setukpairIL = $true) => ((setukpairIR = $true) => ((kpairiskpair = $true) => ((kpairp = $true) => ((singletonsubset = $true) => ((singletoninpowerset = $true) => ((singletoninpowunion = $true) => ((upairset2E = $true) => ((upairsubunion = $true) => ((upairinpowunion = $true) => ((ubforcartprodlem1 = $true) => ((ubforcartprodlem2 = $true) => ((ubforcartprodlem3 = $true) => ((cartprodpairin = $true) => ((cartprodmempair1 = $true) => ((cartprodmempair = $true) => ((setunionE2 = $true) => ((setunionsingleton1 = $true) => ((setunionsingleton2 = $true) => ! [X0] : ((setunion @ (setadjoin @ X0 @ emptyset)) = X0)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),
% 1.48/0.59 inference(fool_elimination,[],[f373])).
% 1.48/0.59 thf(f373,plain,(
% 1.48/0.59 ~(setextAx => (emptysetAx => (setadjoinAx => (powersetAx => (setunionAx => (omega0Ax => (omegaSAx => (omegaIndAx => (replAx => (foundationAx => (wellorderingAx => (descrp => (dsetconstrI => (dsetconstrEL => (dsetconstrER => (exuE1 => (prop2setE => (emptysetE => (emptysetimpfalse => (notinemptyset => (exuE3e => (setext => (emptyI => (noeltsimpempty => (setbeta => (nonemptyE1 => (nonemptyI => (nonemptyI1 => (setadjoinIL => (emptyinunitempty => (setadjoinIR => (setadjoinE => (setadjoinOr => (setoftrueEq => (powersetI => (emptyinPowerset => (emptyInPowerset => (powersetE => (setunionI => (setunionE => (subPowSU => (exuE2 => (nonemptyImpWitness => (uniqinunit => (notinsingleton => (eqinunit => (singletonsswitch => (upairsetE => (upairsetIL => (upairsetIR => (emptyE1 => (vacuousDall => (quantDeMorgan1 => (quantDeMorgan2 => (quantDeMorgan3 => (quantDeMorgan4 => (prop2setI => (prop2set2propI => (notdexE => (notdallE => (exuI1 => (exuI3 => (exuI2 => (inCongP => (in__Cong => (exuE3u => (exu__Cong => (emptyset__Cong => (setadjoin__Cong => (powerset__Cong => (setunion__Cong => (omega__Cong => (exuEu => (descr__Cong => (dsetconstr__Cong => (subsetI1 => (eqimpsubset2 => (eqimpsubset1 => (subsetI2 => (emptysetsubset => (subsetE => (subsetE2 => (notsubsetI => (notequalI1 => (notequalI2 => (subsetRefl => (subsetTrans => (setadjoinSub => (setadjoinSub2 => (subset2powerset => (setextsub => (subsetemptysetimpeq => (powersetI1 => (powersetE1 => (inPowerset => (powersetsubset => (sepInPowerset => (sepSubset => (binunionIL => (upairset2IR => (binunionIR => (binunionEcases => (binunionE => (binunionLsub => (binunionRsub => (binintersectI => (binintersectSubset5 => (binintersectEL => (binintersectLsub => (binintersectSubset2 => (binintersectSubset3 => (binintersectER => (disjointsetsI1 => (binintersectRsub => (binintersectSubset4 => (binintersectSubset1 => (bs114d => (setminusI => (setminusEL => (setminusER => (setminusSubset2 => (setminusERneg => (setminusELneg => (setminusILneg => (setminusIRneg => (setminusLsub => (setminusSubset1 => (symdiffE => (symdiffI1 => (symdiffI2 => (symdiffIneg1 => (symdiffIneg2 => (secondinupair => (setukpairIL => (setukpairIR => (kpairiskpair => (kpairp => (singletonsubset => (singletoninpowerset => (singletoninpowunion => (upairset2E => (upairsubunion => (upairinpowunion => (ubforcartprodlem1 => (ubforcartprodlem2 => (ubforcartprodlem3 => (cartprodpairin => (cartprodmempair1 => (cartprodmempair => (setunionE2 => (setunionsingleton1 => (setunionsingleton2 => ! [X0] : ((setunion @ (setadjoin @ X0 @ emptyset)) = X0)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),
% 1.48/0.59 inference(rectify,[],[f158])).
% 1.48/0.59 thf(f158,negated_conjecture,(
% 1.48/0.59 ~(setextAx => (emptysetAx => (setadjoinAx => (powersetAx => (setunionAx => (omega0Ax => (omegaSAx => (omegaIndAx => (replAx => (foundationAx => (wellorderingAx => (descrp => (dsetconstrI => (dsetconstrEL => (dsetconstrER => (exuE1 => (prop2setE => (emptysetE => (emptysetimpfalse => (notinemptyset => (exuE3e => (setext => (emptyI => (noeltsimpempty => (setbeta => (nonemptyE1 => (nonemptyI => (nonemptyI1 => (setadjoinIL => (emptyinunitempty => (setadjoinIR => (setadjoinE => (setadjoinOr => (setoftrueEq => (powersetI => (emptyinPowerset => (emptyInPowerset => (powersetE => (setunionI => (setunionE => (subPowSU => (exuE2 => (nonemptyImpWitness => (uniqinunit => (notinsingleton => (eqinunit => (singletonsswitch => (upairsetE => (upairsetIL => (upairsetIR => (emptyE1 => (vacuousDall => (quantDeMorgan1 => (quantDeMorgan2 => (quantDeMorgan3 => (quantDeMorgan4 => (prop2setI => (prop2set2propI => (notdexE => (notdallE => (exuI1 => (exuI3 => (exuI2 => (inCongP => (in__Cong => (exuE3u => (exu__Cong => (emptyset__Cong => (setadjoin__Cong => (powerset__Cong => (setunion__Cong => (omega__Cong => (exuEu => (descr__Cong => (dsetconstr__Cong => (subsetI1 => (eqimpsubset2 => (eqimpsubset1 => (subsetI2 => (emptysetsubset => (subsetE => (subsetE2 => (notsubsetI => (notequalI1 => (notequalI2 => (subsetRefl => (subsetTrans => (setadjoinSub => (setadjoinSub2 => (subset2powerset => (setextsub => (subsetemptysetimpeq => (powersetI1 => (powersetE1 => (inPowerset => (powersetsubset => (sepInPowerset => (sepSubset => (binunionIL => (upairset2IR => (binunionIR => (binunionEcases => (binunionE => (binunionLsub => (binunionRsub => (binintersectI => (binintersectSubset5 => (binintersectEL => (binintersectLsub => (binintersectSubset2 => (binintersectSubset3 => (binintersectER => (disjointsetsI1 => (binintersectRsub => (binintersectSubset4 => (binintersectSubset1 => (bs114d => (setminusI => (setminusEL => (setminusER => (setminusSubset2 => (setminusERneg => (setminusELneg => (setminusILneg => (setminusIRneg => (setminusLsub => (setminusSubset1 => (symdiffE => (symdiffI1 => (symdiffI2 => (symdiffIneg1 => (symdiffIneg2 => (secondinupair => (setukpairIL => (setukpairIR => (kpairiskpair => (kpairp => (singletonsubset => (singletoninpowerset => (singletoninpowunion => (upairset2E => (upairsubunion => (upairinpowunion => (ubforcartprodlem1 => (ubforcartprodlem2 => (ubforcartprodlem3 => (cartprodpairin => (cartprodmempair1 => (cartprodmempair => (setunionE2 => (setunionsingleton1 => (setunionsingleton2 => ! [X1] : ((setunion @ (setadjoin @ X1 @ emptyset)) = X1)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),
% 1.48/0.59 inference(negated_conjecture,[],[f157])).
% 1.48/0.59 thf(f157,conjecture,(
% 1.48/0.59 setextAx => (emptysetAx => (setadjoinAx => (powersetAx => (setunionAx => (omega0Ax => (omegaSAx => (omegaIndAx => (replAx => (foundationAx => (wellorderingAx => (descrp => (dsetconstrI => (dsetconstrEL => (dsetconstrER => (exuE1 => (prop2setE => (emptysetE => (emptysetimpfalse => (notinemptyset => (exuE3e => (setext => (emptyI => (noeltsimpempty => (setbeta => (nonemptyE1 => (nonemptyI => (nonemptyI1 => (setadjoinIL => (emptyinunitempty => (setadjoinIR => (setadjoinE => (setadjoinOr => (setoftrueEq => (powersetI => (emptyinPowerset => (emptyInPowerset => (powersetE => (setunionI => (setunionE => (subPowSU => (exuE2 => (nonemptyImpWitness => (uniqinunit => (notinsingleton => (eqinunit => (singletonsswitch => (upairsetE => (upairsetIL => (upairsetIR => (emptyE1 => (vacuousDall => (quantDeMorgan1 => (quantDeMorgan2 => (quantDeMorgan3 => (quantDeMorgan4 => (prop2setI => (prop2set2propI => (notdexE => (notdallE => (exuI1 => (exuI3 => (exuI2 => (inCongP => (in__Cong => (exuE3u => (exu__Cong => (emptyset__Cong => (setadjoin__Cong => (powerset__Cong => (setunion__Cong => (omega__Cong => (exuEu => (descr__Cong => (dsetconstr__Cong => (subsetI1 => (eqimpsubset2 => (eqimpsubset1 => (subsetI2 => (emptysetsubset => (subsetE => (subsetE2 => (notsubsetI => (notequalI1 => (notequalI2 => (subsetRefl => (subsetTrans => (setadjoinSub => (setadjoinSub2 => (subset2powerset => (setextsub => (subsetemptysetimpeq => (powersetI1 => (powersetE1 => (inPowerset => (powersetsubset => (sepInPowerset => (sepSubset => (binunionIL => (upairset2IR => (binunionIR => (binunionEcases => (binunionE => (binunionLsub => (binunionRsub => (binintersectI => (binintersectSubset5 => (binintersectEL => (binintersectLsub => (binintersectSubset2 => (binintersectSubset3 => (binintersectER => (disjointsetsI1 => (binintersectRsub => (binintersectSubset4 => (binintersectSubset1 => (bs114d => (setminusI => (setminusEL => (setminusER => (setminusSubset2 => (setminusERneg => (setminusELneg => (setminusILneg => (setminusIRneg => (setminusLsub => (setminusSubset1 => (symdiffE => (symdiffI1 => (symdiffI2 => (symdiffIneg1 => (symdiffIneg2 => (secondinupair => (setukpairIL => (setukpairIR => (kpairiskpair => (kpairp => (singletonsubset => (singletoninpowerset => (singletoninpowunion => (upairset2E => (upairsubunion => (upairinpowunion => (ubforcartprodlem1 => (ubforcartprodlem2 => (ubforcartprodlem3 => (cartprodpairin => (cartprodmempair1 => (cartprodmempair => (setunionE2 => (setunionsingleton1 => (setunionsingleton2 => ! [X1] : ((setunion @ (setadjoin @ X1 @ emptyset)) = X1))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),
% 1.48/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setunionsingleton)).
% 1.48/0.59 thf(f2056,plain,(
% 1.48/0.59 ( ! [X1 : $i] : (((subset @ X1 @ (setunion @ (setadjoin @ X1 @ emptyset))) = $true) | (setunionsingleton2 != $true)) )),
% 1.48/0.59 inference(cnf_transformation,[],[f1313])).
% 1.48/0.59 thf(f1313,plain,(
% 1.48/0.59 ((setunionsingleton2 = $true) | ((subset @ sK387 @ (setunion @ (setadjoin @ sK387 @ emptyset))) != $true)) & (! [X1] : ((subset @ X1 @ (setunion @ (setadjoin @ X1 @ emptyset))) = $true) | (setunionsingleton2 != $true))),
% 1.48/0.59 inference(skolemisation,[status(esa),new_symbols(skolem,[sK387])],[f1311,f1312])).
% 1.48/0.59 thf(f1312,plain,(
% 1.48/0.59 ? [X0] : ((subset @ X0 @ (setunion @ (setadjoin @ X0 @ emptyset))) != $true) => ((subset @ sK387 @ (setunion @ (setadjoin @ sK387 @ emptyset))) != $true)),
% 1.48/0.59 introduced(choice_axiom,[])).
% 1.48/0.59 thf(f1311,plain,(
% 1.48/0.59 ((setunionsingleton2 = $true) | ? [X0] : ((subset @ X0 @ (setunion @ (setadjoin @ X0 @ emptyset))) != $true)) & (! [X1] : ((subset @ X1 @ (setunion @ (setadjoin @ X1 @ emptyset))) = $true) | (setunionsingleton2 != $true))),
% 1.48/0.59 inference(rectify,[],[f1310])).
% 1.48/0.59 thf(f1310,plain,(
% 1.48/0.59 ((setunionsingleton2 = $true) | ? [X0] : ((subset @ X0 @ (setunion @ (setadjoin @ X0 @ emptyset))) != $true)) & (! [X0] : ((subset @ X0 @ (setunion @ (setadjoin @ X0 @ emptyset))) = $true) | (setunionsingleton2 != $true))),
% 1.48/0.59 inference(nnf_transformation,[],[f197])).
% 1.48/0.59 thf(f197,plain,(
% 1.48/0.59 (setunionsingleton2 = $true) <=> ! [X0] : ((subset @ X0 @ (setunion @ (setadjoin @ X0 @ emptyset))) = $true)),
% 1.48/0.59 inference(fool_elimination,[],[f196])).
% 1.48/0.59 thf(f196,plain,(
% 1.48/0.59 (! [X0] : (subset @ X0 @ (setunion @ (setadjoin @ X0 @ emptyset))) = setunionsingleton2)),
% 1.48/0.59 inference(rectify,[],[f156])).
% 1.48/0.59 thf(f156,axiom,(
% 1.48/0.59 (! [X3] : (subset @ X3 @ (setunion @ (setadjoin @ X3 @ emptyset))) = setunionsingleton2)),
% 1.48/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setunionsingleton2)).
% 1.48/0.59 thf(f2797,plain,(
% 1.48/0.59 ( ! [X0 : $i,X1 : $i] : (((subset @ X0 @ X1) != $true) | ((binintersect @ X0 @ X1) = X0)) )),
% 1.48/0.59 inference(trivial_inequality_removal,[],[f2186])).
% 1.48/0.59 thf(f2186,plain,(
% 1.48/0.59 ( ! [X0 : $i,X1 : $i] : (((subset @ X0 @ X1) != $true) | ((binintersect @ X0 @ X1) = X0) | ($true != $true)) )),
% 1.48/0.59 inference(definition_unfolding,[],[f1608,f1479])).
% 1.48/0.59 thf(f1479,plain,(
% 1.48/0.59 (binintersectSubset2 = $true)),
% 1.48/0.59 inference(cnf_transformation,[],[f742])).
% 1.48/0.59 thf(f1608,plain,(
% 1.48/0.59 ( ! [X0 : $i,X1 : $i] : (((subset @ X0 @ X1) != $true) | ((binintersect @ X0 @ X1) = X0) | (binintersectSubset2 != $true)) )),
% 1.48/0.59 inference(cnf_transformation,[],[f780])).
% 1.48/0.59 thf(f780,plain,(
% 1.48/0.59 (! [X0,X1] : (((subset @ X0 @ X1) != $true) | ((binintersect @ X0 @ X1) = X0)) | (binintersectSubset2 != $true)) & ((binintersectSubset2 = $true) | (((subset @ sK64 @ sK65) = $true) & ((binintersect @ sK64 @ sK65) != sK64)))),
% 1.48/0.59 inference(skolemisation,[status(esa),new_symbols(skolem,[sK64,sK65])],[f778,f779])).
% 1.48/0.59 thf(f779,plain,(
% 1.48/0.59 ? [X2,X3] : (((subset @ X2 @ X3) = $true) & ((binintersect @ X2 @ X3) != X2)) => (((subset @ sK64 @ sK65) = $true) & ((binintersect @ sK64 @ sK65) != sK64))),
% 1.48/0.59 introduced(choice_axiom,[])).
% 1.48/0.59 thf(f778,plain,(
% 1.48/0.59 (! [X0,X1] : (((subset @ X0 @ X1) != $true) | ((binintersect @ X0 @ X1) = X0)) | (binintersectSubset2 != $true)) & ((binintersectSubset2 = $true) | ? [X2,X3] : (((subset @ X2 @ X3) = $true) & ((binintersect @ X2 @ X3) != X2)))),
% 1.48/0.59 inference(rectify,[],[f777])).
% 1.48/0.59 thf(f777,plain,(
% 1.48/0.59 (! [X0,X1] : (((subset @ X0 @ X1) != $true) | ((binintersect @ X0 @ X1) = X0)) | (binintersectSubset2 != $true)) & ((binintersectSubset2 = $true) | ? [X0,X1] : (((subset @ X0 @ X1) = $true) & ((binintersect @ X0 @ X1) != X0)))),
% 1.48/0.59 inference(nnf_transformation,[],[f582])).
% 1.48/0.59 thf(f582,plain,(
% 1.48/0.59 ! [X0,X1] : (((subset @ X0 @ X1) != $true) | ((binintersect @ X0 @ X1) = X0)) <=> (binintersectSubset2 = $true)),
% 1.48/0.59 inference(ennf_transformation,[],[f388])).
% 1.48/0.59 thf(f388,plain,(
% 1.48/0.59 ! [X0,X1] : (((subset @ X0 @ X1) = $true) => ((binintersect @ X0 @ X1) = X0)) <=> (binintersectSubset2 = $true)),
% 1.48/0.59 inference(fool_elimination,[],[f387])).
% 1.48/0.59 thf(f387,plain,(
% 1.48/0.59 (binintersectSubset2 = ! [X0,X1] : ((subset @ X0 @ X1) => ((binintersect @ X0 @ X1) = X0)))),
% 1.48/0.59 inference(rectify,[],[f112])).
% 1.48/0.59 thf(f112,axiom,(
% 1.48/0.59 (binintersectSubset2 = ! [X3,X4] : ((subset @ X3 @ X4) => ((binintersect @ X3 @ X4) = X3)))),
% 1.48/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectSubset2)).
% 1.48/0.59 thf(f3175,plain,(
% 1.48/0.59 ( ! [X0 : $i] : (((setunion @ (setadjoin @ X0 @ emptyset)) = (binintersect @ X0 @ (setunion @ (setadjoin @ X0 @ emptyset))))) )),
% 1.48/0.59 inference(trivial_inequality_removal,[],[f3168])).
% 1.48/0.59 thf(f3168,plain,(
% 1.48/0.59 ( ! [X0 : $i] : (((setunion @ (setadjoin @ X0 @ emptyset)) = (binintersect @ X0 @ (setunion @ (setadjoin @ X0 @ emptyset)))) | ($true != $true)) )),
% 1.48/0.59 inference(superposition,[],[f2883,f2907])).
% 1.48/0.59 thf(f2907,plain,(
% 1.48/0.59 ( ! [X0 : $i] : (((subset @ (setunion @ (setadjoin @ X0 @ emptyset)) @ X0) = $true)) )),
% 1.48/0.59 inference(trivial_inequality_removal,[],[f2322])).
% 1.48/0.59 thf(f2322,plain,(
% 1.48/0.59 ( ! [X0 : $i] : (((subset @ (setunion @ (setadjoin @ X0 @ emptyset)) @ X0) = $true) | ($true != $true)) )),
% 1.48/0.59 inference(definition_unfolding,[],[f1743,f1526])).
% 1.48/0.59 thf(f1526,plain,(
% 1.48/0.59 (setunionsingleton1 = $true)),
% 1.48/0.59 inference(cnf_transformation,[],[f742])).
% 1.48/0.59 thf(f1743,plain,(
% 1.48/0.59 ( ! [X0 : $i] : (((subset @ (setunion @ (setadjoin @ X0 @ emptyset)) @ X0) = $true) | (setunionsingleton1 != $true)) )),
% 1.48/0.59 inference(cnf_transformation,[],[f948])).
% 1.48/0.59 thf(f948,plain,(
% 1.48/0.59 (! [X0] : ((subset @ (setunion @ (setadjoin @ X0 @ emptyset)) @ X0) = $true) | (setunionsingleton1 != $true)) & ((setunionsingleton1 = $true) | ((subset @ (setunion @ (setadjoin @ sK163 @ emptyset)) @ sK163) != $true))),
% 1.48/0.59 inference(skolemisation,[status(esa),new_symbols(skolem,[sK163])],[f946,f947])).
% 1.48/0.59 thf(f947,plain,(
% 1.48/0.59 ? [X1] : ((subset @ (setunion @ (setadjoin @ X1 @ emptyset)) @ X1) != $true) => ((subset @ (setunion @ (setadjoin @ sK163 @ emptyset)) @ sK163) != $true)),
% 1.48/0.59 introduced(choice_axiom,[])).
% 1.48/0.59 thf(f946,plain,(
% 1.48/0.59 (! [X0] : ((subset @ (setunion @ (setadjoin @ X0 @ emptyset)) @ X0) = $true) | (setunionsingleton1 != $true)) & ((setunionsingleton1 = $true) | ? [X1] : ((subset @ (setunion @ (setadjoin @ X1 @ emptyset)) @ X1) != $true))),
% 1.48/0.59 inference(rectify,[],[f945])).
% 1.48/0.59 thf(f945,plain,(
% 1.48/0.59 (! [X0] : ((subset @ (setunion @ (setadjoin @ X0 @ emptyset)) @ X0) = $true) | (setunionsingleton1 != $true)) & ((setunionsingleton1 = $true) | ? [X0] : ((subset @ (setunion @ (setadjoin @ X0 @ emptyset)) @ X0) != $true))),
% 1.48/0.59 inference(nnf_transformation,[],[f425])).
% 1.48/0.59 thf(f425,plain,(
% 1.48/0.59 ! [X0] : ((subset @ (setunion @ (setadjoin @ X0 @ emptyset)) @ X0) = $true) <=> (setunionsingleton1 = $true)),
% 1.48/0.59 inference(fool_elimination,[],[f424])).
% 1.48/0.59 thf(f424,plain,(
% 1.48/0.59 (! [X0] : (subset @ (setunion @ (setadjoin @ X0 @ emptyset)) @ X0) = setunionsingleton1)),
% 1.48/0.59 inference(rectify,[],[f155])).
% 1.48/0.59 thf(f155,axiom,(
% 1.48/0.59 (! [X3] : (subset @ (setunion @ (setadjoin @ X3 @ emptyset)) @ X3) = setunionsingleton1)),
% 1.48/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setunionsingleton1)).
% 1.48/0.59 thf(f2883,plain,(
% 1.48/0.59 ( ! [X0 : $i,X1 : $i] : (((subset @ X0 @ X1) != $true) | ((binintersect @ X1 @ X0) = X0)) )),
% 1.48/0.59 inference(trivial_inequality_removal,[],[f2413])).
% 1.48/0.59 thf(f2413,plain,(
% 1.48/0.59 ( ! [X0 : $i,X1 : $i] : (($true != $true) | ((subset @ X0 @ X1) != $true) | ((binintersect @ X1 @ X0) = X0)) )),
% 1.48/0.59 inference(definition_unfolding,[],[f1879,f1507])).
% 1.48/0.59 thf(f1507,plain,(
% 1.48/0.59 (binintersectSubset4 = $true)),
% 1.48/0.59 inference(cnf_transformation,[],[f742])).
% 1.48/0.59 thf(f1879,plain,(
% 1.48/0.59 ( ! [X0 : $i,X1 : $i] : (((subset @ X0 @ X1) != $true) | ((binintersect @ X1 @ X0) = X0) | (binintersectSubset4 != $true)) )),
% 1.48/0.59 inference(cnf_transformation,[],[f1097])).
% 1.48/0.59 thf(f1097,plain,(
% 1.48/0.59 (! [X0,X1] : (((subset @ X0 @ X1) != $true) | ((binintersect @ X1 @ X0) = X0)) | (binintersectSubset4 != $true)) & ((binintersectSubset4 = $true) | (((subset @ sK252 @ sK253) = $true) & ((binintersect @ sK253 @ sK252) != sK252)))),
% 1.48/0.59 inference(skolemisation,[status(esa),new_symbols(skolem,[sK252,sK253])],[f1095,f1096])).
% 1.48/0.59 thf(f1096,plain,(
% 1.48/0.59 ? [X2,X3] : (((subset @ X2 @ X3) = $true) & ((binintersect @ X3 @ X2) != X2)) => (((subset @ sK252 @ sK253) = $true) & ((binintersect @ sK253 @ sK252) != sK252))),
% 1.48/0.59 introduced(choice_axiom,[])).
% 1.48/0.59 thf(f1095,plain,(
% 1.48/0.59 (! [X0,X1] : (((subset @ X0 @ X1) != $true) | ((binintersect @ X1 @ X0) = X0)) | (binintersectSubset4 != $true)) & ((binintersectSubset4 = $true) | ? [X2,X3] : (((subset @ X2 @ X3) = $true) & ((binintersect @ X3 @ X2) != X2)))),
% 1.48/0.59 inference(rectify,[],[f1094])).
% 1.48/0.59 thf(f1094,plain,(
% 1.48/0.59 (! [X0,X1] : (((subset @ X0 @ X1) != $true) | ((binintersect @ X1 @ X0) = X0)) | (binintersectSubset4 != $true)) & ((binintersectSubset4 = $true) | ? [X0,X1] : (((subset @ X0 @ X1) = $true) & ((binintersect @ X1 @ X0) != X0)))),
% 1.48/0.59 inference(nnf_transformation,[],[f574])).
% 1.48/0.59 thf(f574,plain,(
% 1.48/0.59 ! [X0,X1] : (((subset @ X0 @ X1) != $true) | ((binintersect @ X1 @ X0) = X0)) <=> (binintersectSubset4 = $true)),
% 1.48/0.59 inference(ennf_transformation,[],[f339])).
% 1.48/0.59 thf(f339,plain,(
% 1.48/0.59 ! [X0,X1] : (((subset @ X0 @ X1) = $true) => ((binintersect @ X1 @ X0) = X0)) <=> (binintersectSubset4 = $true)),
% 1.48/0.59 inference(fool_elimination,[],[f338])).
% 1.48/0.59 thf(f338,plain,(
% 1.48/0.59 (binintersectSubset4 = ! [X0,X1] : ((subset @ X0 @ X1) => ((binintersect @ X1 @ X0) = X0)))),
% 1.48/0.59 inference(rectify,[],[f117])).
% 1.48/0.59 thf(f117,axiom,(
% 1.48/0.59 (binintersectSubset4 = ! [X4,X3] : ((subset @ X4 @ X3) => ((binintersect @ X3 @ X4) = X4)))),
% 1.48/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectSubset4)).
% 1.48/0.59 thf(f1558,plain,(
% 1.48/0.59 ((setunion @ (setadjoin @ sK45 @ emptyset)) != sK45)),
% 1.48/0.59 inference(cnf_transformation,[],[f742])).
% 1.48/0.59 % SZS output end Proof for theBenchmark
% 1.48/0.59 % (22923)------------------------------
% 1.48/0.59 % (22923)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.48/0.59 % (22923)Termination reason: Refutation
% 1.48/0.59
% 1.48/0.59 % (22923)Memory used [KB]: 8187
% 1.48/0.59 % (22923)Time elapsed: 0.145 s
% 1.48/0.59 % (22923)Instructions burned: 215 (million)
% 1.48/0.59 % (22923)------------------------------
% 1.48/0.59 % (22923)------------------------------
% 1.48/0.59 % (22902)Success in time 0.201 s
% 1.48/0.59 % Vampire---4.8 exiting
%------------------------------------------------------------------------------