TSTP Solution File: LCL612^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL612^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 : n020.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.19s 0.37s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL612^1 : TPTP v8.2.0. Released v3.6.0.
% 0.12/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.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 02:04:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH0_THM_EQU_NAR problem
% 0.13/0.34 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.19/0.36 % (13177)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.36 % (13177)Instruction limit reached!
% 0.19/0.36 % (13177)------------------------------
% 0.19/0.36 % (13177)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.36 % (13177)Termination reason: Unknown
% 0.19/0.36 % (13177)Termination phase: Property scanning
% 0.19/0.36
% 0.19/0.36 % (13177)Memory used [KB]: 1023
% 0.19/0.36 % (13177)Time elapsed: 0.003 s
% 0.19/0.36 % (13177)Instructions burned: 3 (million)
% 0.19/0.36 % (13177)------------------------------
% 0.19/0.36 % (13177)------------------------------
% 0.19/0.36 % (13178)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.19/0.36 % (13175)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.19/0.36 % (13180)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.19/0.36 % (13179)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.19/0.36 % (13176)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.19/0.36 % (13178)Instruction limit reached!
% 0.19/0.36 % (13178)------------------------------
% 0.19/0.36 % (13178)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.36 % (13178)Termination reason: Unknown
% 0.19/0.36 % (13178)Termination phase: Function definition elimination
% 0.19/0.36
% 0.19/0.36 % (13178)Memory used [KB]: 1023
% 0.19/0.36 % (13178)Time elapsed: 0.004 s
% 0.19/0.36 % (13178)Instructions burned: 3 (million)
% 0.19/0.36 % (13178)------------------------------
% 0.19/0.36 % (13178)------------------------------
% 0.19/0.36 % (13174)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.19/0.36 % (13175)Instruction limit reached!
% 0.19/0.36 % (13175)------------------------------
% 0.19/0.36 % (13175)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.36 % (13175)Termination reason: Unknown
% 0.19/0.36 % (13175)Termination phase: Saturation
% 0.19/0.36
% 0.19/0.36 % (13175)Memory used [KB]: 5500
% 0.19/0.36 % (13175)Time elapsed: 0.005 s
% 0.19/0.36 % (13175)Instructions burned: 4 (million)
% 0.19/0.36 % (13175)------------------------------
% 0.19/0.36 % (13175)------------------------------
% 0.19/0.36 % (13179)Refutation not found, incomplete strategy
% 0.19/0.36 % (13179)------------------------------
% 0.19/0.36 % (13179)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.36 % (13179)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.36
% 0.19/0.36
% 0.19/0.36 % (13179)Memory used [KB]: 5500
% 0.19/0.36 % (13179)Time elapsed: 0.005 s
% 0.19/0.36 % (13179)Instructions burned: 4 (million)
% 0.19/0.36 % (13179)------------------------------
% 0.19/0.36 % (13179)------------------------------
% 0.19/0.36 % (13180)First to succeed.
% 0.19/0.36 % (13181)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.19/0.37 % (13176)Also succeeded, but the first one will report.
% 0.19/0.37 % (13181)Instruction limit reached!
% 0.19/0.37 % (13181)------------------------------
% 0.19/0.37 % (13181)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.37 % (13181)Termination reason: Unknown
% 0.19/0.37 % (13181)Termination phase: Property scanning
% 0.19/0.37
% 0.19/0.37 % (13181)Memory used [KB]: 1023
% 0.19/0.37 % (13181)Time elapsed: 0.004 s
% 0.19/0.37 % (13181)Instructions burned: 3 (million)
% 0.19/0.37 % (13181)------------------------------
% 0.19/0.37 % (13181)------------------------------
% 0.19/0.37 % (13180)Refutation found. Thanks to Tanya!
% 0.19/0.37 % SZS status Theorem for theBenchmark
% 0.19/0.37 % SZS output start Proof for theBenchmark
% 0.19/0.37 thf(type_def_6, type, individuals: $tType).
% 0.19/0.37 thf(func_def_1, type, prop_a: $i > $o).
% 0.19/0.37 thf(func_def_2, type, prop_b: $i > $o).
% 0.19/0.37 thf(func_def_3, type, prop_c: $i > $o).
% 0.19/0.37 thf(func_def_4, type, mfalse: $i > $o).
% 0.19/0.37 thf(func_def_5, type, mtrue: $i > $o).
% 0.19/0.37 thf(func_def_6, type, mnot: ($i > $o) > $i > $o).
% 0.19/0.37 thf(func_def_8, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.19/0.37 thf(func_def_9, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.19/0.37 thf(func_def_10, type, mimpl: ($i > $o) > ($i > $o) > $i > $o).
% 0.19/0.37 thf(func_def_11, type, miff: ($i > $o) > ($i > $o) > $i > $o).
% 0.19/0.37 thf(func_def_12, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.19/0.37 thf(func_def_13, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.19/0.37 thf(func_def_14, type, individuals: $tType).
% 0.19/0.37 thf(func_def_15, type, mall: (individuals > $i > $o) > $i > $o).
% 0.19/0.37 thf(func_def_16, type, mexists: (individuals > $i > $o) > $i > $o).
% 0.19/0.37 thf(func_def_17, type, mvalid: ($i > $o) > $o).
% 0.19/0.37 thf(func_def_18, type, msatisfiable: ($i > $o) > $o).
% 0.19/0.37 thf(func_def_19, type, mcountersatisfiable: ($i > $o) > $o).
% 0.19/0.37 thf(func_def_20, type, minvalid: ($i > $o) > $o).
% 0.19/0.37 thf(func_def_34, type, sK0: $i > $o).
% 0.19/0.37 thf(func_def_35, type, sK1: $i > $o).
% 0.19/0.37 thf(f92,plain,(
% 0.19/0.37 $false),
% 0.19/0.37 inference(trivial_inequality_removal,[],[f91])).
% 0.19/0.37 thf(f91,plain,(
% 0.19/0.37 ($false = $true)),
% 0.19/0.37 inference(superposition,[],[f78,f89])).
% 0.19/0.37 thf(f89,plain,(
% 0.19/0.37 ( ! [X0 : $i] : (($true = (sK0 @ X0))) )),
% 0.19/0.37 inference(trivial_inequality_removal,[],[f87])).
% 0.19/0.37 thf(f87,plain,(
% 0.19/0.37 ( ! [X0 : $i] : (($true = (sK0 @ X0)) | ($false = $true)) )),
% 0.19/0.37 inference(superposition,[],[f85,f83])).
% 0.19/0.37 thf(f83,plain,(
% 0.19/0.37 ( ! [X1 : $i] : (($false = (sK1 @ X1)) | ((sK0 @ X1) = $true)) )),
% 0.19/0.37 inference(not_proxy_clausification,[],[f82])).
% 0.19/0.37 thf(f82,plain,(
% 0.19/0.37 ( ! [X1 : $i] : (((~ (sK1 @ X1)) = $true) | ((sK0 @ X1) = $true)) )),
% 0.19/0.37 inference(binary_proxy_clausification,[],[f81])).
% 0.19/0.37 thf(f81,plain,(
% 0.19/0.37 ( ! [X1 : $i] : ((((sK0 @ X1) | (~ (sK1 @ X1))) = $true)) )),
% 0.19/0.37 inference(beta_eta_normalization,[],[f80])).
% 0.19/0.37 thf(f80,plain,(
% 0.19/0.37 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((sK0 @ Y0) | (~ (sK1 @ Y0)))) @ X1) = $true)) )),
% 0.19/0.37 inference(pi_clausification,[],[f79])).
% 0.19/0.37 thf(f79,plain,(
% 0.19/0.37 ((!! @ $i @ (^[Y0 : $i]: ((sK0 @ Y0) | (~ (sK1 @ Y0))))) = $true)),
% 0.19/0.37 inference(beta_eta_normalization,[],[f76])).
% 0.19/0.37 thf(f76,plain,(
% 0.19/0.37 (((^[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)))) @ sK1 @ sK0)) = $true)),
% 0.19/0.37 inference(definition_unfolding,[],[f57,f71,f72])).
% 0.19/0.37 thf(f72,plain,(
% 0.19/0.37 (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.19/0.37 inference(definition_unfolding,[],[f61,f66,f56])).
% 0.19/0.37 thf(f56,plain,(
% 0.19/0.37 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.19/0.37 inference(cnf_transformation,[],[f43])).
% 0.19/0.37 thf(f43,plain,(
% 0.19/0.37 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.19/0.37 inference(fool_elimination,[],[f42])).
% 0.19/0.37 thf(f42,plain,(
% 0.19/0.37 ((^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))) = mnot)),
% 0.19/0.37 inference(rectify,[],[f3])).
% 0.19/0.37 thf(f3,axiom,(
% 0.19/0.37 ((^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))) = mnot)),
% 0.19/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot)).
% 0.19/0.37 thf(f66,plain,(
% 0.19/0.37 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.19/0.37 inference(cnf_transformation,[],[f22])).
% 0.19/0.37 thf(f22,plain,(
% 0.19/0.37 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.19/0.37 inference(fool_elimination,[],[f21])).
% 0.19/0.37 thf(f21,plain,(
% 0.19/0.37 (mor = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))))),
% 0.19/0.37 inference(rectify,[],[f4])).
% 0.19/0.37 thf(f4,axiom,(
% 0.19/0.37 (mor = (^[X0 : $i > $o, X2 : $i > $o, X1 : $i] : ((X0 @ X1) | (X2 @ X1))))),
% 0.19/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor)).
% 0.19/0.37 thf(f61,plain,(
% 0.19/0.37 (mimpl = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.19/0.37 inference(cnf_transformation,[],[f35])).
% 0.19/0.37 thf(f35,plain,(
% 0.19/0.37 (mimpl = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.19/0.37 inference(fool_elimination,[],[f34])).
% 0.19/0.37 thf(f34,plain,(
% 0.19/0.37 (mimpl = (^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)))),
% 0.19/0.37 inference(rectify,[],[f6])).
% 0.19/0.37 thf(f6,axiom,(
% 0.19/0.37 (mimpl = (^[X1 : $i > $o, X3 : $i > $o] : (mor @ (mnot @ X1) @ X3)))),
% 0.19/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimpl)).
% 0.19/0.37 thf(f71,plain,(
% 0.19/0.37 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.19/0.37 inference(cnf_transformation,[],[f24])).
% 0.19/0.37 thf(f24,plain,(
% 0.19/0.37 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.19/0.37 inference(fool_elimination,[],[f23])).
% 0.19/0.37 thf(f23,plain,(
% 0.19/0.37 ((^[X0 : $i > $o] : (! [X1] : (X0 @ X1))) = mvalid)),
% 0.19/0.37 inference(rectify,[],[f12])).
% 0.19/0.37 thf(f12,axiom,(
% 0.19/0.37 ((^[X5 : $i > $o] : (! [X6] : (X5 @ X6))) = mvalid)),
% 0.19/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.19/0.37 thf(f57,plain,(
% 0.19/0.37 ((mvalid @ (mimpl @ sK1 @ sK0)) = $true)),
% 0.19/0.37 inference(cnf_transformation,[],[f53])).
% 0.19/0.37 thf(f53,plain,(
% 0.19/0.37 ((mvalid @ sK1) = $true) & ((mvalid @ sK0) != $true) & ((mvalid @ (mimpl @ sK1 @ sK0)) = $true)),
% 0.19/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f51,f52])).
% 0.19/0.37 thf(f52,plain,(
% 0.19/0.37 ? [X0 : $i > $o,X1 : $i > $o] : (((mvalid @ X1) = $true) & ((mvalid @ X0) != $true) & ((mvalid @ (mimpl @ X1 @ X0)) = $true)) => (((mvalid @ sK1) = $true) & ((mvalid @ sK0) != $true) & ((mvalid @ (mimpl @ sK1 @ sK0)) = $true))),
% 0.19/0.37 introduced(choice_axiom,[])).
% 0.19/0.37 thf(f51,plain,(
% 0.19/0.37 ? [X0 : $i > $o,X1 : $i > $o] : (((mvalid @ X1) = $true) & ((mvalid @ X0) != $true) & ((mvalid @ (mimpl @ X1 @ X0)) = $true))),
% 0.19/0.37 inference(flattening,[],[f50])).
% 0.19/0.37 thf(f50,plain,(
% 0.19/0.37 ? [X0 : $i > $o,X1 : $i > $o] : (((mvalid @ X0) != $true) & (((mvalid @ X1) = $true) & ((mvalid @ (mimpl @ X1 @ X0)) = $true)))),
% 0.19/0.37 inference(ennf_transformation,[],[f49])).
% 0.19/0.37 thf(f49,plain,(
% 0.19/0.37 ~! [X0 : $i > $o,X1 : $i > $o] : ((((mvalid @ X1) = $true) & ((mvalid @ (mimpl @ X1 @ X0)) = $true)) => ((mvalid @ X0) = $true))),
% 0.19/0.37 inference(rectify,[],[f45])).
% 0.19/0.37 thf(f45,plain,(
% 0.19/0.37 ~! [X1 : $i > $o,X2 : $i > $o] : ((((mvalid @ (mimpl @ X2 @ X1)) = $true) & ((mvalid @ X2) = $true)) => ((mvalid @ X1) = $true))),
% 0.19/0.37 inference(fool_elimination,[],[f44])).
% 0.19/0.37 thf(f44,plain,(
% 0.19/0.37 ~! [X1 : $i > $o,X2 : $i > $o] : (((mvalid @ (mimpl @ X2 @ X1)) & (mvalid @ X2)) => (mvalid @ X1))),
% 0.19/0.37 inference(rectify,[],[f17])).
% 0.19/0.37 thf(f17,negated_conjecture,(
% 0.19/0.37 ~! [X4 : $i > $i > $o,X2 : $i > $o,X0 : $i > $o] : (((mvalid @ (mimpl @ X0 @ X2)) & (mvalid @ X0)) => (mvalid @ X2))),
% 0.19/0.37 inference(negated_conjecture,[],[f16])).
% 0.19/0.37 thf(f16,conjecture,(
% 0.19/0.37 ! [X4 : $i > $i > $o,X2 : $i > $o,X0 : $i > $o] : (((mvalid @ (mimpl @ X0 @ X2)) & (mvalid @ X0)) => (mvalid @ X2))),
% 0.19/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_ponens)).
% 0.19/0.37 thf(f85,plain,(
% 0.19/0.37 ( ! [X1 : $i] : (((sK1 @ X1) = $true)) )),
% 0.19/0.37 inference(pi_clausification,[],[f84])).
% 0.19/0.37 thf(f84,plain,(
% 0.19/0.37 ((!! @ $i @ sK1) = $true)),
% 0.19/0.37 inference(beta_eta_normalization,[],[f74])).
% 0.19/0.37 thf(f74,plain,(
% 0.19/0.37 (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ sK1) = $true)),
% 0.19/0.37 inference(definition_unfolding,[],[f59,f71])).
% 0.19/0.37 thf(f59,plain,(
% 0.19/0.37 ((mvalid @ sK1) = $true)),
% 0.19/0.37 inference(cnf_transformation,[],[f53])).
% 0.19/0.37 thf(f78,plain,(
% 0.19/0.37 ($false = (sK0 @ sK3))),
% 0.19/0.37 inference(sigma_clausification,[],[f77])).
% 0.19/0.37 thf(f77,plain,(
% 0.19/0.37 ((!! @ $i @ sK0) != $true)),
% 0.19/0.37 inference(beta_eta_normalization,[],[f75])).
% 0.19/0.37 thf(f75,plain,(
% 0.19/0.37 (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ sK0) != $true)),
% 0.19/0.37 inference(definition_unfolding,[],[f58,f71])).
% 0.19/0.37 thf(f58,plain,(
% 0.19/0.37 ((mvalid @ sK0) != $true)),
% 0.19/0.37 inference(cnf_transformation,[],[f53])).
% 0.19/0.37 % SZS output end Proof for theBenchmark
% 0.19/0.37 % (13180)------------------------------
% 0.19/0.37 % (13180)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.37 % (13180)Termination reason: Refutation
% 0.19/0.37
% 0.19/0.37 % (13180)Memory used [KB]: 5500
% 0.19/0.37 % (13180)Time elapsed: 0.007 s
% 0.19/0.37 % (13180)Instructions burned: 4 (million)
% 0.19/0.37 % (13180)------------------------------
% 0.19/0.37 % (13180)------------------------------
% 0.19/0.37 % (13167)Success in time 0.015 s
% 0.19/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------