TSTP Solution File: LCL699^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL699^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 : n027.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:17 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL699^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% 0.11/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.15/0.35 % Computer : n027.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 01:36: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.15/0.38 % (3717)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.15/0.39 % (3717)First to succeed.
% 0.15/0.39 % (3718)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.15/0.39 % (3719)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.15/0.39 % (3720)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.39 % (3721)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.15/0.39 % (3722)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.15/0.39 % (3723)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.39 % (3724)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.15/0.39 % (3717)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% 0.15/0.39 thf(type_def_5, type, mu: $tType).
% 0.15/0.39 thf(func_def_0, type, mu: $tType).
% 0.15/0.39 thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.15/0.39 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_15, type, mtrue: $i > $o).
% 0.15/0.39 thf(func_def_16, type, mfalse: $i > $o).
% 0.15/0.39 thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.15/0.39 thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.15/0.39 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.15/0.39 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.15/0.39 thf(func_def_48, type, sK0: $i > $i > $o).
% 0.15/0.39 thf(func_def_51, type, sK3: $i > $o).
% 0.15/0.39 thf(f163,plain,(
% 0.15/0.39 $false),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f162])).
% 0.15/0.39 thf(f162,plain,(
% 0.15/0.39 ($false = $true)),
% 0.15/0.39 inference(superposition,[],[f148,f160])).
% 0.15/0.39 thf(f160,plain,(
% 0.15/0.39 ((sK3 @ sK2) = $true)),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f158])).
% 0.15/0.39 thf(f158,plain,(
% 0.15/0.39 ((sK3 @ sK2) = $true) | ($false = $true)),
% 0.15/0.39 inference(superposition,[],[f156,f153])).
% 0.15/0.39 thf(f153,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (($false = (sK0 @ sK2 @ X1)) | ((sK3 @ X1) = $true)) )),
% 0.15/0.39 inference(not_proxy_clausification,[],[f152])).
% 0.15/0.39 thf(f152,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (((~ (sK0 @ sK2 @ X1)) = $true) | ((sK3 @ X1) = $true)) )),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f151])).
% 0.15/0.39 thf(f151,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (($true = ((sK3 @ X1) | (~ (sK0 @ sK2 @ X1))))) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f150])).
% 0.15/0.39 thf(f150,plain,(
% 0.15/0.39 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((sK3 @ Y0) | (~ (sK0 @ sK2 @ Y0)))) @ X1) = $true)) )),
% 0.15/0.39 inference(pi_clausification,[],[f149])).
% 0.15/0.39 thf(f149,plain,(
% 0.15/0.39 ((!! @ $i @ (^[Y0 : $i]: ((sK3 @ Y0) | (~ (sK0 @ sK2 @ Y0))))) = $true)),
% 0.15/0.39 inference(not_proxy_clausification,[],[f147])).
% 0.15/0.39 thf(f147,plain,(
% 0.15/0.39 ((~ (!! @ $i @ (^[Y0 : $i]: ((sK3 @ Y0) | (~ (sK0 @ sK2 @ Y0)))))) = $false)),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f146])).
% 0.15/0.39 thf(f146,plain,(
% 0.15/0.39 (((sK3 @ sK2) | (~ (!! @ $i @ (^[Y0 : $i]: ((sK3 @ Y0) | (~ (sK0 @ sK2 @ Y0))))))) = $false)),
% 0.15/0.39 inference(beta_eta_normalization,[],[f145])).
% 0.15/0.39 thf(f145,plain,(
% 0.15/0.39 (((^[Y0 : $i > $o]: ((Y0 @ sK2) | (~ (!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) | (~ (sK0 @ sK2 @ Y1)))))))) @ sK3) = $false)),
% 0.15/0.39 inference(sigma_clausification,[],[f144])).
% 0.15/0.39 thf(f144,plain,(
% 0.15/0.39 ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((Y0 @ sK2) | (~ (!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) | (~ (sK0 @ sK2 @ Y1))))))))) = $false)),
% 0.15/0.39 inference(beta_eta_normalization,[],[f143])).
% 0.15/0.39 thf(f143,plain,(
% 0.15/0.39 ($false = ((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((Y1 @ Y0) | (~ (!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) | (~ (sK0 @ Y0 @ Y2)))))))))) @ sK2))),
% 0.15/0.39 inference(sigma_clausification,[],[f142])).
% 0.15/0.39 thf(f142,plain,(
% 0.15/0.39 ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((Y1 @ Y0) | (~ (!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) | (~ (sK0 @ Y0 @ Y2))))))))))) != $true)),
% 0.15/0.39 inference(beta_eta_normalization,[],[f141])).
% 0.15/0.39 thf(f141,plain,(
% 0.15/0.39 ($true != ((^[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]: ((Y4 @ Y5) | (Y3 @ 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) @ Y0)))))),
% 0.15/0.39 inference(definition_unfolding,[],[f116,f118,f111,f132,f109])).
% 0.15/0.39 thf(f109,plain,(
% 0.15/0.39 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (Y0 @ Y2 @ Y3)))))))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f90])).
% 0.15/0.39 thf(f90,plain,(
% 0.15/0.39 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (Y0 @ Y2 @ Y3)))))))))))),
% 0.15/0.39 inference(fool_elimination,[],[f89])).
% 0.15/0.39 thf(f89,plain,(
% 0.15/0.39 ((^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i] : (! [X3] : (~(X0 @ X2 @ X3) | (X1 @ X3)))) = mbox)),
% 0.15/0.39 inference(rectify,[],[f16])).
% 0.15/0.39 thf(f16,axiom,(
% 0.15/0.39 ((^[X6 : $i > $i > $o, X3 : $i > $o, X2 : $i] : (! [X7] : (~(X6 @ X2 @ X7) | (X3 @ X7)))) = mbox)),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox)).
% 0.15/0.39 thf(f132,plain,(
% 0.15/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.15/0.39 inference(definition_unfolding,[],[f113,f104,f100])).
% 0.15/0.39 thf(f100,plain,(
% 0.15/0.39 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f40])).
% 0.15/0.39 thf(f40,plain,(
% 0.15/0.39 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.15/0.39 inference(fool_elimination,[],[f39])).
% 0.15/0.39 thf(f39,plain,(
% 0.15/0.39 ((^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))) = mnot)),
% 0.15/0.39 inference(rectify,[],[f3])).
% 0.15/0.39 thf(f3,axiom,(
% 0.15/0.39 ((^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))) = mnot)),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot)).
% 0.15/0.39 thf(f104,plain,(
% 0.15/0.39 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f56])).
% 0.15/0.39 thf(f56,plain,(
% 0.15/0.39 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.15/0.39 inference(fool_elimination,[],[f55])).
% 0.15/0.39 thf(f55,plain,(
% 0.15/0.39 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))) = mor)),
% 0.15/0.39 inference(rectify,[],[f4])).
% 0.15/0.39 thf(f4,axiom,(
% 0.15/0.39 ((^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X3 @ X2) | (X4 @ X2))) = mor)),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor)).
% 0.15/0.39 thf(f113,plain,(
% 0.15/0.39 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.15/0.39 inference(cnf_transformation,[],[f92])).
% 0.15/0.39 thf(f92,plain,(
% 0.15/0.39 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.15/0.39 inference(fool_elimination,[],[f91])).
% 0.15/0.39 thf(f91,plain,(
% 0.15/0.39 (mimplies = (^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)))),
% 0.15/0.39 inference(rectify,[],[f6])).
% 0.15/0.39 thf(f6,axiom,(
% 0.15/0.39 (mimplies = (^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimplies)).
% 0.15/0.39 thf(f111,plain,(
% 0.15/0.39 (mforall_prop = (^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f86])).
% 0.15/0.39 thf(f86,plain,(
% 0.15/0.39 (mforall_prop = (^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))))),
% 0.15/0.39 inference(fool_elimination,[],[f85])).
% 0.15/0.39 thf(f85,plain,(
% 0.15/0.39 ((^[X0 : ($i > $o) > $i > $o, X1 : $i] : (! [X2 : $i > $o] : (X0 @ X2 @ X1))) = mforall_prop)),
% 0.15/0.39 inference(rectify,[],[f11])).
% 0.15/0.39 thf(f11,axiom,(
% 0.15/0.39 ((^[X3 : ($i > $o) > $i > $o, X2 : $i] : (! [X5 : $i > $o] : (X3 @ X5 @ X2))) = mforall_prop)),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mforall_prop)).
% 0.15/0.39 thf(f118,plain,(
% 0.15/0.39 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.15/0.39 inference(cnf_transformation,[],[f84])).
% 0.15/0.39 thf(f84,plain,(
% 0.15/0.39 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.15/0.39 inference(fool_elimination,[],[f83])).
% 0.15/0.39 thf(f83,plain,(
% 0.15/0.39 ((^[X0 : $i > $o] : (! [X1] : (X0 @ X1))) = mvalid)),
% 0.15/0.39 inference(rectify,[],[f28])).
% 0.15/0.39 thf(f28,axiom,(
% 0.15/0.39 ((^[X3 : $i > $o] : (! [X2] : (X3 @ X2))) = mvalid)),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.15/0.39 thf(f116,plain,(
% 0.15/0.39 ($true != (mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ sK0 @ Y0) @ Y0)))))),
% 0.15/0.39 inference(cnf_transformation,[],[f97])).
% 0.15/0.39 thf(f97,plain,(
% 0.15/0.39 ((mreflexive @ sK0) = $true) & ($true != (mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ sK0 @ Y0) @ Y0)))))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f95,f96])).
% 0.15/0.39 thf(f96,plain,(
% 0.15/0.39 ? [X0 : $i > $i > $o] : (((mreflexive @ X0) = $true) & ($true != (mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ X0 @ Y0) @ Y0)))))) => (((mreflexive @ sK0) = $true) & ($true != (mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ sK0 @ Y0) @ Y0))))))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f95,plain,(
% 0.15/0.39 ? [X0 : $i > $i > $o] : (((mreflexive @ X0) = $true) & ($true != (mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ X0 @ Y0) @ Y0))))))),
% 0.15/0.39 inference(ennf_transformation,[],[f94])).
% 0.15/0.39 thf(f94,plain,(
% 0.15/0.39 ~! [X0 : $i > $i > $o] : (((mreflexive @ X0) = $true) => ($true = (mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ X0 @ Y0) @ Y0))))))),
% 0.15/0.39 inference(fool_elimination,[],[f93])).
% 0.15/0.39 thf(f93,plain,(
% 0.15/0.39 ~! [X0 : $i > $i > $o] : ((mreflexive @ X0) => (mvalid @ (mforall_prop @ (^[X1 : $i > $o] : (mimplies @ (mbox @ X0 @ X1) @ X1)))))),
% 0.15/0.39 inference(rectify,[],[f33])).
% 0.15/0.39 thf(f33,negated_conjecture,(
% 0.15/0.39 ~! [X6 : $i > $i > $o] : ((mreflexive @ X6) => (mvalid @ (mforall_prop @ (^[X11 : $i > $o] : (mimplies @ (mbox @ X6 @ X11) @ X11)))))),
% 0.15/0.39 inference(negated_conjecture,[],[f32])).
% 0.15/0.39 thf(f32,conjecture,(
% 0.15/0.39 ! [X6 : $i > $i > $o] : ((mreflexive @ X6) => (mvalid @ (mforall_prop @ (^[X11 : $i > $o] : (mimplies @ (mbox @ X6 @ X11) @ X11)))))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)).
% 0.15/0.39 thf(f156,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (($true = (sK0 @ X1 @ X1))) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f155])).
% 0.15/0.39 thf(f155,plain,(
% 0.15/0.39 ( ! [X1 : $i] : ((((^[Y0 : $i]: (sK0 @ Y0 @ Y0)) @ X1) = $true)) )),
% 0.15/0.39 inference(pi_clausification,[],[f154])).
% 0.15/0.39 thf(f154,plain,(
% 0.15/0.39 ((!! @ $i @ (^[Y0 : $i]: (sK0 @ Y0 @ Y0))) = $true)),
% 0.15/0.39 inference(beta_eta_normalization,[],[f140])).
% 0.15/0.39 thf(f140,plain,(
% 0.15/0.39 (((^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))) @ sK0) = $true)),
% 0.15/0.39 inference(definition_unfolding,[],[f117,f119])).
% 0.15/0.39 thf(f119,plain,(
% 0.15/0.39 (mreflexive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))),
% 0.15/0.39 inference(cnf_transformation,[],[f62])).
% 0.15/0.39 thf(f62,plain,(
% 0.15/0.39 (mreflexive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))),
% 0.15/0.39 inference(fool_elimination,[],[f61])).
% 0.15/0.39 thf(f61,plain,(
% 0.15/0.39 ((^[X0 : $i > $i > $o] : (! [X1] : (X0 @ X1 @ X1))) = mreflexive)),
% 0.15/0.39 inference(rectify,[],[f18])).
% 0.15/0.39 thf(f18,axiom,(
% 0.15/0.39 ((^[X6 : $i > $i > $o] : (! [X8] : (X6 @ X8 @ X8))) = mreflexive)),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mreflexive)).
% 0.15/0.39 thf(f117,plain,(
% 0.15/0.39 ((mreflexive @ sK0) = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f97])).
% 0.15/0.39 thf(f148,plain,(
% 0.15/0.39 ($false = (sK3 @ sK2))),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f146])).
% 0.15/0.39 % SZS output end Proof for theBenchmark
% 0.15/0.39 % (3717)------------------------------
% 0.15/0.39 % (3717)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (3717)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (3717)Memory used [KB]: 5628
% 0.15/0.39 % (3717)Time elapsed: 0.010 s
% 0.15/0.39 % (3717)Instructions burned: 9 (million)
% 0.15/0.39 % (3717)------------------------------
% 0.15/0.39 % (3717)------------------------------
% 0.15/0.39 % (3716)Success in time 0.027 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------