TSTP Solution File: ITP081^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ITP081^2 : 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n015.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 : Mon May 20 22:33:27 EDT 2024
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ITP081^2 : TPTP v8.2.0. Released v7.5.0.
% 0.03/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 16:56:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH1_THM_EQU_NAR problem
% 0.13/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 % (430)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.20/0.39 % (431)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.20/0.39 % (432)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.20/0.39 % (433)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.40 % (435)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.20/0.40 % (436)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.20/0.40 % (433)Instruction limit reached!
% 0.20/0.40 % (433)------------------------------
% 0.20/0.40 % (433)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40 % (433)Termination reason: Unknown
% 0.20/0.40 % (433)Termination phase: shuffling
% 0.20/0.40
% 0.20/0.40 % (433)Memory used [KB]: 1407
% 0.20/0.40 % (433)Time elapsed: 0.003 s
% 0.20/0.40 % (433)Instructions burned: 2 (million)
% 0.20/0.40 % (433)------------------------------
% 0.20/0.40 % (433)------------------------------
% 0.20/0.40 % (431)Instruction limit reached!
% 0.20/0.40 % (431)------------------------------
% 0.20/0.40 % (431)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40 % (431)Termination reason: Unknown
% 0.20/0.40 % (431)Termination phase: shuffling
% 0.20/0.40
% 0.20/0.40 % (431)Memory used [KB]: 1407
% 0.20/0.40 % (431)Time elapsed: 0.005 s
% 0.20/0.40 % (431)Instructions burned: 5 (million)
% 0.20/0.40 % (431)------------------------------
% 0.20/0.40 % (431)------------------------------
% 0.20/0.40 % (434)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.20/0.40 % (434)Instruction limit reached!
% 0.20/0.40 % (434)------------------------------
% 0.20/0.40 % (434)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40 % (434)Termination reason: Unknown
% 0.20/0.40 % (434)Termination phase: shuffling
% 0.20/0.40
% 0.20/0.40 % (434)Memory used [KB]: 1407
% 0.20/0.40 % (434)Time elapsed: 0.003 s
% 0.20/0.40 % (434)Instructions burned: 2 (million)
% 0.20/0.40 % (434)------------------------------
% 0.20/0.40 % (434)------------------------------
% 0.20/0.41 % (436)Instruction limit reached!
% 0.20/0.41 % (436)------------------------------
% 0.20/0.41 % (436)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.41 % (436)Termination reason: Unknown
% 0.20/0.41 % (436)Termination phase: shuffling
% 0.20/0.41
% 0.20/0.41 % (436)Memory used [KB]: 1663
% 0.20/0.41 % (436)Time elapsed: 0.014 s
% 0.20/0.41 % (436)Instructions burned: 18 (million)
% 0.20/0.41 % (436)------------------------------
% 0.20/0.41 % (436)------------------------------
% 0.20/0.41 % (437)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.20/0.41 % (437)Instruction limit reached!
% 0.20/0.41 % (437)------------------------------
% 0.20/0.41 % (437)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.41 % (437)Termination reason: Unknown
% 0.20/0.41 % (437)Termination phase: shuffling
% 0.20/0.41
% 0.20/0.41 % (437)Memory used [KB]: 1407
% 0.20/0.41 % (437)Time elapsed: 0.004 s
% 0.20/0.41 % (437)Instructions burned: 3 (million)
% 0.20/0.41 % (437)------------------------------
% 0.20/0.41 % (437)------------------------------
% 0.20/0.41 % (438)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.41 % (439)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.41 % (432)Instruction limit reached!
% 0.20/0.41 % (432)------------------------------
% 0.20/0.41 % (432)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.41 % (432)Termination reason: Unknown
% 0.20/0.41 % (432)Termination phase: shuffling
% 0.20/0.41
% 0.20/0.41 % (432)Memory used [KB]: 1791
% 0.20/0.41 % (432)Time elapsed: 0.019 s
% 0.20/0.41 % (432)Instructions burned: 27 (million)
% 0.20/0.41 % (432)------------------------------
% 0.20/0.41 % (432)------------------------------
% 0.20/0.42 % (440)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.42 % (439)Instruction limit reached!
% 0.20/0.42 % (439)------------------------------
% 0.20/0.42 % (439)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.42 % (439)Termination reason: Unknown
% 0.20/0.42 % (439)Termination phase: shuffling
% 0.20/0.42
% 0.20/0.42 % (439)Memory used [KB]: 1535
% 0.20/0.42 % (439)Time elapsed: 0.009 s
% 0.20/0.42 % (439)Instructions burned: 16 (million)
% 0.20/0.42 % (439)------------------------------
% 0.20/0.42 % (439)------------------------------
% 0.20/0.42 % (440)Instruction limit reached!
% 0.20/0.42 % (440)------------------------------
% 0.20/0.42 % (440)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.42 % (440)Termination reason: Unknown
% 0.20/0.42 % (440)Termination phase: shuffling
% 0.20/0.42
% 0.20/0.42 % (440)Memory used [KB]: 1407
% 0.20/0.42 % (440)Time elapsed: 0.004 s
% 0.20/0.42 % (440)Instructions burned: 3 (million)
% 0.20/0.42 % (440)------------------------------
% 0.20/0.42 % (440)------------------------------
% 0.20/0.42 % (441)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.20/0.42 % (442)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.43 % (443)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.20/0.43 % (442)Instruction limit reached!
% 0.20/0.43 % (442)------------------------------
% 0.20/0.43 % (442)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.43 % (442)Termination reason: Unknown
% 0.20/0.43 % (442)Termination phase: shuffling
% 0.20/0.43
% 0.20/0.43 % (442)Memory used [KB]: 1407
% 0.20/0.43 % (442)Time elapsed: 0.006 s
% 0.20/0.43 % (442)Instructions burned: 7 (million)
% 0.20/0.43 % (442)------------------------------
% 0.20/0.43 % (442)------------------------------
% 0.20/0.43 % (438)Instruction limit reached!
% 0.20/0.43 % (438)------------------------------
% 0.20/0.43 % (438)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.43 % (438)Termination reason: Unknown
% 0.20/0.43 % (438)Termination phase: shuffling
% 0.20/0.43
% 0.20/0.43 % (438)Memory used [KB]: 2046
% 0.20/0.43 % (438)Time elapsed: 0.021 s
% 0.20/0.43 % (438)Instructions burned: 37 (million)
% 0.20/0.43 % (438)------------------------------
% 0.20/0.43 % (438)------------------------------
% 0.20/0.43 % (444)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.43 % (444)Instruction limit reached!
% 0.20/0.43 % (444)------------------------------
% 0.20/0.43 % (444)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.43 % (444)Termination reason: Unknown
% 0.20/0.43 % (444)Termination phase: shuffling
% 0.20/0.43
% 0.20/0.43 % (444)Memory used [KB]: 1407
% 0.20/0.43 % (444)Time elapsed: 0.003 s
% 0.20/0.43 % (444)Instructions burned: 4 (million)
% 0.20/0.43 % (444)------------------------------
% 0.20/0.43 % (444)------------------------------
% 0.20/0.44 % (443)Instruction limit reached!
% 0.20/0.44 % (443)------------------------------
% 0.20/0.44 % (443)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.44 % (443)Termination reason: Unknown
% 0.20/0.44 % (443)Termination phase: shuffling
% 0.20/0.44
% 0.20/0.44 % (443)Memory used [KB]: 1663
% 0.20/0.44 % (443)Time elapsed: 0.012 s
% 0.20/0.44 % (443)Instructions burned: 16 (million)
% 0.20/0.44 % (443)------------------------------
% 0.20/0.44 % (443)------------------------------
% 0.20/0.44 % (445)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.44 % (445)Instruction limit reached!
% 0.20/0.44 % (445)------------------------------
% 0.20/0.44 % (445)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.44 % (445)Termination reason: Unknown
% 0.20/0.44 % (445)Termination phase: shuffling
% 0.20/0.44
% 0.20/0.44 % (445)Memory used [KB]: 1407
% 0.20/0.44 % (445)Time elapsed: 0.004 s
% 0.20/0.44 % (445)Instructions burned: 3 (million)
% 0.20/0.44 % (445)------------------------------
% 0.20/0.44 % (445)------------------------------
% 0.20/0.44 % (446)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.45 % (447)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.45 % (446)Instruction limit reached!
% 0.20/0.45 % (446)------------------------------
% 0.20/0.45 % (446)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.45 % (446)Termination reason: Unknown
% 0.20/0.45 % (446)Termination phase: shuffling
% 0.20/0.45
% 0.20/0.45 % (446)Memory used [KB]: 1407
% 0.20/0.45 % (446)Time elapsed: 0.006 s
% 0.20/0.45 % (446)Instructions burned: 7 (million)
% 0.20/0.45 % (446)------------------------------
% 0.20/0.45 % (446)------------------------------
% 0.20/0.45 % (447)Instruction limit reached!
% 0.20/0.45 % (447)------------------------------
% 0.20/0.45 % (447)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.45 % (447)Termination reason: Unknown
% 0.20/0.45 % (447)Termination phase: shuffling
% 0.20/0.45
% 0.20/0.45 % (447)Memory used [KB]: 1407
% 0.20/0.45 % (447)Time elapsed: 0.003 s
% 0.20/0.45 % (447)Instructions burned: 4 (million)
% 0.20/0.45 % (447)------------------------------
% 0.20/0.45 % (447)------------------------------
% 0.20/0.45 % (448)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.20/0.45 % (448)Instruction limit reached!
% 0.20/0.45 % (448)------------------------------
% 0.20/0.45 % (448)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.45 % (448)Termination reason: Unknown
% 0.20/0.45 % (448)Termination phase: shuffling
% 0.20/0.45
% 0.20/0.45 % (448)Memory used [KB]: 1407
% 0.20/0.45 % (448)Time elapsed: 0.005 s
% 0.20/0.45 % (448)Instructions burned: 5 (million)
% 0.20/0.45 % (448)------------------------------
% 0.20/0.45 % (448)------------------------------
% 0.20/0.45 % (449)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.20/0.46 % (450)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on theBenchmark for (2999ds/710Mi)
% 0.20/0.46 % (452)dis+1002_5:1_au=on:bd=off:e2e=on:fde=none:fs=off:fsr=off:sos=on:i=902:si=on:rtra=on_0 on theBenchmark for (2999ds/902Mi)
% 0.20/0.46 % (451)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.20/0.46 % (449)Instruction limit reached!
% 0.20/0.46 % (449)------------------------------
% 0.20/0.46 % (449)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.46 % (449)Termination reason: Unknown
% 0.20/0.46 % (449)Termination phase: shuffling
% 0.20/0.46
% 0.20/0.46 % (449)Memory used [KB]: 1663
% 0.20/0.46 % (449)Time elapsed: 0.013 s
% 0.20/0.46 % (449)Instructions burned: 18 (million)
% 0.20/0.46 % (449)------------------------------
% 0.20/0.46 % (449)------------------------------
% 0.20/0.47 % (453)dis+21_1:8_apa=on:cnfonf=off:fd=off:fsr=off:hud=0:ins=1:kws=inv_frequency:nwc=10.0:ss=axioms:st=5.0:i=21:si=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.20/0.47 % (451)Instruction limit reached!
% 0.20/0.47 % (451)------------------------------
% 0.20/0.47 % (451)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.47 % (451)Termination reason: Unknown
% 0.20/0.47 % (451)Termination phase: shuffling
% 0.20/0.47
% 0.20/0.47 % (451)Memory used [KB]: 1407
% 0.20/0.47 % (451)Time elapsed: 0.006 s
% 0.20/0.47 % (451)Instructions burned: 7 (million)
% 0.20/0.47 % (451)------------------------------
% 0.20/0.47 % (451)------------------------------
% 0.20/0.48 % (454)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2999ds/5Mi)
% 0.20/0.48 % (453)Instruction limit reached!
% 0.20/0.48 % (453)------------------------------
% 0.20/0.48 % (453)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.48 % (453)Termination reason: Unknown
% 0.20/0.48 % (453)Termination phase: shuffling
% 0.20/0.48
% 0.20/0.48 % (453)Memory used [KB]: 1663
% 0.20/0.48 % (453)Time elapsed: 0.015 s
% 0.20/0.48 % (453)Instructions burned: 21 (million)
% 0.20/0.48 % (453)------------------------------
% 0.20/0.48 % (453)------------------------------
% 0.20/0.48 % (454)Instruction limit reached!
% 0.20/0.48 % (454)------------------------------
% 0.20/0.48 % (454)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.48 % (454)Termination reason: Unknown
% 0.20/0.48 % (454)Termination phase: shuffling
% 0.20/0.48
% 0.20/0.48 % (454)Memory used [KB]: 1407
% 0.20/0.48 % (454)Time elapsed: 0.005 s
% 0.20/0.48 % (454)Instructions burned: 6 (million)
% 0.20/0.48 % (454)------------------------------
% 0.20/0.48 % (454)------------------------------
% 0.20/0.48 % (455)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 (2998ds/6Mi)
% 0.20/0.48 % (455)Instruction limit reached!
% 0.20/0.48 % (455)------------------------------
% 0.20/0.48 % (455)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.48 % (455)Termination reason: Unknown
% 0.20/0.48 % (455)Termination phase: shuffling
% 0.20/0.48
% 0.20/0.48 % (455)Memory used [KB]: 1407
% 0.20/0.48 % (455)Time elapsed: 0.005 s
% 0.20/0.48 % (455)Instructions burned: 6 (million)
% 0.20/0.48 % (455)------------------------------
% 0.20/0.48 % (455)------------------------------
% 0.20/0.49 % (430)Instruction limit reached!
% 0.20/0.49 % (430)------------------------------
% 0.20/0.49 % (430)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.49 % (430)Termination reason: Unknown
% 0.20/0.49 % (430)Termination phase: Saturation
% 0.20/0.49
% 0.20/0.49 % (456)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on theBenchmark for (2998ds/377Mi)
% 0.20/0.49 % (430)Memory used [KB]: 7291
% 0.20/0.49 % (430)Time elapsed: 0.100 s
% 0.20/0.49 % (430)Instructions burned: 184 (million)
% 0.20/0.49 % (430)------------------------------
% 0.20/0.49 % (430)------------------------------
% 0.20/0.49 % (457)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.20/0.50 % (458)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.20/0.51 % (458)Instruction limit reached!
% 0.20/0.51 % (458)------------------------------
% 0.20/0.51 % (458)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.51 % (458)Termination reason: Unknown
% 0.20/0.51 % (458)Termination phase: shuffling
% 0.20/0.51
% 0.20/0.51 % (458)Memory used [KB]: 1791
% 0.20/0.51 % (458)Time elapsed: 0.012 s
% 0.20/0.51 % (458)Instructions burned: 19 (million)
% 0.20/0.51 % (458)------------------------------
% 0.20/0.51 % (458)------------------------------
% 0.20/0.51 % (459)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on theBenchmark for (2998ds/879Mi)
% 0.20/0.51 % (435)First to succeed.
% 0.20/0.52 % (435)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% 0.20/0.52 thf(type_def_5, type, set: ($tType) > $tType).
% 0.20/0.52 thf(type_def_7, type, list: ($tType) > $tType).
% 0.20/0.52 thf(type_def_8, type, product_prod: ($tType * $tType) > $tType).
% 0.20/0.52 thf(type_def_9, type, option: ($tType) > $tType).
% 0.20/0.52 thf(type_def_10, type, g: $tType).
% 0.20/0.52 thf(type_def_11, type, node: $tType).
% 0.20/0.52 thf(type_def_12, type, val: $tType).
% 0.20/0.52 thf(type_def_13, type, edgeD: $tType).
% 0.20/0.52 thf(func_def_0, type, product_prod: ($tType * $tType) > $tType).
% 0.20/0.52 thf(func_def_1, type, option: ($tType) > $tType).
% 0.20/0.52 thf(func_def_2, type, list: ($tType) > $tType).
% 0.20/0.52 thf(func_def_3, type, set: ($tType) > $tType).
% 0.20/0.52 thf(func_def_4, type, edgeD: $tType).
% 0.20/0.52 thf(func_def_5, type, node: $tType).
% 0.20/0.52 thf(func_def_6, type, val: $tType).
% 0.20/0.52 thf(func_def_7, type, g: $tType).
% 0.20/0.52 thf(func_def_8, type, type: !>[X0: $tType]:($o)).
% 0.20/0.52 thf(func_def_9, type, ord: !>[X0: $tType]:($o)).
% 0.20/0.52 thf(func_def_10, type, linorder: !>[X0: $tType]:($o)).
% 0.20/0.52 thf(func_def_11, type, finite_finite: !>[X0: $tType]:(set @ X0 > $o)).
% 0.20/0.52 thf(func_def_12, type, graph_1146196722h_path: !>[X0: $tType, X1: $tType, X2: $tType]:((X0 > list @ X1) > (X0 > $o) > (X0 > X1 > list @ product_prod @ X1 @ X2) > X0 > list @ X1 > $o)).
% 0.20/0.52 thf(func_def_13, type, graph_1661282752_path2: !>[X0: $tType, X1: $tType, X2: $tType]:((X0 > list @ X1) > (X0 > $o) > (X0 > X1 > list @ product_prod @ X1 @ X2) > X0 > X1 > list @ X1 > X1 > $o)).
% 0.20/0.52 thf(func_def_14, type, graph_1201503639essors: !>[X0: $tType, X1: $tType, X2: $tType]:((X0 > X1 > list @ product_prod @ X1 @ X2) > X0 > X1 > list @ X1)).
% 0.20/0.52 thf(func_def_15, type, append: !>[X0: $tType]:(list @ X0 > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_16, type, butlast: !>[X0: $tType]:(list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_17, type, cons: !>[X0: $tType]:(X0 > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_18, type, nil: !>[X0: $tType]:(list @ X0)).
% 0.20/0.52 thf(func_def_19, type, hd: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.52 thf(func_def_20, type, set2: !>[X0: $tType]:(list @ X0 > set @ X0)).
% 0.20/0.52 thf(func_def_21, type, tl: !>[X0: $tType]:(list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_22, type, ord_less_eq: !>[X0: $tType]:(X0 > X0 > $o)).
% 0.20/0.52 thf(func_def_23, type, sSA_CFG_SSA_phiUses: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:((X0 > list @ X1) > (X0 > X1 > list @ product_prod @ X1 @ X2) > (X0 > product_prod @ X1 @ X3 > option @ list @ X3) > X0 > X1 > set @ X3)).
% 0.20/0.52 thf(func_def_24, type, sSA_CF1081484811efNode: !>[X0: $tType, X1: $tType, X2: $tType]:((X0 > list @ X1) > (X0 > X1 > set @ X2) > (X0 > product_prod @ X1 @ X2 > option @ list @ X2) > X0 > X2 > X1)).
% 0.20/0.52 thf(func_def_25, type, sSA_CF1165125185phiArg: !>[X0: $tType, X1: $tType, X2: $tType]:((X0 > list @ X1) > (X0 > X1 > set @ X2) > (X0 > product_prod @ X1 @ X2 > option @ list @ X2) > X0 > X2 > X2 > $o)).
% 0.20/0.52 thf(func_def_26, type, collect: !>[X0: $tType]:((X0 > $o) > set @ X0)).
% 0.20/0.52 thf(func_def_27, type, prefix: !>[X0: $tType]:(list @ X0 > list @ X0 > $o)).
% 0.20/0.52 thf(func_def_28, type, suffix: !>[X0: $tType]:(list @ X0 > list @ X0 > $o)).
% 0.20/0.52 thf(func_def_29, type, member: !>[X0: $tType]:(X0 > set @ X0 > $o)).
% 0.20/0.52 thf(func_def_30, type, alpha_n: g > list @ node).
% 0.20/0.52 thf(func_def_31, type, phi_r: val).
% 0.20/0.52 thf(func_def_32, type, defs: g > node > set @ val).
% 0.20/0.52 thf(func_def_33, type, g2: g).
% 0.20/0.52 thf(func_def_34, type, i: node).
% 0.20/0.52 thf(func_def_35, type, inEdges: g > node > list @ product_prod @ node @ edgeD).
% 0.20/0.52 thf(func_def_36, type, invar: g > $o).
% 0.20/0.52 thf(func_def_37, type, m: node).
% 0.20/0.52 thf(func_def_38, type, ms: list @ node).
% 0.20/0.52 thf(func_def_39, type, ms2: list @ node).
% 0.20/0.52 thf(func_def_40, type, n: node).
% 0.20/0.52 thf(func_def_41, type, ns: list @ node).
% 0.20/0.52 thf(func_def_42, type, phis: g > product_prod @ node @ val > option @ list @ val).
% 0.20/0.52 thf(func_def_43, type, pred_phi_r: node).
% 0.20/0.52 thf(func_def_44, type, r: val).
% 0.20/0.52 thf(func_def_45, type, ri: list @ node).
% 0.20/0.52 thf(func_def_46, type, rs: list @ node).
% 0.20/0.52 thf(func_def_47, type, rs2: list @ node).
% 0.20/0.52 thf(func_def_48, type, s: val).
% 0.20/0.52 thf(func_def_59, type, sP0: !>[X0: $tType, X1: $tType]:((list @ X1 > list @ X0 > $o) > $o)).
% 0.20/0.52 thf(func_def_60, type, sP1: !>[X0: $tType, X1: $tType]:((X1 > X0 > $o) > (list @ X1 > list @ X0 > $o) > $o)).
% 0.20/0.52 thf(func_def_61, type, sP2: !>[X0: $tType]:(list @ X0 > list @ X0 > list @ X0 > list @ X0 > X0 > X0 > $o)).
% 0.20/0.52 thf(func_def_62, type, sP3: !>[X0: $tType]:(list @ X0 > list @ X0 > $o)).
% 0.20/0.52 thf(func_def_63, type, sK4: !>[X0: $tType]:(list @ X0 > list @ X0 > list @ X0 > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_64, type, sK5: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X1)).
% 0.20/0.52 thf(func_def_65, type, sK6: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X1)).
% 0.20/0.52 thf(func_def_66, type, sK7: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X0)).
% 0.20/0.52 thf(func_def_67, type, sK8: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_68, type, sK9: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X0)).
% 0.20/0.52 thf(func_def_69, type, sK10: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_70, type, sK11: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X1)).
% 0.20/0.52 thf(func_def_71, type, sK12: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X1)).
% 0.20/0.52 thf(func_def_72, type, sK13: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_73, type, sK14: !>[X0: $tType]:((list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_74, type, sK15: !>[X0: $tType]:((X0 > $o) > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_75, type, sK16: !>[X0: $tType]:((X0 > $o) > list @ X0 > X0)).
% 0.20/0.52 thf(func_def_76, type, sK17: !>[X0: $tType]:((X0 > $o) > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_77, type, sK18: !>[X0: $tType]:((X0 > $o) > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_78, type, sK19: !>[X0: $tType]:((X0 > $o) > list @ X0 > X0)).
% 0.20/0.52 thf(func_def_79, type, sK20: !>[X0: $tType]:((X0 > $o) > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_80, type, sK21: node > node > list @ node > node > g > list @ node).
% 0.20/0.52 thf(func_def_81, type, sK22: node > node > list @ node > node > g > list @ node).
% 0.20/0.52 thf(func_def_82, type, sK23: !>[X0: $tType]:(list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_83, type, sK24: !>[X0: $tType]:(list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_84, type, sK25: !>[X0: $tType]:(list @ X0 > list @ X0 > list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_85, type, sK26: !>[X0: $tType]:(list @ X0 > X0 > X0)).
% 0.20/0.52 thf(func_def_86, type, sK27: !>[X0: $tType]:(list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_87, type, sK28: !>[X0: $tType]:(list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_88, type, sK29: !>[X0: $tType]:(list @ X0 > X0 > list @ X0 > X0)).
% 0.20/0.52 thf(func_def_89, type, sK30: !>[X0: $tType]:(list @ X0 > list @ X0 > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_90, type, sK31: !>[X0: $tType]:(list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_91, type, sK32: !>[X0: $tType]:(list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_92, type, sK33: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.52 thf(func_def_93, type, sK34: !>[X0: $tType]:(list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_94, type, sK35: !>[X0: $tType]:(list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_95, type, sK36: !>[X0: $tType]:(list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_96, type, sK37: !>[X0: $tType]:(list @ list @ X0 > X0)).
% 0.20/0.52 thf(func_def_97, type, sK38: !>[X0: $tType]:(list @ list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_98, type, sK39: !>[X0: $tType]:(list @ list @ X0 > list @ list @ X0)).
% 0.20/0.52 thf(func_def_99, type, sK40: !>[X0: $tType]:(list @ list @ X0 > list @ list @ X0)).
% 0.20/0.52 thf(func_def_100, type, sK41: !>[X0: $tType]:((X0 > $o) > list @ X0 > X0)).
% 0.20/0.52 thf(func_def_101, type, sK42: !>[X0: $tType]:(list @ X0 > (X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_102, type, sK43: !>[X0: $tType]:((X0 > $o) > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_103, type, sK44: !>[X0: $tType]:((X0 > $o) > list @ X0 > X0)).
% 0.20/0.52 thf(func_def_104, type, sK45: !>[X0: $tType]:((X0 > $o) > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_105, type, sK46: !>[X0: $tType, X1: $tType]:((list @ X1 > list @ X0 > $o) > X1)).
% 0.20/0.52 thf(func_def_106, type, sK47: !>[X0: $tType, X1: $tType]:((list @ X1 > list @ X0 > $o) > list @ X1)).
% 0.20/0.52 thf(func_def_107, type, sK48: !>[X0: $tType, X1: $tType]:((list @ X1 > list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_108, type, sK49: !>[X0: $tType, X1: $tType]:((list @ X1 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_109, type, sK50: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X0)).
% 0.20/0.52 thf(func_def_110, type, sK51: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X1)).
% 0.20/0.52 thf(func_def_111, type, sK52: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X0)).
% 0.20/0.52 thf(func_def_112, type, sK53: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X1)).
% 0.20/0.52 thf(func_def_113, type, sK54: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X1)).
% 0.20/0.52 thf(func_def_114, type, sK55: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X0)).
% 0.20/0.52 thf(func_def_115, type, sK56: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_116, type, sK57: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X1)).
% 0.20/0.52 thf(func_def_117, type, sK58: node > node > list @ node > node > g > list @ node).
% 0.20/0.52 thf(func_def_118, type, sK59: node > node > list @ node > node > g > list @ node).
% 0.20/0.52 thf(func_def_119, type, sK60: node > node > list @ node > node > g > list @ node).
% 0.20/0.52 thf(func_def_120, type, sK61: !>[X0: $tType]:(list @ X0 > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_121, type, sK62: (node > $o) > node > list @ node > g > node).
% 0.20/0.52 thf(func_def_122, type, sK63: (node > $o) > node > list @ node > g > list @ node).
% 0.20/0.52 thf(func_def_123, type, sK64: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.52 thf(func_def_124, type, sK65: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.52 thf(func_def_125, type, sK66: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.52 thf(func_def_126, type, sK67: !>[X0: $tType]:(list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_127, type, sK68: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > $o) > X0 > X0 > $o)).
% 0.20/0.52 thf(func_def_128, type, sK69: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > $o) > X0 > X0 > $o)).
% 0.20/0.52 thf(func_def_129, type, sK70: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_130, type, sK71: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_131, type, sK72: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_132, type, sK73: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > $o) > X0 > X0 > $o)).
% 0.20/0.52 thf(func_def_133, type, sK74: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_134, type, sK75: node > list @ node > node > g > list @ node).
% 0.20/0.52 thf(func_def_135, type, sK76: !>[X0: $tType]:(list @ X0 > list @ X0 > list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_136, type, sK77: !>[X0: $tType]:(list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_137, type, sK78: !>[X0: $tType]:(list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_138, type, sK79: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.52 thf(func_def_139, type, sK80: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.52 thf(func_def_140, type, sK81: !>[X0: $tType]:(list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_141, type, sK82: !>[X0: $tType, X1: $tType]:((X1 > X0 > $o) > (list @ X1 > list @ X0 > $o) > X1)).
% 0.20/0.52 thf(func_def_142, type, sK83: !>[X0: $tType, X1: $tType]:((X1 > X0 > $o) > (list @ X1 > list @ X0 > $o) > list @ X1)).
% 0.20/0.52 thf(func_def_143, type, sK84: !>[X0: $tType, X1: $tType]:((X1 > X0 > $o) > (list @ X1 > list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_144, type, sK85: !>[X0: $tType, X1: $tType]:((X1 > X0 > $o) > (list @ X1 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_145, type, sK86: !>[X0: $tType, X1: $tType]:((X0 > X1 > $o) > (list @ X0 > list @ X1 > $o) > X0)).
% 0.20/0.52 thf(func_def_146, type, sK87: !>[X0: $tType, X1: $tType]:((X0 > X1 > $o) > (list @ X0 > list @ X1 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_147, type, sK88: !>[X0: $tType, X1: $tType]:((X0 > X1 > $o) > (list @ X0 > list @ X1 > $o) > X1)).
% 0.20/0.52 thf(func_def_148, type, sK89: !>[X0: $tType, X1: $tType]:((X0 > X1 > $o) > (list @ X0 > list @ X1 > $o) > list @ X1)).
% 0.20/0.52 thf(func_def_149, type, sK90: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X1)).
% 0.20/0.52 thf(func_def_150, type, sK91: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_151, type, sK92: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > X0 > X1 > $o)).
% 0.20/0.52 thf(func_def_152, type, sK93: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > X0)).
% 0.20/0.52 thf(func_def_153, type, sK94: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_154, type, sK95: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > X1)).
% 0.20/0.52 thf(func_def_155, type, sK96: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > list @ X1)).
% 0.20/0.52 thf(func_def_156, type, sK97: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > X0 > X1 > $o)).
% 0.20/0.52 thf(func_def_157, type, sK98: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > X1)).
% 0.20/0.52 thf(func_def_158, type, sK99: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > list @ X1)).
% 0.20/0.52 thf(func_def_159, type, sK100: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > X0 > X1 > $o)).
% 0.20/0.52 thf(func_def_160, type, sK101: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > X0)).
% 0.20/0.52 thf(func_def_161, type, sK102: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_162, type, sK103: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > X0 > X1 > $o)).
% 0.20/0.52 thf(func_def_163, type, sK104: !>[X0: $tType]:(X0 > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_164, type, sK105: !>[X0: $tType]:(X0 > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_165, type, sK106: !>[X0: $tType]:(X0 > list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_166, type, sK107: !>[X0: $tType]:(X0 > list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_167, type, sK108: !>[X0: $tType]:(X0 > list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_168, type, sK109: !>[X0: $tType]:(X0 > list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_169, type, sK110: !>[X0: $tType]:(X0 > list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_170, type, sK111: !>[X0: $tType]:(X0 > list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_171, type, sK112: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_172, type, sK113: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_173, type, sK114: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_174, type, sK115: !>[X0: $tType]:((list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_175, type, sK116: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_176, type, sK117: !>[X0: $tType]:((list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_177, type, sK118: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_178, type, sK119: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_179, type, sK120: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_180, type, sK121: !>[X0: $tType]:((list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_181, type, sK122: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_182, type, sK123: !>[X0: $tType]:(list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_183, type, sK124: !>[X0: $tType]:(list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_184, type, sK125: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_185, type, sK126: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_186, type, sK127: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_187, type, sK128: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_188, type, sK129: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_189, type, sK130: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_190, type, sK131: !>[X0: $tType]:(list @ X0 > X0 > list @ X0 > list @ X0 > X0 > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_191, type, sK132: !>[X0: $tType]:(list @ X0 > X0 > list @ X0 > list @ X0 > X0 > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_192, type, sK133: !>[X0: $tType]:(list @ X0 > X0 > list @ X0 > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_193, type, sK134: !>[X0: $tType]:(list @ X0 > list @ X0 > X0)).
% 0.20/0.52 thf(func_def_194, type, sK135: !>[X0: $tType]:(list @ X0 > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_195, type, sK136: !>[X0: $tType]:(list @ X0 > list @ X0 > X0)).
% 0.20/0.52 thf(func_def_196, type, sK137: !>[X0: $tType]:(list @ X0 > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_197, type, sK138: !>[X0: $tType]:(list @ X0 > list @ X0 > X0)).
% 0.20/0.52 thf(func_def_198, type, sK139: !>[X0: $tType]:(list @ X0 > list @ X0 > X0)).
% 0.20/0.52 thf(func_def_199, type, sK140: !>[X0: $tType]:(list @ X0 > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_200, type, sK141: !>[X0: $tType]:(list @ X0 > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_201, type, sK142: !>[X0: $tType]:(list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_202, type, sK143: !>[X0: $tType]:(list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_203, type, sK144: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > X0 > X0 > $o)).
% 0.20/0.52 thf(func_def_204, type, sK145: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_205, type, sK146: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > X0 > X0 > $o)).
% 0.20/0.52 thf(func_def_206, type, sK147: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_207, type, sK148: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_208, type, sK149: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_209, type, sK150: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_210, type, sK151: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > X0 > X0 > $o)).
% 0.20/0.52 thf(func_def_211, type, sK152: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_212, type, sK153: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_213, type, sK154: node > node > list @ node > node > g > list @ node).
% 0.20/0.52 thf(func_def_214, type, sK155: node > node > list @ node > node > g > list @ node).
% 0.20/0.52 thf(func_def_215, type, sK156: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_216, type, sK157: !>[X0: $tType]:((list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_217, type, sK158: !>[X0: $tType]:((X0 > $o) > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_218, type, sK159: !>[X0: $tType]:((X0 > $o) > list @ X0 > X0)).
% 0.20/0.52 thf(func_def_219, type, sK160: !>[X0: $tType]:((X0 > $o) > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_220, type, sK161: !>[X0: $tType]:((X0 > $o) > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_221, type, sK162: !>[X0: $tType]:((X0 > $o) > list @ X0 > X0)).
% 0.20/0.52 thf(func_def_222, type, sK163: !>[X0: $tType]:((X0 > $o) > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_223, type, sK164: !>[X0: $tType]:(list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_224, type, sK165: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.52 thf(func_def_225, type, sK166: (node > $o) > list @ node > node > g > node).
% 0.20/0.52 thf(func_def_226, type, sK167: (node > $o) > list @ node > node > g > list @ node).
% 0.20/0.52 thf(func_def_227, type, sK168: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > $o) > X0 > X0 > $o)).
% 0.20/0.52 thf(func_def_228, type, sK169: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > $o) > X0 > X0 > $o)).
% 0.20/0.52 thf(func_def_229, type, sK170: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_230, type, sK171: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_231, type, sK172: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_232, type, sK173: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_233, type, sK174: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_234, type, sK175: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_235, type, sK176: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X2 > X1) > list @ X0 > list @ X2 > $o) > X0 > X2 > X1)).
% 0.20/0.52 thf(func_def_236, type, sK177: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X2 > X1) > list @ X0 > list @ X2 > $o) > X0 > X2 > X1)).
% 0.20/0.52 thf(func_def_237, type, sK178: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X2 > X1) > list @ X0 > list @ X2 > $o) > X0)).
% 0.20/0.52 thf(func_def_238, type, sK179: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X2 > X1) > list @ X0 > list @ X2 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_239, type, sK180: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X2 > X1) > list @ X0 > list @ X2 > $o) > X0 > X2 > X1)).
% 0.20/0.52 thf(func_def_240, type, sK181: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X2 > X1) > list @ X0 > list @ X2 > $o) > X0)).
% 0.20/0.52 thf(func_def_241, type, sK182: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X2 > X1) > list @ X0 > list @ X2 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_242, type, sK183: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X2 > X1) > list @ X0 > list @ X2 > $o) > X2)).
% 0.20/0.52 thf(func_def_243, type, sK184: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X2 > X1) > list @ X0 > list @ X2 > $o) > list @ X2)).
% 0.20/0.52 thf(func_def_244, type, sK185: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X2 > X1) > list @ X0 > list @ X2 > $o) > X0 > X2 > X1)).
% 0.20/0.52 thf(func_def_245, type, sK186: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X2 > X1) > list @ X0 > list @ X2 > $o) > X2)).
% 0.20/0.52 thf(func_def_246, type, sK187: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X2 > X1) > list @ X0 > list @ X2 > $o) > list @ X2)).
% 0.20/0.52 thf(func_def_247, type, sK188: !>[X0: $tType]:(list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_248, type, sK189: !>[X0: $tType]:(list @ X0 > X0 > list @ X0)).
% 0.20/0.52 thf(func_def_249, type, sK190: !>[X0: $tType]:(list @ X0 > X0 > list @ X0 > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_250, type, sK191: !>[X0: $tType, X1: $tType]:(((X0 > X1) > list @ X0 > list @ X1 > $o) > X0 > X1)).
% 0.20/0.52 thf(func_def_251, type, sK192: !>[X0: $tType, X1: $tType]:(((X0 > X1) > list @ X0 > list @ X1 > $o) > list @ X1)).
% 0.20/0.52 thf(func_def_252, type, sK193: !>[X0: $tType, X1: $tType]:(((X0 > X1) > list @ X0 > list @ X1 > $o) > X0 > X1)).
% 0.20/0.52 thf(func_def_253, type, sK194: !>[X0: $tType, X1: $tType]:(((X0 > X1) > list @ X0 > list @ X1 > $o) > X0)).
% 0.20/0.52 thf(func_def_254, type, sK195: !>[X0: $tType, X1: $tType]:(((X0 > X1) > list @ X0 > list @ X1 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_255, type, sK196: !>[X0: $tType, X1: $tType]:(((X0 > X1) > list @ X0 > list @ X1 > $o) > list @ X1)).
% 0.20/0.52 thf(func_def_256, type, sK197: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X1)).
% 0.20/0.52 thf(func_def_257, type, sK198: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_258, type, sK199: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X1)).
% 0.20/0.52 thf(func_def_259, type, sK200: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X0)).
% 0.20/0.52 thf(func_def_260, type, sK201: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_261, type, sK202: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X1)).
% 0.20/0.52 thf(func_def_262, type, sK203: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X0)).
% 0.20/0.52 thf(func_def_263, type, sK204: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_264, type, sK205: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X1)).
% 0.20/0.52 thf(func_def_265, type, sK206: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X1)).
% 0.20/0.52 thf(func_def_266, type, sK207: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X1)).
% 0.20/0.52 thf(func_def_267, type, sK208: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X1)).
% 0.20/0.52 thf(func_def_268, type, sK209: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X0)).
% 0.20/0.52 thf(func_def_269, type, sK210: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_270, type, sK211: node).
% 0.20/0.52 thf(func_def_271, type, sK212: list @ node).
% 0.20/0.52 thf(func_def_272, type, sK213: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_273, type, sK214: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_274, type, sK215: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_275, type, sK216: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_276, type, sK217: !>[X0: $tType, X1: $tType]:(((X1 > X0) > list @ X1 > $o) > X1 > X0)).
% 0.20/0.52 thf(func_def_277, type, sK218: !>[X0: $tType, X1: $tType]:(((X1 > X0) > list @ X1 > $o) > X1)).
% 0.20/0.52 thf(func_def_278, type, sK219: !>[X0: $tType, X1: $tType]:(((X1 > X0) > list @ X1 > $o) > X1 > X0)).
% 0.20/0.52 thf(func_def_279, type, sK220: !>[X0: $tType, X1: $tType]:(((X1 > X0) > list @ X1 > $o) > X1)).
% 0.20/0.52 thf(func_def_280, type, sK221: !>[X0: $tType, X1: $tType]:(((X1 > X0) > list @ X1 > $o) > X1)).
% 0.20/0.52 thf(func_def_281, type, sK222: !>[X0: $tType, X1: $tType]:(((X1 > X0) > list @ X1 > $o) > list @ X1)).
% 0.20/0.52 thf(func_def_282, type, sK223: !>[X0: $tType, X1: $tType]:(((X1 > X0) > list @ X1 > $o) > X1 > X0)).
% 0.20/0.52 thf(func_def_283, type, sK224: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_284, type, sK225: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_285, type, sK226: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_286, type, sK227: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_287, type, sK228: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_288, type, sK229: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_289, type, sK230: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_290, type, sK231: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_291, type, sK232: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_292, type, sK233: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_293, type, sK234: !>[X0: $tType]:((X0 > $o) > list @ X0 > X0)).
% 0.20/0.52 thf(func_def_294, type, sK235: !>[X0: $tType]:(list @ X0 > (X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_295, type, sK236: !>[X0: $tType]:((X0 > $o) > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_296, type, sK237: !>[X0: $tType]:((X0 > $o) > list @ X0 > X0)).
% 0.20/0.52 thf(func_def_297, type, sK238: !>[X0: $tType]:((X0 > $o) > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_298, type, sK239: !>[X0: $tType]:((X0 > $o) > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_299, type, sK240: !>[X0: $tType]:((X0 > $o) > list @ X0 > X0)).
% 0.20/0.52 thf(func_def_300, type, sK241: !>[X0: $tType]:((X0 > $o) > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_301, type, sK242: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.52 thf(func_def_302, type, sK243: !>[X0: $tType]:(list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_303, type, sK244: !>[X0: $tType]:((X0 > $o) > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_304, type, sK245: !>[X0: $tType]:((X0 > $o) > list @ X0 > X0)).
% 0.20/0.52 thf(func_def_305, type, sK246: !>[X0: $tType]:((X0 > $o) > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_306, type, sK247: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_307, type, sK248: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_308, type, sK249: !>[X0: $tType]:((list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_309, type, sK250: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_310, type, sK251: !>[X0: $tType, X1: $tType]:((X1 > X0) > (X1 > X0) > X1)).
% 0.20/0.52 thf(func_def_311, type, sK252: !>[X0: $tType]:(X0 > list @ X0 > list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_312, type, sK253: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.52 thf(func_def_313, type, sK254: !>[X0: $tType]:(list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_314, type, sK255: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_315, type, sK256: !>[X0: $tType]:((list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_316, type, sK257: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_317, type, sK258: !>[X0: $tType]:((list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_318, type, sK259: !>[X0: $tType]:(list @ X0 > X0 > list @ X0 > X0)).
% 0.20/0.52 thf(func_def_319, type, sK260: !>[X0: $tType]:(list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_320, type, sK261: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.52 thf(func_def_321, type, sK262: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_322, type, sK263: !>[X0: $tType]:((list @ X0 > $o) > list @ X0)).
% 0.20/0.52 thf(func_def_323, type, sK264: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.52 thf(func_def_324, type, sK265: !>[X0: $tType]:(list @ X0 > list @ X0)).
% 0.20/0.52 thf(func_def_325, type, sK266: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.52 thf(func_def_326, type, sK267: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.52 thf(func_def_327, type, sK268: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.52 thf(func_def_329, type, ph270: !>[X0: $tType]:(X0)).
% 0.20/0.52 thf(f1796,plain,(
% 0.20/0.52 $false),
% 0.20/0.52 inference(subsumption_resolution,[],[f1795,f1403])).
% 0.20/0.52 thf(f1403,plain,(
% 0.20/0.52 ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r)) = $true)),
% 0.20/0.52 inference(cnf_transformation,[],[f614])).
% 0.20/0.52 thf(f614,plain,(
% 0.20/0.52 ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r)) = $true)),
% 0.20/0.52 inference(fool_elimination,[],[f613])).
% 0.20/0.52 thf(f613,plain,(
% 0.20/0.52 (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r))),
% 0.20/0.52 inference(rectify,[],[f4])).
% 0.20/0.52 thf(f4,axiom,(
% 0.20/0.52 (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r))),
% 0.20/0.52 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_assms_I7_J)).
% 0.20/0.52 thf(f1795,plain,(
% 0.20/0.52 ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r)) != $true)),
% 0.20/0.52 inference(trivial_inequality_removal,[],[f1794])).
% 0.20/0.52 thf(f1794,plain,(
% 0.20/0.52 ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r)) != $true) | ($true != $true)),
% 0.20/0.52 inference(superposition,[],[f1793,f1677])).
% 0.20/0.52 thf(f1677,plain,(
% 0.20/0.52 ($true = (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r) @ ri @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r)))),
% 0.20/0.52 inference(definition_unfolding,[],[f1401,f1672])).
% 0.20/0.52 thf(f1672,plain,(
% 0.20/0.52 (i = (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r))),
% 0.20/0.52 inference(cnf_transformation,[],[f2])).
% 0.20/0.52 thf(f2,axiom,(
% 0.20/0.52 (i = (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r))),
% 0.20/0.52 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_ri__is__valid)).
% 0.20/0.52 thf(f1401,plain,(
% 0.20/0.52 ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r) @ ri @ i) = $true)),
% 0.20/0.52 inference(cnf_transformation,[],[f278])).
% 0.20/0.52 thf(f278,plain,(
% 0.20/0.52 ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r) @ ri @ i) = $true)),
% 0.20/0.52 inference(fool_elimination,[],[f277])).
% 0.20/0.52 thf(f277,plain,(
% 0.20/0.52 (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r) @ ri @ i)),
% 0.20/0.52 inference(rectify,[],[f5])).
% 0.20/0.52 thf(f5,axiom,(
% 0.20/0.52 (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r) @ ri @ i)),
% 0.20/0.52 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_4_ri__props_I1_J)).
% 0.20/0.52 thf(f1793,plain,(
% 0.20/0.52 ( ! [X0 : node] : (((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ X0 @ ri @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r)) != $true) | ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ X0) != $true)) )),
% 0.20/0.52 inference(trivial_inequality_removal,[],[f1792])).
% 0.20/0.52 thf(f1792,plain,(
% 0.20/0.52 ( ! [X0 : node] : (((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ X0 @ ri @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r)) != $true) | ($true != $true) | ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ X0) != $true)) )),
% 0.20/0.52 inference(superposition,[],[f1638,f1402])).
% 0.20/0.52 thf(f1402,plain,(
% 0.20/0.52 ( ! [X2 : list @ node,X3 : node,X0 : g,X1 : node,X4 : list @ node,X5 : node] : (((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X0 @ X1 @ (append @ node @ X2 @ (tl @ node @ X4)) @ X5) = $true) | ($true != (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X0 @ X3 @ X4 @ X5)) | ($true != (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X0 @ X1 @ X2 @ X3))) )),
% 0.20/0.52 inference(cnf_transformation,[],[f849])).
% 0.20/0.52 thf(f849,plain,(
% 0.20/0.52 ! [X0 : g,X1 : node,X2 : list @ node,X3 : node,X4 : list @ node,X5 : node] : (($true != (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X0 @ X1 @ X2 @ X3)) | ($true != (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X0 @ X3 @ X4 @ X5)) | ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X0 @ X1 @ (append @ node @ X2 @ (tl @ node @ X4)) @ X5) = $true))),
% 0.20/0.52 inference(flattening,[],[f848])).
% 0.20/0.52 thf(f848,plain,(
% 0.20/0.52 ! [X0 : g,X1 : node,X2 : list @ node,X3 : node,X4 : list @ node,X5 : node] : ((((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X0 @ X1 @ (append @ node @ X2 @ (tl @ node @ X4)) @ X5) = $true) | ($true != (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X0 @ X3 @ X4 @ X5))) | ($true != (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X0 @ X1 @ X2 @ X3)))),
% 0.20/0.52 inference(ennf_transformation,[],[f688])).
% 0.20/0.52 thf(f688,plain,(
% 0.20/0.52 ! [X0 : g,X1 : node,X2 : list @ node,X3 : node,X4 : list @ node,X5 : node] : (($true = (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X0 @ X1 @ X2 @ X3)) => (($true = (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X0 @ X3 @ X4 @ X5)) => ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X0 @ X1 @ (append @ node @ X2 @ (tl @ node @ X4)) @ X5) = $true)))),
% 0.20/0.52 inference(fool_elimination,[],[f687])).
% 0.20/0.52 thf(f687,plain,(
% 0.20/0.52 ! [X0 : g,X1 : node,X2 : list @ node,X3 : node,X4 : list @ node,X5 : node] : ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X0 @ X1 @ X2 @ X3) => ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X0 @ X3 @ X4 @ X5) => (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X0 @ X1 @ (append @ node @ X2 @ (tl @ node @ X4)) @ X5)))),
% 0.20/0.52 inference(rectify,[],[f6])).
% 0.20/0.52 thf(f6,axiom,(
% 0.20/0.52 ! [X5 : g,X6 : node,X7 : list @ node,X8 : node,X9 : list @ node,X10 : node] : ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X5 @ X6 @ X7 @ X8) => ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X5 @ X8 @ X9 @ X10) => (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X5 @ X6 @ (append @ node @ X7 @ (tl @ node @ X9)) @ X10)))),
% 0.20/0.52 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_5_old_Opath2__app)).
% 0.20/0.52 thf(f1638,plain,(
% 0.20/0.52 ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append @ node @ ns @ (tl @ node @ ri)) @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r)) != $true)),
% 0.20/0.52 inference(cnf_transformation,[],[f695])).
% 0.20/0.52 thf(f695,plain,(
% 0.20/0.52 ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append @ node @ ns @ (tl @ node @ ri)) @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r)) != $true)),
% 0.20/0.52 inference(flattening,[],[f646])).
% 0.20/0.52 thf(f646,plain,(
% 0.20/0.52 ~((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append @ node @ ns @ (tl @ node @ ri)) @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r)) = $true)),
% 0.20/0.52 inference(fool_elimination,[],[f645])).
% 0.20/0.52 thf(f645,plain,(
% 0.20/0.52 ~(graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append @ node @ ns @ (tl @ node @ ri)) @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r))),
% 0.20/0.52 inference(rectify,[],[f265])).
% 0.20/0.52 thf(f265,negated_conjecture,(
% 0.20/0.52 ~(graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append @ node @ ns @ (tl @ node @ ri)) @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r))),
% 0.20/0.52 inference(negated_conjecture,[],[f264])).
% 0.20/0.52 thf(f264,conjecture,(
% 0.20/0.52 (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append @ node @ ns @ (tl @ node @ ri)) @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r))),
% 0.20/0.52 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0)).
% 0.20/0.52 % SZS output end Proof for theBenchmark
% 0.20/0.52 % (435)------------------------------
% 0.20/0.52 % (435)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.52 % (435)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (435)Memory used [KB]: 7803
% 0.20/0.52 % (435)Time elapsed: 0.121 s
% 0.20/0.52 % (435)Instructions burned: 207 (million)
% 0.20/0.52 % (435)------------------------------
% 0.20/0.52 % (435)------------------------------
% 0.20/0.52 % (429)Success in time 0.157 s
% 0.20/0.52 % Vampire---4.8 exiting
%------------------------------------------------------------------------------