TSTP Solution File: SEU546^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU546^2 : TPTP v8.2.0. Released v3.7.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 : n025.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 03:49:30 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU546^2 : TPTP v8.2.0. Released v3.7.0.
% 0.10/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.15/0.35 % Computer : n025.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 : Sun May 19 15:49:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 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.37 % (23635)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.37 % (23630)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.37 % (23631)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.37 % (23632)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.37 % (23629)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.37 % (23634)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.37 % (23631)Instruction limit reached!
% 0.15/0.37 % (23631)------------------------------
% 0.15/0.37 % (23631)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (23631)Termination reason: Unknown
% 0.15/0.37 % (23631)Termination phase: Equality resolution with deletion
% 0.15/0.37
% 0.15/0.37 % (23632)Instruction limit reached!
% 0.15/0.37 % (23632)------------------------------
% 0.15/0.37 % (23632)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (23632)Termination reason: Unknown
% 0.15/0.37 % (23632)Termination phase: Property scanning
% 0.15/0.37
% 0.15/0.37 % (23632)Memory used [KB]: 895
% 0.15/0.37 % (23632)Time elapsed: 0.003 s
% 0.15/0.37 % (23632)Instructions burned: 2 (million)
% 0.15/0.37 % (23632)------------------------------
% 0.15/0.37 % (23632)------------------------------
% 0.15/0.37 % (23631)Memory used [KB]: 895
% 0.15/0.37 % (23631)Time elapsed: 0.003 s
% 0.15/0.37 % (23631)Instructions burned: 2 (million)
% 0.15/0.37 % (23631)------------------------------
% 0.15/0.37 % (23631)------------------------------
% 0.15/0.38 % (23635)Refutation not found, incomplete strategy
% 0.15/0.38 % (23635)------------------------------
% 0.15/0.38 % (23635)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (23635)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.38
% 0.15/0.38
% 0.15/0.38 % (23635)Memory used [KB]: 5500
% 0.15/0.38 % (23635)Time elapsed: 0.004 s
% 0.15/0.38 % (23635)Instructions burned: 2 (million)
% 0.15/0.38 % (23635)------------------------------
% 0.15/0.38 % (23635)------------------------------
% 0.15/0.38 % (23629)Instruction limit reached!
% 0.15/0.38 % (23629)------------------------------
% 0.15/0.38 % (23629)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (23629)Termination reason: Unknown
% 0.15/0.38 % (23629)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (23629)Memory used [KB]: 5500
% 0.15/0.38 % (23629)Time elapsed: 0.005 s
% 0.15/0.38 % (23629)Instructions burned: 4 (million)
% 0.15/0.38 % (23629)------------------------------
% 0.15/0.38 % (23629)------------------------------
% 0.15/0.38 % (23630)First to succeed.
% 0.15/0.38 % (23633)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.38 % (23634)Also succeeded, but the first one will report.
% 0.15/0.38 % (23630)Refutation found. Thanks to Tanya!
% 0.15/0.38 % SZS status Theorem for theBenchmark
% 0.15/0.38 % SZS output start Proof for theBenchmark
% 0.15/0.38 thf(func_def_0, type, exu: ($i > $o) > $o).
% 0.15/0.38 thf(func_def_3, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.15/0.38 thf(func_def_15, type, sK0: $i > $o).
% 0.15/0.38 thf(func_def_18, type, sK3: $i > $i).
% 0.15/0.38 thf(func_def_20, type, sK4: ($i > $o) > $i > $i).
% 0.15/0.38 thf(func_def_21, type, sK5: ($i > $o) > $i).
% 0.15/0.38 thf(f71,plain,(
% 0.15/0.38 $false),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f69])).
% 0.15/0.38 thf(f69,plain,(
% 0.15/0.38 ($true = $false)),
% 0.15/0.38 inference(backward_demodulation,[],[f26,f68])).
% 0.15/0.38 thf(f68,plain,(
% 0.15/0.38 ($false = (sK0 @ sK1))),
% 0.15/0.38 inference(equality_resolution,[],[f67])).
% 0.15/0.38 thf(f67,plain,(
% 0.15/0.38 ( ! [X0 : $i] : ((sK1 != X0) | ($false = (sK0 @ X0))) )),
% 0.15/0.38 inference(duplicate_literal_removal,[],[f65])).
% 0.15/0.38 thf(f65,plain,(
% 0.15/0.38 ( ! [X0 : $i] : (($false = (sK0 @ X0)) | (sK1 != X0) | ($false = (sK0 @ X0))) )),
% 0.15/0.38 inference(superposition,[],[f35,f63])).
% 0.15/0.38 thf(f63,plain,(
% 0.15/0.38 ( ! [X0 : $i] : ((sK1 = (sK3 @ X0)) | ($false = (sK0 @ X0))) )),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f62])).
% 0.15/0.38 thf(f62,plain,(
% 0.15/0.38 ( ! [X0 : $i] : (($true != $true) | ($false = (sK0 @ X0)) | (sK1 = (sK3 @ X0))) )),
% 0.15/0.38 inference(superposition,[],[f19,f34])).
% 0.15/0.38 thf(f34,plain,(
% 0.15/0.38 ( ! [X1 : $i] : (($true = (sK0 @ (sK3 @ X1))) | ($false = (sK0 @ X1))) )),
% 0.15/0.38 inference(binary_proxy_clausification,[],[f32])).
% 0.15/0.38 thf(f32,plain,(
% 0.15/0.38 ( ! [X1 : $i] : (($false = (sK0 @ X1)) | (((sK0 @ (sK3 @ X1)) => (X1 = (sK3 @ X1))) = $false)) )),
% 0.15/0.38 inference(beta_eta_normalization,[],[f31])).
% 0.15/0.38 thf(f31,plain,(
% 0.15/0.38 ( ! [X1 : $i] : (($false = ((^[Y0 : $i]: ((sK0 @ Y0) => (X1 = Y0))) @ (sK3 @ X1))) | ($false = (sK0 @ X1))) )),
% 0.15/0.38 inference(sigma_clausification,[],[f30])).
% 0.15/0.38 thf(f30,plain,(
% 0.15/0.38 ( ! [X1 : $i] : (($false = (sK0 @ X1)) | ($false = (!! @ $i @ (^[Y0 : $i]: ((sK0 @ Y0) => (X1 = Y0)))))) )),
% 0.15/0.38 inference(binary_proxy_clausification,[],[f29])).
% 0.15/0.38 thf(f29,plain,(
% 0.15/0.38 ( ! [X1 : $i] : ((((sK0 @ X1) & (!! @ $i @ (^[Y0 : $i]: ((sK0 @ Y0) => (X1 = Y0))))) = $false)) )),
% 0.15/0.38 inference(beta_eta_normalization,[],[f28])).
% 0.15/0.38 thf(f28,plain,(
% 0.15/0.38 ( ! [X1 : $i] : (($false = ((^[Y0 : $i]: ((sK0 @ Y0) & (!! @ $i @ (^[Y1 : $i]: ((sK0 @ Y1) => (Y0 = Y1)))))) @ X1))) )),
% 0.15/0.38 inference(pi_clausification,[],[f27])).
% 0.15/0.38 thf(f27,plain,(
% 0.15/0.38 ((?? @ $i @ (^[Y0 : $i]: ((sK0 @ Y0) & (!! @ $i @ (^[Y1 : $i]: ((sK0 @ Y1) => (Y0 = Y1))))))) != $true)),
% 0.15/0.38 inference(beta_eta_normalization,[],[f25])).
% 0.15/0.38 thf(f25,plain,(
% 0.15/0.38 ($true != ((^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2)))))))) @ (^[Y0 : $i]: (sK0 @ Y0))))),
% 0.15/0.38 inference(definition_unfolding,[],[f18,f22])).
% 0.15/0.38 thf(f22,plain,(
% 0.15/0.38 (exu = (^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2)))))))))),
% 0.15/0.38 inference(cnf_transformation,[],[f7])).
% 0.15/0.38 thf(f7,plain,(
% 0.15/0.38 (exu = (^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2)))))))))),
% 0.15/0.38 inference(fool_elimination,[],[f6])).
% 0.15/0.38 thf(f6,plain,(
% 0.15/0.38 (exu = (^[X0 : $i > $o] : (? [X1] : (! [X2] : ((X0 @ X2) => (X1 = X2)) & (X0 @ X1)))))),
% 0.15/0.38 inference(rectify,[],[f1])).
% 0.15/0.38 thf(f1,axiom,(
% 0.15/0.38 (exu = (^[X0 : $i > $o] : (? [X1] : (! [X2] : ((X0 @ X2) => (X1 = X2)) & (X0 @ X1)))))),
% 0.15/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exu)).
% 0.15/0.38 thf(f18,plain,(
% 0.15/0.38 ((exu @ (^[Y0 : $i]: (sK0 @ Y0))) != $true)),
% 0.15/0.38 inference(cnf_transformation,[],[f16])).
% 0.15/0.38 thf(f16,plain,(
% 0.15/0.38 (exuI1 = $true) & (! [X2] : ((($true = (sK0 @ X2)) | (sK1 != X2)) & ((sK1 = X2) | ($true != (sK0 @ X2)))) & ((exu @ (^[Y0 : $i]: (sK0 @ Y0))) != $true))),
% 0.15/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f13,f15,f14])).
% 0.15/0.38 thf(f14,plain,(
% 0.15/0.38 ? [X0 : $i > $o] : (? [X1] : ! [X2] : ((((X0 @ X2) = $true) | (X1 != X2)) & ((X1 = X2) | ((X0 @ X2) != $true))) & ((exu @ (^[Y0 : $i]: (X0 @ Y0))) != $true)) => (? [X1] : ! [X2] : ((($true = (sK0 @ X2)) | (X1 != X2)) & ((X1 = X2) | ($true != (sK0 @ X2)))) & ((exu @ (^[Y0 : $i]: (sK0 @ Y0))) != $true))),
% 0.15/0.38 introduced(choice_axiom,[])).
% 0.15/0.38 thf(f15,plain,(
% 0.15/0.38 ? [X1] : ! [X2] : ((($true = (sK0 @ X2)) | (X1 != X2)) & ((X1 = X2) | ($true != (sK0 @ X2)))) => ! [X2] : ((($true = (sK0 @ X2)) | (sK1 != X2)) & ((sK1 = X2) | ($true != (sK0 @ X2))))),
% 0.15/0.38 introduced(choice_axiom,[])).
% 0.15/0.38 thf(f13,plain,(
% 0.15/0.38 (exuI1 = $true) & ? [X0 : $i > $o] : (? [X1] : ! [X2] : ((((X0 @ X2) = $true) | (X1 != X2)) & ((X1 = X2) | ((X0 @ X2) != $true))) & ((exu @ (^[Y0 : $i]: (X0 @ Y0))) != $true))),
% 0.15/0.38 inference(nnf_transformation,[],[f12])).
% 0.15/0.38 thf(f12,plain,(
% 0.15/0.38 (exuI1 = $true) & ? [X0 : $i > $o] : (? [X1] : ! [X2] : (((X0 @ X2) = $true) <=> (X1 = X2)) & ((exu @ (^[Y0 : $i]: (X0 @ Y0))) != $true))),
% 0.15/0.38 inference(ennf_transformation,[],[f11])).
% 0.15/0.38 thf(f11,plain,(
% 0.15/0.38 ~((exuI1 = $true) => ! [X0 : $i > $o] : (? [X1] : ! [X2] : (((X0 @ X2) = $true) <=> (X1 = X2)) => ((exu @ (^[Y0 : $i]: (X0 @ Y0))) = $true)))),
% 0.15/0.38 inference(fool_elimination,[],[f10])).
% 0.15/0.38 thf(f10,plain,(
% 0.15/0.38 ~(exuI1 => ! [X0 : $i > $o] : (? [X1] : ! [X2] : ((X1 = X2) <=> (X0 @ X2)) => (exu @ (^[X3 : $i] : (X0 @ X3)))))),
% 0.15/0.38 inference(rectify,[],[f4])).
% 0.15/0.38 thf(f4,negated_conjecture,(
% 0.15/0.38 ~(exuI1 => ! [X0 : $i > $o] : (? [X1] : ! [X2] : ((X1 = X2) <=> (X0 @ X2)) => (exu @ (^[X1 : $i] : (X0 @ X1)))))),
% 0.15/0.38 inference(negated_conjecture,[],[f3])).
% 0.15/0.38 thf(f3,conjecture,(
% 0.15/0.38 exuI1 => ! [X0 : $i > $o] : (? [X1] : ! [X2] : ((X1 = X2) <=> (X0 @ X2)) => (exu @ (^[X1 : $i] : (X0 @ X1))))),
% 0.15/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exuI2)).
% 0.15/0.38 thf(f19,plain,(
% 0.15/0.38 ( ! [X2 : $i] : (($true != (sK0 @ X2)) | (sK1 = X2)) )),
% 0.15/0.38 inference(cnf_transformation,[],[f16])).
% 0.15/0.38 thf(f35,plain,(
% 0.15/0.38 ( ! [X1 : $i] : (((sK3 @ X1) != X1) | ($false = (sK0 @ X1))) )),
% 0.15/0.38 inference(equality_proxy_clausification,[],[f33])).
% 0.15/0.38 thf(f33,plain,(
% 0.15/0.38 ( ! [X1 : $i] : (($false = (sK0 @ X1)) | ($false = (X1 = (sK3 @ X1)))) )),
% 0.15/0.38 inference(binary_proxy_clausification,[],[f32])).
% 0.15/0.38 thf(f26,plain,(
% 0.15/0.38 ($true = (sK0 @ sK1))),
% 0.15/0.38 inference(equality_resolution,[],[f20])).
% 0.15/0.38 thf(f20,plain,(
% 0.15/0.38 ( ! [X2 : $i] : (($true = (sK0 @ X2)) | (sK1 != X2)) )),
% 0.15/0.38 inference(cnf_transformation,[],[f16])).
% 0.15/0.38 % SZS output end Proof for theBenchmark
% 0.15/0.38 % (23630)------------------------------
% 0.15/0.38 % (23630)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (23630)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (23630)Memory used [KB]: 5500
% 0.15/0.38 % (23630)Time elapsed: 0.007 s
% 0.15/0.38 % (23630)Instructions burned: 4 (million)
% 0.15/0.38 % (23630)------------------------------
% 0.15/0.38 % (23630)------------------------------
% 0.15/0.38 % (23627)Success in time 0.008 s
% 0.15/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------