TSTP Solution File: LCL712^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL712^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n017.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:22:20 EDT 2024
% Result : Theorem 0.21s 0.42s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL712^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% 0.03/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.15/0.36 % Computer : n017.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 01:43:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_EQU_NAR problem
% 0.15/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38 % (23866)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.21/0.38 % (23865)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.21/0.38 % (23868)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.38 % (23867)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.21/0.38 % (23869)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.21/0.38 % (23868)Instruction limit reached!
% 0.21/0.38 % (23868)------------------------------
% 0.21/0.38 % (23868)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (23868)Termination reason: Unknown
% 0.21/0.38 % (23868)Termination phase: shuffling
% 0.21/0.38
% 0.21/0.38 % (23868)Memory used [KB]: 1023
% 0.21/0.38 % (23868)Time elapsed: 0.003 s
% 0.21/0.38 % (23868)Instructions burned: 2 (million)
% 0.21/0.38 % (23868)------------------------------
% 0.21/0.38 % (23868)------------------------------
% 0.21/0.38 % (23872)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.21/0.38 % (23869)Instruction limit reached!
% 0.21/0.38 % (23869)------------------------------
% 0.21/0.38 % (23869)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (23869)Termination reason: Unknown
% 0.21/0.38 % (23869)Termination phase: shuffling
% 0.21/0.38
% 0.21/0.38 % (23869)Memory used [KB]: 1023
% 0.21/0.38 % (23869)Time elapsed: 0.004 s
% 0.21/0.38 % (23869)Instructions burned: 3 (million)
% 0.21/0.38 % (23869)------------------------------
% 0.21/0.38 % (23869)------------------------------
% 0.21/0.38 % (23866)Instruction limit reached!
% 0.21/0.38 % (23866)------------------------------
% 0.21/0.38 % (23866)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (23866)Termination reason: Unknown
% 0.21/0.38 % (23866)Termination phase: Preprocessing 1
% 0.21/0.38
% 0.21/0.38 % (23866)Memory used [KB]: 1023
% 0.21/0.38 % (23866)Time elapsed: 0.005 s
% 0.21/0.38 % (23866)Instructions burned: 5 (million)
% 0.21/0.38 % (23866)------------------------------
% 0.21/0.38 % (23866)------------------------------
% 0.21/0.38 % (23872)Instruction limit reached!
% 0.21/0.38 % (23872)------------------------------
% 0.21/0.38 % (23872)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (23872)Termination reason: Unknown
% 0.21/0.38 % (23872)Termination phase: Property scanning
% 0.21/0.38
% 0.21/0.38 % (23872)Memory used [KB]: 1023
% 0.21/0.38 % (23872)Time elapsed: 0.004 s
% 0.21/0.38 % (23872)Instructions burned: 4 (million)
% 0.21/0.38 % (23872)------------------------------
% 0.21/0.38 % (23872)------------------------------
% 0.21/0.39 % (23870)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.21/0.39 % (23871)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.40 % (23873)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.21/0.40 % (23867)Instruction limit reached!
% 0.21/0.40 % (23867)------------------------------
% 0.21/0.40 % (23867)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (23867)Termination reason: Unknown
% 0.21/0.40 % (23867)Termination phase: Saturation
% 0.21/0.40
% 0.21/0.40 % (23867)Memory used [KB]: 5756
% 0.21/0.40 % (23867)Time elapsed: 0.019 s
% 0.21/0.40 % (23867)Instructions burned: 27 (million)
% 0.21/0.40 % (23867)------------------------------
% 0.21/0.40 % (23867)------------------------------
% 0.21/0.40 % (23874)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.21/0.40 % (23876)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.21/0.40 % (23871)Instruction limit reached!
% 0.21/0.40 % (23871)------------------------------
% 0.21/0.40 % (23871)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (23871)Termination reason: Unknown
% 0.21/0.40 % (23871)Termination phase: Saturation
% 0.21/0.40
% 0.21/0.40 % (23871)Memory used [KB]: 5756
% 0.21/0.40 % (23871)Time elapsed: 0.013 s
% 0.21/0.40 % (23871)Instructions burned: 18 (million)
% 0.21/0.40 % (23871)------------------------------
% 0.21/0.40 % (23871)------------------------------
% 0.21/0.41 % (23874)Instruction limit reached!
% 0.21/0.41 % (23874)------------------------------
% 0.21/0.41 % (23874)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41 % (23874)Termination reason: Unknown
% 0.21/0.41 % (23874)Termination phase: Saturation
% 0.21/0.41
% 0.21/0.41 % (23874)Memory used [KB]: 5628
% 0.21/0.41 % (23874)Time elapsed: 0.011 s
% 0.21/0.41 % (23874)Instructions burned: 15 (million)
% 0.21/0.41 % (23874)------------------------------
% 0.21/0.41 % (23874)------------------------------
% 0.21/0.41 % (23875)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.21/0.41 % (23875)Instruction limit reached!
% 0.21/0.41 % (23875)------------------------------
% 0.21/0.41 % (23875)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41 % (23875)Termination reason: Unknown
% 0.21/0.41 % (23875)Termination phase: shuffling
% 0.21/0.41
% 0.21/0.41 % (23875)Memory used [KB]: 1023
% 0.21/0.41 % (23875)Time elapsed: 0.003 s
% 0.21/0.41 % (23875)Instructions burned: 3 (million)
% 0.21/0.41 % (23875)------------------------------
% 0.21/0.41 % (23875)------------------------------
% 0.21/0.41 % (23877)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.21/0.42 % (23870)First to succeed.
% 0.21/0.42 % (23877)Instruction limit reached!
% 0.21/0.42 % (23877)------------------------------
% 0.21/0.42 % (23877)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (23873)Instruction limit reached!
% 0.21/0.42 % (23873)------------------------------
% 0.21/0.42 % (23873)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (23873)Termination reason: Unknown
% 0.21/0.42 % (23873)Termination phase: Saturation
% 0.21/0.42
% 0.21/0.42 % (23873)Memory used [KB]: 6012
% 0.21/0.42 % (23873)Time elapsed: 0.022 s
% 0.21/0.42 % (23873)Instructions burned: 37 (million)
% 0.21/0.42 % (23873)------------------------------
% 0.21/0.42 % (23873)------------------------------
% 0.21/0.42 % (23877)Termination reason: Unknown
% 0.21/0.42 % (23877)Termination phase: Function definition elimination
% 0.21/0.42
% 0.21/0.42 % (23877)Memory used [KB]: 1023
% 0.21/0.42 % (23877)Time elapsed: 0.006 s
% 0.21/0.42 % (23877)Instructions burned: 8 (million)
% 0.21/0.42 % (23877)------------------------------
% 0.21/0.42 % (23877)------------------------------
% 0.21/0.42 % (23878)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.21/0.42 % (23865)Also succeeded, but the first one will report.
% 0.21/0.42 % (23870)Refutation found. Thanks to Tanya!
% 0.21/0.42 % SZS status Theorem for theBenchmark
% 0.21/0.42 % SZS output start Proof for theBenchmark
% 0.21/0.42 thf(type_def_5, type, mu: $tType).
% 0.21/0.42 thf(func_def_0, type, mu: $tType).
% 0.21/0.42 thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.21/0.42 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.42 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.21/0.42 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.42 thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.42 thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.42 thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.42 thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.42 thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.42 thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.21/0.42 thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.21/0.42 thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.21/0.42 thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.21/0.42 thf(func_def_15, type, mtrue: $i > $o).
% 0.21/0.42 thf(func_def_16, type, mfalse: $i > $o).
% 0.21/0.42 thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.21/0.42 thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.21/0.42 thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.21/0.42 thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.21/0.42 thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.21/0.42 thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.21/0.42 thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.21/0.42 thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.21/0.42 thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.21/0.42 thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.21/0.42 thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.21/0.42 thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.21/0.42 thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.21/0.42 thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.21/0.42 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.21/0.42 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.21/0.42 thf(func_def_48, type, sK0: $i > $i > $o).
% 0.21/0.42 thf(func_def_53, type, sK5: $i > ($i > $o) > $i).
% 0.21/0.42 thf(func_def_54, type, ph6: !>[X0: $tType]:(X0)).
% 0.21/0.42 thf(f328,plain,(
% 0.21/0.42 $false),
% 0.21/0.42 inference(avatar_sat_refutation,[],[f250,f292,f327])).
% 0.21/0.42 thf(f327,plain,(
% 0.21/0.42 spl1_3 | ~spl1_4),
% 0.21/0.42 inference(avatar_split_clause,[],[f320,f247,f244])).
% 0.21/0.42 thf(f244,plain,(
% 0.21/0.42 spl1_3 <=> ! [X0] : (((sK0 @ sK3 @ X0) = $false) | ((sK0 @ X0 @ sK4) = $false))),
% 0.21/0.42 introduced(avatar_definition,[new_symbols(naming,[spl1_3])])).
% 0.21/0.42 thf(f247,plain,(
% 0.21/0.42 spl1_4 <=> ! [X2,X1] : (($false = (sK0 @ sK3 @ X2)) | ($true = (sK0 @ sK3 @ X1)) | ((sK0 @ X2 @ X1) = $false))),
% 0.21/0.42 introduced(avatar_definition,[new_symbols(naming,[spl1_4])])).
% 0.21/0.42 thf(f320,plain,(
% 0.21/0.42 ( ! [X0 : $i] : (((sK0 @ X0 @ sK4) = $false) | ((sK0 @ sK3 @ X0) = $false)) ) | ~spl1_4),
% 0.21/0.42 inference(trivial_inequality_removal,[],[f315])).
% 0.21/0.42 thf(f315,plain,(
% 0.21/0.42 ( ! [X0 : $i] : (((sK0 @ sK3 @ X0) = $false) | ((sK0 @ X0 @ sK4) = $false) | ($true = $false)) ) | ~spl1_4),
% 0.21/0.42 inference(superposition,[],[f117,f248])).
% 0.21/0.42 thf(f248,plain,(
% 0.21/0.42 ( ! [X2 : $i,X1 : $i] : (($true = (sK0 @ sK3 @ X1)) | ($false = (sK0 @ sK3 @ X2)) | ((sK0 @ X2 @ X1) = $false)) ) | ~spl1_4),
% 0.21/0.42 inference(avatar_component_clause,[],[f247])).
% 0.21/0.42 thf(f117,plain,(
% 0.21/0.42 ($false = (sK0 @ sK3 @ sK4))),
% 0.21/0.42 inference(binary_proxy_clausification,[],[f116])).
% 0.21/0.42 thf(f116,plain,(
% 0.21/0.42 ((((sK0 @ sK2 @ sK4) & (sK0 @ sK3 @ sK2)) => (sK0 @ sK3 @ sK4)) = $false)),
% 0.21/0.42 inference(beta_eta_normalization,[],[f115])).
% 0.21/0.42 thf(f115,plain,(
% 0.21/0.42 ($false = ((^[Y0 : $i]: (((sK0 @ sK2 @ Y0) & (sK0 @ sK3 @ sK2)) => (sK0 @ sK3 @ Y0))) @ sK4))),
% 0.21/0.42 inference(sigma_clausification,[],[f114])).
% 0.21/0.42 thf(f114,plain,(
% 0.21/0.42 ((!! @ $i @ (^[Y0 : $i]: (((sK0 @ sK2 @ Y0) & (sK0 @ sK3 @ sK2)) => (sK0 @ sK3 @ Y0)))) = $false)),
% 0.21/0.42 inference(beta_eta_normalization,[],[f113])).
% 0.21/0.42 thf(f113,plain,(
% 0.21/0.42 ($false = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((sK0 @ sK2 @ Y1) & (sK0 @ Y0 @ sK2)) => (sK0 @ Y0 @ Y1))))) @ sK3))),
% 0.21/0.42 inference(sigma_clausification,[],[f112])).
% 0.21/0.42 thf(f112,plain,(
% 0.21/0.42 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((sK0 @ sK2 @ Y1) & (sK0 @ Y0 @ sK2)) => (sK0 @ Y0 @ Y1)))))) = $false)),
% 0.21/0.42 inference(beta_eta_normalization,[],[f111])).
% 0.21/0.42 thf(f111,plain,(
% 0.21/0.42 (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK0 @ Y0 @ Y2) & (sK0 @ Y1 @ Y0)) => (sK0 @ Y1 @ Y2))))))) @ sK2) = $false)),
% 0.21/0.42 inference(sigma_clausification,[],[f110])).
% 0.21/0.42 thf(f110,plain,(
% 0.21/0.42 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK0 @ Y0 @ Y2) & (sK0 @ Y1 @ Y0)) => (sK0 @ Y1 @ Y2)))))))) != $true)),
% 0.21/0.42 inference(beta_eta_normalization,[],[f108])).
% 0.21/0.42 thf(f108,plain,(
% 0.21/0.42 ($true != ((^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y1 @ Y3) & (Y0 @ Y2 @ Y1)) => (Y0 @ Y2 @ Y3))))))))) @ sK0))),
% 0.21/0.42 inference(definition_unfolding,[],[f106,f98])).
% 0.21/0.42 thf(f98,plain,(
% 0.21/0.42 (mtransitive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y1 @ Y3) & (Y0 @ Y2 @ Y1)) => (Y0 @ Y2 @ Y3))))))))))),
% 0.21/0.42 inference(cnf_transformation,[],[f62])).
% 0.21/0.42 thf(f62,plain,(
% 0.21/0.42 (mtransitive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y1 @ Y3) & (Y0 @ Y2 @ Y1)) => (Y0 @ Y2 @ Y3))))))))))),
% 0.21/0.42 inference(fool_elimination,[],[f61])).
% 0.21/0.42 thf(f61,plain,(
% 0.21/0.42 (mtransitive = (^[X0 : $i > $i > $o] : (! [X1,X2,X3] : (((X0 @ X2 @ X3) & (X0 @ X3 @ X1)) => (X0 @ X2 @ X1)))))),
% 0.21/0.42 inference(rectify,[],[f21])).
% 0.21/0.42 thf(f21,axiom,(
% 0.21/0.42 (mtransitive = (^[X6 : $i > $i > $o] : (! [X10,X8,X9] : (((X6 @ X8 @ X9) & (X6 @ X9 @ X10)) => (X6 @ X8 @ X10)))))),
% 0.21/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mtransitive)).
% 0.21/0.42 thf(f106,plain,(
% 0.21/0.42 ($true != (mtransitive @ sK0))),
% 0.21/0.42 inference(cnf_transformation,[],[f97])).
% 0.21/0.42 thf(f97,plain,(
% 0.21/0.42 ($true != (mtransitive @ sK0)) & ((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ sK0 @ Y0) @ (mbox @ sK0 @ (mbox @ sK0 @ Y0)))))) = $true)),
% 0.21/0.42 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f95,f96])).
% 0.21/0.42 thf(f96,plain,(
% 0.21/0.42 ? [X0 : $i > $i > $o] : (($true != (mtransitive @ X0)) & ((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ X0 @ Y0) @ (mbox @ X0 @ (mbox @ X0 @ Y0)))))) = $true)) => (($true != (mtransitive @ sK0)) & ((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ sK0 @ Y0) @ (mbox @ sK0 @ (mbox @ sK0 @ Y0)))))) = $true))),
% 0.21/0.42 introduced(choice_axiom,[])).
% 0.21/0.42 thf(f95,plain,(
% 0.21/0.42 ? [X0 : $i > $i > $o] : (($true != (mtransitive @ X0)) & ((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ X0 @ Y0) @ (mbox @ X0 @ (mbox @ X0 @ Y0)))))) = $true))),
% 0.21/0.42 inference(ennf_transformation,[],[f66])).
% 0.21/0.42 thf(f66,plain,(
% 0.21/0.42 ~! [X0 : $i > $i > $o] : (((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ X0 @ Y0) @ (mbox @ X0 @ (mbox @ X0 @ Y0)))))) = $true) => ($true = (mtransitive @ X0)))),
% 0.21/0.42 inference(fool_elimination,[],[f65])).
% 0.21/0.42 thf(f65,plain,(
% 0.21/0.42 ~! [X0 : $i > $i > $o] : ((mvalid @ (mforall_prop @ (^[X1 : $i > $o] : (mimplies @ (mbox @ X0 @ X1) @ (mbox @ X0 @ (mbox @ X0 @ X1)))))) => (mtransitive @ X0))),
% 0.21/0.42 inference(rectify,[],[f33])).
% 0.21/0.42 thf(f33,negated_conjecture,(
% 0.21/0.42 ~! [X6 : $i > $i > $o] : ((mvalid @ (mforall_prop @ (^[X11 : $i > $o] : (mimplies @ (mbox @ X6 @ X11) @ (mbox @ X6 @ (mbox @ X6 @ X11)))))) => (mtransitive @ X6))),
% 0.21/0.42 inference(negated_conjecture,[],[f32])).
% 0.21/0.42 thf(f32,conjecture,(
% 0.21/0.42 ! [X6 : $i > $i > $o] : ((mvalid @ (mforall_prop @ (^[X11 : $i > $o] : (mimplies @ (mbox @ X6 @ X11) @ (mbox @ X6 @ (mbox @ X6 @ X11)))))) => (mtransitive @ X6))),
% 0.21/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)).
% 0.21/0.42 thf(f292,plain,(
% 0.21/0.42 ~spl1_3),
% 0.21/0.42 inference(avatar_contradiction_clause,[],[f291])).
% 0.21/0.42 thf(f291,plain,(
% 0.21/0.42 $false | ~spl1_3),
% 0.21/0.42 inference(trivial_inequality_removal,[],[f286])).
% 0.21/0.42 thf(f286,plain,(
% 0.21/0.42 ($true = $false) | ~spl1_3),
% 0.21/0.42 inference(superposition,[],[f120,f266])).
% 0.21/0.42 thf(f266,plain,(
% 0.21/0.42 ((sK0 @ sK2 @ sK4) = $false) | ~spl1_3),
% 0.21/0.42 inference(trivial_inequality_removal,[],[f251])).
% 0.21/0.42 thf(f251,plain,(
% 0.21/0.42 ((sK0 @ sK2 @ sK4) = $false) | ($true = $false) | ~spl1_3),
% 0.21/0.42 inference(superposition,[],[f245,f119])).
% 0.21/0.42 thf(f119,plain,(
% 0.21/0.42 ((sK0 @ sK3 @ sK2) = $true)),
% 0.21/0.42 inference(binary_proxy_clausification,[],[f118])).
% 0.21/0.42 thf(f118,plain,(
% 0.21/0.42 (((sK0 @ sK2 @ sK4) & (sK0 @ sK3 @ sK2)) = $true)),
% 0.21/0.42 inference(binary_proxy_clausification,[],[f116])).
% 0.21/0.42 thf(f245,plain,(
% 0.21/0.42 ( ! [X0 : $i] : (((sK0 @ sK3 @ X0) = $false) | ((sK0 @ X0 @ sK4) = $false)) ) | ~spl1_3),
% 0.21/0.42 inference(avatar_component_clause,[],[f244])).
% 0.21/0.42 thf(f120,plain,(
% 0.21/0.42 ((sK0 @ sK2 @ sK4) = $true)),
% 0.21/0.42 inference(binary_proxy_clausification,[],[f118])).
% 0.21/0.42 thf(f250,plain,(
% 0.21/0.42 spl1_4 | spl1_3),
% 0.21/0.42 inference(avatar_split_clause,[],[f237,f244,f247])).
% 0.21/0.42 thf(f237,plain,(
% 0.21/0.42 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((sK0 @ X0 @ sK4) = $false) | ($true = (sK0 @ sK3 @ X1)) | ((sK0 @ sK3 @ X0) = $false) | ($false = (sK0 @ sK3 @ X2)) | ((sK0 @ X2 @ X1) = $false)) )),
% 0.21/0.42 inference(trivial_inequality_removal,[],[f228])).
% 0.21/0.42 thf(f228,plain,(
% 0.21/0.42 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($false = (sK0 @ sK3 @ X2)) | ((sK0 @ X0 @ sK4) = $false) | ($true = (sK0 @ sK3 @ X1)) | ((sK0 @ sK3 @ X0) = $false) | ((sK0 @ X2 @ X1) = $false) | ($true = $false)) )),
% 0.21/0.42 inference(superposition,[],[f117,f175])).
% 0.21/0.42 thf(f175,plain,(
% 0.21/0.42 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (($true = (sK0 @ X0 @ X2)) | ((sK0 @ X1 @ X2) = $false) | ((sK0 @ X0 @ X4) = $true) | ((sK0 @ X3 @ X4) = $false) | ((sK0 @ X0 @ X1) = $false) | ((sK0 @ X0 @ X3) = $false)) )),
% 0.21/0.42 inference(trivial_inequality_removal,[],[f170])).
% 0.21/0.42 thf(f170,plain,(
% 0.21/0.42 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (((sK0 @ X0 @ X3) = $false) | ($true = (sK0 @ X0 @ X2)) | ((sK0 @ X0 @ X4) = $true) | ((sK0 @ X0 @ X1) = $false) | ((sK0 @ X3 @ X4) = $false) | ($true = $false) | ((sK0 @ X1 @ X2) = $false)) )),
% 0.21/0.42 inference(superposition,[],[f139,f146])).
% 0.21/0.42 thf(f146,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((sK0 @ X1 @ (sK5 @ X1 @ X2)) = $true) | ((sK0 @ X3 @ X4) = $false) | ($true = (X2 @ X4)) | ((sK0 @ X1 @ X3) = $false)) )),
% 0.21/0.42 inference(not_proxy_clausification,[],[f145])).
% 0.21/0.42 thf(f145,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((sK0 @ X1 @ (sK5 @ X1 @ X2)) = $true) | ((sK0 @ X1 @ X3) = $false) | ((~ (sK0 @ X3 @ X4)) = $true) | ($true = (X2 @ X4))) )),
% 0.21/0.42 inference(binary_proxy_clausification,[],[f144])).
% 0.21/0.42 thf(f144,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((sK0 @ X1 @ (sK5 @ X1 @ X2)) = $true) | ((sK0 @ X1 @ X3) = $false) | (((X2 @ X4) | (~ (sK0 @ X3 @ X4))) = $true)) )),
% 0.21/0.42 inference(beta_eta_normalization,[],[f143])).
% 0.21/0.42 thf(f143,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((sK0 @ X1 @ (sK5 @ X1 @ X2)) = $true) | (((^[Y0 : $i]: ((X2 @ Y0) | (~ (sK0 @ X3 @ Y0)))) @ X4) = $true) | ((sK0 @ X1 @ X3) = $false)) )),
% 0.21/0.42 inference(pi_clausification,[],[f142])).
% 0.21/0.42 thf(f142,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((X2 @ Y0) | (~ (sK0 @ X3 @ Y0)))))) | ((sK0 @ X1 @ (sK5 @ X1 @ X2)) = $true) | ((sK0 @ X1 @ X3) = $false)) )),
% 0.21/0.42 inference(not_proxy_clausification,[],[f141])).
% 0.21/0.42 thf(f141,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : (((sK0 @ X1 @ (sK5 @ X1 @ X2)) = $true) | ((~ (sK0 @ X1 @ X3)) = $true) | ($true = (!! @ $i @ (^[Y0 : $i]: ((X2 @ Y0) | (~ (sK0 @ X3 @ Y0))))))) )),
% 0.21/0.42 inference(not_proxy_clausification,[],[f140])).
% 0.21/0.42 thf(f140,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : (((~ (sK0 @ X1 @ (sK5 @ X1 @ X2))) = $false) | ((~ (sK0 @ X1 @ X3)) = $true) | ($true = (!! @ $i @ (^[Y0 : $i]: ((X2 @ Y0) | (~ (sK0 @ X3 @ Y0))))))) )),
% 0.21/0.42 inference(binary_proxy_clausification,[],[f132])).
% 0.21/0.42 thf(f132,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : ((((!! @ $i @ (^[Y0 : $i]: ((X2 @ Y0) | (~ (sK0 @ X3 @ Y0))))) | (~ (sK0 @ X1 @ X3))) = $true) | ((~ (sK0 @ X1 @ (sK5 @ X1 @ X2))) = $false)) )),
% 0.21/0.42 inference(binary_proxy_clausification,[],[f131])).
% 0.21/0.42 thf(f131,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : (($false = ((X2 @ (sK5 @ X1 @ X2)) | (~ (sK0 @ X1 @ (sK5 @ X1 @ X2))))) | (((!! @ $i @ (^[Y0 : $i]: ((X2 @ Y0) | (~ (sK0 @ X3 @ Y0))))) | (~ (sK0 @ X1 @ X3))) = $true)) )),
% 0.21/0.42 inference(beta_eta_normalization,[],[f130])).
% 0.21/0.42 thf(f130,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : (($false = ((X2 @ (sK5 @ X1 @ X2)) | (~ (sK0 @ X1 @ (sK5 @ X1 @ X2))))) | ($true = ((^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((X2 @ Y1) | (~ (sK0 @ Y0 @ Y1))))) | (~ (sK0 @ X1 @ Y0)))) @ X3))) )),
% 0.21/0.42 inference(pi_clausification,[],[f129])).
% 0.21/0.42 thf(f129,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((X2 @ Y1) | (~ (sK0 @ Y0 @ Y1))))) | (~ (sK0 @ X1 @ Y0))))) = $true) | ($false = ((X2 @ (sK5 @ X1 @ X2)) | (~ (sK0 @ X1 @ (sK5 @ X1 @ X2)))))) )),
% 0.21/0.42 inference(beta_eta_normalization,[],[f128])).
% 0.21/0.42 thf(f128,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((X2 @ Y1) | (~ (sK0 @ Y0 @ Y1))))) | (~ (sK0 @ X1 @ Y0))))) = $true) | (((^[Y0 : $i]: ((X2 @ Y0) | (~ (sK0 @ X1 @ Y0)))) @ (sK5 @ X1 @ X2)) = $false)) )),
% 0.21/0.42 inference(sigma_clausification,[],[f127])).
% 0.21/0.42 thf(f127,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X1 : $i] : (($false = (!! @ $i @ (^[Y0 : $i]: ((X2 @ Y0) | (~ (sK0 @ X1 @ Y0)))))) | ((!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((X2 @ Y1) | (~ (sK0 @ Y0 @ Y1))))) | (~ (sK0 @ X1 @ Y0))))) = $true)) )),
% 0.21/0.42 inference(not_proxy_clausification,[],[f126])).
% 0.21/0.42 thf(f126,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X1 : $i] : (($true = (~ (!! @ $i @ (^[Y0 : $i]: ((X2 @ Y0) | (~ (sK0 @ X1 @ Y0))))))) | ((!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((X2 @ Y1) | (~ (sK0 @ Y0 @ Y1))))) | (~ (sK0 @ X1 @ Y0))))) = $true)) )),
% 0.21/0.42 inference(binary_proxy_clausification,[],[f125])).
% 0.21/0.42 thf(f125,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X1 : $i] : ((((~ (!! @ $i @ (^[Y0 : $i]: ((X2 @ Y0) | (~ (sK0 @ X1 @ Y0)))))) | (!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((X2 @ Y1) | (~ (sK0 @ Y0 @ Y1))))) | (~ (sK0 @ X1 @ Y0)))))) = $true)) )),
% 0.21/0.42 inference(beta_eta_normalization,[],[f124])).
% 0.21/0.42 thf(f124,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X1 : $i] : ((((^[Y0 : $i > $o]: ((~ (!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) | (~ (sK0 @ X1 @ Y1)))))) | (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (sK0 @ Y1 @ Y2))))) | (~ (sK0 @ X1 @ Y1))))))) @ X2) = $true)) )),
% 0.21/0.42 inference(pi_clausification,[],[f123])).
% 0.21/0.42 thf(f123,plain,(
% 0.21/0.42 ( ! [X1 : $i] : (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((~ (!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) | (~ (sK0 @ X1 @ Y1)))))) | (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (sK0 @ Y1 @ Y2))))) | (~ (sK0 @ X1 @ Y1)))))))) = $true)) )),
% 0.21/0.42 inference(beta_eta_normalization,[],[f122])).
% 0.21/0.42 thf(f122,plain,(
% 0.21/0.42 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((~ (!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) | (~ (sK0 @ Y0 @ Y2)))))) | (!! @ $i @ (^[Y2 : $i]: ((!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (sK0 @ Y2 @ Y3))))) | (~ (sK0 @ Y0 @ Y2))))))))) @ X1))) )),
% 0.21/0.42 inference(pi_clausification,[],[f121])).
% 0.21/0.42 thf(f121,plain,(
% 0.21/0.42 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((~ (!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) | (~ (sK0 @ Y0 @ Y2)))))) | (!! @ $i @ (^[Y2 : $i]: ((!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (sK0 @ Y2 @ Y3))))) | (~ (sK0 @ Y0 @ Y2)))))))))))),
% 0.21/0.42 inference(beta_eta_normalization,[],[f109])).
% 0.21/0.42 thf(f109,plain,(
% 0.21/0.42 (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))) @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i]: ((Y3 @ Y5) | (Y4 @ Y5))))))) @ ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (~ (Y3 @ Y4))))) @ Y1) @ Y2)))) @ ((^[Y1 : $i > $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y2 @ Y4) | (~ (Y1 @ Y3 @ Y4)))))))))) @ sK0 @ Y0) @ ((^[Y1 : $i > $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y2 @ Y4) | (~ (Y1 @ Y3 @ Y4)))))))))) @ sK0 @ ((^[Y1 : $i > $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y2 @ Y4) | (~ (Y1 @ Y3 @ Y4)))))))))) @ sK0 @ Y0)))))) = $true)),
% 0.21/0.42 inference(definition_unfolding,[],[f105,f100,f104,f107,f99,f99,f99])).
% 0.21/0.42 thf(f99,plain,(
% 0.21/0.42 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (Y0 @ Y2 @ Y3)))))))))))),
% 0.21/0.42 inference(cnf_transformation,[],[f48])).
% 0.21/0.42 thf(f48,plain,(
% 0.21/0.42 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (Y0 @ Y2 @ Y3)))))))))))),
% 0.21/0.42 inference(fool_elimination,[],[f47])).
% 0.21/0.42 thf(f47,plain,(
% 0.21/0.42 (mbox = (^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i] : (! [X3] : (~(X0 @ X2 @ X3) | (X1 @ X3)))))),
% 0.21/0.42 inference(rectify,[],[f16])).
% 0.21/0.42 thf(f16,axiom,(
% 0.21/0.42 (mbox = (^[X6 : $i > $i > $o, X3 : $i > $o, X2 : $i] : (! [X7] : (~(X6 @ X2 @ X7) | (X3 @ X7)))))),
% 0.21/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox)).
% 0.21/0.42 thf(f107,plain,(
% 0.21/0.42 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y2 @ Y4) | (Y3 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))))),
% 0.21/0.42 inference(definition_unfolding,[],[f101,f102,f103])).
% 0.21/0.42 thf(f103,plain,(
% 0.21/0.42 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.21/0.42 inference(cnf_transformation,[],[f64])).
% 0.21/0.42 thf(f64,plain,(
% 0.21/0.42 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.21/0.42 inference(fool_elimination,[],[f63])).
% 0.21/0.42 thf(f63,plain,(
% 0.21/0.42 ((^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))) = mnot)),
% 0.21/0.42 inference(rectify,[],[f3])).
% 0.21/0.42 thf(f3,axiom,(
% 0.21/0.42 ((^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))) = mnot)),
% 0.21/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot)).
% 0.21/0.42 thf(f102,plain,(
% 0.21/0.42 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.21/0.42 inference(cnf_transformation,[],[f76])).
% 0.21/0.42 thf(f76,plain,(
% 0.21/0.42 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.21/0.42 inference(fool_elimination,[],[f75])).
% 0.21/0.42 thf(f75,plain,(
% 0.21/0.42 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X1 @ X2) | (X0 @ X2))) = mor)),
% 0.21/0.42 inference(rectify,[],[f4])).
% 0.21/0.42 thf(f4,axiom,(
% 0.21/0.42 ((^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X4 @ X2) | (X3 @ X2))) = mor)),
% 0.21/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor)).
% 0.21/0.42 thf(f101,plain,(
% 0.21/0.42 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.21/0.42 inference(cnf_transformation,[],[f40])).
% 0.21/0.42 thf(f40,plain,(
% 0.21/0.42 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.21/0.42 inference(fool_elimination,[],[f39])).
% 0.21/0.42 thf(f39,plain,(
% 0.21/0.42 (mimplies = (^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)))),
% 0.21/0.42 inference(rectify,[],[f6])).
% 0.21/0.42 thf(f6,axiom,(
% 0.21/0.42 (mimplies = (^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)))),
% 0.21/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimplies)).
% 0.21/0.42 thf(f104,plain,(
% 0.21/0.42 (mforall_prop = (^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))))),
% 0.21/0.42 inference(cnf_transformation,[],[f84])).
% 0.21/0.42 thf(f84,plain,(
% 0.21/0.42 (mforall_prop = (^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))))),
% 0.21/0.42 inference(fool_elimination,[],[f83])).
% 0.21/0.42 thf(f83,plain,(
% 0.21/0.42 (mforall_prop = (^[X0 : ($i > $o) > $i > $o, X1 : $i] : (! [X2 : $i > $o] : (X0 @ X2 @ X1))))),
% 0.21/0.42 inference(rectify,[],[f11])).
% 0.21/0.42 thf(f11,axiom,(
% 0.21/0.42 (mforall_prop = (^[X3 : ($i > $o) > $i > $o, X2 : $i] : (! [X5 : $i > $o] : (X3 @ X5 @ X2))))),
% 0.21/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mforall_prop)).
% 0.21/0.42 thf(f100,plain,(
% 0.21/0.42 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.21/0.42 inference(cnf_transformation,[],[f86])).
% 0.21/0.42 thf(f86,plain,(
% 0.21/0.42 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.21/0.42 inference(fool_elimination,[],[f85])).
% 0.21/0.42 thf(f85,plain,(
% 0.21/0.42 ((^[X0 : $i > $o] : (! [X1] : (X0 @ X1))) = mvalid)),
% 0.21/0.42 inference(rectify,[],[f28])).
% 0.21/0.42 thf(f28,axiom,(
% 0.21/0.42 ((^[X3 : $i > $o] : (! [X2] : (X3 @ X2))) = mvalid)),
% 0.21/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.21/0.42 thf(f105,plain,(
% 0.21/0.42 ((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ sK0 @ Y0) @ (mbox @ sK0 @ (mbox @ sK0 @ Y0)))))) = $true)),
% 0.21/0.42 inference(cnf_transformation,[],[f97])).
% 0.21/0.42 thf(f139,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((X2 @ (sK5 @ X1 @ X2)) = $false) | ((sK0 @ X1 @ X3) = $false) | ((sK0 @ X3 @ X4) = $false) | ($true = (X2 @ X4))) )),
% 0.21/0.42 inference(not_proxy_clausification,[],[f138])).
% 0.21/0.42 thf(f138,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((X2 @ (sK5 @ X1 @ X2)) = $false) | ((~ (sK0 @ X3 @ X4)) = $true) | ((sK0 @ X1 @ X3) = $false) | ($true = (X2 @ X4))) )),
% 0.21/0.42 inference(not_proxy_clausification,[],[f137])).
% 0.21/0.42 thf(f137,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (($true = (X2 @ X4)) | ((~ (sK0 @ X1 @ X3)) = $true) | ((X2 @ (sK5 @ X1 @ X2)) = $false) | ((~ (sK0 @ X3 @ X4)) = $true)) )),
% 0.21/0.42 inference(binary_proxy_clausification,[],[f136])).
% 0.21/0.42 thf(f136,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : ((((X2 @ X4) | (~ (sK0 @ X3 @ X4))) = $true) | ((X2 @ (sK5 @ X1 @ X2)) = $false) | ((~ (sK0 @ X1 @ X3)) = $true)) )),
% 0.21/0.42 inference(beta_eta_normalization,[],[f135])).
% 0.21/0.42 thf(f135,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((X2 @ (sK5 @ X1 @ X2)) = $false) | ((~ (sK0 @ X1 @ X3)) = $true) | (((^[Y0 : $i]: ((X2 @ Y0) | (~ (sK0 @ X3 @ Y0)))) @ X4) = $true)) )),
% 0.21/0.42 inference(pi_clausification,[],[f134])).
% 0.21/0.42 thf(f134,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((X2 @ Y0) | (~ (sK0 @ X3 @ Y0)))))) | ((X2 @ (sK5 @ X1 @ X2)) = $false) | ((~ (sK0 @ X1 @ X3)) = $true)) )),
% 0.21/0.42 inference(binary_proxy_clausification,[],[f133])).
% 0.21/0.42 thf(f133,plain,(
% 0.21/0.42 ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : (((X2 @ (sK5 @ X1 @ X2)) = $false) | (((!! @ $i @ (^[Y0 : $i]: ((X2 @ Y0) | (~ (sK0 @ X3 @ Y0))))) | (~ (sK0 @ X1 @ X3))) = $true)) )),
% 0.21/0.42 inference(binary_proxy_clausification,[],[f131])).
% 0.21/0.42 % SZS output end Proof for theBenchmark
% 0.21/0.42 % (23870)------------------------------
% 0.21/0.42 % (23870)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (23870)Termination reason: Refutation
% 0.21/0.42
% 0.21/0.42 % (23870)Memory used [KB]: 5756
% 0.21/0.42 % (23870)Time elapsed: 0.036 s
% 0.21/0.42 % (23870)Instructions burned: 49 (million)
% 0.21/0.42 % (23870)------------------------------
% 0.21/0.42 % (23870)------------------------------
% 0.21/0.42 % (23864)Success in time 0.051 s
% 0.21/0.42 % Vampire---4.8 exiting
%------------------------------------------------------------------------------