TSTP Solution File: SYO475^6 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO475^6 : 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 : n008.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:05:21 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYO475^6 : TPTP v8.2.0. Released v4.0.0.
% 0.13/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.37 % Computer : n008.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Mon May 20 09:35:23 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.14/0.37 This is a TH0_THM_EQU_NAR problem
% 0.14/0.37 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.39 % (32005)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.39 % (32004)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.39 % (32008)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.39 % (32002)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.39 % (32007)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 % (32006)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.39 % (32009)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.39 % (32010)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.39 % (32006)Instruction limit reached!
% 0.14/0.39 % (32006)------------------------------
% 0.14/0.39 % (32006)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (32006)Termination reason: Unknown
% 0.14/0.39 % (32006)Termination phase: shuffling
% 0.14/0.39
% 0.14/0.39 % (32007)Instruction limit reached!
% 0.14/0.39 % (32007)------------------------------
% 0.14/0.39 % (32007)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (32006)Memory used [KB]: 1023
% 0.14/0.39 % (32006)Time elapsed: 0.003 s
% 0.14/0.39 % (32006)Instructions burned: 3 (million)
% 0.14/0.39 % (32006)------------------------------
% 0.14/0.39 % (32006)------------------------------
% 0.14/0.39 % (32007)Termination reason: Unknown
% 0.14/0.39 % (32007)Termination phase: shuffling
% 0.14/0.39
% 0.14/0.39 % (32007)Memory used [KB]: 1023
% 0.14/0.39 % (32007)Time elapsed: 0.004 s
% 0.14/0.39 % (32007)Instructions burned: 3 (million)
% 0.14/0.39 % (32007)------------------------------
% 0.14/0.39 % (32007)------------------------------
% 0.14/0.39 % (32010)Instruction limit reached!
% 0.14/0.39 % (32010)------------------------------
% 0.14/0.39 % (32010)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (32010)Termination reason: Unknown
% 0.14/0.39 % (32010)Termination phase: shuffling
% 0.14/0.39
% 0.14/0.39 % (32010)Memory used [KB]: 1023
% 0.14/0.39 % (32010)Time elapsed: 0.004 s
% 0.14/0.39 % (32010)Instructions burned: 4 (million)
% 0.14/0.39 % (32010)------------------------------
% 0.14/0.39 % (32010)------------------------------
% 0.14/0.39 % (32004)Instruction limit reached!
% 0.14/0.39 % (32004)------------------------------
% 0.14/0.39 % (32004)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (32004)Termination reason: Unknown
% 0.14/0.39 % (32004)Termination phase: Property scanning
% 0.14/0.39
% 0.14/0.39 % (32004)Memory used [KB]: 1023
% 0.14/0.39 % (32004)Time elapsed: 0.004 s
% 0.14/0.39 % (32004)Instructions burned: 4 (million)
% 0.14/0.39 % (32004)------------------------------
% 0.14/0.39 % (32004)------------------------------
% 0.14/0.40 % (32008)First to succeed.
% 0.14/0.40 % (32002)Also succeeded, but the first one will report.
% 0.14/0.40 % (32005)Also succeeded, but the first one will report.
% 0.14/0.40 % (32008)Refutation found. Thanks to Tanya!
% 0.14/0.40 % SZS status Theorem for theBenchmark
% 0.14/0.40 % SZS output start Proof for theBenchmark
% 0.14/0.40 thf(type_def_5, type, mu: $tType).
% 0.14/0.40 thf(func_def_0, type, mu: $tType).
% 0.14/0.40 thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.14/0.40 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_15, type, mtrue: $i > $o).
% 0.14/0.40 thf(func_def_16, type, mfalse: $i > $o).
% 0.14/0.40 thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.14/0.40 thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.14/0.40 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.14/0.40 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.14/0.40 thf(func_def_33, type, rel_s5: $i > $i > $o).
% 0.14/0.40 thf(func_def_34, type, mbox_s5: ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_35, type, mdia_s5: ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_36, type, f: mu > $i > $o).
% 0.14/0.40 thf(func_def_55, type, sK3: mu).
% 0.14/0.40 thf(f145,plain,(
% 0.14/0.40 $false),
% 0.14/0.40 inference(trivial_inequality_removal,[],[f143])).
% 0.14/0.40 thf(f143,plain,(
% 0.14/0.40 ($true = $false)),
% 0.14/0.40 inference(superposition,[],[f142,f129])).
% 0.14/0.40 thf(f129,plain,(
% 0.14/0.40 ($true = (rel_s5 @ sK1 @ sK2))),
% 0.14/0.40 inference(not_proxy_clausification,[],[f128])).
% 0.14/0.40 thf(f128,plain,(
% 0.14/0.40 ((~ (rel_s5 @ sK1 @ sK2)) = $false)),
% 0.14/0.40 inference(binary_proxy_clausification,[],[f126])).
% 0.14/0.40 thf(f126,plain,(
% 0.14/0.40 (((~ (rel_s5 @ sK1 @ sK2)) | (!! @ mu @ (^[Y0 : mu]: (f @ Y0 @ sK2)))) = $false)),
% 0.14/0.40 inference(beta_eta_normalization,[],[f125])).
% 0.14/0.40 thf(f125,plain,(
% 0.14/0.40 (((^[Y0 : $i]: ((~ (rel_s5 @ sK1 @ Y0)) | (!! @ mu @ (^[Y1 : mu]: (f @ Y1 @ Y0))))) @ sK2) = $false)),
% 0.14/0.40 inference(sigma_clausification,[],[f124])).
% 0.14/0.40 thf(f124,plain,(
% 0.14/0.40 ((!! @ $i @ (^[Y0 : $i]: ((~ (rel_s5 @ sK1 @ Y0)) | (!! @ mu @ (^[Y1 : mu]: (f @ Y1 @ Y0)))))) = $false)),
% 0.14/0.40 inference(binary_proxy_clausification,[],[f122])).
% 0.14/0.40 thf(f122,plain,(
% 0.14/0.40 (((!! @ $i @ (^[Y0 : $i]: ((~ (rel_s5 @ sK1 @ Y0)) | (!! @ mu @ (^[Y1 : mu]: (f @ Y1 @ Y0)))))) | (~ (!! @ mu @ (^[Y0 : mu]: (!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ sK1 @ Y1)) | (f @ Y0 @ Y1)))))))) = $false)),
% 0.14/0.40 inference(beta_eta_normalization,[],[f121])).
% 0.14/0.40 thf(f121,plain,(
% 0.14/0.40 ($false = ((^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ Y0 @ Y1)) | (!! @ mu @ (^[Y2 : mu]: (f @ Y2 @ Y1)))))) | (~ (!! @ mu @ (^[Y1 : mu]: (!! @ $i @ (^[Y2 : $i]: ((~ (rel_s5 @ Y0 @ Y2)) | (f @ Y1 @ Y2))))))))) @ sK1))),
% 0.14/0.40 inference(sigma_clausification,[],[f120])).
% 0.14/0.40 thf(f120,plain,(
% 0.14/0.40 ($true != (!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ Y0 @ Y1)) | (!! @ mu @ (^[Y2 : mu]: (f @ Y2 @ Y1)))))) | (~ (!! @ mu @ (^[Y1 : mu]: (!! @ $i @ (^[Y2 : $i]: ((~ (rel_s5 @ Y0 @ Y2)) | (f @ Y1 @ Y2)))))))))))),
% 0.14/0.40 inference(beta_eta_normalization,[],[f119])).
% 0.14/0.40 thf(f119,plain,(
% 0.14/0.40 (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[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 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: (Y0 @ Y2 @ Y1)))))) @ (^[Y0 : mu]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (rel_s5 @ Y2 @ Y3)) | (Y1 @ Y3))))))) @ (f @ Y0)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (rel_s5 @ Y1 @ Y2)) | (Y0 @ Y2))))))) @ ((^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: (Y0 @ Y2 @ Y1)))))) @ (^[Y0 : mu]: (f @ Y0)))))) != $true)),
% 0.14/0.40 inference(definition_unfolding,[],[f116,f114,f118,f112,f113,f113,f112])).
% 0.14/0.40 thf(f113,plain,(
% 0.14/0.40 (mbox_s5 = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (rel_s5 @ Y1 @ Y2)) | (Y0 @ Y2))))))))),
% 0.14/0.40 inference(cnf_transformation,[],[f41])).
% 0.14/0.40 thf(f41,plain,(
% 0.14/0.40 (mbox_s5 = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (rel_s5 @ Y1 @ Y2)) | (Y0 @ Y2))))))))),
% 0.14/0.40 inference(fool_elimination,[],[f40])).
% 0.14/0.40 thf(f40,plain,(
% 0.14/0.40 ((^[X0 : $i > $o, X1 : $i] : (! [X2] : ((X0 @ X2) | ~(rel_s5 @ X1 @ X2)))) = mbox_s5)),
% 0.14/0.40 inference(rectify,[],[f32])).
% 0.14/0.40 thf(f32,axiom,(
% 0.14/0.40 ((^[X3 : $i > $o, X2 : $i] : (! [X7] : ((X3 @ X7) | ~(rel_s5 @ X2 @ X7)))) = mbox_s5)),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox_s5)).
% 0.14/0.40 thf(f112,plain,(
% 0.14/0.40 (mforall_ind = (^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: (Y0 @ Y2 @ Y1)))))))),
% 0.14/0.40 inference(cnf_transformation,[],[f109])).
% 0.14/0.40 thf(f109,plain,(
% 0.14/0.40 (mforall_ind = (^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: (Y0 @ Y2 @ Y1)))))))),
% 0.14/0.40 inference(fool_elimination,[],[f108])).
% 0.14/0.40 thf(f108,plain,(
% 0.14/0.40 ((^[X0 : mu > $i > $o, X1 : $i] : (! [X2 : mu] : (X0 @ X2 @ X1))) = mforall_ind)),
% 0.14/0.40 inference(rectify,[],[f10])).
% 0.14/0.40 thf(f10,axiom,(
% 0.14/0.40 ((^[X3 : mu > $i > $o, X2 : $i] : (! [X0 : mu] : (X3 @ X0 @ X2))) = mforall_ind)),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mforall_ind)).
% 0.14/0.40 thf(f118,plain,(
% 0.14/0.40 (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.40 inference(definition_unfolding,[],[f111,f117,f115])).
% 0.14/0.40 thf(f115,plain,(
% 0.14/0.40 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.14/0.40 inference(cnf_transformation,[],[f103])).
% 0.14/0.40 thf(f103,plain,(
% 0.14/0.40 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.14/0.40 inference(fool_elimination,[],[f102])).
% 0.14/0.40 thf(f102,plain,(
% 0.14/0.40 (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.14/0.40 inference(rectify,[],[f3])).
% 0.14/0.40 thf(f3,axiom,(
% 0.14/0.40 (mnot = (^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))))),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot)).
% 0.14/0.40 thf(f117,plain,(
% 0.14/0.40 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.14/0.40 inference(cnf_transformation,[],[f91])).
% 0.14/0.40 thf(f91,plain,(
% 0.14/0.40 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.14/0.40 inference(fool_elimination,[],[f90])).
% 0.14/0.40 thf(f90,plain,(
% 0.14/0.40 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))) = mor)),
% 0.14/0.40 inference(rectify,[],[f4])).
% 0.14/0.40 thf(f4,axiom,(
% 0.14/0.40 ((^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X3 @ X2) | (X4 @ X2))) = mor)),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor)).
% 0.14/0.40 thf(f111,plain,(
% 0.14/0.40 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.14/0.40 inference(cnf_transformation,[],[f65])).
% 0.14/0.40 thf(f65,plain,(
% 0.14/0.40 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.14/0.40 inference(fool_elimination,[],[f64])).
% 0.14/0.40 thf(f64,plain,(
% 0.14/0.40 (mimplies = (^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)))),
% 0.14/0.40 inference(rectify,[],[f6])).
% 0.14/0.40 thf(f6,axiom,(
% 0.14/0.40 (mimplies = (^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)))),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimplies)).
% 0.14/0.40 thf(f114,plain,(
% 0.14/0.40 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.14/0.40 inference(cnf_transformation,[],[f73])).
% 0.14/0.40 thf(f73,plain,(
% 0.14/0.40 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.14/0.40 inference(fool_elimination,[],[f72])).
% 0.14/0.40 thf(f72,plain,(
% 0.14/0.40 ((^[X0 : $i > $o] : (! [X1] : (X0 @ X1))) = mvalid)),
% 0.14/0.40 inference(rectify,[],[f28])).
% 0.14/0.40 thf(f28,axiom,(
% 0.14/0.40 ((^[X3 : $i > $o] : (! [X2] : (X3 @ X2))) = mvalid)),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.14/0.40 thf(f116,plain,(
% 0.14/0.40 ((mvalid @ (mimplies @ (mforall_ind @ (^[Y0 : mu]: (mbox_s5 @ (f @ Y0)))) @ (mbox_s5 @ (mforall_ind @ (^[Y0 : mu]: (f @ Y0)))))) != $true)),
% 0.14/0.40 inference(cnf_transformation,[],[f110])).
% 0.14/0.40 thf(f110,plain,(
% 0.14/0.40 ((mvalid @ (mimplies @ (mforall_ind @ (^[Y0 : mu]: (mbox_s5 @ (f @ Y0)))) @ (mbox_s5 @ (mforall_ind @ (^[Y0 : mu]: (f @ Y0)))))) != $true)),
% 0.14/0.40 inference(flattening,[],[f51])).
% 0.14/0.40 thf(f51,plain,(
% 0.14/0.40 ~((mvalid @ (mimplies @ (mforall_ind @ (^[Y0 : mu]: (mbox_s5 @ (f @ Y0)))) @ (mbox_s5 @ (mforall_ind @ (^[Y0 : mu]: (f @ Y0)))))) = $true)),
% 0.14/0.40 inference(fool_elimination,[],[f50])).
% 0.14/0.40 thf(f50,plain,(
% 0.14/0.40 ~(mvalid @ (mimplies @ (mforall_ind @ (^[X0 : mu] : (mbox_s5 @ (f @ X0)))) @ (mbox_s5 @ (mforall_ind @ (^[X1 : mu] : (f @ X1))))))),
% 0.14/0.40 inference(rectify,[],[f38])).
% 0.14/0.40 thf(f38,negated_conjecture,(
% 0.14/0.40 ~(mvalid @ (mimplies @ (mforall_ind @ (^[X0 : mu] : (mbox_s5 @ (f @ X0)))) @ (mbox_s5 @ (mforall_ind @ (^[X0 : mu] : (f @ X0))))))),
% 0.14/0.40 inference(negated_conjecture,[],[f37])).
% 0.14/0.40 thf(f37,conjecture,(
% 0.14/0.40 (mvalid @ (mimplies @ (mforall_ind @ (^[X0 : mu] : (mbox_s5 @ (f @ X0)))) @ (mbox_s5 @ (mforall_ind @ (^[X0 : mu] : (f @ X0))))))),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)).
% 0.14/0.40 thf(f142,plain,(
% 0.14/0.40 ((rel_s5 @ sK1 @ sK2) = $false)),
% 0.14/0.40 inference(trivial_inequality_removal,[],[f139])).
% 0.14/0.40 thf(f139,plain,(
% 0.14/0.40 ($true = $false) | ((rel_s5 @ sK1 @ sK2) = $false)),
% 0.14/0.40 inference(superposition,[],[f131,f138])).
% 0.14/0.40 thf(f138,plain,(
% 0.14/0.40 ( ! [X2 : $i,X1 : mu] : (($true = (f @ X1 @ X2)) | ((rel_s5 @ sK1 @ X2) = $false)) )),
% 0.14/0.40 inference(not_proxy_clausification,[],[f137])).
% 0.14/0.40 thf(f137,plain,(
% 0.14/0.40 ( ! [X2 : $i,X1 : mu] : (((~ (rel_s5 @ sK1 @ X2)) = $true) | ($true = (f @ X1 @ X2))) )),
% 0.14/0.40 inference(binary_proxy_clausification,[],[f136])).
% 0.14/0.40 thf(f136,plain,(
% 0.14/0.40 ( ! [X2 : $i,X1 : mu] : (($true = ((~ (rel_s5 @ sK1 @ X2)) | (f @ X1 @ X2)))) )),
% 0.14/0.40 inference(beta_eta_normalization,[],[f135])).
% 0.14/0.40 thf(f135,plain,(
% 0.14/0.40 ( ! [X2 : $i,X1 : mu] : (($true = ((^[Y0 : $i]: ((~ (rel_s5 @ sK1 @ Y0)) | (f @ X1 @ Y0))) @ X2))) )),
% 0.14/0.40 inference(pi_clausification,[],[f134])).
% 0.14/0.40 thf(f134,plain,(
% 0.14/0.40 ( ! [X1 : mu] : (($true = (!! @ $i @ (^[Y0 : $i]: ((~ (rel_s5 @ sK1 @ Y0)) | (f @ X1 @ Y0)))))) )),
% 0.14/0.40 inference(beta_eta_normalization,[],[f133])).
% 0.14/0.40 thf(f133,plain,(
% 0.14/0.40 ( ! [X1 : mu] : (($true = ((^[Y0 : mu]: (!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ sK1 @ Y1)) | (f @ Y0 @ Y1))))) @ X1))) )),
% 0.14/0.40 inference(pi_clausification,[],[f132])).
% 0.14/0.40 thf(f132,plain,(
% 0.14/0.40 ((!! @ mu @ (^[Y0 : mu]: (!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ sK1 @ Y1)) | (f @ Y0 @ Y1)))))) = $true)),
% 0.14/0.40 inference(not_proxy_clausification,[],[f123])).
% 0.14/0.40 thf(f123,plain,(
% 0.14/0.40 ($false = (~ (!! @ mu @ (^[Y0 : mu]: (!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ sK1 @ Y1)) | (f @ Y0 @ Y1))))))))),
% 0.14/0.40 inference(binary_proxy_clausification,[],[f122])).
% 0.14/0.40 thf(f131,plain,(
% 0.14/0.40 ($false = (f @ sK3 @ sK2))),
% 0.14/0.40 inference(beta_eta_normalization,[],[f130])).
% 0.14/0.40 thf(f130,plain,(
% 0.14/0.40 ($false = ((^[Y0 : mu]: (f @ Y0 @ sK2)) @ sK3))),
% 0.14/0.40 inference(sigma_clausification,[],[f127])).
% 0.14/0.40 thf(f127,plain,(
% 0.14/0.40 ($false = (!! @ mu @ (^[Y0 : mu]: (f @ Y0 @ sK2))))),
% 0.14/0.40 inference(binary_proxy_clausification,[],[f126])).
% 0.14/0.40 % SZS output end Proof for theBenchmark
% 0.14/0.40 % (32008)------------------------------
% 0.14/0.40 % (32008)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (32008)Termination reason: Refutation
% 0.14/0.40
% 0.14/0.40 % (32008)Memory used [KB]: 5628
% 0.14/0.40 % (32008)Time elapsed: 0.009 s
% 0.14/0.40 % (32008)Instructions burned: 8 (million)
% 0.14/0.40 % (32008)------------------------------
% 0.14/0.40 % (32008)------------------------------
% 0.14/0.40 % (32001)Success in time 0.012 s
% 0.14/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------