TSTP Solution File: SET907^7 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET907^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n023.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:13:52 EDT 2024
% Result : Theorem 2.16s 0.67s
% Output : Refutation 2.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET907^7 : TPTP v8.2.0. Released v5.5.0.
% 0.13/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.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 12:28:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.37 % (25237)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.38 % (25233)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.38 % (25235)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.38 % (25235)Instruction limit reached!
% 0.14/0.38 % (25235)------------------------------
% 0.14/0.38 % (25235)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (25235)Termination reason: Unknown
% 0.14/0.38 % (25235)Termination phase: shuffling
% 0.14/0.38 % (25237)Instruction limit reached!
% 0.14/0.38 % (25237)------------------------------
% 0.14/0.38 % (25237)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38
% 0.14/0.38 % (25235)Memory used [KB]: 1023
% 0.14/0.38 % (25235)Time elapsed: 0.003 s
% 0.14/0.38 % (25235)Instructions burned: 2 (million)
% 0.14/0.38 % (25235)------------------------------
% 0.14/0.38 % (25235)------------------------------
% 0.14/0.38 % (25237)Termination reason: Unknown
% 0.14/0.38 % (25237)Termination phase: Property scanning
% 0.14/0.38
% 0.14/0.38 % (25237)Memory used [KB]: 1279
% 0.14/0.38 % (25237)Time elapsed: 0.011 s
% 0.14/0.38 % (25237)Instructions burned: 18 (million)
% 0.14/0.38 % (25237)------------------------------
% 0.14/0.38 % (25237)------------------------------
% 0.14/0.38 % (25232)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 % (25231)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.38 % (25236)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.38 % (25234)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.38 % (25232)Instruction limit reached!
% 0.14/0.38 % (25232)------------------------------
% 0.14/0.38 % (25232)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (25232)Termination reason: Unknown
% 0.14/0.38 % (25232)Termination phase: shuffling
% 0.14/0.38
% 0.14/0.38 % (25232)Memory used [KB]: 1151
% 0.14/0.38 % (25232)Time elapsed: 0.004 s
% 0.14/0.38 % (25232)Instructions burned: 5 (million)
% 0.14/0.38 % (25232)------------------------------
% 0.14/0.38 % (25232)------------------------------
% 0.14/0.38 % (25234)Instruction limit reached!
% 0.14/0.38 % (25234)------------------------------
% 0.14/0.38 % (25234)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (25234)Termination reason: Unknown
% 0.14/0.38 % (25234)Termination phase: shuffling
% 0.14/0.38
% 0.14/0.38 % (25234)Memory used [KB]: 1023
% 0.14/0.38 % (25234)Time elapsed: 0.003 s
% 0.14/0.38 % (25234)Instructions burned: 2 (million)
% 0.14/0.38 % (25234)------------------------------
% 0.14/0.38 % (25234)------------------------------
% 0.14/0.39 % (25238)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.39 % (25233)Instruction limit reached!
% 0.14/0.39 % (25233)------------------------------
% 0.14/0.39 % (25233)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (25233)Termination reason: Unknown
% 0.14/0.39 % (25233)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (25233)Memory used [KB]: 5756
% 0.14/0.39 % (25233)Time elapsed: 0.014 s
% 0.14/0.39 % (25233)Instructions burned: 28 (million)
% 0.14/0.39 % (25233)------------------------------
% 0.14/0.39 % (25233)------------------------------
% 0.14/0.39 % (25238)Instruction limit reached!
% 0.14/0.39 % (25238)------------------------------
% 0.14/0.39 % (25238)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (25238)Termination reason: Unknown
% 0.14/0.39 % (25238)Termination phase: shuffling
% 0.14/0.39
% 0.14/0.39 % (25238)Memory used [KB]: 1023
% 0.14/0.39 % (25238)Time elapsed: 0.003 s
% 0.14/0.39 % (25238)Instructions burned: 3 (million)
% 0.14/0.39 % (25238)------------------------------
% 0.14/0.39 % (25238)------------------------------
% 0.14/0.39 % (25236)Refutation not found, incomplete strategy
% 0.14/0.39 % (25236)------------------------------
% 0.14/0.39 % (25236)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (25236)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 % (25236)Memory used [KB]: 5628
% 0.14/0.39 % (25236)Time elapsed: 0.010 s
% 0.14/0.39 % (25236)Instructions burned: 14 (million)
% 0.14/0.39 % (25236)------------------------------
% 0.14/0.39 % (25236)------------------------------
% 0.14/0.39 % (25239)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.40 % (25240)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 % (25242)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.40 % (25244)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.40 % (25240)Instruction limit reached!
% 0.14/0.40 % (25240)------------------------------
% 0.14/0.40 % (25240)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (25240)Termination reason: Unknown
% 0.14/0.40 % (25240)Termination phase: Function definition elimination
% 0.14/0.40
% 0.14/0.40 % (25240)Memory used [KB]: 1151
% 0.14/0.40 % (25240)Time elapsed: 0.008 s
% 0.14/0.40 % (25240)Instructions burned: 15 (million)
% 0.14/0.40 % (25240)------------------------------
% 0.14/0.40 % (25240)------------------------------
% 0.14/0.40 % (25245)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.14/0.40 % (25243)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.40 % (25241)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 % (25245)Instruction limit reached!
% 0.14/0.40 % (25245)------------------------------
% 0.14/0.40 % (25245)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (25245)Termination reason: Unknown
% 0.14/0.40 % (25245)Termination phase: shuffling
% 0.14/0.40
% 0.14/0.40 % (25245)Memory used [KB]: 1023
% 0.14/0.40 % (25245)Time elapsed: 0.003 s
% 0.14/0.40 % (25245)Instructions burned: 3 (million)
% 0.14/0.40 % (25245)------------------------------
% 0.14/0.40 % (25245)------------------------------
% 0.14/0.41 % (25241)Instruction limit reached!
% 0.14/0.41 % (25241)------------------------------
% 0.14/0.41 % (25241)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.41 % (25241)Termination reason: Unknown
% 0.14/0.41 % (25241)Termination phase: shuffling
% 0.14/0.41
% 0.14/0.41 % (25241)Memory used [KB]: 1023
% 0.14/0.41 % (25241)Time elapsed: 0.003 s
% 0.14/0.41 % (25241)Instructions burned: 3 (million)
% 0.14/0.41 % (25241)------------------------------
% 0.14/0.41 % (25241)------------------------------
% 0.14/0.41 % (25243)Instruction limit reached!
% 0.14/0.41 % (25243)------------------------------
% 0.14/0.41 % (25243)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.41 % (25243)Termination reason: Unknown
% 0.14/0.41 % (25243)Termination phase: shuffling
% 0.14/0.41
% 0.14/0.41 % (25243)Memory used [KB]: 1151
% 0.14/0.41 % (25243)Time elapsed: 0.005 s
% 0.14/0.41 % (25243)Instructions burned: 7 (million)
% 0.14/0.41 % (25243)------------------------------
% 0.14/0.41 % (25243)------------------------------
% 0.14/0.41 % (25244)Instruction limit reached!
% 0.14/0.41 % (25244)------------------------------
% 0.14/0.41 % (25244)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.41 % (25244)Termination reason: Unknown
% 0.14/0.41 % (25244)Termination phase: Twee Goal Transformation
% 0.14/0.41
% 0.14/0.41 % (25244)Memory used [KB]: 1279
% 0.14/0.41 % (25244)Time elapsed: 0.009 s
% 0.14/0.41 % (25244)Instructions burned: 17 (million)
% 0.14/0.41 % (25244)------------------------------
% 0.14/0.41 % (25244)------------------------------
% 0.14/0.41 % (25239)Instruction limit reached!
% 0.14/0.41 % (25239)------------------------------
% 0.14/0.41 % (25239)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.41 % (25239)Termination reason: Unknown
% 0.14/0.41 % (25239)Termination phase: Saturation
% 0.14/0.41
% 0.14/0.41 % (25239)Memory used [KB]: 5884
% 0.14/0.41 % (25239)Time elapsed: 0.019 s
% 0.14/0.41 % (25239)Instructions burned: 37 (million)
% 0.14/0.41 % (25239)------------------------------
% 0.14/0.41 % (25239)------------------------------
% 0.14/0.42 % (25246)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.14/0.42 % (25246)Instruction limit reached!
% 0.14/0.42 % (25246)------------------------------
% 0.14/0.42 % (25246)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.42 % (25246)Termination reason: Unknown
% 0.14/0.42 % (25246)Termination phase: shuffling
% 0.14/0.42
% 0.14/0.42 % (25246)Memory used [KB]: 1023
% 0.14/0.42 % (25246)Time elapsed: 0.003 s
% 0.14/0.42 % (25246)Instructions burned: 3 (million)
% 0.14/0.42 % (25246)------------------------------
% 0.14/0.42 % (25246)------------------------------
% 0.14/0.42 % (25248)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.14/0.42 % (25247)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.14/0.42 % (25248)Instruction limit reached!
% 0.14/0.42 % (25248)------------------------------
% 0.14/0.42 % (25248)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.42 % (25248)Termination reason: Unknown
% 0.14/0.42 % (25248)Termination phase: shuffling
% 0.14/0.42
% 0.14/0.42 % (25248)Memory used [KB]: 1023
% 0.14/0.42 % (25248)Time elapsed: 0.003 s
% 0.14/0.42 % (25248)Instructions burned: 3 (million)
% 0.14/0.42 % (25248)------------------------------
% 0.14/0.42 % (25248)------------------------------
% 0.21/0.42 % (25251)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on theBenchmark for (2999ds/710Mi)
% 0.21/0.42 % (25250)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.42 % (25247)Instruction limit reached!
% 0.21/0.42 % (25247)------------------------------
% 0.21/0.42 % (25247)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (25247)Termination reason: Unknown
% 0.21/0.42 % (25247)Termination phase: Property scanning
% 0.21/0.42
% 0.21/0.42 % (25247)Memory used [KB]: 1151
% 0.21/0.42 % (25247)Time elapsed: 0.006 s
% 0.21/0.42 % (25247)Instructions burned: 8 (million)
% 0.21/0.42 % (25247)------------------------------
% 0.21/0.42 % (25247)------------------------------
% 0.21/0.43 % (25249)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.21/0.43 % (25249)Instruction limit reached!
% 0.21/0.43 % (25249)------------------------------
% 0.21/0.43 % (25249)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.43 % (25249)Termination reason: Unknown
% 0.21/0.43 % (25249)Termination phase: shuffling
% 0.21/0.43
% 0.21/0.43 % (25249)Memory used [KB]: 1023
% 0.21/0.43 % (25249)Time elapsed: 0.004 s
% 0.21/0.43 % (25249)Instructions burned: 4 (million)
% 0.21/0.43 % (25249)------------------------------
% 0.21/0.43 % (25249)------------------------------
% 0.21/0.43 % (25250)Instruction limit reached!
% 0.21/0.43 % (25250)------------------------------
% 0.21/0.43 % (25250)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.43 % (25250)Termination reason: Unknown
% 0.21/0.43 % (25250)Termination phase: Saturation
% 0.21/0.43
% 0.21/0.43 % (25250)Memory used [KB]: 5628
% 0.21/0.43 % (25250)Time elapsed: 0.010 s
% 0.21/0.43 % (25250)Instructions burned: 19 (million)
% 0.21/0.43 % (25250)------------------------------
% 0.21/0.43 % (25250)------------------------------
% 0.21/0.43 % (25252)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.21/0.44 % (25252)Instruction limit reached!
% 0.21/0.44 % (25252)------------------------------
% 0.21/0.44 % (25252)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.44 % (25252)Termination reason: Unknown
% 0.21/0.44 % (25252)Termination phase: shuffling
% 0.21/0.44
% 0.21/0.44 % (25252)Memory used [KB]: 1151
% 0.21/0.44 % (25252)Time elapsed: 0.005 s
% 0.21/0.44 % (25252)Instructions burned: 8 (million)
% 0.21/0.44 % (25252)------------------------------
% 0.21/0.44 % (25252)------------------------------
% 0.21/0.44 % (25254)dis+21_1:8_apa=on:cnfonf=off:fd=off:fsr=off:hud=0:ins=1:kws=inv_frequency:nwc=10.0:ss=axioms:st=5.0:i=21:si=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.21/0.44 % (25253)dis+1002_5:1_au=on:bd=off:e2e=on:fde=none:fs=off:fsr=off:sos=on:i=902:si=on:rtra=on_0 on theBenchmark for (2999ds/902Mi)
% 0.21/0.44 % (25255)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2999ds/5Mi)
% 0.21/0.44 % (25256)lrs+2_1:1_cnfonf=lazy_not_gen_be_off:cs=on:fe=off:hud=10:inj=on:ins=3:plsq=on:plsqc=1:sd=10:ss=axioms:tnu=1:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.21/0.44 % (25255)Instruction limit reached!
% 0.21/0.44 % (25255)------------------------------
% 0.21/0.44 % (25255)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.44 % (25255)Termination reason: Unknown
% 0.21/0.44 % (25255)Termination phase: shuffling
% 0.21/0.44
% 0.21/0.44 % (25255)Memory used [KB]: 1151
% 0.21/0.44 % (25255)Time elapsed: 0.005 s
% 0.21/0.44 % (25255)Instructions burned: 6 (million)
% 0.21/0.44 % (25255)------------------------------
% 0.21/0.44 % (25255)------------------------------
% 0.21/0.45 % (25256)Instruction limit reached!
% 0.21/0.45 % (25256)------------------------------
% 0.21/0.45 % (25256)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.45 % (25256)Termination reason: Unknown
% 0.21/0.45 % (25256)Termination phase: Property scanning
% 0.21/0.45
% 0.21/0.45 % (25256)Memory used [KB]: 1151
% 0.21/0.45 % (25256)Time elapsed: 0.003 s
% 0.21/0.45 % (25256)Instructions burned: 8 (million)
% 0.21/0.45 % (25256)------------------------------
% 0.21/0.45 % (25256)------------------------------
% 0.21/0.45 % (25254)Instruction limit reached!
% 0.21/0.45 % (25254)------------------------------
% 0.21/0.45 % (25254)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.45 % (25254)Termination reason: Unknown
% 0.21/0.45 % (25254)Termination phase: Property scanning
% 0.21/0.45
% 0.21/0.45 % (25254)Memory used [KB]: 1279
% 0.21/0.45 % (25254)Time elapsed: 0.011 s
% 0.21/0.45 % (25254)Instructions burned: 22 (million)
% 0.21/0.45 % (25254)------------------------------
% 0.21/0.45 % (25254)------------------------------
% 0.21/0.45 % (25253)Refutation not found, incomplete strategy
% 0.21/0.45 % (25253)------------------------------
% 0.21/0.45 % (25253)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.45 % (25253)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 % (25253)Memory used [KB]: 5756
% 0.21/0.45 % (25253)Time elapsed: 0.014 s
% 0.21/0.45 % (25253)Instructions burned: 19 (million)
% 0.21/0.45 % (25253)------------------------------
% 0.21/0.45 % (25253)------------------------------
% 0.21/0.45 % (25257)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on theBenchmark for (2999ds/377Mi)
% 0.21/0.45 % (25259)lrs+10_1:1_cnfonf=lazy_not_be_gen:ntd=on:sp=const_min:ss=axioms:sup=off:i=19:si=on:rtra=on_0 on theBenchmark for (2999ds/19Mi)
% 0.21/0.46 % (25259)Refutation not found, incomplete strategy
% 0.21/0.46 % (25259)------------------------------
% 0.21/0.46 % (25259)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.46 % (25259)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46 % (25259)Memory used [KB]: 5756
% 0.21/0.46 % (25259)Time elapsed: 0.005 s
% 0.21/0.46 % (25259)Instructions burned: 15 (million)
% 0.21/0.46 % (25259)------------------------------
% 0.21/0.46 % (25259)------------------------------
% 0.21/0.46 % (25258)dis+1010_1:4_atotf=0.2:c=on:cbe=off:cnfonf=lazy_simp:fe=off:ins=2:ntd=on:s2a=on:s2at=5.0:sgt=5:ss=axioms:st=1.5:i=779:si=on:rtra=on_0 on theBenchmark for (2999ds/779Mi)
% 0.21/0.46 % (25260)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.21/0.47 % (25261)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on theBenchmark for (2999ds/17Mi)
% 0.21/0.47 % (25262)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.47 % (25262)Instruction limit reached!
% 0.21/0.47 % (25262)------------------------------
% 0.21/0.47 % (25262)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.47 % (25262)Termination reason: Unknown
% 0.21/0.47 % (25262)Termination phase: shuffling
% 0.21/0.47
% 0.21/0.47 % (25262)Memory used [KB]: 1023
% 0.21/0.47 % (25262)Time elapsed: 0.002 s
% 0.21/0.47 % (25262)Instructions burned: 3 (million)
% 0.21/0.47 % (25262)------------------------------
% 0.21/0.47 % (25262)------------------------------
% 0.21/0.47 % (25261)Instruction limit reached!
% 0.21/0.47 % (25261)------------------------------
% 0.21/0.47 % (25261)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.47 % (25261)Termination reason: Unknown
% 0.21/0.47 % (25261)Termination phase: Function definition elimination
% 0.21/0.47
% 0.21/0.47 % (25261)Memory used [KB]: 1151
% 0.21/0.47 % (25261)Time elapsed: 0.009 s
% 0.21/0.47 % (25261)Instructions burned: 17 (million)
% 0.21/0.47 % (25261)------------------------------
% 0.21/0.47 % (25261)------------------------------
% 0.21/0.47 % (25263)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on theBenchmark for (2998ds/30Mi)
% 0.21/0.48 % (25263)Instruction limit reached!
% 0.21/0.48 % (25263)------------------------------
% 0.21/0.48 % (25263)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.48 % (25263)Termination reason: Unknown
% 0.21/0.48 % (25263)Termination phase: Saturation
% 0.21/0.48
% 0.21/0.48 % (25263)Memory used [KB]: 5884
% 0.21/0.48 % (25263)Time elapsed: 0.009 s
% 0.21/0.48 % (25263)Instructions burned: 32 (million)
% 0.21/0.48 % (25263)------------------------------
% 0.21/0.48 % (25263)------------------------------
% 0.21/0.49 % (25231)Instruction limit reached!
% 0.21/0.49 % (25231)------------------------------
% 0.21/0.49 % (25231)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.49 % (25231)Termination reason: Unknown
% 0.21/0.49 % (25231)Termination phase: Saturation
% 0.21/0.49
% 0.21/0.49 % (25231)Memory used [KB]: 6780
% 0.21/0.49 % (25231)Time elapsed: 0.106 s
% 0.21/0.49 % (25231)Instructions burned: 183 (million)
% 0.21/0.49 % (25231)------------------------------
% 0.21/0.49 % (25231)------------------------------
% 0.21/0.49 % (25264)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on theBenchmark for (2998ds/127Mi)
% 0.21/0.49 % (25265)lrs+1002_1:1_au=on:cbe=off:cnfonf=conj_eager:cond=on:hi=on:i=100:si=on:rtra=on_0 on theBenchmark for (2998ds/100Mi)
% 0.21/0.50 % (25266)dis+10_1:1_anc=none:cnfonf=lazy_gen:fd=preordered:fe=off:hud=10:ins=3:ixr=off:nwc=5.0:plsq=on:plsqc=1:plsqr=32,1:sp=const_frequency:uhcvi=on:i=3:si=on:rtra=on_0 on theBenchmark for (2998ds/3Mi)
% 0.21/0.50 % (25266)Instruction limit reached!
% 0.21/0.50 % (25266)------------------------------
% 0.21/0.50 % (25266)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.50 % (25266)Termination reason: Unknown
% 0.21/0.50 % (25266)Termination phase: shuffling
% 0.21/0.50
% 0.21/0.50 % (25266)Memory used [KB]: 1023
% 0.21/0.50 % (25266)Time elapsed: 0.002 s
% 0.21/0.50 % (25266)Instructions burned: 3 (million)
% 0.21/0.50 % (25266)------------------------------
% 0.21/0.50 % (25266)------------------------------
% 0.21/0.51 % (25267)lrs+10_8:1_au=on:avsq=on:e2e=on:ins=3:s2a=on:s2at=3.0:ss=axioms:i=20:si=on:rtra=on_0 on theBenchmark for (2998ds/20Mi)
% 0.21/0.52 % (25267)Instruction limit reached!
% 0.21/0.52 % (25267)------------------------------
% 0.21/0.52 % (25267)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.52 % (25267)Termination reason: Unknown
% 0.21/0.52 % (25267)Termination phase: Saturation
% 0.21/0.52
% 0.21/0.52 % (25267)Memory used [KB]: 5756
% 0.21/0.52 % (25267)Time elapsed: 0.029 s
% 0.21/0.52 % (25267)Instructions burned: 22 (million)
% 0.21/0.52 % (25267)------------------------------
% 0.21/0.52 % (25267)------------------------------
% 0.21/0.52 % (25265)Instruction limit reached!
% 0.21/0.52 % (25265)------------------------------
% 0.21/0.52 % (25265)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.52 % (25265)Termination reason: Unknown
% 0.21/0.52 % (25265)Termination phase: Saturation
% 0.21/0.52
% 0.21/0.52 % (25265)Memory used [KB]: 6268
% 0.21/0.52 % (25265)Time elapsed: 0.029 s
% 0.21/0.52 % (25265)Instructions burned: 103 (million)
% 0.21/0.52 % (25265)------------------------------
% 0.21/0.52 % (25265)------------------------------
% 0.21/0.53 % (25268)dis+1002_1:1_cbe=off:hud=5:nm=4:plsq=on:plsqr=7,1:prag=on:sp=const_max:tnu=1:i=86:si=on:rtra=on_0 on theBenchmark for (2998ds/86Mi)
% 0.21/0.53 % (25269)lrs+1010_1:1_au=on:cbe=off:nm=2:ntd=on:sd=2:ss=axioms:st=5.0:i=107:si=on:rtra=on_0 on theBenchmark for (2998ds/107Mi)
% 0.21/0.55 % (25268)Instruction limit reached!
% 0.21/0.55 % (25268)------------------------------
% 0.21/0.55 % (25268)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.55 % (25268)Termination reason: Unknown
% 0.21/0.55 % (25268)Termination phase: Saturation
% 0.21/0.55
% 0.21/0.55 % (25268)Memory used [KB]: 6396
% 0.21/0.55 % (25268)Time elapsed: 0.049 s
% 0.21/0.55 % (25268)Instructions burned: 86 (million)
% 0.21/0.55 % (25268)------------------------------
% 0.21/0.55 % (25268)------------------------------
% 0.21/0.55 % (25264)Instruction limit reached!
% 0.21/0.55 % (25264)------------------------------
% 0.21/0.55 % (25264)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.55 % (25264)Termination reason: Unknown
% 0.21/0.55 % (25264)Termination phase: Saturation
% 0.21/0.55
% 0.21/0.55 % (25264)Memory used [KB]: 6396
% 0.21/0.55 % (25264)Time elapsed: 0.086 s
% 0.21/0.55 % (25264)Instructions burned: 129 (million)
% 0.21/0.55 % (25264)------------------------------
% 0.21/0.55 % (25264)------------------------------
% 0.21/0.56 % (25270)lrs+2_1:1024_cnfonf=lazy_gen:fe=off:hud=15:plsq=on:plsqc=1:plsqr=32,1:i=39:si=on:rtra=on_0 on theBenchmark for (2998ds/39Mi)
% 1.64/0.57 % (25269)Instruction limit reached!
% 1.64/0.57 % (25269)------------------------------
% 1.64/0.57 % (25269)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.64/0.57 % (25269)Termination reason: Unknown
% 1.64/0.57 % (25269)Termination phase: Saturation
% 1.64/0.57
% 1.64/0.57 % (25269)Memory used [KB]: 6396
% 1.64/0.57 % (25269)Time elapsed: 0.065 s
% 1.64/0.57 % (25269)Instructions burned: 108 (million)
% 1.64/0.57 % (25269)------------------------------
% 1.64/0.57 % (25269)------------------------------
% 1.64/0.57 % (25257)Refutation not found, non-redundant clauses discarded% (25257)------------------------------
% 1.64/0.57 % (25257)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.64/0.57 % (25257)Termination reason: Refutation not found, non-redundant clauses discarded
% 1.64/0.57
% 1.64/0.57 % (25257)Memory used [KB]: 6780
% 1.64/0.57 % (25257)Time elapsed: 0.120 s
% 1.64/0.57 % (25257)Instructions burned: 373 (million)
% 1.64/0.57 % (25257)------------------------------
% 1.64/0.57 % (25257)------------------------------
% 1.64/0.57 % (25271)dis+10_1:1_cnfonf=lazy_not_gen:fsr=off:kws=precedence:nwc=5.0:s2a=on:ss=axioms:st=1.5:i=448:si=on:rtra=on_0 on theBenchmark for (2998ds/448Mi)
% 1.64/0.57 % (25270)Instruction limit reached!
% 1.64/0.57 % (25270)------------------------------
% 1.64/0.57 % (25270)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.64/0.57 % (25270)Termination reason: Unknown
% 1.64/0.57 % (25270)Termination phase: Saturation
% 1.64/0.57
% 1.64/0.57 % (25270)Memory used [KB]: 5884
% 1.64/0.57 % (25270)Time elapsed: 0.013 s
% 1.64/0.57 % (25270)Instructions burned: 41 (million)
% 1.64/0.57 % (25270)------------------------------
% 1.64/0.57 % (25270)------------------------------
% 1.64/0.58 % (25272)lrs+10_1:512_au=on:fde=unused:lma=on:nm=32:plsq=on:plsqc=1:plsqr=16121663,131072:sfv=off:sp=const_max:ss=axioms:st=3.0:tgt=full:i=46:si=on:rtra=on_0 on theBenchmark for (2997ds/46Mi)
% 1.77/0.58 % (25273)lrs+10_1:10_au=on:av=off:cbe=off:cnfonf=lazy_pi_sigma_gen:ntd=on:plsq=on:plsqc=1:plsqr=32,1:i=98:si=on:rtra=on_0 on theBenchmark for (2997ds/98Mi)
% 1.77/0.58 % (25274)ott+1002_1:1_apa=on:au=on:bd=off:cnfonf=off:fd=off:sos=on:sp=weighted_frequency:i=507:si=on:rtra=on_0 on theBenchmark for (2997ds/507Mi)
% 1.77/0.59 % (25272)Instruction limit reached!
% 1.77/0.59 % (25272)------------------------------
% 1.77/0.59 % (25272)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.77/0.59 % (25272)Termination reason: Unknown
% 1.77/0.59 % (25272)Termination phase: Saturation
% 1.77/0.59
% 1.77/0.59 % (25272)Memory used [KB]: 5884
% 1.77/0.59 % (25272)Time elapsed: 0.040 s
% 1.77/0.59 % (25272)Instructions burned: 48 (million)
% 1.77/0.59 % (25272)------------------------------
% 1.77/0.59 % (25272)------------------------------
% 1.77/0.60 % (25274)Refutation not found, incomplete strategy
% 1.77/0.60 % (25274)------------------------------
% 1.77/0.60 % (25274)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.77/0.60 % (25274)Termination reason: Refutation not found, incomplete strategy
% 1.77/0.60
% 1.77/0.60
% 1.77/0.60 % (25274)Memory used [KB]: 6140
% 1.77/0.60 % (25274)Time elapsed: 0.015 s
% 1.77/0.60 % (25274)Instructions burned: 48 (million)
% 1.77/0.60 % (25274)------------------------------
% 1.77/0.60 % (25274)------------------------------
% 1.77/0.60 % (25275)dis+1010_2:3_amm=off:fd=preordered:ixr=off:nm=0:pe=on:piset=equals:prag=on:sac=on:tgt=ground:i=149:si=on:rtra=on_0 on theBenchmark for (2997ds/149Mi)
% 1.77/0.61 % (25276)lrs+21_1:16_au=on:bd=off:piset=and:i=39:si=on:rtra=on_0 on theBenchmark for (2997ds/39Mi)
% 1.77/0.61 % (25273)Instruction limit reached!
% 1.77/0.61 % (25273)------------------------------
% 1.77/0.61 % (25273)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.77/0.61 % (25273)Termination reason: Unknown
% 1.77/0.61 % (25273)Termination phase: Saturation
% 1.77/0.61
% 1.77/0.61 % (25273)Memory used [KB]: 1791
% 1.77/0.61 % (25273)Time elapsed: 0.053 s
% 1.77/0.61 % (25273)Instructions burned: 100 (million)
% 1.77/0.61 % (25273)------------------------------
% 1.77/0.61 % (25273)------------------------------
% 1.77/0.62 % (25277)lrs+1004_1:1_cnfonf=lazy_pi_sigma_gen:fe=off:gs=on:hud=10:prag=on:tnu=1:i=6:si=on:rtra=on_0 on theBenchmark for (2997ds/6Mi)
% 1.77/0.62 % (25276)Instruction limit reached!
% 1.77/0.62 % (25276)------------------------------
% 1.77/0.62 % (25276)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.77/0.62 % (25276)Termination reason: Unknown
% 1.77/0.62 % (25276)Termination phase: Saturation
% 1.77/0.62
% 1.77/0.62 % (25276)Memory used [KB]: 5884
% 1.77/0.62 % (25276)Time elapsed: 0.012 s
% 1.77/0.62 % (25276)Instructions burned: 40 (million)
% 1.77/0.62 % (25276)------------------------------
% 1.77/0.62 % (25276)------------------------------
% 1.77/0.62 % (25277)Instruction limit reached!
% 1.77/0.62 % (25277)------------------------------
% 1.77/0.62 % (25277)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.77/0.62 % (25277)Termination reason: Unknown
% 1.77/0.62 % (25277)Termination phase: shuffling
% 1.77/0.62
% 1.77/0.62 % (25277)Memory used [KB]: 1151
% 1.77/0.62 % (25277)Time elapsed: 0.003 s
% 1.77/0.62 % (25277)Instructions burned: 6 (million)
% 1.77/0.62 % (25277)------------------------------
% 1.77/0.62 % (25277)------------------------------
% 2.04/0.62 % (25279)dis+10_1:1_aac=none:cs=on:i=47:si=on:rtra=on_0 on theBenchmark for (2997ds/47Mi)
% 2.04/0.63 % (25278)dis+1002_1:1_aac=none:au=on:e2e=on:nm=2:nwc=10.0:sd=1:ss=axioms:st=3.0:i=1087:si=on:rtra=on_0 on theBenchmark for (2997ds/1087Mi)
% 2.04/0.64 % (25278)Refutation not found, incomplete strategy
% 2.04/0.64 % (25278)------------------------------
% 2.04/0.64 % (25278)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 2.04/0.64 % (25278)Termination reason: Refutation not found, incomplete strategy
% 2.04/0.64
% 2.04/0.64
% 2.04/0.64 % (25278)Memory used [KB]: 5756
% 2.04/0.64 % (25278)Time elapsed: 0.012 s
% 2.04/0.64 % (25278)Instructions burned: 32 (million)
% 2.04/0.64 % (25278)------------------------------
% 2.04/0.64 % (25278)------------------------------
% 2.04/0.64 % (25279)Instruction limit reached!
% 2.04/0.64 % (25279)------------------------------
% 2.04/0.64 % (25279)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 2.04/0.64 % (25279)Termination reason: Unknown
% 2.04/0.64 % (25279)Termination phase: Saturation
% 2.04/0.64
% 2.04/0.64 % (25279)Memory used [KB]: 5756
% 2.04/0.64 % (25279)Time elapsed: 0.014 s
% 2.04/0.64 % (25279)Instructions burned: 47 (million)
% 2.04/0.64 % (25279)------------------------------
% 2.04/0.64 % (25279)------------------------------
% 2.16/0.64 % (25275)Instruction limit reached!
% 2.16/0.64 % (25275)------------------------------
% 2.16/0.64 % (25275)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 2.16/0.64 % (25275)Termination reason: Unknown
% 2.16/0.64 % (25275)Termination phase: Saturation
% 2.16/0.64
% 2.16/0.64 % (25275)Memory used [KB]: 6524
% 2.16/0.64 % (25275)Time elapsed: 0.070 s
% 2.16/0.64 % (25275)Instructions burned: 151 (million)
% 2.16/0.64 % (25275)------------------------------
% 2.16/0.64 % (25275)------------------------------
% 2.16/0.65 % (25280)lrs+1010_1:128_av=off:cbe=off:cnfonf=lazy_simp:fsr=off:ntd=on:ss=axioms:st=1.5:i=44:si=on:rtra=on_0 on theBenchmark for (2997ds/44Mi)
% 2.16/0.65 % (25281)dis+10_1:1_av=off:bd=off:cnfonf=lazy_gen:fe=off:hud=10:plsq=on:plsqc=1:plsqr=32,1:prag=on:tnu=1:i=432:si=on:rtra=on_0 on theBenchmark for (2997ds/432Mi)
% 2.16/0.65 % (25282)lrs+10_7:1_cnfonf=lazy_gen:fe=off:nwc=5.0:plsq=on:i=62:si=on:rtra=on_0 on theBenchmark for (2997ds/62Mi)
% 2.16/0.66 % (25280)Instruction limit reached!
% 2.16/0.66 % (25280)------------------------------
% 2.16/0.66 % (25280)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 2.16/0.66 % (25280)Termination reason: Unknown
% 2.16/0.66 % (25280)Termination phase: Saturation
% 2.16/0.66
% 2.16/0.66 % (25280)Memory used [KB]: 1535
% 2.16/0.66 % (25280)Time elapsed: 0.015 s
% 2.16/0.66 % (25280)Instructions burned: 46 (million)
% 2.16/0.66 % (25280)------------------------------
% 2.16/0.66 % (25280)------------------------------
% 2.16/0.67 % (25258)First to succeed.
% 2.16/0.67 % (25283)lrs+1010_1:16_add=large:amm=off:anc=all_dependent:chr=on:fd=off:ins=2:sp=const_max:tnu=5:uhcvi=on:i=31:si=on:rtra=on_0 on theBenchmark for (2996ds/31Mi)
% 2.16/0.67 % (25282)Instruction limit reached!
% 2.16/0.67 % (25282)------------------------------
% 2.16/0.67 % (25282)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 2.16/0.67 % (25282)Termination reason: Unknown
% 2.16/0.67 % (25282)Termination phase: Saturation
% 2.16/0.67
% 2.16/0.67 % (25282)Memory used [KB]: 6140
% 2.16/0.67 % (25282)Time elapsed: 0.018 s
% 2.16/0.67 % (25282)Instructions burned: 63 (million)
% 2.16/0.67 % (25282)------------------------------
% 2.16/0.67 % (25282)------------------------------
% 2.16/0.67 % (25258)Refutation found. Thanks to Tanya!
% 2.16/0.67 % SZS status Theorem for theBenchmark
% 2.16/0.67 % SZS output start Proof for theBenchmark
% 2.16/0.67 thf(type_def_5, type, mu: $tType).
% 2.16/0.67 thf(func_def_0, type, mu: $tType).
% 2.16/0.67 thf(func_def_1, type, qmltpeq: mu > mu > $i > $o).
% 2.16/0.67 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 2.16/0.67 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 2.16/0.67 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 2.16/0.67 thf(func_def_6, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 2.16/0.67 thf(func_def_7, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 2.16/0.67 thf(func_def_8, type, mtrue: $i > $o).
% 2.16/0.67 thf(func_def_9, type, mfalse: $i > $o).
% 2.16/0.67 thf(func_def_10, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 2.16/0.67 thf(func_def_11, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 2.16/0.67 thf(func_def_12, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 2.16/0.67 thf(func_def_13, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 2.16/0.67 thf(func_def_14, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 2.16/0.67 thf(func_def_15, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 2.16/0.67 thf(func_def_16, type, exists_in_world: mu > $i > $o).
% 2.16/0.67 thf(func_def_17, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 2.16/0.67 thf(func_def_18, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 2.16/0.67 thf(func_def_19, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 2.16/0.67 thf(func_def_20, type, mreflexive: ($i > $i > $o) > $o).
% 2.16/0.67 thf(func_def_21, type, msymmetric: ($i > $i > $o) > $o).
% 2.16/0.67 thf(func_def_22, type, mserial: ($i > $i > $o) > $o).
% 2.16/0.67 thf(func_def_23, type, mtransitive: ($i > $i > $o) > $o).
% 2.16/0.67 thf(func_def_24, type, meuclidean: ($i > $i > $o) > $o).
% 2.16/0.67 thf(func_def_25, type, mpartially_functional: ($i > $i > $o) > $o).
% 2.16/0.67 thf(func_def_26, type, mfunctional: ($i > $i > $o) > $o).
% 2.16/0.67 thf(func_def_27, type, mweakly_dense: ($i > $i > $o) > $o).
% 2.16/0.67 thf(func_def_28, type, mweakly_connected: ($i > $i > $o) > $o).
% 2.16/0.67 thf(func_def_29, type, mweakly_directed: ($i > $i > $o) > $o).
% 2.16/0.67 thf(func_def_30, type, mvalid: ($i > $o) > $o).
% 2.16/0.67 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 2.16/0.67 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 2.16/0.67 thf(func_def_33, type, minvalid: ($i > $o) > $o).
% 2.16/0.67 thf(func_def_34, type, rel_s4: $i > $i > $o).
% 2.16/0.67 thf(func_def_35, type, mbox_s4: ($i > $o) > $i > $o).
% 2.16/0.67 thf(func_def_36, type, mdia_s4: ($i > $o) > $i > $o).
% 2.16/0.67 thf(func_def_37, type, empty: mu > $i > $o).
% 2.16/0.67 thf(func_def_38, type, subset: mu > mu > $i > $o).
% 2.16/0.67 thf(func_def_39, type, in: mu > mu > $i > $o).
% 2.16/0.67 thf(func_def_40, type, unordered_pair: mu > mu > mu).
% 2.16/0.67 thf(func_def_41, type, set_union2: mu > mu > mu).
% 2.16/0.67 thf(func_def_59, type, sK2: mu).
% 2.16/0.67 thf(func_def_60, type, sK3: mu).
% 2.16/0.67 thf(func_def_61, type, sK4: mu).
% 2.16/0.67 thf(func_def_62, type, sK5: $i > mu).
% 2.16/0.67 thf(f2265,plain,(
% 2.16/0.67 $false),
% 2.16/0.67 inference(trivial_inequality_removal,[],[f2256])).
% 2.16/0.67 thf(f2256,plain,(
% 2.16/0.67 ($false = $true)),
% 2.16/0.67 inference(backward_demodulation,[],[f506,f2235])).
% 2.16/0.67 thf(f2235,plain,(
% 2.16/0.67 ($false = (in @ sK4 @ sK3 @ sK1))),
% 2.16/0.67 inference(trivial_inequality_removal,[],[f2234])).
% 2.16/0.67 thf(f2234,plain,(
% 2.16/0.67 ($false = (in @ sK4 @ sK3 @ sK1)) | ($false = $true)),
% 2.16/0.67 inference(forward_demodulation,[],[f2233,f505])).
% 2.16/0.67 thf(f505,plain,(
% 2.16/0.67 ($true = (in @ sK2 @ sK3 @ sK1))),
% 2.16/0.67 inference(not_proxy_clausification,[],[f503])).
% 2.16/0.67 thf(f503,plain,(
% 2.16/0.67 ($false = (~ (in @ sK2 @ sK3 @ sK1)))),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f501])).
% 2.16/0.67 thf(f501,plain,(
% 2.16/0.67 ($false = ((~ (in @ sK4 @ sK3 @ sK1)) | (~ (in @ sK2 @ sK3 @ sK1))))),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f499])).
% 2.16/0.67 thf(f499,plain,(
% 2.16/0.67 ($false = ((qmltpeq @ (set_union2 @ (unordered_pair @ sK2 @ sK4) @ sK3) @ sK3 @ sK1) | ((~ (in @ sK4 @ sK3 @ sK1)) | (~ (in @ sK2 @ sK3 @ sK1)))))),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f498])).
% 2.16/0.67 thf(f498,plain,(
% 2.16/0.67 ($false = ((exists_in_world @ sK4 @ sK1) => ((qmltpeq @ (set_union2 @ (unordered_pair @ sK2 @ sK4) @ sK3) @ sK3 @ sK1) | ((~ (in @ sK4 @ sK3 @ sK1)) | (~ (in @ sK2 @ sK3 @ sK1))))))),
% 2.16/0.67 inference(beta_eta_normalization,[],[f497])).
% 2.16/0.67 thf(f497,plain,(
% 2.16/0.67 ($false = ((^[Y0 : mu]: ((exists_in_world @ Y0 @ sK1) => ((qmltpeq @ (set_union2 @ (unordered_pair @ sK2 @ Y0) @ sK3) @ sK3 @ sK1) | ((~ (in @ Y0 @ sK3 @ sK1)) | (~ (in @ sK2 @ sK3 @ sK1)))))) @ sK4))),
% 2.16/0.67 inference(sigma_clausification,[],[f495])).
% 2.16/0.67 thf(f495,plain,(
% 2.16/0.67 ($false = (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ sK1) => ((qmltpeq @ (set_union2 @ (unordered_pair @ sK2 @ Y0) @ sK3) @ sK3 @ sK1) | ((~ (in @ Y0 @ sK3 @ sK1)) | (~ (in @ sK2 @ sK3 @ sK1))))))))),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f494])).
% 2.16/0.67 thf(f494,plain,(
% 2.16/0.67 ($false = ((exists_in_world @ sK3 @ sK1) => (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ sK1) => ((qmltpeq @ (set_union2 @ (unordered_pair @ sK2 @ Y0) @ sK3) @ sK3 @ sK1) | ((~ (in @ Y0 @ sK3 @ sK1)) | (~ (in @ sK2 @ sK3 @ sK1)))))))))),
% 2.16/0.67 inference(beta_eta_normalization,[],[f493])).
% 2.16/0.67 thf(f493,plain,(
% 2.16/0.67 ($false = ((^[Y0 : mu]: ((exists_in_world @ Y0 @ sK1) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ sK1) => ((qmltpeq @ (set_union2 @ (unordered_pair @ sK2 @ Y1) @ Y0) @ Y0 @ sK1) | ((~ (in @ Y1 @ Y0 @ sK1)) | (~ (in @ sK2 @ Y0 @ sK1))))))))) @ sK3))),
% 2.16/0.67 inference(sigma_clausification,[],[f491])).
% 2.16/0.67 thf(f491,plain,(
% 2.16/0.67 ($false = (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ sK1) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ sK1) => ((qmltpeq @ (set_union2 @ (unordered_pair @ sK2 @ Y1) @ Y0) @ Y0 @ sK1) | ((~ (in @ Y1 @ Y0 @ sK1)) | (~ (in @ sK2 @ Y0 @ sK1)))))))))))),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f490])).
% 2.16/0.67 thf(f490,plain,(
% 2.16/0.67 ($false = ((exists_in_world @ sK2 @ sK1) => (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ sK1) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ sK1) => ((qmltpeq @ (set_union2 @ (unordered_pair @ sK2 @ Y1) @ Y0) @ Y0 @ sK1) | ((~ (in @ Y1 @ Y0 @ sK1)) | (~ (in @ sK2 @ Y0 @ sK1))))))))))))),
% 2.16/0.67 inference(beta_eta_normalization,[],[f489])).
% 2.16/0.67 thf(f489,plain,(
% 2.16/0.67 ($false = ((^[Y0 : mu]: ((exists_in_world @ Y0 @ sK1) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ sK1) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ sK1) => ((qmltpeq @ (set_union2 @ (unordered_pair @ Y0 @ Y2) @ Y1) @ Y1 @ sK1) | ((~ (in @ Y2 @ Y1 @ sK1)) | (~ (in @ Y0 @ Y1 @ sK1)))))))))))) @ sK2))),
% 2.16/0.67 inference(sigma_clausification,[],[f488])).
% 2.16/0.67 thf(f488,plain,(
% 2.16/0.67 ($false = (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ sK1) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ sK1) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ sK1) => ((qmltpeq @ (set_union2 @ (unordered_pair @ Y0 @ Y2) @ Y1) @ Y1 @ sK1) | ((~ (in @ Y2 @ Y1 @ sK1)) | (~ (in @ Y0 @ Y1 @ sK1))))))))))))))),
% 2.16/0.67 inference(beta_eta_normalization,[],[f487])).
% 2.16/0.67 thf(f487,plain,(
% 2.16/0.67 ($false = ((^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => ((qmltpeq @ (set_union2 @ (unordered_pair @ Y1 @ Y3) @ Y2) @ Y2 @ Y0) | ((~ (in @ Y3 @ Y2 @ Y0)) | (~ (in @ Y1 @ Y2 @ Y0)))))))))))))) @ sK1))),
% 2.16/0.67 inference(sigma_clausification,[],[f486])).
% 2.16/0.67 thf(f486,plain,(
% 2.16/0.67 ($false = (!! @ $i @ (^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => ((qmltpeq @ (set_union2 @ (unordered_pair @ Y1 @ Y3) @ Y2) @ Y2 @ Y0) | ((~ (in @ Y3 @ Y2 @ Y0)) | (~ (in @ Y1 @ Y2 @ Y0))))))))))))))))),
% 2.16/0.67 inference(not_proxy_clausification,[],[f264])).
% 2.16/0.67 thf(f264,plain,(
% 2.16/0.67 ($true = (~ (!! @ $i @ (^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => ((qmltpeq @ (set_union2 @ (unordered_pair @ Y1 @ Y3) @ Y2) @ Y2 @ Y0) | ((~ (in @ Y3 @ Y2 @ Y0)) | (~ (in @ Y1 @ Y2 @ Y0)))))))))))))))))),
% 2.16/0.67 inference(boolean_simplification,[],[f263])).
% 2.16/0.67 thf(f263,plain,(
% 2.16/0.67 ($true = (~ (!! @ $i @ (^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => ((qmltpeq @ (set_union2 @ (unordered_pair @ Y1 @ Y3) @ Y2) @ Y2 @ Y0) | (~ (~ ((~ (in @ Y3 @ Y2 @ Y0)) | (~ (in @ Y1 @ Y2 @ Y0)))))))))))))))))))),
% 2.16/0.67 inference(beta_eta_normalization,[],[f245])).
% 2.16/0.67 thf(f245,plain,(
% 2.16/0.67 ((~ ((^[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 : 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)))) @ ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: (~ (Y5 @ Y6))))) @ ((^[Y5 : $i > $o]: ((^[Y6 : $i > $o]: ((^[Y7 : $i]: ((Y6 @ Y7) | (Y5 @ Y7))))))) @ ((^[Y5 : $i > $o]: ((^[Y6 : $i]: (~ (Y5 @ Y6))))) @ Y3) @ ((^[Y5 : $i > $o]: ((^[Y6 : $i]: (~ (Y5 @ Y6))))) @ Y4)))))) @ (in @ Y0 @ Y1) @ (in @ Y2 @ Y1)) @ (qmltpeq @ (set_union2 @ (unordered_pair @ Y0 @ Y2) @ Y1) @ Y1)))))))))) = $true)),
% 2.16/0.67 inference(definition_unfolding,[],[f200,f188,f206,f206,f206,f233,f232])).
% 2.16/0.67 thf(f232,plain,(
% 2.16/0.67 (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)))))))),
% 2.16/0.67 inference(definition_unfolding,[],[f194,f199,f219,f199,f199])).
% 2.16/0.67 thf(f219,plain,(
% 2.16/0.67 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 2.16/0.67 inference(cnf_transformation,[],[f88])).
% 2.16/0.67 thf(f88,plain,(
% 2.16/0.67 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 2.16/0.67 inference(fool_elimination,[],[f87])).
% 2.16/0.67 thf(f87,plain,(
% 2.16/0.67 (mor = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))))),
% 2.16/0.67 inference(rectify,[],[f3])).
% 2.16/0.67 thf(f3,axiom,(
% 2.16/0.67 (mor = (^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X3 @ X2) | (X4 @ X2))))),
% 2.16/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor)).
% 2.16/0.67 thf(f199,plain,(
% 2.16/0.67 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 2.16/0.67 inference(cnf_transformation,[],[f82])).
% 2.16/0.67 thf(f82,plain,(
% 2.16/0.67 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 2.16/0.67 inference(fool_elimination,[],[f81])).
% 2.16/0.67 thf(f81,plain,(
% 2.16/0.67 (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 2.16/0.67 inference(rectify,[],[f2])).
% 2.16/0.67 thf(f2,axiom,(
% 2.16/0.67 (mnot = (^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))))),
% 2.16/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot)).
% 2.16/0.67 thf(f194,plain,(
% 2.16/0.67 (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mor @ (mnot @ Y0) @ (mnot @ Y1)))))))),
% 2.16/0.67 inference(cnf_transformation,[],[f92])).
% 2.16/0.67 thf(f92,plain,(
% 2.16/0.67 (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mor @ (mnot @ Y0) @ (mnot @ Y1)))))))),
% 2.16/0.67 inference(fool_elimination,[],[f91])).
% 2.16/0.67 thf(f91,plain,(
% 2.16/0.67 ((^[X0 : $i > $o, X1 : $i > $o] : (mnot @ (mor @ (mnot @ X0) @ (mnot @ X1)))) = mand)),
% 2.16/0.67 inference(rectify,[],[f8])).
% 2.16/0.67 thf(f8,axiom,(
% 2.16/0.67 ((^[X3 : $i > $o, X4 : $i > $o] : (mnot @ (mor @ (mnot @ X3) @ (mnot @ X4)))) = mand)),
% 2.16/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mand)).
% 2.16/0.67 thf(f233,plain,(
% 2.16/0.67 (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)))))),
% 2.16/0.67 inference(definition_unfolding,[],[f204,f219,f199])).
% 2.16/0.67 thf(f204,plain,(
% 2.16/0.67 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 2.16/0.67 inference(cnf_transformation,[],[f178])).
% 2.16/0.67 thf(f178,plain,(
% 2.16/0.67 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 2.16/0.67 inference(fool_elimination,[],[f177])).
% 2.16/0.67 thf(f177,plain,(
% 2.16/0.67 (mimplies = (^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)))),
% 2.16/0.67 inference(rectify,[],[f9])).
% 2.16/0.67 thf(f9,axiom,(
% 2.16/0.67 (mimplies = (^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)))),
% 2.16/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimplies)).
% 2.16/0.67 thf(f206,plain,(
% 2.16/0.67 (mforall_ind = (^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (Y0 @ Y2 @ Y1))))))))),
% 2.16/0.67 inference(cnf_transformation,[],[f68])).
% 2.16/0.67 thf(f68,plain,(
% 2.16/0.67 (mforall_ind = (^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (Y0 @ Y2 @ Y1))))))))),
% 2.16/0.67 inference(fool_elimination,[],[f67])).
% 2.16/0.67 thf(f67,plain,(
% 2.16/0.67 (mforall_ind = (^[X0 : mu > $i > $o, X1 : $i] : (! [X2 : mu] : ((exists_in_world @ X2 @ X1) => (X0 @ X2 @ X1)))))),
% 2.16/0.67 inference(rectify,[],[f15])).
% 2.16/0.67 thf(f15,axiom,(
% 2.16/0.67 (mforall_ind = (^[X3 : mu > $i > $o, X2 : $i] : (! [X0 : mu] : ((exists_in_world @ X0 @ X2) => (X3 @ X0 @ X2)))))),
% 2.16/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mforall_ind)).
% 2.16/0.67 thf(f188,plain,(
% 2.16/0.67 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 2.16/0.67 inference(cnf_transformation,[],[f152])).
% 2.16/0.67 thf(f152,plain,(
% 2.16/0.67 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 2.16/0.67 inference(fool_elimination,[],[f151])).
% 2.16/0.67 thf(f151,plain,(
% 2.16/0.67 ((^[X0 : $i > $o] : (! [X1] : (X0 @ X1))) = mvalid)),
% 2.16/0.67 inference(rectify,[],[f28])).
% 2.16/0.67 thf(f28,axiom,(
% 2.16/0.67 ((^[X3 : $i > $o] : (! [X2] : (X3 @ X2))) = mvalid)),
% 2.16/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 2.16/0.67 thf(f200,plain,(
% 2.16/0.67 ($true = (~ (mvalid @ (mforall_ind @ (^[Y0 : mu]: (mforall_ind @ (^[Y1 : mu]: (mforall_ind @ (^[Y2 : mu]: (mimplies @ (mand @ (in @ Y0 @ Y1) @ (in @ Y2 @ Y1)) @ (qmltpeq @ (set_union2 @ (unordered_pair @ Y0 @ Y2) @ Y1) @ Y1)))))))))))),
% 2.16/0.67 inference(cnf_transformation,[],[f134])).
% 2.16/0.67 thf(f134,plain,(
% 2.16/0.67 ($true = (~ (mvalid @ (mforall_ind @ (^[Y0 : mu]: (mforall_ind @ (^[Y1 : mu]: (mforall_ind @ (^[Y2 : mu]: (mimplies @ (mand @ (in @ Y0 @ Y1) @ (in @ Y2 @ Y1)) @ (qmltpeq @ (set_union2 @ (unordered_pair @ Y0 @ Y2) @ Y1) @ Y1)))))))))))),
% 2.16/0.67 inference(fool_elimination,[],[f133])).
% 2.16/0.67 thf(f133,plain,(
% 2.16/0.67 ~(mvalid @ (mforall_ind @ (^[X0 : mu] : (mforall_ind @ (^[X1 : mu] : (mforall_ind @ (^[X2 : mu] : (mimplies @ (mand @ (in @ X0 @ X1) @ (in @ X2 @ X1)) @ (qmltpeq @ (set_union2 @ (unordered_pair @ X0 @ X2) @ X1) @ X1)))))))))),
% 2.16/0.67 inference(rectify,[],[f63])).
% 2.16/0.67 thf(f63,negated_conjecture,(
% 2.16/0.67 ~(mvalid @ (mforall_ind @ (^[X14 : mu] : (mforall_ind @ (^[X15 : mu] : (mforall_ind @ (^[X16 : mu] : (mimplies @ (mand @ (in @ X14 @ X15) @ (in @ X16 @ X15)) @ (qmltpeq @ (set_union2 @ (unordered_pair @ X14 @ X16) @ X15) @ X15)))))))))),
% 2.16/0.67 inference(negated_conjecture,[],[f62])).
% 2.16/0.67 thf(f62,conjecture,(
% 2.16/0.67 (mvalid @ (mforall_ind @ (^[X14 : mu] : (mforall_ind @ (^[X15 : mu] : (mforall_ind @ (^[X16 : mu] : (mimplies @ (mand @ (in @ X14 @ X15) @ (in @ X16 @ X15)) @ (qmltpeq @ (set_union2 @ (unordered_pair @ X14 @ X16) @ X15) @ X15)))))))))),
% 2.16/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t48_zfmisc_1)).
% 2.16/0.67 thf(f2233,plain,(
% 2.16/0.67 ($false = (in @ sK4 @ sK3 @ sK1)) | ($false = (in @ sK2 @ sK3 @ sK1))),
% 2.16/0.67 inference(trivial_inequality_removal,[],[f2232])).
% 2.16/0.67 thf(f2232,plain,(
% 2.16/0.67 ($false = (in @ sK2 @ sK3 @ sK1)) | ($false = (in @ sK4 @ sK3 @ sK1)) | ($false = $true)),
% 2.16/0.67 inference(forward_demodulation,[],[f2231,f492])).
% 2.16/0.67 thf(f492,plain,(
% 2.16/0.67 ($true = (exists_in_world @ sK2 @ sK1))),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f490])).
% 2.16/0.67 thf(f2231,plain,(
% 2.16/0.67 ($false = (in @ sK4 @ sK3 @ sK1)) | ($false = (exists_in_world @ sK2 @ sK1)) | ($false = (in @ sK2 @ sK3 @ sK1))),
% 2.16/0.67 inference(trivial_inequality_removal,[],[f2230])).
% 2.16/0.67 thf(f2230,plain,(
% 2.16/0.67 ($false = (exists_in_world @ sK2 @ sK1)) | ($false = (in @ sK2 @ sK3 @ sK1)) | ($false = (in @ sK4 @ sK3 @ sK1)) | ($false = $true)),
% 2.16/0.67 inference(forward_demodulation,[],[f2229,f496])).
% 2.16/0.67 thf(f496,plain,(
% 2.16/0.67 ($true = (exists_in_world @ sK3 @ sK1))),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f494])).
% 2.16/0.67 thf(f2229,plain,(
% 2.16/0.67 ($false = (in @ sK4 @ sK3 @ sK1)) | ($false = (exists_in_world @ sK3 @ sK1)) | ($false = (in @ sK2 @ sK3 @ sK1)) | ($false = (exists_in_world @ sK2 @ sK1))),
% 2.16/0.67 inference(trivial_inequality_removal,[],[f2228])).
% 2.16/0.67 thf(f2228,plain,(
% 2.16/0.67 ($false = $true) | ($false = (in @ sK2 @ sK3 @ sK1)) | ($false = (in @ sK4 @ sK3 @ sK1)) | ($false = (exists_in_world @ sK2 @ sK1)) | ($false = (exists_in_world @ sK3 @ sK1))),
% 2.16/0.67 inference(forward_demodulation,[],[f2225,f500])).
% 2.16/0.67 thf(f500,plain,(
% 2.16/0.67 ($true = (exists_in_world @ sK4 @ sK1))),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f498])).
% 2.16/0.67 thf(f2225,plain,(
% 2.16/0.67 ($false = (in @ sK4 @ sK3 @ sK1)) | ($false = (exists_in_world @ sK4 @ sK1)) | ($false = (exists_in_world @ sK2 @ sK1)) | ($false = (exists_in_world @ sK3 @ sK1)) | ($false = (in @ sK2 @ sK3 @ sK1))),
% 2.16/0.67 inference(trivial_inequality_removal,[],[f2204])).
% 2.16/0.67 thf(f2204,plain,(
% 2.16/0.67 ($false = $true) | ($false = (in @ sK4 @ sK3 @ sK1)) | ($false = (exists_in_world @ sK2 @ sK1)) | ($false = (exists_in_world @ sK4 @ sK1)) | ($false = (exists_in_world @ sK3 @ sK1)) | ($false = (in @ sK2 @ sK3 @ sK1))),
% 2.16/0.67 inference(superposition,[],[f550,f677])).
% 2.16/0.67 thf(f677,plain,(
% 2.16/0.67 ($false = (subset @ (unordered_pair @ sK2 @ sK4) @ sK3 @ sK1))),
% 2.16/0.67 inference(trivial_inequality_removal,[],[f676])).
% 2.16/0.67 thf(f676,plain,(
% 2.16/0.67 ($false = $true) | ($false = (subset @ (unordered_pair @ sK2 @ sK4) @ sK3 @ sK1))),
% 2.16/0.67 inference(forward_demodulation,[],[f675,f496])).
% 2.16/0.67 thf(f675,plain,(
% 2.16/0.67 ($false = (subset @ (unordered_pair @ sK2 @ sK4) @ sK3 @ sK1)) | ($false = (exists_in_world @ sK3 @ sK1))),
% 2.16/0.67 inference(trivial_inequality_removal,[],[f674])).
% 2.16/0.67 thf(f674,plain,(
% 2.16/0.67 ($false = $true) | ($false = (exists_in_world @ sK3 @ sK1)) | ($false = (subset @ (unordered_pair @ sK2 @ sK4) @ sK3 @ sK1))),
% 2.16/0.67 inference(forward_demodulation,[],[f665,f321])).
% 2.16/0.67 thf(f321,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($true = (exists_in_world @ (unordered_pair @ X3 @ X2) @ X1))) )),
% 2.16/0.67 inference(beta_eta_normalization,[],[f320])).
% 2.16/0.67 thf(f320,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($true = ((^[Y0 : mu]: (exists_in_world @ (unordered_pair @ Y0 @ X2) @ X1)) @ X3))) )),
% 2.16/0.67 inference(pi_clausification,[],[f319])).
% 2.16/0.67 thf(f319,plain,(
% 2.16/0.67 ( ! [X2 : mu,X1 : $i] : (((!! @ mu @ (^[Y0 : mu]: (exists_in_world @ (unordered_pair @ Y0 @ X2) @ X1))) = $true)) )),
% 2.16/0.67 inference(beta_eta_normalization,[],[f318])).
% 2.16/0.67 thf(f318,plain,(
% 2.16/0.67 ( ! [X2 : mu,X1 : $i] : (($true = ((^[Y0 : mu]: (!! @ mu @ (^[Y1 : mu]: (exists_in_world @ (unordered_pair @ Y1 @ Y0) @ X1)))) @ X2))) )),
% 2.16/0.67 inference(pi_clausification,[],[f317])).
% 2.16/0.67 thf(f317,plain,(
% 2.16/0.67 ( ! [X1 : $i] : (($true = (!! @ mu @ (^[Y0 : mu]: (!! @ mu @ (^[Y1 : mu]: (exists_in_world @ (unordered_pair @ Y1 @ Y0) @ X1))))))) )),
% 2.16/0.67 inference(beta_eta_normalization,[],[f316])).
% 2.16/0.67 thf(f316,plain,(
% 2.16/0.67 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: (!! @ mu @ (^[Y2 : mu]: (exists_in_world @ (unordered_pair @ Y2 @ Y1) @ Y0)))))) @ X1) = $true)) )),
% 2.16/0.67 inference(pi_clausification,[],[f189])).
% 2.16/0.67 thf(f189,plain,(
% 2.16/0.67 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: (!! @ mu @ (^[Y2 : mu]: (exists_in_world @ (unordered_pair @ Y2 @ Y1) @ Y0))))))))),
% 2.16/0.67 inference(cnf_transformation,[],[f96])).
% 2.16/0.67 thf(f96,plain,(
% 2.16/0.67 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: (!! @ mu @ (^[Y2 : mu]: (exists_in_world @ (unordered_pair @ Y2 @ Y1) @ Y0))))))))),
% 2.16/0.67 inference(fool_elimination,[],[f95])).
% 2.16/0.67 thf(f95,plain,(
% 2.16/0.67 ! [X0 : mu,X1 : mu,X2] : (exists_in_world @ (unordered_pair @ X0 @ X1) @ X2)),
% 2.16/0.67 inference(rectify,[],[f37])).
% 2.16/0.67 thf(f37,axiom,(
% 2.16/0.67 ! [X11 : mu,X12 : mu,X6] : (exists_in_world @ (unordered_pair @ X11 @ X12) @ X6)),
% 2.16/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_unordered_pair_ax)).
% 2.16/0.67 thf(f665,plain,(
% 2.16/0.67 ($false = (exists_in_world @ (unordered_pair @ sK2 @ sK4) @ sK1)) | ($false = (subset @ (unordered_pair @ sK2 @ sK4) @ sK3 @ sK1)) | ($false = (exists_in_world @ sK3 @ sK1))),
% 2.16/0.67 inference(trivial_inequality_removal,[],[f661])).
% 2.16/0.67 thf(f661,plain,(
% 2.16/0.67 ($false = $true) | ($false = (exists_in_world @ sK3 @ sK1)) | ($false = (subset @ (unordered_pair @ sK2 @ sK4) @ sK3 @ sK1)) | ($false = (exists_in_world @ (unordered_pair @ sK2 @ sK4) @ sK1))),
% 2.16/0.67 inference(superposition,[],[f485,f502])).
% 2.16/0.67 thf(f502,plain,(
% 2.16/0.67 ($false = (qmltpeq @ (set_union2 @ (unordered_pair @ sK2 @ sK4) @ sK3) @ sK3 @ sK1))),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f499])).
% 2.16/0.67 thf(f485,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((qmltpeq @ (set_union2 @ X2 @ X3) @ X3 @ X1) = $true) | ($false = (subset @ X2 @ X3 @ X1)) | ($false = (exists_in_world @ X2 @ X1)) | ($false = (exists_in_world @ X3 @ X1))) )),
% 2.16/0.67 inference(not_proxy_clausification,[],[f484])).
% 2.16/0.67 thf(f484,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((~ (subset @ X2 @ X3 @ X1)) = $true) | ($false = (exists_in_world @ X2 @ X1)) | ($false = (exists_in_world @ X3 @ X1)) | ((qmltpeq @ (set_union2 @ X2 @ X3) @ X3 @ X1) = $true)) )),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f483])).
% 2.16/0.67 thf(f483,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i] : ((((qmltpeq @ (set_union2 @ X2 @ X3) @ X3 @ X1) | (~ (subset @ X2 @ X3 @ X1))) = $true) | ($false = (exists_in_world @ X3 @ X1)) | ($false = (exists_in_world @ X2 @ X1))) )),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f482])).
% 2.16/0.67 thf(f482,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($false = (exists_in_world @ X2 @ X1)) | ($true = ((exists_in_world @ X3 @ X1) => ((qmltpeq @ (set_union2 @ X2 @ X3) @ X3 @ X1) | (~ (subset @ X2 @ X3 @ X1)))))) )),
% 2.16/0.67 inference(beta_eta_normalization,[],[f481])).
% 2.16/0.67 thf(f481,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i] : ((((^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((qmltpeq @ (set_union2 @ X2 @ Y0) @ Y0 @ X1) | (~ (subset @ X2 @ Y0 @ X1))))) @ X3) = $true) | ($false = (exists_in_world @ X2 @ X1))) )),
% 2.16/0.67 inference(pi_clausification,[],[f480])).
% 2.16/0.67 thf(f480,plain,(
% 2.16/0.67 ( ! [X2 : mu,X1 : $i] : (($false = (exists_in_world @ X2 @ X1)) | ($true = (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((qmltpeq @ (set_union2 @ X2 @ Y0) @ Y0 @ X1) | (~ (subset @ X2 @ Y0 @ X1)))))))) )),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f479])).
% 2.16/0.67 thf(f479,plain,(
% 2.16/0.67 ( ! [X2 : mu,X1 : $i] : (($true = ((exists_in_world @ X2 @ X1) => (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((qmltpeq @ (set_union2 @ X2 @ Y0) @ Y0 @ X1) | (~ (subset @ X2 @ Y0 @ X1))))))))) )),
% 2.16/0.67 inference(beta_eta_normalization,[],[f478])).
% 2.16/0.67 thf(f478,plain,(
% 2.16/0.67 ( ! [X2 : mu,X1 : $i] : ((((^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => ((qmltpeq @ (set_union2 @ Y0 @ Y1) @ Y1 @ X1) | (~ (subset @ Y0 @ Y1 @ X1)))))))) @ X2) = $true)) )),
% 2.16/0.67 inference(pi_clausification,[],[f477])).
% 2.16/0.67 thf(f477,plain,(
% 2.16/0.67 ( ! [X1 : $i] : (($true = (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => ((qmltpeq @ (set_union2 @ Y0 @ Y1) @ Y1 @ X1) | (~ (subset @ Y0 @ Y1 @ X1))))))))))) )),
% 2.16/0.67 inference(beta_eta_normalization,[],[f476])).
% 2.16/0.67 thf(f476,plain,(
% 2.16/0.67 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => ((qmltpeq @ (set_union2 @ Y1 @ Y2) @ Y2 @ Y0) | (~ (subset @ Y1 @ Y2 @ Y0)))))))))) @ X1) = $true)) )),
% 2.16/0.67 inference(pi_clausification,[],[f265])).
% 2.16/0.67 thf(f265,plain,(
% 2.16/0.67 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => ((qmltpeq @ (set_union2 @ Y1 @ Y2) @ Y2 @ Y0) | (~ (subset @ Y1 @ Y2 @ Y0))))))))))))),
% 2.16/0.67 inference(beta_eta_normalization,[],[f249])).
% 2.16/0.67 thf(f249,plain,(
% 2.16/0.67 (((^[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]: ((Y5 @ Y6) | (Y4 @ Y6))))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y2) @ Y3)))) @ (subset @ Y0 @ Y1) @ (qmltpeq @ (set_union2 @ Y0 @ Y1) @ Y1))))))) = $true)),
% 2.16/0.67 inference(definition_unfolding,[],[f207,f188,f206,f206,f233])).
% 2.16/0.67 thf(f207,plain,(
% 2.16/0.67 ((mvalid @ (mforall_ind @ (^[Y0 : mu]: (mforall_ind @ (^[Y1 : mu]: (mimplies @ (subset @ Y0 @ Y1) @ (qmltpeq @ (set_union2 @ Y0 @ Y1) @ Y1))))))) = $true)),
% 2.16/0.67 inference(cnf_transformation,[],[f128])).
% 2.16/0.67 thf(f128,plain,(
% 2.16/0.67 ((mvalid @ (mforall_ind @ (^[Y0 : mu]: (mforall_ind @ (^[Y1 : mu]: (mimplies @ (subset @ Y0 @ Y1) @ (qmltpeq @ (set_union2 @ Y0 @ Y1) @ Y1))))))) = $true)),
% 2.16/0.67 inference(fool_elimination,[],[f127])).
% 2.16/0.67 thf(f127,plain,(
% 2.16/0.67 (mvalid @ (mforall_ind @ (^[X0 : mu] : (mforall_ind @ (^[X1 : mu] : (mimplies @ (subset @ X0 @ X1) @ (qmltpeq @ (set_union2 @ X0 @ X1) @ X1)))))))),
% 2.16/0.67 inference(rectify,[],[f60])).
% 2.16/0.67 thf(f60,axiom,(
% 2.16/0.67 (mvalid @ (mforall_ind @ (^[X14 : mu] : (mforall_ind @ (^[X15 : mu] : (mimplies @ (subset @ X14 @ X15) @ (qmltpeq @ (set_union2 @ X14 @ X15) @ X15)))))))),
% 2.16/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_xboole_1)).
% 2.16/0.67 thf(f550,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i,X4 : mu] : (((subset @ (unordered_pair @ X2 @ X3) @ X4 @ X1) = $true) | ($false = (exists_in_world @ X4 @ X1)) | ($false = (exists_in_world @ X2 @ X1)) | ($false = (in @ X3 @ X4 @ X1)) | ($false = (in @ X2 @ X4 @ X1)) | ($false = (exists_in_world @ X3 @ X1))) )),
% 2.16/0.67 inference(not_proxy_clausification,[],[f549])).
% 2.16/0.67 thf(f549,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i,X4 : mu] : (($false = (in @ X3 @ X4 @ X1)) | ((subset @ (unordered_pair @ X2 @ X3) @ X4 @ X1) = $true) | ($false = (exists_in_world @ X3 @ X1)) | ($false = (exists_in_world @ X4 @ X1)) | ($false = (exists_in_world @ X2 @ X1)) | ($true = (~ (in @ X2 @ X4 @ X1)))) )),
% 2.16/0.67 inference(not_proxy_clausification,[],[f548])).
% 2.16/0.67 thf(f548,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i,X4 : mu] : (($false = (exists_in_world @ X4 @ X1)) | ($true = (~ (in @ X3 @ X4 @ X1))) | ($false = (exists_in_world @ X3 @ X1)) | ($true = (~ (in @ X2 @ X4 @ X1))) | ((subset @ (unordered_pair @ X2 @ X3) @ X4 @ X1) = $true) | ($false = (exists_in_world @ X2 @ X1))) )),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f547])).
% 2.16/0.67 thf(f547,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i,X4 : mu] : (((subset @ (unordered_pair @ X2 @ X3) @ X4 @ X1) = $true) | ($false = (exists_in_world @ X3 @ X1)) | ($false = (exists_in_world @ X2 @ X1)) | ($false = (exists_in_world @ X4 @ X1)) | ($true = ((~ (in @ X3 @ X4 @ X1)) | (~ (in @ X2 @ X4 @ X1))))) )),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f546])).
% 2.16/0.67 thf(f546,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i,X4 : mu] : (($false = (exists_in_world @ X3 @ X1)) | ($false = (exists_in_world @ X2 @ X1)) | ($false = (exists_in_world @ X4 @ X1)) | ($true = ((subset @ (unordered_pair @ X2 @ X3) @ X4 @ X1) | ((~ (in @ X3 @ X4 @ X1)) | (~ (in @ X2 @ X4 @ X1)))))) )),
% 2.16/0.67 inference(not_proxy_clausification,[],[f537])).
% 2.16/0.67 thf(f537,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i,X4 : mu] : (($false = (exists_in_world @ X4 @ X1)) | ($false = (exists_in_world @ X3 @ X1)) | ($false = (~ ((subset @ (unordered_pair @ X2 @ X3) @ X4 @ X1) | ((~ (in @ X3 @ X4 @ X1)) | (~ (in @ X2 @ X4 @ X1)))))) | ($false = (exists_in_world @ X2 @ X1))) )),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f535])).
% 2.16/0.67 thf(f535,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i,X4 : mu] : (($false = ((~ ((subset @ (unordered_pair @ X2 @ X3) @ X4 @ X1) | ((~ (in @ X3 @ X4 @ X1)) | (~ (in @ X2 @ X4 @ X1))))) | (~ ((~ ((~ (in @ X3 @ X4 @ X1)) | (~ (in @ X2 @ X4 @ X1)))) | (~ (subset @ (unordered_pair @ X2 @ X3) @ X4 @ X1)))))) | ($false = (exists_in_world @ X4 @ X1)) | ($false = (exists_in_world @ X3 @ X1)) | ($false = (exists_in_world @ X2 @ X1))) )),
% 2.16/0.67 inference(not_proxy_clausification,[],[f534])).
% 2.16/0.67 thf(f534,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i,X4 : mu] : (($false = (exists_in_world @ X3 @ X1)) | ($true = (~ ((~ ((subset @ (unordered_pair @ X2 @ X3) @ X4 @ X1) | ((~ (in @ X3 @ X4 @ X1)) | (~ (in @ X2 @ X4 @ X1))))) | (~ ((~ ((~ (in @ X3 @ X4 @ X1)) | (~ (in @ X2 @ X4 @ X1)))) | (~ (subset @ (unordered_pair @ X2 @ X3) @ X4 @ X1))))))) | ($false = (exists_in_world @ X2 @ X1)) | ($false = (exists_in_world @ X4 @ X1))) )),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f533])).
% 2.16/0.67 thf(f533,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i,X4 : mu] : (($false = (exists_in_world @ X3 @ X1)) | ($false = (exists_in_world @ X2 @ X1)) | ($true = ((exists_in_world @ X4 @ X1) => (~ ((~ ((subset @ (unordered_pair @ X2 @ X3) @ X4 @ X1) | ((~ (in @ X3 @ X4 @ X1)) | (~ (in @ X2 @ X4 @ X1))))) | (~ ((~ ((~ (in @ X3 @ X4 @ X1)) | (~ (in @ X2 @ X4 @ X1)))) | (~ (subset @ (unordered_pair @ X2 @ X3) @ X4 @ X1))))))))) )),
% 2.16/0.67 inference(beta_eta_normalization,[],[f532])).
% 2.16/0.67 thf(f532,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i,X4 : mu] : ((((^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (~ ((~ ((subset @ (unordered_pair @ X2 @ X3) @ Y0 @ X1) | ((~ (in @ X3 @ Y0 @ X1)) | (~ (in @ X2 @ Y0 @ X1))))) | (~ ((~ ((~ (in @ X3 @ Y0 @ X1)) | (~ (in @ X2 @ Y0 @ X1)))) | (~ (subset @ (unordered_pair @ X2 @ X3) @ Y0 @ X1)))))))) @ X4) = $true) | ($false = (exists_in_world @ X2 @ X1)) | ($false = (exists_in_world @ X3 @ X1))) )),
% 2.16/0.67 inference(pi_clausification,[],[f531])).
% 2.16/0.67 thf(f531,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (~ ((~ ((subset @ (unordered_pair @ X2 @ X3) @ Y0 @ X1) | ((~ (in @ X3 @ Y0 @ X1)) | (~ (in @ X2 @ Y0 @ X1))))) | (~ ((~ ((~ (in @ X3 @ Y0 @ X1)) | (~ (in @ X2 @ Y0 @ X1)))) | (~ (subset @ (unordered_pair @ X2 @ X3) @ Y0 @ X1))))))))) = $true) | ($false = (exists_in_world @ X2 @ X1)) | ($false = (exists_in_world @ X3 @ X1))) )),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f530])).
% 2.16/0.67 thf(f530,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i] : ((((exists_in_world @ X3 @ X1) => (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (~ ((~ ((subset @ (unordered_pair @ X2 @ X3) @ Y0 @ X1) | ((~ (in @ X3 @ Y0 @ X1)) | (~ (in @ X2 @ Y0 @ X1))))) | (~ ((~ ((~ (in @ X3 @ Y0 @ X1)) | (~ (in @ X2 @ Y0 @ X1)))) | (~ (subset @ (unordered_pair @ X2 @ X3) @ Y0 @ X1)))))))))) = $true) | ($false = (exists_in_world @ X2 @ X1))) )),
% 2.16/0.67 inference(beta_eta_normalization,[],[f529])).
% 2.16/0.67 thf(f529,plain,(
% 2.16/0.67 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($false = (exists_in_world @ X2 @ X1)) | ($true = ((^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => (~ ((~ ((subset @ (unordered_pair @ X2 @ Y0) @ Y1 @ X1) | ((~ (in @ Y0 @ Y1 @ X1)) | (~ (in @ X2 @ Y1 @ X1))))) | (~ ((~ ((~ (in @ Y0 @ Y1 @ X1)) | (~ (in @ X2 @ Y1 @ X1)))) | (~ (subset @ (unordered_pair @ X2 @ Y0) @ Y1 @ X1))))))))))) @ X3))) )),
% 2.16/0.67 inference(pi_clausification,[],[f528])).
% 2.16/0.67 thf(f528,plain,(
% 2.16/0.67 ( ! [X2 : mu,X1 : $i] : (((!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => (~ ((~ ((subset @ (unordered_pair @ X2 @ Y0) @ Y1 @ X1) | ((~ (in @ Y0 @ Y1 @ X1)) | (~ (in @ X2 @ Y1 @ X1))))) | (~ ((~ ((~ (in @ Y0 @ Y1 @ X1)) | (~ (in @ X2 @ Y1 @ X1)))) | (~ (subset @ (unordered_pair @ X2 @ Y0) @ Y1 @ X1)))))))))))) = $true) | ($false = (exists_in_world @ X2 @ X1))) )),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f527])).
% 2.16/0.67 thf(f527,plain,(
% 2.16/0.67 ( ! [X2 : mu,X1 : $i] : ((((exists_in_world @ X2 @ X1) => (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => (~ ((~ ((subset @ (unordered_pair @ X2 @ Y0) @ Y1 @ X1) | ((~ (in @ Y0 @ Y1 @ X1)) | (~ (in @ X2 @ Y1 @ X1))))) | (~ ((~ ((~ (in @ Y0 @ Y1 @ X1)) | (~ (in @ X2 @ Y1 @ X1)))) | (~ (subset @ (unordered_pair @ X2 @ Y0) @ Y1 @ X1))))))))))))) = $true)) )),
% 2.16/0.67 inference(beta_eta_normalization,[],[f526])).
% 2.16/0.67 thf(f526,plain,(
% 2.16/0.67 ( ! [X2 : mu,X1 : $i] : ((((^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ X1) => (~ ((~ ((subset @ (unordered_pair @ Y0 @ Y1) @ Y2 @ X1) | ((~ (in @ Y1 @ Y2 @ X1)) | (~ (in @ Y0 @ Y2 @ X1))))) | (~ ((~ ((~ (in @ Y1 @ Y2 @ X1)) | (~ (in @ Y0 @ Y2 @ X1)))) | (~ (subset @ (unordered_pair @ Y0 @ Y1) @ Y2 @ X1)))))))))))))) @ X2) = $true)) )),
% 2.16/0.67 inference(pi_clausification,[],[f525])).
% 2.16/0.67 thf(f525,plain,(
% 2.16/0.67 ( ! [X1 : $i] : (((!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ X1) => (~ ((~ ((subset @ (unordered_pair @ Y0 @ Y1) @ Y2 @ X1) | ((~ (in @ Y1 @ Y2 @ X1)) | (~ (in @ Y0 @ Y2 @ X1))))) | (~ ((~ ((~ (in @ Y1 @ Y2 @ X1)) | (~ (in @ Y0 @ Y2 @ X1)))) | (~ (subset @ (unordered_pair @ Y0 @ Y1) @ Y2 @ X1))))))))))))))) = $true)) )),
% 2.16/0.67 inference(beta_eta_normalization,[],[f524])).
% 2.16/0.67 thf(f524,plain,(
% 2.16/0.67 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => (~ ((~ ((subset @ (unordered_pair @ Y1 @ Y2) @ Y3 @ Y0) | ((~ (in @ Y2 @ Y3 @ Y0)) | (~ (in @ Y1 @ Y3 @ Y0))))) | (~ ((~ ((~ (in @ Y2 @ Y3 @ Y0)) | (~ (in @ Y1 @ Y3 @ Y0)))) | (~ (subset @ (unordered_pair @ Y1 @ Y2) @ Y3 @ Y0)))))))))))))))) @ X1) = $true)) )),
% 2.16/0.67 inference(pi_clausification,[],[f261])).
% 2.16/0.67 thf(f261,plain,(
% 2.16/0.67 ((!! @ $i @ (^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => (~ ((~ ((subset @ (unordered_pair @ Y1 @ Y2) @ Y3 @ Y0) | ((~ (in @ Y2 @ Y3 @ Y0)) | (~ (in @ Y1 @ Y3 @ Y0))))) | (~ ((~ ((~ (in @ Y2 @ Y3 @ Y0)) | (~ (in @ Y1 @ Y3 @ Y0)))) | (~ (subset @ (unordered_pair @ Y1 @ Y2) @ Y3 @ Y0))))))))))))))))) = $true)),
% 2.16/0.67 inference(boolean_simplification,[],[f260])).
% 2.16/0.67 thf(f260,plain,(
% 2.16/0.67 ((!! @ $i @ (^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => (~ ((~ ((subset @ (unordered_pair @ Y1 @ Y2) @ Y3 @ Y0) | (~ (~ ((~ (in @ Y2 @ Y3 @ Y0)) | (~ (in @ Y1 @ Y3 @ Y0))))))) | (~ ((~ ((~ (in @ Y2 @ Y3 @ Y0)) | (~ (in @ Y1 @ Y3 @ Y0)))) | (~ (subset @ (unordered_pair @ Y1 @ Y2) @ Y3 @ Y0))))))))))))))))) = $true)),
% 2.16/0.67 inference(beta_eta_normalization,[],[f256])).
% 2.16/0.67 thf(f256,plain,(
% 2.16/0.67 (((^[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 : 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 > $o]: ((^[Y8 : $i]: (~ (Y7 @ Y8))))) @ ((^[Y7 : $i > $o]: ((^[Y8 : $i > $o]: ((^[Y9 : $i]: ((Y8 @ Y9) | (Y7 @ Y9))))))) @ ((^[Y7 : $i > $o]: ((^[Y8 : $i]: (~ (Y7 @ Y8))))) @ Y5) @ ((^[Y7 : $i > $o]: ((^[Y8 : $i]: (~ (Y7 @ Y8))))) @ Y6)))))) @ ((^[Y5 : $i > $o]: ((^[Y6 : $i > $o]: ((^[Y7 : $i > $o]: ((^[Y8 : $i > $o]: ((^[Y9 : $i]: ((Y8 @ Y9) | (Y7 @ Y9))))))) @ ((^[Y7 : $i > $o]: ((^[Y8 : $i]: (~ (Y7 @ Y8))))) @ Y5) @ Y6)))) @ Y3 @ Y4) @ ((^[Y5 : $i > $o]: ((^[Y6 : $i > $o]: ((^[Y7 : $i > $o]: ((^[Y8 : $i > $o]: ((^[Y9 : $i]: ((Y8 @ Y9) | (Y7 @ Y9))))))) @ ((^[Y7 : $i > $o]: ((^[Y8 : $i]: (~ (Y7 @ Y8))))) @ Y5) @ Y6)))) @ Y4 @ Y3))))) @ (subset @ (unordered_pair @ Y0 @ Y1) @ Y2) @ ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: (~ (Y5 @ Y6))))) @ ((^[Y5 : $i > $o]: ((^[Y6 : $i > $o]: ((^[Y7 : $i]: ((Y6 @ Y7) | (Y5 @ Y7))))))) @ ((^[Y5 : $i > $o]: ((^[Y6 : $i]: (~ (Y5 @ Y6))))) @ Y3) @ ((^[Y5 : $i > $o]: ((^[Y6 : $i]: (~ (Y5 @ Y6))))) @ Y4)))))) @ (in @ Y0 @ Y2) @ (in @ Y1 @ Y2)))))))))) = $true)),
% 2.16/0.67 inference(definition_unfolding,[],[f227,f188,f206,f206,f206,f235,f232])).
% 2.16/0.67 thf(f235,plain,(
% 2.16/0.67 (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))))))),
% 2.16/0.67 inference(definition_unfolding,[],[f217,f232,f233,f233])).
% 2.16/0.67 thf(f217,plain,(
% 2.16/0.67 (mequiv = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mand @ (mimplies @ Y0 @ Y1) @ (mimplies @ Y1 @ Y0))))))),
% 2.16/0.67 inference(cnf_transformation,[],[f100])).
% 2.16/0.67 thf(f100,plain,(
% 2.16/0.67 (mequiv = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mand @ (mimplies @ Y0 @ Y1) @ (mimplies @ Y1 @ Y0))))))),
% 2.16/0.67 inference(fool_elimination,[],[f99])).
% 2.16/0.67 thf(f99,plain,(
% 2.16/0.67 ((^[X0 : $i > $o, X1 : $i > $o] : (mand @ (mimplies @ X0 @ X1) @ (mimplies @ X1 @ X0))) = mequiv)),
% 2.16/0.67 inference(rectify,[],[f11])).
% 2.16/0.67 thf(f11,axiom,(
% 2.16/0.67 ((^[X3 : $i > $o, X4 : $i > $o] : (mand @ (mimplies @ X3 @ X4) @ (mimplies @ X4 @ X3))) = mequiv)),
% 2.16/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mequiv)).
% 2.16/0.67 thf(f227,plain,(
% 2.16/0.67 ((mvalid @ (mforall_ind @ (^[Y0 : mu]: (mforall_ind @ (^[Y1 : mu]: (mforall_ind @ (^[Y2 : mu]: (mequiv @ (subset @ (unordered_pair @ Y0 @ Y1) @ Y2) @ (mand @ (in @ Y0 @ Y2) @ (in @ Y1 @ Y2)))))))))) = $true)),
% 2.16/0.67 inference(cnf_transformation,[],[f70])).
% 2.16/0.67 thf(f70,plain,(
% 2.16/0.67 ((mvalid @ (mforall_ind @ (^[Y0 : mu]: (mforall_ind @ (^[Y1 : mu]: (mforall_ind @ (^[Y2 : mu]: (mequiv @ (subset @ (unordered_pair @ Y0 @ Y1) @ Y2) @ (mand @ (in @ Y0 @ Y2) @ (in @ Y1 @ Y2)))))))))) = $true)),
% 2.16/0.67 inference(fool_elimination,[],[f69])).
% 2.16/0.67 thf(f69,plain,(
% 2.16/0.67 (mvalid @ (mforall_ind @ (^[X0 : mu] : (mforall_ind @ (^[X1 : mu] : (mforall_ind @ (^[X2 : mu] : (mequiv @ (subset @ (unordered_pair @ X0 @ X1) @ X2) @ (mand @ (in @ X0 @ X2) @ (in @ X1 @ X2))))))))))),
% 2.16/0.67 inference(rectify,[],[f61])).
% 2.16/0.67 thf(f61,axiom,(
% 2.16/0.67 (mvalid @ (mforall_ind @ (^[X14 : mu] : (mforall_ind @ (^[X15 : mu] : (mforall_ind @ (^[X16 : mu] : (mequiv @ (subset @ (unordered_pair @ X14 @ X15) @ X16) @ (mand @ (in @ X14 @ X16) @ (in @ X15 @ X16))))))))))),
% 2.16/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1)).
% 2.16/0.67 thf(f506,plain,(
% 2.16/0.67 ((in @ sK4 @ sK3 @ sK1) = $true)),
% 2.16/0.67 inference(not_proxy_clausification,[],[f504])).
% 2.16/0.67 thf(f504,plain,(
% 2.16/0.67 ($false = (~ (in @ sK4 @ sK3 @ sK1)))),
% 2.16/0.67 inference(binary_proxy_clausification,[],[f501])).
% 2.16/0.67 % SZS output end Proof for theBenchmark
% 2.16/0.67 % (25258)------------------------------
% 2.16/0.67 % (25258)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 2.16/0.67 % (25258)Termination reason: Refutation
% 2.16/0.67
% 2.16/0.67 % (25258)Memory used [KB]: 6908
% 2.16/0.67 % (25258)Time elapsed: 0.229 s
% 2.16/0.67 % (25258)Instructions burned: 523 (million)
% 2.16/0.67 % (25258)------------------------------
% 2.16/0.67 % (25258)------------------------------
% 2.16/0.67 % (25230)Success in time 0.322 s
% 2.16/0.67 % Vampire---4.8 exiting
%------------------------------------------------------------------------------