TSTP Solution File: SEU654^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU654^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 : n010.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:21 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU654^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/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 : n010.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 : Sun May 19 17:42:38 EDT 2024
% 0.14/0.36 % 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.14/0.38 % (8327)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.14/0.38 % (8331)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.14/0.38 % (8333)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.14/0.38 % (8332)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.38 % (8325)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.14/0.38 % (8326)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.14/0.38 % (8330)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.14/0.38 % (8329)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.38 % (8330)Instruction limit reached!
% 0.14/0.38 % (8330)------------------------------
% 0.14/0.38 % (8330)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8330)Termination reason: Unknown
% 0.14/0.38 % (8330)Termination phase: Property scanning
% 0.14/0.38
% 0.14/0.38 % (8330)Memory used [KB]: 895
% 0.14/0.38 % (8330)Time elapsed: 0.003 s
% 0.14/0.38 % (8330)Instructions burned: 2 (million)
% 0.14/0.38 % (8330)------------------------------
% 0.14/0.38 % (8330)------------------------------
% 0.14/0.38 % (8333)Instruction limit reached!
% 0.14/0.38 % (8333)------------------------------
% 0.14/0.38 % (8333)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8331)Refutation not found, incomplete strategy
% 0.14/0.38 % (8331)------------------------------
% 0.14/0.38 % (8331)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8331)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (8331)Memory used [KB]: 5500
% 0.14/0.38 % (8331)Time elapsed: 0.004 s
% 0.14/0.38 % (8331)Instructions burned: 3 (million)
% 0.14/0.38 % (8331)------------------------------
% 0.14/0.38 % (8331)------------------------------
% 0.14/0.38 % (8333)Termination reason: Unknown
% 0.14/0.38 % (8333)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (8333)Memory used [KB]: 5500
% 0.14/0.38 % (8333)Time elapsed: 0.004 s
% 0.14/0.38 % (8333)Instructions burned: 3 (million)
% 0.14/0.38 % (8333)------------------------------
% 0.14/0.38 % (8333)------------------------------
% 0.14/0.38 % (8329)Instruction limit reached!
% 0.14/0.38 % (8329)------------------------------
% 0.14/0.38 % (8329)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8329)Termination reason: Unknown
% 0.14/0.38 % (8329)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (8329)Memory used [KB]: 5500
% 0.14/0.38 % (8329)Time elapsed: 0.004 s
% 0.14/0.38 % (8329)Instructions burned: 3 (million)
% 0.14/0.38 % (8329)------------------------------
% 0.14/0.38 % (8329)------------------------------
% 0.14/0.38 % (8326)Instruction limit reached!
% 0.14/0.38 % (8326)------------------------------
% 0.14/0.38 % (8326)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8326)Termination reason: Unknown
% 0.14/0.38 % (8326)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (8326)Memory used [KB]: 5500
% 0.14/0.38 % (8326)Time elapsed: 0.005 s
% 0.14/0.38 % (8326)Instructions burned: 4 (million)
% 0.14/0.38 % (8326)------------------------------
% 0.14/0.38 % (8326)------------------------------
% 0.14/0.38 % (8332)First to succeed.
% 0.14/0.38 % (8325)Also succeeded, but the first one will report.
% 0.14/0.39 % (8332)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% 0.14/0.39 thf(func_def_1, type, setadjoin: $i > $i > $i).
% 0.14/0.39 thf(func_def_2, type, kpair: $i > $i > $i).
% 0.14/0.39 thf(f40,plain,(
% 0.14/0.39 $false),
% 0.14/0.39 inference(subsumption_resolution,[],[f39,f23])).
% 0.14/0.39 thf(f23,plain,(
% 0.14/0.39 (sK5 != sK7)),
% 0.14/0.39 inference(cnf_transformation,[],[f18])).
% 0.14/0.39 thf(f18,plain,(
% 0.14/0.39 (setukpairinjR2 = $true) & (((kpair @ sK6 @ sK7) = (kpair @ sK4 @ sK5)) & (sK5 != sK7))),
% 0.14/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7])],[f12,f17])).
% 0.14/0.39 thf(f17,plain,(
% 0.14/0.39 ? [X0,X1,X2,X3] : (((kpair @ X0 @ X1) = (kpair @ X2 @ X3)) & (X1 != X3)) => (((kpair @ sK6 @ sK7) = (kpair @ sK4 @ sK5)) & (sK5 != sK7))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f12,plain,(
% 0.14/0.39 (setukpairinjR2 = $true) & ? [X0,X1,X2,X3] : (((kpair @ X0 @ X1) = (kpair @ X2 @ X3)) & (X1 != X3))),
% 0.14/0.39 inference(ennf_transformation,[],[f9])).
% 0.14/0.39 thf(f9,plain,(
% 0.14/0.39 ~((setukpairinjR2 = $true) => ! [X0,X1,X2,X3] : (((kpair @ X0 @ X1) = (kpair @ X2 @ X3)) => (X1 = X3)))),
% 0.14/0.39 inference(fool_elimination,[],[f8])).
% 0.14/0.39 thf(f8,plain,(
% 0.14/0.39 ~(setukpairinjR2 => ! [X0,X1,X2,X3] : (((kpair @ X0 @ X1) = (kpair @ X2 @ X3)) => (X1 = X3)))),
% 0.14/0.39 inference(rectify,[],[f4])).
% 0.14/0.39 thf(f4,negated_conjecture,(
% 0.14/0.39 ~(setukpairinjR2 => ! [X0,X1,X2,X3] : (((kpair @ X0 @ X1) = (kpair @ X2 @ X3)) => (X1 = X3)))),
% 0.14/0.39 inference(negated_conjecture,[],[f3])).
% 0.14/0.39 thf(f3,conjecture,(
% 0.14/0.39 setukpairinjR2 => ! [X0,X1,X2,X3] : (((kpair @ X0 @ X1) = (kpair @ X2 @ X3)) => (X1 = X3))),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairinjR)).
% 0.14/0.39 thf(f39,plain,(
% 0.14/0.39 (sK5 = sK7)),
% 0.14/0.39 inference(equality_resolution,[],[f35])).
% 0.14/0.39 thf(f35,plain,(
% 0.14/0.39 ( ! [X0 : $i,X1 : $i] : (((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ sK4 @ emptyset) @ (setadjoin @ (setadjoin @ sK4 @ (setadjoin @ sK5 @ emptyset)) @ emptyset))) | (sK7 = X1)) )),
% 0.14/0.39 inference(superposition,[],[f30,f31])).
% 0.14/0.39 thf(f31,plain,(
% 0.14/0.39 ((setadjoin @ (setadjoin @ sK6 @ emptyset) @ (setadjoin @ (setadjoin @ sK6 @ (setadjoin @ sK7 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ sK4 @ emptyset) @ (setadjoin @ (setadjoin @ sK4 @ (setadjoin @ sK5 @ emptyset)) @ emptyset)))),
% 0.14/0.39 inference(beta_eta_normalization,[],[f29])).
% 0.14/0.39 thf(f29,plain,(
% 0.14/0.39 (((^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))) @ sK4 @ sK5) = ((^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))) @ sK6 @ sK7))),
% 0.14/0.39 inference(definition_unfolding,[],[f24,f22,f22])).
% 0.14/0.39 thf(f22,plain,(
% 0.14/0.39 (kpair = (^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))))),
% 0.14/0.39 inference(cnf_transformation,[],[f10])).
% 0.14/0.39 thf(f10,plain,(
% 0.14/0.39 (kpair = (^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))))),
% 0.14/0.39 inference(fool_elimination,[],[f1])).
% 0.14/0.39 thf(f1,axiom,(
% 0.14/0.39 ((^[X0 : $i, X1 : $i] : (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) = kpair)),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kpair)).
% 0.14/0.39 thf(f24,plain,(
% 0.14/0.39 ((kpair @ sK6 @ sK7) = (kpair @ sK4 @ sK5))),
% 0.14/0.39 inference(cnf_transformation,[],[f18])).
% 0.14/0.39 thf(f30,plain,(
% 0.14/0.39 ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $i] : (((setadjoin @ (setadjoin @ X4 @ emptyset) @ (setadjoin @ (setadjoin @ X4 @ (setadjoin @ X7 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X5 @ emptyset) @ (setadjoin @ (setadjoin @ X5 @ (setadjoin @ X6 @ emptyset)) @ emptyset))) | (X6 = X7)) )),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f28])).
% 0.14/0.39 thf(f28,plain,(
% 0.14/0.39 ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $i] : (($true != $true) | ((setadjoin @ (setadjoin @ X4 @ emptyset) @ (setadjoin @ (setadjoin @ X4 @ (setadjoin @ X7 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X5 @ emptyset) @ (setadjoin @ (setadjoin @ X5 @ (setadjoin @ X6 @ emptyset)) @ emptyset))) | (X6 = X7)) )),
% 0.14/0.39 inference(definition_unfolding,[],[f19,f25])).
% 0.14/0.39 thf(f25,plain,(
% 0.14/0.39 (setukpairinjR2 = $true)),
% 0.14/0.39 inference(cnf_transformation,[],[f18])).
% 0.14/0.39 thf(f19,plain,(
% 0.14/0.39 ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $i] : ((X6 = X7) | ((setadjoin @ (setadjoin @ X4 @ emptyset) @ (setadjoin @ (setadjoin @ X4 @ (setadjoin @ X7 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X5 @ emptyset) @ (setadjoin @ (setadjoin @ X5 @ (setadjoin @ X6 @ emptyset)) @ emptyset))) | (setukpairinjR2 != $true)) )),
% 0.14/0.39 inference(cnf_transformation,[],[f16])).
% 0.14/0.39 thf(f16,plain,(
% 0.14/0.39 ((setukpairinjR2 = $true) | ((sK2 != sK3) & ((setadjoin @ (setadjoin @ sK1 @ emptyset) @ (setadjoin @ (setadjoin @ sK1 @ (setadjoin @ sK2 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ sK0 @ emptyset) @ (setadjoin @ (setadjoin @ sK0 @ (setadjoin @ sK3 @ emptyset)) @ emptyset))))) & (! [X4,X5,X6,X7] : ((X6 = X7) | ((setadjoin @ (setadjoin @ X4 @ emptyset) @ (setadjoin @ (setadjoin @ X4 @ (setadjoin @ X7 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X5 @ emptyset) @ (setadjoin @ (setadjoin @ X5 @ (setadjoin @ X6 @ emptyset)) @ emptyset)))) | (setukpairinjR2 != $true))),
% 0.14/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f14,f15])).
% 0.14/0.39 thf(f15,plain,(
% 0.14/0.39 ? [X0,X1,X2,X3] : ((X2 != X3) & ((setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))) => ((sK2 != sK3) & ((setadjoin @ (setadjoin @ sK1 @ emptyset) @ (setadjoin @ (setadjoin @ sK1 @ (setadjoin @ sK2 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ sK0 @ emptyset) @ (setadjoin @ (setadjoin @ sK0 @ (setadjoin @ sK3 @ emptyset)) @ emptyset))))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f14,plain,(
% 0.14/0.39 ((setukpairinjR2 = $true) | ? [X0,X1,X2,X3] : ((X2 != X3) & ((setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X3 @ emptyset)) @ emptyset))))) & (! [X4,X5,X6,X7] : ((X6 = X7) | ((setadjoin @ (setadjoin @ X4 @ emptyset) @ (setadjoin @ (setadjoin @ X4 @ (setadjoin @ X7 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X5 @ emptyset) @ (setadjoin @ (setadjoin @ X5 @ (setadjoin @ X6 @ emptyset)) @ emptyset)))) | (setukpairinjR2 != $true))),
% 0.14/0.39 inference(rectify,[],[f13])).
% 0.14/0.39 thf(f13,plain,(
% 0.14/0.39 ((setukpairinjR2 = $true) | ? [X0,X1,X2,X3] : ((X2 != X3) & ((setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X3 @ emptyset)) @ emptyset))))) & (! [X0,X1,X2,X3] : ((X2 = X3) | ((setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))) | (setukpairinjR2 != $true))),
% 0.14/0.39 inference(nnf_transformation,[],[f11])).
% 0.14/0.39 thf(f11,plain,(
% 0.14/0.39 (setukpairinjR2 = $true) <=> ! [X0,X1,X2,X3] : ((X2 = X3) | ((setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X3 @ emptyset)) @ emptyset))))),
% 0.14/0.39 inference(ennf_transformation,[],[f7])).
% 0.14/0.39 thf(f7,plain,(
% 0.14/0.39 (setukpairinjR2 = $true) <=> ! [X0,X1,X2,X3] : (((setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) => (X2 = X3))),
% 0.14/0.39 inference(fool_elimination,[],[f6])).
% 0.14/0.39 thf(f6,plain,(
% 0.14/0.39 (! [X0,X1,X2,X3] : (((setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) => (X2 = X3)) = setukpairinjR2)),
% 0.14/0.39 inference(rectify,[],[f2])).
% 0.14/0.39 thf(f2,axiom,(
% 0.14/0.39 (! [X0,X2,X3,X1] : (((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) => (X1 = X3)) = setukpairinjR2)),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairinjR2)).
% 0.14/0.39 % SZS output end Proof for theBenchmark
% 0.14/0.39 % (8332)------------------------------
% 0.14/0.39 % (8332)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (8332)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (8332)Memory used [KB]: 5500
% 0.14/0.39 % (8332)Time elapsed: 0.008 s
% 0.14/0.39 % (8332)Instructions burned: 6 (million)
% 0.14/0.39 % (8332)------------------------------
% 0.14/0.39 % (8332)------------------------------
% 0.14/0.39 % (8323)Success in time 0.021 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------