TSTP Solution File: SEU648^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU648^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n019.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:50:19 EDT 2024
% Result : Theorem 0.11s 0.35s
% Output : Refutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SEU648^2 : TPTP v8.2.0. Released v3.7.0.
% 0.02/0.12 % 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.11/0.33 % Computer : n019.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun May 19 15:35:52 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.33 This is a TH0_THM_EQU_NAR problem
% 0.11/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/sandbox/benchmark/theBenchmark.p
% 0.11/0.35 % (31270)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.11/0.35 % (31271)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.11/0.35 % (31272)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.11/0.35 % (31273)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.11/0.35 % (31274)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.11/0.35 % (31275)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.11/0.35 % (31276)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.11/0.35 % (31272)Instruction limit reached!
% 0.11/0.35 % (31272)------------------------------
% 0.11/0.35 % (31272)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (31272)Termination reason: Unknown
% 0.11/0.35 % (31272)Termination phase: Saturation
% 0.11/0.35 % (31273)Instruction limit reached!
% 0.11/0.35 % (31273)------------------------------
% 0.11/0.35 % (31273)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35
% 0.11/0.35 % (31272)Memory used [KB]: 5500
% 0.11/0.35 % (31272)Time elapsed: 0.003 s
% 0.11/0.35 % (31272)Instructions burned: 3 (million)
% 0.11/0.35 % (31272)------------------------------
% 0.11/0.35 % (31272)------------------------------
% 0.11/0.35 % (31273)Termination reason: Unknown
% 0.11/0.35 % (31273)Termination phase: Saturation
% 0.11/0.35
% 0.11/0.35 % (31273)Memory used [KB]: 895
% 0.11/0.35 % (31273)Time elapsed: 0.003 s
% 0.11/0.35 % (31273)Instructions burned: 3 (million)
% 0.11/0.35 % (31273)------------------------------
% 0.11/0.35 % (31273)------------------------------
% 0.11/0.35 % (31276)Instruction limit reached!
% 0.11/0.35 % (31276)------------------------------
% 0.11/0.35 % (31276)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (31276)Termination reason: Unknown
% 0.11/0.35 % (31276)Termination phase: Saturation
% 0.11/0.35
% 0.11/0.35 % (31276)Memory used [KB]: 5500
% 0.11/0.35 % (31276)Time elapsed: 0.003 s
% 0.11/0.35 % (31276)Instructions burned: 3 (million)
% 0.11/0.35 % (31276)------------------------------
% 0.11/0.35 % (31276)------------------------------
% 0.11/0.35 % (31269)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.11/0.35 % (31270)Instruction limit reached!
% 0.11/0.35 % (31270)------------------------------
% 0.11/0.35 % (31270)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (31274)Refutation not found, incomplete strategy
% 0.11/0.35 % (31274)------------------------------
% 0.11/0.35 % (31274)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (31274)Termination reason: Refutation not found, incomplete strategy
% 0.11/0.35
% 0.11/0.35
% 0.11/0.35 % (31274)Memory used [KB]: 5500
% 0.11/0.35 % (31274)Time elapsed: 0.003 s
% 0.11/0.35 % (31274)Instructions burned: 3 (million)
% 0.11/0.35 % (31274)------------------------------
% 0.11/0.35 % (31274)------------------------------
% 0.11/0.35 % (31270)Termination reason: Unknown
% 0.11/0.35 % (31270)Termination phase: Saturation
% 0.11/0.35
% 0.11/0.35 % (31270)Memory used [KB]: 5500
% 0.11/0.35 % (31270)Time elapsed: 0.004 s
% 0.11/0.35 % (31270)Instructions burned: 4 (million)
% 0.11/0.35 % (31270)------------------------------
% 0.11/0.35 % (31270)------------------------------
% 0.11/0.35 % (31275)First to succeed.
% 0.11/0.35 % (31271)Also succeeded, but the first one will report.
% 0.11/0.35 % (31275)Refutation found. Thanks to Tanya!
% 0.11/0.35 % SZS status Theorem for theBenchmark
% 0.11/0.35 % SZS output start Proof for theBenchmark
% 0.11/0.35 thf(func_def_1, type, setadjoin: $i > $i > $i).
% 0.11/0.35 thf(func_def_2, type, kpair: $i > $i > $i).
% 0.11/0.35 thf(f49,plain,(
% 0.11/0.35 $false),
% 0.11/0.35 inference(subsumption_resolution,[],[f39,f20])).
% 0.11/0.35 thf(f20,plain,(
% 0.11/0.35 (sK3 != sK0)),
% 0.11/0.35 inference(cnf_transformation,[],[f14])).
% 0.11/0.35 thf(f14,plain,(
% 0.11/0.35 (setukpairinjL2 = $true) & ((sK3 != sK0) & ((kpair @ sK3 @ sK1) = (kpair @ sK0 @ sK2)))),
% 0.11/0.35 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f12,f13])).
% 0.11/0.35 thf(f13,plain,(
% 0.11/0.35 ? [X0,X1,X2,X3] : ((X0 != X3) & ((kpair @ X3 @ X1) = (kpair @ X0 @ X2))) => ((sK3 != sK0) & ((kpair @ sK3 @ sK1) = (kpair @ sK0 @ sK2)))),
% 0.11/0.35 introduced(choice_axiom,[])).
% 0.11/0.35 thf(f12,plain,(
% 0.11/0.35 (setukpairinjL2 = $true) & ? [X0,X1,X2,X3] : ((X0 != X3) & ((kpair @ X3 @ X1) = (kpair @ X0 @ X2)))),
% 0.11/0.35 inference(ennf_transformation,[],[f7])).
% 0.11/0.35 thf(f7,plain,(
% 0.11/0.35 ~((setukpairinjL2 = $true) => ! [X0,X1,X2,X3] : (((kpair @ X3 @ X1) = (kpair @ X0 @ X2)) => (X0 = X3)))),
% 0.11/0.35 inference(fool_elimination,[],[f6])).
% 0.11/0.35 thf(f6,plain,(
% 0.11/0.35 ~(setukpairinjL2 => ! [X0,X1,X2,X3] : (((kpair @ X3 @ X1) = (kpair @ X0 @ X2)) => (X0 = X3)))),
% 0.11/0.35 inference(rectify,[],[f4])).
% 0.11/0.35 thf(f4,negated_conjecture,(
% 0.11/0.35 ~(setukpairinjL2 => ! [X0,X3,X1,X2] : (((kpair @ X0 @ X1) = (kpair @ X2 @ X3)) => (X0 = X2)))),
% 0.11/0.35 inference(negated_conjecture,[],[f3])).
% 0.11/0.35 thf(f3,conjecture,(
% 0.11/0.35 setukpairinjL2 => ! [X0,X3,X1,X2] : (((kpair @ X0 @ X1) = (kpair @ X2 @ X3)) => (X0 = X2))),
% 0.11/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairinjL)).
% 0.11/0.35 thf(f39,plain,(
% 0.11/0.35 (sK3 = sK0)),
% 0.11/0.35 inference(equality_resolution,[],[f33])).
% 0.11/0.35 thf(f33,plain,(
% 0.11/0.35 ( ! [X0 : $i,X1 : $i] : (((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ sK0 @ emptyset) @ (setadjoin @ (setadjoin @ sK0 @ (setadjoin @ sK2 @ emptyset)) @ emptyset))) | (sK3 = X0)) )),
% 0.11/0.35 inference(superposition,[],[f30,f31])).
% 0.11/0.35 thf(f31,plain,(
% 0.11/0.35 ((setadjoin @ (setadjoin @ sK0 @ emptyset) @ (setadjoin @ (setadjoin @ sK0 @ (setadjoin @ sK2 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK1 @ emptyset)) @ emptyset)))),
% 0.11/0.35 inference(beta_eta_normalization,[],[f26])).
% 0.11/0.35 thf(f26,plain,(
% 0.11/0.35 (((^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))) @ sK3 @ sK1) = ((^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))) @ sK0 @ sK2))),
% 0.11/0.35 inference(definition_unfolding,[],[f19,f25,f25])).
% 0.11/0.35 thf(f25,plain,(
% 0.11/0.35 (kpair = (^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))))),
% 0.11/0.35 inference(cnf_transformation,[],[f8])).
% 0.11/0.35 thf(f8,plain,(
% 0.11/0.35 (kpair = (^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))))),
% 0.11/0.35 inference(fool_elimination,[],[f1])).
% 0.11/0.35 thf(f1,axiom,(
% 0.11/0.35 ((^[X0 : $i, X1 : $i] : (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) = kpair)),
% 0.11/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p',kpair)).
% 0.11/0.35 thf(f19,plain,(
% 0.11/0.35 ((kpair @ sK3 @ sK1) = (kpair @ sK0 @ sK2))),
% 0.11/0.35 inference(cnf_transformation,[],[f14])).
% 0.11/0.35 thf(f30,plain,(
% 0.11/0.35 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) | (X0 = X2)) )),
% 0.11/0.35 inference(trivial_inequality_removal,[],[f27])).
% 0.11/0.35 thf(f27,plain,(
% 0.11/0.35 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : ((X0 = X2) | ($true != $true) | ((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))) )),
% 0.11/0.35 inference(definition_unfolding,[],[f24,f21])).
% 0.11/0.35 thf(f21,plain,(
% 0.11/0.35 (setukpairinjL2 = $true)),
% 0.11/0.35 inference(cnf_transformation,[],[f14])).
% 0.11/0.35 thf(f24,plain,(
% 0.11/0.35 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : ((X0 = X2) | ((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) | (setukpairinjL2 != $true)) )),
% 0.11/0.35 inference(cnf_transformation,[],[f18])).
% 0.11/0.35 thf(f18,plain,(
% 0.11/0.35 (! [X0,X1,X2,X3] : ((X0 = X2) | ((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))) | (setukpairinjL2 != $true)) & ((setukpairinjL2 = $true) | ((sK6 != sK4) & ((setadjoin @ (setadjoin @ sK4 @ emptyset) @ (setadjoin @ (setadjoin @ sK4 @ (setadjoin @ sK5 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ sK6 @ emptyset) @ (setadjoin @ (setadjoin @ sK6 @ (setadjoin @ sK7 @ emptyset)) @ emptyset)))))),
% 0.11/0.35 inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7])],[f16,f17])).
% 0.11/0.35 thf(f17,plain,(
% 0.11/0.35 ? [X4,X5,X6,X7] : ((X4 != X6) & ((setadjoin @ (setadjoin @ X4 @ emptyset) @ (setadjoin @ (setadjoin @ X4 @ (setadjoin @ X5 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X6 @ emptyset) @ (setadjoin @ (setadjoin @ X6 @ (setadjoin @ X7 @ emptyset)) @ emptyset)))) => ((sK6 != sK4) & ((setadjoin @ (setadjoin @ sK4 @ emptyset) @ (setadjoin @ (setadjoin @ sK4 @ (setadjoin @ sK5 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ sK6 @ emptyset) @ (setadjoin @ (setadjoin @ sK6 @ (setadjoin @ sK7 @ emptyset)) @ emptyset))))),
% 0.11/0.35 introduced(choice_axiom,[])).
% 0.11/0.35 thf(f16,plain,(
% 0.11/0.35 (! [X0,X1,X2,X3] : ((X0 = X2) | ((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))) | (setukpairinjL2 != $true)) & ((setukpairinjL2 = $true) | ? [X4,X5,X6,X7] : ((X4 != X6) & ((setadjoin @ (setadjoin @ X4 @ emptyset) @ (setadjoin @ (setadjoin @ X4 @ (setadjoin @ X5 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X6 @ emptyset) @ (setadjoin @ (setadjoin @ X6 @ (setadjoin @ X7 @ emptyset)) @ emptyset)))))),
% 0.11/0.35 inference(rectify,[],[f15])).
% 0.11/0.35 thf(f15,plain,(
% 0.11/0.35 (! [X0,X1,X2,X3] : ((X0 = X2) | ((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))) | (setukpairinjL2 != $true)) & ((setukpairinjL2 = $true) | ? [X0,X1,X2,X3] : ((X0 != X2) & ((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))))),
% 0.11/0.35 inference(nnf_transformation,[],[f11])).
% 0.11/0.35 thf(f11,plain,(
% 0.11/0.35 ! [X0,X1,X2,X3] : ((X0 = X2) | ((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))) <=> (setukpairinjL2 = $true)),
% 0.11/0.35 inference(ennf_transformation,[],[f10])).
% 0.11/0.35 thf(f10,plain,(
% 0.11/0.35 ! [X0,X1,X2,X3] : (((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) => (X0 = X2)) <=> (setukpairinjL2 = $true)),
% 0.11/0.35 inference(fool_elimination,[],[f9])).
% 0.11/0.35 thf(f9,plain,(
% 0.11/0.35 (! [X0,X1,X2,X3] : (((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) => (X0 = X2)) = setukpairinjL2)),
% 0.11/0.35 inference(rectify,[],[f2])).
% 0.11/0.35 thf(f2,axiom,(
% 0.11/0.35 (! [X2,X3,X0,X1] : (((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) => (X0 = X2)) = setukpairinjL2)),
% 0.11/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairinjL2)).
% 0.11/0.35 % SZS output end Proof for theBenchmark
% 0.11/0.35 % (31275)------------------------------
% 0.11/0.35 % (31275)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (31275)Termination reason: Refutation
% 0.11/0.35
% 0.11/0.35 % (31275)Memory used [KB]: 5500
% 0.11/0.35 % (31275)Time elapsed: 0.006 s
% 0.11/0.35 % (31275)Instructions burned: 6 (million)
% 0.11/0.35 % (31275)------------------------------
% 0.11/0.35 % (31275)------------------------------
% 0.11/0.35 % (31268)Success in time 0.018 s
% 0.11/0.35 % Vampire---4.8 exiting
%------------------------------------------------------------------------------