TSTP Solution File: LCL863^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL863^1 : TPTP v8.2.0. Bugfixed v5.0.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 : n018.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 00:23:31 EDT 2024
% Result : Theorem 0.22s 0.50s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL863^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% 0.13/0.15 % 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.15/0.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 02:51:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_EQU_NAR problem
% 0.15/0.37 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.15/0.40 % (16149)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.40 % (16150)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.40 % (16152)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.40 % (16151)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.40 % (16153)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.40 % (16154)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.40 % (16155)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.40 % (16152)Instruction limit reached!
% 0.15/0.40 % (16152)------------------------------
% 0.15/0.40 % (16152)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (16152)Termination reason: Unknown
% 0.15/0.40 % (16152)Termination phase: shuffling
% 0.15/0.40 % (16153)Instruction limit reached!
% 0.15/0.40 % (16153)------------------------------
% 0.15/0.40 % (16153)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (16153)Termination reason: Unknown
% 0.15/0.40 % (16153)Termination phase: shuffling
% 0.15/0.40
% 0.15/0.40 % (16153)Memory used [KB]: 1023
% 0.15/0.40 % (16153)Time elapsed: 0.004 s
% 0.15/0.40 % (16153)Instructions burned: 2 (million)
% 0.15/0.40 % (16153)------------------------------
% 0.15/0.40 % (16153)------------------------------
% 0.15/0.40
% 0.15/0.40 % (16152)Memory used [KB]: 1023
% 0.15/0.40 % (16152)Time elapsed: 0.004 s
% 0.15/0.40 % (16152)Instructions burned: 2 (million)
% 0.15/0.40 % (16152)------------------------------
% 0.15/0.40 % (16152)------------------------------
% 0.15/0.40 % (16156)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.40 % (16150)Instruction limit reached!
% 0.15/0.40 % (16150)------------------------------
% 0.15/0.40 % (16150)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (16150)Termination reason: Unknown
% 0.15/0.40 % (16150)Termination phase: Property scanning
% 0.15/0.40
% 0.15/0.40 % (16150)Memory used [KB]: 1023
% 0.15/0.40 % (16150)Time elapsed: 0.006 s
% 0.15/0.40 % (16150)Instructions burned: 4 (million)
% 0.15/0.40 % (16150)------------------------------
% 0.15/0.40 % (16150)------------------------------
% 0.15/0.40 % (16156)Instruction limit reached!
% 0.15/0.40 % (16156)------------------------------
% 0.15/0.40 % (16156)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (16156)Termination reason: Unknown
% 0.15/0.40 % (16156)Termination phase: shuffling
% 0.15/0.40
% 0.15/0.40 % (16156)Memory used [KB]: 1023
% 0.15/0.40 % (16156)Time elapsed: 0.005 s
% 0.15/0.40 % (16156)Instructions burned: 3 (million)
% 0.15/0.40 % (16156)------------------------------
% 0.15/0.40 % (16156)------------------------------
% 0.15/0.42 % (16155)Instruction limit reached!
% 0.15/0.42 % (16155)------------------------------
% 0.15/0.42 % (16155)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.42 % (16155)Termination reason: Unknown
% 0.15/0.42 % (16155)Termination phase: Saturation
% 0.15/0.42
% 0.15/0.42 % (16155)Memory used [KB]: 5628
% 0.15/0.42 % (16155)Time elapsed: 0.018 s
% 0.15/0.42 % (16155)Instructions burned: 18 (million)
% 0.15/0.42 % (16155)------------------------------
% 0.15/0.42 % (16155)------------------------------
% 0.15/0.43 % (16151)Instruction limit reached!
% 0.15/0.43 % (16151)------------------------------
% 0.15/0.43 % (16151)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.43 % (16151)Termination reason: Unknown
% 0.15/0.43 % (16151)Termination phase: Saturation
% 0.15/0.43
% 0.15/0.43 % (16151)Memory used [KB]: 5756
% 0.15/0.43 % (16151)Time elapsed: 0.029 s
% 0.15/0.43 % (16151)Instructions burned: 27 (million)
% 0.15/0.43 % (16151)------------------------------
% 0.15/0.43 % (16151)------------------------------
% 0.15/0.43 % (16157)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.43 % (16158)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.43 % (16159)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.43 % (16160)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.43 % (16159)Instruction limit reached!
% 0.15/0.43 % (16159)------------------------------
% 0.15/0.43 % (16159)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.43 % (16159)Termination reason: Unknown
% 0.15/0.43 % (16159)Termination phase: shuffling
% 0.15/0.43
% 0.15/0.43 % (16159)Memory used [KB]: 1023
% 0.15/0.43 % (16159)Time elapsed: 0.005 s
% 0.15/0.43 % (16159)Instructions burned: 3 (million)
% 0.15/0.43 % (16159)------------------------------
% 0.15/0.43 % (16159)------------------------------
% 0.22/0.44 % (16158)Instruction limit reached!
% 0.22/0.44 % (16158)------------------------------
% 0.22/0.44 % (16158)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (16158)Termination reason: Unknown
% 0.22/0.44 % (16158)Termination phase: Saturation
% 0.22/0.44
% 0.22/0.44 % (16158)Memory used [KB]: 5628
% 0.22/0.44 % (16158)Time elapsed: 0.016 s
% 0.22/0.44 % (16158)Instructions burned: 16 (million)
% 0.22/0.44 % (16158)------------------------------
% 0.22/0.44 % (16158)------------------------------
% 0.22/0.44 % (16161)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.22/0.45 % (16161)Instruction limit reached!
% 0.22/0.45 % (16161)------------------------------
% 0.22/0.45 % (16161)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.45 % (16161)Termination reason: Unknown
% 0.22/0.45 % (16161)Termination phase: Property scanning
% 0.22/0.45
% 0.22/0.45 % (16161)Memory used [KB]: 1023
% 0.22/0.45 % (16161)Time elapsed: 0.008 s
% 0.22/0.45 % (16161)Instructions burned: 7 (million)
% 0.22/0.45 % (16161)------------------------------
% 0.22/0.45 % (16161)------------------------------
% 0.22/0.45 % (16157)Instruction limit reached!
% 0.22/0.45 % (16157)------------------------------
% 0.22/0.45 % (16157)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.45 % (16162)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.22/0.45 % (16157)Termination reason: Unknown
% 0.22/0.45 % (16157)Termination phase: Saturation
% 0.22/0.45
% 0.22/0.45 % (16157)Memory used [KB]: 5756
% 0.22/0.45 % (16157)Time elapsed: 0.027 s
% 0.22/0.45 % (16157)Instructions burned: 37 (million)
% 0.22/0.45 % (16157)------------------------------
% 0.22/0.45 % (16157)------------------------------
% 0.22/0.45 % (16163)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.45 % (16163)Instruction limit reached!
% 0.22/0.45 % (16163)------------------------------
% 0.22/0.45 % (16163)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.45 % (16163)Termination reason: Unknown
% 0.22/0.45 % (16163)Termination phase: shuffling
% 0.22/0.45
% 0.22/0.45 % (16163)Memory used [KB]: 1023
% 0.22/0.45 % (16163)Time elapsed: 0.003 s
% 0.22/0.45 % (16163)Instructions burned: 3 (million)
% 0.22/0.45 % (16163)------------------------------
% 0.22/0.45 % (16163)------------------------------
% 0.22/0.46 % (16164)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.46 % (16164)Instruction limit reached!
% 0.22/0.46 % (16164)------------------------------
% 0.22/0.46 % (16164)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.46 % (16164)Termination reason: Unknown
% 0.22/0.46 % (16164)Termination phase: shuffling
% 0.22/0.46
% 0.22/0.46 % (16164)Memory used [KB]: 1023
% 0.22/0.46 % (16164)Time elapsed: 0.004 s
% 0.22/0.46 % (16164)Instructions burned: 4 (million)
% 0.22/0.46 % (16164)------------------------------
% 0.22/0.46 % (16164)------------------------------
% 0.22/0.46 % (16162)Instruction limit reached!
% 0.22/0.46 % (16162)------------------------------
% 0.22/0.46 % (16162)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.46 % (16162)Termination reason: Unknown
% 0.22/0.46 % (16162)Termination phase: Saturation
% 0.22/0.46
% 0.22/0.46 % (16162)Memory used [KB]: 5884
% 0.22/0.46 % (16162)Time elapsed: 0.014 s
% 0.22/0.46 % (16162)Instructions burned: 16 (million)
% 0.22/0.46 % (16162)------------------------------
% 0.22/0.46 % (16162)------------------------------
% 0.22/0.46 % (16165)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.47 % (16166)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.47 % (16166)Instruction limit reached!
% 0.22/0.47 % (16166)------------------------------
% 0.22/0.47 % (16166)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.47 % (16166)Termination reason: Unknown
% 0.22/0.47 % (16166)Termination phase: Property scanning
% 0.22/0.47
% 0.22/0.47 % (16166)Memory used [KB]: 1023
% 0.22/0.47 % (16166)Time elapsed: 0.004 s
% 0.22/0.47 % (16166)Instructions burned: 4 (million)
% 0.22/0.47 % (16166)------------------------------
% 0.22/0.47 % (16166)------------------------------
% 0.22/0.47 % (16165)Instruction limit reached!
% 0.22/0.47 % (16165)------------------------------
% 0.22/0.47 % (16165)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.47 % (16165)Termination reason: Unknown
% 0.22/0.47 % (16165)Termination phase: Function definition elimination
% 0.22/0.47
% 0.22/0.47 % (16165)Memory used [KB]: 1023
% 0.22/0.47 % (16165)Time elapsed: 0.005 s
% 0.22/0.47 % (16165)Instructions burned: 8 (million)
% 0.22/0.47 % (16165)------------------------------
% 0.22/0.47 % (16165)------------------------------
% 0.22/0.47 % (16167)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.47 % (16167)Instruction limit reached!
% 0.22/0.47 % (16167)------------------------------
% 0.22/0.47 % (16167)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.47 % (16167)Termination reason: Unknown
% 0.22/0.47 % (16167)Termination phase: shuffling
% 0.22/0.47
% 0.22/0.47 % (16167)Memory used [KB]: 1023
% 0.22/0.47 % (16167)Time elapsed: 0.003 s
% 0.22/0.47 % (16167)Instructions burned: 4 (million)
% 0.22/0.47 % (16167)------------------------------
% 0.22/0.47 % (16167)------------------------------
% 0.22/0.47 % (16168)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.48 % (16169)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.48 % (16170)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.22/0.48 % (16171)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.48 % (16168)Instruction limit reached!
% 0.22/0.48 % (16168)------------------------------
% 0.22/0.48 % (16168)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.48 % (16168)Termination reason: Unknown
% 0.22/0.48 % (16168)Termination phase: Saturation
% 0.22/0.48
% 0.22/0.48 % (16168)Memory used [KB]: 5628
% 0.22/0.48 % (16168)Time elapsed: 0.012 s
% 0.22/0.48 % (16168)Instructions burned: 18 (million)
% 0.22/0.48 % (16168)------------------------------
% 0.22/0.48 % (16168)------------------------------
% 0.22/0.49 % (16172)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.49 % (16170)Instruction limit reached!
% 0.22/0.49 % (16170)------------------------------
% 0.22/0.49 % (16170)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.49 % (16170)Termination reason: Unknown
% 0.22/0.49 % (16170)Termination phase: Property scanning
% 0.22/0.49
% 0.22/0.49 % (16170)Memory used [KB]: 1023
% 0.22/0.49 % (16170)Time elapsed: 0.005 s
% 0.22/0.49 % (16170)Instructions burned: 6 (million)
% 0.22/0.49 % (16170)------------------------------
% 0.22/0.49 % (16170)------------------------------
% 0.22/0.49 % (16171)Refutation not found, incomplete strategy
% 0.22/0.49 % (16171)------------------------------
% 0.22/0.49 % (16171)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.49 % (16171)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.49
% 0.22/0.49
% 0.22/0.49 % (16171)Memory used [KB]: 5628
% 0.22/0.49 % (16171)Time elapsed: 0.007 s
% 0.22/0.49 % (16171)Instructions burned: 9 (million)
% 0.22/0.49 % (16171)------------------------------
% 0.22/0.49 % (16171)------------------------------
% 0.22/0.49 % (16160)First to succeed.
% 0.22/0.50 % (16172)Instruction limit reached!
% 0.22/0.50 % (16172)------------------------------
% 0.22/0.50 % (16172)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.50 % (16172)Termination reason: Unknown
% 0.22/0.50 % (16172)Termination phase: Saturation
% 0.22/0.50
% 0.22/0.50 % (16172)Memory used [KB]: 5756
% 0.22/0.50 % (16172)Time elapsed: 0.013 s
% 0.22/0.50 % (16172)Instructions burned: 21 (million)
% 0.22/0.50 % (16172)------------------------------
% 0.22/0.50 % (16172)------------------------------
% 0.22/0.50 % (16160)Refutation found. Thanks to Tanya!
% 0.22/0.50 % SZS status Theorem for theBenchmark
% 0.22/0.50 % SZS output start Proof for theBenchmark
% 0.22/0.50 thf(type_def_5, type, mu: $tType).
% 0.22/0.50 thf(func_def_0, type, mu: $tType).
% 0.22/0.50 thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.22/0.50 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.50 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.22/0.50 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.50 thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.50 thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.50 thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.50 thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.50 thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.50 thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.22/0.50 thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.22/0.50 thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.22/0.50 thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.22/0.50 thf(func_def_15, type, mtrue: $i > $o).
% 0.22/0.50 thf(func_def_16, type, mfalse: $i > $o).
% 0.22/0.50 thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.22/0.50 thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.22/0.50 thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.22/0.50 thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.22/0.50 thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.22/0.50 thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.22/0.50 thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.22/0.50 thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.22/0.50 thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.22/0.50 thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.22/0.50 thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.22/0.50 thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.22/0.50 thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.22/0.50 thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.22/0.50 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.22/0.50 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.22/0.50 thf(func_def_50, type, ph1: !>[X0: $tType]:(X0)).
% 0.22/0.50 thf(func_def_51, type, sK2: $i > $i > $o).
% 0.22/0.50 thf(func_def_54, type, sK5: $i > $i).
% 0.22/0.50 thf(f736,plain,(
% 0.22/0.50 $false),
% 0.22/0.50 inference(avatar_sat_refutation,[],[f153,f160,f190,f209,f215,f223,f234,f478,f535,f553,f712,f729])).
% 0.22/0.50 thf(f729,plain,(
% 0.22/0.50 ~spl0_2 | ~spl0_9),
% 0.22/0.50 inference(avatar_contradiction_clause,[],[f728])).
% 0.22/0.50 thf(f728,plain,(
% 0.22/0.50 $false | (~spl0_2 | ~spl0_9)),
% 0.22/0.50 inference(trivial_inequality_removal,[],[f718])).
% 0.22/0.50 thf(f718,plain,(
% 0.22/0.50 ($false = $true) | (~spl0_2 | ~spl0_9)),
% 0.22/0.50 inference(superposition,[],[f717,f545])).
% 0.22/0.50 thf(f545,plain,(
% 0.22/0.50 ( ! [X1 : $i] : (((sK2 @ X1 @ X1) = $true)) ) | ~spl0_2),
% 0.22/0.50 inference(beta_eta_normalization,[],[f544])).
% 0.22/0.50 thf(f544,plain,(
% 0.22/0.50 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (sK2 @ Y0 @ Y0)) @ X1))) ) | ~spl0_2),
% 0.22/0.50 inference(pi_clausification,[],[f543])).
% 0.22/0.50 thf(f543,plain,(
% 0.22/0.50 ((!! @ $i @ (^[Y0 : $i]: (sK2 @ Y0 @ Y0))) = $true) | ~spl0_2),
% 0.22/0.50 inference(boolean_simplification,[],[f542])).
% 0.22/0.50 thf(f542,plain,(
% 0.22/0.50 ($true = ($true & (!! @ $i @ (^[Y0 : $i]: (sK2 @ Y0 @ Y0))))) | ~spl0_2),
% 0.22/0.50 inference(backward_demodulation,[],[f152,f541])).
% 0.22/0.50 thf(f541,plain,(
% 0.22/0.50 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y1) & (sK2 @ Y2 @ Y0)) => (sK2 @ Y0 @ Y1)))))))) = $true) | ~spl0_2),
% 0.22/0.50 inference(binary_proxy_clausification,[],[f152])).
% 0.22/0.50 thf(f152,plain,(
% 0.22/0.50 ($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y1) & (sK2 @ Y2 @ Y0)) => (sK2 @ Y0 @ Y1)))))))) & (!! @ $i @ (^[Y0 : $i]: (sK2 @ Y0 @ Y0))))) | ~spl0_2),
% 0.22/0.50 inference(avatar_component_clause,[],[f151])).
% 0.22/0.50 thf(f151,plain,(
% 0.22/0.50 spl0_2 <=> ($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y1) & (sK2 @ Y2 @ Y0)) => (sK2 @ Y0 @ Y1)))))))) & (!! @ $i @ (^[Y0 : $i]: (sK2 @ Y0 @ Y0)))))),
% 0.22/0.50 introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
% 0.22/0.50 thf(f717,plain,(
% 0.22/0.50 ( ! [X1 : $i] : (($false = (sK2 @ sK15 @ X1))) ) | ~spl0_9),
% 0.22/0.50 inference(pi_clausification,[],[f716])).
% 0.22/0.50 thf(f716,plain,(
% 0.22/0.50 ($false = (?? @ $i @ (sK2 @ sK15))) | ~spl0_9),
% 0.22/0.50 inference(beta_eta_normalization,[],[f715])).
% 0.22/0.50 thf(f715,plain,(
% 0.22/0.50 ($false = ((^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0))) @ sK15)) | ~spl0_9),
% 0.22/0.50 inference(sigma_clausification,[],[f549])).
% 0.22/0.50 thf(f549,plain,(
% 0.22/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0))))) | ~spl0_9),
% 0.22/0.50 inference(avatar_component_clause,[],[f548])).
% 0.22/0.50 thf(f548,plain,(
% 0.22/0.50 spl0_9 <=> ($false = (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0)))))),
% 0.22/0.50 introduced(avatar_definition,[new_symbols(naming,[spl0_9])])).
% 0.22/0.50 thf(f712,plain,(
% 0.22/0.50 ~spl0_2 | ~spl0_10),
% 0.22/0.50 inference(avatar_contradiction_clause,[],[f711])).
% 0.22/0.50 thf(f711,plain,(
% 0.22/0.50 $false | (~spl0_2 | ~spl0_10)),
% 0.22/0.50 inference(trivial_inequality_removal,[],[f710])).
% 0.22/0.50 thf(f710,plain,(
% 0.22/0.50 ($false = $true) | (~spl0_2 | ~spl0_10)),
% 0.22/0.50 inference(forward_demodulation,[],[f704,f565])).
% 0.22/0.50 thf(f565,plain,(
% 0.22/0.50 ($false = (sK2 @ sK12 @ sK11)) | ~spl0_10),
% 0.22/0.50 inference(boolean_simplification,[],[f564])).
% 0.22/0.50 thf(f564,plain,(
% 0.22/0.50 ($false = ($true => (sK2 @ sK12 @ sK11))) | ~spl0_10),
% 0.22/0.50 inference(backward_demodulation,[],[f561,f563])).
% 0.22/0.50 thf(f563,plain,(
% 0.22/0.50 (((sK2 @ sK13 @ sK11) & (sK2 @ sK12 @ sK13)) = $true) | ~spl0_10),
% 0.22/0.50 inference(binary_proxy_clausification,[],[f561])).
% 0.22/0.50 thf(f561,plain,(
% 0.22/0.50 ($false = (((sK2 @ sK13 @ sK11) & (sK2 @ sK12 @ sK13)) => (sK2 @ sK12 @ sK11))) | ~spl0_10),
% 0.22/0.50 inference(beta_eta_normalization,[],[f560])).
% 0.22/0.50 thf(f560,plain,(
% 0.22/0.50 ($false = ((^[Y0 : $i]: (((sK2 @ Y0 @ sK11) & (sK2 @ sK12 @ Y0)) => (sK2 @ sK12 @ sK11))) @ sK13)) | ~spl0_10),
% 0.22/0.50 inference(sigma_clausification,[],[f559])).
% 0.22/0.50 thf(f559,plain,(
% 0.22/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: (((sK2 @ Y0 @ sK11) & (sK2 @ sK12 @ Y0)) => (sK2 @ sK12 @ sK11))))) | ~spl0_10),
% 0.22/0.50 inference(beta_eta_normalization,[],[f558])).
% 0.22/0.50 thf(f558,plain,(
% 0.22/0.50 ($false = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((sK2 @ Y1 @ sK11) & (sK2 @ Y0 @ Y1)) => (sK2 @ Y0 @ sK11))))) @ sK12)) | ~spl0_10),
% 0.22/0.50 inference(sigma_clausification,[],[f557])).
% 0.22/0.50 thf(f557,plain,(
% 0.22/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((sK2 @ Y1 @ sK11) & (sK2 @ Y0 @ Y1)) => (sK2 @ Y0 @ sK11))))))) | ~spl0_10),
% 0.22/0.50 inference(beta_eta_normalization,[],[f556])).
% 0.22/0.50 thf(f556,plain,(
% 0.22/0.50 ($false = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0))))))) @ sK11)) | ~spl0_10),
% 0.22/0.50 inference(sigma_clausification,[],[f552])).
% 0.22/0.50 thf(f552,plain,(
% 0.22/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0))))))))) | ~spl0_10),
% 0.22/0.50 inference(avatar_component_clause,[],[f551])).
% 0.22/0.50 thf(f551,plain,(
% 0.22/0.50 spl0_10 <=> ($false = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0)))))))))),
% 0.22/0.50 introduced(avatar_definition,[new_symbols(naming,[spl0_10])])).
% 0.22/0.50 thf(f704,plain,(
% 0.22/0.50 ($true = (sK2 @ sK12 @ sK11)) | (~spl0_2 | ~spl0_10)),
% 0.22/0.50 inference(boolean_simplification,[],[f696])).
% 0.22/0.50 thf(f696,plain,(
% 0.22/0.50 ($true = ($true => (sK2 @ sK12 @ sK11))) | (~spl0_2 | ~spl0_10)),
% 0.22/0.50 inference(superposition,[],[f608,f637])).
% 0.22/0.50 thf(f637,plain,(
% 0.22/0.50 ((sK2 @ sK14 @ sK12) = $true) | (~spl0_2 | ~spl0_10)),
% 0.22/0.50 inference(boolean_simplification,[],[f630])).
% 0.22/0.50 thf(f630,plain,(
% 0.22/0.50 (($true => (sK2 @ sK14 @ sK12)) = $true) | (~spl0_2 | ~spl0_10)),
% 0.22/0.50 inference(superposition,[],[f606,f545])).
% 0.22/0.50 thf(f606,plain,(
% 0.22/0.50 ( ! [X0 : $i] : ((((sK2 @ sK12 @ X0) => (sK2 @ sK14 @ X0)) = $true)) ) | (~spl0_2 | ~spl0_10)),
% 0.22/0.50 inference(boolean_simplification,[],[f599])).
% 0.22/0.50 thf(f599,plain,(
% 0.22/0.50 ( ! [X0 : $i] : (((((sK2 @ sK12 @ X0) & $true) => (sK2 @ sK14 @ X0)) = $true)) ) | (~spl0_2 | ~spl0_10)),
% 0.22/0.50 inference(superposition,[],[f586,f577])).
% 0.22/0.50 thf(f577,plain,(
% 0.22/0.50 ($true = (sK2 @ sK12 @ sK14)) | ~spl0_10),
% 0.22/0.50 inference(binary_proxy_clausification,[],[f574])).
% 0.22/0.50 thf(f574,plain,(
% 0.22/0.50 (((sK2 @ sK14 @ sK11) & (sK2 @ sK12 @ sK14)) = $true) | ~spl0_10),
% 0.22/0.50 inference(not_proxy_clausification,[],[f569])).
% 0.22/0.50 thf(f569,plain,(
% 0.22/0.50 ($false = (~ ((sK2 @ sK14 @ sK11) & (sK2 @ sK12 @ sK14)))) | ~spl0_10),
% 0.22/0.50 inference(beta_eta_normalization,[],[f568])).
% 0.22/0.50 thf(f568,plain,(
% 0.22/0.50 ($false = ((^[Y0 : $i]: (~ ((sK2 @ Y0 @ sK11) & (sK2 @ sK12 @ Y0)))) @ sK14)) | ~spl0_10),
% 0.22/0.50 inference(sigma_clausification,[],[f567])).
% 0.22/0.50 thf(f567,plain,(
% 0.22/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: (~ ((sK2 @ Y0 @ sK11) & (sK2 @ sK12 @ Y0)))))) | ~spl0_10),
% 0.22/0.50 inference(boolean_simplification,[],[f566])).
% 0.22/0.50 thf(f566,plain,(
% 0.22/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: (((sK2 @ Y0 @ sK11) & (sK2 @ sK12 @ Y0)) => $false)))) | ~spl0_10),
% 0.22/0.50 inference(backward_demodulation,[],[f559,f565])).
% 0.22/0.50 thf(f586,plain,(
% 0.22/0.50 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (((sK2 @ X3 @ X2) & (sK2 @ X3 @ X1)) => (sK2 @ X1 @ X2)))) ) | ~spl0_2),
% 0.22/0.50 inference(beta_eta_normalization,[],[f585])).
% 0.22/0.50 thf(f585,plain,(
% 0.22/0.50 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (((sK2 @ Y0 @ X2) & (sK2 @ Y0 @ X1)) => (sK2 @ X1 @ X2))) @ X3))) ) | ~spl0_2),
% 0.22/0.50 inference(pi_clausification,[],[f584])).
% 0.22/0.50 thf(f584,plain,(
% 0.22/0.50 ( ! [X2 : $i,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (((sK2 @ Y0 @ X2) & (sK2 @ Y0 @ X1)) => (sK2 @ X1 @ X2)))) = $true)) ) | ~spl0_2),
% 0.22/0.50 inference(beta_eta_normalization,[],[f583])).
% 0.22/0.50 thf(f583,plain,(
% 0.22/0.50 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((sK2 @ Y1 @ Y0) & (sK2 @ Y1 @ X1)) => (sK2 @ X1 @ Y0))))) @ X2))) ) | ~spl0_2),
% 0.22/0.50 inference(pi_clausification,[],[f582])).
% 0.22/0.50 thf(f582,plain,(
% 0.22/0.50 ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((sK2 @ Y1 @ Y0) & (sK2 @ Y1 @ X1)) => (sK2 @ X1 @ Y0)))))))) ) | ~spl0_2),
% 0.22/0.50 inference(beta_eta_normalization,[],[f581])).
% 0.22/0.50 thf(f581,plain,(
% 0.22/0.50 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y1) & (sK2 @ Y2 @ Y0)) => (sK2 @ Y0 @ Y1))))))) @ X1) = $true)) ) | ~spl0_2),
% 0.22/0.50 inference(pi_clausification,[],[f541])).
% 0.22/0.50 thf(f608,plain,(
% 0.22/0.50 ( ! [X0 : $i] : ((((sK2 @ sK14 @ X0) => (sK2 @ X0 @ sK11)) = $true)) ) | (~spl0_2 | ~spl0_10)),
% 0.22/0.50 inference(boolean_simplification,[],[f603])).
% 0.22/0.50 thf(f603,plain,(
% 0.22/0.50 ( ! [X0 : $i] : (((($true & (sK2 @ sK14 @ X0)) => (sK2 @ X0 @ sK11)) = $true)) ) | (~spl0_2 | ~spl0_10)),
% 0.22/0.50 inference(superposition,[],[f586,f580])).
% 0.22/0.50 thf(f580,plain,(
% 0.22/0.50 ((sK2 @ sK14 @ sK11) = $true) | ~spl0_10),
% 0.22/0.50 inference(boolean_simplification,[],[f579])).
% 0.22/0.50 thf(f579,plain,(
% 0.22/0.50 ($true = ((sK2 @ sK14 @ sK11) & $true)) | ~spl0_10),
% 0.22/0.50 inference(backward_demodulation,[],[f574,f577])).
% 0.22/0.50 thf(f553,plain,(
% 0.22/0.50 spl0_9 | spl0_10 | ~spl0_6),
% 0.22/0.50 inference(avatar_split_clause,[],[f546,f188,f551,f548])).
% 0.22/0.50 thf(f188,plain,(
% 0.22/0.50 spl0_6 <=> ($false = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0)))))))) & (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0))))))),
% 0.22/0.50 introduced(avatar_definition,[new_symbols(naming,[spl0_6])])).
% 0.22/0.50 thf(f546,plain,(
% 0.22/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0))))))))) | ($false = (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0))))) | ~spl0_6),
% 0.22/0.50 inference(binary_proxy_clausification,[],[f189])).
% 0.22/0.50 thf(f189,plain,(
% 0.22/0.50 ($false = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0)))))))) & (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0)))))) | ~spl0_6),
% 0.22/0.50 inference(avatar_component_clause,[],[f188])).
% 0.22/0.50 thf(f535,plain,(
% 0.22/0.50 ~spl0_4 | ~spl0_8),
% 0.22/0.50 inference(avatar_contradiction_clause,[],[f534])).
% 0.22/0.50 thf(f534,plain,(
% 0.22/0.50 $false | (~spl0_4 | ~spl0_8)),
% 0.22/0.50 inference(trivial_inequality_removal,[],[f533])).
% 0.22/0.50 thf(f533,plain,(
% 0.22/0.50 ($false = $true) | (~spl0_4 | ~spl0_8)),
% 0.22/0.50 inference(boolean_simplification,[],[f532])).
% 0.22/0.50 thf(f532,plain,(
% 0.22/0.50 ((~ $true) = $true) | (~spl0_4 | ~spl0_8)),
% 0.22/0.50 inference(forward_demodulation,[],[f526,f272])).
% 0.22/0.50 thf(f272,plain,(
% 0.22/0.50 ( ! [X0 : $i] : (($true = (sK2 @ (sK5 @ X0) @ X0))) ) | ~spl0_4),
% 0.22/0.50 inference(boolean_simplification,[],[f271])).
% 0.22/0.50 thf(f271,plain,(
% 0.22/0.50 ( ! [X0 : $i] : ((($true => (sK2 @ (sK5 @ X0) @ X0)) = $true)) ) | ~spl0_4),
% 0.22/0.50 inference(superposition,[],[f261,f255])).
% 0.22/0.50 thf(f255,plain,(
% 0.22/0.50 ( ! [X1 : $i] : (($true = (sK2 @ X1 @ (sK5 @ X1)))) ) | ~spl0_4),
% 0.22/0.50 inference(sigma_clausification,[],[f252])).
% 0.22/0.50 thf(f252,plain,(
% 0.22/0.50 ( ! [X1 : $i] : (($true = (?? @ $i @ (sK2 @ X1)))) ) | ~spl0_4),
% 0.22/0.50 inference(beta_eta_normalization,[],[f251])).
% 0.22/0.50 thf(f251,plain,(
% 0.22/0.50 ( ! [X1 : $i] : ((((^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0))) @ X1) = $true)) ) | ~spl0_4),
% 0.22/0.50 inference(pi_clausification,[],[f245])).
% 0.22/0.50 thf(f245,plain,(
% 0.22/0.50 ((!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0)))) = $true) | ~spl0_4),
% 0.22/0.50 inference(binary_proxy_clausification,[],[f241])).
% 0.22/0.50 thf(f241,plain,(
% 0.22/0.50 ($false != ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0)))))))) & (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0)))))) | ~spl0_4),
% 0.22/0.50 inference(boolean_simplification,[],[f240])).
% 0.22/0.50 thf(f240,plain,(
% 0.22/0.50 ($false != (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0)))))))) & (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0))))) & $true)) | ~spl0_4),
% 0.22/0.50 inference(backward_demodulation,[],[f226,f237])).
% 0.22/0.50 thf(f237,plain,(
% 0.22/0.50 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK2 @ Y1 @ Y0) => (sK2 @ Y0 @ Y1))))))) | ~spl0_4),
% 0.22/0.50 inference(binary_proxy_clausification,[],[f226])).
% 0.22/0.50 thf(f226,plain,(
% 0.22/0.50 ($false != (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0)))))))) & (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0))))) & (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK2 @ Y1 @ Y0) => (sK2 @ Y0 @ Y1)))))))) | ~spl0_4),
% 0.22/0.50 inference(backward_demodulation,[],[f144,f159])).
% 0.22/0.50 thf(f159,plain,(
% 0.22/0.50 ($false = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y1) & (sK2 @ Y2 @ Y0)) => (sK2 @ Y0 @ Y1)))))))) & (!! @ $i @ (^[Y0 : $i]: (sK2 @ Y0 @ Y0))))) | ~spl0_4),
% 0.22/0.50 inference(avatar_component_clause,[],[f158])).
% 0.22/0.50 thf(f158,plain,(
% 0.22/0.50 spl0_4 <=> ($false = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y1) & (sK2 @ Y2 @ Y0)) => (sK2 @ Y0 @ Y1)))))))) & (!! @ $i @ (^[Y0 : $i]: (sK2 @ Y0 @ Y0)))))),
% 0.22/0.50 introduced(avatar_definition,[new_symbols(naming,[spl0_4])])).
% 0.22/0.50 thf(f144,plain,(
% 0.22/0.50 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0)))))))) & (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0))))) & (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK2 @ Y1 @ Y0) => (sK2 @ Y0 @ Y1))))))) != ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y1) & (sK2 @ Y2 @ Y0)) => (sK2 @ Y0 @ Y1)))))))) & (!! @ $i @ (^[Y0 : $i]: (sK2 @ Y0 @ Y0)))))),
% 0.22/0.50 inference(binary_proxy_clausification,[],[f143])).
% 0.22/0.50 thf(f143,plain,(
% 0.22/0.50 ($false = ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0)))))))) & (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0))))) & (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK2 @ Y1 @ Y0) => (sK2 @ Y0 @ Y1))))))) = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y1) & (sK2 @ Y2 @ Y0)) => (sK2 @ Y0 @ Y1)))))))) & (!! @ $i @ (^[Y0 : $i]: (sK2 @ Y0 @ Y0))))))),
% 0.22/0.50 inference(beta_eta_normalization,[],[f142])).
% 0.22/0.50 thf(f142,plain,(
% 0.22/0.50 ($false = ((^[Y0 : $i > $i > $o]: ((((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y3 @ Y1) & (Y0 @ Y2 @ Y3)) => (Y0 @ Y2 @ Y1)))))))) & (!! @ $i @ (^[Y1 : $i]: (?? @ $i @ (Y0 @ Y1))))) & (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2 @ Y1) => (Y0 @ Y1 @ Y2))))))) = ((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y3 @ Y2) & (Y0 @ Y3 @ Y1)) => (Y0 @ Y1 @ Y2)))))))) & (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))) @ sK2))),
% 0.22/0.50 inference(sigma_clausification,[],[f139])).
% 0.22/0.50 thf(f139,plain,(
% 0.22/0.50 ($false = (!! @ ($i > $i > $o) @ (^[Y0 : $i > $i > $o]: ((((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y3 @ Y1) & (Y0 @ Y2 @ Y3)) => (Y0 @ Y2 @ Y1)))))))) & (!! @ $i @ (^[Y1 : $i]: (?? @ $i @ (Y0 @ Y1))))) & (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2 @ Y1) => (Y0 @ Y1 @ Y2))))))) = ((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y3 @ Y2) & (Y0 @ Y3 @ Y1)) => (Y0 @ Y1 @ Y2)))))))) & (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1))))))))),
% 0.22/0.50 inference(not_proxy_clausification,[],[f138])).
% 0.22/0.50 thf(f138,plain,(
% 0.22/0.50 ((~ (!! @ ($i > $i > $o) @ (^[Y0 : $i > $i > $o]: ((((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y3 @ Y1) & (Y0 @ Y2 @ Y3)) => (Y0 @ Y2 @ Y1)))))))) & (!! @ $i @ (^[Y1 : $i]: (?? @ $i @ (Y0 @ Y1))))) & (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2 @ Y1) => (Y0 @ Y1 @ Y2))))))) = ((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y3 @ Y2) & (Y0 @ Y3 @ Y1)) => (Y0 @ Y1 @ Y2)))))))) & (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))))) = $true)),
% 0.22/0.50 inference(beta_eta_normalization,[],[f137])).
% 0.22/0.50 thf(f137,plain,(
% 0.22/0.50 ((~ (!! @ ($i > $i > $o) @ (^[Y0 : $i > $i > $o]: (((((^[Y1 : $i > $i > $o]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: (((Y1 @ Y4 @ Y2) & (Y1 @ Y3 @ Y4)) => (Y1 @ Y3 @ Y2))))))))) @ Y0) & ((^[Y1 : $i > $i > $o]: (!! @ $i @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (Y1 @ Y2 @ Y3)))))) @ Y0)) & ((^[Y1 : $i > $i > $o]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3 @ Y2) => (Y1 @ Y2 @ Y3))))))) @ Y0)) = (((^[Y1 : $i > $i > $o]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: (((Y1 @ Y4 @ Y3) & (Y1 @ Y4 @ Y2)) => (Y1 @ Y2 @ Y3))))))))) @ Y0) & ((^[Y1 : $i > $i > $o]: (!! @ $i @ (^[Y2 : $i]: (Y1 @ Y2 @ Y2)))) @ Y0)))))) = $true)),
% 0.22/0.50 inference(definition_unfolding,[],[f110,f105,f113,f111,f124,f96])).
% 0.22/0.50 thf(f96,plain,(
% 0.22/0.50 (mreflexive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))),
% 0.22/0.50 inference(cnf_transformation,[],[f87])).
% 0.22/0.50 thf(f87,plain,(
% 0.22/0.50 (mreflexive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))),
% 0.22/0.50 inference(fool_elimination,[],[f86])).
% 0.22/0.50 thf(f86,plain,(
% 0.22/0.50 ((^[X0 : $i > $i > $o] : (! [X1] : (X0 @ X1 @ X1))) = mreflexive)),
% 0.22/0.50 inference(rectify,[],[f18])).
% 0.22/0.50 thf(f18,axiom,(
% 0.22/0.50 ((^[X6 : $i > $i > $o] : (! [X8] : (X6 @ X8 @ X8))) = mreflexive)),
% 0.22/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mreflexive)).
% 0.22/0.50 thf(f124,plain,(
% 0.22/0.50 (meuclidean = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y3 @ Y2) & (Y0 @ Y3 @ Y1)) => (Y0 @ Y1 @ Y2))))))))))),
% 0.22/0.50 inference(cnf_transformation,[],[f66])).
% 0.22/0.50 thf(f66,plain,(
% 0.22/0.50 (meuclidean = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y3 @ Y2) & (Y0 @ Y3 @ Y1)) => (Y0 @ Y1 @ Y2))))))))))),
% 0.22/0.50 inference(fool_elimination,[],[f65])).
% 0.22/0.50 thf(f65,plain,(
% 0.22/0.50 (meuclidean = (^[X0 : $i > $i > $o] : (! [X1,X2,X3] : (((X0 @ X1 @ X3) & (X0 @ X1 @ X2)) => (X0 @ X3 @ X2)))))),
% 0.22/0.50 inference(rectify,[],[f22])).
% 0.22/0.50 thf(f22,axiom,(
% 0.22/0.50 (meuclidean = (^[X6 : $i > $i > $o] : (! [X8,X10,X9] : (((X6 @ X8 @ X9) & (X6 @ X8 @ X10)) => (X6 @ X9 @ X10)))))),
% 0.22/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',meuclidean)).
% 0.22/0.50 thf(f111,plain,(
% 0.22/0.50 (msymmetric = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2 @ Y1) => (Y0 @ Y1 @ Y2))))))))),
% 0.22/0.50 inference(cnf_transformation,[],[f62])).
% 0.22/0.50 thf(f62,plain,(
% 0.22/0.50 (msymmetric = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2 @ Y1) => (Y0 @ Y1 @ Y2))))))))),
% 0.22/0.50 inference(fool_elimination,[],[f61])).
% 0.22/0.50 thf(f61,plain,(
% 0.22/0.50 ((^[X0 : $i > $i > $o] : (! [X1,X2] : ((X0 @ X1 @ X2) => (X0 @ X2 @ X1)))) = msymmetric)),
% 0.22/0.50 inference(rectify,[],[f19])).
% 0.22/0.50 thf(f19,axiom,(
% 0.22/0.50 ((^[X6 : $i > $i > $o] : (! [X8,X9] : ((X6 @ X8 @ X9) => (X6 @ X9 @ X8)))) = msymmetric)),
% 0.22/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',msymmetric)).
% 0.22/0.50 thf(f113,plain,(
% 0.22/0.50 (mserial = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ Y1 @ Y2)))))))),
% 0.22/0.50 inference(cnf_transformation,[],[f93])).
% 0.22/0.50 thf(f93,plain,(
% 0.22/0.50 (mserial = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ Y1 @ Y2)))))))),
% 0.22/0.50 inference(fool_elimination,[],[f92])).
% 0.22/0.50 thf(f92,plain,(
% 0.22/0.50 (mserial = (^[X0 : $i > $i > $o] : (! [X1] : ? [X2] : (X0 @ X1 @ X2))))),
% 0.22/0.50 inference(rectify,[],[f20])).
% 0.22/0.50 thf(f20,axiom,(
% 0.22/0.50 (mserial = (^[X6 : $i > $i > $o] : (! [X8] : ? [X9] : (X6 @ X8 @ X9))))),
% 0.22/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mserial)).
% 0.22/0.50 thf(f105,plain,(
% 0.22/0.50 (mtransitive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y3 @ Y1) & (Y0 @ Y2 @ Y3)) => (Y0 @ Y2 @ Y1))))))))))),
% 0.22/0.50 inference(cnf_transformation,[],[f58])).
% 0.22/0.50 thf(f58,plain,(
% 0.22/0.50 (mtransitive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y3 @ Y1) & (Y0 @ Y2 @ Y3)) => (Y0 @ Y2 @ Y1))))))))))),
% 0.22/0.50 inference(fool_elimination,[],[f57])).
% 0.22/0.50 thf(f57,plain,(
% 0.22/0.50 ((^[X0 : $i > $i > $o] : (! [X1,X2,X3] : (((X0 @ X2 @ X1) & (X0 @ X1 @ X3)) => (X0 @ X2 @ X3)))) = mtransitive)),
% 0.22/0.50 inference(rectify,[],[f21])).
% 0.22/0.50 thf(f21,axiom,(
% 0.22/0.50 ((^[X6 : $i > $i > $o] : (! [X9,X8,X10] : (((X6 @ X8 @ X9) & (X6 @ X9 @ X10)) => (X6 @ X8 @ X10)))) = mtransitive)),
% 0.22/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mtransitive)).
% 0.22/0.50 thf(f110,plain,(
% 0.22/0.50 ($true = (~ (!! @ ($i > $i > $o) @ (^[Y0 : $i > $i > $o]: ((((mtransitive @ Y0) & (mserial @ Y0)) & (msymmetric @ Y0)) = ((meuclidean @ Y0) & (mreflexive @ Y0)))))))),
% 0.22/0.50 inference(cnf_transformation,[],[f49])).
% 0.22/0.50 thf(f49,plain,(
% 0.22/0.50 ($true = (~ (!! @ ($i > $i > $o) @ (^[Y0 : $i > $i > $o]: ((((mtransitive @ Y0) & (mserial @ Y0)) & (msymmetric @ Y0)) = ((meuclidean @ Y0) & (mreflexive @ Y0)))))))),
% 0.22/0.50 inference(fool_elimination,[],[f48])).
% 0.22/0.50 thf(f48,plain,(
% 0.22/0.50 ~! [X0 : $i > $i > $o] : (((msymmetric @ X0) & (mserial @ X0) & (mtransitive @ X0)) <=> ((mreflexive @ X0) & (meuclidean @ X0)))),
% 0.22/0.50 inference(rectify,[],[f33])).
% 0.22/0.50 thf(f33,negated_conjecture,(
% 0.22/0.50 ~! [X6 : $i > $i > $o] : (((msymmetric @ X6) & (mserial @ X6) & (mtransitive @ X6)) <=> ((mreflexive @ X6) & (meuclidean @ X6)))),
% 0.22/0.50 inference(negated_conjecture,[],[f32])).
% 0.22/0.50 thf(f32,conjecture,(
% 0.22/0.50 ! [X6 : $i > $i > $o] : (((msymmetric @ X6) & (mserial @ X6) & (mtransitive @ X6)) <=> ((mreflexive @ X6) & (meuclidean @ X6)))),
% 0.22/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)).
% 0.22/0.50 thf(f261,plain,(
% 0.22/0.50 ( ! [X2 : $i,X1 : $i] : (($true = ((sK2 @ X2 @ X1) => (sK2 @ X1 @ X2)))) ) | ~spl0_4),
% 0.22/0.50 inference(beta_eta_normalization,[],[f260])).
% 0.22/0.50 thf(f260,plain,(
% 0.22/0.50 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((sK2 @ Y0 @ X1) => (sK2 @ X1 @ Y0))) @ X2))) ) | ~spl0_4),
% 0.22/0.50 inference(pi_clausification,[],[f244])).
% 0.22/0.50 thf(f244,plain,(
% 0.22/0.50 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((sK2 @ Y0 @ X1) => (sK2 @ X1 @ Y0)))) = $true)) ) | ~spl0_4),
% 0.22/0.50 inference(beta_eta_normalization,[],[f243])).
% 0.22/0.50 thf(f243,plain,(
% 0.22/0.50 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK2 @ Y1 @ Y0) => (sK2 @ Y0 @ Y1))))) @ X1) = $true)) ) | ~spl0_4),
% 0.22/0.50 inference(pi_clausification,[],[f237])).
% 0.22/0.50 thf(f526,plain,(
% 0.22/0.50 ((~ (sK2 @ (sK5 @ sK10) @ sK10)) = $true) | (~spl0_4 | ~spl0_8)),
% 0.22/0.50 inference(boolean_simplification,[],[f518])).
% 0.22/0.50 thf(f518,plain,(
% 0.22/0.50 (((sK2 @ (sK5 @ sK10) @ sK10) => $false) = $true) | (~spl0_4 | ~spl0_8)),
% 0.22/0.50 inference(superposition,[],[f267,f498])).
% 0.22/0.50 thf(f498,plain,(
% 0.22/0.50 ($false = (sK2 @ sK10 @ sK10)) | ~spl0_8),
% 0.22/0.50 inference(beta_eta_normalization,[],[f497])).
% 0.22/0.50 thf(f497,plain,(
% 0.22/0.50 ($false = ((^[Y0 : $i]: (sK2 @ Y0 @ Y0)) @ sK10)) | ~spl0_8),
% 0.22/0.50 inference(sigma_clausification,[],[f233])).
% 0.22/0.50 thf(f233,plain,(
% 0.22/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: (sK2 @ Y0 @ Y0)))) | ~spl0_8),
% 0.22/0.50 inference(avatar_component_clause,[],[f232])).
% 0.22/0.50 thf(f232,plain,(
% 0.22/0.50 spl0_8 <=> ($false = (!! @ $i @ (^[Y0 : $i]: (sK2 @ Y0 @ Y0))))),
% 0.22/0.50 introduced(avatar_definition,[new_symbols(naming,[spl0_8])])).
% 0.22/0.50 thf(f267,plain,(
% 0.22/0.50 ( ! [X0 : $i,X1 : $i] : (($true = ((sK2 @ (sK5 @ X0) @ X1) => (sK2 @ X0 @ X1)))) ) | ~spl0_4),
% 0.22/0.50 inference(boolean_simplification,[],[f264])).
% 0.22/0.50 thf(f264,plain,(
% 0.22/0.50 ( ! [X0 : $i,X1 : $i] : (((((sK2 @ (sK5 @ X0) @ X1) & $true) => (sK2 @ X0 @ X1)) = $true)) ) | ~spl0_4),
% 0.22/0.50 inference(superposition,[],[f259,f255])).
% 0.22/0.50 thf(f259,plain,(
% 0.22/0.50 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (((sK2 @ X3 @ X1) & (sK2 @ X2 @ X3)) => (sK2 @ X2 @ X1)))) ) | ~spl0_4),
% 0.22/0.50 inference(beta_eta_normalization,[],[f258])).
% 0.22/0.50 thf(f258,plain,(
% 0.22/0.50 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (((sK2 @ Y0 @ X1) & (sK2 @ X2 @ Y0)) => (sK2 @ X2 @ X1))) @ X3))) ) | ~spl0_4),
% 0.22/0.50 inference(pi_clausification,[],[f257])).
% 0.22/0.50 thf(f257,plain,(
% 0.22/0.50 ( ! [X2 : $i,X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: (((sK2 @ Y0 @ X1) & (sK2 @ X2 @ Y0)) => (sK2 @ X2 @ X1)))))) ) | ~spl0_4),
% 0.22/0.50 inference(beta_eta_normalization,[],[f256])).
% 0.22/0.50 thf(f256,plain,(
% 0.22/0.50 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((sK2 @ Y1 @ X1) & (sK2 @ Y0 @ Y1)) => (sK2 @ Y0 @ X1))))) @ X2))) ) | ~spl0_4),
% 0.22/0.50 inference(pi_clausification,[],[f254])).
% 0.22/0.50 thf(f254,plain,(
% 0.22/0.50 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((sK2 @ Y1 @ X1) & (sK2 @ Y0 @ Y1)) => (sK2 @ Y0 @ X1)))))) = $true)) ) | ~spl0_4),
% 0.22/0.50 inference(beta_eta_normalization,[],[f253])).
% 0.22/0.50 thf(f253,plain,(
% 0.22/0.50 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0))))))) @ X1))) ) | ~spl0_4),
% 0.22/0.50 inference(pi_clausification,[],[f249])).
% 0.22/0.50 thf(f249,plain,(
% 0.22/0.50 ($false != (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0))))))))) | ~spl0_4),
% 0.22/0.50 inference(boolean_simplification,[],[f247])).
% 0.22/0.50 thf(f247,plain,(
% 0.22/0.50 ($false != ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0)))))))) & $true)) | ~spl0_4),
% 0.22/0.50 inference(backward_demodulation,[],[f241,f245])).
% 0.22/0.50 thf(f478,plain,(
% 0.22/0.50 ~spl0_4 | ~spl0_7),
% 0.22/0.50 inference(avatar_contradiction_clause,[],[f477])).
% 0.22/0.50 thf(f477,plain,(
% 0.22/0.50 $false | (~spl0_4 | ~spl0_7)),
% 0.22/0.50 inference(trivial_inequality_removal,[],[f476])).
% 0.22/0.50 thf(f476,plain,(
% 0.22/0.50 ($false = $true) | (~spl0_4 | ~spl0_7)),
% 0.22/0.50 inference(boolean_simplification,[],[f475])).
% 0.22/0.50 thf(f475,plain,(
% 0.22/0.50 ((~ $true) = $true) | (~spl0_4 | ~spl0_7)),
% 0.22/0.50 inference(forward_demodulation,[],[f465,f382])).
% 0.22/0.50 thf(f382,plain,(
% 0.22/0.50 ($true = (sK2 @ sK6 @ sK9)) | (~spl0_4 | ~spl0_7)),
% 0.22/0.50 inference(boolean_simplification,[],[f377])).
% 0.22/0.50 thf(f377,plain,(
% 0.22/0.50 (($true => (sK2 @ sK6 @ sK9)) = $true) | (~spl0_4 | ~spl0_7)),
% 0.22/0.50 inference(superposition,[],[f261,f357])).
% 0.22/0.50 thf(f357,plain,(
% 0.22/0.50 ((sK2 @ sK9 @ sK6) = $true) | ~spl0_7),
% 0.22/0.50 inference(binary_proxy_clausification,[],[f338])).
% 0.22/0.50 thf(f338,plain,(
% 0.22/0.50 (((sK2 @ sK9 @ sK7) & (sK2 @ sK9 @ sK6)) = $true) | ~spl0_7),
% 0.22/0.50 inference(not_proxy_clausification,[],[f334])).
% 0.22/0.50 thf(f334,plain,(
% 0.22/0.50 ($false = (~ ((sK2 @ sK9 @ sK7) & (sK2 @ sK9 @ sK6)))) | ~spl0_7),
% 0.22/0.50 inference(beta_eta_normalization,[],[f333])).
% 0.22/0.50 thf(f333,plain,(
% 0.22/0.50 ($false = ((^[Y0 : $i]: (~ ((sK2 @ Y0 @ sK7) & (sK2 @ Y0 @ sK6)))) @ sK9)) | ~spl0_7),
% 0.22/0.50 inference(sigma_clausification,[],[f318])).
% 0.22/0.50 thf(f318,plain,(
% 0.22/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: (~ ((sK2 @ Y0 @ sK7) & (sK2 @ Y0 @ sK6)))))) | ~spl0_7),
% 0.22/0.50 inference(boolean_simplification,[],[f317])).
% 0.22/0.50 thf(f317,plain,(
% 0.22/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: (((sK2 @ Y0 @ sK7) & (sK2 @ Y0 @ sK6)) => $false)))) | ~spl0_7),
% 0.22/0.50 inference(backward_demodulation,[],[f287,f316])).
% 0.22/0.50 thf(f316,plain,(
% 0.22/0.50 ($false = (sK2 @ sK6 @ sK7)) | ~spl0_7),
% 0.22/0.50 inference(boolean_simplification,[],[f315])).
% 0.22/0.50 thf(f315,plain,(
% 0.22/0.50 ($false = ($true => (sK2 @ sK6 @ sK7))) | ~spl0_7),
% 0.22/0.50 inference(backward_demodulation,[],[f298,f314])).
% 0.22/0.50 thf(f314,plain,(
% 0.22/0.50 (((sK2 @ sK8 @ sK7) & (sK2 @ sK8 @ sK6)) = $true) | ~spl0_7),
% 0.22/0.50 inference(binary_proxy_clausification,[],[f298])).
% 0.22/0.50 thf(f298,plain,(
% 0.22/0.50 ($false = (((sK2 @ sK8 @ sK7) & (sK2 @ sK8 @ sK6)) => (sK2 @ sK6 @ sK7))) | ~spl0_7),
% 0.22/0.50 inference(beta_eta_normalization,[],[f297])).
% 0.22/0.50 thf(f297,plain,(
% 0.22/0.50 ($false = ((^[Y0 : $i]: (((sK2 @ Y0 @ sK7) & (sK2 @ Y0 @ sK6)) => (sK2 @ sK6 @ sK7))) @ sK8)) | ~spl0_7),
% 0.22/0.50 inference(sigma_clausification,[],[f287])).
% 0.22/0.50 thf(f287,plain,(
% 0.22/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: (((sK2 @ Y0 @ sK7) & (sK2 @ Y0 @ sK6)) => (sK2 @ sK6 @ sK7))))) | ~spl0_7),
% 0.22/0.50 inference(beta_eta_normalization,[],[f286])).
% 0.22/0.50 thf(f286,plain,(
% 0.22/0.50 ($false = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((sK2 @ Y1 @ Y0) & (sK2 @ Y1 @ sK6)) => (sK2 @ sK6 @ Y0))))) @ sK7)) | ~spl0_7),
% 0.22/0.50 inference(sigma_clausification,[],[f275])).
% 0.22/0.50 thf(f275,plain,(
% 0.22/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((sK2 @ Y1 @ Y0) & (sK2 @ Y1 @ sK6)) => (sK2 @ sK6 @ Y0))))))) | ~spl0_7),
% 0.22/0.50 inference(beta_eta_normalization,[],[f274])).
% 0.22/0.50 thf(f274,plain,(
% 0.22/0.50 ($false = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y1) & (sK2 @ Y2 @ Y0)) => (sK2 @ Y0 @ Y1))))))) @ sK6)) | ~spl0_7),
% 0.22/0.50 inference(sigma_clausification,[],[f230])).
% 0.22/0.50 thf(f230,plain,(
% 0.22/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y1) & (sK2 @ Y2 @ Y0)) => (sK2 @ Y0 @ Y1))))))))) | ~spl0_7),
% 0.22/0.50 inference(avatar_component_clause,[],[f229])).
% 0.22/0.50 thf(f229,plain,(
% 0.22/0.50 spl0_7 <=> ($false = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y1) & (sK2 @ Y2 @ Y0)) => (sK2 @ Y0 @ Y1)))))))))),
% 0.22/0.50 introduced(avatar_definition,[new_symbols(naming,[spl0_7])])).
% 0.22/0.50 thf(f465,plain,(
% 0.22/0.50 ($true = (~ (sK2 @ sK6 @ sK9))) | (~spl0_4 | ~spl0_7)),
% 0.22/0.50 inference(boolean_simplification,[],[f458])).
% 0.22/0.50 thf(f458,plain,(
% 0.22/0.50 (((sK2 @ sK6 @ sK9) => $false) = $true) | (~spl0_4 | ~spl0_7)),
% 0.22/0.50 inference(superposition,[],[f368,f316])).
% 0.22/0.50 thf(f368,plain,(
% 0.22/0.50 ( ! [X0 : $i] : ((((sK2 @ X0 @ sK9) => (sK2 @ X0 @ sK7)) = $true)) ) | (~spl0_4 | ~spl0_7)),
% 0.22/0.50 inference(boolean_simplification,[],[f364])).
% 0.22/0.50 thf(f364,plain,(
% 0.22/0.50 ( ! [X0 : $i] : (($true = (($true & (sK2 @ X0 @ sK9)) => (sK2 @ X0 @ sK7)))) ) | (~spl0_4 | ~spl0_7)),
% 0.22/0.50 inference(superposition,[],[f259,f360])).
% 0.22/0.50 thf(f360,plain,(
% 0.22/0.50 ((sK2 @ sK9 @ sK7) = $true) | ~spl0_7),
% 0.22/0.50 inference(boolean_simplification,[],[f359])).
% 0.22/0.50 thf(f359,plain,(
% 0.22/0.50 ($true = ((sK2 @ sK9 @ sK7) & $true)) | ~spl0_7),
% 0.22/0.50 inference(backward_demodulation,[],[f338,f357])).
% 0.22/0.50 thf(f234,plain,(
% 0.22/0.50 spl0_7 | spl0_8 | ~spl0_4),
% 0.22/0.50 inference(avatar_split_clause,[],[f227,f158,f232,f229])).
% 0.22/0.50 thf(f227,plain,(
% 0.22/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: (sK2 @ Y0 @ Y0)))) | ($false = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y1) & (sK2 @ Y2 @ Y0)) => (sK2 @ Y0 @ Y1))))))))) | ~spl0_4),
% 0.22/0.50 inference(binary_proxy_clausification,[],[f159])).
% 0.22/0.50 thf(f223,plain,(
% 0.22/0.50 ~spl0_1 | ~spl0_6),
% 0.22/0.50 inference(avatar_contradiction_clause,[],[f222])).
% 0.22/0.50 thf(f222,plain,(
% 0.22/0.50 $false | (~spl0_1 | ~spl0_6)),
% 0.22/0.50 inference(trivial_inequality_removal,[],[f221])).
% 0.22/0.50 thf(f221,plain,(
% 0.22/0.50 ($false = $true) | (~spl0_1 | ~spl0_6)),
% 0.22/0.50 inference(boolean_simplification,[],[f220])).
% 0.22/0.50 thf(f220,plain,(
% 0.22/0.50 (($false & (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK2 @ Y1 @ Y0) => (sK2 @ Y0 @ Y1))))))) = $true) | (~spl0_1 | ~spl0_6)),
% 0.22/0.50 inference(forward_demodulation,[],[f149,f189])).
% 0.22/0.50 thf(f149,plain,(
% 0.22/0.50 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0)))))))) & (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0))))) & (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK2 @ Y1 @ Y0) => (sK2 @ Y0 @ Y1))))))) = $true) | ~spl0_1),
% 0.22/0.50 inference(avatar_component_clause,[],[f148])).
% 0.22/0.50 thf(f148,plain,(
% 0.22/0.50 spl0_1 <=> ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0)))))))) & (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0))))) & (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK2 @ Y1 @ Y0) => (sK2 @ Y0 @ Y1))))))) = $true)),
% 0.22/0.50 introduced(avatar_definition,[new_symbols(naming,[spl0_1])])).
% 0.22/0.50 thf(f215,plain,(
% 0.22/0.50 ~spl0_1 | ~spl0_5),
% 0.22/0.50 inference(avatar_contradiction_clause,[],[f214])).
% 0.22/0.50 thf(f214,plain,(
% 0.22/0.50 $false | (~spl0_1 | ~spl0_5)),
% 0.22/0.50 inference(trivial_inequality_removal,[],[f213])).
% 0.22/0.50 thf(f213,plain,(
% 0.22/0.50 ($false = $true) | (~spl0_1 | ~spl0_5)),
% 0.22/0.50 inference(boolean_simplification,[],[f212])).
% 0.22/0.50 thf(f212,plain,(
% 0.22/0.50 ($true = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0)))))))) & (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0))))) & $false)) | (~spl0_1 | ~spl0_5)),
% 0.22/0.50 inference(forward_demodulation,[],[f149,f186])).
% 0.22/0.50 thf(f186,plain,(
% 0.22/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK2 @ Y1 @ Y0) => (sK2 @ Y0 @ Y1))))))) | ~spl0_5),
% 0.22/0.50 inference(avatar_component_clause,[],[f185])).
% 0.22/0.50 thf(f185,plain,(
% 0.22/0.50 spl0_5 <=> ($false = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK2 @ Y1 @ Y0) => (sK2 @ Y0 @ Y1)))))))),
% 0.22/0.50 introduced(avatar_definition,[new_symbols(naming,[spl0_5])])).
% 0.22/0.50 thf(f209,plain,(
% 0.22/0.50 ~spl0_2 | ~spl0_5),
% 0.22/0.50 inference(avatar_contradiction_clause,[],[f208])).
% 0.22/0.50 thf(f208,plain,(
% 0.22/0.50 $false | (~spl0_2 | ~spl0_5)),
% 0.22/0.50 inference(trivial_inequality_removal,[],[f205])).
% 0.22/0.50 thf(f205,plain,(
% 0.22/0.50 ($false = $true) | (~spl0_2 | ~spl0_5)),
% 0.22/0.50 inference(superposition,[],[f179,f201])).
% 0.22/0.50 thf(f201,plain,(
% 0.22/0.50 ($false = ((sK2 @ sK4 @ sK3) => (sK2 @ sK3 @ sK4))) | ~spl0_5),
% 0.22/0.50 inference(beta_eta_normalization,[],[f200])).
% 0.22/0.50 thf(f200,plain,(
% 0.22/0.50 ($false = ((^[Y0 : $i]: ((sK2 @ Y0 @ sK3) => (sK2 @ sK3 @ Y0))) @ sK4)) | ~spl0_5),
% 0.22/0.50 inference(sigma_clausification,[],[f199])).
% 0.22/0.50 thf(f199,plain,(
% 0.22/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: ((sK2 @ Y0 @ sK3) => (sK2 @ sK3 @ Y0))))) | ~spl0_5),
% 0.22/0.50 inference(beta_eta_normalization,[],[f198])).
% 0.22/0.50 thf(f198,plain,(
% 0.22/0.50 ($false = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK2 @ Y1 @ Y0) => (sK2 @ Y0 @ Y1))))) @ sK3)) | ~spl0_5),
% 0.22/0.50 inference(sigma_clausification,[],[f186])).
% 0.22/0.50 thf(f179,plain,(
% 0.22/0.50 ( ! [X0 : $i,X1 : $i] : ((((sK2 @ X0 @ X1) => (sK2 @ X1 @ X0)) = $true)) ) | ~spl0_2),
% 0.22/0.50 inference(boolean_simplification,[],[f178])).
% 0.22/0.50 thf(f178,plain,(
% 0.22/0.50 ( ! [X0 : $i,X1 : $i] : (((($true & (sK2 @ X0 @ X1)) => (sK2 @ X1 @ X0)) = $true)) ) | ~spl0_2),
% 0.22/0.50 inference(superposition,[],[f174,f170])).
% 0.22/0.50 thf(f170,plain,(
% 0.22/0.50 ( ! [X1 : $i] : (((sK2 @ X1 @ X1) = $true)) ) | ~spl0_2),
% 0.22/0.50 inference(beta_eta_normalization,[],[f169])).
% 0.22/0.50 thf(f169,plain,(
% 0.22/0.50 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (sK2 @ Y0 @ Y0)) @ X1))) ) | ~spl0_2),
% 0.22/0.50 inference(pi_clausification,[],[f163])).
% 0.22/0.50 thf(f163,plain,(
% 0.22/0.50 ((!! @ $i @ (^[Y0 : $i]: (sK2 @ Y0 @ Y0))) = $true) | ~spl0_2),
% 0.22/0.50 inference(binary_proxy_clausification,[],[f152])).
% 0.22/0.50 thf(f174,plain,(
% 0.22/0.50 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (((sK2 @ X3 @ X2) & (sK2 @ X3 @ X1)) => (sK2 @ X1 @ X2)))) ) | ~spl0_2),
% 0.22/0.50 inference(beta_eta_normalization,[],[f173])).
% 0.22/0.50 thf(f173,plain,(
% 0.22/0.50 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (((sK2 @ Y0 @ X2) & (sK2 @ Y0 @ X1)) => (sK2 @ X1 @ X2))) @ X3))) ) | ~spl0_2),
% 0.22/0.50 inference(pi_clausification,[],[f172])).
% 0.22/0.50 thf(f172,plain,(
% 0.22/0.50 ( ! [X2 : $i,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (((sK2 @ Y0 @ X2) & (sK2 @ Y0 @ X1)) => (sK2 @ X1 @ X2)))) = $true)) ) | ~spl0_2),
% 0.22/0.50 inference(beta_eta_normalization,[],[f171])).
% 0.22/0.50 thf(f171,plain,(
% 0.22/0.50 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((sK2 @ Y1 @ Y0) & (sK2 @ Y1 @ X1)) => (sK2 @ X1 @ Y0))))) @ X2))) ) | ~spl0_2),
% 0.22/0.50 inference(pi_clausification,[],[f168])).
% 0.22/0.50 thf(f168,plain,(
% 0.22/0.50 ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((sK2 @ Y1 @ Y0) & (sK2 @ Y1 @ X1)) => (sK2 @ X1 @ Y0)))))))) ) | ~spl0_2),
% 0.22/0.50 inference(beta_eta_normalization,[],[f167])).
% 0.22/0.50 thf(f167,plain,(
% 0.22/0.50 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y1) & (sK2 @ Y2 @ Y0)) => (sK2 @ Y0 @ Y1))))))) @ X1) = $true)) ) | ~spl0_2),
% 0.22/0.50 inference(pi_clausification,[],[f166])).
% 0.22/0.50 thf(f166,plain,(
% 0.22/0.50 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y1) & (sK2 @ Y2 @ Y0)) => (sK2 @ Y0 @ Y1)))))))) = $true) | ~spl0_2),
% 0.22/0.50 inference(boolean_simplification,[],[f165])).
% 0.22/0.50 thf(f165,plain,(
% 0.22/0.50 ($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y1) & (sK2 @ Y2 @ Y0)) => (sK2 @ Y0 @ Y1)))))))) & $true)) | ~spl0_2),
% 0.22/0.50 inference(backward_demodulation,[],[f152,f163])).
% 0.22/0.50 thf(f190,plain,(
% 0.22/0.50 spl0_5 | spl0_6 | ~spl0_3),
% 0.22/0.50 inference(avatar_split_clause,[],[f183,f155,f188,f185])).
% 0.22/0.50 thf(f155,plain,(
% 0.22/0.50 spl0_3 <=> ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0)))))))) & (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0))))) & (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK2 @ Y1 @ Y0) => (sK2 @ Y0 @ Y1))))))))),
% 0.22/0.50 introduced(avatar_definition,[new_symbols(naming,[spl0_3])])).
% 0.22/0.50 thf(f183,plain,(
% 0.22/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK2 @ Y1 @ Y0) => (sK2 @ Y0 @ Y1))))))) | ($false = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0)))))))) & (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0)))))) | ~spl0_3),
% 0.22/0.50 inference(binary_proxy_clausification,[],[f156])).
% 0.22/0.50 thf(f156,plain,(
% 0.22/0.50 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0)))))))) & (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0))))) & (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK2 @ Y1 @ Y0) => (sK2 @ Y0 @ Y1)))))))) | ~spl0_3),
% 0.22/0.50 inference(avatar_component_clause,[],[f155])).
% 0.22/0.50 thf(f160,plain,(
% 0.22/0.50 spl0_3 | spl0_4),
% 0.22/0.50 inference(avatar_split_clause,[],[f146,f158,f155])).
% 0.22/0.50 thf(f146,plain,(
% 0.22/0.50 ($false = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y1) & (sK2 @ Y2 @ Y0)) => (sK2 @ Y0 @ Y1)))))))) & (!! @ $i @ (^[Y0 : $i]: (sK2 @ Y0 @ Y0))))) | ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0)))))))) & (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0))))) & (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK2 @ Y1 @ Y0) => (sK2 @ Y0 @ Y1))))))))),
% 0.22/0.50 inference(binary_proxy_clausification,[],[f144])).
% 0.22/0.50 thf(f153,plain,(
% 0.22/0.50 spl0_1 | spl0_2),
% 0.22/0.50 inference(avatar_split_clause,[],[f145,f151,f148])).
% 0.22/0.50 thf(f145,plain,(
% 0.22/0.50 ($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y1) & (sK2 @ Y2 @ Y0)) => (sK2 @ Y0 @ Y1)))))))) & (!! @ $i @ (^[Y0 : $i]: (sK2 @ Y0 @ Y0))))) | ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK2 @ Y2 @ Y0) & (sK2 @ Y1 @ Y2)) => (sK2 @ Y1 @ Y0)))))))) & (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK2 @ Y0))))) & (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK2 @ Y1 @ Y0) => (sK2 @ Y0 @ Y1))))))) = $true)),
% 0.22/0.50 inference(binary_proxy_clausification,[],[f144])).
% 0.22/0.50 % SZS output end Proof for theBenchmark
% 0.22/0.50 % (16160)------------------------------
% 0.22/0.50 % (16160)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.50 % (16160)Termination reason: Refutation
% 0.22/0.50
% 0.22/0.50 % (16160)Memory used [KB]: 6140
% 0.22/0.50 % (16160)Time elapsed: 0.071 s
% 0.22/0.50 % (16160)Instructions burned: 87 (million)
% 0.22/0.50 % (16160)------------------------------
% 0.22/0.50 % (16160)------------------------------
% 0.22/0.50 % (16148)Success in time 0.117 s
% 0.22/0.50 % Vampire---4.8 exiting
%------------------------------------------------------------------------------