TSTP Solution File: SEU706^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU706^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 : n002.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:54 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU706^2 : TPTP v8.2.0. Released v3.7.0.
% 0.12/0.15 % 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.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 17:37:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 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.38 % (509)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.38 % (510)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.38 % (514)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.38 % (515)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 % (507)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.15/0.38 % (510)Instruction limit reached!
% 0.15/0.38 % (510)------------------------------
% 0.15/0.38 % (510)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (510)Termination reason: Unknown
% 0.15/0.38 % (514)Instruction limit reached!
% 0.15/0.38 % (514)------------------------------
% 0.15/0.38 % (514)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (514)Termination reason: Unknown
% 0.15/0.38 % (514)Termination phase: Function definition elimination
% 0.15/0.38
% 0.15/0.38 % (514)Memory used [KB]: 1023
% 0.15/0.38 % (514)Time elapsed: 0.004 s
% 0.15/0.38 % (514)Instructions burned: 3 (million)
% 0.15/0.38 % (514)------------------------------
% 0.15/0.38 % (514)------------------------------
% 0.15/0.38 % (510)Termination phase: Function definition elimination
% 0.15/0.38
% 0.15/0.38 % (510)Memory used [KB]: 1023
% 0.15/0.38 % (510)Time elapsed: 0.004 s
% 0.15/0.38 % (508)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.38 % (510)Instructions burned: 3 (million)
% 0.15/0.38 % (510)------------------------------
% 0.15/0.38 % (510)------------------------------
% 0.15/0.38 % (516)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.38 % (517)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.39 % (515)Refutation not found, incomplete strategy
% 0.15/0.39 % (515)------------------------------
% 0.15/0.39 % (515)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (515)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.39
% 0.15/0.39
% 0.15/0.39 % (515)Memory used [KB]: 5500
% 0.15/0.39 % (515)Time elapsed: 0.005 s
% 0.15/0.39 % (515)Instructions burned: 4 (million)
% 0.15/0.39 % (515)------------------------------
% 0.15/0.39 % (515)------------------------------
% 0.15/0.39 % (517)Instruction limit reached!
% 0.15/0.39 % (517)------------------------------
% 0.15/0.39 % (517)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (517)Termination reason: Unknown
% 0.15/0.39 % (517)Termination phase: Property scanning
% 0.15/0.39
% 0.15/0.39 % (517)Memory used [KB]: 1023
% 0.15/0.39 % (517)Time elapsed: 0.003 s
% 0.15/0.39 % (517)Instructions burned: 3 (million)
% 0.15/0.39 % (517)------------------------------
% 0.15/0.39 % (517)------------------------------
% 0.15/0.39 % (508)Instruction limit reached!
% 0.15/0.39 % (508)------------------------------
% 0.15/0.39 % (508)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (508)Termination reason: Unknown
% 0.15/0.39 % (508)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (508)Memory used [KB]: 5500
% 0.15/0.39 % (508)Time elapsed: 0.005 s
% 0.15/0.39 % (508)Instructions burned: 4 (million)
% 0.15/0.39 % (508)------------------------------
% 0.15/0.39 % (508)------------------------------
% 0.15/0.39 % (516)First to succeed.
% 0.15/0.39 % (516)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% 0.15/0.39 thf(func_def_0, type, in: $i > $i > $o).
% 0.15/0.39 thf(func_def_2, type, setadjoin: $i > $i > $i).
% 0.15/0.39 thf(func_def_3, type, setunion: $i > $i).
% 0.15/0.39 thf(func_def_10, type, singleton: $i > $o).
% 0.15/0.39 thf(f115,plain,(
% 0.15/0.39 $false),
% 0.15/0.39 inference(subsumption_resolution,[],[f114,f110])).
% 0.15/0.39 thf(f110,plain,(
% 0.15/0.39 (sK16 != sK12)),
% 0.15/0.39 inference(superposition,[],[f70,f109])).
% 0.15/0.39 thf(f109,plain,(
% 0.15/0.39 (sK16 = (setunion @ sK11))),
% 0.15/0.39 inference(superposition,[],[f107,f106])).
% 0.15/0.39 thf(f106,plain,(
% 0.15/0.39 ((setadjoin @ sK16 @ emptyset) = sK11)),
% 0.15/0.39 inference(equality_proxy_clausification,[],[f104])).
% 0.15/0.39 thf(f104,plain,(
% 0.15/0.39 ($true = ((setadjoin @ sK16 @ emptyset) = sK11))),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f103])).
% 0.15/0.39 thf(f103,plain,(
% 0.15/0.39 ($true = ((in @ sK16 @ sK11) & ((setadjoin @ sK16 @ emptyset) = sK11)))),
% 0.15/0.39 inference(beta_eta_normalization,[],[f102])).
% 0.15/0.39 thf(f102,plain,(
% 0.15/0.39 ($true = ((^[Y0 : $i]: ((in @ Y0 @ sK11) & ((setadjoin @ Y0 @ emptyset) = sK11))) @ sK16))),
% 0.15/0.39 inference(sigma_clausification,[],[f101])).
% 0.15/0.39 thf(f101,plain,(
% 0.15/0.39 ($true = (?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ sK11) & ((setadjoin @ Y0 @ emptyset) = sK11)))))),
% 0.15/0.39 inference(beta_eta_normalization,[],[f92])).
% 0.15/0.39 thf(f92,plain,(
% 0.15/0.39 (((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))) @ sK11) = $true)),
% 0.15/0.39 inference(definition_unfolding,[],[f68,f78])).
% 0.15/0.39 thf(f78,plain,(
% 0.15/0.39 (singleton = (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f11])).
% 0.15/0.39 thf(f11,plain,(
% 0.15/0.39 (singleton = (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))))),
% 0.15/0.39 inference(fool_elimination,[],[f10])).
% 0.15/0.39 thf(f10,plain,(
% 0.15/0.39 ((^[X0 : $i] : (? [X1] : (((setadjoin @ X1 @ emptyset) = X0) & (in @ X1 @ X0)))) = singleton)),
% 0.15/0.39 inference(rectify,[],[f6])).
% 0.15/0.39 thf(f6,axiom,(
% 0.15/0.39 ((^[X2 : $i] : (? [X0] : (((setadjoin @ X0 @ emptyset) = X2) & (in @ X0 @ X2)))) = singleton)),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton)).
% 0.15/0.39 thf(f68,plain,(
% 0.15/0.39 ((singleton @ sK11) = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f49])).
% 0.15/0.39 thf(f49,plain,(
% 0.15/0.39 (setadjoin__Cong = $true) & (in__Cong = $true) & (setunion__Cong = $true) & (setunionsingleton = $true) & ((((setunion @ sK11) != sK12) & ($true = (in @ sK12 @ sK11))) & ((singleton @ sK11) = $true)) & (uniqinunit = $true)),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK11,sK12])],[f27,f48,f47])).
% 0.15/0.39 thf(f47,plain,(
% 0.15/0.39 ? [X0] : (? [X1] : (((setunion @ X0) != X1) & ((in @ X1 @ X0) = $true)) & ($true = (singleton @ X0))) => (? [X1] : (((setunion @ sK11) != X1) & ((in @ X1 @ sK11) = $true)) & ((singleton @ sK11) = $true))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f48,plain,(
% 0.15/0.39 ? [X1] : (((setunion @ sK11) != X1) & ((in @ X1 @ sK11) = $true)) => (((setunion @ sK11) != sK12) & ($true = (in @ sK12 @ sK11)))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f27,plain,(
% 0.15/0.39 (setadjoin__Cong = $true) & (in__Cong = $true) & (setunion__Cong = $true) & (setunionsingleton = $true) & ? [X0] : (? [X1] : (((setunion @ X0) != X1) & ((in @ X1 @ X0) = $true)) & ($true = (singleton @ X0))) & (uniqinunit = $true)),
% 0.15/0.39 inference(flattening,[],[f26])).
% 0.15/0.39 thf(f26,plain,(
% 0.15/0.39 ((((? [X0] : (? [X1] : (((setunion @ X0) != X1) & ((in @ X1 @ X0) = $true)) & ($true = (singleton @ X0))) & (setunionsingleton = $true)) & (setunion__Cong = $true)) & (setadjoin__Cong = $true)) & (in__Cong = $true)) & (uniqinunit = $true)),
% 0.15/0.39 inference(ennf_transformation,[],[f15])).
% 0.15/0.39 thf(f15,plain,(
% 0.15/0.39 ~((uniqinunit = $true) => ((in__Cong = $true) => ((setadjoin__Cong = $true) => ((setunion__Cong = $true) => ((setunionsingleton = $true) => ! [X0] : (($true = (singleton @ X0)) => ! [X1] : (((in @ X1 @ X0) = $true) => ((setunion @ X0) = X1))))))))),
% 0.15/0.39 inference(fool_elimination,[],[f14])).
% 0.15/0.39 thf(f14,plain,(
% 0.15/0.39 ~(uniqinunit => (in__Cong => (setadjoin__Cong => (setunion__Cong => (setunionsingleton => ! [X0] : ((singleton @ X0) => ! [X1] : ((in @ X1 @ X0) => ((setunion @ X0) = X1))))))))),
% 0.15/0.39 inference(rectify,[],[f8])).
% 0.15/0.39 thf(f8,negated_conjecture,(
% 0.15/0.39 ~(uniqinunit => (in__Cong => (setadjoin__Cong => (setunion__Cong => (setunionsingleton => ! [X6] : ((singleton @ X6) => ! [X0] : ((in @ X0 @ X6) => ((setunion @ X6) = X0))))))))),
% 0.15/0.39 inference(negated_conjecture,[],[f7])).
% 0.15/0.39 thf(f7,conjecture,(
% 0.15/0.39 uniqinunit => (in__Cong => (setadjoin__Cong => (setunion__Cong => (setunionsingleton => ! [X6] : ((singleton @ X6) => ! [X0] : ((in @ X0 @ X6) => ((setunion @ X6) = X0)))))))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theeq)).
% 0.15/0.39 thf(f107,plain,(
% 0.15/0.39 ( ! [X0 : $i] : (((setunion @ (setadjoin @ X0 @ emptyset)) = X0)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f86])).
% 0.15/0.39 thf(f86,plain,(
% 0.15/0.39 ( ! [X0 : $i] : (((setunion @ (setadjoin @ X0 @ emptyset)) = X0) | ($true != $true)) )),
% 0.15/0.39 inference(definition_unfolding,[],[f62,f71])).
% 0.15/0.39 thf(f71,plain,(
% 0.15/0.39 (setunionsingleton = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f49])).
% 0.15/0.39 thf(f62,plain,(
% 0.15/0.39 ( ! [X0 : $i] : (((setunion @ (setadjoin @ X0 @ emptyset)) = X0) | (setunionsingleton != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f41])).
% 0.15/0.39 thf(f41,plain,(
% 0.15/0.39 (! [X0] : ((setunion @ (setadjoin @ X0 @ emptyset)) = X0) | (setunionsingleton != $true)) & ((setunionsingleton = $true) | (sK6 != (setunion @ (setadjoin @ sK6 @ emptyset))))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f39,f40])).
% 0.15/0.39 thf(f40,plain,(
% 0.15/0.39 ? [X1] : ((setunion @ (setadjoin @ X1 @ emptyset)) != X1) => (sK6 != (setunion @ (setadjoin @ sK6 @ emptyset)))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f39,plain,(
% 0.15/0.39 (! [X0] : ((setunion @ (setadjoin @ X0 @ emptyset)) = X0) | (setunionsingleton != $true)) & ((setunionsingleton = $true) | ? [X1] : ((setunion @ (setadjoin @ X1 @ emptyset)) != X1))),
% 0.15/0.39 inference(rectify,[],[f38])).
% 0.15/0.39 thf(f38,plain,(
% 0.15/0.39 (! [X0] : ((setunion @ (setadjoin @ X0 @ emptyset)) = X0) | (setunionsingleton != $true)) & ((setunionsingleton = $true) | ? [X0] : ((setunion @ (setadjoin @ X0 @ emptyset)) != X0))),
% 0.15/0.39 inference(nnf_transformation,[],[f20])).
% 0.15/0.39 thf(f20,plain,(
% 0.15/0.39 ! [X0] : ((setunion @ (setadjoin @ X0 @ emptyset)) = X0) <=> (setunionsingleton = $true)),
% 0.15/0.39 inference(fool_elimination,[],[f5])).
% 0.15/0.39 thf(f5,axiom,(
% 0.15/0.39 (! [X0] : ((setunion @ (setadjoin @ X0 @ emptyset)) = X0) = setunionsingleton)),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setunionsingleton)).
% 0.15/0.39 thf(f70,plain,(
% 0.15/0.39 ((setunion @ sK11) != sK12)),
% 0.15/0.39 inference(cnf_transformation,[],[f49])).
% 0.15/0.39 thf(f114,plain,(
% 0.15/0.39 (sK16 = sK12)),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f112])).
% 0.15/0.39 thf(f112,plain,(
% 0.15/0.39 (sK16 = sK12) | ($true != $true)),
% 0.15/0.39 inference(superposition,[],[f111,f69])).
% 0.15/0.39 thf(f69,plain,(
% 0.15/0.39 ($true = (in @ sK12 @ sK11))),
% 0.15/0.39 inference(cnf_transformation,[],[f49])).
% 0.15/0.39 thf(f111,plain,(
% 0.15/0.39 ( ! [X0 : $i] : (((in @ X0 @ sK11) != $true) | (sK16 = X0)) )),
% 0.15/0.39 inference(superposition,[],[f108,f106])).
% 0.15/0.39 thf(f108,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (((in @ X0 @ (setadjoin @ X1 @ emptyset)) != $true) | (X0 = X1)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f83])).
% 0.15/0.39 thf(f83,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (($true != $true) | ((in @ X0 @ (setadjoin @ X1 @ emptyset)) != $true) | (X0 = X1)) )),
% 0.15/0.39 inference(definition_unfolding,[],[f60,f67])).
% 0.15/0.39 thf(f67,plain,(
% 0.15/0.39 (uniqinunit = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f49])).
% 0.15/0.39 thf(f60,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (((in @ X0 @ (setadjoin @ X1 @ emptyset)) != $true) | (X0 = X1) | (uniqinunit != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f37])).
% 0.15/0.39 thf(f37,plain,(
% 0.15/0.39 (! [X0,X1] : (((in @ X0 @ (setadjoin @ X1 @ emptyset)) != $true) | (X0 = X1)) | (uniqinunit != $true)) & ((uniqinunit = $true) | (((in @ sK4 @ (setadjoin @ sK5 @ emptyset)) = $true) & (sK5 != sK4)))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f35,f36])).
% 0.15/0.39 thf(f36,plain,(
% 0.15/0.39 ? [X2,X3] : (((in @ X2 @ (setadjoin @ X3 @ emptyset)) = $true) & (X2 != X3)) => (((in @ sK4 @ (setadjoin @ sK5 @ emptyset)) = $true) & (sK5 != sK4))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f35,plain,(
% 0.15/0.39 (! [X0,X1] : (((in @ X0 @ (setadjoin @ X1 @ emptyset)) != $true) | (X0 = X1)) | (uniqinunit != $true)) & ((uniqinunit = $true) | ? [X2,X3] : (((in @ X2 @ (setadjoin @ X3 @ emptyset)) = $true) & (X2 != X3)))),
% 0.15/0.39 inference(rectify,[],[f34])).
% 0.15/0.39 thf(f34,plain,(
% 0.15/0.39 (! [X0,X1] : (((in @ X0 @ (setadjoin @ X1 @ emptyset)) != $true) | (X0 = X1)) | (uniqinunit != $true)) & ((uniqinunit = $true) | ? [X0,X1] : (((in @ X0 @ (setadjoin @ X1 @ emptyset)) = $true) & (X0 != X1)))),
% 0.15/0.39 inference(nnf_transformation,[],[f23])).
% 0.15/0.39 thf(f23,plain,(
% 0.15/0.39 ! [X0,X1] : (((in @ X0 @ (setadjoin @ X1 @ emptyset)) != $true) | (X0 = X1)) <=> (uniqinunit = $true)),
% 0.15/0.39 inference(ennf_transformation,[],[f22])).
% 0.15/0.39 thf(f22,plain,(
% 0.15/0.39 (uniqinunit = $true) <=> ! [X0,X1] : (((in @ X0 @ (setadjoin @ X1 @ emptyset)) = $true) => (X0 = X1))),
% 0.15/0.39 inference(fool_elimination,[],[f21])).
% 0.15/0.39 thf(f21,plain,(
% 0.15/0.39 (uniqinunit = ! [X0,X1] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1)))),
% 0.15/0.39 inference(rectify,[],[f1])).
% 0.15/0.39 thf(f1,axiom,(
% 0.15/0.39 (uniqinunit = ! [X0,X1] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1)))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uniqinunit)).
% 0.15/0.39 % SZS output end Proof for theBenchmark
% 0.15/0.39 % (516)------------------------------
% 0.15/0.39 % (516)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (516)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (516)Memory used [KB]: 5500
% 0.15/0.39 % (516)Time elapsed: 0.008 s
% 0.15/0.39 % (516)Instructions burned: 5 (million)
% 0.15/0.39 % (516)------------------------------
% 0.15/0.39 % (516)------------------------------
% 0.15/0.39 % (506)Success in time 0.009 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------