TSTP Solution File: AGT032^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : AGT032^1 : TPTP v8.2.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n013.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 17:58:47 EDT 2024
% Result : Theorem 0.24s 0.45s
% Output : Refutation 0.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : AGT032^1 : TPTP v8.2.0. Bugfixed v5.4.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.38 % Computer : n013.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Sat May 18 18:52:38 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.16/0.38 This is a TH0_THM_EQU_NAR problem
% 0.16/0.39 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.24/0.41 % (15158)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.24/0.41 % (15157)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.24/0.41 % (15155)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.24/0.41 % (15156)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.24/0.41 % (15154)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.24/0.41 % (15160)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.24/0.41 % (15159)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.24/0.41 % (15161)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.24/0.41 % (15157)Instruction limit reached!
% 0.24/0.41 % (15157)------------------------------
% 0.24/0.41 % (15157)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.41 % (15157)Termination reason: Unknown
% 0.24/0.41 % (15157)Termination phase: shuffling
% 0.24/0.41
% 0.24/0.41 % (15158)Instruction limit reached!
% 0.24/0.41 % (15158)------------------------------
% 0.24/0.41 % (15158)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.41 % (15158)Termination reason: Unknown
% 0.24/0.41 % (15158)Termination phase: shuffling
% 0.24/0.41
% 0.24/0.41 % (15158)Memory used [KB]: 1023
% 0.24/0.41 % (15158)Time elapsed: 0.003 s
% 0.24/0.41 % (15158)Instructions burned: 2 (million)
% 0.24/0.41 % (15158)------------------------------
% 0.24/0.41 % (15158)------------------------------
% 0.24/0.41 % (15157)Memory used [KB]: 1023
% 0.24/0.41 % (15157)Time elapsed: 0.003 s
% 0.24/0.41 % (15157)Instructions burned: 2 (million)
% 0.24/0.41 % (15157)------------------------------
% 0.24/0.41 % (15157)------------------------------
% 0.24/0.41 % (15161)Instruction limit reached!
% 0.24/0.41 % (15161)------------------------------
% 0.24/0.41 % (15161)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.41 % (15161)Termination reason: Unknown
% 0.24/0.41 % (15161)Termination phase: shuffling
% 0.24/0.41
% 0.24/0.41 % (15161)Memory used [KB]: 1023
% 0.24/0.41 % (15161)Time elapsed: 0.004 s
% 0.24/0.41 % (15161)Instructions burned: 4 (million)
% 0.24/0.41 % (15161)------------------------------
% 0.24/0.41 % (15161)------------------------------
% 0.24/0.41 % (15155)Instruction limit reached!
% 0.24/0.41 % (15155)------------------------------
% 0.24/0.41 % (15155)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.41 % (15155)Termination reason: Unknown
% 0.24/0.41 % (15155)Termination phase: shuffling
% 0.24/0.41
% 0.24/0.41 % (15155)Memory used [KB]: 1151
% 0.24/0.41 % (15155)Time elapsed: 0.004 s
% 0.24/0.41 % (15155)Instructions burned: 5 (million)
% 0.24/0.41 % (15155)------------------------------
% 0.24/0.41 % (15155)------------------------------
% 0.24/0.41 % (15159)Refutation not found, incomplete strategy
% 0.24/0.41 % (15159)------------------------------
% 0.24/0.41 % (15159)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.41 % (15159)Termination reason: Refutation not found, incomplete strategy
% 0.24/0.41
% 0.24/0.41
% 0.24/0.41 % (15159)Memory used [KB]: 5628
% 0.24/0.41 % (15159)Time elapsed: 0.007 s
% 0.24/0.41 % (15159)Instructions burned: 11 (million)
% 0.24/0.41 % (15159)------------------------------
% 0.24/0.41 % (15159)------------------------------
% 0.24/0.42 % (15160)Instruction limit reached!
% 0.24/0.42 % (15160)------------------------------
% 0.24/0.42 % (15160)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.42 % (15160)Termination reason: Unknown
% 0.24/0.42 % (15160)Termination phase: Property scanning
% 0.24/0.42
% 0.24/0.42 % (15160)Memory used [KB]: 1151
% 0.24/0.42 % (15160)Time elapsed: 0.011 s
% 0.24/0.42 % (15160)Instructions burned: 19 (million)
% 0.24/0.42 % (15160)------------------------------
% 0.24/0.42 % (15160)------------------------------
% 0.24/0.42 % (15156)Instruction limit reached!
% 0.24/0.42 % (15156)------------------------------
% 0.24/0.42 % (15156)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.42 % (15156)Termination reason: Unknown
% 0.24/0.42 % (15156)Termination phase: Saturation
% 0.24/0.42
% 0.24/0.42 % (15156)Memory used [KB]: 5756
% 0.24/0.42 % (15156)Time elapsed: 0.015 s
% 0.24/0.42 % (15156)Instructions burned: 28 (million)
% 0.24/0.42 % (15156)------------------------------
% 0.24/0.42 % (15156)------------------------------
% 0.24/0.42 % (15162)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.24/0.42 % (15163)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.24/0.42 % (15164)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.24/0.42 % (15165)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.24/0.43 % (15164)Instruction limit reached!
% 0.24/0.43 % (15164)------------------------------
% 0.24/0.43 % (15164)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.43 % (15164)Termination reason: Unknown
% 0.24/0.43 % (15164)Termination phase: shuffling
% 0.24/0.43
% 0.24/0.43 % (15164)Memory used [KB]: 1023
% 0.24/0.43 % (15164)Time elapsed: 0.004 s
% 0.24/0.43 % (15164)Instructions burned: 4 (million)
% 0.24/0.43 % (15164)------------------------------
% 0.24/0.43 % (15164)------------------------------
% 0.24/0.43 % (15166)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.24/0.43 % (15163)Instruction limit reached!
% 0.24/0.43 % (15163)------------------------------
% 0.24/0.43 % (15163)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.43 % (15163)Termination reason: Unknown
% 0.24/0.43 % (15163)Termination phase: Property scanning
% 0.24/0.43
% 0.24/0.43 % (15163)Memory used [KB]: 1151
% 0.24/0.43 % (15163)Time elapsed: 0.009 s
% 0.24/0.43 % (15163)Instructions burned: 15 (million)
% 0.24/0.43 % (15163)------------------------------
% 0.24/0.43 % (15163)------------------------------
% 0.24/0.43 % (15167)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.24/0.43 % (15166)Instruction limit reached!
% 0.24/0.43 % (15166)------------------------------
% 0.24/0.43 % (15166)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.43 % (15166)Termination reason: Unknown
% 0.24/0.43 % (15166)Termination phase: Property scanning
% 0.24/0.43
% 0.24/0.43 % (15166)Memory used [KB]: 1151
% 0.24/0.43 % (15166)Time elapsed: 0.006 s
% 0.24/0.43 % (15166)Instructions burned: 8 (million)
% 0.24/0.43 % (15166)------------------------------
% 0.24/0.43 % (15166)------------------------------
% 0.24/0.44 % (15168)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.24/0.44 % (15168)Instruction limit reached!
% 0.24/0.44 % (15168)------------------------------
% 0.24/0.44 % (15168)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.44 % (15168)Termination reason: Unknown
% 0.24/0.44 % (15168)Termination phase: shuffling
% 0.24/0.44
% 0.24/0.44 % (15168)Memory used [KB]: 1023
% 0.24/0.44 % (15168)Time elapsed: 0.004 s
% 0.24/0.44 % (15168)Instructions burned: 4 (million)
% 0.24/0.44 % (15168)------------------------------
% 0.24/0.44 % (15168)------------------------------
% 0.24/0.44 % (15167)Instruction limit reached!
% 0.24/0.44 % (15167)------------------------------
% 0.24/0.44 % (15167)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.44 % (15167)Termination reason: Unknown
% 0.24/0.44 % (15167)Termination phase: Property scanning
% 0.24/0.44
% 0.24/0.44 % (15167)Memory used [KB]: 1151
% 0.24/0.44 % (15167)Time elapsed: 0.010 s
% 0.24/0.44 % (15167)Instructions burned: 17 (million)
% 0.24/0.44 % (15167)------------------------------
% 0.24/0.44 % (15167)------------------------------
% 0.24/0.44 % (15162)Instruction limit reached!
% 0.24/0.44 % (15162)------------------------------
% 0.24/0.44 % (15162)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.44 % (15162)Termination reason: Unknown
% 0.24/0.44 % (15162)Termination phase: Saturation
% 0.24/0.44
% 0.24/0.44 % (15162)Memory used [KB]: 5884
% 0.24/0.44 % (15162)Time elapsed: 0.019 s
% 0.24/0.44 % (15162)Instructions burned: 37 (million)
% 0.24/0.44 % (15162)------------------------------
% 0.24/0.44 % (15162)------------------------------
% 0.24/0.44 % (15169)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.24/0.44 % (15169)Instruction limit reached!
% 0.24/0.44 % (15169)------------------------------
% 0.24/0.44 % (15169)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.44 % (15169)Termination reason: Unknown
% 0.24/0.44 % (15169)Termination phase: shuffling
% 0.24/0.44
% 0.24/0.44 % (15169)Memory used [KB]: 1023
% 0.24/0.44 % (15169)Time elapsed: 0.004 s
% 0.24/0.44 % (15169)Instructions burned: 4 (million)
% 0.24/0.44 % (15169)------------------------------
% 0.24/0.44 % (15169)------------------------------
% 0.24/0.44 % (15170)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.24/0.45 % (15154)First to succeed.
% 0.24/0.45 % (15171)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.24/0.45 % (15170)Instruction limit reached!
% 0.24/0.45 % (15170)------------------------------
% 0.24/0.45 % (15170)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.45 % (15170)Termination reason: Unknown
% 0.24/0.45 % (15170)Termination phase: Property scanning
% 0.24/0.45
% 0.24/0.45 % (15170)Memory used [KB]: 1151
% 0.24/0.45 % (15170)Time elapsed: 0.006 s
% 0.24/0.45 % (15170)Instructions burned: 8 (million)
% 0.24/0.45 % (15170)------------------------------
% 0.24/0.45 % (15170)------------------------------
% 0.24/0.45 % (15154)Refutation found. Thanks to Tanya!
% 0.24/0.45 % SZS status Theorem for theBenchmark
% 0.24/0.45 % SZS output start Proof for theBenchmark
% 0.24/0.45 thf(type_def_5, type, mu: $tType).
% 0.24/0.45 thf(func_def_0, type, mu: $tType).
% 0.24/0.45 thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.24/0.45 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.24/0.45 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.24/0.45 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.24/0.45 thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.24/0.45 thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.24/0.45 thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.24/0.45 thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.24/0.45 thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.24/0.45 thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.24/0.45 thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.24/0.45 thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.24/0.45 thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.24/0.45 thf(func_def_15, type, mtrue: $i > $o).
% 0.24/0.45 thf(func_def_16, type, mfalse: $i > $o).
% 0.24/0.45 thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.24/0.45 thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.24/0.45 thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.24/0.45 thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.24/0.45 thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.24/0.45 thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.24/0.45 thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.24/0.45 thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.24/0.45 thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.24/0.45 thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.24/0.45 thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.24/0.45 thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.24/0.45 thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.24/0.45 thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.24/0.45 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.24/0.45 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.24/0.45 thf(func_def_33, type, a1: $i > $i > $o).
% 0.24/0.45 thf(func_def_34, type, a2: $i > $i > $o).
% 0.24/0.45 thf(func_def_35, type, a3: $i > $i > $o).
% 0.24/0.45 thf(func_def_36, type, jan: mu).
% 0.24/0.45 thf(func_def_37, type, piotr: mu).
% 0.24/0.45 thf(func_def_38, type, cola: mu).
% 0.24/0.45 thf(func_def_39, type, pepsi: mu).
% 0.24/0.45 thf(func_def_40, type, beer: mu).
% 0.24/0.45 thf(func_def_41, type, likes: mu > mu > $i > $o).
% 0.24/0.45 thf(func_def_42, type, very_much_likes: mu > mu > $i > $o).
% 0.24/0.45 thf(func_def_43, type, possibly_likes: mu > mu > $i > $o).
% 0.24/0.45 thf(func_def_44, type, subrel: ($i > $i > $o) > ($i > $i > $o) > $o).
% 0.24/0.45 thf(func_def_45, type, cond4s: ($i > $i > $o) > ($i > $i > $o) > $o).
% 0.24/0.45 thf(func_def_63, type, sK2: $i > $i).
% 0.24/0.45 thf(func_def_64, type, sK3: mu > mu > $i > $i).
% 0.24/0.45 thf(func_def_65, type, sK4: mu > mu > $i > $i).
% 0.24/0.45 thf(func_def_66, type, sK5: mu > mu > $i > $i).
% 0.24/0.45 thf(func_def_67, type, sK6: $i > $i).
% 0.24/0.45 thf(func_def_68, type, sK7: $i > $i).
% 0.24/0.45 thf(func_def_69, type, sK8: $i > $i).
% 0.24/0.45 thf(func_def_70, type, sK9: mu > $i > mu > $i).
% 0.24/0.45 thf(func_def_71, type, sK10: $i > $i).
% 0.24/0.45 thf(f838,plain,(
% 0.24/0.45 $false),
% 0.24/0.45 inference(trivial_inequality_removal,[],[f836])).
% 0.24/0.45 thf(f836,plain,(
% 0.24/0.45 ($false = $true)),
% 0.24/0.45 inference(superposition,[],[f623,f831])).
% 0.24/0.45 thf(f831,plain,(
% 0.24/0.45 ( ! [X0 : $i] : (((a1 @ sK1 @ X0) = $false)) )),
% 0.24/0.45 inference(trivial_inequality_removal,[],[f828])).
% 0.24/0.45 thf(f828,plain,(
% 0.24/0.45 ( ! [X0 : $i] : (((a1 @ sK1 @ X0) = $false) | ($false = $true)) )),
% 0.24/0.45 inference(superposition,[],[f827,f382])).
% 0.24/0.45 thf(f382,plain,(
% 0.24/0.45 ( ! [X2 : $i,X1 : $i] : (((a1 @ X2 @ X1) = $true) | ((a1 @ X1 @ X2) = $false)) )),
% 0.24/0.45 inference(binary_proxy_clausification,[],[f381])).
% 0.24/0.45 thf(f381,plain,(
% 0.24/0.45 ( ! [X2 : $i,X1 : $i] : ((((a1 @ X1 @ X2) => (a1 @ X2 @ X1)) = $true)) )),
% 0.24/0.45 inference(beta_eta_normalization,[],[f380])).
% 0.24/0.45 thf(f380,plain,(
% 0.24/0.45 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: ((a1 @ X1 @ Y0) => (a1 @ Y0 @ X1))) @ X2) = $true)) )),
% 0.24/0.45 inference(pi_clausification,[],[f379])).
% 0.24/0.45 thf(f379,plain,(
% 0.24/0.45 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((a1 @ X1 @ Y0) => (a1 @ Y0 @ X1)))) = $true)) )),
% 0.24/0.45 inference(beta_eta_normalization,[],[f378])).
% 0.24/0.45 thf(f378,plain,(
% 0.24/0.45 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((a1 @ Y0 @ Y1) => (a1 @ Y1 @ Y0))))) @ X1) = $true)) )),
% 0.24/0.45 inference(pi_clausification,[],[f377])).
% 0.24/0.45 thf(f377,plain,(
% 0.24/0.45 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((a1 @ Y0 @ Y1) => (a1 @ Y1 @ Y0)))))) = $true)),
% 0.24/0.45 inference(beta_eta_normalization,[],[f336])).
% 0.24/0.45 thf(f336,plain,(
% 0.24/0.45 (((^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y1 @ Y2) => (Y0 @ Y2 @ Y1))))))) @ a1) = $true)),
% 0.24/0.45 inference(definition_unfolding,[],[f281,f266])).
% 0.24/0.45 thf(f266,plain,(
% 0.24/0.45 (msymmetric = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y1 @ Y2) => (Y0 @ Y2 @ Y1))))))))),
% 0.24/0.45 inference(cnf_transformation,[],[f199])).
% 0.24/0.45 thf(f199,plain,(
% 0.24/0.45 (msymmetric = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y1 @ Y2) => (Y0 @ Y2 @ Y1))))))))),
% 0.24/0.45 inference(fool_elimination,[],[f198])).
% 0.24/0.45 thf(f198,plain,(
% 0.24/0.45 ((^[X0 : $i > $i > $o] : (! [X1,X2] : ((X0 @ X2 @ X1) => (X0 @ X1 @ X2)))) = msymmetric)),
% 0.24/0.45 inference(rectify,[],[f19])).
% 0.24/0.45 thf(f19,axiom,(
% 0.24/0.45 ((^[X6 : $i > $i > $o] : (! [X9,X8] : ((X6 @ X8 @ X9) => (X6 @ X9 @ X8)))) = msymmetric)),
% 0.24/0.45 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',msymmetric)).
% 0.24/0.45 thf(f281,plain,(
% 0.24/0.45 ((msymmetric @ a1) = $true)),
% 0.24/0.45 inference(cnf_transformation,[],[f178])).
% 0.24/0.45 thf(f178,plain,(
% 0.24/0.45 ((msymmetric @ a1) = $true)),
% 0.24/0.45 inference(fool_elimination,[],[f177])).
% 0.24/0.45 thf(f177,plain,(
% 0.24/0.45 (msymmetric @ a1)),
% 0.24/0.45 inference(rectify,[],[f50])).
% 0.24/0.45 thf(f50,axiom,(
% 0.24/0.45 (msymmetric @ a1)),
% 0.24/0.45 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axioms_B_a1)).
% 0.24/0.45 thf(f827,plain,(
% 0.24/0.45 ( ! [X0 : $i] : (((a1 @ X0 @ sK1) = $false)) )),
% 0.24/0.45 inference(trivial_inequality_removal,[],[f824])).
% 0.24/0.45 thf(f824,plain,(
% 0.24/0.45 ( ! [X0 : $i] : (($false = $true) | ((a1 @ X0 @ sK1) = $false)) )),
% 0.24/0.45 inference(superposition,[],[f462,f416])).
% 0.24/0.45 thf(f416,plain,(
% 0.24/0.45 ( ! [X2 : mu,X1 : mu] : (((likes @ X1 @ X2 @ sK1) = $false)) )),
% 0.24/0.45 inference(not_proxy_clausification,[],[f415])).
% 0.24/0.45 thf(f415,plain,(
% 0.24/0.45 ( ! [X2 : mu,X1 : mu] : (((~ (likes @ X1 @ X2 @ sK1)) = $true)) )),
% 0.24/0.45 inference(beta_eta_normalization,[],[f414])).
% 0.24/0.45 thf(f414,plain,(
% 0.24/0.45 ( ! [X2 : mu,X1 : mu] : ((((^[Y0 : mu]: (~ (likes @ X1 @ Y0 @ sK1))) @ X2) = $true)) )),
% 0.24/0.45 inference(pi_clausification,[],[f413])).
% 0.24/0.45 thf(f413,plain,(
% 0.24/0.45 ( ! [X1 : mu] : (((!! @ mu @ (^[Y0 : mu]: (~ (likes @ X1 @ Y0 @ sK1)))) = $true)) )),
% 0.24/0.45 inference(beta_eta_normalization,[],[f412])).
% 0.24/0.45 thf(f412,plain,(
% 0.24/0.45 ( ! [X1 : mu] : ((((^[Y0 : mu]: (!! @ mu @ (^[Y1 : mu]: (~ (likes @ Y0 @ Y1 @ sK1))))) @ X1) = $true)) )),
% 0.24/0.45 inference(pi_clausification,[],[f411])).
% 0.24/0.45 thf(f411,plain,(
% 0.24/0.45 ((!! @ mu @ (^[Y0 : mu]: (!! @ mu @ (^[Y1 : mu]: (~ (likes @ Y0 @ Y1 @ sK1)))))) = $true)),
% 0.24/0.45 inference(not_proxy_clausification,[],[f410])).
% 0.24/0.45 thf(f410,plain,(
% 0.24/0.45 ($false = (~ (!! @ mu @ (^[Y0 : mu]: (!! @ mu @ (^[Y1 : mu]: (~ (likes @ Y0 @ Y1 @ sK1))))))))),
% 0.24/0.45 inference(beta_eta_normalization,[],[f409])).
% 0.24/0.45 thf(f409,plain,(
% 0.24/0.45 (((^[Y0 : $i]: (~ (!! @ mu @ (^[Y1 : mu]: (!! @ mu @ (^[Y2 : mu]: (~ (likes @ Y1 @ Y2 @ Y0)))))))) @ sK1) = $false)),
% 0.24/0.45 inference(sigma_clausification,[],[f408])).
% 0.24/0.45 thf(f408,plain,(
% 0.24/0.45 ((!! @ $i @ (^[Y0 : $i]: (~ (!! @ mu @ (^[Y1 : mu]: (!! @ mu @ (^[Y2 : mu]: (~ (likes @ Y1 @ Y2 @ Y0))))))))) != $true)),
% 0.24/0.45 inference(boolean_simplification,[],[f407])).
% 0.24/0.45 thf(f407,plain,(
% 0.24/0.45 ((!! @ $i @ (^[Y0 : $i]: (~ (!! @ mu @ (^[Y1 : mu]: (~ (~ (!! @ mu @ (^[Y2 : mu]: (~ (likes @ Y1 @ Y2 @ Y0))))))))))) != $true)),
% 0.24/0.45 inference(beta_eta_normalization,[],[f325])).
% 0.24/0.45 thf(f325,plain,(
% 0.24/0.45 (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : mu > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : mu > $i > $o]: ((^[Y2 : $i]: (!! @ mu @ (^[Y3 : mu]: (Y1 @ Y3 @ Y2)))))) @ (^[Y1 : mu]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ (Y0 @ Y1)))))) @ (^[Y0 : mu]: ((^[Y1 : mu > $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ ((^[Y2 : mu > $i > $o]: ((^[Y3 : $i]: (!! @ mu @ (^[Y4 : mu]: (Y2 @ Y4 @ Y3)))))) @ (^[Y2 : mu]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (~ (Y3 @ Y4))))) @ (Y1 @ Y2)))))) @ (^[Y1 : mu]: (likes @ Y0 @ Y1)))))) != $true)),
% 0.24/0.45 inference(definition_unfolding,[],[f260,f265,f297,f297])).
% 0.24/0.45 thf(f297,plain,(
% 0.24/0.45 (mexists_ind = (^[Y0 : mu > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : mu > $i > $o]: ((^[Y2 : $i]: (!! @ mu @ (^[Y3 : mu]: (Y1 @ Y3 @ Y2)))))) @ (^[Y1 : mu]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ (Y0 @ Y1)))))))),
% 0.24/0.45 inference(definition_unfolding,[],[f285,f291,f224,f291])).
% 0.24/0.45 thf(f224,plain,(
% 0.24/0.45 (mforall_ind = (^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: (Y0 @ Y2 @ Y1)))))))),
% 0.24/0.45 inference(cnf_transformation,[],[f137])).
% 0.24/0.45 thf(f137,plain,(
% 0.24/0.45 (mforall_ind = (^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: (Y0 @ Y2 @ Y1)))))))),
% 0.24/0.45 inference(fool_elimination,[],[f136])).
% 0.24/0.45 thf(f136,plain,(
% 0.24/0.45 ((^[X0 : mu > $i > $o, X1 : $i] : (! [X2 : mu] : (X0 @ X2 @ X1))) = mforall_ind)),
% 0.24/0.45 inference(rectify,[],[f10])).
% 0.24/0.45 thf(f10,axiom,(
% 0.24/0.45 ((^[X3 : mu > $i > $o, X2 : $i] : (! [X0 : mu] : (X3 @ X0 @ X2))) = mforall_ind)),
% 0.24/0.45 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mforall_ind)).
% 0.24/0.45 thf(f291,plain,(
% 0.24/0.45 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.24/0.45 inference(cnf_transformation,[],[f101])).
% 0.24/0.45 thf(f101,plain,(
% 0.24/0.45 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.24/0.45 inference(fool_elimination,[],[f100])).
% 0.24/0.45 thf(f100,plain,(
% 0.24/0.45 ((^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))) = mnot)),
% 0.24/0.45 inference(rectify,[],[f3])).
% 0.24/0.45 thf(f3,axiom,(
% 0.24/0.45 ((^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))) = mnot)),
% 0.24/0.45 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot)).
% 0.24/0.45 thf(f285,plain,(
% 0.24/0.45 (mexists_ind = (^[Y0 : mu > $i > $o]: (mnot @ (mforall_ind @ (^[Y1 : mu]: (mnot @ (Y0 @ Y1)))))))),
% 0.24/0.45 inference(cnf_transformation,[],[f87])).
% 0.24/0.45 thf(f87,plain,(
% 0.24/0.45 (mexists_ind = (^[Y0 : mu > $i > $o]: (mnot @ (mforall_ind @ (^[Y1 : mu]: (mnot @ (Y0 @ Y1)))))))),
% 0.24/0.45 inference(fool_elimination,[],[f86])).
% 0.24/0.45 thf(f86,plain,(
% 0.24/0.45 (mexists_ind = (^[X0 : mu > $i > $o] : (mnot @ (mforall_ind @ (^[X1 : mu] : (mnot @ (X0 @ X1)))))))),
% 0.24/0.45 inference(rectify,[],[f12])).
% 0.24/0.45 thf(f12,axiom,(
% 0.24/0.45 (mexists_ind = (^[X3 : mu > $i > $o] : (mnot @ (mforall_ind @ (^[X0 : mu] : (mnot @ (X3 @ X0)))))))),
% 0.24/0.45 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mexists_ind)).
% 0.24/0.45 thf(f265,plain,(
% 0.24/0.45 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.24/0.45 inference(cnf_transformation,[],[f217])).
% 0.24/0.45 thf(f217,plain,(
% 0.24/0.45 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.24/0.45 inference(fool_elimination,[],[f216])).
% 0.24/0.45 thf(f216,plain,(
% 0.24/0.45 (mvalid = (^[X0 : $i > $o] : (! [X1] : (X0 @ X1))))),
% 0.24/0.45 inference(rectify,[],[f28])).
% 0.24/0.45 thf(f28,axiom,(
% 0.24/0.45 (mvalid = (^[X3 : $i > $o] : (! [X2] : (X3 @ X2))))),
% 0.24/0.45 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.24/0.45 thf(f260,plain,(
% 0.24/0.45 ((mvalid @ (mexists_ind @ (^[Y0 : mu]: (mexists_ind @ (^[Y1 : mu]: (likes @ Y0 @ Y1)))))) != $true)),
% 0.24/0.45 inference(cnf_transformation,[],[f218])).
% 0.24/0.45 thf(f218,plain,(
% 0.24/0.45 ((mvalid @ (mexists_ind @ (^[Y0 : mu]: (mexists_ind @ (^[Y1 : mu]: (likes @ Y0 @ Y1)))))) != $true)),
% 0.24/0.45 inference(flattening,[],[f135])).
% 0.24/0.45 thf(f135,plain,(
% 0.24/0.45 ~((mvalid @ (mexists_ind @ (^[Y0 : mu]: (mexists_ind @ (^[Y1 : mu]: (likes @ Y0 @ Y1)))))) = $true)),
% 0.24/0.45 inference(fool_elimination,[],[f134])).
% 0.24/0.45 thf(f134,plain,(
% 0.24/0.45 ~(mvalid @ (mexists_ind @ (^[X0 : mu] : (mexists_ind @ (^[X1 : mu] : (likes @ X0 @ X1))))))),
% 0.24/0.45 inference(rectify,[],[f74])).
% 0.24/0.45 thf(f74,negated_conjecture,(
% 0.24/0.45 ~(mvalid @ (mexists_ind @ (^[X0 : mu] : (mexists_ind @ (^[X1 : mu] : (likes @ X0 @ X1))))))),
% 0.24/0.45 inference(negated_conjecture,[],[f73])).
% 0.24/0.45 thf(f73,conjecture,(
% 0.24/0.45 (mvalid @ (mexists_ind @ (^[X0 : mu] : (mexists_ind @ (^[X1 : mu] : (likes @ X0 @ X1))))))),
% 0.24/0.45 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)).
% 0.24/0.45 thf(f462,plain,(
% 0.24/0.45 ( ! [X2 : $i,X1 : $i] : (((likes @ piotr @ pepsi @ X2) = $true) | ((a1 @ X1 @ X2) = $false)) )),
% 0.24/0.45 inference(not_proxy_clausification,[],[f461])).
% 0.24/0.45 thf(f461,plain,(
% 0.24/0.45 ( ! [X2 : $i,X1 : $i] : (((~ (a1 @ X1 @ X2)) = $true) | ((likes @ piotr @ pepsi @ X2) = $true)) )),
% 0.24/0.45 inference(binary_proxy_clausification,[],[f460])).
% 0.24/0.45 thf(f460,plain,(
% 0.24/0.45 ( ! [X2 : $i,X1 : $i] : ((((~ (a1 @ X1 @ X2)) | (likes @ piotr @ pepsi @ X2)) = $true)) )),
% 0.24/0.45 inference(beta_eta_normalization,[],[f459])).
% 0.24/0.45 thf(f459,plain,(
% 0.24/0.45 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: ((~ (a1 @ X1 @ Y0)) | (likes @ piotr @ pepsi @ Y0))) @ X2) = $true)) )),
% 0.24/0.45 inference(pi_clausification,[],[f458])).
% 0.24/0.45 thf(f458,plain,(
% 0.24/0.45 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((~ (a1 @ X1 @ Y0)) | (likes @ piotr @ pepsi @ Y0)))) = $true)) )),
% 0.24/0.45 inference(beta_eta_normalization,[],[f457])).
% 0.24/0.45 thf(f457,plain,(
% 0.24/0.45 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (a1 @ Y0 @ Y1)) | (likes @ piotr @ pepsi @ Y1))))) @ X1) = $true)) )),
% 0.24/0.45 inference(pi_clausification,[],[f456])).
% 0.24/0.45 thf(f456,plain,(
% 0.24/0.45 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (a1 @ Y0 @ Y1)) | (likes @ piotr @ pepsi @ Y1)))))) = $true)),
% 0.24/0.45 inference(beta_eta_normalization,[],[f308])).
% 0.24/0.45 thf(f308,plain,(
% 0.24/0.45 (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))) @ a1 @ (likes @ piotr @ pepsi))) = $true)),
% 0.24/0.45 inference(definition_unfolding,[],[f230,f265,f234])).
% 0.24/0.45 thf(f234,plain,(
% 0.24/0.45 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))))),
% 0.24/0.45 inference(cnf_transformation,[],[f103])).
% 0.24/0.45 thf(f103,plain,(
% 0.24/0.45 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))))),
% 0.24/0.45 inference(fool_elimination,[],[f102])).
% 0.24/0.45 thf(f102,plain,(
% 0.24/0.45 ((^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i] : (! [X3] : ((X1 @ X3) | ~(X0 @ X2 @ X3)))) = mbox)),
% 0.24/0.45 inference(rectify,[],[f16])).
% 0.24/0.45 thf(f16,axiom,(
% 0.24/0.45 ((^[X6 : $i > $i > $o, X3 : $i > $o, X2 : $i] : (! [X7] : ((X3 @ X7) | ~(X6 @ X2 @ X7)))) = mbox)),
% 0.24/0.45 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox)).
% 0.24/0.45 thf(f230,plain,(
% 0.24/0.45 ((mvalid @ (mbox @ a1 @ (likes @ piotr @ pepsi))) = $true)),
% 0.24/0.45 inference(cnf_transformation,[],[f187])).
% 0.24/0.45 thf(f187,plain,(
% 0.24/0.45 ((mvalid @ (mbox @ a1 @ (likes @ piotr @ pepsi))) = $true)),
% 0.24/0.45 inference(fool_elimination,[],[f186])).
% 0.24/0.45 thf(f186,plain,(
% 0.24/0.45 (mvalid @ (mbox @ a1 @ (likes @ piotr @ pepsi)))),
% 0.24/0.45 inference(rectify,[],[f33])).
% 0.24/0.45 thf(f33,axiom,(
% 0.24/0.45 (mvalid @ (mbox @ a1 @ (likes @ piotr @ pepsi)))),
% 0.24/0.45 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_a1_2)).
% 0.24/0.45 thf(f623,plain,(
% 0.24/0.45 ( ! [X1 : $i] : (((a1 @ X1 @ (sK7 @ X1)) = $true)) )),
% 0.24/0.45 inference(not_proxy_clausification,[],[f622])).
% 0.24/0.45 thf(f622,plain,(
% 0.24/0.45 ( ! [X1 : $i] : (((~ (a1 @ X1 @ (sK7 @ X1))) = $false)) )),
% 0.24/0.45 inference(binary_proxy_clausification,[],[f620])).
% 0.24/0.45 thf(f620,plain,(
% 0.24/0.45 ( ! [X1 : $i] : ((((~ (a1 @ X1 @ (sK7 @ X1))) | (~ (likes @ piotr @ beer @ (sK7 @ X1)))) = $false)) )),
% 0.24/0.45 inference(beta_eta_normalization,[],[f619])).
% 0.24/0.45 thf(f619,plain,(
% 0.24/0.45 ( ! [X1 : $i] : (($false = ((^[Y0 : $i]: ((~ (a1 @ X1 @ Y0)) | (~ (likes @ piotr @ beer @ Y0)))) @ (sK7 @ X1)))) )),
% 0.24/0.45 inference(sigma_clausification,[],[f618])).
% 0.24/0.45 thf(f618,plain,(
% 0.24/0.45 ( ! [X1 : $i] : (($false = (!! @ $i @ (^[Y0 : $i]: ((~ (a1 @ X1 @ Y0)) | (~ (likes @ piotr @ beer @ Y0))))))) )),
% 0.24/0.45 inference(not_proxy_clausification,[],[f617])).
% 0.24/0.45 thf(f617,plain,(
% 0.24/0.45 ( ! [X1 : $i] : (((~ (!! @ $i @ (^[Y0 : $i]: ((~ (a1 @ X1 @ Y0)) | (~ (likes @ piotr @ beer @ Y0)))))) = $true)) )),
% 0.24/0.45 inference(beta_eta_normalization,[],[f616])).
% 0.24/0.45 thf(f616,plain,(
% 0.24/0.45 ( ! [X1 : $i] : ((((^[Y0 : $i]: (~ (!! @ $i @ (^[Y1 : $i]: ((~ (a1 @ Y0 @ Y1)) | (~ (likes @ piotr @ beer @ Y1))))))) @ X1) = $true)) )),
% 0.24/0.45 inference(pi_clausification,[],[f615])).
% 0.24/0.45 thf(f615,plain,(
% 0.24/0.45 ((!! @ $i @ (^[Y0 : $i]: (~ (!! @ $i @ (^[Y1 : $i]: ((~ (a1 @ Y0 @ Y1)) | (~ (likes @ piotr @ beer @ Y1)))))))) = $true)),
% 0.24/0.45 inference(beta_eta_normalization,[],[f316])).
% 0.24/0.45 thf(f316,plain,(
% 0.24/0.45 (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ ((^[Y2 : $i > $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (!! @ $i @ (^[Y5 : $i]: ((~ (Y2 @ Y4 @ Y5)) | (Y3 @ Y5))))))))) @ Y0 @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y1)))))) @ a1 @ (likes @ piotr @ beer))) = $true)),
% 0.24/0.45 inference(definition_unfolding,[],[f246,f265,f300])).
% 0.24/0.45 thf(f300,plain,(
% 0.24/0.45 (mdia = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ ((^[Y2 : $i > $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (!! @ $i @ (^[Y5 : $i]: ((~ (Y2 @ Y4 @ Y5)) | (Y3 @ Y5))))))))) @ Y0 @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y1)))))))),
% 0.24/0.45 inference(definition_unfolding,[],[f271,f291,f234,f291])).
% 0.24/0.45 thf(f271,plain,(
% 0.24/0.45 (mdia = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mbox @ Y0 @ (mnot @ Y1)))))))),
% 0.24/0.45 inference(cnf_transformation,[],[f151])).
% 0.24/0.45 thf(f151,plain,(
% 0.24/0.45 (mdia = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mbox @ Y0 @ (mnot @ Y1)))))))),
% 0.24/0.45 inference(fool_elimination,[],[f150])).
% 0.24/0.45 thf(f150,plain,(
% 0.24/0.45 (mdia = (^[X0 : $i > $i > $o, X1 : $i > $o] : (mnot @ (mbox @ X0 @ (mnot @ X1)))))),
% 0.24/0.45 inference(rectify,[],[f17])).
% 0.24/0.45 thf(f17,axiom,(
% 0.24/0.45 (mdia = (^[X6 : $i > $i > $o, X3 : $i > $o] : (mnot @ (mbox @ X6 @ (mnot @ X3)))))),
% 0.24/0.45 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mdia)).
% 0.24/0.45 thf(f246,plain,(
% 0.24/0.45 ((mvalid @ (mdia @ a1 @ (likes @ piotr @ beer))) = $true)),
% 0.24/0.45 inference(cnf_transformation,[],[f191])).
% 0.24/0.45 thf(f191,plain,(
% 0.24/0.45 ((mvalid @ (mdia @ a1 @ (likes @ piotr @ beer))) = $true)),
% 0.24/0.45 inference(fool_elimination,[],[f190])).
% 0.24/0.45 thf(f190,plain,(
% 0.24/0.45 (mvalid @ (mdia @ a1 @ (likes @ piotr @ beer)))),
% 0.24/0.45 inference(rectify,[],[f43])).
% 0.24/0.45 thf(f43,axiom,(
% 0.24/0.45 (mvalid @ (mdia @ a1 @ (likes @ piotr @ beer)))),
% 0.24/0.45 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_a3_3)).
% 0.24/0.45 % SZS output end Proof for theBenchmark
% 0.24/0.45 % (15154)------------------------------
% 0.24/0.45 % (15154)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.45 % (15154)Termination reason: Refutation
% 0.24/0.45
% 0.24/0.45 % (15154)Memory used [KB]: 6268
% 0.24/0.45 % (15154)Time elapsed: 0.042 s
% 0.24/0.45 % (15154)Instructions burned: 73 (million)
% 0.24/0.45 % (15154)------------------------------
% 0.24/0.45 % (15154)------------------------------
% 0.24/0.45 % (15153)Success in time 0.04 s
% 0.24/0.45 % Vampire---4.8 exiting
%------------------------------------------------------------------------------