TSTP Solution File: LCL608^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL608^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n012.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:10 EDT 2024
% Result : Theorem 0.23s 0.42s
% Output : Refutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : LCL608^1 : TPTP v8.2.0. Released v3.6.0.
% 0.07/0.16 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.38 % Computer : n012.cluster.edu
% 0.14/0.38 % Model : x86_64 x86_64
% 0.14/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38 % Memory : 8042.1875MB
% 0.14/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.38 % CPULimit : 300
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Mon May 20 00:32:22 EDT 2024
% 0.14/0.38 % CPUTime :
% 0.14/0.38 This is a TH0_THM_EQU_NAR problem
% 0.14/0.38 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/sandbox/benchmark/theBenchmark.p
% 0.23/0.40 % (19287)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.23/0.40 % (19293)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.23/0.41 % (19287)Instruction limit reached!
% 0.23/0.41 % (19287)------------------------------
% 0.23/0.41 % (19287)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.41 % (19287)Termination reason: Unknown
% 0.23/0.41 % (19287)Termination phase: Saturation
% 0.23/0.41
% 0.23/0.41 % (19287)Memory used [KB]: 5500
% 0.23/0.41 % (19287)Time elapsed: 0.005 s
% 0.23/0.41 % (19287)Instructions burned: 4 (million)
% 0.23/0.41 % (19287)------------------------------
% 0.23/0.41 % (19287)------------------------------
% 0.23/0.41 % (19293)Instruction limit reached!
% 0.23/0.41 % (19293)------------------------------
% 0.23/0.41 % (19293)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.41 % (19293)Termination reason: Unknown
% 0.23/0.41 % (19293)Termination phase: Function definition elimination
% 0.23/0.41
% 0.23/0.41 % (19293)Memory used [KB]: 1023
% 0.23/0.41 % (19293)Time elapsed: 0.003 s
% 0.23/0.41 % (19293)Instructions burned: 3 (million)
% 0.23/0.41 % (19293)------------------------------
% 0.23/0.41 % (19293)------------------------------
% 0.23/0.41 % (19290)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.23/0.41 % (19290)Instruction limit reached!
% 0.23/0.41 % (19290)------------------------------
% 0.23/0.41 % (19290)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.41 % (19290)Termination reason: Unknown
% 0.23/0.41 % (19290)Termination phase: Property scanning
% 0.23/0.41
% 0.23/0.41 % (19290)Memory used [KB]: 1023
% 0.23/0.41 % (19290)Time elapsed: 0.003 s
% 0.23/0.41 % (19290)Instructions burned: 2 (million)
% 0.23/0.41 % (19290)------------------------------
% 0.23/0.41 % (19290)------------------------------
% 0.23/0.41 % (19291)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.23/0.41 % (19286)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.23/0.41 % (19291)Refutation not found, incomplete strategy
% 0.23/0.41 % (19291)------------------------------
% 0.23/0.41 % (19291)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.41 % (19291)Termination reason: Refutation not found, incomplete strategy
% 0.23/0.41
% 0.23/0.41
% 0.23/0.41 % (19291)Memory used [KB]: 5500
% 0.23/0.41 % (19291)Time elapsed: 0.004 s
% 0.23/0.41 % (19291)Instructions burned: 3 (million)
% 0.23/0.41 % (19291)------------------------------
% 0.23/0.41 % (19291)------------------------------
% 0.23/0.41 % (19289)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.23/0.42 % (19286)First to succeed.
% 0.23/0.42 % (19289)Instruction limit reached!
% 0.23/0.42 % (19289)------------------------------
% 0.23/0.42 % (19289)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.42 % (19289)Termination reason: Unknown
% 0.23/0.42 % (19289)Termination phase: Property scanning
% 0.23/0.42
% 0.23/0.42 % (19289)Memory used [KB]: 1023
% 0.23/0.42 % (19289)Time elapsed: 0.003 s
% 0.23/0.42 % (19289)Instructions burned: 3 (million)
% 0.23/0.42 % (19289)------------------------------
% 0.23/0.42 % (19289)------------------------------
% 0.23/0.42 % (19292)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.23/0.42 % (19286)Refutation found. Thanks to Tanya!
% 0.23/0.42 % SZS status Theorem for theBenchmark
% 0.23/0.42 % SZS output start Proof for theBenchmark
% 0.23/0.42 thf(type_def_6, type, individuals: $tType).
% 0.23/0.42 thf(func_def_1, type, prop_a: $i > $o).
% 0.23/0.42 thf(func_def_2, type, prop_b: $i > $o).
% 0.23/0.42 thf(func_def_3, type, prop_c: $i > $o).
% 0.23/0.42 thf(func_def_4, type, mfalse: $i > $o).
% 0.23/0.42 thf(func_def_5, type, mtrue: $i > $o).
% 0.23/0.42 thf(func_def_6, type, mnot: ($i > $o) > $i > $o).
% 0.23/0.42 thf(func_def_8, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.23/0.42 thf(func_def_9, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.23/0.42 thf(func_def_10, type, mimpl: ($i > $o) > ($i > $o) > $i > $o).
% 0.23/0.42 thf(func_def_11, type, miff: ($i > $o) > ($i > $o) > $i > $o).
% 0.23/0.42 thf(func_def_12, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.23/0.42 thf(func_def_13, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.23/0.42 thf(func_def_14, type, individuals: $tType).
% 0.23/0.42 thf(func_def_15, type, mall: (individuals > $i > $o) > $i > $o).
% 0.23/0.42 thf(func_def_16, type, mexists: (individuals > $i > $o) > $i > $o).
% 0.23/0.42 thf(func_def_17, type, mvalid: ($i > $o) > $o).
% 0.23/0.42 thf(func_def_18, type, msatisfiable: ($i > $o) > $o).
% 0.23/0.42 thf(func_def_19, type, mcountersatisfiable: ($i > $o) > $o).
% 0.23/0.42 thf(func_def_20, type, minvalid: ($i > $o) > $o).
% 0.23/0.42 thf(func_def_34, type, sK0: $i > $o).
% 0.23/0.42 thf(func_def_35, type, sK1: $i > $o).
% 0.23/0.42 thf(f91,plain,(
% 0.23/0.42 $false),
% 0.23/0.42 inference(trivial_inequality_removal,[],[f90])).
% 0.23/0.42 thf(f90,plain,(
% 0.23/0.42 ($true = $false)),
% 0.23/0.42 inference(superposition,[],[f84,f88])).
% 0.23/0.42 thf(f88,plain,(
% 0.23/0.42 ((sK0 @ sK3) = $false)),
% 0.23/0.42 inference(trivial_inequality_removal,[],[f86])).
% 0.23/0.42 thf(f86,plain,(
% 0.23/0.42 ($true = $false) | ((sK0 @ sK3) = $false)),
% 0.23/0.42 inference(superposition,[],[f82,f80])).
% 0.23/0.42 thf(f80,plain,(
% 0.23/0.42 ( ! [X1 : $i] : (($true = (sK1 @ X1)) | ((sK0 @ X1) = $false)) )),
% 0.23/0.42 inference(not_proxy_clausification,[],[f79])).
% 0.23/0.42 thf(f79,plain,(
% 0.23/0.42 ( ! [X1 : $i] : (($true = (sK1 @ X1)) | ($true = (~ (sK0 @ X1)))) )),
% 0.23/0.42 inference(binary_proxy_clausification,[],[f78])).
% 0.23/0.42 thf(f78,plain,(
% 0.23/0.42 ( ! [X1 : $i] : ((((~ (sK0 @ X1)) | (sK1 @ X1)) = $true)) )),
% 0.23/0.42 inference(beta_eta_normalization,[],[f77])).
% 0.23/0.42 thf(f77,plain,(
% 0.23/0.42 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((~ (sK0 @ Y0)) | (sK1 @ Y0))) @ X1) = $true)) )),
% 0.23/0.42 inference(pi_clausification,[],[f76])).
% 0.23/0.42 thf(f76,plain,(
% 0.23/0.42 ((!! @ $i @ (^[Y0 : $i]: ((~ (sK0 @ Y0)) | (sK1 @ Y0)))) = $true)),
% 0.23/0.42 inference(beta_eta_normalization,[],[f75])).
% 0.23/0.42 thf(f75,plain,(
% 0.23/0.42 ($true = ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y2 @ Y4) | (Y3 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))) @ sK0 @ sK1)))),
% 0.23/0.42 inference(definition_unfolding,[],[f57,f64,f71])).
% 0.23/0.42 thf(f71,plain,(
% 0.23/0.42 (mimpl = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y2 @ Y4) | (Y3 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))))),
% 0.23/0.42 inference(definition_unfolding,[],[f61,f66,f54])).
% 0.23/0.42 thf(f54,plain,(
% 0.23/0.42 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.23/0.42 inference(cnf_transformation,[],[f48])).
% 0.23/0.42 thf(f48,plain,(
% 0.23/0.42 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.23/0.42 inference(fool_elimination,[],[f47])).
% 0.23/0.42 thf(f47,plain,(
% 0.23/0.42 (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.23/0.42 inference(rectify,[],[f3])).
% 0.23/0.42 thf(f3,axiom,(
% 0.23/0.42 (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.23/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mnot)).
% 0.23/0.42 thf(f66,plain,(
% 0.23/0.42 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.23/0.42 inference(cnf_transformation,[],[f20])).
% 0.23/0.42 thf(f20,plain,(
% 0.23/0.42 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.23/0.42 inference(fool_elimination,[],[f19])).
% 0.23/0.42 thf(f19,plain,(
% 0.23/0.42 (mor = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X1 @ X2) | (X0 @ X2))))),
% 0.23/0.42 inference(rectify,[],[f4])).
% 0.23/0.42 thf(f4,axiom,(
% 0.23/0.42 (mor = (^[X0 : $i > $o, X2 : $i > $o, X1 : $i] : ((X2 @ X1) | (X0 @ X1))))),
% 0.23/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mor)).
% 0.23/0.42 thf(f61,plain,(
% 0.23/0.42 (mimpl = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.23/0.42 inference(cnf_transformation,[],[f37])).
% 0.23/0.42 thf(f37,plain,(
% 0.23/0.42 (mimpl = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.23/0.42 inference(fool_elimination,[],[f36])).
% 0.23/0.42 thf(f36,plain,(
% 0.23/0.42 ((^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)) = mimpl)),
% 0.23/0.42 inference(rectify,[],[f6])).
% 0.23/0.42 thf(f6,axiom,(
% 0.23/0.42 ((^[X1 : $i > $o, X3 : $i > $o] : (mor @ (mnot @ X1) @ X3)) = mimpl)),
% 0.23/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mimpl)).
% 0.23/0.42 thf(f64,plain,(
% 0.23/0.42 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.23/0.42 inference(cnf_transformation,[],[f39])).
% 0.23/0.42 thf(f39,plain,(
% 0.23/0.42 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.23/0.42 inference(fool_elimination,[],[f38])).
% 0.23/0.42 thf(f38,plain,(
% 0.23/0.42 (mvalid = (^[X0 : $i > $o] : (! [X1] : (X0 @ X1))))),
% 0.23/0.42 inference(rectify,[],[f12])).
% 0.23/0.42 thf(f12,axiom,(
% 0.23/0.42 (mvalid = (^[X5 : $i > $o] : (! [X6] : (X5 @ X6))))),
% 0.23/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mvalid)).
% 0.23/0.42 thf(f57,plain,(
% 0.23/0.42 ($true = (mvalid @ (mimpl @ sK0 @ sK1)))),
% 0.23/0.42 inference(cnf_transformation,[],[f52])).
% 0.23/0.42 thf(f52,plain,(
% 0.23/0.42 ((mvalid @ sK0) = $true) & ($true != (mvalid @ sK1)) & ($true = (mvalid @ (mimpl @ sK0 @ sK1)))),
% 0.23/0.42 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f50,f51])).
% 0.23/0.42 thf(f51,plain,(
% 0.23/0.42 ? [X0 : $i > $o,X1 : $i > $o] : (($true = (mvalid @ X0)) & ($true != (mvalid @ X1)) & ((mvalid @ (mimpl @ X0 @ X1)) = $true)) => (((mvalid @ sK0) = $true) & ($true != (mvalid @ sK1)) & ($true = (mvalid @ (mimpl @ sK0 @ sK1))))),
% 0.23/0.42 introduced(choice_axiom,[])).
% 0.23/0.42 thf(f50,plain,(
% 0.23/0.42 ? [X0 : $i > $o,X1 : $i > $o] : (($true = (mvalid @ X0)) & ($true != (mvalid @ X1)) & ((mvalid @ (mimpl @ X0 @ X1)) = $true))),
% 0.23/0.42 inference(flattening,[],[f49])).
% 0.23/0.42 thf(f49,plain,(
% 0.23/0.42 ? [X0 : $i > $o,X1 : $i > $o] : (($true != (mvalid @ X1)) & (((mvalid @ (mimpl @ X0 @ X1)) = $true) & ($true = (mvalid @ X0))))),
% 0.23/0.42 inference(ennf_transformation,[],[f22])).
% 0.23/0.42 thf(f22,plain,(
% 0.23/0.42 ~! [X0 : $i > $o,X1 : $i > $o] : ((((mvalid @ (mimpl @ X0 @ X1)) = $true) & ($true = (mvalid @ X0))) => ($true = (mvalid @ X1)))),
% 0.23/0.42 inference(fool_elimination,[],[f21])).
% 0.23/0.42 thf(f21,plain,(
% 0.23/0.42 ~! [X0 : $i > $o,X1 : $i > $o] : (((mvalid @ (mimpl @ X0 @ X1)) & (mvalid @ X0)) => (mvalid @ X1))),
% 0.23/0.42 inference(rectify,[],[f17])).
% 0.23/0.42 thf(f17,negated_conjecture,(
% 0.23/0.42 ~! [X7 : $i > $o,X8 : $i > $o] : (((mvalid @ (mimpl @ X7 @ X8)) & (mvalid @ X7)) => (mvalid @ X8))),
% 0.23/0.42 inference(negated_conjecture,[],[f16])).
% 0.23/0.42 thf(f16,conjecture,(
% 0.23/0.42 ! [X7 : $i > $o,X8 : $i > $o] : (((mvalid @ (mimpl @ X7 @ X8)) & (mvalid @ X7)) => (mvalid @ X8))),
% 0.23/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm)).
% 0.23/0.42 thf(f82,plain,(
% 0.23/0.42 ((sK1 @ sK3) = $false)),
% 0.23/0.42 inference(sigma_clausification,[],[f81])).
% 0.23/0.42 thf(f81,plain,(
% 0.23/0.42 ((!! @ $i @ sK1) != $true)),
% 0.23/0.42 inference(beta_eta_normalization,[],[f74])).
% 0.23/0.42 thf(f74,plain,(
% 0.23/0.42 ($true != ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ sK1))),
% 0.23/0.42 inference(definition_unfolding,[],[f58,f64])).
% 0.23/0.42 thf(f58,plain,(
% 0.23/0.42 ($true != (mvalid @ sK1))),
% 0.23/0.42 inference(cnf_transformation,[],[f52])).
% 0.23/0.42 thf(f84,plain,(
% 0.23/0.42 ( ! [X1 : $i] : (($true = (sK0 @ X1))) )),
% 0.23/0.42 inference(pi_clausification,[],[f83])).
% 0.23/0.42 thf(f83,plain,(
% 0.23/0.42 ($true = (!! @ $i @ sK0))),
% 0.23/0.42 inference(beta_eta_normalization,[],[f73])).
% 0.23/0.42 thf(f73,plain,(
% 0.23/0.42 ($true = ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ sK0))),
% 0.23/0.42 inference(definition_unfolding,[],[f59,f64])).
% 0.23/0.42 thf(f59,plain,(
% 0.23/0.42 ((mvalid @ sK0) = $true)),
% 0.23/0.42 inference(cnf_transformation,[],[f52])).
% 0.23/0.42 % SZS output end Proof for theBenchmark
% 0.23/0.42 % (19286)------------------------------
% 0.23/0.42 % (19286)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.42 % (19286)Termination reason: Refutation
% 0.23/0.42
% 0.23/0.42 % (19286)Memory used [KB]: 5500
% 0.23/0.42 % (19286)Time elapsed: 0.006 s
% 0.23/0.42 % (19286)Instructions burned: 4 (million)
% 0.23/0.42 % (19286)------------------------------
% 0.23/0.42 % (19286)------------------------------
% 0.23/0.42 % (19285)Success in time 0.028 s
% 0.23/0.42 % Vampire---4.8 exiting
%------------------------------------------------------------------------------