TSTP Solution File: SET062^7 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET062^7 : TPTP v8.2.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n010.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:08:24 EDT 2024
% Result : Theorem 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SET062^7 : TPTP v8.2.0. Released v5.5.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 12:29:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_EQU_NAR problem
% 0.13/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.37 % (14192)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.13/0.37 % (14194)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.37 % (14193)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.13/0.37 % (14188)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.13/0.37 % (14192)Instruction limit reached!
% 0.13/0.37 % (14192)------------------------------
% 0.13/0.37 % (14192)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (14192)Termination reason: Unknown
% 0.13/0.37 % (14192)Termination phase: shuffling
% 0.13/0.37
% 0.13/0.37 % (14192)Memory used [KB]: 1023
% 0.13/0.37 % (14192)Time elapsed: 0.003 s
% 0.13/0.37 % (14192)Instructions burned: 3 (million)
% 0.13/0.37 % (14192)------------------------------
% 0.13/0.37 % (14192)------------------------------
% 0.13/0.37 % (14189)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.13/0.37 % (14195)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.13/0.37 % (14190)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.13/0.37 % (14189)Instruction limit reached!
% 0.13/0.37 % (14189)------------------------------
% 0.13/0.37 % (14189)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (14189)Termination reason: Unknown
% 0.13/0.37 % (14189)Termination phase: shuffling
% 0.13/0.37
% 0.13/0.37 % (14189)Memory used [KB]: 1151
% 0.13/0.37 % (14189)Time elapsed: 0.004 s
% 0.13/0.37 % (14189)Instructions burned: 4 (million)
% 0.13/0.37 % (14189)------------------------------
% 0.13/0.37 % (14189)------------------------------
% 0.13/0.38 % (14195)Instruction limit reached!
% 0.13/0.38 % (14195)------------------------------
% 0.13/0.38 % (14195)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (14195)Termination reason: Unknown
% 0.13/0.38 % (14195)Termination phase: shuffling
% 0.13/0.38
% 0.13/0.38 % (14195)Memory used [KB]: 1023
% 0.13/0.38 % (14195)Time elapsed: 0.004 s
% 0.13/0.38 % (14195)Instructions burned: 3 (million)
% 0.13/0.38 % (14195)------------------------------
% 0.13/0.38 % (14195)------------------------------
% 0.13/0.38 % (14194)Instruction limit reached!
% 0.13/0.38 % (14194)------------------------------
% 0.13/0.38 % (14194)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (14194)Termination reason: Unknown
% 0.13/0.38 % (14194)Termination phase: Function definition elimination
% 0.13/0.38
% 0.13/0.38 % (14194)Memory used [KB]: 1279
% 0.13/0.38 % (14194)Time elapsed: 0.010 s
% 0.13/0.38 % (14194)Instructions burned: 20 (million)
% 0.13/0.38 % (14194)------------------------------
% 0.13/0.38 % (14194)------------------------------
% 0.13/0.38 % (14193)Refutation not found, incomplete strategy
% 0.13/0.38 % (14193)------------------------------
% 0.13/0.38 % (14193)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (14193)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 % (14193)Memory used [KB]: 5756
% 0.13/0.38 % (14193)Time elapsed: 0.011 s
% 0.13/0.38 % (14193)Instructions burned: 19 (million)
% 0.13/0.38 % (14193)------------------------------
% 0.13/0.38 % (14193)------------------------------
% 0.20/0.39 % (14190)Instruction limit reached!
% 0.20/0.39 % (14190)------------------------------
% 0.20/0.39 % (14190)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39 % (14190)Termination reason: Unknown
% 0.20/0.39 % (14190)Termination phase: Property scanning
% 0.20/0.39 % (14191)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.39
% 0.20/0.39 % (14190)Memory used [KB]: 1279
% 0.20/0.39 % (14190)Time elapsed: 0.014 s
% 0.20/0.39 % (14190)Instructions burned: 28 (million)
% 0.20/0.39 % (14190)------------------------------
% 0.20/0.39 % (14190)------------------------------
% 0.20/0.39 % (14196)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.20/0.39 % (14191)Instruction limit reached!
% 0.20/0.39 % (14191)------------------------------
% 0.20/0.39 % (14191)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39 % (14191)Termination reason: Unknown
% 0.20/0.39 % (14191)Termination phase: shuffling
% 0.20/0.39
% 0.20/0.39 % (14191)Memory used [KB]: 1023
% 0.20/0.39 % (14191)Time elapsed: 0.003 s
% 0.20/0.39 % (14191)Instructions burned: 2 (million)
% 0.20/0.39 % (14191)------------------------------
% 0.20/0.39 % (14191)------------------------------
% 0.20/0.39 % (14197)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.20/0.39 % (14198)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.20/0.39 % (14198)Instruction limit reached!
% 0.20/0.39 % (14198)------------------------------
% 0.20/0.39 % (14198)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39 % (14198)Termination reason: Unknown
% 0.20/0.39 % (14198)Termination phase: shuffling
% 0.20/0.39
% 0.20/0.39 % (14198)Memory used [KB]: 1151
% 0.20/0.39 % (14198)Time elapsed: 0.004 s
% 0.20/0.39 % (14198)Instructions burned: 4 (million)
% 0.20/0.39 % (14198)------------------------------
% 0.20/0.39 % (14198)------------------------------
% 0.20/0.40 % (14200)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.20/0.40 % (14199)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.20/0.40 % (14197)Instruction limit reached!
% 0.20/0.40 % (14197)------------------------------
% 0.20/0.40 % (14197)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40 % (14197)Termination reason: Unknown
% 0.20/0.40 % (14197)Termination phase: Property scanning
% 0.20/0.40
% 0.20/0.40 % (14197)Memory used [KB]: 1279
% 0.20/0.40 % (14197)Time elapsed: 0.010 s
% 0.20/0.40 % (14197)Instructions burned: 16 (million)
% 0.20/0.40 % (14197)------------------------------
% 0.20/0.40 % (14197)------------------------------
% 0.20/0.40 % (14200)Instruction limit reached!
% 0.20/0.40 % (14200)------------------------------
% 0.20/0.40 % (14200)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40 % (14200)Termination reason: Unknown
% 0.20/0.40 % (14200)Termination phase: shuffling
% 0.20/0.40
% 0.20/0.40 % (14200)Memory used [KB]: 1151
% 0.20/0.40 % (14200)Time elapsed: 0.005 s
% 0.20/0.40 % (14200)Instructions burned: 7 (million)
% 0.20/0.40 % (14200)------------------------------
% 0.20/0.40 % (14200)------------------------------
% 0.20/0.40 % (14202)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.20/0.40 % (14196)Instruction limit reached!
% 0.20/0.40 % (14196)------------------------------
% 0.20/0.40 % (14196)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40 % (14196)Termination reason: Unknown
% 0.20/0.40 % (14196)Termination phase: Saturation
% 0.20/0.40
% 0.20/0.40 % (14196)Memory used [KB]: 5884
% 0.20/0.40 % (14196)Time elapsed: 0.017 s
% 0.20/0.40 % (14196)Instructions burned: 39 (million)
% 0.20/0.40 % (14196)------------------------------
% 0.20/0.40 % (14196)------------------------------
% 0.20/0.40 % (14202)Instruction limit reached!
% 0.20/0.40 % (14202)------------------------------
% 0.20/0.40 % (14202)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40 % (14202)Termination reason: Unknown
% 0.20/0.40 % (14202)Termination phase: shuffling
% 0.20/0.40
% 0.20/0.40 % (14202)Memory used [KB]: 1151
% 0.20/0.40 % (14202)Time elapsed: 0.004 s
% 0.20/0.40 % (14202)Instructions burned: 4 (million)
% 0.20/0.40 % (14202)------------------------------
% 0.20/0.40 % (14202)------------------------------
% 0.20/0.40 % (14201)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.20/0.41 % (14203)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.20/0.41 % (14203)Instruction limit reached!
% 0.20/0.41 % (14203)------------------------------
% 0.20/0.41 % (14203)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.41 % (14203)Termination reason: Unknown
% 0.20/0.41 % (14203)Termination phase: shuffling
% 0.20/0.41
% 0.20/0.41 % (14203)Memory used [KB]: 1151
% 0.20/0.41 % (14203)Time elapsed: 0.004 s
% 0.20/0.41 % (14203)Instructions burned: 4 (million)
% 0.20/0.41 % (14203)------------------------------
% 0.20/0.41 % (14203)------------------------------
% 0.20/0.41 % (14201)Instruction limit reached!
% 0.20/0.41 % (14201)------------------------------
% 0.20/0.41 % (14201)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.41 % (14204)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.20/0.41 % (14201)Termination reason: Unknown
% 0.20/0.41 % (14201)Termination phase: Property scanning
% 0.20/0.41
% 0.20/0.41 % (14201)Memory used [KB]: 1279
% 0.20/0.41 % (14201)Time elapsed: 0.009 s
% 0.20/0.41 % (14201)Instructions burned: 18 (million)
% 0.20/0.41 % (14201)------------------------------
% 0.20/0.41 % (14201)------------------------------
% 0.20/0.42 % (14205)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.20/0.42 % (14204)Instruction limit reached!
% 0.20/0.42 % (14204)------------------------------
% 0.20/0.42 % (14204)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.42 % (14204)Termination reason: Unknown
% 0.20/0.42 % (14204)Termination phase: shuffling
% 0.20/0.42
% 0.20/0.42 % (14204)Memory used [KB]: 1151
% 0.20/0.42 % (14204)Time elapsed: 0.006 s
% 0.20/0.42 % (14204)Instructions burned: 8 (million)
% 0.20/0.42 % (14204)------------------------------
% 0.20/0.42 % (14204)------------------------------
% 0.20/0.42 % (14205)Instruction limit reached!
% 0.20/0.42 % (14205)------------------------------
% 0.20/0.42 % (14205)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.42 % (14205)Termination reason: Unknown
% 0.20/0.42 % (14205)Termination phase: shuffling
% 0.20/0.42
% 0.20/0.42 % (14205)Memory used [KB]: 1151
% 0.20/0.42 % (14205)Time elapsed: 0.003 s
% 0.20/0.42 % (14205)Instructions burned: 4 (million)
% 0.20/0.42 % (14205)------------------------------
% 0.20/0.42 % (14205)------------------------------
% 0.20/0.42 % (14206)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.20/0.42 % (14206)Instruction limit reached!
% 0.20/0.42 % (14206)------------------------------
% 0.20/0.42 % (14206)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.42 % (14206)Termination reason: Unknown
% 0.20/0.42 % (14206)Termination phase: shuffling
% 0.20/0.42
% 0.20/0.42 % (14206)Memory used [KB]: 1151
% 0.20/0.42 % (14206)Time elapsed: 0.004 s
% 0.20/0.42 % (14206)Instructions burned: 4 (million)
% 0.20/0.42 % (14206)------------------------------
% 0.20/0.42 % (14206)------------------------------
% 0.20/0.42 % (14208)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.20/0.42 % (14207)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.20/0.43 % (14209)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.20/0.43 % (14209)Instruction limit reached!
% 0.20/0.43 % (14209)------------------------------
% 0.20/0.43 % (14209)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.43 % (14209)Termination reason: Unknown
% 0.20/0.43 % (14209)Termination phase: shuffling
% 0.20/0.43
% 0.20/0.43 % (14209)Memory used [KB]: 1151
% 0.20/0.43 % (14209)Time elapsed: 0.004 s
% 0.20/0.43 % (14209)Instructions burned: 6 (million)
% 0.20/0.43 % (14209)------------------------------
% 0.20/0.43 % (14209)------------------------------
% 0.20/0.43 % (14210)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.20/0.43 % (14207)Instruction limit reached!
% 0.20/0.43 % (14207)------------------------------
% 0.20/0.43 % (14207)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.43 % (14207)Termination reason: Unknown
% 0.20/0.43 % (14207)Termination phase: Property scanning
% 0.20/0.43
% 0.20/0.43 % (14207)Memory used [KB]: 1279
% 0.20/0.43 % (14207)Time elapsed: 0.009 s
% 0.20/0.43 % (14207)Instructions burned: 18 (million)
% 0.20/0.43 % (14207)------------------------------
% 0.20/0.43 % (14207)------------------------------
% 0.20/0.43 % (14211)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.20/0.43 % (14212)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2999ds/5Mi)
% 0.20/0.44 % (14212)Instruction limit reached!
% 0.20/0.44 % (14212)------------------------------
% 0.20/0.44 % (14212)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.44 % (14212)Termination reason: Unknown
% 0.20/0.44 % (14212)Termination phase: shuffling
% 0.20/0.44
% 0.20/0.44 % (14212)Memory used [KB]: 1151
% 0.20/0.44 % (14212)Time elapsed: 0.005 s
% 0.20/0.44 % (14212)Instructions burned: 6 (million)
% 0.20/0.44 % (14212)------------------------------
% 0.20/0.44 % (14212)------------------------------
% 0.20/0.44 % (14211)Instruction limit reached!
% 0.20/0.44 % (14211)------------------------------
% 0.20/0.44 % (14211)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.44 % (14211)Termination reason: Unknown
% 0.20/0.44 % (14211)Termination phase: Function definition elimination
% 0.20/0.44
% 0.20/0.44 % (14211)Memory used [KB]: 1279
% 0.20/0.44 % (14211)Time elapsed: 0.011 s
% 0.20/0.44 % (14211)Instructions burned: 23 (million)
% 0.20/0.44 % (14211)------------------------------
% 0.20/0.44 % (14211)------------------------------
% 0.20/0.44 % (14210)Refutation not found, incomplete strategy
% 0.20/0.44 % (14210)------------------------------
% 0.20/0.44 % (14210)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.44 % (14210)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % (14210)Memory used [KB]: 5756
% 0.20/0.44 % (14210)Time elapsed: 0.014 s
% 0.20/0.44 % (14210)Instructions burned: 24 (million)
% 0.20/0.44 % (14210)------------------------------
% 0.20/0.44 % (14210)------------------------------
% 0.20/0.44 % (14213)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.20/0.45 % (14214)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.20/0.45 % (14213)Instruction limit reached!
% 0.20/0.45 % (14213)------------------------------
% 0.20/0.45 % (14213)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.45 % (14213)Termination reason: Unknown
% 0.20/0.45 % (14213)Termination phase: shuffling
% 0.20/0.45
% 0.20/0.45 % (14213)Memory used [KB]: 1151
% 0.20/0.45 % (14213)Time elapsed: 0.004 s
% 0.20/0.45 % (14213)Instructions burned: 6 (million)
% 0.20/0.45 % (14213)------------------------------
% 0.20/0.45 % (14213)------------------------------
% 0.20/0.45 % (14215)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.20/0.45 % (14208)Refutation not found, incomplete strategy
% 0.20/0.45 % (14208)------------------------------
% 0.20/0.45 % (14208)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.45 % (14208)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 % (14208)Memory used [KB]: 6012
% 0.20/0.45 % (14208)Time elapsed: 0.032 s
% 0.20/0.45 % (14208)Instructions burned: 48 (million)
% 0.20/0.45 % (14208)------------------------------
% 0.20/0.45 % (14208)------------------------------
% 0.20/0.46 % (14216)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.20/0.46 % (14218)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on theBenchmark for (2999ds/17Mi)
% 0.20/0.46 % (14217)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on theBenchmark for (2999ds/879Mi)
% 0.20/0.46 % (14188)First to succeed.
% 0.20/0.46 % (14216)Instruction limit reached!
% 0.20/0.46 % (14216)------------------------------
% 0.20/0.46 % (14216)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.46 % (14218)Instruction limit reached!
% 0.20/0.46 % (14218)------------------------------
% 0.20/0.46 % (14218)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.46 % (14218)Termination reason: Unknown
% 0.20/0.46 % (14218)Termination phase: Property scanning
% 0.20/0.46
% 0.20/0.46 % (14218)Memory used [KB]: 1279
% 0.20/0.46 % (14218)Time elapsed: 0.006 s
% 0.20/0.46 % (14218)Instructions burned: 19 (million)
% 0.20/0.46 % (14218)------------------------------
% 0.20/0.46 % (14218)------------------------------
% 0.20/0.46 % (14216)Termination reason: Unknown
% 0.20/0.46 % (14216)Termination phase: Saturation
% 0.20/0.46
% 0.20/0.46 % (14216)Memory used [KB]: 5756
% 0.20/0.46 % (14216)Time elapsed: 0.007 s
% 0.20/0.46 % (14216)Instructions burned: 19 (million)
% 0.20/0.46 % (14216)------------------------------
% 0.20/0.46 % (14216)------------------------------
% 0.20/0.46 % (14188)Refutation found. Thanks to Tanya!
% 0.20/0.46 % SZS status Theorem for theBenchmark
% 0.20/0.46 % SZS output start Proof for theBenchmark
% 0.20/0.46 thf(type_def_5, type, mu: $tType).
% 0.20/0.46 thf(func_def_0, type, mu: $tType).
% 0.20/0.46 thf(func_def_1, type, qmltpeq: mu > mu > $i > $o).
% 0.20/0.46 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.46 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.20/0.46 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.46 thf(func_def_6, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.20/0.46 thf(func_def_7, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.20/0.46 thf(func_def_8, type, mtrue: $i > $o).
% 0.20/0.46 thf(func_def_9, type, mfalse: $i > $o).
% 0.20/0.46 thf(func_def_10, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.46 thf(func_def_11, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.46 thf(func_def_12, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.46 thf(func_def_13, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.46 thf(func_def_14, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.46 thf(func_def_15, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.20/0.46 thf(func_def_16, type, exists_in_world: mu > $i > $o).
% 0.20/0.46 thf(func_def_17, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.20/0.46 thf(func_def_18, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.20/0.46 thf(func_def_19, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.20/0.46 thf(func_def_20, type, mreflexive: ($i > $i > $o) > $o).
% 0.20/0.46 thf(func_def_21, type, msymmetric: ($i > $i > $o) > $o).
% 0.20/0.46 thf(func_def_22, type, mserial: ($i > $i > $o) > $o).
% 0.20/0.46 thf(func_def_23, type, mtransitive: ($i > $i > $o) > $o).
% 0.20/0.46 thf(func_def_24, type, meuclidean: ($i > $i > $o) > $o).
% 0.20/0.46 thf(func_def_25, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.20/0.46 thf(func_def_26, type, mfunctional: ($i > $i > $o) > $o).
% 0.20/0.46 thf(func_def_27, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.20/0.46 thf(func_def_28, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.20/0.46 thf(func_def_29, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.20/0.46 thf(func_def_30, type, mvalid: ($i > $o) > $o).
% 0.20/0.46 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.20/0.46 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.20/0.46 thf(func_def_33, type, minvalid: ($i > $o) > $o).
% 0.20/0.46 thf(func_def_34, type, rel_s4: $i > $i > $o).
% 0.20/0.46 thf(func_def_35, type, mbox_s4: ($i > $o) > $i > $o).
% 0.20/0.46 thf(func_def_36, type, mdia_s4: ($i > $o) > $i > $o).
% 0.20/0.46 thf(func_def_37, type, equal_set: mu > mu > $i > $o).
% 0.20/0.46 thf(func_def_38, type, member: mu > mu > $i > $o).
% 0.20/0.46 thf(func_def_39, type, subset: mu > mu > $i > $o).
% 0.20/0.46 thf(func_def_40, type, power_set: mu > mu).
% 0.20/0.46 thf(func_def_41, type, intersection: mu > mu > mu).
% 0.20/0.46 thf(func_def_42, type, union: mu > mu > mu).
% 0.20/0.46 thf(func_def_43, type, difference: mu > mu > mu).
% 0.20/0.46 thf(func_def_44, type, singleton: mu > mu).
% 0.20/0.46 thf(func_def_45, type, unordered_pair: mu > mu > mu).
% 0.20/0.46 thf(func_def_46, type, sum: mu > mu).
% 0.20/0.46 thf(func_def_47, type, product: mu > mu).
% 0.20/0.46 thf(func_def_48, type, empty_set: mu).
% 0.20/0.46 thf(func_def_64, type, sK0: $i > mu).
% 0.20/0.46 thf(func_def_66, type, sK2: mu > $i > mu > mu).
% 0.20/0.46 thf(func_def_68, type, sK4: mu).
% 0.20/0.46 thf(func_def_69, type, sK5: mu > $i > mu > mu).
% 0.20/0.46 thf(func_def_71, type, sK6: mu > $i > mu > mu).
% 0.20/0.46 thf(f1051,plain,(
% 0.20/0.46 $false),
% 0.20/0.46 inference(avatar_sat_refutation,[],[f972,f982,f1050])).
% 0.20/0.46 thf(f1050,plain,(
% 0.20/0.46 spl1_2 | spl1_3),
% 0.20/0.46 inference(avatar_contradiction_clause,[],[f1049])).
% 0.20/0.46 thf(f1049,plain,(
% 0.20/0.46 $false | (spl1_2 | spl1_3)),
% 0.20/0.46 inference(subsumption_resolution,[],[f1048,f955])).
% 0.20/0.46 thf(f955,plain,(
% 0.20/0.46 ((exists_in_world @ sK4 @ sK3) != $false) | spl1_2),
% 0.20/0.46 inference(avatar_component_clause,[],[f954])).
% 0.20/0.46 thf(f954,plain,(
% 0.20/0.46 spl1_2 <=> ((exists_in_world @ sK4 @ sK3) = $false)),
% 0.20/0.46 introduced(avatar_definition,[new_symbols(naming,[spl1_2])])).
% 0.20/0.46 thf(f1048,plain,(
% 0.20/0.46 ((exists_in_world @ sK4 @ sK3) = $false) | spl1_3),
% 0.20/0.46 inference(subsumption_resolution,[],[f1043,f959])).
% 0.20/0.46 thf(f959,plain,(
% 0.20/0.46 ($false != (exists_in_world @ empty_set @ sK3)) | spl1_3),
% 0.20/0.46 inference(avatar_component_clause,[],[f958])).
% 0.20/0.46 thf(f958,plain,(
% 0.20/0.46 spl1_3 <=> ($false = (exists_in_world @ empty_set @ sK3))),
% 0.20/0.46 introduced(avatar_definition,[new_symbols(naming,[spl1_3])])).
% 0.20/0.46 thf(f1043,plain,(
% 0.20/0.46 ($false = (exists_in_world @ empty_set @ sK3)) | ((exists_in_world @ sK4 @ sK3) = $false)),
% 0.20/0.46 inference(trivial_inequality_removal,[],[f1042])).
% 0.20/0.47 thf(f1042,plain,(
% 0.20/0.47 ($false = (exists_in_world @ empty_set @ sK3)) | ($false = $true) | ((exists_in_world @ sK4 @ sK3) = $false)),
% 0.20/0.47 inference(superposition,[],[f643,f1040])).
% 0.20/0.47 thf(f1040,plain,(
% 0.20/0.47 ( ! [X0 : mu,X1 : $i] : (($true = (subset @ empty_set @ X0 @ X1)) | ((exists_in_world @ empty_set @ X1) = $false) | ($false = (exists_in_world @ X0 @ X1))) )),
% 0.20/0.47 inference(trivial_inequality_removal,[],[f1039])).
% 0.20/0.47 thf(f1039,plain,(
% 0.20/0.47 ( ! [X0 : mu,X1 : $i] : (($true = (subset @ empty_set @ X0 @ X1)) | ($false = (exists_in_world @ X0 @ X1)) | ($false = $true) | ((exists_in_world @ empty_set @ X1) = $false)) )),
% 0.20/0.47 inference(duplicate_literal_removal,[],[f1033])).
% 0.20/0.47 thf(f1033,plain,(
% 0.20/0.47 ( ! [X0 : mu,X1 : $i] : (((exists_in_world @ empty_set @ X1) = $false) | ($false = (exists_in_world @ X0 @ X1)) | ($false = $true) | ($true = (subset @ empty_set @ X0 @ X1)) | ((exists_in_world @ empty_set @ X1) = $false) | ($false = (exists_in_world @ X0 @ X1)) | ($true = (subset @ empty_set @ X0 @ X1))) )),
% 0.20/0.47 inference(superposition,[],[f394,f1023])).
% 0.20/0.47 thf(f1023,plain,(
% 0.20/0.47 ( ! [X0 : mu,X1 : $i] : (($false = (exists_in_world @ (sK2 @ X0 @ X1 @ empty_set) @ X1)) | ($false = (exists_in_world @ X0 @ X1)) | ((exists_in_world @ empty_set @ X1) = $false) | ($true = (subset @ empty_set @ X0 @ X1))) )),
% 0.20/0.47 inference(trivial_inequality_removal,[],[f1014])).
% 0.20/0.47 thf(f1014,plain,(
% 0.20/0.47 ( ! [X0 : mu,X1 : $i] : (($false = (exists_in_world @ X0 @ X1)) | ($false = $true) | ($false = (exists_in_world @ (sK2 @ X0 @ X1 @ empty_set) @ X1)) | ($true = (subset @ empty_set @ X0 @ X1)) | ((exists_in_world @ empty_set @ X1) = $false)) )),
% 0.20/0.47 inference(superposition,[],[f397,f617])).
% 0.20/0.47 thf(f617,plain,(
% 0.20/0.47 ( ! [X2 : mu,X1 : $i] : (((member @ X2 @ empty_set @ X1) = $false) | ((exists_in_world @ X2 @ X1) = $false)) )),
% 0.20/0.47 inference(not_proxy_clausification,[],[f616])).
% 0.20/0.47 thf(f616,plain,(
% 0.20/0.47 ( ! [X2 : mu,X1 : $i] : (($true = (~ (member @ X2 @ empty_set @ X1))) | ((exists_in_world @ X2 @ X1) = $false)) )),
% 0.20/0.47 inference(binary_proxy_clausification,[],[f615])).
% 0.20/0.47 thf(f615,plain,(
% 0.20/0.47 ( ! [X2 : mu,X1 : $i] : (($true = ((exists_in_world @ X2 @ X1) => (~ (member @ X2 @ empty_set @ X1))))) )),
% 0.20/0.47 inference(beta_eta_normalization,[],[f614])).
% 0.20/0.47 thf(f614,plain,(
% 0.20/0.47 ( ! [X2 : mu,X1 : $i] : ((((^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (~ (member @ Y0 @ empty_set @ X1)))) @ X2) = $true)) )),
% 0.20/0.47 inference(pi_clausification,[],[f613])).
% 0.20/0.47 thf(f613,plain,(
% 0.20/0.47 ( ! [X1 : $i] : (((!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (~ (member @ Y0 @ empty_set @ X1))))) = $true)) )),
% 0.20/0.47 inference(beta_eta_normalization,[],[f612])).
% 0.20/0.47 thf(f612,plain,(
% 0.20/0.47 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (~ (member @ Y1 @ empty_set @ Y0)))))) @ X1) = $true)) )),
% 0.20/0.47 inference(pi_clausification,[],[f611])).
% 0.20/0.47 thf(f611,plain,(
% 0.20/0.47 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (~ (member @ Y1 @ empty_set @ Y0))))))))),
% 0.20/0.47 inference(beta_eta_normalization,[],[f357])).
% 0.20/0.47 thf(f357,plain,(
% 0.20/0.47 (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (Y0 @ Y2 @ Y1))))))) @ (^[Y0 : mu]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ (member @ Y0 @ empty_set))))) = $true)),
% 0.20/0.47 inference(definition_unfolding,[],[f307,f278,f274,f303])).
% 0.20/0.47 thf(f303,plain,(
% 0.20/0.47 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.20/0.47 inference(cnf_transformation,[],[f92])).
% 0.20/0.47 thf(f92,plain,(
% 0.20/0.47 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.20/0.47 inference(fool_elimination,[],[f91])).
% 0.20/0.47 thf(f91,plain,(
% 0.20/0.47 (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.20/0.47 inference(rectify,[],[f2])).
% 0.20/0.47 thf(f2,axiom,(
% 0.20/0.47 (mnot = (^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))))),
% 0.20/0.47 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mnot)).
% 0.20/0.47 thf(f274,plain,(
% 0.20/0.47 (mforall_ind = (^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (Y0 @ Y2 @ Y1))))))))),
% 0.20/0.47 inference(cnf_transformation,[],[f229])).
% 0.20/0.47 thf(f229,plain,(
% 0.20/0.47 (mforall_ind = (^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (Y0 @ Y2 @ Y1))))))))),
% 0.20/0.47 inference(fool_elimination,[],[f228])).
% 0.20/0.47 thf(f228,plain,(
% 0.20/0.47 ((^[X0 : mu > $i > $o, X1 : $i] : (! [X2 : mu] : ((exists_in_world @ X2 @ X1) => (X0 @ X2 @ X1)))) = mforall_ind)),
% 0.20/0.47 inference(rectify,[],[f15])).
% 0.20/0.47 thf(f15,axiom,(
% 0.20/0.47 ((^[X3 : mu > $i > $o, X2 : $i] : (! [X0 : mu] : ((exists_in_world @ X0 @ X2) => (X3 @ X0 @ X2)))) = mforall_ind)),
% 0.20/0.47 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mforall_ind)).
% 0.20/0.47 thf(f278,plain,(
% 0.20/0.47 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.20/0.47 inference(cnf_transformation,[],[f213])).
% 0.20/0.47 thf(f213,plain,(
% 0.20/0.47 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.20/0.47 inference(fool_elimination,[],[f212])).
% 0.20/0.47 thf(f212,plain,(
% 0.20/0.47 (mvalid = (^[X0 : $i > $o] : (! [X1] : (X0 @ X1))))),
% 0.20/0.47 inference(rectify,[],[f28])).
% 0.20/0.47 thf(f28,axiom,(
% 0.20/0.47 (mvalid = (^[X3 : $i > $o] : (! [X2] : (X3 @ X2))))),
% 0.20/0.47 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mvalid)).
% 0.20/0.47 thf(f307,plain,(
% 0.20/0.47 ($true = (mvalid @ (mforall_ind @ (^[Y0 : mu]: (mnot @ (member @ Y0 @ empty_set))))))),
% 0.20/0.47 inference(cnf_transformation,[],[f149])).
% 0.20/0.47 thf(f149,plain,(
% 0.20/0.47 ($true = (mvalid @ (mforall_ind @ (^[Y0 : mu]: (mnot @ (member @ Y0 @ empty_set))))))),
% 0.20/0.47 inference(fool_elimination,[],[f148])).
% 0.20/0.47 thf(f148,plain,(
% 0.20/0.47 (mvalid @ (mforall_ind @ (^[X0 : mu] : (mnot @ (member @ X0 @ empty_set)))))),
% 0.20/0.47 inference(rectify,[],[f72])).
% 0.20/0.47 thf(f72,axiom,(
% 0.20/0.47 (mvalid @ (mforall_ind @ (^[X0 : mu] : (mnot @ (member @ X0 @ empty_set)))))),
% 0.20/0.47 file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set)).
% 0.20/0.47 thf(f397,plain,(
% 0.20/0.47 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((member @ (sK2 @ X3 @ X1 @ X2) @ X2 @ X1) = $true) | ((exists_in_world @ X2 @ X1) = $false) | ((subset @ X2 @ X3 @ X1) = $true) | ($false = (exists_in_world @ X3 @ X1))) )),
% 0.20/0.47 inference(not_proxy_clausification,[],[f395])).
% 0.20/0.47 thf(f395,plain,(
% 0.20/0.47 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((exists_in_world @ X2 @ X1) = $false) | ($false = (~ (member @ (sK2 @ X3 @ X1 @ X2) @ X2 @ X1))) | ($false = (exists_in_world @ X3 @ X1)) | ((subset @ X2 @ X3 @ X1) = $true)) )),
% 0.20/0.47 inference(binary_proxy_clausification,[],[f393])).
% 0.20/0.47 thf(f393,plain,(
% 0.20/0.47 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((subset @ X2 @ X3 @ X1) = $true) | ($false = (exists_in_world @ X3 @ X1)) | ((exists_in_world @ X2 @ X1) = $false) | (((member @ (sK2 @ X3 @ X1 @ X2) @ X3 @ X1) | (~ (member @ (sK2 @ X3 @ X1 @ X2) @ X2 @ X1))) = $false)) )),
% 0.20/0.47 inference(binary_proxy_clausification,[],[f392])).
% 0.20/0.47 thf(f392,plain,(
% 0.20/0.47 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((exists_in_world @ X2 @ X1) = $false) | ($false = ((exists_in_world @ (sK2 @ X3 @ X1 @ X2) @ X1) => ((member @ (sK2 @ X3 @ X1 @ X2) @ X3 @ X1) | (~ (member @ (sK2 @ X3 @ X1 @ X2) @ X2 @ X1))))) | ((subset @ X2 @ X3 @ X1) = $true) | ($false = (exists_in_world @ X3 @ X1))) )),
% 0.20/0.47 inference(beta_eta_normalization,[],[f391])).
% 0.20/0.47 thf(f391,plain,(
% 0.20/0.47 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((exists_in_world @ X2 @ X1) = $false) | ($false = (exists_in_world @ X3 @ X1)) | ($false = ((^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((member @ Y0 @ X3 @ X1) | (~ (member @ Y0 @ X2 @ X1))))) @ (sK2 @ X3 @ X1 @ X2))) | ((subset @ X2 @ X3 @ X1) = $true)) )),
% 0.20/0.47 inference(sigma_clausification,[],[f390])).
% 0.20/0.47 thf(f390,plain,(
% 0.20/0.47 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($false = (exists_in_world @ X3 @ X1)) | ((subset @ X2 @ X3 @ X1) = $true) | ((exists_in_world @ X2 @ X1) = $false) | ($false = (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((member @ Y0 @ X3 @ X1) | (~ (member @ Y0 @ X2 @ X1)))))))) )),
% 0.20/0.47 inference(not_proxy_clausification,[],[f389])).
% 0.20/0.47 thf(f389,plain,(
% 0.20/0.47 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($false = (exists_in_world @ X3 @ X1)) | ((subset @ X2 @ X3 @ X1) = $true) | ((exists_in_world @ X2 @ X1) = $false) | ($true = (~ (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((member @ Y0 @ X3 @ X1) | (~ (member @ Y0 @ X2 @ X1))))))))) )),
% 0.20/0.47 inference(binary_proxy_clausification,[],[f388])).
% 0.20/0.47 thf(f388,plain,(
% 0.20/0.47 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($true = ((subset @ X2 @ X3 @ X1) | (~ (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((member @ Y0 @ X3 @ X1) | (~ (member @ Y0 @ X2 @ X1))))))))) | ((exists_in_world @ X2 @ X1) = $false) | ($false = (exists_in_world @ X3 @ X1))) )),
% 0.20/0.47 inference(not_proxy_clausification,[],[f387])).
% 0.20/0.47 thf(f387,plain,(
% 0.20/0.47 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((exists_in_world @ X2 @ X1) = $false) | ($false = (~ ((subset @ X2 @ X3 @ X1) | (~ (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((member @ Y0 @ X3 @ X1) | (~ (member @ Y0 @ X2 @ X1)))))))))) | ($false = (exists_in_world @ X3 @ X1))) )),
% 0.20/0.47 inference(binary_proxy_clausification,[],[f385])).
% 0.20/0.47 thf(f385,plain,(
% 0.20/0.47 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($false = ((~ ((subset @ X2 @ X3 @ X1) | (~ (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((member @ Y0 @ X3 @ X1) | (~ (member @ Y0 @ X2 @ X1))))))))) | (~ ((!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((member @ Y0 @ X3 @ X1) | (~ (member @ Y0 @ X2 @ X1)))))) | (~ (subset @ X2 @ X3 @ X1)))))) | ((exists_in_world @ X2 @ X1) = $false) | ($false = (exists_in_world @ X3 @ X1))) )),
% 0.20/0.47 inference(not_proxy_clausification,[],[f384])).
% 0.20/0.47 thf(f384,plain,(
% 0.20/0.47 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($true = (~ ((~ ((subset @ X2 @ X3 @ X1) | (~ (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((member @ Y0 @ X3 @ X1) | (~ (member @ Y0 @ X2 @ X1))))))))) | (~ ((!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((member @ Y0 @ X3 @ X1) | (~ (member @ Y0 @ X2 @ X1)))))) | (~ (subset @ X2 @ X3 @ X1))))))) | ((exists_in_world @ X2 @ X1) = $false) | ($false = (exists_in_world @ X3 @ X1))) )),
% 0.20/0.47 inference(binary_proxy_clausification,[],[f383])).
% 0.20/0.47 thf(f383,plain,(
% 0.20/0.47 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((exists_in_world @ X2 @ X1) = $false) | ($true = ((exists_in_world @ X3 @ X1) => (~ ((~ ((subset @ X2 @ X3 @ X1) | (~ (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((member @ Y0 @ X3 @ X1) | (~ (member @ Y0 @ X2 @ X1))))))))) | (~ ((!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((member @ Y0 @ X3 @ X1) | (~ (member @ Y0 @ X2 @ X1)))))) | (~ (subset @ X2 @ X3 @ X1))))))))) )),
% 0.20/0.47 inference(beta_eta_normalization,[],[f382])).
% 0.20/0.47 thf(f382,plain,(
% 0.20/0.47 ( ! [X2 : mu,X3 : mu,X1 : $i] : ((((^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (~ ((~ ((subset @ X2 @ Y0 @ X1) | (~ (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => ((member @ Y1 @ Y0 @ X1) | (~ (member @ Y1 @ X2 @ X1))))))))) | (~ ((!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => ((member @ Y1 @ Y0 @ X1) | (~ (member @ Y1 @ X2 @ X1)))))) | (~ (subset @ X2 @ Y0 @ X1)))))))) @ X3) = $true) | ((exists_in_world @ X2 @ X1) = $false)) )),
% 0.20/0.47 inference(pi_clausification,[],[f381])).
% 0.20/0.47 thf(f381,plain,(
% 0.20/0.47 ( ! [X2 : mu,X1 : $i] : (((!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (~ ((~ ((subset @ X2 @ Y0 @ X1) | (~ (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => ((member @ Y1 @ Y0 @ X1) | (~ (member @ Y1 @ X2 @ X1))))))))) | (~ ((!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => ((member @ Y1 @ Y0 @ X1) | (~ (member @ Y1 @ X2 @ X1)))))) | (~ (subset @ X2 @ Y0 @ X1))))))))) = $true) | ((exists_in_world @ X2 @ X1) = $false)) )),
% 0.20/0.47 inference(binary_proxy_clausification,[],[f380])).
% 0.20/0.47 thf(f380,plain,(
% 0.20/0.47 ( ! [X2 : mu,X1 : $i] : (($true = ((exists_in_world @ X2 @ X1) => (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (~ ((~ ((subset @ X2 @ Y0 @ X1) | (~ (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => ((member @ Y1 @ Y0 @ X1) | (~ (member @ Y1 @ X2 @ X1))))))))) | (~ ((!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => ((member @ Y1 @ Y0 @ X1) | (~ (member @ Y1 @ X2 @ X1)))))) | (~ (subset @ X2 @ Y0 @ X1)))))))))))) )),
% 0.20/0.47 inference(beta_eta_normalization,[],[f379])).
% 0.20/0.47 thf(f379,plain,(
% 0.20/0.47 ( ! [X2 : mu,X1 : $i] : (($true = ((^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => (~ ((~ ((subset @ Y0 @ Y1 @ X1) | (~ (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ X1) => ((member @ Y2 @ Y1 @ X1) | (~ (member @ Y2 @ Y0 @ X1))))))))) | (~ ((!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ X1) => ((member @ Y2 @ Y1 @ X1) | (~ (member @ Y2 @ Y0 @ X1)))))) | (~ (subset @ Y0 @ Y1 @ X1))))))))))) @ X2))) )),
% 0.20/0.47 inference(pi_clausification,[],[f378])).
% 0.20/0.47 thf(f378,plain,(
% 0.20/0.47 ( ! [X1 : $i] : (((!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => (~ ((~ ((subset @ Y0 @ Y1 @ X1) | (~ (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ X1) => ((member @ Y2 @ Y1 @ X1) | (~ (member @ Y2 @ Y0 @ X1))))))))) | (~ ((!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ X1) => ((member @ Y2 @ Y1 @ X1) | (~ (member @ Y2 @ Y0 @ X1)))))) | (~ (subset @ Y0 @ Y1 @ X1)))))))))))) = $true)) )),
% 0.20/0.47 inference(beta_eta_normalization,[],[f377])).
% 0.20/0.47 thf(f377,plain,(
% 0.20/0.47 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => (~ ((~ ((subset @ Y1 @ Y2 @ Y0) | (~ (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => ((member @ Y3 @ Y2 @ Y0) | (~ (member @ Y3 @ Y1 @ Y0))))))))) | (~ ((!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => ((member @ Y3 @ Y2 @ Y0) | (~ (member @ Y3 @ Y1 @ Y0)))))) | (~ (subset @ Y1 @ Y2 @ Y0))))))))))))) @ X1))) )),
% 0.20/0.47 inference(pi_clausification,[],[f376])).
% 0.20/0.47 thf(f376,plain,(
% 0.20/0.47 ((!! @ $i @ (^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => (~ ((~ ((subset @ Y1 @ Y2 @ Y0) | (~ (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => ((member @ Y3 @ Y2 @ Y0) | (~ (member @ Y3 @ Y1 @ Y0))))))))) | (~ ((!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => ((member @ Y3 @ Y2 @ Y0) | (~ (member @ Y3 @ Y1 @ Y0)))))) | (~ (subset @ Y1 @ Y2 @ Y0)))))))))))))) = $true)),
% 0.20/0.47 inference(beta_eta_normalization,[],[f334])).
% 0.20/0.47 thf(f334,plain,(
% 0.20/0.47 (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (Y0 @ Y2 @ Y1))))))) @ (^[Y0 : mu]: ((^[Y1 : mu > $i > $o]: ((^[Y2 : $i]: (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y2) => (Y1 @ Y3 @ Y2))))))) @ (^[Y1 : mu]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i > $o]: ((^[Y7 : $i]: (~ (Y6 @ Y7))))) @ ((^[Y6 : $i > $o]: ((^[Y7 : $i > $o]: ((^[Y8 : $i]: ((Y7 @ Y8) | (Y6 @ Y8))))))) @ ((^[Y6 : $i > $o]: ((^[Y7 : $i]: (~ (Y6 @ Y7))))) @ Y4) @ ((^[Y6 : $i > $o]: ((^[Y7 : $i]: (~ (Y6 @ Y7))))) @ Y5)))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i > $o]: ((^[Y7 : $i > $o]: ((^[Y8 : $i]: ((Y7 @ Y8) | (Y6 @ Y8))))))) @ ((^[Y6 : $i > $o]: ((^[Y7 : $i]: (~ (Y6 @ Y7))))) @ Y4) @ Y5)))) @ Y2 @ Y3) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i > $o]: ((^[Y7 : $i > $o]: ((^[Y8 : $i]: ((Y7 @ Y8) | (Y6 @ Y8))))))) @ ((^[Y6 : $i > $o]: ((^[Y7 : $i]: (~ (Y6 @ Y7))))) @ Y4) @ Y5)))) @ Y3 @ Y2))))) @ (subset @ Y0 @ Y1) @ ((^[Y2 : mu > $i > $o]: ((^[Y3 : $i]: (!! @ mu @ (^[Y4 : mu]: ((exists_in_world @ Y4 @ Y3) => (Y2 @ Y4 @ Y3))))))) @ (^[Y2 : mu]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i > $o]: ((^[Y7 : $i]: ((Y6 @ Y7) | (Y5 @ Y7))))))) @ ((^[Y5 : $i > $o]: ((^[Y6 : $i]: (~ (Y5 @ Y6))))) @ Y3) @ Y4)))) @ (member @ Y2 @ Y0) @ (member @ Y2 @ Y1)))))))))) = $true)),
% 0.20/0.47 inference(definition_unfolding,[],[f254,f278,f274,f274,f321,f274,f319])).
% 0.20/0.47 thf(f319,plain,(
% 0.20/0.47 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))))),
% 0.20/0.47 inference(definition_unfolding,[],[f241,f295,f303])).
% 0.20/0.47 thf(f295,plain,(
% 0.20/0.47 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.20/0.47 inference(cnf_transformation,[],[f124])).
% 0.20/0.47 thf(f124,plain,(
% 0.20/0.47 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.20/0.47 inference(fool_elimination,[],[f123])).
% 0.20/0.47 thf(f123,plain,(
% 0.20/0.47 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))) = mor)),
% 0.20/0.47 inference(rectify,[],[f3])).
% 0.20/0.47 thf(f3,axiom,(
% 0.20/0.47 ((^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X3 @ X2) | (X4 @ X2))) = mor)),
% 0.20/0.47 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mor)).
% 0.20/0.47 thf(f241,plain,(
% 0.20/0.47 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.20/0.47 inference(cnf_transformation,[],[f205])).
% 0.20/0.47 thf(f205,plain,(
% 0.20/0.47 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.20/0.47 inference(fool_elimination,[],[f204])).
% 0.20/0.47 thf(f204,plain,(
% 0.20/0.47 (mimplies = (^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)))),
% 0.20/0.47 inference(rectify,[],[f9])).
% 0.20/0.47 thf(f9,axiom,(
% 0.20/0.47 (mimplies = (^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)))),
% 0.20/0.47 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mimplies)).
% 0.20/0.47 thf(f321,plain,(
% 0.20/0.47 (mequiv = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: ((Y5 @ Y6) | (Y4 @ Y6))))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y2) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y3)))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: ((Y5 @ Y6) | (Y4 @ Y6))))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y2) @ Y3)))) @ Y0 @ Y1) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: ((Y5 @ Y6) | (Y4 @ Y6))))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y2) @ Y3)))) @ Y1 @ Y0))))))),
% 0.20/0.47 inference(definition_unfolding,[],[f250,f318,f319,f319])).
% 0.20/0.47 thf(f318,plain,(
% 0.20/0.47 (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y1)))))))),
% 0.20/0.47 inference(definition_unfolding,[],[f300,f303,f295,f303,f303])).
% 0.20/0.47 thf(f300,plain,(
% 0.20/0.47 (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mor @ (mnot @ Y0) @ (mnot @ Y1)))))))),
% 0.20/0.47 inference(cnf_transformation,[],[f122])).
% 0.20/0.47 thf(f122,plain,(
% 0.20/0.47 (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mor @ (mnot @ Y0) @ (mnot @ Y1)))))))),
% 0.20/0.47 inference(fool_elimination,[],[f121])).
% 0.20/0.47 thf(f121,plain,(
% 0.20/0.47 (mand = (^[X0 : $i > $o, X1 : $i > $o] : (mnot @ (mor @ (mnot @ X0) @ (mnot @ X1)))))),
% 0.20/0.47 inference(rectify,[],[f8])).
% 0.20/0.47 thf(f8,axiom,(
% 0.20/0.47 (mand = (^[X3 : $i > $o, X4 : $i > $o] : (mnot @ (mor @ (mnot @ X3) @ (mnot @ X4)))))),
% 0.20/0.47 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mand)).
% 0.20/0.47 thf(f250,plain,(
% 0.20/0.47 (mequiv = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mand @ (mimplies @ Y0 @ Y1) @ (mimplies @ Y1 @ Y0))))))),
% 0.20/0.47 inference(cnf_transformation,[],[f191])).
% 0.20/0.47 thf(f191,plain,(
% 0.20/0.47 (mequiv = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mand @ (mimplies @ Y0 @ Y1) @ (mimplies @ Y1 @ Y0))))))),
% 0.20/0.47 inference(fool_elimination,[],[f190])).
% 0.20/0.47 thf(f190,plain,(
% 0.20/0.47 ((^[X0 : $i > $o, X1 : $i > $o] : (mand @ (mimplies @ X0 @ X1) @ (mimplies @ X1 @ X0))) = mequiv)),
% 0.20/0.47 inference(rectify,[],[f11])).
% 0.20/0.47 thf(f11,axiom,(
% 0.20/0.47 ((^[X3 : $i > $o, X4 : $i > $o] : (mand @ (mimplies @ X3 @ X4) @ (mimplies @ X4 @ X3))) = mequiv)),
% 0.20/0.47 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mequiv)).
% 0.20/0.47 thf(f254,plain,(
% 0.20/0.47 ((mvalid @ (mforall_ind @ (^[Y0 : mu]: (mforall_ind @ (^[Y1 : mu]: (mequiv @ (subset @ Y0 @ Y1) @ (mforall_ind @ (^[Y2 : mu]: (mimplies @ (member @ Y2 @ Y0) @ (member @ Y2 @ Y1)))))))))) = $true)),
% 0.20/0.47 inference(cnf_transformation,[],[f187])).
% 0.20/0.47 thf(f187,plain,(
% 0.20/0.47 ((mvalid @ (mforall_ind @ (^[Y0 : mu]: (mforall_ind @ (^[Y1 : mu]: (mequiv @ (subset @ Y0 @ Y1) @ (mforall_ind @ (^[Y2 : mu]: (mimplies @ (member @ Y2 @ Y0) @ (member @ Y2 @ Y1)))))))))) = $true)),
% 0.20/0.47 inference(fool_elimination,[],[f186])).
% 0.20/0.47 thf(f186,plain,(
% 0.20/0.47 (mvalid @ (mforall_ind @ (^[X0 : mu] : (mforall_ind @ (^[X1 : mu] : (mequiv @ (subset @ X0 @ X1) @ (mforall_ind @ (^[X2 : mu] : (mimplies @ (member @ X2 @ X0) @ (member @ X2 @ X1))))))))))),
% 0.20/0.47 inference(rectify,[],[f67])).
% 0.20/0.47 thf(f67,axiom,(
% 0.20/0.47 (mvalid @ (mforall_ind @ (^[X14 : mu] : (mforall_ind @ (^[X15 : mu] : (mequiv @ (subset @ X14 @ X15) @ (mforall_ind @ (^[X0 : mu] : (mimplies @ (member @ X0 @ X14) @ (member @ X0 @ X15))))))))))),
% 0.20/0.47 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset)).
% 0.20/0.47 thf(f394,plain,(
% 0.20/0.47 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($true = (exists_in_world @ (sK2 @ X3 @ X1 @ X2) @ X1)) | ($false = (exists_in_world @ X3 @ X1)) | ((subset @ X2 @ X3 @ X1) = $true) | ((exists_in_world @ X2 @ X1) = $false)) )),
% 0.20/0.47 inference(binary_proxy_clausification,[],[f392])).
% 0.20/0.47 thf(f643,plain,(
% 0.20/0.47 ($false = (subset @ empty_set @ sK4 @ sK3))),
% 0.20/0.47 inference(binary_proxy_clausification,[],[f642])).
% 0.20/0.47 thf(f642,plain,(
% 0.20/0.47 ($false = ((exists_in_world @ sK4 @ sK3) => (subset @ empty_set @ sK4 @ sK3)))),
% 0.20/0.47 inference(beta_eta_normalization,[],[f641])).
% 0.20/0.47 thf(f641,plain,(
% 0.20/0.47 ($false = ((^[Y0 : mu]: ((exists_in_world @ Y0 @ sK3) => (subset @ empty_set @ Y0 @ sK3))) @ sK4))),
% 0.20/0.47 inference(sigma_clausification,[],[f640])).
% 0.20/0.47 thf(f640,plain,(
% 0.20/0.47 ($false = (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ sK3) => (subset @ empty_set @ Y0 @ sK3)))))),
% 0.20/0.47 inference(beta_eta_normalization,[],[f639])).
% 0.20/0.47 thf(f639,plain,(
% 0.20/0.47 ($false = ((^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (subset @ empty_set @ Y1 @ Y0))))) @ sK3))),
% 0.20/0.47 inference(sigma_clausification,[],[f638])).
% 0.20/0.47 thf(f638,plain,(
% 0.20/0.47 ((!! @ $i @ (^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (subset @ empty_set @ Y1 @ Y0)))))) != $true)),
% 0.20/0.47 inference(beta_eta_normalization,[],[f346])).
% 0.20/0.47 thf(f346,plain,(
% 0.20/0.47 ($true != ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (Y0 @ Y2 @ Y1))))))) @ (^[Y0 : mu]: (subset @ empty_set @ Y0)))))),
% 0.20/0.47 inference(definition_unfolding,[],[f290,f278,f274])).
% 0.20/0.47 thf(f290,plain,(
% 0.20/0.47 ($true != (mvalid @ (mforall_ind @ (^[Y0 : mu]: (subset @ empty_set @ Y0)))))),
% 0.20/0.47 inference(cnf_transformation,[],[f234])).
% 0.20/0.47 thf(f234,plain,(
% 0.20/0.47 ($true != (mvalid @ (mforall_ind @ (^[Y0 : mu]: (subset @ empty_set @ Y0)))))),
% 0.20/0.47 inference(flattening,[],[f215])).
% 0.20/0.47 thf(f215,plain,(
% 0.20/0.47 ~($true = (mvalid @ (mforall_ind @ (^[Y0 : mu]: (subset @ empty_set @ Y0)))))),
% 0.20/0.47 inference(fool_elimination,[],[f214])).
% 0.20/0.47 thf(f214,plain,(
% 0.20/0.47 ~(mvalid @ (mforall_ind @ (^[X0 : mu] : (subset @ empty_set @ X0))))),
% 0.20/0.47 inference(rectify,[],[f79])).
% 0.20/0.47 thf(f79,negated_conjecture,(
% 0.20/0.47 ~(mvalid @ (mforall_ind @ (^[X14 : mu] : (subset @ empty_set @ X14))))),
% 0.20/0.47 inference(negated_conjecture,[],[f78])).
% 0.20/0.47 thf(f78,conjecture,(
% 0.20/0.47 (mvalid @ (mforall_ind @ (^[X14 : mu] : (subset @ empty_set @ X14))))),
% 0.20/0.47 file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI15)).
% 0.20/0.47 thf(f982,plain,(
% 0.20/0.47 ~spl1_3),
% 0.20/0.47 inference(avatar_contradiction_clause,[],[f981])).
% 0.20/0.47 thf(f981,plain,(
% 0.20/0.47 $false | ~spl1_3),
% 0.20/0.47 inference(trivial_inequality_removal,[],[f977])).
% 0.20/0.47 thf(f977,plain,(
% 0.20/0.47 ($false = $true) | ~spl1_3),
% 0.20/0.47 inference(superposition,[],[f252,f960])).
% 0.20/0.47 thf(f960,plain,(
% 0.20/0.47 ($false = (exists_in_world @ empty_set @ sK3)) | ~spl1_3),
% 0.20/0.47 inference(avatar_component_clause,[],[f958])).
% 0.20/0.47 thf(f252,plain,(
% 0.20/0.47 ( ! [X0 : $i] : (($true = (exists_in_world @ empty_set @ X0))) )),
% 0.20/0.47 inference(cnf_transformation,[],[f86])).
% 0.20/0.47 thf(f86,plain,(
% 0.20/0.47 ! [X0] : ($true = (exists_in_world @ empty_set @ X0))),
% 0.20/0.47 inference(fool_elimination,[],[f85])).
% 0.20/0.47 thf(f85,plain,(
% 0.20/0.47 ! [X0] : (exists_in_world @ empty_set @ X0)),
% 0.20/0.47 inference(rectify,[],[f45])).
% 0.20/0.47 thf(f45,axiom,(
% 0.20/0.47 ! [X6] : (exists_in_world @ empty_set @ X6)),
% 0.20/0.47 file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_empty_set_ax)).
% 0.20/0.47 thf(f972,plain,(
% 0.20/0.47 ~spl1_2),
% 0.20/0.47 inference(avatar_contradiction_clause,[],[f971])).
% 0.20/0.47 thf(f971,plain,(
% 0.20/0.47 $false | ~spl1_2),
% 0.20/0.47 inference(trivial_inequality_removal,[],[f965])).
% 0.20/0.47 thf(f965,plain,(
% 0.20/0.47 ($false = $true) | ~spl1_2),
% 0.20/0.47 inference(superposition,[],[f644,f956])).
% 0.20/0.47 thf(f956,plain,(
% 0.20/0.47 ((exists_in_world @ sK4 @ sK3) = $false) | ~spl1_2),
% 0.20/0.47 inference(avatar_component_clause,[],[f954])).
% 0.20/0.47 thf(f644,plain,(
% 0.20/0.47 ((exists_in_world @ sK4 @ sK3) = $true)),
% 0.20/0.47 inference(binary_proxy_clausification,[],[f642])).
% 0.20/0.47 % SZS output end Proof for theBenchmark
% 0.20/0.47 % (14188)------------------------------
% 0.20/0.47 % (14188)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.47 % (14188)Termination reason: Refutation
% 0.20/0.47
% 0.20/0.47 % (14188)Memory used [KB]: 7036
% 0.20/0.47 % (14188)Time elapsed: 0.092 s
% 0.20/0.47 % (14188)Instructions burned: 174 (million)
% 0.20/0.47 % (14188)------------------------------
% 0.20/0.47 % (14188)------------------------------
% 0.20/0.47 % (14187)Success in time 0.095 s
% 0.20/0.47 % Vampire---4.8 exiting
%------------------------------------------------------------------------------