TSTP Solution File: SYO868^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO868^1 : TPTP v8.2.0. Released v7.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 : n016.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 09:09:12 EDT 2024
% Result : Theorem 0.22s 0.49s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO868^1 : TPTP v8.2.0. Released v7.5.0.
% 0.11/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n016.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 10:17:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_EQU_NAR problem
% 0.15/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.39 % (23448)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.15/0.39 % (23450)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.39 % (23453)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.15/0.39 % (23449)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.15/0.39 % (23447)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.15/0.39 % (23450)Instruction limit reached!
% 0.15/0.39 % (23450)------------------------------
% 0.15/0.39 % (23450)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (23450)Termination reason: Unknown
% 0.15/0.39 % (23450)Termination phase: shuffling
% 0.15/0.39
% 0.15/0.39 % (23450)Memory used [KB]: 1151
% 0.15/0.39 % (23450)Time elapsed: 0.003 s
% 0.15/0.39 % (23450)Instructions burned: 2 (million)
% 0.15/0.39 % (23450)------------------------------
% 0.15/0.39 % (23450)------------------------------
% 0.15/0.39 % (23454)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.39 % (23451)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.39 % (23455)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.15/0.39 % (23448)Instruction limit reached!
% 0.15/0.39 % (23448)------------------------------
% 0.15/0.39 % (23448)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (23448)Termination reason: Unknown
% 0.15/0.39 % (23448)Termination phase: shuffling
% 0.15/0.39
% 0.15/0.39 % (23448)Memory used [KB]: 1279
% 0.15/0.39 % (23448)Time elapsed: 0.004 s
% 0.15/0.39 % (23448)Instructions burned: 4 (million)
% 0.15/0.39 % (23448)------------------------------
% 0.15/0.39 % (23448)------------------------------
% 0.15/0.39 % (23451)Instruction limit reached!
% 0.15/0.39 % (23451)------------------------------
% 0.15/0.39 % (23451)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (23451)Termination reason: Unknown
% 0.15/0.39 % (23451)Termination phase: shuffling
% 0.15/0.39
% 0.15/0.39 % (23451)Memory used [KB]: 1151
% 0.15/0.39 % (23451)Time elapsed: 0.003 s
% 0.15/0.39 % (23451)Instructions burned: 2 (million)
% 0.15/0.39 % (23451)------------------------------
% 0.15/0.39 % (23451)------------------------------
% 0.15/0.39 % (23455)Instruction limit reached!
% 0.15/0.39 % (23455)------------------------------
% 0.15/0.39 % (23455)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (23455)Termination reason: Unknown
% 0.15/0.39 % (23455)Termination phase: shuffling
% 0.15/0.39
% 0.15/0.39 % (23455)Memory used [KB]: 1279
% 0.15/0.39 % (23455)Time elapsed: 0.004 s
% 0.15/0.39 % (23455)Instructions burned: 4 (million)
% 0.15/0.39 % (23455)------------------------------
% 0.15/0.39 % (23455)------------------------------
% 0.15/0.40 % (23454)Instruction limit reached!
% 0.15/0.40 % (23454)------------------------------
% 0.15/0.40 % (23454)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (23454)Termination reason: Unknown
% 0.15/0.40 % (23454)Termination phase: Property scanning
% 0.15/0.40
% 0.15/0.40 % (23454)Memory used [KB]: 1535
% 0.15/0.40 % (23454)Time elapsed: 0.012 s
% 0.15/0.40 % (23454)Instructions burned: 19 (million)
% 0.15/0.40 % (23454)------------------------------
% 0.15/0.40 % (23454)------------------------------
% 0.15/0.40 % (23449)Instruction limit reached!
% 0.15/0.40 % (23449)------------------------------
% 0.15/0.40 % (23449)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (23449)Termination reason: Unknown
% 0.15/0.40 % (23449)Termination phase: Naming
% 0.15/0.40
% 0.15/0.40 % (23449)Memory used [KB]: 1535
% 0.15/0.40 % (23449)Time elapsed: 0.016 s
% 0.15/0.40 % (23449)Instructions burned: 27 (million)
% 0.15/0.40 % (23449)------------------------------
% 0.15/0.40 % (23449)------------------------------
% 0.15/0.40 % (23462)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.15/0.40 % (23463)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.15/0.40 % (23464)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.15/0.40 % (23465)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.15/0.41 % (23464)Instruction limit reached!
% 0.15/0.41 % (23464)------------------------------
% 0.15/0.41 % (23464)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.41 % (23464)Termination reason: Unknown
% 0.15/0.41 % (23464)Termination phase: shuffling
% 0.15/0.41
% 0.15/0.41 % (23464)Memory used [KB]: 1151
% 0.15/0.41 % (23464)Time elapsed: 0.004 s
% 0.15/0.41 % (23464)Instructions burned: 3 (million)
% 0.15/0.41 % (23464)------------------------------
% 0.15/0.41 % (23464)------------------------------
% 0.15/0.41 % (23463)Instruction limit reached!
% 0.15/0.41 % (23463)------------------------------
% 0.15/0.41 % (23463)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.41 % (23463)Termination reason: Unknown
% 0.15/0.41 % (23463)Termination phase: shuffling
% 0.15/0.41
% 0.15/0.41 % (23463)Memory used [KB]: 1407
% 0.15/0.41 % (23463)Time elapsed: 0.010 s
% 0.15/0.41 % (23463)Instructions burned: 15 (million)
% 0.15/0.41 % (23463)------------------------------
% 0.15/0.41 % (23463)------------------------------
% 0.15/0.41 % (23466)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.15/0.42 % (23467)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.15/0.42 % (23466)Instruction limit reached!
% 0.15/0.42 % (23466)------------------------------
% 0.15/0.42 % (23466)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.42 % (23466)Termination reason: Unknown
% 0.15/0.42 % (23466)Termination phase: shuffling
% 0.15/0.42
% 0.15/0.42 % (23466)Memory used [KB]: 1279
% 0.15/0.42 % (23466)Time elapsed: 0.006 s
% 0.15/0.42 % (23466)Instructions burned: 7 (million)
% 0.15/0.42 % (23466)------------------------------
% 0.15/0.42 % (23466)------------------------------
% 0.22/0.42 % (23462)Instruction limit reached!
% 0.22/0.42 % (23462)------------------------------
% 0.22/0.42 % (23462)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42 % (23462)Termination reason: Unknown
% 0.22/0.42 % (23462)Termination phase: Function definition elimination
% 0.22/0.42
% 0.22/0.42 % (23462)Memory used [KB]: 1535
% 0.22/0.42 % (23462)Time elapsed: 0.020 s
% 0.22/0.42 % (23462)Instructions burned: 37 (million)
% 0.22/0.42 % (23462)------------------------------
% 0.22/0.42 % (23462)------------------------------
% 0.22/0.42 % (23468)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.22/0.42 % (23468)Instruction limit reached!
% 0.22/0.42 % (23468)------------------------------
% 0.22/0.42 % (23468)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42 % (23468)Termination reason: Unknown
% 0.22/0.42 % (23468)Termination phase: shuffling
% 0.22/0.42
% 0.22/0.42 % (23468)Memory used [KB]: 1151
% 0.22/0.42 % (23468)Time elapsed: 0.004 s
% 0.22/0.42 % (23468)Instructions burned: 3 (million)
% 0.22/0.42 % (23468)------------------------------
% 0.22/0.42 % (23468)------------------------------
% 0.22/0.42 % (23467)Instruction limit reached!
% 0.22/0.42 % (23467)------------------------------
% 0.22/0.42 % (23467)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42 % (23467)Termination reason: Unknown
% 0.22/0.42 % (23467)Termination phase: shuffling
% 0.22/0.42
% 0.22/0.42 % (23467)Memory used [KB]: 1535
% 0.22/0.42 % (23467)Time elapsed: 0.011 s
% 0.22/0.42 % (23467)Instructions burned: 17 (million)
% 0.22/0.42 % (23467)------------------------------
% 0.22/0.42 % (23467)------------------------------
% 0.22/0.43 % (23469)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.22/0.43 % (23469)Instruction limit reached!
% 0.22/0.43 % (23469)------------------------------
% 0.22/0.43 % (23469)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.43 % (23469)Termination reason: Unknown
% 0.22/0.43 % (23469)Termination phase: shuffling
% 0.22/0.43
% 0.22/0.43 % (23469)Memory used [KB]: 1279
% 0.22/0.43 % (23469)Time elapsed: 0.004 s
% 0.22/0.43 % (23469)Instructions burned: 4 (million)
% 0.22/0.43 % (23469)------------------------------
% 0.22/0.43 % (23469)------------------------------
% 0.22/0.43 % (23470)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.22/0.43 % (23470)Instruction limit reached!
% 0.22/0.43 % (23470)------------------------------
% 0.22/0.43 % (23470)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.43 % (23470)Termination reason: Unknown
% 0.22/0.43 % (23470)Termination phase: shuffling
% 0.22/0.43
% 0.22/0.44 % (23470)Memory used [KB]: 1279
% 0.22/0.44 % (23470)Time elapsed: 0.006 s
% 0.22/0.44 % (23470)Instructions burned: 8 (million)
% 0.22/0.44 % (23470)------------------------------
% 0.22/0.44 % (23470)------------------------------
% 0.22/0.44 % (23471)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.22/0.44 % (23471)Instruction limit reached!
% 0.22/0.44 % (23471)------------------------------
% 0.22/0.44 % (23471)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (23471)Termination reason: Unknown
% 0.22/0.44 % (23471)Termination phase: shuffling
% 0.22/0.44 % (23472)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.22/0.44
% 0.22/0.44 % (23471)Memory used [KB]: 1279
% 0.22/0.44 % (23471)Time elapsed: 0.004 s
% 0.22/0.44 % (23471)Instructions burned: 4 (million)
% 0.22/0.44 % (23471)------------------------------
% 0.22/0.44 % (23471)------------------------------
% 0.22/0.44 % (23473)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.22/0.44 % (23472)Instruction limit reached!
% 0.22/0.44 % (23472)------------------------------
% 0.22/0.44 % (23472)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (23472)Termination reason: Unknown
% 0.22/0.44 % (23472)Termination phase: shuffling
% 0.22/0.44
% 0.22/0.44 % (23472)Memory used [KB]: 1279
% 0.22/0.44 % (23472)Time elapsed: 0.004 s
% 0.22/0.44 % (23472)Instructions burned: 4 (million)
% 0.22/0.44 % (23472)------------------------------
% 0.22/0.44 % (23472)------------------------------
% 0.22/0.44 % (23474)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on theBenchmark for (2999ds/710Mi)
% 0.22/0.45 % (23473)Instruction limit reached!
% 0.22/0.45 % (23473)------------------------------
% 0.22/0.45 % (23473)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.45 % (23473)Termination reason: Unknown
% 0.22/0.45 % (23473)Termination phase: Property scanning
% 0.22/0.45
% 0.22/0.45 % (23473)Memory used [KB]: 1535
% 0.22/0.45 % (23473)Time elapsed: 0.012 s
% 0.22/0.45 % (23473)Instructions burned: 19 (million)
% 0.22/0.45 % (23473)------------------------------
% 0.22/0.45 % (23473)------------------------------
% 0.22/0.45 % (23475)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.22/0.45 % (23476)dis+1002_5:1_au=on:bd=off:e2e=on:fde=none:fs=off:fsr=off:sos=on:i=902:si=on:rtra=on_0 on theBenchmark for (2999ds/902Mi)
% 0.22/0.45 % (23475)Instruction limit reached!
% 0.22/0.45 % (23475)------------------------------
% 0.22/0.45 % (23475)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.45 % (23475)Termination reason: Unknown
% 0.22/0.45 % (23475)Termination phase: shuffling
% 0.22/0.45
% 0.22/0.45 % (23475)Memory used [KB]: 1279
% 0.22/0.45 % (23475)Time elapsed: 0.005 s
% 0.22/0.45 % (23475)Instructions burned: 6 (million)
% 0.22/0.45 % (23475)------------------------------
% 0.22/0.45 % (23475)------------------------------
% 0.22/0.45 % (23477)dis+21_1:8_apa=on:cnfonf=off:fd=off:fsr=off:hud=0:ins=1:kws=inv_frequency:nwc=10.0:ss=axioms:st=5.0:i=21:si=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.22/0.46 % (23447)Instruction limit reached!
% 0.22/0.46 % (23447)------------------------------
% 0.22/0.46 % (23447)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.46 % (23447)Termination reason: Unknown
% 0.22/0.46 % (23447)Termination phase: Saturation
% 0.22/0.46
% 0.22/0.46 % (23447)Memory used [KB]: 6396
% 0.22/0.46 % (23447)Time elapsed: 0.075 s
% 0.22/0.46 % (23447)Instructions burned: 183 (million)
% 0.22/0.46 % (23447)------------------------------
% 0.22/0.46 % (23447)------------------------------
% 0.22/0.46 % (23478)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2999ds/5Mi)
% 0.22/0.46 % (23477)Instruction limit reached!
% 0.22/0.46 % (23477)------------------------------
% 0.22/0.46 % (23477)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.46 % (23477)Termination reason: Unknown
% 0.22/0.46 % (23477)Termination phase: Property scanning
% 0.22/0.46
% 0.22/0.46 % (23477)Memory used [KB]: 1535
% 0.22/0.46 % (23477)Time elapsed: 0.013 s
% 0.22/0.46 % (23477)Instructions burned: 21 (million)
% 0.22/0.46 % (23477)------------------------------
% 0.22/0.46 % (23477)------------------------------
% 0.22/0.47 % (23478)Instruction limit reached!
% 0.22/0.47 % (23478)------------------------------
% 0.22/0.47 % (23478)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.47 % (23478)Termination reason: Unknown
% 0.22/0.47 % (23478)Termination phase: shuffling
% 0.22/0.47
% 0.22/0.47 % (23478)Memory used [KB]: 1279
% 0.22/0.47 % (23478)Time elapsed: 0.005 s
% 0.22/0.47 % (23478)Instructions burned: 5 (million)
% 0.22/0.47 % (23478)------------------------------
% 0.22/0.47 % (23478)------------------------------
% 0.22/0.47 % (23479)lrs+2_1:1_cnfonf=lazy_not_gen_be_off:cs=on:fe=off:hud=10:inj=on:ins=3:plsq=on:plsqc=1:sd=10:ss=axioms:tnu=1:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.22/0.47 % (23479)Instruction limit reached!
% 0.22/0.47 % (23479)------------------------------
% 0.22/0.47 % (23479)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.47 % (23479)Termination reason: Unknown
% 0.22/0.47 % (23479)Termination phase: shuffling
% 0.22/0.47
% 0.22/0.47 % (23479)Memory used [KB]: 1279
% 0.22/0.47 % (23479)Time elapsed: 0.006 s
% 0.22/0.47 % (23479)Instructions burned: 7 (million)
% 0.22/0.47 % (23479)------------------------------
% 0.22/0.47 % (23479)------------------------------
% 0.22/0.48 % (23482)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on theBenchmark for (2999ds/377Mi)
% 0.22/0.48 % (23484)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 (2998ds/779Mi)
% 0.22/0.48 % (23474)First to succeed.
% 0.22/0.48 % (23488)lrs+10_1:1_cnfonf=lazy_not_be_gen:ntd=on:sp=const_min:ss=axioms:sup=off:i=19:si=on:rtra=on_0 on theBenchmark for (2998ds/19Mi)
% 0.22/0.49 % (23474)Refutation found. Thanks to Tanya!
% 0.22/0.49 % SZS status Theorem for theBenchmark
% 0.22/0.49 % SZS output start Proof for theBenchmark
% 0.22/0.49 thf(func_def_0, type, c_Eps_i: ($i > $o) > $i).
% 0.22/0.49 thf(func_def_3, type, c_not: $o > $o).
% 0.22/0.49 thf(func_def_4, type, c_and: $o > $o > $o).
% 0.22/0.49 thf(func_def_5, type, c_or: $o > $o > $o).
% 0.22/0.49 thf(func_def_6, type, c_iff: $o > $o > $o).
% 0.22/0.49 thf(func_def_7, type, c_In: $i > $i > $o).
% 0.22/0.49 thf(func_def_8, type, c_Subq: $i > $i > $o).
% 0.22/0.49 thf(func_def_10, type, c_Union: $i > $i).
% 0.22/0.49 thf(func_def_11, type, c_Power: $i > $i).
% 0.22/0.49 thf(func_def_12, type, c_Repl: $i > ($i > $i) > $i).
% 0.22/0.49 thf(func_def_13, type, c_TransSet: $i > $o).
% 0.22/0.49 thf(func_def_14, type, c_atleast2: $i > $o).
% 0.22/0.49 thf(func_def_15, type, c_atleast3: $i > $o).
% 0.22/0.49 thf(func_def_16, type, c_atleast4: $i > $o).
% 0.22/0.49 thf(func_def_17, type, c_atleast5: $i > $o).
% 0.22/0.49 thf(func_def_18, type, c_atleast6: $i > $o).
% 0.22/0.49 thf(func_def_19, type, c_exactly2: $i > $o).
% 0.22/0.49 thf(func_def_20, type, c_exactly3: $i > $o).
% 0.22/0.49 thf(func_def_21, type, c_exactly4: $i > $o).
% 0.22/0.49 thf(func_def_22, type, c_exactly5: $i > $o).
% 0.22/0.49 thf(func_def_23, type, c_exu_i: ($i > $o) > $o).
% 0.22/0.49 thf(func_def_24, type, c_reflexive_i: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_25, type, c_irreflexive_i: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_26, type, c_symmetric_i: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_27, type, c_antisymmetric_i: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_28, type, c_transitive_i: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_29, type, c_eqreln_i: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_30, type, c_per_i: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_31, type, c_linear_i: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_32, type, c_trichotomous_or_i: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_33, type, c_partialorder_i: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_34, type, c_totalorder_i: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_35, type, c_strictpartialorder_i: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_36, type, c_stricttotalorder_i: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_37, type, c_If_i: $o > $i > $i > $i).
% 0.22/0.49 thf(func_def_38, type, c_exactly1of2: $o > $o > $o).
% 0.22/0.49 thf(func_def_39, type, c_exactly1of3: $o > $o > $o > $o).
% 0.22/0.49 thf(func_def_40, type, c_nIn: $i > $i > $o).
% 0.22/0.49 thf(func_def_41, type, c_nSubq: $i > $i > $o).
% 0.22/0.49 thf(func_def_42, type, c_UPair: $i > $i > $i).
% 0.22/0.49 thf(func_def_43, type, c_Sing: $i > $i).
% 0.22/0.49 thf(func_def_44, type, c_binunion: $i > $i > $i).
% 0.22/0.49 thf(func_def_45, type, c_SetAdjoin: $i > $i > $i).
% 0.22/0.49 thf(func_def_46, type, c_famunion: $i > ($i > $i) > $i).
% 0.22/0.49 thf(func_def_47, type, c_Sep: $i > ($i > $o) > $i).
% 0.22/0.49 thf(func_def_48, type, c_ReplSep: $i > ($i > $o) > ($i > $i) > $i).
% 0.22/0.49 thf(func_def_49, type, c_binintersect: $i > $i > $i).
% 0.22/0.49 thf(func_def_50, type, c_setminus: $i > $i > $i).
% 0.22/0.49 thf(func_def_51, type, c_inj: $i > $i > ($i > $i) > $o).
% 0.22/0.49 thf(func_def_52, type, c_bij: $i > $i > ($i > $i) > $o).
% 0.22/0.49 thf(func_def_53, type, c_atleastp: $i > $i > $o).
% 0.22/0.49 thf(func_def_54, type, c_equip: $i > $i > $o).
% 0.22/0.49 thf(func_def_55, type, c_In_rec_poly_G_i: ($i > ($i > $i) > $i) > $i > $i > $o).
% 0.22/0.49 thf(func_def_56, type, c_In_rec_poly_i: ($i > ($i > $i) > $i) > $i > $i).
% 0.22/0.49 thf(func_def_57, type, c_ordsucc: $i > $i).
% 0.22/0.49 thf(func_def_58, type, c_nat_p: $i > $o).
% 0.22/0.49 thf(func_def_59, type, c_nat_primrec: $i > ($i > $i > $i) > $i > $i).
% 0.22/0.49 thf(func_def_60, type, c_add_nat: $i > $i > $i).
% 0.22/0.49 thf(func_def_61, type, c_mul_nat: $i > $i > $i).
% 0.22/0.49 thf(func_def_62, type, c_ordinal: $i > $o).
% 0.22/0.49 thf(func_def_63, type, c_V_: $i > $i).
% 0.22/0.49 thf(func_def_64, type, c_Inj1: $i > $i).
% 0.22/0.49 thf(func_def_65, type, c_Inj0: $i > $i).
% 0.22/0.49 thf(func_def_66, type, c_Unj: $i > $i).
% 0.22/0.49 thf(func_def_67, type, c_combine_funcs: $i > $i > ($i > $i) > ($i > $i) > $i > $i).
% 0.22/0.49 thf(func_def_68, type, c_setsum: $i > $i > $i).
% 0.22/0.49 thf(func_def_69, type, c_proj0: $i > $i).
% 0.22/0.49 thf(func_def_70, type, c_proj1: $i > $i).
% 0.22/0.49 thf(func_def_71, type, c_binrep: $i > $i > $i).
% 0.22/0.49 thf(func_def_72, type, c_lam: $i > ($i > $i) > $i).
% 0.22/0.49 thf(func_def_73, type, c_setprod: $i > $i > $i).
% 0.22/0.49 thf(func_def_74, type, c_ap: $i > $i > $i).
% 0.22/0.49 thf(func_def_75, type, c_setsum_p: $i > $o).
% 0.22/0.49 thf(func_def_76, type, c_tuple_p: $i > $i > $o).
% 0.22/0.49 thf(func_def_77, type, c_Pi: $i > ($i > $i) > $i).
% 0.22/0.49 thf(func_def_78, type, c_setexp: $i > $i > $i).
% 0.22/0.49 thf(func_def_79, type, c_Sep2: $i > ($i > $i) > ($i > $i > $o) > $i).
% 0.22/0.49 thf(func_def_80, type, c_set_of_pairs: $i > $o).
% 0.22/0.49 thf(func_def_81, type, c_lam2: $i > ($i > $i) > ($i > $i > $i) > $i).
% 0.22/0.49 thf(func_def_82, type, c_PNoEq_: $i > ($i > $o) > ($i > $o) > $o).
% 0.22/0.49 thf(func_def_83, type, c_PNoLt_: $i > ($i > $o) > ($i > $o) > $o).
% 0.22/0.49 thf(func_def_84, type, c_PNoLt: $i > ($i > $o) > $i > ($i > $o) > $o).
% 0.22/0.49 thf(func_def_85, type, c_PNoLe: $i > ($i > $o) > $i > ($i > $o) > $o).
% 0.22/0.49 thf(func_def_86, type, c_PNo_downc: ($i > ($i > $o) > $o) > $i > ($i > $o) > $o).
% 0.22/0.49 thf(func_def_87, type, c_PNo_upc: ($i > ($i > $o) > $o) > $i > ($i > $o) > $o).
% 0.22/0.49 thf(func_def_88, type, c_SNoElts_: $i > $i).
% 0.22/0.49 thf(func_def_89, type, c_SNo_: $i > $i > $o).
% 0.22/0.49 thf(func_def_90, type, c_PSNo: $i > ($i > $o) > $i).
% 0.22/0.49 thf(func_def_91, type, c_SNo: $i > $o).
% 0.22/0.49 thf(func_def_92, type, c_SNoLev: $i > $i).
% 0.22/0.49 thf(func_def_93, type, c_SNoEq_: $i > $i > $i > $o).
% 0.22/0.49 thf(func_def_94, type, c_SNoLt: $i > $i > $o).
% 0.22/0.49 thf(func_def_95, type, c_SNoLe: $i > $i > $o).
% 0.22/0.49 thf(func_def_96, type, c_binop_on: $i > ($i > $i > $i) > $o).
% 0.22/0.49 thf(func_def_97, type, c_Loop: $i > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > $i > $o).
% 0.22/0.49 thf(func_def_98, type, c_Loop_with_defs: $i > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > $i > ($i > $i > $i) > ($i > $i > $i > $i) > ($i > $i > $i) > ($i > $i > $i > $i) > ($i > $i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > $o).
% 0.22/0.49 thf(func_def_99, type, c_Loop_with_defs_cex1: $i > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > $i > ($i > $i > $i) > ($i > $i > $i > $i) > ($i > $i > $i) > ($i > $i > $i > $i) > ($i > $i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > $o).
% 0.22/0.49 thf(func_def_100, type, c_Loop_with_defs_cex2: $i > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > $i > ($i > $i > $i) > ($i > $i > $i > $i) > ($i > $i > $i) > ($i > $i > $i > $i) > ($i > $i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > $o).
% 0.22/0.49 thf(func_def_101, type, c_combinator: $i > $o).
% 0.22/0.49 thf(func_def_102, type, c_combinator_equiv: $i > $i > $o).
% 0.22/0.49 thf(func_def_103, type, c_equip_mod: $i > $i > $i > $o).
% 0.22/0.49 thf(func_def_131, type, sK0: ($i > $o) > $i).
% 0.22/0.49 thf(func_def_135, type, sK4: $i > $i).
% 0.22/0.49 thf(func_def_137, type, sK6: $i > $i > $o).
% 0.22/0.49 thf(func_def_139, type, ph7: !>[X0: $tType]:(X0)).
% 0.22/0.49 thf(f421,plain,(
% 0.22/0.49 $false),
% 0.22/0.49 inference(trivial_inequality_removal,[],[f419])).
% 0.22/0.49 thf(f419,plain,(
% 0.22/0.49 ($true = $false)),
% 0.22/0.49 inference(superposition,[],[f377,f378])).
% 0.22/0.49 thf(f378,plain,(
% 0.22/0.49 ( ! [X3 : $i] : (((sK6 @ X3 @ X3) = $false)) )),
% 0.22/0.49 inference(binary_proxy_clausification,[],[f376])).
% 0.22/0.49 thf(f376,plain,(
% 0.22/0.49 ( ! [X3 : $i] : (($false = ((!! @ $i @ (^[Y0 : $i]: ((sK6 @ X3 @ Y0) => (sK6 @ X3 @ (c_ordsucc @ Y0))))) => (sK6 @ X3 @ X3)))) )),
% 0.22/0.49 inference(binary_proxy_clausification,[],[f375])).
% 0.22/0.49 thf(f375,plain,(
% 0.22/0.49 ( ! [X3 : $i] : ((((sK6 @ X3 @ c_Empty) => ((!! @ $i @ (^[Y0 : $i]: ((sK6 @ X3 @ Y0) => (sK6 @ X3 @ (c_ordsucc @ Y0))))) => (sK6 @ X3 @ X3))) = $false)) )),
% 0.22/0.49 inference(beta_eta_normalization,[],[f374])).
% 0.22/0.49 thf(f374,plain,(
% 0.22/0.49 ( ! [X3 : $i] : ((((^[Y0 : $i > $o]: ((Y0 @ c_Empty) => ((!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) => (Y0 @ (c_ordsucc @ Y1))))) => (Y0 @ X3)))) @ (sK6 @ X3)) = $false)) )),
% 0.22/0.49 inference(sigma_clausification,[],[f373])).
% 0.22/0.49 thf(f373,plain,(
% 0.22/0.49 ( ! [X3 : $i] : (($true != (!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((Y0 @ c_Empty) => ((!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) => (Y0 @ (c_ordsucc @ Y1))))) => (Y0 @ X3))))))) )),
% 0.22/0.49 inference(beta_eta_normalization,[],[f355])).
% 0.22/0.49 thf(f355,plain,(
% 0.22/0.49 ( ! [X3 : $i] : (($true != ((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((Y1 @ c_Empty) => ((!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) => (Y1 @ (c_ordsucc @ Y2))))) => (Y1 @ Y0)))))) @ X3))) )),
% 0.22/0.49 inference(definition_unfolding,[],[f326,f306])).
% 0.22/0.49 thf(f306,plain,(
% 0.22/0.49 (c_nat_p = (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((Y1 @ c_Empty) => ((!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) => (Y1 @ (c_ordsucc @ Y2))))) => (Y1 @ Y0)))))))),
% 0.22/0.49 inference(cnf_transformation,[],[f231])).
% 0.22/0.49 thf(f231,plain,(
% 0.22/0.49 (c_nat_p = (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((Y1 @ c_Empty) => ((!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) => (Y1 @ (c_ordsucc @ Y2))))) => (Y1 @ Y0)))))))),
% 0.22/0.49 inference(fool_elimination,[],[f230])).
% 0.22/0.49 thf(f230,plain,(
% 0.22/0.49 (c_nat_p = (^[X0 : $i] : (! [X1 : $i > $o] : ((X1 @ c_Empty) => (! [X2] : ((X1 @ X2) => (X1 @ (c_ordsucc @ X2))) => (X1 @ X0))))))),
% 0.22/0.49 inference(rectify,[],[f63])).
% 0.22/0.49 thf(f63,axiom,(
% 0.22/0.49 (c_nat_p = (^[X0 : $i] : (! [X1 : $i > $o] : ((X1 @ c_Empty) => (! [X2] : ((X1 @ X2) => (X1 @ (c_ordsucc @ X2))) => (X1 @ X0))))))),
% 0.22/0.49 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax63)).
% 0.22/0.49 thf(f326,plain,(
% 0.22/0.49 ( ! [X3 : $i] : (((c_nat_p @ X3) != $true)) )),
% 0.22/0.49 inference(cnf_transformation,[],[f299])).
% 0.22/0.49 thf(f299,plain,(
% 0.22/0.49 ($true = (c_In @ sK1 @ c_Empty)) & (($true = (c_In @ sK2 @ sK1)) & (! [X3] : ((((c_and @ (c_exactly2 @ X3) @ (c_not @ (c_exactly5 @ (sK4 @ X3)))) = $true) | ((c_ordinal @ X3) != $true)) & ((((c_ordinal @ X3) = $true) & ((c_exactly2 @ X3) != $true)) | (((c_atleast3 @ X3) != $true) & (((c_not @ (c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))) != $true) | ((sK4 @ X3) = X3))) | ((c_atleast2 @ X3) != $true) | ((c_and @ (c_atleast5 @ sK3) @ (c_not @ (c_exactly1of2 @ (c_SNoLt @ sK3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)) @ (c_TransSet @ (sK4 @ X3))))) = $true)) & ((c_nat_p @ X3) != $true)) & ((c_In @ sK3 @ sK2) = $true)))),
% 0.22/0.49 inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f291,f298,f297,f296,f295])).
% 0.22/0.49 thf(f295,plain,(
% 0.22/0.49 ? [X0] : (((c_In @ X0 @ c_Empty) = $true) & ? [X1] : (((c_In @ X1 @ X0) = $true) & ? [X2] : (! [X3] : ? [X4] : ((((c_and @ (c_exactly2 @ X3) @ (c_not @ (c_exactly5 @ X4))) = $true) | ((c_ordinal @ X3) != $true)) & ((((c_ordinal @ X3) = $true) & ((c_exactly2 @ X3) != $true)) | (((c_atleast3 @ X3) != $true) & (((c_not @ (c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))) != $true) | (X3 = X4))) | ((c_atleast2 @ X3) != $true) | ((c_and @ (c_atleast5 @ X2) @ (c_not @ (c_exactly1of2 @ (c_SNoLt @ X2 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)) @ (c_TransSet @ X4)))) = $true)) & ((c_nat_p @ X3) != $true)) & ((c_In @ X2 @ X1) = $true)))) => (($true = (c_In @ sK1 @ c_Empty)) & ? [X1] : (((c_In @ X1 @ sK1) = $true) & ? [X2] : (! [X3] : ? [X4] : ((((c_and @ (c_exactly2 @ X3) @ (c_not @ (c_exactly5 @ X4))) = $true) | ((c_ordinal @ X3) != $true)) & ((((c_ordinal @ X3) = $true) & ((c_exactly2 @ X3) != $true)) | (((c_atleast3 @ X3) != $true) & (((c_not @ (c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))) != $true) | (X3 = X4))) | ((c_atleast2 @ X3) != $true) | ((c_and @ (c_atleast5 @ X2) @ (c_not @ (c_exactly1of2 @ (c_SNoLt @ X2 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)) @ (c_TransSet @ X4)))) = $true)) & ((c_nat_p @ X3) != $true)) & ((c_In @ X2 @ X1) = $true))))),
% 0.22/0.49 introduced(choice_axiom,[])).
% 0.22/0.49 thf(f296,plain,(
% 0.22/0.49 ? [X1] : (((c_In @ X1 @ sK1) = $true) & ? [X2] : (! [X3] : ? [X4] : ((((c_and @ (c_exactly2 @ X3) @ (c_not @ (c_exactly5 @ X4))) = $true) | ((c_ordinal @ X3) != $true)) & ((((c_ordinal @ X3) = $true) & ((c_exactly2 @ X3) != $true)) | (((c_atleast3 @ X3) != $true) & (((c_not @ (c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))) != $true) | (X3 = X4))) | ((c_atleast2 @ X3) != $true) | ((c_and @ (c_atleast5 @ X2) @ (c_not @ (c_exactly1of2 @ (c_SNoLt @ X2 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)) @ (c_TransSet @ X4)))) = $true)) & ((c_nat_p @ X3) != $true)) & ((c_In @ X2 @ X1) = $true))) => (($true = (c_In @ sK2 @ sK1)) & ? [X2] : (! [X3] : ? [X4] : ((((c_and @ (c_exactly2 @ X3) @ (c_not @ (c_exactly5 @ X4))) = $true) | ((c_ordinal @ X3) != $true)) & ((((c_ordinal @ X3) = $true) & ((c_exactly2 @ X3) != $true)) | (((c_atleast3 @ X3) != $true) & (((c_not @ (c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))) != $true) | (X3 = X4))) | ((c_atleast2 @ X3) != $true) | ((c_and @ (c_atleast5 @ X2) @ (c_not @ (c_exactly1of2 @ (c_SNoLt @ X2 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)) @ (c_TransSet @ X4)))) = $true)) & ((c_nat_p @ X3) != $true)) & ($true = (c_In @ X2 @ sK2))))),
% 0.22/0.49 introduced(choice_axiom,[])).
% 0.22/0.49 thf(f297,plain,(
% 0.22/0.49 ? [X2] : (! [X3] : ? [X4] : ((((c_and @ (c_exactly2 @ X3) @ (c_not @ (c_exactly5 @ X4))) = $true) | ((c_ordinal @ X3) != $true)) & ((((c_ordinal @ X3) = $true) & ((c_exactly2 @ X3) != $true)) | (((c_atleast3 @ X3) != $true) & (((c_not @ (c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))) != $true) | (X3 = X4))) | ((c_atleast2 @ X3) != $true) | ((c_and @ (c_atleast5 @ X2) @ (c_not @ (c_exactly1of2 @ (c_SNoLt @ X2 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)) @ (c_TransSet @ X4)))) = $true)) & ((c_nat_p @ X3) != $true)) & ($true = (c_In @ X2 @ sK2))) => (! [X3] : ? [X4] : ((((c_and @ (c_exactly2 @ X3) @ (c_not @ (c_exactly5 @ X4))) = $true) | ((c_ordinal @ X3) != $true)) & ((((c_ordinal @ X3) = $true) & ((c_exactly2 @ X3) != $true)) | (((c_atleast3 @ X3) != $true) & (((c_not @ (c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))) != $true) | (X3 = X4))) | ((c_atleast2 @ X3) != $true) | ((c_and @ (c_atleast5 @ sK3) @ (c_not @ (c_exactly1of2 @ (c_SNoLt @ sK3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)) @ (c_TransSet @ X4)))) = $true)) & ((c_nat_p @ X3) != $true)) & ((c_In @ sK3 @ sK2) = $true))),
% 0.22/0.49 introduced(choice_axiom,[])).
% 0.22/0.49 thf(f298,plain,(
% 0.22/0.49 ! [X3] : (? [X4] : ((((c_and @ (c_exactly2 @ X3) @ (c_not @ (c_exactly5 @ X4))) = $true) | ((c_ordinal @ X3) != $true)) & ((((c_ordinal @ X3) = $true) & ((c_exactly2 @ X3) != $true)) | (((c_atleast3 @ X3) != $true) & (((c_not @ (c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))) != $true) | (X3 = X4))) | ((c_atleast2 @ X3) != $true) | ((c_and @ (c_atleast5 @ sK3) @ (c_not @ (c_exactly1of2 @ (c_SNoLt @ sK3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)) @ (c_TransSet @ X4)))) = $true)) & ((c_nat_p @ X3) != $true)) => ((((c_and @ (c_exactly2 @ X3) @ (c_not @ (c_exactly5 @ (sK4 @ X3)))) = $true) | ((c_ordinal @ X3) != $true)) & ((((c_ordinal @ X3) = $true) & ((c_exactly2 @ X3) != $true)) | (((c_atleast3 @ X3) != $true) & (((c_not @ (c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))) != $true) | ((sK4 @ X3) = X3))) | ((c_atleast2 @ X3) != $true) | ((c_and @ (c_atleast5 @ sK3) @ (c_not @ (c_exactly1of2 @ (c_SNoLt @ sK3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)) @ (c_TransSet @ (sK4 @ X3))))) = $true)) & ((c_nat_p @ X3) != $true)))),
% 0.22/0.49 introduced(choice_axiom,[])).
% 0.22/0.49 thf(f291,plain,(
% 0.22/0.49 ? [X0] : (((c_In @ X0 @ c_Empty) = $true) & ? [X1] : (((c_In @ X1 @ X0) = $true) & ? [X2] : (! [X3] : ? [X4] : ((((c_and @ (c_exactly2 @ X3) @ (c_not @ (c_exactly5 @ X4))) = $true) | ((c_ordinal @ X3) != $true)) & ((((c_ordinal @ X3) = $true) & ((c_exactly2 @ X3) != $true)) | (((c_atleast3 @ X3) != $true) & (((c_not @ (c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))) != $true) | (X3 = X4))) | ((c_atleast2 @ X3) != $true) | ((c_and @ (c_atleast5 @ X2) @ (c_not @ (c_exactly1of2 @ (c_SNoLt @ X2 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)) @ (c_TransSet @ X4)))) = $true)) & ((c_nat_p @ X3) != $true)) & ((c_In @ X2 @ X1) = $true))))),
% 0.22/0.49 inference(flattening,[],[f290])).
% 0.22/0.49 thf(f290,plain,(
% 0.22/0.49 ? [X0] : (? [X1] : (? [X2] : (! [X3] : ? [X4] : ((((c_nat_p @ X3) != $true) & (((((c_and @ (c_atleast5 @ X2) @ (c_not @ (c_exactly1of2 @ (c_SNoLt @ X2 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)) @ (c_TransSet @ X4)))) = $true) | (((c_atleast3 @ X3) != $true) & (((c_not @ (c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))) != $true) | (X3 = X4)))) | ((c_atleast2 @ X3) != $true)) | (((c_ordinal @ X3) = $true) & ((c_exactly2 @ X3) != $true)))) & (((c_and @ (c_exactly2 @ X3) @ (c_not @ (c_exactly5 @ X4))) = $true) | ((c_ordinal @ X3) != $true))) & ((c_In @ X2 @ X1) = $true)) & ((c_In @ X1 @ X0) = $true)) & ((c_In @ X0 @ c_Empty) = $true))),
% 0.22/0.49 inference(ennf_transformation,[],[f115])).
% 0.22/0.49 thf(f115,plain,(
% 0.22/0.49 ~! [X0] : (((c_In @ X0 @ c_Empty) = $true) => ! [X1] : (((c_In @ X1 @ X0) = $true) => ! [X2] : (((c_In @ X2 @ X1) = $true) => ? [X3] : ! [X4] : ((((c_ordinal @ X3) = $true) => ((c_and @ (c_exactly2 @ X3) @ (c_not @ (c_exactly5 @ X4))) = $true)) => (((((c_ordinal @ X3) = $true) => ((c_exactly2 @ X3) = $true)) => (((c_atleast2 @ X3) = $true) => (((((c_not @ (c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))) = $true) => (X3 = X4)) => ((c_atleast3 @ X3) = $true)) => ((c_and @ (c_atleast5 @ X2) @ (c_not @ (c_exactly1of2 @ (c_SNoLt @ X2 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)) @ (c_TransSet @ X4)))) = $true)))) => ((c_nat_p @ X3) = $true))))))),
% 0.22/0.49 inference(fool_elimination,[],[f114])).
% 0.22/0.49 thf(f114,plain,(
% 0.22/0.49 ~! [X0] : ((c_In @ X0 @ c_Empty) => ! [X1] : ((c_In @ X1 @ X0) => ! [X2] : ((c_In @ X2 @ X1) => ? [X3] : ! [X4] : (((c_ordinal @ X3) => (c_and @ (c_exactly2 @ X3) @ (c_not @ (c_exactly5 @ X4)))) => ((((c_ordinal @ X3) => (c_exactly2 @ X3)) => ((c_atleast2 @ X3) => ((((c_not @ (c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))) => (X3 = X4)) => (c_atleast3 @ X3)) => (c_and @ (c_atleast5 @ X2) @ (c_not @ (c_exactly1of2 @ (c_SNoLt @ X2 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)) @ (c_TransSet @ X4))))))) => (c_nat_p @ X3))))))),
% 0.22/0.49 inference(rectify,[],[f110])).
% 0.22/0.49 thf(f110,negated_conjecture,(
% 0.22/0.49 ~! [X0] : ((c_In @ X0 @ c_Empty) => ! [X1] : ((c_In @ X1 @ X0) => ! [X2] : ((c_In @ X2 @ X1) => ? [X3] : ! [X4] : (((c_ordinal @ X3) => (c_and @ (c_exactly2 @ X3) @ (c_not @ (c_exactly5 @ X4)))) => ((((c_ordinal @ X3) => (c_exactly2 @ X3)) => ((c_atleast2 @ X3) => ((((c_not @ (c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))) => (X3 = X4)) => (c_atleast3 @ X3)) => (c_and @ (c_atleast5 @ X2) @ (c_not @ (c_exactly1of2 @ (c_SNoLt @ X2 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)) @ (c_TransSet @ X4))))))) => (c_nat_p @ X3))))))),
% 0.22/0.49 inference(negated_conjecture,[],[f109])).
% 0.22/0.49 thf(f109,conjecture,(
% 0.22/0.49 ! [X0] : ((c_In @ X0 @ c_Empty) => ! [X1] : ((c_In @ X1 @ X0) => ! [X2] : ((c_In @ X2 @ X1) => ? [X3] : ! [X4] : (((c_ordinal @ X3) => (c_and @ (c_exactly2 @ X3) @ (c_not @ (c_exactly5 @ X4)))) => ((((c_ordinal @ X3) => (c_exactly2 @ X3)) => ((c_atleast2 @ X3) => ((((c_not @ (c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))) => (X3 = X4)) => (c_atleast3 @ X3)) => (c_and @ (c_atleast5 @ X2) @ (c_not @ (c_exactly1of2 @ (c_SNoLt @ X2 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)) @ (c_TransSet @ X4))))))) => (c_nat_p @ X3))))))),
% 0.22/0.49 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)).
% 0.22/0.49 thf(f377,plain,(
% 0.22/0.49 ( ! [X3 : $i] : (((sK6 @ X3 @ c_Empty) = $true)) )),
% 0.22/0.49 inference(binary_proxy_clausification,[],[f375])).
% 0.22/0.49 % SZS output end Proof for theBenchmark
% 0.22/0.49 % (23474)------------------------------
% 0.22/0.49 % (23474)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.49 % (23474)Termination reason: Refutation
% 0.22/0.49
% 0.22/0.49 % (23474)Memory used [KB]: 6268
% 0.22/0.49 % (23474)Time elapsed: 0.044 s
% 0.22/0.49 % (23474)Instructions burned: 77 (million)
% 0.22/0.49 % (23474)------------------------------
% 0.22/0.49 % (23474)------------------------------
% 0.22/0.49 % (23442)Success in time 0.122 s
% 0.22/0.49 % Vampire---4.8 exiting
%------------------------------------------------------------------------------