TSTP Solution File: SEU620^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU620^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 : n012.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:03 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU620^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n012.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 17:49:53 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/sandbox/benchmark/theBenchmark.p
% 0.14/0.40 % (23763)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.40 % (23761)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.40 % (23760)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.40 % (23762)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.40 % (23765)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.40 % (23764)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.40 % (23766)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.40 % (23763)Instruction limit reached!
% 0.14/0.40 % (23763)------------------------------
% 0.14/0.40 % (23763)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (23763)Termination reason: Unknown
% 0.14/0.40 % (23763)Termination phase: Property scanning
% 0.14/0.40
% 0.14/0.40 % (23763)Memory used [KB]: 895
% 0.14/0.40 % (23764)Instruction limit reached!
% 0.14/0.40 % (23764)------------------------------
% 0.14/0.40 % (23764)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (23764)Termination reason: Unknown
% 0.14/0.40 % (23764)Termination phase: Property scanning
% 0.14/0.40
% 0.14/0.40 % (23764)Memory used [KB]: 895
% 0.14/0.40 % (23764)Time elapsed: 0.004 s
% 0.14/0.40 % (23764)Instructions burned: 2 (million)
% 0.14/0.40 % (23764)------------------------------
% 0.14/0.40 % (23764)------------------------------
% 0.14/0.40 % (23763)Time elapsed: 0.004 s
% 0.14/0.40 % (23763)Instructions burned: 2 (million)
% 0.14/0.40 % (23763)------------------------------
% 0.14/0.40 % (23763)------------------------------
% 0.14/0.40 % (23767)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.40 % (23767)Instruction limit reached!
% 0.14/0.40 % (23767)------------------------------
% 0.14/0.40 % (23767)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (23761)Instruction limit reached!
% 0.14/0.40 % (23761)------------------------------
% 0.14/0.40 % (23761)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (23761)Termination reason: Unknown
% 0.14/0.40 % (23761)Termination phase: Saturation
% 0.14/0.40
% 0.14/0.40 % (23761)Memory used [KB]: 5500
% 0.14/0.40 % (23761)Time elapsed: 0.007 s
% 0.14/0.40 % (23761)Instructions burned: 4 (million)
% 0.14/0.40 % (23761)------------------------------
% 0.14/0.40 % (23761)------------------------------
% 0.14/0.40 % (23767)Termination reason: Unknown
% 0.14/0.40 % (23767)Termination phase: Saturation
% 0.14/0.40
% 0.14/0.40 % (23765)First to succeed.
% 0.14/0.40 % (23767)Memory used [KB]: 5373
% 0.14/0.40 % (23767)Time elapsed: 0.005 s
% 0.14/0.40 % (23767)Instructions burned: 3 (million)
% 0.14/0.40 % (23767)------------------------------
% 0.14/0.40 % (23767)------------------------------
% 0.14/0.40 % (23765)Refutation found. Thanks to Tanya!
% 0.14/0.40 % SZS status Theorem for theBenchmark
% 0.14/0.40 % SZS output start Proof for theBenchmark
% 0.14/0.40 thf(func_def_0, type, in: $i > $i > $o).
% 0.14/0.40 thf(func_def_2, type, setadjoin: $i > $i > $i).
% 0.14/0.40 thf(func_def_3, type, setunion: $i > $i).
% 0.14/0.40 thf(func_def_4, type, iskpair: $i > $o).
% 0.14/0.40 thf(func_def_7, type, kpair: $i > $i > $i).
% 0.14/0.40 thf(f33,plain,(
% 0.14/0.40 $false),
% 0.14/0.40 inference(trivial_inequality_removal,[],[f32])).
% 0.14/0.40 thf(f32,plain,(
% 0.14/0.40 ($true != $true)),
% 0.14/0.40 inference(superposition,[],[f31,f30])).
% 0.14/0.40 thf(f30,plain,(
% 0.14/0.40 ( ! [X2 : $i,X3 : $i] : (((iskpair @ (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) = $true)) )),
% 0.14/0.40 inference(trivial_inequality_removal,[],[f28])).
% 0.14/0.40 thf(f28,plain,(
% 0.14/0.40 ( ! [X2 : $i,X3 : $i] : (((iskpair @ (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) = $true) | ($true != $true)) )),
% 0.14/0.40 inference(definition_unfolding,[],[f22,f25])).
% 0.14/0.40 thf(f25,plain,(
% 0.14/0.40 (kpairiskpair = $true)),
% 0.14/0.40 inference(cnf_transformation,[],[f21])).
% 0.14/0.40 thf(f21,plain,(
% 0.14/0.40 (kpairiskpair = $true) & ($true != (iskpair @ (kpair @ sK3 @ sK2)))),
% 0.14/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f15,f20])).
% 0.14/0.40 thf(f20,plain,(
% 0.14/0.40 ? [X0,X1] : ($true != (iskpair @ (kpair @ X1 @ X0))) => ($true != (iskpair @ (kpair @ sK3 @ sK2)))),
% 0.14/0.40 introduced(choice_axiom,[])).
% 0.14/0.40 thf(f15,plain,(
% 0.14/0.40 (kpairiskpair = $true) & ? [X0,X1] : ($true != (iskpair @ (kpair @ X1 @ X0)))),
% 0.14/0.40 inference(ennf_transformation,[],[f12])).
% 0.14/0.40 thf(f12,plain,(
% 0.14/0.40 ~((kpairiskpair = $true) => ! [X0,X1] : ($true = (iskpair @ (kpair @ X1 @ X0))))),
% 0.14/0.40 inference(fool_elimination,[],[f11])).
% 0.14/0.40 thf(f11,plain,(
% 0.14/0.40 ~(kpairiskpair => ! [X0,X1] : (iskpair @ (kpair @ X1 @ X0)))),
% 0.14/0.40 inference(rectify,[],[f5])).
% 0.14/0.40 thf(f5,negated_conjecture,(
% 0.14/0.40 ~(kpairiskpair => ! [X2,X1] : (iskpair @ (kpair @ X1 @ X2)))),
% 0.14/0.40 inference(negated_conjecture,[],[f4])).
% 0.14/0.40 thf(f4,conjecture,(
% 0.14/0.40 kpairiskpair => ! [X2,X1] : (iskpair @ (kpair @ X1 @ X2))),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',kpairp)).
% 0.14/0.40 thf(f22,plain,(
% 0.14/0.40 ( ! [X2 : $i,X3 : $i] : (((iskpair @ (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) = $true) | (kpairiskpair != $true)) )),
% 0.14/0.40 inference(cnf_transformation,[],[f19])).
% 0.14/0.40 thf(f19,plain,(
% 0.14/0.40 ((kpairiskpair = $true) | ($true != (iskpair @ (setadjoin @ (setadjoin @ sK0 @ emptyset) @ (setadjoin @ (setadjoin @ sK0 @ (setadjoin @ sK1 @ emptyset)) @ emptyset))))) & (! [X2,X3] : ((iskpair @ (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) = $true) | (kpairiskpair != $true))),
% 0.14/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f17,f18])).
% 0.14/0.40 thf(f18,plain,(
% 0.14/0.40 ? [X0,X1] : ($true != (iskpair @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))) => ($true != (iskpair @ (setadjoin @ (setadjoin @ sK0 @ emptyset) @ (setadjoin @ (setadjoin @ sK0 @ (setadjoin @ sK1 @ emptyset)) @ emptyset))))),
% 0.14/0.40 introduced(choice_axiom,[])).
% 0.14/0.40 thf(f17,plain,(
% 0.14/0.40 ((kpairiskpair = $true) | ? [X0,X1] : ($true != (iskpair @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))))) & (! [X2,X3] : ((iskpair @ (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) = $true) | (kpairiskpair != $true))),
% 0.14/0.40 inference(rectify,[],[f16])).
% 0.14/0.40 thf(f16,plain,(
% 0.14/0.40 ((kpairiskpair = $true) | ? [X0,X1] : ($true != (iskpair @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))))) & (! [X0,X1] : ($true = (iskpair @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))) | (kpairiskpair != $true))),
% 0.14/0.40 inference(nnf_transformation,[],[f14])).
% 0.14/0.40 thf(f14,plain,(
% 0.14/0.40 (kpairiskpair = $true) <=> ! [X0,X1] : ($true = (iskpair @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))))),
% 0.14/0.40 inference(fool_elimination,[],[f13])).
% 0.14/0.40 thf(f13,plain,(
% 0.14/0.40 (! [X0,X1] : (iskpair @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) = kpairiskpair)),
% 0.14/0.40 inference(rectify,[],[f2])).
% 0.14/0.40 thf(f2,axiom,(
% 0.14/0.40 (! [X1,X2] : (iskpair @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) = kpairiskpair)),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',kpairiskpair)).
% 0.14/0.40 thf(f31,plain,(
% 0.14/0.40 ($true != (iskpair @ (setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset))))),
% 0.14/0.40 inference(beta_eta_normalization,[],[f29])).
% 0.14/0.40 thf(f29,plain,(
% 0.14/0.40 ($true != (iskpair @ ((^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))) @ sK3 @ sK2)))),
% 0.14/0.40 inference(definition_unfolding,[],[f24,f26])).
% 0.14/0.40 thf(f26,plain,(
% 0.14/0.40 (kpair = (^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))))),
% 0.14/0.40 inference(cnf_transformation,[],[f8])).
% 0.14/0.40 thf(f8,plain,(
% 0.14/0.40 (kpair = (^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))))),
% 0.14/0.40 inference(fool_elimination,[],[f7])).
% 0.14/0.40 thf(f7,plain,(
% 0.14/0.40 ((^[X0 : $i, X1 : $i] : (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) = kpair)),
% 0.14/0.40 inference(rectify,[],[f3])).
% 0.14/0.40 thf(f3,axiom,(
% 0.14/0.40 ((^[X1 : $i, X2 : $i] : (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) = kpair)),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',kpair)).
% 0.14/0.40 thf(f24,plain,(
% 0.14/0.40 ($true != (iskpair @ (kpair @ sK3 @ sK2)))),
% 0.14/0.40 inference(cnf_transformation,[],[f21])).
% 0.14/0.40 % SZS output end Proof for theBenchmark
% 0.14/0.40 % (23765)------------------------------
% 0.14/0.40 % (23765)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (23765)Termination reason: Refutation
% 0.14/0.40
% 0.14/0.40 % (23765)Memory used [KB]: 5500
% 0.14/0.40 % (23765)Time elapsed: 0.008 s
% 0.14/0.40 % (23765)Instructions burned: 3 (million)
% 0.14/0.40 % (23765)------------------------------
% 0.14/0.40 % (23765)------------------------------
% 0.14/0.40 % (23759)Success in time 0.031 s
% 0.14/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------