TSTP Solution File: LCL592^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL592^1 : TPTP v8.2.0. Released v3.6.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 : n007.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:16:06 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.12/0.13 % Problem : LCL592^1 : TPTP v8.2.0. Released v3.6.0.
% 0.12/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.35 % Computer : n007.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 02:13:23 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 % (2948)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.38 % (2954)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 % (2954)First to succeed.
% 0.15/0.39 % (2952)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 % (2949)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 % (2952)Instruction limit reached!
% 0.15/0.39 % (2952)------------------------------
% 0.15/0.39 % (2952)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (2952)Termination reason: Unknown
% 0.15/0.39 % (2952)Termination phase: Property scanning
% 0.15/0.39
% 0.15/0.39 % (2952)Memory used [KB]: 1023
% 0.15/0.39 % (2952)Time elapsed: 0.004 s
% 0.15/0.39 % (2952)Instructions burned: 3 (million)
% 0.15/0.39 % (2952)------------------------------
% 0.15/0.39 % (2952)------------------------------
% 0.15/0.39 % (2949)Instruction limit reached!
% 0.15/0.39 % (2949)------------------------------
% 0.15/0.39 % (2949)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (2949)Termination reason: Unknown
% 0.15/0.39 % (2949)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (2949)Memory used [KB]: 5500
% 0.15/0.39 % (2949)Time elapsed: 0.003 s
% 0.15/0.39 % (2949)Instructions burned: 4 (million)
% 0.15/0.39 % (2949)------------------------------
% 0.15/0.39 % (2949)------------------------------
% 0.15/0.39 % (2950)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 % (2953)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 % (2951)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.39 % (2955)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 % (2954)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_6, type, individuals: $tType).
% 0.15/0.39 thf(func_def_1, type, prop_a: $i > $o).
% 0.15/0.39 thf(func_def_2, type, prop_b: $i > $o).
% 0.15/0.39 thf(func_def_3, type, prop_c: $i > $o).
% 0.15/0.39 thf(func_def_4, type, mfalse: $i > $o).
% 0.15/0.39 thf(func_def_5, type, mtrue: $i > $o).
% 0.15/0.39 thf(func_def_6, type, mnot: ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_8, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_9, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_10, type, mimpl: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_11, type, miff: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_12, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_13, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_14, type, individuals: $tType).
% 0.15/0.39 thf(func_def_15, type, mall: (individuals > $i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_16, type, mexists: (individuals > $i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_17, type, mvalid: ($i > $o) > $o).
% 0.15/0.39 thf(func_def_18, type, msatisfiable: ($i > $o) > $o).
% 0.15/0.39 thf(func_def_19, type, mcountersatisfiable: ($i > $o) > $o).
% 0.15/0.39 thf(func_def_20, type, minvalid: ($i > $o) > $o).
% 0.15/0.39 thf(func_def_34, type, sK0: $i > $i > $o).
% 0.15/0.39 thf(func_def_35, type, sK1: $i > $o).
% 0.15/0.39 thf(func_def_36, type, sK2: $i > $o).
% 0.15/0.39 thf(f103,plain,(
% 0.15/0.39 $false),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f102])).
% 0.15/0.39 thf(f102,plain,(
% 0.15/0.39 ($true = $false)),
% 0.15/0.39 inference(forward_demodulation,[],[f101,f97])).
% 0.15/0.39 thf(f97,plain,(
% 0.15/0.39 ((sK1 @ sK5) = $false)),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f96])).
% 0.15/0.39 thf(f96,plain,(
% 0.15/0.39 ($true = $false) | ((sK1 @ sK5) = $false)),
% 0.15/0.39 inference(forward_demodulation,[],[f95,f80])).
% 0.15/0.39 thf(f80,plain,(
% 0.15/0.39 ((sK2 @ sK5) = $false)),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f79])).
% 0.15/0.39 thf(f79,plain,(
% 0.15/0.39 (((sK0 @ sK4 @ sK5) => (sK2 @ sK5)) = $false)),
% 0.15/0.39 inference(beta_eta_normalization,[],[f78])).
% 0.15/0.39 thf(f78,plain,(
% 0.15/0.39 (((^[Y0 : $i]: ((sK0 @ sK4 @ Y0) => (sK2 @ Y0))) @ sK5) = $false)),
% 0.15/0.39 inference(sigma_clausification,[],[f77])).
% 0.15/0.39 thf(f77,plain,(
% 0.15/0.39 ((!! @ $i @ (^[Y0 : $i]: ((sK0 @ sK4 @ Y0) => (sK2 @ Y0)))) = $false)),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f75])).
% 0.15/0.39 thf(f75,plain,(
% 0.15/0.39 (((!! @ $i @ (^[Y0 : $i]: ((sK0 @ sK4 @ Y0) => (sK2 @ Y0)))) | (~ (!! @ $i @ (^[Y0 : $i]: ((sK0 @ sK4 @ Y0) => (sK1 @ Y0)))))) = $false)),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f73])).
% 0.15/0.39 thf(f73,plain,(
% 0.15/0.39 ((((!! @ $i @ (^[Y0 : $i]: ((sK0 @ sK4 @ Y0) => (sK2 @ Y0)))) | (~ (!! @ $i @ (^[Y0 : $i]: ((sK0 @ sK4 @ Y0) => (sK1 @ Y0)))))) | (~ (!! @ $i @ (^[Y0 : $i]: ((sK0 @ sK4 @ Y0) => ((sK2 @ Y0) | (~ (sK1 @ Y0)))))))) = $false)),
% 0.15/0.39 inference(beta_eta_normalization,[],[f72])).
% 0.15/0.39 thf(f72,plain,(
% 0.15/0.39 (((^[Y0 : $i]: (((!! @ $i @ (^[Y1 : $i]: ((sK0 @ Y0 @ Y1) => (sK2 @ Y1)))) | (~ (!! @ $i @ (^[Y1 : $i]: ((sK0 @ Y0 @ Y1) => (sK1 @ Y1)))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((sK0 @ Y0 @ Y1) => ((sK2 @ Y1) | (~ (sK1 @ Y1))))))))) @ sK4) = $false)),
% 0.15/0.39 inference(sigma_clausification,[],[f71])).
% 0.15/0.39 thf(f71,plain,(
% 0.15/0.39 ($true != (!! @ $i @ (^[Y0 : $i]: (((!! @ $i @ (^[Y1 : $i]: ((sK0 @ Y0 @ Y1) => (sK2 @ Y1)))) | (~ (!! @ $i @ (^[Y1 : $i]: ((sK0 @ Y0 @ Y1) => (sK1 @ Y1)))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((sK0 @ Y0 @ Y1) => ((sK2 @ Y1) | (~ (sK1 @ Y1)))))))))))),
% 0.15/0.39 inference(beta_eta_normalization,[],[f70])).
% 0.15/0.39 thf(f70,plain,(
% 0.15/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]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))) @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))) @ sK0 @ ((^[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)))) @ sK1 @ sK2)) @ ((^[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 > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))) @ sK0 @ sK1) @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))) @ sK0 @ sK2)))))),
% 0.15/0.39 inference(definition_unfolding,[],[f59,f56,f68,f66,f68,f68,f66,f66])).
% 0.15/0.39 thf(f66,plain,(
% 0.15/0.39 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f46])).
% 0.15/0.39 thf(f46,plain,(
% 0.15/0.39 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))))),
% 0.15/0.39 inference(fool_elimination,[],[f45])).
% 0.15/0.39 thf(f45,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,[],[f8])).
% 0.15/0.39 thf(f8,axiom,(
% 0.15/0.39 ((^[X4 : $i > $i > $o, X5 : $i > $o, X0 : $i] : (! [X2] : ((X4 @ X0 @ X2) => (X5 @ X2)))) = mbox)),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox)).
% 0.15/0.39 thf(f68,plain,(
% 0.15/0.39 (mimpl = (^[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,[],[f53,f65,f62])).
% 0.15/0.39 thf(f62,plain,(
% 0.15/0.39 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f48])).
% 0.15/0.39 thf(f48,plain,(
% 0.15/0.39 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.15/0.39 inference(fool_elimination,[],[f47])).
% 0.15/0.39 thf(f47,plain,(
% 0.15/0.39 (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.15/0.39 inference(rectify,[],[f3])).
% 0.15/0.39 thf(f3,axiom,(
% 0.15/0.39 (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot)).
% 0.15/0.39 thf(f65,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,[],[f23])).
% 0.15/0.39 thf(f23,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,[],[f22])).
% 0.15/0.39 thf(f22,plain,(
% 0.15/0.39 (mor = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))))),
% 0.15/0.39 inference(rectify,[],[f4])).
% 0.15/0.39 thf(f4,axiom,(
% 0.15/0.39 (mor = (^[X0 : $i > $o, X2 : $i > $o, X1 : $i] : ((X0 @ X1) | (X2 @ X1))))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor)).
% 0.15/0.39 thf(f53,plain,(
% 0.15/0.39 (mimpl = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.15/0.39 inference(cnf_transformation,[],[f33])).
% 0.15/0.39 thf(f33,plain,(
% 0.15/0.39 (mimpl = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.15/0.39 inference(fool_elimination,[],[f32])).
% 0.15/0.39 thf(f32,plain,(
% 0.15/0.39 ((^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)) = mimpl)),
% 0.15/0.39 inference(rectify,[],[f6])).
% 0.15/0.39 thf(f6,axiom,(
% 0.15/0.39 ((^[X1 : $i > $o, X3 : $i > $o] : (mor @ (mnot @ X1) @ X3)) = mimpl)),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimpl)).
% 0.15/0.39 thf(f56,plain,(
% 0.15/0.39 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.15/0.39 inference(cnf_transformation,[],[f35])).
% 0.15/0.39 thf(f35,plain,(
% 0.15/0.39 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.15/0.39 inference(fool_elimination,[],[f34])).
% 0.15/0.39 thf(f34,plain,(
% 0.15/0.39 (mvalid = (^[X0 : $i > $o] : (! [X1] : (X0 @ X1))))),
% 0.15/0.39 inference(rectify,[],[f12])).
% 0.15/0.39 thf(f12,axiom,(
% 0.15/0.39 (mvalid = (^[X5 : $i > $o] : (! [X6] : (X5 @ X6))))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.15/0.39 thf(f59,plain,(
% 0.15/0.39 ($true != (mvalid @ (mimpl @ (mbox @ sK0 @ (mimpl @ sK1 @ sK2)) @ (mimpl @ (mbox @ sK0 @ sK1) @ (mbox @ sK0 @ sK2)))))),
% 0.15/0.39 inference(cnf_transformation,[],[f51])).
% 0.15/0.39 thf(f51,plain,(
% 0.15/0.39 ($true != (mvalid @ (mimpl @ (mbox @ sK0 @ (mimpl @ sK1 @ sK2)) @ (mimpl @ (mbox @ sK0 @ sK1) @ (mbox @ sK0 @ sK2)))))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f49,f50])).
% 0.15/0.39 thf(f50,plain,(
% 0.15/0.39 ? [X0 : $i > $i > $o,X1 : $i > $o,X2 : $i > $o] : ($true != (mvalid @ (mimpl @ (mbox @ X0 @ (mimpl @ X1 @ X2)) @ (mimpl @ (mbox @ X0 @ X1) @ (mbox @ X0 @ X2))))) => ($true != (mvalid @ (mimpl @ (mbox @ sK0 @ (mimpl @ sK1 @ sK2)) @ (mimpl @ (mbox @ sK0 @ sK1) @ (mbox @ sK0 @ sK2)))))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f49,plain,(
% 0.15/0.39 ? [X0 : $i > $i > $o,X1 : $i > $o,X2 : $i > $o] : ($true != (mvalid @ (mimpl @ (mbox @ X0 @ (mimpl @ X1 @ X2)) @ (mimpl @ (mbox @ X0 @ X1) @ (mbox @ X0 @ X2)))))),
% 0.15/0.39 inference(ennf_transformation,[],[f41])).
% 0.15/0.39 thf(f41,plain,(
% 0.15/0.39 ~! [X0 : $i > $i > $o,X1 : $i > $o,X2 : $i > $o] : ($true = (mvalid @ (mimpl @ (mbox @ X0 @ (mimpl @ X1 @ X2)) @ (mimpl @ (mbox @ X0 @ X1) @ (mbox @ X0 @ X2)))))),
% 0.15/0.39 inference(fool_elimination,[],[f40])).
% 0.15/0.39 thf(f40,plain,(
% 0.15/0.39 ~! [X0 : $i > $i > $o,X1 : $i > $o,X2 : $i > $o] : (mvalid @ (mimpl @ (mbox @ X0 @ (mimpl @ X1 @ X2)) @ (mimpl @ (mbox @ X0 @ X1) @ (mbox @ X0 @ X2))))),
% 0.15/0.39 inference(rectify,[],[f17])).
% 0.15/0.39 thf(f17,negated_conjecture,(
% 0.15/0.39 ~! [X4 : $i > $i > $o,X7 : $i > $o,X8 : $i > $o] : (mvalid @ (mimpl @ (mbox @ X4 @ (mimpl @ X7 @ X8)) @ (mimpl @ (mbox @ X4 @ X7) @ (mbox @ X4 @ X8))))),
% 0.15/0.39 inference(negated_conjecture,[],[f16])).
% 0.15/0.39 thf(f16,conjecture,(
% 0.15/0.39 ! [X4 : $i > $i > $o,X7 : $i > $o,X8 : $i > $o] : (mvalid @ (mimpl @ (mbox @ X4 @ (mimpl @ X7 @ X8)) @ (mimpl @ (mbox @ X4 @ X7) @ (mbox @ X4 @ X8))))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm)).
% 0.15/0.39 thf(f95,plain,(
% 0.15/0.39 ((sK1 @ sK5) = $false) | ($true = (sK2 @ sK5))),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f93])).
% 0.15/0.39 thf(f93,plain,(
% 0.15/0.39 ((sK1 @ sK5) = $false) | ($true = (sK2 @ sK5)) | ($true = $false)),
% 0.15/0.39 inference(superposition,[],[f91,f81])).
% 0.15/0.39 thf(f81,plain,(
% 0.15/0.39 ($true = (sK0 @ sK4 @ sK5))),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f79])).
% 0.15/0.39 thf(f91,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (((sK0 @ sK4 @ X1) = $false) | ($true = (sK2 @ X1)) | ((sK1 @ X1) = $false)) )),
% 0.15/0.39 inference(not_proxy_clausification,[],[f90])).
% 0.15/0.39 thf(f90,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (((sK0 @ sK4 @ X1) = $false) | ($true = (~ (sK1 @ X1))) | ($true = (sK2 @ X1))) )),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f89])).
% 0.15/0.39 thf(f89,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (((sK0 @ sK4 @ X1) = $false) | (((sK2 @ X1) | (~ (sK1 @ X1))) = $true)) )),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f88])).
% 0.15/0.39 thf(f88,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (($true = ((sK0 @ sK4 @ X1) => ((sK2 @ X1) | (~ (sK1 @ X1)))))) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f87])).
% 0.15/0.39 thf(f87,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ((sK0 @ sK4 @ Y0) => ((sK2 @ Y0) | (~ (sK1 @ Y0))))) @ X1))) )),
% 0.15/0.39 inference(pi_clausification,[],[f86])).
% 0.15/0.39 thf(f86,plain,(
% 0.15/0.39 ($true = (!! @ $i @ (^[Y0 : $i]: ((sK0 @ sK4 @ Y0) => ((sK2 @ Y0) | (~ (sK1 @ Y0)))))))),
% 0.15/0.39 inference(not_proxy_clausification,[],[f74])).
% 0.15/0.39 thf(f74,plain,(
% 0.15/0.39 ($false = (~ (!! @ $i @ (^[Y0 : $i]: ((sK0 @ sK4 @ Y0) => ((sK2 @ Y0) | (~ (sK1 @ Y0))))))))),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f73])).
% 0.15/0.39 thf(f101,plain,(
% 0.15/0.39 ($true = (sK1 @ sK5))),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f99])).
% 0.15/0.39 thf(f99,plain,(
% 0.15/0.39 ($true = $false) | ($true = (sK1 @ sK5))),
% 0.15/0.39 inference(superposition,[],[f81,f85])).
% 0.15/0.39 thf(f85,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (((sK0 @ sK4 @ X1) = $false) | ($true = (sK1 @ X1))) )),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f84])).
% 0.15/0.39 thf(f84,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (($true = ((sK0 @ sK4 @ X1) => (sK1 @ X1)))) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f83])).
% 0.15/0.39 thf(f83,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ((sK0 @ sK4 @ Y0) => (sK1 @ Y0))) @ X1))) )),
% 0.15/0.39 inference(pi_clausification,[],[f82])).
% 0.15/0.39 thf(f82,plain,(
% 0.15/0.39 ($true = (!! @ $i @ (^[Y0 : $i]: ((sK0 @ sK4 @ Y0) => (sK1 @ Y0)))))),
% 0.15/0.39 inference(not_proxy_clausification,[],[f76])).
% 0.15/0.39 thf(f76,plain,(
% 0.15/0.39 ((~ (!! @ $i @ (^[Y0 : $i]: ((sK0 @ sK4 @ Y0) => (sK1 @ Y0))))) = $false)),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f75])).
% 0.15/0.39 % SZS output end Proof for theBenchmark
% 0.15/0.39 % (2954)------------------------------
% 0.15/0.39 % (2954)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (2954)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (2954)Memory used [KB]: 5500
% 0.15/0.39 % (2954)Time elapsed: 0.011 s
% 0.15/0.39 % (2954)Instructions burned: 7 (million)
% 0.15/0.39 % (2954)------------------------------
% 0.15/0.39 % (2954)------------------------------
% 0.15/0.39 % (2946)Success in time 0.026 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------