TSTP Solution File: LCL613^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL613^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 : n022.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:11 EDT 2024
% Result : Theorem 0.12s 0.35s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : LCL613^1 : TPTP v8.2.0. Released v3.6.0.
% 0.09/0.12 % 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.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 02:59:08 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 This is a TH0_THM_EQU_NAR problem
% 0.12/0.33 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.12/0.35 % (21481)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.12/0.35 % (21481)First to succeed.
% 0.12/0.35 % (21481)Refutation found. Thanks to Tanya!
% 0.12/0.35 % SZS status Theorem for theBenchmark
% 0.12/0.35 % SZS output start Proof for theBenchmark
% 0.12/0.35 thf(type_def_6, type, individuals: $tType).
% 0.12/0.35 thf(func_def_1, type, prop_a: $i > $o).
% 0.12/0.35 thf(func_def_2, type, prop_b: $i > $o).
% 0.12/0.35 thf(func_def_3, type, prop_c: $i > $o).
% 0.12/0.35 thf(func_def_4, type, mfalse: $i > $o).
% 0.12/0.35 thf(func_def_5, type, mtrue: $i > $o).
% 0.12/0.35 thf(func_def_6, type, mnot: ($i > $o) > $i > $o).
% 0.12/0.35 thf(func_def_8, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.12/0.35 thf(func_def_9, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.12/0.35 thf(func_def_10, type, mimpl: ($i > $o) > ($i > $o) > $i > $o).
% 0.12/0.35 thf(func_def_11, type, miff: ($i > $o) > ($i > $o) > $i > $o).
% 0.12/0.35 thf(func_def_12, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.12/0.35 thf(func_def_13, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.12/0.35 thf(func_def_14, type, individuals: $tType).
% 0.12/0.35 thf(func_def_15, type, mall: (individuals > $i > $o) > $i > $o).
% 0.12/0.35 thf(func_def_16, type, mexists: (individuals > $i > $o) > $i > $o).
% 0.12/0.35 thf(func_def_17, type, mvalid: ($i > $o) > $o).
% 0.12/0.35 thf(func_def_18, type, msatisfiable: ($i > $o) > $o).
% 0.12/0.35 thf(func_def_19, type, mcountersatisfiable: ($i > $o) > $o).
% 0.12/0.35 thf(func_def_20, type, minvalid: ($i > $o) > $o).
% 0.12/0.35 thf(func_def_34, type, sK0: $i > $o).
% 0.12/0.35 thf(func_def_35, type, sK1: $i > $i > $o).
% 0.12/0.35 thf(func_def_36, type, sK2: $i > $o).
% 0.12/0.35 thf(f96,plain,(
% 0.12/0.35 $false),
% 0.12/0.35 inference(trivial_inequality_removal,[],[f94])).
% 0.12/0.35 thf(f94,plain,(
% 0.12/0.35 ($true = $false)),
% 0.12/0.35 inference(superposition,[],[f93,f78])).
% 0.12/0.35 thf(f78,plain,(
% 0.12/0.35 ((sK2 @ sK5) = $false)),
% 0.12/0.35 inference(binary_proxy_clausification,[],[f77])).
% 0.12/0.35 thf(f77,plain,(
% 0.12/0.35 (((sK1 @ sK4 @ sK5) => (sK2 @ sK5)) = $false)),
% 0.12/0.35 inference(beta_eta_normalization,[],[f76])).
% 0.12/0.35 thf(f76,plain,(
% 0.12/0.35 (((^[Y0 : $i]: ((sK1 @ sK4 @ Y0) => (sK2 @ Y0))) @ sK5) = $false)),
% 0.12/0.35 inference(sigma_clausification,[],[f75])).
% 0.12/0.35 thf(f75,plain,(
% 0.12/0.35 ((!! @ $i @ (^[Y0 : $i]: ((sK1 @ sK4 @ Y0) => (sK2 @ Y0)))) = $false)),
% 0.12/0.35 inference(binary_proxy_clausification,[],[f73])).
% 0.12/0.35 thf(f73,plain,(
% 0.12/0.35 (((!! @ $i @ (^[Y0 : $i]: ((sK1 @ sK4 @ Y0) => (sK2 @ Y0)))) | (~ (!! @ $i @ (^[Y0 : $i]: ((sK1 @ sK4 @ Y0) => ((sK2 @ Y0) & (sK0 @ Y0))))))) = $false)),
% 0.12/0.35 inference(beta_eta_normalization,[],[f72])).
% 0.12/0.35 thf(f72,plain,(
% 0.12/0.35 (((^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((sK1 @ Y0 @ Y1) => (sK2 @ Y1)))) | (~ (!! @ $i @ (^[Y1 : $i]: ((sK1 @ Y0 @ Y1) => ((sK2 @ Y1) & (sK0 @ Y1)))))))) @ sK4) = $false)),
% 0.12/0.35 inference(sigma_clausification,[],[f71])).
% 0.12/0.35 thf(f71,plain,(
% 0.12/0.35 ($true != (!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((sK1 @ Y0 @ Y1) => (sK2 @ Y1)))) | (~ (!! @ $i @ (^[Y1 : $i]: ((sK1 @ Y0 @ Y1) => ((sK2 @ Y1) & (sK0 @ Y1))))))))))),
% 0.12/0.35 inference(beta_eta_normalization,[],[f70])).
% 0.12/0.35 thf(f70,plain,(
% 0.12/0.35 (((^[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))))))))) @ sK1 @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) & (Y1 @ Y2))))))) @ sK2 @ sK0)) @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))) @ sK1 @ sK2))) != $true)),
% 0.12/0.35 inference(definition_unfolding,[],[f57,f63,f68,f67,f58,f67])).
% 0.12/0.35 thf(f58,plain,(
% 0.12/0.35 (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) & (Y1 @ Y2))))))))),
% 0.12/0.35 inference(cnf_transformation,[],[f26])).
% 0.12/0.35 thf(f26,plain,(
% 0.12/0.35 (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) & (Y1 @ Y2))))))))),
% 0.12/0.35 inference(fool_elimination,[],[f25])).
% 0.12/0.35 thf(f25,plain,(
% 0.12/0.35 (mand = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X1 @ X2) & (X0 @ X2))))),
% 0.12/0.35 inference(rectify,[],[f5])).
% 0.12/0.35 thf(f5,axiom,(
% 0.12/0.35 (mand = (^[X0 : $i > $o, X2 : $i > $o, X1 : $i] : ((X2 @ X1) & (X0 @ X1))))),
% 0.12/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mand)).
% 0.12/0.35 thf(f67,plain,(
% 0.12/0.35 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))))),
% 0.12/0.35 inference(cnf_transformation,[],[f22])).
% 0.12/0.35 thf(f22,plain,(
% 0.12/0.35 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))))),
% 0.12/0.35 inference(fool_elimination,[],[f21])).
% 0.12/0.35 thf(f21,plain,(
% 0.12/0.35 ((^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i] : (! [X3] : ((X0 @ X2 @ X3) => (X1 @ X3)))) = mbox)),
% 0.12/0.35 inference(rectify,[],[f8])).
% 0.12/0.35 thf(f8,axiom,(
% 0.12/0.35 ((^[X4 : $i > $i > $o, X5 : $i > $o, X0 : $i] : (! [X2] : ((X4 @ X0 @ X2) => (X5 @ X2)))) = mbox)),
% 0.12/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox)).
% 0.12/0.35 thf(f68,plain,(
% 0.12/0.35 (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.12/0.35 inference(definition_unfolding,[],[f60,f52,f54])).
% 0.12/0.35 thf(f54,plain,(
% 0.12/0.35 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.12/0.35 inference(cnf_transformation,[],[f33])).
% 0.12/0.35 thf(f33,plain,(
% 0.12/0.35 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.12/0.35 inference(fool_elimination,[],[f32])).
% 0.12/0.35 thf(f32,plain,(
% 0.12/0.35 (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.12/0.35 inference(rectify,[],[f3])).
% 0.12/0.35 thf(f3,axiom,(
% 0.12/0.35 (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.12/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot)).
% 0.12/0.35 thf(f52,plain,(
% 0.12/0.35 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.12/0.35 inference(cnf_transformation,[],[f24])).
% 0.12/0.35 thf(f24,plain,(
% 0.12/0.35 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.12/0.35 inference(fool_elimination,[],[f23])).
% 0.12/0.35 thf(f23,plain,(
% 0.12/0.35 (mor = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))))),
% 0.12/0.35 inference(rectify,[],[f4])).
% 0.12/0.35 thf(f4,axiom,(
% 0.12/0.35 (mor = (^[X0 : $i > $o, X2 : $i > $o, X1 : $i] : ((X0 @ X1) | (X2 @ X1))))),
% 0.12/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor)).
% 0.12/0.35 thf(f60,plain,(
% 0.12/0.35 (mimpl = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.12/0.35 inference(cnf_transformation,[],[f20])).
% 0.12/0.35 thf(f20,plain,(
% 0.12/0.35 (mimpl = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.12/0.35 inference(fool_elimination,[],[f19])).
% 0.12/0.35 thf(f19,plain,(
% 0.12/0.35 (mimpl = (^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)))),
% 0.12/0.35 inference(rectify,[],[f6])).
% 0.12/0.35 thf(f6,axiom,(
% 0.12/0.35 (mimpl = (^[X1 : $i > $o, X3 : $i > $o] : (mor @ (mnot @ X1) @ X3)))),
% 0.12/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimpl)).
% 0.12/0.35 thf(f63,plain,(
% 0.12/0.35 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.12/0.35 inference(cnf_transformation,[],[f41])).
% 0.12/0.35 thf(f41,plain,(
% 0.12/0.35 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.12/0.35 inference(fool_elimination,[],[f40])).
% 0.12/0.35 thf(f40,plain,(
% 0.12/0.35 (mvalid = (^[X0 : $i > $o] : (! [X1] : (X0 @ X1))))),
% 0.12/0.35 inference(rectify,[],[f12])).
% 0.12/0.35 thf(f12,axiom,(
% 0.12/0.35 (mvalid = (^[X5 : $i > $o] : (! [X6] : (X5 @ X6))))),
% 0.12/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.12/0.35 thf(f57,plain,(
% 0.12/0.35 ($true != (mvalid @ (mimpl @ (mbox @ sK1 @ (mand @ sK2 @ sK0)) @ (mbox @ sK1 @ sK2))))),
% 0.12/0.35 inference(cnf_transformation,[],[f51])).
% 0.12/0.35 thf(f51,plain,(
% 0.12/0.35 ($true != (mvalid @ (mimpl @ (mbox @ sK1 @ (mand @ sK2 @ sK0)) @ (mbox @ sK1 @ sK2))))),
% 0.12/0.35 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f49,f50])).
% 0.12/0.35 thf(f50,plain,(
% 0.12/0.35 ? [X0 : $i > $o,X1 : $i > $i > $o,X2 : $i > $o] : ((mvalid @ (mimpl @ (mbox @ X1 @ (mand @ X2 @ X0)) @ (mbox @ X1 @ X2))) != $true) => ($true != (mvalid @ (mimpl @ (mbox @ sK1 @ (mand @ sK2 @ sK0)) @ (mbox @ sK1 @ sK2))))),
% 0.12/0.35 introduced(choice_axiom,[])).
% 0.12/0.35 thf(f49,plain,(
% 0.12/0.35 ? [X0 : $i > $o,X1 : $i > $i > $o,X2 : $i > $o] : ((mvalid @ (mimpl @ (mbox @ X1 @ (mand @ X2 @ X0)) @ (mbox @ X1 @ X2))) != $true)),
% 0.12/0.35 inference(ennf_transformation,[],[f29])).
% 0.12/0.35 thf(f29,plain,(
% 0.12/0.35 ~! [X0 : $i > $o,X1 : $i > $i > $o,X2 : $i > $o] : ((mvalid @ (mimpl @ (mbox @ X1 @ (mand @ X2 @ X0)) @ (mbox @ X1 @ X2))) = $true)),
% 0.12/0.35 inference(fool_elimination,[],[f28])).
% 0.12/0.35 thf(f28,plain,(
% 0.12/0.35 ~! [X0 : $i > $o,X1 : $i > $i > $o,X2 : $i > $o] : (mvalid @ (mimpl @ (mbox @ X1 @ (mand @ X2 @ X0)) @ (mbox @ X1 @ X2)))),
% 0.12/0.35 inference(rectify,[],[f17])).
% 0.12/0.35 thf(f17,negated_conjecture,(
% 0.12/0.35 ~! [X2 : $i > $o,X4 : $i > $i > $o,X0 : $i > $o] : (mvalid @ (mimpl @ (mbox @ X4 @ (mand @ X0 @ X2)) @ (mbox @ X4 @ X0)))),
% 0.12/0.35 inference(negated_conjecture,[],[f16])).
% 0.12/0.35 thf(f16,conjecture,(
% 0.12/0.35 ! [X2 : $i > $o,X4 : $i > $i > $o,X0 : $i > $o] : (mvalid @ (mimpl @ (mbox @ X4 @ (mand @ X0 @ X2)) @ (mbox @ X4 @ X0)))),
% 0.12/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm)).
% 0.12/0.35 thf(f93,plain,(
% 0.12/0.35 ($true = (sK2 @ sK5))),
% 0.12/0.35 inference(trivial_inequality_removal,[],[f91])).
% 0.12/0.35 thf(f91,plain,(
% 0.12/0.35 ($true = $false) | ($true = (sK2 @ sK5))),
% 0.12/0.35 inference(superposition,[],[f79,f85])).
% 0.12/0.35 thf(f85,plain,(
% 0.12/0.35 ( ! [X1 : $i] : (((sK1 @ sK4 @ X1) = $false) | ((sK2 @ X1) = $true)) )),
% 0.12/0.35 inference(binary_proxy_clausification,[],[f83])).
% 0.12/0.35 thf(f83,plain,(
% 0.12/0.35 ( ! [X1 : $i] : (($true = ((sK2 @ X1) & (sK0 @ X1))) | ((sK1 @ sK4 @ X1) = $false)) )),
% 0.12/0.35 inference(binary_proxy_clausification,[],[f82])).
% 0.12/0.35 thf(f82,plain,(
% 0.12/0.35 ( ! [X1 : $i] : (($true = ((sK1 @ sK4 @ X1) => ((sK2 @ X1) & (sK0 @ X1))))) )),
% 0.12/0.35 inference(beta_eta_normalization,[],[f81])).
% 0.12/0.35 thf(f81,plain,(
% 0.12/0.35 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((sK1 @ sK4 @ Y0) => ((sK2 @ Y0) & (sK0 @ Y0)))) @ X1) = $true)) )),
% 0.12/0.35 inference(pi_clausification,[],[f80])).
% 0.12/0.35 thf(f80,plain,(
% 0.12/0.35 ((!! @ $i @ (^[Y0 : $i]: ((sK1 @ sK4 @ Y0) => ((sK2 @ Y0) & (sK0 @ Y0))))) = $true)),
% 0.12/0.35 inference(not_proxy_clausification,[],[f74])).
% 0.12/0.35 thf(f74,plain,(
% 0.12/0.35 ((~ (!! @ $i @ (^[Y0 : $i]: ((sK1 @ sK4 @ Y0) => ((sK2 @ Y0) & (sK0 @ Y0)))))) = $false)),
% 0.12/0.35 inference(binary_proxy_clausification,[],[f73])).
% 0.12/0.35 thf(f79,plain,(
% 0.12/0.35 ((sK1 @ sK4 @ sK5) = $true)),
% 0.12/0.35 inference(binary_proxy_clausification,[],[f77])).
% 0.12/0.35 % SZS output end Proof for theBenchmark
% 0.12/0.35 % (21481)------------------------------
% 0.12/0.35 % (21481)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (21481)Termination reason: Refutation
% 0.12/0.35
% 0.12/0.35 % (21481)Memory used [KB]: 5500
% 0.12/0.35 % (21481)Time elapsed: 0.005 s
% 0.12/0.35 % (21481)Instructions burned: 4 (million)
% 0.12/0.35 % (21481)------------------------------
% 0.12/0.35 % (21481)------------------------------
% 0.12/0.35 % (21478)Success in time 0.007 s
% 0.12/0.35 % Vampire---4.8 exiting
%------------------------------------------------------------------------------