TSTP Solution File: SEU707^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU707^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.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:55 EDT 2024
% Result : Theorem 0.22s 0.47s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU707^2 : TPTP v8.2.0. Released v3.7.0.
% 0.11/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.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 17:40:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 % (18678)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.38 % (18672)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.14/0.38 % (18678)Instruction limit reached!
% 0.14/0.38 % (18678)------------------------------
% 0.14/0.38 % (18678)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (18678)Termination reason: Unknown
% 0.14/0.38 % (18678)Termination phase: Preprocessing 3
% 0.14/0.38
% 0.14/0.38 % (18678)Memory used [KB]: 1023
% 0.14/0.38 % (18678)Time elapsed: 0.003 s
% 0.14/0.38 % (18678)Instructions burned: 3 (million)
% 0.14/0.38 % (18678)------------------------------
% 0.14/0.38 % (18678)------------------------------
% 0.14/0.38 % (18672)Instruction limit reached!
% 0.14/0.38 % (18672)------------------------------
% 0.14/0.38 % (18672)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (18672)Termination reason: Unknown
% 0.14/0.38 % (18672)Termination phase: Property scanning
% 0.14/0.38
% 0.14/0.38 % (18672)Memory used [KB]: 1023
% 0.14/0.38 % (18672)Time elapsed: 0.004 s
% 0.14/0.38 % (18672)Instructions burned: 4 (million)
% 0.14/0.38 % (18672)------------------------------
% 0.14/0.38 % (18672)------------------------------
% 0.14/0.38 % (18677)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.39 % (18674)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.39 % (18676)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.14/0.39 % (18671)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.14/0.39 % (18673)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.14/0.39 % (18675)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.39 % (18674)Instruction limit reached!
% 0.14/0.39 % (18674)------------------------------
% 0.14/0.39 % (18674)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (18674)Termination reason: Unknown
% 0.14/0.39 % (18674)Termination phase: Preprocessing 3
% 0.14/0.39
% 0.14/0.39 % (18675)Instruction limit reached!
% 0.14/0.39 % (18675)------------------------------
% 0.14/0.39 % (18675)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (18674)Memory used [KB]: 1023
% 0.14/0.39 % (18674)Time elapsed: 0.004 s
% 0.14/0.39 % (18674)Instructions burned: 3 (million)
% 0.14/0.39 % (18674)------------------------------
% 0.14/0.39 % (18674)------------------------------
% 0.14/0.39 % (18675)Termination reason: Unknown
% 0.14/0.39 % (18675)Termination phase: shuffling
% 0.14/0.39
% 0.14/0.39 % (18675)Memory used [KB]: 895
% 0.14/0.39 % (18675)Time elapsed: 0.004 s
% 0.14/0.39 % (18675)Instructions burned: 2 (million)
% 0.14/0.39 % (18675)------------------------------
% 0.14/0.39 % (18675)------------------------------
% 0.14/0.39 % (18677)Instruction limit reached!
% 0.14/0.39 % (18677)------------------------------
% 0.14/0.39 % (18677)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (18677)Termination reason: Unknown
% 0.14/0.39 % (18677)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (18677)Memory used [KB]: 5628
% 0.14/0.39 % (18677)Time elapsed: 0.014 s
% 0.14/0.39 % (18677)Instructions burned: 18 (million)
% 0.14/0.39 % (18677)------------------------------
% 0.14/0.39 % (18677)------------------------------
% 0.14/0.39 % (18679)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.14/0.39 % (18676)Refutation not found, incomplete strategy
% 0.14/0.39 % (18676)------------------------------
% 0.14/0.39 % (18676)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (18676)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 % (18676)Memory used [KB]: 5500
% 0.14/0.39 % (18676)Time elapsed: 0.009 s
% 0.14/0.39 % (18676)Instructions burned: 7 (million)
% 0.14/0.39 % (18676)------------------------------
% 0.14/0.39 % (18676)------------------------------
% 0.14/0.39 % (18680)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.14/0.40 % (18673)Refutation not found, incomplete strategy
% 0.14/0.40 % (18673)------------------------------
% 0.14/0.40 % (18673)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (18673)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 % (18673)Memory used [KB]: 5628
% 0.14/0.40 % (18673)Time elapsed: 0.014 s
% 0.14/0.40 % (18673)Instructions burned: 13 (million)
% 0.14/0.40 % (18673)------------------------------
% 0.14/0.40 % (18673)------------------------------
% 0.14/0.40 % (18681)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.14/0.40 % (18681)Instruction limit reached!
% 0.14/0.40 % (18681)------------------------------
% 0.14/0.40 % (18681)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (18681)Termination reason: Unknown
% 0.14/0.40 % (18681)Termination phase: Function definition elimination
% 0.14/0.40
% 0.14/0.40 % (18681)Memory used [KB]: 1023
% 0.14/0.40 % (18681)Time elapsed: 0.004 s
% 0.14/0.40 % (18681)Instructions burned: 3 (million)
% 0.14/0.40 % (18681)------------------------------
% 0.14/0.40 % (18681)------------------------------
% 0.14/0.41 % (18680)Instruction limit reached!
% 0.14/0.41 % (18680)------------------------------
% 0.14/0.41 % (18680)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.41 % (18680)Termination reason: Unknown
% 0.14/0.41 % (18680)Termination phase: Saturation
% 0.14/0.41
% 0.14/0.41 % (18680)Memory used [KB]: 5628
% 0.14/0.41 % (18680)Time elapsed: 0.013 s
% 0.14/0.41 % (18680)Instructions burned: 16 (million)
% 0.14/0.41 % (18680)------------------------------
% 0.14/0.41 % (18680)------------------------------
% 0.14/0.41 % (18683)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.14/0.41 % (18682)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.14/0.41 % (18684)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.14/0.41 % (18683)Instruction limit reached!
% 0.14/0.41 % (18683)------------------------------
% 0.14/0.41 % (18683)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.41 % (18683)Termination reason: Unknown
% 0.14/0.41 % (18683)Termination phase: Saturation
% 0.14/0.41
% 0.14/0.41 % (18683)Memory used [KB]: 1023
% 0.14/0.41 % (18683)Time elapsed: 0.006 s
% 0.14/0.41 % (18683)Instructions burned: 7 (million)
% 0.14/0.41 % (18683)------------------------------
% 0.14/0.41 % (18683)------------------------------
% 0.14/0.41 % (18685)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.22/0.41 % (18685)Instruction limit reached!
% 0.22/0.41 % (18685)------------------------------
% 0.22/0.41 % (18685)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.41 % (18685)Termination reason: Unknown
% 0.22/0.41 % (18685)Termination phase: Property scanning
% 0.22/0.41
% 0.22/0.41 % (18685)Memory used [KB]: 1023
% 0.22/0.41 % (18685)Time elapsed: 0.003 s
% 0.22/0.41 % (18685)Instructions burned: 5 (million)
% 0.22/0.41 % (18685)------------------------------
% 0.22/0.41 % (18685)------------------------------
% 0.22/0.41 % (18679)Instruction limit reached!
% 0.22/0.41 % (18679)------------------------------
% 0.22/0.41 % (18679)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.41 % (18679)Termination reason: Unknown
% 0.22/0.41 % (18679)Termination phase: Saturation
% 0.22/0.41
% 0.22/0.41 % (18679)Memory used [KB]: 5628
% 0.22/0.41 % (18679)Time elapsed: 0.024 s
% 0.22/0.41 % (18679)Instructions burned: 38 (million)
% 0.22/0.41 % (18679)------------------------------
% 0.22/0.41 % (18679)------------------------------
% 0.22/0.42 % (18686)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.22/0.42 % (18684)Instruction limit reached!
% 0.22/0.42 % (18684)------------------------------
% 0.22/0.42 % (18684)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42 % (18687)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.22/0.42 % (18684)Termination reason: Unknown
% 0.22/0.42 % (18684)Termination phase: Saturation
% 0.22/0.42
% 0.22/0.42 % (18684)Memory used [KB]: 5884
% 0.22/0.42 % (18684)Time elapsed: 0.013 s
% 0.22/0.42 % (18684)Instructions burned: 17 (million)
% 0.22/0.42 % (18684)------------------------------
% 0.22/0.42 % (18684)------------------------------
% 0.22/0.42 % (18686)Instruction limit reached!
% 0.22/0.42 % (18686)------------------------------
% 0.22/0.42 % (18686)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42 % (18686)Termination reason: Unknown
% 0.22/0.42 % (18686)Termination phase: Property scanning
% 0.22/0.42
% 0.22/0.42 % (18686)Memory used [KB]: 1023
% 0.22/0.42 % (18686)Time elapsed: 0.004 s
% 0.22/0.42 % (18686)Instructions burned: 4 (million)
% 0.22/0.42 % (18686)------------------------------
% 0.22/0.42 % (18686)------------------------------
% 0.22/0.42 % (18689)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.22/0.42 % (18689)Instruction limit reached!
% 0.22/0.42 % (18689)------------------------------
% 0.22/0.42 % (18689)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42 % (18689)Termination reason: Unknown
% 0.22/0.42 % (18689)Termination phase: Property scanning
% 0.22/0.42
% 0.22/0.42 % (18689)Memory used [KB]: 1023
% 0.22/0.42 % (18689)Time elapsed: 0.003 s
% 0.22/0.42 % (18689)Instructions burned: 4 (million)
% 0.22/0.42 % (18689)------------------------------
% 0.22/0.42 % (18689)------------------------------
% 0.22/0.42 % (18687)Refutation not found, incomplete strategy
% 0.22/0.42 % (18687)------------------------------
% 0.22/0.42 % (18687)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42 % (18687)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.42
% 0.22/0.42
% 0.22/0.42 % (18687)Memory used [KB]: 5500
% 0.22/0.42 % (18687)Time elapsed: 0.005 s
% 0.22/0.42 % (18687)Instructions burned: 5 (million)
% 0.22/0.42 % (18687)------------------------------
% 0.22/0.42 % (18687)------------------------------
% 0.22/0.42 % (18688)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.22/0.43 % (18688)Instruction limit reached!
% 0.22/0.43 % (18688)------------------------------
% 0.22/0.43 % (18688)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.43 % (18688)Termination reason: Unknown
% 0.22/0.43 % (18688)Termination phase: Saturation
% 0.22/0.43
% 0.22/0.43 % (18688)Memory used [KB]: 1023
% 0.22/0.43 % (18688)Time elapsed: 0.004 s
% 0.22/0.43 % (18688)Instructions burned: 4 (million)
% 0.22/0.43 % (18688)------------------------------
% 0.22/0.43 % (18688)------------------------------
% 0.22/0.43 % (18690)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.22/0.43 % (18693)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.22/0.43 % (18691)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.22/0.44 % (18692)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.22/0.44 % (18693)Refutation not found, incomplete strategy
% 0.22/0.44 % (18693)------------------------------
% 0.22/0.44 % (18693)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (18693)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.44
% 0.22/0.44
% 0.22/0.44 % (18693)Memory used [KB]: 5500
% 0.22/0.44 % (18693)Time elapsed: 0.005 s
% 0.22/0.44 % (18693)Instructions burned: 7 (million)
% 0.22/0.44 % (18693)------------------------------
% 0.22/0.44 % (18693)------------------------------
% 0.22/0.44 % (18692)Instruction limit reached!
% 0.22/0.44 % (18692)------------------------------
% 0.22/0.44 % (18692)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (18692)Termination reason: Unknown
% 0.22/0.44 % (18692)Termination phase: Saturation
% 0.22/0.44
% 0.22/0.44 % (18692)Memory used [KB]: 5500
% 0.22/0.44 % (18692)Time elapsed: 0.005 s
% 0.22/0.44 % (18692)Instructions burned: 6 (million)
% 0.22/0.44 % (18692)------------------------------
% 0.22/0.44 % (18692)------------------------------
% 0.22/0.44 % (18695)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.22/0.44 % (18690)Instruction limit reached!
% 0.22/0.44 % (18690)------------------------------
% 0.22/0.44 % (18690)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (18690)Termination reason: Unknown
% 0.22/0.44 % (18690)Termination phase: Saturation
% 0.22/0.44
% 0.22/0.44 % (18690)Memory used [KB]: 5628
% 0.22/0.44 % (18690)Time elapsed: 0.013 s
% 0.22/0.44 % (18690)Instructions burned: 18 (million)
% 0.22/0.44 % (18690)------------------------------
% 0.22/0.44 % (18690)------------------------------
% 0.22/0.44 % (18696)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2999ds/5Mi)
% 0.22/0.44 % (18696)Instruction limit reached!
% 0.22/0.44 % (18696)------------------------------
% 0.22/0.44 % (18696)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (18696)Termination reason: Unknown
% 0.22/0.44 % (18696)Termination phase: Saturation
% 0.22/0.44
% 0.22/0.44 % (18696)Memory used [KB]: 5500
% 0.22/0.44 % (18696)Time elapsed: 0.005 s
% 0.22/0.44 % (18696)Instructions burned: 5 (million)
% 0.22/0.44 % (18696)------------------------------
% 0.22/0.44 % (18696)------------------------------
% 0.22/0.45 % (18695)Instruction limit reached!
% 0.22/0.45 % (18695)------------------------------
% 0.22/0.45 % (18695)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.45 % (18695)Termination reason: Unknown
% 0.22/0.45 % (18695)Termination phase: Saturation
% 0.22/0.45
% 0.22/0.45 % (18695)Memory used [KB]: 5628
% 0.22/0.45 % (18695)Time elapsed: 0.016 s
% 0.22/0.45 % (18695)Instructions burned: 21 (million)
% 0.22/0.45 % (18695)------------------------------
% 0.22/0.45 % (18695)------------------------------
% 0.22/0.45 % (18697)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.22/0.45 % (18698)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.22/0.45 % (18699)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.22/0.46 % (18697)Instruction limit reached!
% 0.22/0.46 % (18697)------------------------------
% 0.22/0.46 % (18697)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.46 % (18697)Termination reason: Unknown
% 0.22/0.46 % (18697)Termination phase: Saturation
% 0.22/0.46
% 0.22/0.46 % (18697)Memory used [KB]: 5500
% 0.22/0.46 % (18697)Time elapsed: 0.005 s
% 0.22/0.46 % (18697)Instructions burned: 6 (million)
% 0.22/0.46 % (18697)------------------------------
% 0.22/0.46 % (18697)------------------------------
% 0.22/0.46 % (18700)lrs+10_1:1_cnfonf=lazy_not_be_gen:ntd=on:sp=const_min:ss=axioms:sup=off:i=19:si=on:rtra=on_0 on theBenchmark for (2999ds/19Mi)
% 0.22/0.46 % (18698)Refutation not found, incomplete strategy
% 0.22/0.46 % (18698)------------------------------
% 0.22/0.46 % (18698)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.46 % (18698)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.46
% 0.22/0.46
% 0.22/0.46 % (18698)Memory used [KB]: 5628
% 0.22/0.46 % (18698)Time elapsed: 0.009 s
% 0.22/0.46 % (18698)Instructions burned: 11 (million)
% 0.22/0.46 % (18698)------------------------------
% 0.22/0.46 % (18698)------------------------------
% 0.22/0.46 % (18691)First to succeed.
% 0.22/0.47 % (18691)Refutation found. Thanks to Tanya!
% 0.22/0.47 % SZS status Theorem for theBenchmark
% 0.22/0.47 % SZS output start Proof for theBenchmark
% 0.22/0.47 thf(func_def_0, type, in: $i > $i > $o).
% 0.22/0.47 thf(func_def_1, type, setunion: $i > $i).
% 0.22/0.47 thf(func_def_2, type, dsetconstr: $i > ($i > $o) > $i).
% 0.22/0.47 thf(func_def_3, type, singleton: $i > $o).
% 0.22/0.47 thf(func_def_7, type, if: $i > $o > $i > $i > $i).
% 0.22/0.47 thf(func_def_35, type, ph15: !>[X0: $tType]:(X0)).
% 0.22/0.47 thf(func_def_36, type, sK16: $o > $i).
% 0.22/0.47 thf(func_def_39, type, sK19: $o > $i).
% 0.22/0.47 thf(f381,plain,(
% 0.22/0.47 $false),
% 0.22/0.47 inference(subsumption_resolution,[],[f374,f358])).
% 0.22/0.47 thf(f358,plain,(
% 0.22/0.47 ( ! [X0 : $o] : (($false = X0)) )),
% 0.22/0.47 inference(subsumption_resolution,[],[f338,f357])).
% 0.22/0.47 thf(f357,plain,(
% 0.22/0.47 ( ! [X0 : $o] : (($false = X0) | (sK6 = (sK19 @ X0))) )),
% 0.22/0.47 inference(not_proxy_clausification,[],[f356])).
% 0.22/0.47 thf(f356,plain,(
% 0.22/0.47 ( ! [X0 : $o] : ((sK6 = (sK19 @ X0)) | ($true = (~ X0))) )),
% 0.22/0.47 inference(duplicate_literal_removal,[],[f355])).
% 0.22/0.47 thf(f355,plain,(
% 0.22/0.47 ( ! [X0 : $o] : ((sK6 = (sK19 @ X0)) | (sK6 = (sK19 @ X0)) | ($true = (~ X0))) )),
% 0.22/0.47 inference(equality_proxy_clausification,[],[f350])).
% 0.22/0.47 thf(f350,plain,(
% 0.22/0.47 ( ! [X0 : $o] : (($true = (sK6 = (sK19 @ X0))) | (sK6 = (sK19 @ X0)) | ($true = (~ X0))) )),
% 0.22/0.47 inference(binary_proxy_clausification,[],[f344])).
% 0.22/0.47 thf(f344,plain,(
% 0.22/0.47 ( ! [X0 : $o] : ((sK6 = (sK19 @ X0)) | (((sK9 = (sK19 @ X0)) & (~ X0)) = $true) | ($true = (sK6 = (sK19 @ X0)))) )),
% 0.22/0.47 inference(binary_proxy_clausification,[],[f343])).
% 0.22/0.47 thf(f343,plain,(
% 0.22/0.47 ( ! [X0 : $o] : ((sK6 = (sK19 @ X0)) | ((X0 & (sK6 = (sK19 @ X0))) = $true) | (((sK9 = (sK19 @ X0)) & (~ X0)) = $true)) )),
% 0.22/0.47 inference(binary_proxy_clausification,[],[f342])).
% 0.22/0.47 thf(f342,plain,(
% 0.22/0.47 ( ! [X0 : $o] : ((((X0 & (sK6 = (sK19 @ X0))) | ((sK9 = (sK19 @ X0)) & (~ X0))) = $true) | (sK6 = (sK19 @ X0))) )),
% 0.22/0.47 inference(equality_proxy_clausification,[],[f331])).
% 0.22/0.47 thf(f331,plain,(
% 0.22/0.47 ( ! [X0 : $o] : (($true = (sK6 = (sK19 @ X0))) | (((X0 & (sK6 = (sK19 @ X0))) | ((sK9 = (sK19 @ X0)) & (~ X0))) = $true)) )),
% 0.22/0.47 inference(binary_proxy_clausification,[],[f330])).
% 0.22/0.47 thf(f330,plain,(
% 0.22/0.47 ( ! [X0 : $o] : ((((X0 & (sK6 = (sK19 @ X0))) | ((sK9 = (sK19 @ X0)) & (~ X0))) != (sK6 = (sK19 @ X0)))) )),
% 0.22/0.47 inference(beta_eta_normalization,[],[f329])).
% 0.22/0.47 thf(f329,plain,(
% 0.22/0.47 ( ! [X0 : $o] : (((sK6 = (sK19 @ X0)) != ((^[Y0 : $i]: ((X0 & (sK6 = Y0)) | ((sK9 = Y0) & (~ X0)))) @ (sK19 @ X0)))) )),
% 0.22/0.47 inference(negative_extensionality,[],[f155])).
% 0.22/0.47 thf(f155,plain,(
% 0.22/0.47 ( ! [X0 : $o] : (((= @ sK6) != (^[Y0 : $i]: ((X0 & (sK6 = Y0)) | ((sK9 = Y0) & (~ X0)))))) )),
% 0.22/0.47 inference(trivial_inequality_removal,[],[f153])).
% 0.22/0.47 thf(f153,plain,(
% 0.22/0.47 ( ! [X0 : $o] : (((= @ sK6) != (^[Y0 : $i]: ((X0 & (sK6 = Y0)) | ((sK9 = Y0) & (~ X0))))) | ($true != $true)) )),
% 0.22/0.47 inference(constrained_superposition,[],[f132,f124])).
% 0.22/0.47 thf(f124,plain,(
% 0.22/0.47 ( ! [X0 : $o] : (((singleton @ (dsetconstr @ sK8 @ (^[Y0 : $i]: ((X0 & (sK6 = Y0)) | ((sK9 = Y0) & (~ X0)))))) = $true)) )),
% 0.22/0.47 inference(trivial_inequality_removal,[],[f123])).
% 0.22/0.47 thf(f123,plain,(
% 0.22/0.47 ( ! [X0 : $o] : (((singleton @ (dsetconstr @ sK8 @ (^[Y0 : $i]: ((X0 & (sK6 = Y0)) | ((sK9 = Y0) & (~ X0)))))) = $true) | ($true != $true)) )),
% 0.22/0.47 inference(superposition,[],[f116,f56])).
% 0.22/0.47 thf(f56,plain,(
% 0.22/0.47 ((in @ sK6 @ sK8) = $true)),
% 0.22/0.47 inference(cnf_transformation,[],[f36])).
% 0.22/0.47 thf(f36,plain,(
% 0.22/0.47 (theeq = $true) & (((in @ sK6 @ sK8) = $true) & (($true = (in @ sK9 @ sK8)) & ($true = sK7) & ((if @ sK8 @ sK7 @ sK6 @ sK9) != sK6))) & (ifSingleton = $true) & (iftrueProp1 = $true)),
% 0.22/0.47 inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9])],[f19,f35,f34])).
% 0.22/0.47 thf(f34,plain,(
% 0.22/0.47 ? [X0,X1 : $o,X2] : (((in @ X0 @ X2) = $true) & ? [X3] : (((in @ X3 @ X2) = $true) & ($true = X1) & ((if @ X2 @ X1 @ X0 @ X3) != X0))) => (((in @ sK6 @ sK8) = $true) & ? [X3] : (((in @ X3 @ sK8) = $true) & ($true = sK7) & ((if @ sK8 @ sK7 @ sK6 @ X3) != sK6)))),
% 0.22/0.47 introduced(choice_axiom,[])).
% 0.22/0.47 thf(f35,plain,(
% 0.22/0.47 ? [X3] : (((in @ X3 @ sK8) = $true) & ($true = sK7) & ((if @ sK8 @ sK7 @ sK6 @ X3) != sK6)) => (($true = (in @ sK9 @ sK8)) & ($true = sK7) & ((if @ sK8 @ sK7 @ sK6 @ sK9) != sK6))),
% 0.22/0.47 introduced(choice_axiom,[])).
% 0.22/0.47 thf(f19,plain,(
% 0.22/0.47 (theeq = $true) & ? [X0,X1 : $o,X2] : (((in @ X0 @ X2) = $true) & ? [X3] : (((in @ X3 @ X2) = $true) & ($true = X1) & ((if @ X2 @ X1 @ X0 @ X3) != X0))) & (ifSingleton = $true) & (iftrueProp1 = $true)),
% 0.22/0.47 inference(flattening,[],[f18])).
% 0.22/0.47 thf(f18,plain,(
% 0.22/0.47 ((? [X0,X1 : $o,X2] : (? [X3] : ((((if @ X2 @ X1 @ X0 @ X3) != X0) & ($true = X1)) & ((in @ X3 @ X2) = $true)) & ((in @ X0 @ X2) = $true)) & (theeq = $true)) & (ifSingleton = $true)) & (iftrueProp1 = $true)),
% 0.22/0.47 inference(ennf_transformation,[],[f11])).
% 0.22/0.47 thf(f11,plain,(
% 0.22/0.47 ~((iftrueProp1 = $true) => ((ifSingleton = $true) => ((theeq = $true) => ! [X0,X1 : $o,X2] : (((in @ X0 @ X2) = $true) => ! [X3] : (((in @ X3 @ X2) = $true) => (($true = X1) => ((if @ X2 @ X1 @ X0 @ X3) = X0)))))))),
% 0.22/0.47 inference(fool_elimination,[],[f10])).
% 0.22/0.47 thf(f10,plain,(
% 0.22/0.47 ~(iftrueProp1 => (ifSingleton => (theeq => ! [X0,X1 : $o,X2] : ((in @ X0 @ X2) => ! [X3] : ((in @ X3 @ X2) => (X1 => ((if @ X2 @ X1 @ X0 @ X3) = X0)))))))),
% 0.22/0.47 inference(rectify,[],[f6])).
% 0.22/0.47 thf(f6,negated_conjecture,(
% 0.22/0.47 ~(iftrueProp1 => (ifSingleton => (theeq => ! [X2,X1 : $o,X0] : ((in @ X2 @ X0) => ! [X3] : ((in @ X3 @ X0) => (X1 => ((if @ X0 @ X1 @ X2 @ X3) = X2)))))))),
% 0.22/0.47 inference(negated_conjecture,[],[f5])).
% 0.22/0.47 thf(f5,conjecture,(
% 0.22/0.47 iftrueProp1 => (ifSingleton => (theeq => ! [X2,X1 : $o,X0] : ((in @ X2 @ X0) => ! [X3] : ((in @ X3 @ X0) => (X1 => ((if @ X0 @ X1 @ X2 @ X3) = X2))))))),
% 0.22/0.47 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',iftrue)).
% 0.22/0.47 thf(f116,plain,(
% 0.22/0.47 ( ! [X0 : $i,X1 : $o] : (((in @ X0 @ sK8) != $true) | ($true = (singleton @ (dsetconstr @ sK8 @ (^[Y0 : $i]: ((X1 & (X0 = Y0)) | ((sK9 = Y0) & (~ X1)))))))) )),
% 0.22/0.47 inference(trivial_inequality_removal,[],[f114])).
% 0.22/0.47 thf(f114,plain,(
% 0.22/0.47 ( ! [X0 : $i,X1 : $o] : (($true = (singleton @ (dsetconstr @ sK8 @ (^[Y0 : $i]: ((X1 & (X0 = Y0)) | ((sK9 = Y0) & (~ X1))))))) | ((in @ X0 @ sK8) != $true) | ($true != $true)) )),
% 0.22/0.47 inference(superposition,[],[f90,f55])).
% 0.22/0.47 thf(f55,plain,(
% 0.22/0.47 ($true = (in @ sK9 @ sK8))),
% 0.22/0.47 inference(cnf_transformation,[],[f36])).
% 0.22/0.47 thf(f90,plain,(
% 0.22/0.47 ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $o] : (($true != (in @ X7 @ X4)) | ($true = (singleton @ (dsetconstr @ X4 @ (^[Y0 : $i]: ((X5 & (X6 = Y0)) | ((X7 = Y0) & (~ X5))))))) | ((in @ X6 @ X4) != $true)) )),
% 0.22/0.47 inference(trivial_inequality_removal,[],[f66])).
% 0.22/0.47 thf(f66,plain,(
% 0.22/0.47 ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $o] : (($true != (in @ X7 @ X4)) | ($true != $true) | ((in @ X6 @ X4) != $true) | ($true = (singleton @ (dsetconstr @ X4 @ (^[Y0 : $i]: ((X5 & (X6 = Y0)) | ((X7 = Y0) & (~ X5)))))))) )),
% 0.22/0.47 inference(definition_unfolding,[],[f42,f52])).
% 0.22/0.47 thf(f52,plain,(
% 0.22/0.47 (ifSingleton = $true)),
% 0.22/0.47 inference(cnf_transformation,[],[f36])).
% 0.22/0.47 thf(f42,plain,(
% 0.22/0.47 ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $o] : (((in @ X6 @ X4) != $true) | ($true != (in @ X7 @ X4)) | ($true = (singleton @ (dsetconstr @ X4 @ (^[Y0 : $i]: ((X5 & (X6 = Y0)) | ((X7 = Y0) & (~ X5))))))) | (ifSingleton != $true)) )),
% 0.22/0.47 inference(cnf_transformation,[],[f28])).
% 0.22/0.47 thf(f28,plain,(
% 0.22/0.47 ((ifSingleton = $true) | (($true = (in @ sK2 @ sK0)) & (((in @ sK3 @ sK0) = $true) & ($true != (singleton @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((sK1 & (sK2 = Y0)) | ((sK3 = Y0) & (~ sK1)))))))))) & (! [X4,X5 : $o,X6] : (((in @ X6 @ X4) != $true) | ! [X7] : (($true != (in @ X7 @ X4)) | ($true = (singleton @ (dsetconstr @ X4 @ (^[Y0 : $i]: ((X5 & (X6 = Y0)) | ((X7 = Y0) & (~ X5))))))))) | (ifSingleton != $true))),
% 0.22/0.47 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f25,f27,f26])).
% 0.22/0.47 thf(f26,plain,(
% 0.22/0.47 ? [X0,X1 : $o,X2] : (((in @ X2 @ X0) = $true) & ? [X3] : (((in @ X3 @ X0) = $true) & ((singleton @ (dsetconstr @ X0 @ (^[Y0 : $i]: ((X1 & (X2 = Y0)) | ((X3 = Y0) & (~ X1)))))) != $true))) => (($true = (in @ sK2 @ sK0)) & ? [X3] : (((in @ X3 @ sK0) = $true) & ($true != (singleton @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((sK1 & (sK2 = Y0)) | ((X3 = Y0) & (~ sK1)))))))))),
% 0.22/0.47 introduced(choice_axiom,[])).
% 0.22/0.47 thf(f27,plain,(
% 0.22/0.47 ? [X3] : (((in @ X3 @ sK0) = $true) & ($true != (singleton @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((sK1 & (sK2 = Y0)) | ((X3 = Y0) & (~ sK1)))))))) => (((in @ sK3 @ sK0) = $true) & ($true != (singleton @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((sK1 & (sK2 = Y0)) | ((sK3 = Y0) & (~ sK1))))))))),
% 0.22/0.47 introduced(choice_axiom,[])).
% 0.22/0.47 thf(f25,plain,(
% 0.22/0.47 ((ifSingleton = $true) | ? [X0,X1 : $o,X2] : (((in @ X2 @ X0) = $true) & ? [X3] : (((in @ X3 @ X0) = $true) & ((singleton @ (dsetconstr @ X0 @ (^[Y0 : $i]: ((X1 & (X2 = Y0)) | ((X3 = Y0) & (~ X1)))))) != $true)))) & (! [X4,X5 : $o,X6] : (((in @ X6 @ X4) != $true) | ! [X7] : (($true != (in @ X7 @ X4)) | ($true = (singleton @ (dsetconstr @ X4 @ (^[Y0 : $i]: ((X5 & (X6 = Y0)) | ((X7 = Y0) & (~ X5))))))))) | (ifSingleton != $true))),
% 0.22/0.47 inference(rectify,[],[f24])).
% 0.22/0.47 thf(f24,plain,(
% 0.22/0.47 ((ifSingleton = $true) | ? [X0,X1 : $o,X2] : (((in @ X2 @ X0) = $true) & ? [X3] : (((in @ X3 @ X0) = $true) & ((singleton @ (dsetconstr @ X0 @ (^[Y0 : $i]: ((X1 & (X2 = Y0)) | ((X3 = Y0) & (~ X1)))))) != $true)))) & (! [X0,X1 : $o,X2] : (((in @ X2 @ X0) != $true) | ! [X3] : (((in @ X3 @ X0) != $true) | ((singleton @ (dsetconstr @ X0 @ (^[Y0 : $i]: ((X1 & (X2 = Y0)) | ((X3 = Y0) & (~ X1)))))) = $true))) | (ifSingleton != $true))),
% 0.22/0.47 inference(nnf_transformation,[],[f23])).
% 0.22/0.47 thf(f23,plain,(
% 0.22/0.47 (ifSingleton = $true) <=> ! [X0,X1 : $o,X2] : (((in @ X2 @ X0) != $true) | ! [X3] : (((in @ X3 @ X0) != $true) | ((singleton @ (dsetconstr @ X0 @ (^[Y0 : $i]: ((X1 & (X2 = Y0)) | ((X3 = Y0) & (~ X1)))))) = $true)))),
% 0.22/0.47 inference(ennf_transformation,[],[f13])).
% 0.22/0.47 thf(f13,plain,(
% 0.22/0.47 ! [X0,X1 : $o,X2] : (((in @ X2 @ X0) = $true) => ! [X3] : (((in @ X3 @ X0) = $true) => ((singleton @ (dsetconstr @ X0 @ (^[Y0 : $i]: ((X1 & (X2 = Y0)) | ((X3 = Y0) & (~ X1)))))) = $true))) <=> (ifSingleton = $true)),
% 0.22/0.47 inference(fool_elimination,[],[f12])).
% 0.22/0.47 thf(f12,plain,(
% 0.22/0.47 (ifSingleton = ! [X0,X1 : $o,X2] : ((in @ X2 @ X0) => ! [X3] : ((in @ X3 @ X0) => (singleton @ (dsetconstr @ X0 @ (^[X4 : $i] : ((~X1 & (X3 = X4)) | ((X2 = X4) & X1))))))))),
% 0.22/0.47 inference(rectify,[],[f2])).
% 0.22/0.47 thf(f2,axiom,(
% 0.22/0.47 (ifSingleton = ! [X0,X1 : $o,X2] : ((in @ X2 @ X0) => ! [X3] : ((in @ X3 @ X0) => (singleton @ (dsetconstr @ X0 @ (^[X4 : $i] : ((~X1 & (X3 = X4)) | ((X2 = X4) & X1))))))))),
% 0.22/0.47 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifSingleton)).
% 0.22/0.47 thf(f132,plain,(
% 0.22/0.47 ($true != (singleton @ (dsetconstr @ sK8 @ (= @ sK6))))),
% 0.22/0.47 inference(subsumption_resolution,[],[f129,f83])).
% 0.22/0.47 thf(f83,plain,(
% 0.22/0.47 (sK6 != (setunion @ (dsetconstr @ sK8 @ (= @ sK6))))),
% 0.22/0.47 inference(beta_eta_normalization,[],[f82])).
% 0.22/0.47 thf(f82,plain,(
% 0.22/0.47 (sK6 != (setunion @ (dsetconstr @ sK8 @ (^[Y0 : $i]: (sK6 = Y0)))))),
% 0.22/0.47 inference(boolean_simplification,[],[f81])).
% 0.22/0.47 thf(f81,plain,(
% 0.22/0.47 (sK6 != (setunion @ (dsetconstr @ sK8 @ (^[Y0 : $i]: ((sK6 = Y0) & $true)))))),
% 0.22/0.47 inference(boolean_simplification,[],[f80])).
% 0.22/0.47 thf(f80,plain,(
% 0.22/0.47 (sK6 != (setunion @ (dsetconstr @ sK8 @ (^[Y0 : $i]: (((sK6 = Y0) & $true) | $false)))))),
% 0.22/0.47 inference(boolean_simplification,[],[f79])).
% 0.22/0.47 thf(f79,plain,(
% 0.22/0.47 (sK6 != (setunion @ (dsetconstr @ sK8 @ (^[Y0 : $i]: (((sK6 = Y0) & $true) | ($false & (sK9 = Y0)))))))),
% 0.22/0.47 inference(boolean_simplification,[],[f78])).
% 0.22/0.47 thf(f78,plain,(
% 0.22/0.47 (sK6 != (setunion @ (dsetconstr @ sK8 @ (^[Y0 : $i]: (((sK6 = Y0) & $true) | ((~ $true) & (sK9 = Y0)))))))),
% 0.22/0.47 inference(beta_eta_normalization,[],[f71])).
% 0.22/0.47 thf(f71,plain,(
% 0.22/0.47 (sK6 != ((^[Y0 : $i]: ((^[Y1 : $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: (setunion @ (dsetconstr @ Y0 @ (^[Y4 : $i]: (((Y2 = Y4) & Y1) | ((~ Y1) & (Y3 = Y4))))))))))))) @ sK8 @ $true @ sK6 @ sK9))),
% 0.22/0.47 inference(definition_unfolding,[],[f53,f50,f54])).
% 0.22/0.47 thf(f54,plain,(
% 0.22/0.47 ($true = sK7)),
% 0.22/0.47 inference(cnf_transformation,[],[f36])).
% 0.22/0.47 thf(f50,plain,(
% 0.22/0.47 (if = (^[Y0 : $i]: ((^[Y1 : $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: (setunion @ (dsetconstr @ Y0 @ (^[Y4 : $i]: (((Y2 = Y4) & Y1) | ((~ Y1) & (Y3 = Y4))))))))))))))),
% 0.22/0.47 inference(cnf_transformation,[],[f17])).
% 0.22/0.47 thf(f17,plain,(
% 0.22/0.47 (if = (^[Y0 : $i]: ((^[Y1 : $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: (setunion @ (dsetconstr @ Y0 @ (^[Y4 : $i]: (((Y2 = Y4) & Y1) | ((~ Y1) & (Y3 = Y4))))))))))))))),
% 0.22/0.47 inference(fool_elimination,[],[f16])).
% 0.22/0.47 thf(f16,plain,(
% 0.22/0.47 ((^[X0 : $i, X1 : $o, X2 : $i, X3 : $i] : (setunion @ (dsetconstr @ X0 @ (^[X4 : $i] : (((X3 = X4) & ~X1) | (X1 & (X2 = X4))))))) = if)),
% 0.22/0.47 inference(rectify,[],[f3])).
% 0.22/0.47 thf(f3,axiom,(
% 0.22/0.47 ((^[X0 : $i, X1 : $o, X2 : $i, X3 : $i] : (setunion @ (dsetconstr @ X0 @ (^[X4 : $i] : (((X3 = X4) & ~X1) | (X1 & (X2 = X4))))))) = if)),
% 0.22/0.47 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',if)).
% 0.22/0.47 thf(f53,plain,(
% 0.22/0.47 ((if @ sK8 @ sK7 @ sK6 @ sK9) != sK6)),
% 0.22/0.47 inference(cnf_transformation,[],[f36])).
% 0.22/0.47 thf(f129,plain,(
% 0.22/0.47 (sK6 = (setunion @ (dsetconstr @ sK8 @ (= @ sK6)))) | ($true != (singleton @ (dsetconstr @ sK8 @ (= @ sK6))))),
% 0.22/0.47 inference(trivial_inequality_removal,[],[f128])).
% 0.22/0.47 thf(f128,plain,(
% 0.22/0.47 ($true != (singleton @ (dsetconstr @ sK8 @ (= @ sK6)))) | ($true != $true) | (sK6 = (setunion @ (dsetconstr @ sK8 @ (= @ sK6))))),
% 0.22/0.47 inference(superposition,[],[f91,f120])).
% 0.22/0.47 thf(f120,plain,(
% 0.22/0.47 ((in @ sK6 @ (dsetconstr @ sK8 @ (= @ sK6))) = $true)),
% 0.22/0.47 inference(trivial_inequality_removal,[],[f119])).
% 0.22/0.47 thf(f119,plain,(
% 0.22/0.47 ((in @ sK6 @ (dsetconstr @ sK8 @ (= @ sK6))) = $true) | ($true != $true)),
% 0.22/0.47 inference(superposition,[],[f113,f56])).
% 0.22/0.47 thf(f113,plain,(
% 0.22/0.47 ( ! [X0 : $i] : (((in @ X0 @ sK8) != $true) | ((in @ X0 @ (dsetconstr @ sK8 @ (= @ X0))) = $true)) )),
% 0.22/0.47 inference(trivial_inequality_removal,[],[f111])).
% 0.22/0.47 thf(f111,plain,(
% 0.22/0.47 ( ! [X0 : $i] : (($true != $true) | ((in @ X0 @ (dsetconstr @ sK8 @ (= @ X0))) = $true) | ((in @ X0 @ sK8) != $true)) )),
% 0.22/0.47 inference(superposition,[],[f89,f56])).
% 0.22/0.47 thf(f89,plain,(
% 0.22/0.47 ( ! [X6 : $i,X7 : $i,X5 : $i] : (($true != (in @ X7 @ X5)) | ((in @ X6 @ X5) != $true) | ($true = (in @ X6 @ (dsetconstr @ X5 @ (= @ X6))))) )),
% 0.22/0.47 inference(beta_eta_normalization,[],[f88])).
% 0.22/0.47 thf(f88,plain,(
% 0.22/0.47 ( ! [X6 : $i,X7 : $i,X5 : $i] : (((in @ X6 @ X5) != $true) | ($true = (in @ X6 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (X6 = Y0))))) | ($true != (in @ X7 @ X5))) )),
% 0.22/0.47 inference(boolean_simplification,[],[f87])).
% 0.22/0.47 thf(f87,plain,(
% 0.22/0.47 ( ! [X6 : $i,X7 : $i,X5 : $i] : (($true != (in @ X7 @ X5)) | ((in @ X6 @ (dsetconstr @ X5 @ (^[Y0 : $i]: ($true & (X6 = Y0))))) = $true) | ((in @ X6 @ X5) != $true)) )),
% 0.22/0.47 inference(boolean_simplification,[],[f86])).
% 0.22/0.47 thf(f86,plain,(
% 0.22/0.47 ( ! [X6 : $i,X7 : $i,X5 : $i] : (((in @ X6 @ X5) != $true) | ($true = (in @ X6 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (($true & (X6 = Y0)) | $false))))) | ($true != (in @ X7 @ X5))) )),
% 0.22/0.47 inference(boolean_simplification,[],[f85])).
% 0.22/0.47 thf(f85,plain,(
% 0.22/0.47 ( ! [X6 : $i,X7 : $i,X5 : $i] : (((in @ X6 @ X5) != $true) | ($true != (in @ X7 @ X5)) | ((in @ X6 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (($true & (X6 = Y0)) | ((X7 = Y0) & $false))))) = $true)) )),
% 0.22/0.47 inference(boolean_simplification,[],[f84])).
% 0.22/0.47 thf(f84,plain,(
% 0.22/0.47 ( ! [X6 : $i,X7 : $i,X5 : $i] : (((in @ X6 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (($true & (X6 = Y0)) | ((X7 = Y0) & (~ $true)))))) = $true) | ($true != (in @ X7 @ X5)) | ((in @ X6 @ X5) != $true)) )),
% 0.22/0.47 inference(trivial_inequality_removal,[],[f77])).
% 0.22/0.47 thf(f77,plain,(
% 0.22/0.47 ( ! [X6 : $i,X7 : $i,X5 : $i] : (((in @ X6 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (($true & (X6 = Y0)) | ((X7 = Y0) & (~ $true)))))) = $true) | ($true != (in @ X7 @ X5)) | ($true != $true) | ((in @ X6 @ X5) != $true)) )),
% 0.22/0.47 inference(equality_resolution,[],[f76])).
% 0.22/0.47 thf(f76,plain,(
% 0.22/0.47 ( ! [X6 : $i,X7 : $i,X4 : $o,X5 : $i] : (($true != (in @ X7 @ X5)) | ($true != X4) | ($true = (in @ X6 @ (dsetconstr @ X5 @ (^[Y0 : $i]: ((X4 & (X6 = Y0)) | ((X7 = Y0) & (~ X4))))))) | ((in @ X6 @ X5) != $true) | ($true != $true)) )),
% 0.22/0.47 inference(definition_unfolding,[],[f58,f51])).
% 0.22/0.47 thf(f51,plain,(
% 0.22/0.47 (iftrueProp1 = $true)),
% 0.22/0.47 inference(cnf_transformation,[],[f36])).
% 0.22/0.47 thf(f58,plain,(
% 0.22/0.47 ( ! [X6 : $i,X7 : $i,X4 : $o,X5 : $i] : (($true != (in @ X7 @ X5)) | ($true != X4) | ($true = (in @ X6 @ (dsetconstr @ X5 @ (^[Y0 : $i]: ((X4 & (X6 = Y0)) | ((X7 = Y0) & (~ X4))))))) | ((in @ X6 @ X5) != $true) | (iftrueProp1 != $true)) )),
% 0.22/0.47 inference(cnf_transformation,[],[f41])).
% 0.22/0.47 thf(f41,plain,(
% 0.22/0.47 ((iftrueProp1 = $true) | ((($true = (in @ sK13 @ sK11)) & (sK10 = $true) & ((in @ sK12 @ (dsetconstr @ sK11 @ (^[Y0 : $i]: ((sK10 & (sK12 = Y0)) | ((sK13 = Y0) & (~ sK10)))))) != $true)) & ($true = (in @ sK12 @ sK11)))) & (! [X4 : $o,X5,X6] : (! [X7] : (($true != (in @ X7 @ X5)) | ($true != X4) | ($true = (in @ X6 @ (dsetconstr @ X5 @ (^[Y0 : $i]: ((X4 & (X6 = Y0)) | ((X7 = Y0) & (~ X4)))))))) | ((in @ X6 @ X5) != $true)) | (iftrueProp1 != $true))),
% 0.22/0.47 inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11,sK12,sK13])],[f38,f40,f39])).
% 0.22/0.47 thf(f39,plain,(
% 0.22/0.47 ? [X0 : $o,X1,X2] : (? [X3] : (((in @ X3 @ X1) = $true) & ($true = X0) & ($true != (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: ((X0 & (X2 = Y0)) | ((X3 = Y0) & (~ X0)))))))) & ((in @ X2 @ X1) = $true)) => (? [X3] : (((in @ X3 @ sK11) = $true) & (sK10 = $true) & ($true != (in @ sK12 @ (dsetconstr @ sK11 @ (^[Y0 : $i]: ((sK10 & (sK12 = Y0)) | ((X3 = Y0) & (~ sK10)))))))) & ($true = (in @ sK12 @ sK11)))),
% 0.22/0.47 introduced(choice_axiom,[])).
% 0.22/0.47 thf(f40,plain,(
% 0.22/0.47 ? [X3] : (((in @ X3 @ sK11) = $true) & (sK10 = $true) & ($true != (in @ sK12 @ (dsetconstr @ sK11 @ (^[Y0 : $i]: ((sK10 & (sK12 = Y0)) | ((X3 = Y0) & (~ sK10)))))))) => (($true = (in @ sK13 @ sK11)) & (sK10 = $true) & ((in @ sK12 @ (dsetconstr @ sK11 @ (^[Y0 : $i]: ((sK10 & (sK12 = Y0)) | ((sK13 = Y0) & (~ sK10)))))) != $true))),
% 0.22/0.47 introduced(choice_axiom,[])).
% 0.22/0.47 thf(f38,plain,(
% 0.22/0.47 ((iftrueProp1 = $true) | ? [X0 : $o,X1,X2] : (? [X3] : (((in @ X3 @ X1) = $true) & ($true = X0) & ($true != (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: ((X0 & (X2 = Y0)) | ((X3 = Y0) & (~ X0)))))))) & ((in @ X2 @ X1) = $true))) & (! [X4 : $o,X5,X6] : (! [X7] : (($true != (in @ X7 @ X5)) | ($true != X4) | ($true = (in @ X6 @ (dsetconstr @ X5 @ (^[Y0 : $i]: ((X4 & (X6 = Y0)) | ((X7 = Y0) & (~ X4)))))))) | ((in @ X6 @ X5) != $true)) | (iftrueProp1 != $true))),
% 0.22/0.47 inference(rectify,[],[f37])).
% 0.22/0.47 thf(f37,plain,(
% 0.22/0.47 ((iftrueProp1 = $true) | ? [X0 : $o,X1,X2] : (? [X3] : (((in @ X3 @ X1) = $true) & ($true = X0) & ($true != (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: ((X0 & (X2 = Y0)) | ((X3 = Y0) & (~ X0)))))))) & ((in @ X2 @ X1) = $true))) & (! [X0 : $o,X1,X2] : (! [X3] : (((in @ X3 @ X1) != $true) | ($true != X0) | ($true = (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: ((X0 & (X2 = Y0)) | ((X3 = Y0) & (~ X0)))))))) | ((in @ X2 @ X1) != $true)) | (iftrueProp1 != $true))),
% 0.22/0.47 inference(nnf_transformation,[],[f22])).
% 0.22/0.47 thf(f22,plain,(
% 0.22/0.47 (iftrueProp1 = $true) <=> ! [X0 : $o,X1,X2] : (! [X3] : (((in @ X3 @ X1) != $true) | ($true != X0) | ($true = (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: ((X0 & (X2 = Y0)) | ((X3 = Y0) & (~ X0)))))))) | ((in @ X2 @ X1) != $true))),
% 0.22/0.47 inference(flattening,[],[f21])).
% 0.22/0.47 thf(f21,plain,(
% 0.22/0.47 (iftrueProp1 = $true) <=> ! [X0 : $o,X1,X2] : (! [X3] : ((($true = (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: ((X0 & (X2 = Y0)) | ((X3 = Y0) & (~ X0))))))) | ($true != X0)) | ((in @ X3 @ X1) != $true)) | ((in @ X2 @ X1) != $true))),
% 0.22/0.47 inference(ennf_transformation,[],[f9])).
% 0.22/0.47 thf(f9,plain,(
% 0.22/0.47 (iftrueProp1 = $true) <=> ! [X0 : $o,X1,X2] : (((in @ X2 @ X1) = $true) => ! [X3] : (((in @ X3 @ X1) = $true) => (($true = X0) => ($true = (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: ((X0 & (X2 = Y0)) | ((X3 = Y0) & (~ X0))))))))))),
% 0.22/0.47 inference(fool_elimination,[],[f8])).
% 0.22/0.47 thf(f8,plain,(
% 0.22/0.47 (! [X0 : $o,X1,X2] : ((in @ X2 @ X1) => ! [X3] : ((in @ X3 @ X1) => (X0 => (in @ X2 @ (dsetconstr @ X1 @ (^[X4 : $i] : ((~X0 & (X3 = X4)) | ((X2 = X4) & X0)))))))) = iftrueProp1)),
% 0.22/0.47 inference(rectify,[],[f1])).
% 0.22/0.47 thf(f1,axiom,(
% 0.22/0.47 (! [X1 : $o,X0,X2] : ((in @ X2 @ X0) => ! [X3] : ((in @ X3 @ X0) => (X1 => (in @ X2 @ (dsetconstr @ X0 @ (^[X4 : $i] : ((~X1 & (X3 = X4)) | ((X2 = X4) & X1)))))))) = iftrueProp1)),
% 0.22/0.47 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',iftrueProp1)).
% 0.22/0.47 thf(f91,plain,(
% 0.22/0.47 ( ! [X0 : $i,X1 : $i] : (((in @ X1 @ X0) != $true) | ($true != (singleton @ X0)) | ((setunion @ X0) = X1)) )),
% 0.22/0.47 inference(trivial_inequality_removal,[],[f67])).
% 0.22/0.47 thf(f67,plain,(
% 0.22/0.47 ( ! [X0 : $i,X1 : $i] : (((in @ X1 @ X0) != $true) | ($true != (singleton @ X0)) | ($true != $true) | ((setunion @ X0) = X1)) )),
% 0.22/0.47 inference(definition_unfolding,[],[f49,f57])).
% 0.22/0.47 thf(f57,plain,(
% 0.22/0.47 (theeq = $true)),
% 0.22/0.47 inference(cnf_transformation,[],[f36])).
% 0.22/0.47 thf(f49,plain,(
% 0.22/0.47 ( ! [X0 : $i,X1 : $i] : (($true != (singleton @ X0)) | ((setunion @ X0) = X1) | ((in @ X1 @ X0) != $true) | (theeq != $true)) )),
% 0.22/0.47 inference(cnf_transformation,[],[f33])).
% 0.22/0.47 thf(f33,plain,(
% 0.22/0.47 (! [X0] : (($true != (singleton @ X0)) | ! [X1] : (((setunion @ X0) = X1) | ((in @ X1 @ X0) != $true))) | (theeq != $true)) & ((theeq = $true) | (((singleton @ sK4) = $true) & (((setunion @ sK4) != sK5) & ($true = (in @ sK5 @ sK4)))))),
% 0.22/0.47 inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f30,f32,f31])).
% 0.22/0.47 thf(f31,plain,(
% 0.22/0.47 ? [X2] : (((singleton @ X2) = $true) & ? [X3] : (((setunion @ X2) != X3) & ((in @ X3 @ X2) = $true))) => (((singleton @ sK4) = $true) & ? [X3] : (((setunion @ sK4) != X3) & ($true = (in @ X3 @ sK4))))),
% 0.22/0.47 introduced(choice_axiom,[])).
% 0.22/0.47 thf(f32,plain,(
% 0.22/0.47 ? [X3] : (((setunion @ sK4) != X3) & ($true = (in @ X3 @ sK4))) => (((setunion @ sK4) != sK5) & ($true = (in @ sK5 @ sK4)))),
% 0.22/0.47 introduced(choice_axiom,[])).
% 0.22/0.47 thf(f30,plain,(
% 0.22/0.47 (! [X0] : (($true != (singleton @ X0)) | ! [X1] : (((setunion @ X0) = X1) | ((in @ X1 @ X0) != $true))) | (theeq != $true)) & ((theeq = $true) | ? [X2] : (((singleton @ X2) = $true) & ? [X3] : (((setunion @ X2) != X3) & ((in @ X3 @ X2) = $true))))),
% 0.22/0.47 inference(rectify,[],[f29])).
% 0.22/0.47 thf(f29,plain,(
% 0.22/0.47 (! [X0] : (($true != (singleton @ X0)) | ! [X1] : (((setunion @ X0) = X1) | ((in @ X1 @ X0) != $true))) | (theeq != $true)) & ((theeq = $true) | ? [X0] : (($true = (singleton @ X0)) & ? [X1] : (((setunion @ X0) != X1) & ((in @ X1 @ X0) = $true))))),
% 0.22/0.47 inference(nnf_transformation,[],[f20])).
% 0.22/0.47 thf(f20,plain,(
% 0.22/0.47 ! [X0] : (($true != (singleton @ X0)) | ! [X1] : (((setunion @ X0) = X1) | ((in @ X1 @ X0) != $true))) <=> (theeq = $true)),
% 0.22/0.47 inference(ennf_transformation,[],[f15])).
% 0.22/0.47 thf(f15,plain,(
% 0.22/0.47 ! [X0] : (($true = (singleton @ X0)) => ! [X1] : (((in @ X1 @ X0) = $true) => ((setunion @ X0) = X1))) <=> (theeq = $true)),
% 0.22/0.47 inference(fool_elimination,[],[f14])).
% 0.22/0.47 thf(f14,plain,(
% 0.22/0.47 (! [X0] : ((singleton @ X0) => ! [X1] : ((in @ X1 @ X0) => ((setunion @ X0) = X1))) = theeq)),
% 0.22/0.47 inference(rectify,[],[f4])).
% 0.22/0.47 thf(f4,axiom,(
% 0.22/0.47 (! [X5] : ((singleton @ X5) => ! [X2] : ((in @ X2 @ X5) => ((setunion @ X5) = X2))) = theeq)),
% 0.22/0.47 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theeq)).
% 0.22/0.47 thf(f338,plain,(
% 0.22/0.47 ( ! [X0 : $o] : ((sK6 != (sK19 @ X0)) | ($false = X0)) )),
% 0.22/0.47 inference(duplicate_literal_removal,[],[f337])).
% 0.22/0.47 thf(f337,plain,(
% 0.22/0.47 ( ! [X0 : $o] : ((sK6 != (sK19 @ X0)) | (sK6 != (sK19 @ X0)) | ($false = X0)) )),
% 0.22/0.47 inference(equality_proxy_clausification,[],[f336])).
% 0.22/0.47 thf(f336,plain,(
% 0.22/0.47 ( ! [X0 : $o] : ((sK6 != (sK19 @ X0)) | ((sK6 = (sK19 @ X0)) = $false) | ($false = X0)) )),
% 0.22/0.47 inference(binary_proxy_clausification,[],[f335])).
% 0.22/0.47 thf(f335,plain,(
% 0.22/0.47 ( ! [X0 : $o] : ((sK6 != (sK19 @ X0)) | ((X0 & (sK6 = (sK19 @ X0))) = $false)) )),
% 0.22/0.47 inference(binary_proxy_clausification,[],[f333])).
% 0.22/0.47 thf(f333,plain,(
% 0.22/0.47 ( ! [X0 : $o] : ((((X0 & (sK6 = (sK19 @ X0))) | ((sK9 = (sK19 @ X0)) & (~ X0))) = $false) | (sK6 != (sK19 @ X0))) )),
% 0.22/0.47 inference(equality_proxy_clausification,[],[f332])).
% 0.22/0.47 thf(f332,plain,(
% 0.22/0.47 ( ! [X0 : $o] : (((sK6 = (sK19 @ X0)) = $false) | (((X0 & (sK6 = (sK19 @ X0))) | ((sK9 = (sK19 @ X0)) & (~ X0))) = $false)) )),
% 0.22/0.47 inference(binary_proxy_clausification,[],[f330])).
% 0.22/0.47 thf(f374,plain,(
% 0.22/0.47 ((singleton @ (dsetconstr @ sK8 @ (= @ sK6))) != $false)),
% 0.22/0.47 inference(backward_demodulation,[],[f132,f358])).
% 0.22/0.47 % SZS output end Proof for theBenchmark
% 0.22/0.47 % (18691)------------------------------
% 0.22/0.47 % (18691)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.47 % (18691)Termination reason: Refutation
% 0.22/0.47
% 0.22/0.47 % (18691)Memory used [KB]: 5756
% 0.22/0.47 % (18691)Time elapsed: 0.031 s
% 0.22/0.47 % (18691)Instructions burned: 43 (million)
% 0.22/0.47 % (18691)------------------------------
% 0.22/0.47 % (18691)------------------------------
% 0.22/0.47 % (18667)Success in time 0.111 s
% 0.22/0.47 % Vampire---4.8 exiting
%------------------------------------------------------------------------------