TSTP Solution File: SYO428^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO428^1 : TPTP v8.2.0. Released v4.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 : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 09:04:24 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SYO428^1 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 08:30:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/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.14/0.38 % (17842)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.38 % (17843)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.14/0.38 % (17840)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.14/0.38 % (17844)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.14/0.38 % (17839)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.14/0.38 % (17841)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.14/0.38 % (17846)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.14/0.38 % (17845)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.38 % (17842)Instruction limit reached!
% 0.14/0.38 % (17842)------------------------------
% 0.14/0.38 % (17842)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (17842)Termination reason: Unknown
% 0.14/0.38 % (17842)Termination phase: shuffling
% 0.14/0.38
% 0.14/0.38 % (17843)Instruction limit reached!
% 0.14/0.38 % (17843)------------------------------
% 0.14/0.38 % (17843)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (17843)Termination reason: Unknown
% 0.14/0.38 % (17843)Termination phase: shuffling
% 0.14/0.38
% 0.14/0.38 % (17843)Memory used [KB]: 1023
% 0.14/0.38 % (17843)Time elapsed: 0.003 s
% 0.14/0.38 % (17843)Instructions burned: 2 (million)
% 0.14/0.38 % (17843)------------------------------
% 0.14/0.38 % (17843)------------------------------
% 0.14/0.38 % (17842)Memory used [KB]: 1023
% 0.14/0.38 % (17842)Time elapsed: 0.003 s
% 0.14/0.38 % (17842)Instructions burned: 2 (million)
% 0.14/0.38 % (17842)------------------------------
% 0.14/0.38 % (17842)------------------------------
% 0.14/0.38 % (17840)Instruction limit reached!
% 0.14/0.38 % (17840)------------------------------
% 0.14/0.38 % (17840)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (17840)Termination reason: Unknown
% 0.14/0.38 % (17840)Termination phase: shuffling
% 0.14/0.38
% 0.14/0.38 % (17840)Memory used [KB]: 1023
% 0.14/0.38 % (17840)Time elapsed: 0.004 s
% 0.14/0.38 % (17840)Instructions burned: 4 (million)
% 0.14/0.38 % (17840)------------------------------
% 0.14/0.38 % (17840)------------------------------
% 0.14/0.38 % (17846)Instruction limit reached!
% 0.14/0.38 % (17846)------------------------------
% 0.14/0.38 % (17846)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (17846)Termination reason: Unknown
% 0.14/0.38 % (17846)Termination phase: shuffling
% 0.14/0.38
% 0.14/0.38 % (17846)Memory used [KB]: 1023
% 0.14/0.38 % (17846)Time elapsed: 0.003 s
% 0.14/0.38 % (17846)Instructions burned: 4 (million)
% 0.14/0.38 % (17846)------------------------------
% 0.14/0.38 % (17846)------------------------------
% 0.14/0.38 % (17844)Refutation not found, incomplete strategy
% 0.14/0.38 % (17844)------------------------------
% 0.14/0.38 % (17844)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (17844)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (17844)Memory used [KB]: 5628
% 0.14/0.38 % (17844)Time elapsed: 0.007 s
% 0.14/0.38 % (17844)Instructions burned: 8 (million)
% 0.14/0.38 % (17844)------------------------------
% 0.14/0.38 % (17844)------------------------------
% 0.14/0.38 % (17839)First to succeed.
% 0.14/0.39 % (17841)Also succeeded, but the first one will report.
% 0.14/0.39 % (17845)Also succeeded, but the first one will report.
% 0.14/0.39 % (17839)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% 0.14/0.39 thf(type_def_5, type, mu: $tType).
% 0.14/0.39 thf(func_def_0, type, mu: $tType).
% 0.14/0.39 thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.14/0.39 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.39 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.14/0.39 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.39 thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.39 thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.39 thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.39 thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.39 thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.39 thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.14/0.39 thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.14/0.39 thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.14/0.39 thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.14/0.39 thf(func_def_15, type, mtrue: $i > $o).
% 0.14/0.39 thf(func_def_16, type, mfalse: $i > $o).
% 0.14/0.39 thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.14/0.39 thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.14/0.39 thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.14/0.39 thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.14/0.39 thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.14/0.39 thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.14/0.39 thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.14/0.39 thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.14/0.39 thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.14/0.39 thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.14/0.39 thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.14/0.39 thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.14/0.39 thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.14/0.39 thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.14/0.39 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.14/0.39 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.14/0.39 thf(func_def_33, type, rel_m: $i > $i > $o).
% 0.14/0.39 thf(func_def_34, type, mbox_m: ($i > $o) > $i > $o).
% 0.14/0.39 thf(func_def_35, type, mdia_m: ($i > $o) > $i > $o).
% 0.14/0.39 thf(func_def_36, type, p: $i > $o).
% 0.14/0.39 thf(func_def_37, type, q: $i > $o).
% 0.14/0.39 thf(f227,plain,(
% 0.14/0.39 $false),
% 0.14/0.39 inference(avatar_sat_refutation,[],[f193,f207,f226])).
% 0.14/0.39 thf(f226,plain,(
% 0.14/0.39 ~spl0_1),
% 0.14/0.39 inference(avatar_contradiction_clause,[],[f225])).
% 0.14/0.39 thf(f225,plain,(
% 0.14/0.39 $false | ~spl0_1),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f222])).
% 0.14/0.39 thf(f222,plain,(
% 0.14/0.39 ($true = $false) | ~spl0_1),
% 0.14/0.39 inference(superposition,[],[f215,f220])).
% 0.14/0.39 thf(f220,plain,(
% 0.14/0.39 ((q @ sK2) = $true) | ~spl0_1),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f217])).
% 0.14/0.39 thf(f217,plain,(
% 0.14/0.39 ((q @ sK2) = $true) | ($true = $false) | ~spl0_1),
% 0.14/0.39 inference(superposition,[],[f188,f185])).
% 0.14/0.39 thf(f185,plain,(
% 0.14/0.39 ( ! [X1 : $i] : (((rel_m @ X1 @ X1) = $true)) )),
% 0.14/0.39 inference(beta_eta_normalization,[],[f184])).
% 0.14/0.39 thf(f184,plain,(
% 0.14/0.39 ( ! [X1 : $i] : ((((^[Y0 : $i]: (rel_m @ Y0 @ Y0)) @ X1) = $true)) )),
% 0.14/0.39 inference(pi_clausification,[],[f183])).
% 0.14/0.39 thf(f183,plain,(
% 0.14/0.39 ($true = (!! @ $i @ (^[Y0 : $i]: (rel_m @ Y0 @ Y0))))),
% 0.14/0.39 inference(beta_eta_normalization,[],[f150])).
% 0.14/0.39 thf(f150,plain,(
% 0.14/0.39 (((^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))) @ rel_m) = $true)),
% 0.14/0.39 inference(definition_unfolding,[],[f119,f115])).
% 0.14/0.39 thf(f115,plain,(
% 0.14/0.39 (mreflexive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))),
% 0.14/0.39 inference(cnf_transformation,[],[f58])).
% 0.14/0.39 thf(f58,plain,(
% 0.14/0.39 (mreflexive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))),
% 0.14/0.39 inference(fool_elimination,[],[f57])).
% 0.14/0.39 thf(f57,plain,(
% 0.14/0.39 (mreflexive = (^[X0 : $i > $i > $o] : (! [X1] : (X0 @ X1 @ X1))))),
% 0.14/0.39 inference(rectify,[],[f18])).
% 0.14/0.39 thf(f18,axiom,(
% 0.14/0.39 (mreflexive = (^[X6 : $i > $i > $o] : (! [X8] : (X6 @ X8 @ X8))))),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mreflexive)).
% 0.14/0.39 thf(f119,plain,(
% 0.14/0.39 ((mreflexive @ rel_m) = $true)),
% 0.14/0.39 inference(cnf_transformation,[],[f99])).
% 0.14/0.39 thf(f99,plain,(
% 0.14/0.39 ((mreflexive @ rel_m) = $true)),
% 0.14/0.39 inference(fool_elimination,[],[f98])).
% 0.14/0.39 thf(f98,plain,(
% 0.14/0.39 (mreflexive @ rel_m)),
% 0.14/0.39 inference(rectify,[],[f34])).
% 0.14/0.39 thf(f34,axiom,(
% 0.14/0.39 (mreflexive @ rel_m)),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1)).
% 0.14/0.39 thf(f188,plain,(
% 0.14/0.39 ( ! [X1 : $i] : (((rel_m @ sK2 @ X1) = $false) | ((q @ X1) = $true)) ) | ~spl0_1),
% 0.14/0.39 inference(avatar_component_clause,[],[f187])).
% 0.14/0.39 thf(f187,plain,(
% 0.14/0.39 spl0_1 <=> ! [X1] : (((rel_m @ sK2 @ X1) = $false) | ((q @ X1) = $true))),
% 0.14/0.39 introduced(avatar_definition,[new_symbols(naming,[spl0_1])])).
% 0.14/0.39 thf(f215,plain,(
% 0.14/0.39 ((q @ sK2) = $false)),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f210])).
% 0.14/0.39 thf(f210,plain,(
% 0.14/0.39 ($true = $false) | ((q @ sK2) = $false)),
% 0.14/0.39 inference(superposition,[],[f182,f169])).
% 0.14/0.39 thf(f169,plain,(
% 0.14/0.39 ((rel_m @ sK1 @ sK2) = $true)),
% 0.14/0.39 inference(not_proxy_clausification,[],[f160])).
% 0.14/0.39 thf(f160,plain,(
% 0.14/0.39 ((~ (rel_m @ sK1 @ sK2)) = $false)),
% 0.14/0.39 inference(binary_proxy_clausification,[],[f159])).
% 0.14/0.39 thf(f159,plain,(
% 0.14/0.39 (((~ ((~ (p @ sK2)) | (!! @ $i @ (^[Y0 : $i]: ((q @ Y0) | (~ (rel_m @ sK2 @ Y0))))))) | (~ (rel_m @ sK1 @ sK2))) = $false)),
% 0.14/0.39 inference(beta_eta_normalization,[],[f158])).
% 0.14/0.39 thf(f158,plain,(
% 0.14/0.39 (((^[Y0 : $i]: ((~ ((~ (p @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((q @ Y1) | (~ (rel_m @ Y0 @ Y1))))))) | (~ (rel_m @ sK1 @ Y0)))) @ sK2) = $false)),
% 0.14/0.39 inference(sigma_clausification,[],[f157])).
% 0.14/0.39 thf(f157,plain,(
% 0.14/0.39 ((!! @ $i @ (^[Y0 : $i]: ((~ ((~ (p @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((q @ Y1) | (~ (rel_m @ Y0 @ Y1))))))) | (~ (rel_m @ sK1 @ Y0))))) = $false)),
% 0.14/0.39 inference(binary_proxy_clausification,[],[f155])).
% 0.14/0.39 thf(f155,plain,(
% 0.14/0.39 (((!! @ $i @ (^[Y0 : $i]: ((~ ((~ (p @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((q @ Y1) | (~ (rel_m @ Y0 @ Y1))))))) | (~ (rel_m @ sK1 @ Y0))))) | ((~ (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_m @ sK1 @ Y0)))))) | (~ (!! @ $i @ (^[Y0 : $i]: ((~ (q @ Y0)) | (~ (rel_m @ sK1 @ Y0)))))))) = $false)),
% 0.14/0.39 inference(beta_eta_normalization,[],[f154])).
% 0.14/0.39 thf(f154,plain,(
% 0.14/0.39 ($false = ((^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((~ ((~ (p @ Y1)) | (!! @ $i @ (^[Y2 : $i]: ((q @ Y2) | (~ (rel_m @ Y1 @ Y2))))))) | (~ (rel_m @ Y0 @ Y1))))) | ((~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_m @ Y0 @ Y1)))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ (q @ Y1)) | (~ (rel_m @ Y0 @ Y1))))))))) @ sK1))),
% 0.14/0.39 inference(sigma_clausification,[],[f153])).
% 0.14/0.39 thf(f153,plain,(
% 0.14/0.39 ($true != (!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((~ ((~ (p @ Y1)) | (!! @ $i @ (^[Y2 : $i]: ((q @ Y2) | (~ (rel_m @ Y1 @ Y2))))))) | (~ (rel_m @ Y0 @ Y1))))) | ((~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_m @ Y0 @ Y1)))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ (q @ Y1)) | (~ (rel_m @ Y0 @ Y1)))))))))))),
% 0.14/0.39 inference(boolean_simplification,[],[f152])).
% 0.14/0.39 thf(f152,plain,(
% 0.14/0.39 ((!! @ $i @ (^[Y0 : $i]: ((~ (~ (!! @ $i @ (^[Y1 : $i]: ((~ ((~ (p @ Y1)) | (!! @ $i @ (^[Y2 : $i]: ((q @ Y2) | (~ (rel_m @ Y1 @ Y2))))))) | (~ (rel_m @ Y0 @ Y1))))))) | ((~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_m @ Y0 @ Y1)))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ (q @ Y1)) | (~ (rel_m @ Y0 @ Y1)))))))))) != $true)),
% 0.14/0.39 inference(beta_eta_normalization,[],[f151])).
% 0.14/0.39 thf(f151,plain,(
% 0.14/0.39 ($true != ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[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)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (rel_m @ Y2 @ Y3)))))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ Y0)))) @ ((^[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)))) @ p @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_m @ Y1 @ Y2)))))))) @ q))) @ ((^[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)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_m @ Y1 @ Y2)))))))) @ p) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (rel_m @ Y2 @ Y3)))))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ Y0)))) @ q)))))),
% 0.14/0.39 inference(definition_unfolding,[],[f139,f129,f141,f149,f141,f114,f141,f114,f149])).
% 0.14/0.39 thf(f114,plain,(
% 0.14/0.39 (mbox_m = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_m @ Y1 @ Y2)))))))))),
% 0.14/0.39 inference(cnf_transformation,[],[f48])).
% 0.14/0.39 thf(f48,plain,(
% 0.14/0.39 (mbox_m = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_m @ Y1 @ Y2)))))))))),
% 0.14/0.39 inference(fool_elimination,[],[f47])).
% 0.14/0.39 thf(f47,plain,(
% 0.14/0.39 ((^[X0 : $i > $o, X1 : $i] : (! [X2] : (~(rel_m @ X1 @ X2) | (X0 @ X2)))) = mbox_m)),
% 0.14/0.39 inference(rectify,[],[f32])).
% 0.14/0.39 thf(f32,axiom,(
% 0.14/0.39 ((^[X3 : $i > $o, X2 : $i] : (! [X7] : (~(rel_m @ X2 @ X7) | (X3 @ X7)))) = mbox_m)),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox_m)).
% 0.14/0.39 thf(f149,plain,(
% 0.14/0.39 (mdia_m = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (rel_m @ Y2 @ Y3)))))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ Y0)))))),
% 0.14/0.39 inference(definition_unfolding,[],[f118,f116,f114,f116])).
% 0.14/0.39 thf(f116,plain,(
% 0.14/0.39 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.14/0.39 inference(cnf_transformation,[],[f82])).
% 0.14/0.39 thf(f82,plain,(
% 0.14/0.39 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.14/0.39 inference(fool_elimination,[],[f81])).
% 0.14/0.39 thf(f81,plain,(
% 0.14/0.39 ((^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))) = mnot)),
% 0.14/0.39 inference(rectify,[],[f3])).
% 0.14/0.39 thf(f3,axiom,(
% 0.14/0.39 ((^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))) = mnot)),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot)).
% 0.14/0.39 thf(f118,plain,(
% 0.14/0.39 (mdia_m = (^[Y0 : $i > $o]: (mnot @ (mbox_m @ (mnot @ Y0)))))),
% 0.14/0.39 inference(cnf_transformation,[],[f43])).
% 0.14/0.39 thf(f43,plain,(
% 0.14/0.39 (mdia_m = (^[Y0 : $i > $o]: (mnot @ (mbox_m @ (mnot @ Y0)))))),
% 0.14/0.39 inference(fool_elimination,[],[f42])).
% 0.14/0.39 thf(f42,plain,(
% 0.14/0.39 ((^[X0 : $i > $o] : (mnot @ (mbox_m @ (mnot @ X0)))) = mdia_m)),
% 0.14/0.39 inference(rectify,[],[f33])).
% 0.14/0.39 thf(f33,axiom,(
% 0.14/0.39 ((^[X3 : $i > $o] : (mnot @ (mbox_m @ (mnot @ X3)))) = mdia_m)),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mdia_m)).
% 0.14/0.39 thf(f141,plain,(
% 0.14/0.39 (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.14/0.39 inference(definition_unfolding,[],[f126,f135,f116])).
% 0.14/0.39 thf(f135,plain,(
% 0.14/0.39 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.14/0.39 inference(cnf_transformation,[],[f92])).
% 0.14/0.39 thf(f92,plain,(
% 0.14/0.39 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.14/0.39 inference(fool_elimination,[],[f91])).
% 0.14/0.39 thf(f91,plain,(
% 0.14/0.39 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X1 @ X2) | (X0 @ X2))) = mor)),
% 0.14/0.39 inference(rectify,[],[f4])).
% 0.14/0.39 thf(f4,axiom,(
% 0.14/0.39 ((^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X4 @ X2) | (X3 @ X2))) = mor)),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor)).
% 0.14/0.39 thf(f126,plain,(
% 0.14/0.39 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.14/0.39 inference(cnf_transformation,[],[f41])).
% 0.14/0.39 thf(f41,plain,(
% 0.14/0.39 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.14/0.39 inference(fool_elimination,[],[f40])).
% 0.14/0.39 thf(f40,plain,(
% 0.14/0.39 (mimplies = (^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)))),
% 0.14/0.39 inference(rectify,[],[f6])).
% 0.14/0.39 thf(f6,axiom,(
% 0.14/0.39 (mimplies = (^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)))),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimplies)).
% 0.14/0.39 thf(f129,plain,(
% 0.14/0.39 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.14/0.39 inference(cnf_transformation,[],[f88])).
% 0.14/0.39 thf(f88,plain,(
% 0.14/0.39 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.14/0.39 inference(fool_elimination,[],[f87])).
% 0.14/0.39 thf(f87,plain,(
% 0.14/0.39 ((^[X0 : $i > $o] : (! [X1] : (X0 @ X1))) = mvalid)),
% 0.14/0.39 inference(rectify,[],[f28])).
% 0.14/0.39 thf(f28,axiom,(
% 0.14/0.39 ((^[X3 : $i > $o] : (! [X2] : (X3 @ X2))) = mvalid)),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.14/0.39 thf(f139,plain,(
% 0.14/0.39 ((mvalid @ (mimplies @ (mdia_m @ (mimplies @ p @ (mbox_m @ q))) @ (mimplies @ (mbox_m @ p) @ (mdia_m @ q)))) != $true)),
% 0.14/0.39 inference(cnf_transformation,[],[f104])).
% 0.14/0.39 thf(f104,plain,(
% 0.14/0.39 ((mvalid @ (mimplies @ (mdia_m @ (mimplies @ p @ (mbox_m @ q))) @ (mimplies @ (mbox_m @ p) @ (mdia_m @ q)))) != $true)),
% 0.14/0.39 inference(flattening,[],[f97])).
% 0.14/0.39 thf(f97,plain,(
% 0.14/0.39 ~((mvalid @ (mimplies @ (mdia_m @ (mimplies @ p @ (mbox_m @ q))) @ (mimplies @ (mbox_m @ p) @ (mdia_m @ q)))) = $true)),
% 0.14/0.39 inference(fool_elimination,[],[f96])).
% 0.14/0.39 thf(f96,plain,(
% 0.14/0.39 ~(mvalid @ (mimplies @ (mdia_m @ (mimplies @ p @ (mbox_m @ q))) @ (mimplies @ (mbox_m @ p) @ (mdia_m @ q))))),
% 0.14/0.39 inference(rectify,[],[f36])).
% 0.14/0.39 thf(f36,negated_conjecture,(
% 0.14/0.39 ~(mvalid @ (mimplies @ (mdia_m @ (mimplies @ p @ (mbox_m @ q))) @ (mimplies @ (mbox_m @ p) @ (mdia_m @ q))))),
% 0.14/0.39 inference(negated_conjecture,[],[f35])).
% 0.14/0.39 thf(f35,conjecture,(
% 0.14/0.39 (mvalid @ (mimplies @ (mdia_m @ (mimplies @ p @ (mbox_m @ q))) @ (mimplies @ (mbox_m @ p) @ (mdia_m @ q))))),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)).
% 0.14/0.39 thf(f182,plain,(
% 0.14/0.39 ( ! [X1 : $i] : (((rel_m @ sK1 @ X1) = $false) | ((q @ X1) = $false)) )),
% 0.14/0.39 inference(not_proxy_clausification,[],[f181])).
% 0.14/0.39 thf(f181,plain,(
% 0.14/0.39 ( ! [X1 : $i] : (((~ (rel_m @ sK1 @ X1)) = $true) | ((q @ X1) = $false)) )),
% 0.14/0.39 inference(not_proxy_clausification,[],[f180])).
% 0.14/0.39 thf(f180,plain,(
% 0.14/0.39 ( ! [X1 : $i] : (((~ (q @ X1)) = $true) | ((~ (rel_m @ sK1 @ X1)) = $true)) )),
% 0.14/0.39 inference(binary_proxy_clausification,[],[f179])).
% 0.14/0.39 thf(f179,plain,(
% 0.14/0.39 ( ! [X1 : $i] : ((((~ (q @ X1)) | (~ (rel_m @ sK1 @ X1))) = $true)) )),
% 0.14/0.39 inference(beta_eta_normalization,[],[f178])).
% 0.14/0.39 thf(f178,plain,(
% 0.14/0.39 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((~ (q @ Y0)) | (~ (rel_m @ sK1 @ Y0)))) @ X1) = $true)) )),
% 0.14/0.39 inference(pi_clausification,[],[f177])).
% 0.14/0.39 thf(f177,plain,(
% 0.14/0.39 ((!! @ $i @ (^[Y0 : $i]: ((~ (q @ Y0)) | (~ (rel_m @ sK1 @ Y0))))) = $true)),
% 0.14/0.39 inference(not_proxy_clausification,[],[f170])).
% 0.14/0.39 thf(f170,plain,(
% 0.14/0.39 ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (q @ Y0)) | (~ (rel_m @ sK1 @ Y0)))))) = $false)),
% 0.14/0.39 inference(binary_proxy_clausification,[],[f156])).
% 0.14/0.39 thf(f156,plain,(
% 0.14/0.39 (((~ (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_m @ sK1 @ Y0)))))) | (~ (!! @ $i @ (^[Y0 : $i]: ((~ (q @ Y0)) | (~ (rel_m @ sK1 @ Y0))))))) = $false)),
% 0.14/0.39 inference(binary_proxy_clausification,[],[f155])).
% 0.14/0.39 thf(f207,plain,(
% 0.14/0.39 ~spl0_2),
% 0.14/0.39 inference(avatar_contradiction_clause,[],[f206])).
% 0.14/0.39 thf(f206,plain,(
% 0.14/0.39 $false | ~spl0_2),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f203])).
% 0.14/0.39 thf(f203,plain,(
% 0.14/0.39 ($true = $false) | ~spl0_2),
% 0.14/0.39 inference(superposition,[],[f192,f201])).
% 0.14/0.39 thf(f201,plain,(
% 0.14/0.39 ((p @ sK2) = $true)),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f195])).
% 0.14/0.39 thf(f195,plain,(
% 0.14/0.39 ((p @ sK2) = $true) | ($true = $false)),
% 0.14/0.39 inference(superposition,[],[f176,f169])).
% 0.14/0.39 thf(f176,plain,(
% 0.14/0.39 ( ! [X1 : $i] : (((rel_m @ sK1 @ X1) = $false) | ((p @ X1) = $true)) )),
% 0.14/0.39 inference(not_proxy_clausification,[],[f175])).
% 0.14/0.39 thf(f175,plain,(
% 0.14/0.39 ( ! [X1 : $i] : (((p @ X1) = $true) | ((~ (rel_m @ sK1 @ X1)) = $true)) )),
% 0.14/0.39 inference(binary_proxy_clausification,[],[f174])).
% 0.14/0.39 thf(f174,plain,(
% 0.14/0.39 ( ! [X1 : $i] : ((((p @ X1) | (~ (rel_m @ sK1 @ X1))) = $true)) )),
% 0.14/0.39 inference(beta_eta_normalization,[],[f173])).
% 0.14/0.39 thf(f173,plain,(
% 0.14/0.39 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((p @ Y0) | (~ (rel_m @ sK1 @ Y0)))) @ X1) = $true)) )),
% 0.14/0.39 inference(pi_clausification,[],[f172])).
% 0.14/0.39 thf(f172,plain,(
% 0.14/0.39 ($true = (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_m @ sK1 @ Y0))))))),
% 0.14/0.39 inference(not_proxy_clausification,[],[f171])).
% 0.14/0.39 thf(f171,plain,(
% 0.14/0.39 ($false = (~ (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_m @ sK1 @ Y0)))))))),
% 0.14/0.39 inference(binary_proxy_clausification,[],[f156])).
% 0.14/0.39 thf(f192,plain,(
% 0.14/0.39 ((p @ sK2) = $false) | ~spl0_2),
% 0.14/0.39 inference(avatar_component_clause,[],[f190])).
% 0.14/0.39 thf(f190,plain,(
% 0.14/0.39 spl0_2 <=> ((p @ sK2) = $false)),
% 0.14/0.39 introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
% 0.14/0.39 thf(f193,plain,(
% 0.14/0.39 spl0_1 | spl0_2),
% 0.14/0.39 inference(avatar_split_clause,[],[f168,f190,f187])).
% 0.14/0.39 thf(f168,plain,(
% 0.14/0.39 ( ! [X1 : $i] : (((p @ sK2) = $false) | ((rel_m @ sK2 @ X1) = $false) | ((q @ X1) = $true)) )),
% 0.14/0.39 inference(not_proxy_clausification,[],[f167])).
% 0.14/0.39 thf(f167,plain,(
% 0.14/0.39 ( ! [X1 : $i] : (((~ (rel_m @ sK2 @ X1)) = $true) | ((q @ X1) = $true) | ((p @ sK2) = $false)) )),
% 0.14/0.39 inference(binary_proxy_clausification,[],[f166])).
% 0.14/0.39 thf(f166,plain,(
% 0.14/0.39 ( ! [X1 : $i] : (((p @ sK2) = $false) | (((q @ X1) | (~ (rel_m @ sK2 @ X1))) = $true)) )),
% 0.14/0.39 inference(not_proxy_clausification,[],[f165])).
% 0.14/0.39 thf(f165,plain,(
% 0.14/0.39 ( ! [X1 : $i] : (((~ (p @ sK2)) = $true) | (((q @ X1) | (~ (rel_m @ sK2 @ X1))) = $true)) )),
% 0.14/0.39 inference(beta_eta_normalization,[],[f164])).
% 0.14/0.39 thf(f164,plain,(
% 0.14/0.39 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ((q @ Y0) | (~ (rel_m @ sK2 @ Y0)))) @ X1)) | ((~ (p @ sK2)) = $true)) )),
% 0.14/0.39 inference(pi_clausification,[],[f163])).
% 0.14/0.39 thf(f163,plain,(
% 0.14/0.39 ($true = (!! @ $i @ (^[Y0 : $i]: ((q @ Y0) | (~ (rel_m @ sK2 @ Y0)))))) | ((~ (p @ sK2)) = $true)),
% 0.14/0.39 inference(binary_proxy_clausification,[],[f162])).
% 0.14/0.39 thf(f162,plain,(
% 0.14/0.39 ($true = ((~ (p @ sK2)) | (!! @ $i @ (^[Y0 : $i]: ((q @ Y0) | (~ (rel_m @ sK2 @ Y0)))))))),
% 0.14/0.39 inference(not_proxy_clausification,[],[f161])).
% 0.14/0.39 thf(f161,plain,(
% 0.14/0.39 ((~ ((~ (p @ sK2)) | (!! @ $i @ (^[Y0 : $i]: ((q @ Y0) | (~ (rel_m @ sK2 @ Y0))))))) = $false)),
% 0.14/0.39 inference(binary_proxy_clausification,[],[f159])).
% 0.14/0.39 % SZS output end Proof for theBenchmark
% 0.14/0.39 % (17839)------------------------------
% 0.14/0.39 % (17839)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (17839)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (17839)Memory used [KB]: 5628
% 0.14/0.39 % (17839)Time elapsed: 0.013 s
% 0.14/0.39 % (17839)Instructions burned: 13 (million)
% 0.14/0.39 % (17839)------------------------------
% 0.14/0.39 % (17839)------------------------------
% 0.14/0.39 % (17838)Success in time 0.016 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------