TSTP Solution File: SYO395^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO395^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 : 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 : Tue May 21 09:04:17 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.07/0.13 % Problem : SYO395^1 : TPTP v8.2.0. Released v4.0.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.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 08:43:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 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 % (16540)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 % (16541)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.38 % (16539)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 % (16538)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 % (16543)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 % (16544)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 % (16541)Instruction limit reached!
% 0.14/0.38 % (16541)------------------------------
% 0.14/0.38 % (16541)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (16541)Termination reason: Unknown
% 0.14/0.38 % (16541)Termination phase: shuffling
% 0.14/0.38
% 0.14/0.38 % (16541)Memory used [KB]: 1023
% 0.14/0.38 % (16541)Time elapsed: 0.003 s
% 0.14/0.38 % (16541)Instructions burned: 2 (million)
% 0.14/0.38 % (16541)------------------------------
% 0.14/0.38 % (16541)------------------------------
% 0.14/0.39 % (16539)Instruction limit reached!
% 0.14/0.39 % (16539)------------------------------
% 0.14/0.39 % (16539)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (16539)Termination reason: Unknown
% 0.14/0.39 % (16539)Termination phase: shuffling
% 0.14/0.39
% 0.14/0.39 % (16539)Memory used [KB]: 1023
% 0.14/0.39 % (16539)Time elapsed: 0.005 s
% 0.14/0.39 % (16539)Instructions burned: 5 (million)
% 0.14/0.39 % (16539)------------------------------
% 0.14/0.39 % (16539)------------------------------
% 0.14/0.39 % (16543)Refutation not found, incomplete strategy
% 0.14/0.39 % (16543)------------------------------
% 0.14/0.39 % (16543)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (16543)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 % (16543)Memory used [KB]: 5628
% 0.14/0.39 % (16543)Time elapsed: 0.006 s
% 0.14/0.39 % (16543)Instructions burned: 7 (million)
% 0.14/0.39 % (16543)------------------------------
% 0.14/0.39 % (16543)------------------------------
% 0.14/0.39 % (16542)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.39 % (16540)First to succeed.
% 0.14/0.39 % (16542)Instruction limit reached!
% 0.14/0.39 % (16542)------------------------------
% 0.14/0.39 % (16542)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (16542)Termination reason: Unknown
% 0.14/0.39 % (16542)Termination phase: shuffling
% 0.14/0.39
% 0.14/0.39 % (16542)Memory used [KB]: 1023
% 0.14/0.39 % (16542)Time elapsed: 0.003 s
% 0.14/0.39 % (16542)Instructions burned: 2 (million)
% 0.14/0.39 % (16542)------------------------------
% 0.14/0.39 % (16542)------------------------------
% 0.14/0.39 % (16544)Also succeeded, but the first one will report.
% 0.14/0.39 % (16538)Also succeeded, but the first one will report.
% 0.14/0.39 % (16540)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_k: $i > $i > $o).
% 0.14/0.39 thf(func_def_34, type, mbox_k: ($i > $o) > $i > $o).
% 0.14/0.39 thf(func_def_35, type, mdia_k: ($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, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.14/0.39 thf(f155,plain,(
% 0.14/0.39 $false),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f154])).
% 0.14/0.39 thf(f154,plain,(
% 0.14/0.39 ($false = $true)),
% 0.14/0.39 inference(beta_eta_normalization,[],[f153])).
% 0.14/0.39 thf(f153,plain,(
% 0.14/0.39 ($false = ((^[Y0 : $i]: ($true)) @ sK1))),
% 0.14/0.39 inference(sigma_clausification,[],[f152])).
% 0.14/0.39 thf(f152,plain,(
% 0.14/0.39 ((!! @ $i @ (^[Y0 : $i]: ($true))) != $true)),
% 0.14/0.39 inference(boolean_simplification,[],[f151])).
% 0.14/0.39 thf(f151,plain,(
% 0.14/0.39 ($true != (!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_k @ Y0 @ Y1))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_k @ Y0 @ Y1))))))))))),
% 0.14/0.39 inference(boolean_simplification,[],[f150])).
% 0.14/0.39 thf(f150,plain,(
% 0.14/0.39 ($true != (!! @ $i @ (^[Y0 : $i]: (~ (~ ((!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_k @ Y0 @ Y1))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_k @ Y0 @ Y1))))))))))))),
% 0.14/0.39 inference(boolean_simplification,[],[f149])).
% 0.14/0.39 thf(f149,plain,(
% 0.14/0.39 ((!! @ $i @ (^[Y0 : $i]: (~ ((~ ((!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_k @ Y0 @ Y1))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_k @ Y0 @ Y1)))))))) | (~ ((!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_k @ Y0 @ Y1))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_k @ Y0 @ Y1)))))))))))) != $true)),
% 0.14/0.39 inference(boolean_simplification,[],[f148])).
% 0.14/0.39 thf(f148,plain,(
% 0.14/0.39 ($true != (!! @ $i @ (^[Y0 : $i]: (~ ((~ ((!! @ $i @ (^[Y1 : $i]: (((p @ Y1) | (p @ Y1)) | (~ (rel_k @ Y0 @ Y1))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_k @ Y0 @ Y1)))))))) | (~ ((!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_k @ Y0 @ Y1))))) | (~ (!! @ $i @ (^[Y1 : $i]: (((p @ Y1) | (p @ Y1)) | (~ (rel_k @ Y0 @ Y1)))))))))))))),
% 0.14/0.39 inference(boolean_simplification,[],[f147])).
% 0.14/0.39 thf(f147,plain,(
% 0.14/0.39 ($true != (!! @ $i @ (^[Y0 : $i]: (~ ((~ ((!! @ $i @ (^[Y1 : $i]: (((p @ Y1) | (~ (~ (p @ Y1)))) | (~ (rel_k @ Y0 @ Y1))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_k @ Y0 @ Y1)))))))) | (~ ((!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_k @ Y0 @ Y1))))) | (~ (!! @ $i @ (^[Y1 : $i]: (((p @ Y1) | (~ (~ (p @ Y1)))) | (~ (rel_k @ Y0 @ Y1)))))))))))))),
% 0.14/0.39 inference(beta_eta_normalization,[],[f146])).
% 0.14/0.39 thf(f146,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 > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: ((Y5 @ Y6) | (Y4 @ Y6))))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y2) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y3)))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: ((Y5 @ Y6) | (Y4 @ Y6))))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y2) @ Y3)))) @ Y0 @ Y1) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: ((Y5 @ Y6) | (Y4 @ Y6))))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y2) @ Y3)))) @ Y1 @ Y0))))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_k @ Y1 @ Y2)))))))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))) @ p) @ p)) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_k @ Y1 @ Y2)))))))) @ p))))),
% 0.14/0.39 inference(definition_unfolding,[],[f110,f129,f139,f127,f137,f133,f127])).
% 0.14/0.39 thf(f133,plain,(
% 0.14/0.39 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.14/0.39 inference(cnf_transformation,[],[f66])).
% 0.14/0.39 thf(f66,plain,(
% 0.14/0.39 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.14/0.39 inference(fool_elimination,[],[f65])).
% 0.14/0.39 thf(f65,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(f137,plain,(
% 0.14/0.39 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))))),
% 0.14/0.39 inference(definition_unfolding,[],[f113,f115,f133])).
% 0.14/0.39 thf(f115,plain,(
% 0.14/0.39 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.14/0.39 inference(cnf_transformation,[],[f98])).
% 0.14/0.39 thf(f98,plain,(
% 0.14/0.39 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.14/0.39 inference(fool_elimination,[],[f97])).
% 0.14/0.39 thf(f97,plain,(
% 0.14/0.39 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ 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] : ((X3 @ X2) | (X4 @ X2))) = mor)),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor)).
% 0.14/0.39 thf(f113,plain,(
% 0.14/0.39 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.14/0.39 inference(cnf_transformation,[],[f40])).
% 0.14/0.39 thf(f40,plain,(
% 0.14/0.39 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.14/0.39 inference(fool_elimination,[],[f39])).
% 0.14/0.39 thf(f39,plain,(
% 0.14/0.39 ((^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)) = mimplies)),
% 0.14/0.39 inference(rectify,[],[f6])).
% 0.14/0.39 thf(f6,axiom,(
% 0.14/0.39 ((^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)) = mimplies)),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimplies)).
% 0.14/0.39 thf(f127,plain,(
% 0.14/0.39 (mbox_k = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_k @ Y1 @ Y2)))))))))),
% 0.14/0.39 inference(cnf_transformation,[],[f64])).
% 0.14/0.39 thf(f64,plain,(
% 0.14/0.39 (mbox_k = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_k @ Y1 @ Y2)))))))))),
% 0.14/0.39 inference(fool_elimination,[],[f63])).
% 0.14/0.39 thf(f63,plain,(
% 0.14/0.39 ((^[X0 : $i > $o, X1 : $i] : (! [X2] : (~(rel_k @ X1 @ X2) | (X0 @ X2)))) = mbox_k)),
% 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_k @ X2 @ X7) | (X3 @ X7)))) = mbox_k)),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox_k)).
% 0.14/0.39 thf(f139,plain,(
% 0.14/0.39 (mequiv = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: ((Y5 @ Y6) | (Y4 @ Y6))))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y2) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y3)))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: ((Y5 @ Y6) | (Y4 @ Y6))))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y2) @ Y3)))) @ Y0 @ Y1) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: ((Y5 @ Y6) | (Y4 @ Y6))))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y2) @ Y3)))) @ Y1 @ Y0))))))),
% 0.14/0.39 inference(definition_unfolding,[],[f103,f136,f137,f137])).
% 0.14/0.39 thf(f136,plain,(
% 0.14/0.39 (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y1)))))))),
% 0.14/0.39 inference(definition_unfolding,[],[f132,f133,f115,f133,f133])).
% 0.14/0.39 thf(f132,plain,(
% 0.14/0.39 (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mor @ (mnot @ Y0) @ (mnot @ Y1)))))))),
% 0.14/0.39 inference(cnf_transformation,[],[f92])).
% 0.14/0.39 thf(f92,plain,(
% 0.14/0.39 (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mor @ (mnot @ Y0) @ (mnot @ Y1)))))))),
% 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] : (mnot @ (mor @ (mnot @ X0) @ (mnot @ X1)))) = mand)),
% 0.14/0.39 inference(rectify,[],[f5])).
% 0.14/0.39 thf(f5,axiom,(
% 0.14/0.39 ((^[X3 : $i > $o, X4 : $i > $o] : (mnot @ (mor @ (mnot @ X3) @ (mnot @ X4)))) = mand)),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mand)).
% 0.14/0.39 thf(f103,plain,(
% 0.14/0.39 (mequiv = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mand @ (mimplies @ Y0 @ Y1) @ (mimplies @ Y1 @ Y0))))))),
% 0.14/0.39 inference(cnf_transformation,[],[f62])).
% 0.14/0.39 thf(f62,plain,(
% 0.14/0.39 (mequiv = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mand @ (mimplies @ Y0 @ Y1) @ (mimplies @ Y1 @ Y0))))))),
% 0.14/0.39 inference(fool_elimination,[],[f61])).
% 0.14/0.39 thf(f61,plain,(
% 0.14/0.39 ((^[X0 : $i > $o, X1 : $i > $o] : (mand @ (mimplies @ X0 @ X1) @ (mimplies @ X1 @ X0))) = mequiv)),
% 0.14/0.39 inference(rectify,[],[f8])).
% 0.14/0.39 thf(f8,axiom,(
% 0.14/0.39 ((^[X3 : $i > $o, X4 : $i > $o] : (mand @ (mimplies @ X3 @ X4) @ (mimplies @ X4 @ X3))) = mequiv)),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mequiv)).
% 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,[],[f48])).
% 0.14/0.39 thf(f48,plain,(
% 0.14/0.39 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.14/0.39 inference(fool_elimination,[],[f47])).
% 0.14/0.39 thf(f47,plain,(
% 0.14/0.39 (mvalid = (^[X0 : $i > $o] : (! [X1] : (X0 @ X1))))),
% 0.14/0.39 inference(rectify,[],[f28])).
% 0.14/0.39 thf(f28,axiom,(
% 0.14/0.39 (mvalid = (^[X3 : $i > $o] : (! [X2] : (X3 @ X2))))),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.14/0.39 thf(f110,plain,(
% 0.14/0.39 ((mvalid @ (mequiv @ (mbox_k @ (mimplies @ (mnot @ p) @ p)) @ (mbox_k @ p))) != $true)),
% 0.14/0.39 inference(cnf_transformation,[],[f101])).
% 0.14/0.39 thf(f101,plain,(
% 0.14/0.39 ((mvalid @ (mequiv @ (mbox_k @ (mimplies @ (mnot @ p) @ p)) @ (mbox_k @ p))) != $true)),
% 0.14/0.39 inference(flattening,[],[f90])).
% 0.14/0.39 thf(f90,plain,(
% 0.14/0.39 ~((mvalid @ (mequiv @ (mbox_k @ (mimplies @ (mnot @ p) @ p)) @ (mbox_k @ p))) = $true)),
% 0.14/0.39 inference(fool_elimination,[],[f89])).
% 0.14/0.39 thf(f89,plain,(
% 0.14/0.39 ~(mvalid @ (mequiv @ (mbox_k @ (mimplies @ (mnot @ p) @ p)) @ (mbox_k @ p)))),
% 0.14/0.39 inference(rectify,[],[f35])).
% 0.14/0.39 thf(f35,negated_conjecture,(
% 0.14/0.39 ~(mvalid @ (mequiv @ (mbox_k @ (mimplies @ (mnot @ p) @ p)) @ (mbox_k @ p)))),
% 0.14/0.39 inference(negated_conjecture,[],[f34])).
% 0.14/0.39 thf(f34,conjecture,(
% 0.14/0.39 (mvalid @ (mequiv @ (mbox_k @ (mimplies @ (mnot @ p) @ p)) @ (mbox_k @ p)))),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)).
% 0.14/0.39 % SZS output end Proof for theBenchmark
% 0.14/0.39 % (16540)------------------------------
% 0.14/0.39 % (16540)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (16540)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (16540)Memory used [KB]: 5628
% 0.14/0.39 % (16540)Time elapsed: 0.010 s
% 0.14/0.39 % (16540)Instructions burned: 9 (million)
% 0.14/0.39 % (16540)------------------------------
% 0.14/0.39 % (16540)------------------------------
% 0.14/0.39 % (16537)Success in time 0.011 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------