TSTP Solution File: LCL591^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL591^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 : n021.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.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL591^1 : TPTP v8.2.0. Released v3.6.0.
% 0.03/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.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 02:16:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/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.20/0.37 % (28137)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.20/0.38 % (28137)Instruction limit reached!
% 0.20/0.38 % (28137)------------------------------
% 0.20/0.38 % (28137)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (28137)Termination reason: Unknown
% 0.20/0.38 % (28137)Termination phase: Saturation
% 0.20/0.38
% 0.20/0.38 % (28137)Memory used [KB]: 5500
% 0.20/0.38 % (28137)Time elapsed: 0.003 s
% 0.20/0.38 % (28137)Instructions burned: 4 (million)
% 0.20/0.38 % (28137)------------------------------
% 0.20/0.38 % (28137)------------------------------
% 0.20/0.38 % (28130)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.20/0.38 % (28131)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.20/0.38 % (28136)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.20/0.38 % (28130)First to succeed.
% 0.20/0.38 % (28131)Instruction limit reached!
% 0.20/0.38 % (28131)------------------------------
% 0.20/0.38 % (28131)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (28131)Termination reason: Unknown
% 0.20/0.38 % (28131)Termination phase: Saturation
% 0.20/0.38
% 0.20/0.38 % (28131)Memory used [KB]: 5500
% 0.20/0.38 % (28131)Time elapsed: 0.004 s
% 0.20/0.38 % (28131)Instructions burned: 4 (million)
% 0.20/0.38 % (28131)------------------------------
% 0.20/0.38 % (28131)------------------------------
% 0.20/0.38 % (28130)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for theBenchmark
% 0.20/0.38 % SZS output start Proof for theBenchmark
% 0.20/0.38 thf(type_def_6, type, individuals: $tType).
% 0.20/0.38 thf(func_def_1, type, prop_a: $i > $o).
% 0.20/0.38 thf(func_def_2, type, prop_b: $i > $o).
% 0.20/0.38 thf(func_def_3, type, prop_c: $i > $o).
% 0.20/0.38 thf(func_def_4, type, mfalse: $i > $o).
% 0.20/0.38 thf(func_def_5, type, mtrue: $i > $o).
% 0.20/0.38 thf(func_def_6, type, mnot: ($i > $o) > $i > $o).
% 0.20/0.38 thf(func_def_8, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.38 thf(func_def_9, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.38 thf(func_def_10, type, mimpl: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.38 thf(func_def_11, type, miff: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.38 thf(func_def_12, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.20/0.38 thf(func_def_13, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.20/0.38 thf(func_def_14, type, individuals: $tType).
% 0.20/0.38 thf(func_def_15, type, mall: (individuals > $i > $o) > $i > $o).
% 0.20/0.38 thf(func_def_16, type, mexists: (individuals > $i > $o) > $i > $o).
% 0.20/0.38 thf(func_def_17, type, mvalid: ($i > $o) > $o).
% 0.20/0.38 thf(func_def_18, type, msatisfiable: ($i > $o) > $o).
% 0.20/0.38 thf(func_def_19, type, mcountersatisfiable: ($i > $o) > $o).
% 0.20/0.38 thf(func_def_20, type, minvalid: ($i > $o) > $o).
% 0.20/0.38 thf(func_def_34, type, sK0: $i > $o).
% 0.20/0.38 thf(func_def_35, type, sK1: $i > $i > $o).
% 0.20/0.38 thf(f84,plain,(
% 0.20/0.38 $false),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f83])).
% 0.20/0.38 thf(f83,plain,(
% 0.20/0.38 ($true = $false)),
% 0.20/0.38 inference(superposition,[],[f81,f78])).
% 0.20/0.38 thf(f78,plain,(
% 0.20/0.38 ($false = (sK0 @ sK4))),
% 0.20/0.38 inference(binary_proxy_clausification,[],[f77])).
% 0.20/0.38 thf(f77,plain,(
% 0.20/0.38 (((sK1 @ sK3 @ sK4) => (sK0 @ sK4)) = $false)),
% 0.20/0.38 inference(beta_eta_normalization,[],[f76])).
% 0.20/0.38 thf(f76,plain,(
% 0.20/0.38 (((^[Y0 : $i]: ((sK1 @ sK3 @ Y0) => (sK0 @ Y0))) @ sK4) = $false)),
% 0.20/0.38 inference(sigma_clausification,[],[f75])).
% 0.20/0.38 thf(f75,plain,(
% 0.20/0.38 ((!! @ $i @ (^[Y0 : $i]: ((sK1 @ sK3 @ Y0) => (sK0 @ Y0)))) = $false)),
% 0.20/0.38 inference(beta_eta_normalization,[],[f74])).
% 0.20/0.38 thf(f74,plain,(
% 0.20/0.38 ($false = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK1 @ Y0 @ Y1) => (sK0 @ Y1))))) @ sK3))),
% 0.20/0.38 inference(sigma_clausification,[],[f73])).
% 0.20/0.38 thf(f73,plain,(
% 0.20/0.38 ($true != (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK1 @ Y0 @ Y1) => (sK0 @ Y1)))))))),
% 0.20/0.38 inference(beta_eta_normalization,[],[f72])).
% 0.20/0.38 thf(f72,plain,(
% 0.20/0.38 ($true != ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))) @ sK1 @ sK0)))),
% 0.20/0.38 inference(definition_unfolding,[],[f61,f65,f52])).
% 0.20/0.38 thf(f52,plain,(
% 0.20/0.38 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))))),
% 0.20/0.38 inference(cnf_transformation,[],[f30])).
% 0.20/0.38 thf(f30,plain,(
% 0.20/0.38 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))))),
% 0.20/0.38 inference(fool_elimination,[],[f29])).
% 0.20/0.38 thf(f29,plain,(
% 0.20/0.38 (mbox = (^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i] : (! [X3] : ((X0 @ X2 @ X3) => (X1 @ X3)))))),
% 0.20/0.38 inference(rectify,[],[f8])).
% 0.20/0.38 thf(f8,axiom,(
% 0.20/0.38 (mbox = (^[X4 : $i > $i > $o, X5 : $i > $o, X0 : $i] : (! [X2] : ((X4 @ X0 @ X2) => (X5 @ X2)))))),
% 0.20/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox)).
% 0.20/0.38 thf(f65,plain,(
% 0.20/0.38 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.20/0.38 inference(cnf_transformation,[],[f38])).
% 0.20/0.38 thf(f38,plain,(
% 0.20/0.38 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.20/0.38 inference(fool_elimination,[],[f37])).
% 0.20/0.38 thf(f37,plain,(
% 0.20/0.38 (mvalid = (^[X0 : $i > $o] : (! [X1] : (X0 @ X1))))),
% 0.20/0.38 inference(rectify,[],[f12])).
% 0.20/0.38 thf(f12,axiom,(
% 0.20/0.38 (mvalid = (^[X5 : $i > $o] : (! [X6] : (X5 @ X6))))),
% 0.20/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.20/0.38 thf(f61,plain,(
% 0.20/0.38 ($true != (mvalid @ (mbox @ sK1 @ sK0)))),
% 0.20/0.38 inference(cnf_transformation,[],[f51])).
% 0.20/0.38 thf(f51,plain,(
% 0.20/0.38 ($true = (mvalid @ sK0)) & ($true != (mvalid @ (mbox @ sK1 @ sK0)))),
% 0.20/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f49,f50])).
% 0.20/0.38 thf(f50,plain,(
% 0.20/0.38 ? [X0 : $i > $o,X1 : $i > $i > $o] : (($true = (mvalid @ X0)) & ($true != (mvalid @ (mbox @ X1 @ X0)))) => (($true = (mvalid @ sK0)) & ($true != (mvalid @ (mbox @ sK1 @ sK0))))),
% 0.20/0.38 introduced(choice_axiom,[])).
% 0.20/0.38 thf(f49,plain,(
% 0.20/0.38 ? [X0 : $i > $o,X1 : $i > $i > $o] : (($true = (mvalid @ X0)) & ($true != (mvalid @ (mbox @ X1 @ X0))))),
% 0.20/0.38 inference(ennf_transformation,[],[f40])).
% 0.20/0.38 thf(f40,plain,(
% 0.20/0.38 ~! [X0 : $i > $o,X1 : $i > $i > $o] : (($true = (mvalid @ X0)) => ($true = (mvalid @ (mbox @ X1 @ X0))))),
% 0.20/0.38 inference(fool_elimination,[],[f39])).
% 0.20/0.38 thf(f39,plain,(
% 0.20/0.38 ~! [X0 : $i > $o,X1 : $i > $i > $o] : ((mvalid @ X0) => (mvalid @ (mbox @ X1 @ X0)))),
% 0.20/0.38 inference(rectify,[],[f17])).
% 0.20/0.38 thf(f17,negated_conjecture,(
% 0.20/0.38 ~! [X7 : $i > $o,X4 : $i > $i > $o] : ((mvalid @ X7) => (mvalid @ (mbox @ X4 @ X7)))),
% 0.20/0.38 inference(negated_conjecture,[],[f16])).
% 0.20/0.38 thf(f16,conjecture,(
% 0.20/0.38 ! [X7 : $i > $o,X4 : $i > $i > $o] : ((mvalid @ X7) => (mvalid @ (mbox @ X4 @ X7)))),
% 0.20/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm)).
% 0.20/0.38 thf(f81,plain,(
% 0.20/0.38 ( ! [X1 : $i] : (($true = (sK0 @ X1))) )),
% 0.20/0.38 inference(pi_clausification,[],[f80])).
% 0.20/0.38 thf(f80,plain,(
% 0.20/0.38 ($true = (!! @ $i @ sK0))),
% 0.20/0.38 inference(beta_eta_normalization,[],[f71])).
% 0.20/0.38 thf(f71,plain,(
% 0.20/0.38 ($true = ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ sK0))),
% 0.20/0.38 inference(definition_unfolding,[],[f62,f65])).
% 0.20/0.38 thf(f62,plain,(
% 0.20/0.38 ($true = (mvalid @ sK0))),
% 0.20/0.38 inference(cnf_transformation,[],[f51])).
% 0.20/0.38 % SZS output end Proof for theBenchmark
% 0.20/0.38 % (28130)------------------------------
% 0.20/0.38 % (28130)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (28130)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (28130)Memory used [KB]: 5500
% 0.20/0.38 % (28130)Time elapsed: 0.005 s
% 0.20/0.38 % (28130)Instructions burned: 4 (million)
% 0.20/0.38 % (28130)------------------------------
% 0.20/0.38 % (28130)------------------------------
% 0.20/0.38 % (28129)Success in time 0.019 s
% 0.20/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------