TSTP Solution File: SEU741^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU741^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 : n021.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:51:10 EDT 2024
% Result : Theorem 0.15s 0.32s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SEU741^2 : TPTP v8.2.0. Released v3.7.0.
% 0.02/0.10 % 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.10/0.30 % Computer : n021.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun May 19 16:25:07 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 This is a TH0_THM_EQU_NAR problem
% 0.10/0.31 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.15/0.32 % (30856)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 (3000ds/4Mi)
% 0.15/0.32 % (30859)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 (3000ds/2Mi)
% 0.15/0.32 % (30859)Instruction limit reached!
% 0.15/0.32 % (30859)------------------------------
% 0.15/0.32 % (30859)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (30859)Termination reason: Unknown
% 0.15/0.32 % (30859)Termination phase: shuffling
% 0.15/0.32
% 0.15/0.32 % (30859)Memory used [KB]: 895
% 0.15/0.32 % (30859)Time elapsed: 0.002 s
% 0.15/0.32 % (30859)Instructions burned: 2 (million)
% 0.15/0.32 % (30859)------------------------------
% 0.15/0.32 % (30859)------------------------------
% 0.15/0.32 % (30855)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.15/0.32 % (30856)Instruction limit reached!
% 0.15/0.32 % (30856)------------------------------
% 0.15/0.32 % (30856)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (30856)Termination reason: Unknown
% 0.15/0.32 % (30856)Termination phase: Saturation
% 0.15/0.32
% 0.15/0.32 % (30856)Memory used [KB]: 5500
% 0.15/0.32 % (30856)Time elapsed: 0.004 s
% 0.15/0.32 % (30856)Instructions burned: 5 (million)
% 0.15/0.32 % (30856)------------------------------
% 0.15/0.32 % (30856)------------------------------
% 0.15/0.32 % (30855)First to succeed.
% 0.15/0.32 % (30861)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.32 % (30862)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.15/0.32 % (30860)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 (3000ds/275Mi)
% 0.15/0.32 % (30855)Refutation found. Thanks to Tanya!
% 0.15/0.32 % SZS status Theorem for theBenchmark
% 0.15/0.32 % SZS output start Proof for theBenchmark
% 0.15/0.32 thf(func_def_0, type, in: $i > $i > $o).
% 0.15/0.32 thf(func_def_1, type, powerset: $i > $i).
% 0.15/0.32 thf(func_def_2, type, binunion: $i > $i > $i).
% 0.15/0.32 thf(func_def_5, type, binintersect: $i > $i > $i).
% 0.15/0.32 thf(f53,plain,(
% 0.15/0.32 $false),
% 0.15/0.32 inference(trivial_inequality_removal,[],[f51])).
% 0.15/0.32 thf(f51,plain,(
% 0.15/0.32 ($true = $false)),
% 0.15/0.32 inference(superposition,[],[f50,f48])).
% 0.15/0.32 thf(f48,plain,(
% 0.15/0.32 ($true = (in @ sK4 @ sK2))),
% 0.15/0.32 inference(trivial_inequality_removal,[],[f45])).
% 0.15/0.32 thf(f45,plain,(
% 0.15/0.32 ($true = (in @ sK4 @ sK2)) | ($true = $false)),
% 0.15/0.32 inference(superposition,[],[f37,f21])).
% 0.15/0.32 thf(f21,plain,(
% 0.15/0.32 ((in @ sK4 @ (binintersect @ sK0 @ sK2)) = $true)),
% 0.15/0.32 inference(cnf_transformation,[],[f18])).
% 0.15/0.32 thf(f18,plain,(
% 0.15/0.32 (binintersectER = $true) & (binunionIL = $true) & ((($true = (in @ sK2 @ (powerset @ sK1))) & (((in @ sK3 @ (powerset @ sK1)) = $true) & (((in @ sK4 @ (binunion @ sK2 @ sK3)) != $true) & ((in @ sK4 @ sK1) = $true) & ((in @ sK4 @ (binintersect @ sK0 @ sK2)) = $true)))) & ((in @ sK0 @ (powerset @ sK1)) = $true))),
% 0.15/0.32 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f13,f17,f16,f15,f14])).
% 0.15/0.32 thf(f14,plain,(
% 0.15/0.32 ? [X0,X1] : (? [X2] : (($true = (in @ X2 @ (powerset @ X1))) & ? [X3] : (((in @ X3 @ (powerset @ X1)) = $true) & ? [X4] : (((in @ X4 @ (binunion @ X2 @ X3)) != $true) & ((in @ X4 @ X1) = $true) & ($true = (in @ X4 @ (binintersect @ X0 @ X2)))))) & ($true = (in @ X0 @ (powerset @ X1)))) => (? [X2] : (((in @ X2 @ (powerset @ sK1)) = $true) & ? [X3] : (((in @ X3 @ (powerset @ sK1)) = $true) & ? [X4] : (((in @ X4 @ (binunion @ X2 @ X3)) != $true) & ((in @ X4 @ sK1) = $true) & ($true = (in @ X4 @ (binintersect @ sK0 @ X2)))))) & ((in @ sK0 @ (powerset @ sK1)) = $true))),
% 0.15/0.32 introduced(choice_axiom,[])).
% 0.15/0.32 thf(f15,plain,(
% 0.15/0.32 ? [X2] : (((in @ X2 @ (powerset @ sK1)) = $true) & ? [X3] : (((in @ X3 @ (powerset @ sK1)) = $true) & ? [X4] : (((in @ X4 @ (binunion @ X2 @ X3)) != $true) & ((in @ X4 @ sK1) = $true) & ($true = (in @ X4 @ (binintersect @ sK0 @ X2)))))) => (($true = (in @ sK2 @ (powerset @ sK1))) & ? [X3] : (((in @ X3 @ (powerset @ sK1)) = $true) & ? [X4] : (($true != (in @ X4 @ (binunion @ sK2 @ X3))) & ((in @ X4 @ sK1) = $true) & ($true = (in @ X4 @ (binintersect @ sK0 @ sK2))))))),
% 0.15/0.32 introduced(choice_axiom,[])).
% 0.15/0.32 thf(f16,plain,(
% 0.15/0.32 ? [X3] : (((in @ X3 @ (powerset @ sK1)) = $true) & ? [X4] : (($true != (in @ X4 @ (binunion @ sK2 @ X3))) & ((in @ X4 @ sK1) = $true) & ($true = (in @ X4 @ (binintersect @ sK0 @ sK2))))) => (((in @ sK3 @ (powerset @ sK1)) = $true) & ? [X4] : (($true != (in @ X4 @ (binunion @ sK2 @ sK3))) & ((in @ X4 @ sK1) = $true) & ($true = (in @ X4 @ (binintersect @ sK0 @ sK2)))))),
% 0.15/0.32 introduced(choice_axiom,[])).
% 0.15/0.32 thf(f17,plain,(
% 0.15/0.32 ? [X4] : (($true != (in @ X4 @ (binunion @ sK2 @ sK3))) & ((in @ X4 @ sK1) = $true) & ($true = (in @ X4 @ (binintersect @ sK0 @ sK2)))) => (((in @ sK4 @ (binunion @ sK2 @ sK3)) != $true) & ((in @ sK4 @ sK1) = $true) & ((in @ sK4 @ (binintersect @ sK0 @ sK2)) = $true))),
% 0.15/0.32 introduced(choice_axiom,[])).
% 0.15/0.32 thf(f13,plain,(
% 0.15/0.32 (binintersectER = $true) & (binunionIL = $true) & ? [X0,X1] : (? [X2] : (($true = (in @ X2 @ (powerset @ X1))) & ? [X3] : (((in @ X3 @ (powerset @ X1)) = $true) & ? [X4] : (((in @ X4 @ (binunion @ X2 @ X3)) != $true) & ((in @ X4 @ X1) = $true) & ($true = (in @ X4 @ (binintersect @ X0 @ X2)))))) & ($true = (in @ X0 @ (powerset @ X1))))),
% 0.15/0.32 inference(flattening,[],[f12])).
% 0.15/0.32 thf(f12,plain,(
% 0.15/0.32 (? [X0,X1] : (? [X2] : (? [X3] : (? [X4] : ((((in @ X4 @ (binunion @ X2 @ X3)) != $true) & ($true = (in @ X4 @ (binintersect @ X0 @ X2)))) & ((in @ X4 @ X1) = $true)) & ((in @ X3 @ (powerset @ X1)) = $true)) & ($true = (in @ X2 @ (powerset @ X1)))) & ($true = (in @ X0 @ (powerset @ X1)))) & (binintersectER = $true)) & (binunionIL = $true)),
% 0.15/0.32 inference(ennf_transformation,[],[f9])).
% 0.15/0.32 thf(f9,plain,(
% 0.15/0.32 ~((binunionIL = $true) => ((binintersectER = $true) => ! [X0,X1] : (($true = (in @ X0 @ (powerset @ X1))) => ! [X2] : (($true = (in @ X2 @ (powerset @ X1))) => ! [X3] : (((in @ X3 @ (powerset @ X1)) = $true) => ! [X4] : (((in @ X4 @ X1) = $true) => (($true = (in @ X4 @ (binintersect @ X0 @ X2))) => ((in @ X4 @ (binunion @ X2 @ X3)) = $true))))))))),
% 0.15/0.32 inference(fool_elimination,[],[f8])).
% 0.15/0.32 thf(f8,plain,(
% 0.15/0.32 ~(binunionIL => (binintersectER => ! [X0,X1] : ((in @ X0 @ (powerset @ X1)) => ! [X2] : ((in @ X2 @ (powerset @ X1)) => ! [X3] : ((in @ X3 @ (powerset @ X1)) => ! [X4] : ((in @ X4 @ X1) => ((in @ X4 @ (binintersect @ X0 @ X2)) => (in @ X4 @ (binunion @ X2 @ X3)))))))))),
% 0.15/0.32 inference(rectify,[],[f4])).
% 0.15/0.32 thf(f4,negated_conjecture,(
% 0.15/0.32 ~(binunionIL => (binintersectER => ! [X3,X0] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X5] : ((in @ X5 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => ((in @ X2 @ (binintersect @ X3 @ X4)) => (in @ X2 @ (binunion @ X4 @ X5)))))))))),
% 0.15/0.32 inference(negated_conjecture,[],[f3])).
% 0.15/0.32 thf(f3,conjecture,(
% 0.15/0.32 binunionIL => (binintersectER => ! [X3,X0] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X5] : ((in @ X5 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => ((in @ X2 @ (binintersect @ X3 @ X4)) => (in @ X2 @ (binunion @ X4 @ X5))))))))),
% 0.15/0.32 file('/export/starexec/sandbox/benchmark/theBenchmark.p',inIntersectImpInUnion2)).
% 0.15/0.32 thf(f37,plain,(
% 0.15/0.32 ( ! [X2 : $i,X3 : $i,X1 : $i] : (((in @ X3 @ (binintersect @ X1 @ X2)) = $false) | ((in @ X3 @ X2) = $true)) )),
% 0.15/0.32 inference(binary_proxy_clausification,[],[f36])).
% 0.15/0.32 thf(f36,plain,(
% 0.15/0.32 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((in @ X3 @ (binintersect @ X1 @ X2)) => (in @ X3 @ X2)) = $true)) )),
% 0.15/0.32 inference(beta_eta_normalization,[],[f35])).
% 0.15/0.32 thf(f35,plain,(
% 0.15/0.32 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((in @ Y0 @ (binintersect @ X1 @ X2)) => (in @ Y0 @ X2))) @ X3))) )),
% 0.15/0.32 inference(pi_clausification,[],[f34])).
% 0.15/0.32 thf(f34,plain,(
% 0.15/0.32 ( ! [X2 : $i,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (binintersect @ X1 @ X2)) => (in @ Y0 @ X2)))) = $true)) )),
% 0.15/0.32 inference(beta_eta_normalization,[],[f33])).
% 0.15/0.32 thf(f33,plain,(
% 0.15/0.32 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (binintersect @ X1 @ Y0)) => (in @ Y1 @ Y0))))) @ X2))) )),
% 0.15/0.32 inference(pi_clausification,[],[f32])).
% 0.15/0.32 thf(f32,plain,(
% 0.15/0.32 ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (binintersect @ X1 @ Y0)) => (in @ Y1 @ Y0)))))))) )),
% 0.15/0.32 inference(beta_eta_normalization,[],[f31])).
% 0.15/0.32 thf(f31,plain,(
% 0.15/0.32 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (binintersect @ Y0 @ Y1)) => (in @ Y2 @ Y1))))))) @ X1))) )),
% 0.15/0.32 inference(pi_clausification,[],[f29])).
% 0.15/0.32 thf(f29,plain,(
% 0.15/0.32 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (binintersect @ Y0 @ Y1)) => (in @ Y2 @ Y1)))))))))),
% 0.15/0.32 inference(definition_unfolding,[],[f27,f19])).
% 0.15/0.32 thf(f19,plain,(
% 0.15/0.32 (binintersectER = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (binintersect @ Y0 @ Y1)) => (in @ Y2 @ Y1)))))))))),
% 0.15/0.32 inference(cnf_transformation,[],[f7])).
% 0.15/0.32 thf(f7,plain,(
% 0.15/0.32 (binintersectER = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (binintersect @ Y0 @ Y1)) => (in @ Y2 @ Y1)))))))))),
% 0.15/0.32 inference(fool_elimination,[],[f6])).
% 0.15/0.32 thf(f6,plain,(
% 0.15/0.32 (binintersectER = ! [X0,X1,X2] : ((in @ X0 @ (binintersect @ X2 @ X1)) => (in @ X0 @ X1)))),
% 0.15/0.32 inference(rectify,[],[f2])).
% 0.15/0.32 thf(f2,axiom,(
% 0.15/0.32 (binintersectER = ! [X2,X1,X0] : ((in @ X2 @ (binintersect @ X0 @ X1)) => (in @ X2 @ X1)))),
% 0.15/0.32 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectER)).
% 0.15/0.32 thf(f27,plain,(
% 0.15/0.32 (binintersectER = $true)),
% 0.15/0.32 inference(cnf_transformation,[],[f18])).
% 0.15/0.32 thf(f50,plain,(
% 0.15/0.32 ($false = (in @ sK4 @ sK2))),
% 0.15/0.32 inference(trivial_inequality_removal,[],[f49])).
% 0.15/0.32 thf(f49,plain,(
% 0.15/0.32 ($true != $true) | ($false = (in @ sK4 @ sK2))),
% 0.15/0.32 inference(superposition,[],[f23,f44])).
% 0.15/0.32 thf(f44,plain,(
% 0.15/0.32 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (in @ X1 @ (binunion @ X2 @ X3))) | ((in @ X1 @ X2) = $false)) )),
% 0.15/0.32 inference(binary_proxy_clausification,[],[f43])).
% 0.15/0.32 thf(f43,plain,(
% 0.15/0.32 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((in @ X1 @ X2) => (in @ X1 @ (binunion @ X2 @ X3))) = $true)) )),
% 0.15/0.32 inference(beta_eta_normalization,[],[f42])).
% 0.15/0.32 thf(f42,plain,(
% 0.15/0.32 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((^[Y0 : $i]: ((in @ X1 @ X2) => (in @ X1 @ (binunion @ X2 @ Y0)))) @ X3) = $true)) )),
% 0.15/0.32 inference(pi_clausification,[],[f41])).
% 0.15/0.32 thf(f41,plain,(
% 0.15/0.32 ( ! [X2 : $i,X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((in @ X1 @ X2) => (in @ X1 @ (binunion @ X2 @ Y0))))))) )),
% 0.15/0.32 inference(beta_eta_normalization,[],[f40])).
% 0.15/0.32 thf(f40,plain,(
% 0.15/0.32 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ Y0) => (in @ X1 @ (binunion @ Y0 @ Y1)))))) @ X2) = $true)) )),
% 0.15/0.32 inference(pi_clausification,[],[f39])).
% 0.15/0.32 thf(f39,plain,(
% 0.15/0.32 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ Y0) => (in @ X1 @ (binunion @ Y0 @ Y1))))))) = $true)) )),
% 0.15/0.32 inference(beta_eta_normalization,[],[f38])).
% 0.15/0.32 thf(f38,plain,(
% 0.15/0.32 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y1) => (in @ Y0 @ (binunion @ Y1 @ Y2)))))))) @ X1) = $true)) )),
% 0.15/0.32 inference(pi_clausification,[],[f30])).
% 0.15/0.32 thf(f30,plain,(
% 0.15/0.32 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y1) => (in @ Y0 @ (binunion @ Y1 @ Y2))))))))))),
% 0.15/0.32 inference(definition_unfolding,[],[f28,f26])).
% 0.15/0.32 thf(f26,plain,(
% 0.15/0.32 (binunionIL = $true)),
% 0.15/0.32 inference(cnf_transformation,[],[f18])).
% 0.15/0.32 thf(f28,plain,(
% 0.15/0.32 (binunionIL = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y1) => (in @ Y0 @ (binunion @ Y1 @ Y2))))))))))),
% 0.15/0.32 inference(cnf_transformation,[],[f11])).
% 0.15/0.32 thf(f11,plain,(
% 0.15/0.32 (binunionIL = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y1) => (in @ Y0 @ (binunion @ Y1 @ Y2))))))))))),
% 0.15/0.32 inference(fool_elimination,[],[f10])).
% 0.15/0.32 thf(f10,plain,(
% 0.15/0.32 (! [X0,X1,X2] : ((in @ X2 @ X1) => (in @ X2 @ (binunion @ X1 @ X0))) = binunionIL)),
% 0.15/0.32 inference(rectify,[],[f1])).
% 0.15/0.32 thf(f1,axiom,(
% 0.15/0.32 (! [X1,X0,X2] : ((in @ X2 @ X0) => (in @ X2 @ (binunion @ X0 @ X1))) = binunionIL)),
% 0.15/0.32 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binunionIL)).
% 0.15/0.32 thf(f23,plain,(
% 0.15/0.32 ((in @ sK4 @ (binunion @ sK2 @ sK3)) != $true)),
% 0.15/0.32 inference(cnf_transformation,[],[f18])).
% 0.15/0.32 % SZS output end Proof for theBenchmark
% 0.15/0.32 % (30855)------------------------------
% 0.15/0.32 % (30855)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (30855)Termination reason: Refutation
% 0.15/0.32
% 0.15/0.32 % (30855)Memory used [KB]: 5500
% 0.15/0.32 % (30855)Time elapsed: 0.005 s
% 0.15/0.32 % (30855)Instructions burned: 4 (million)
% 0.15/0.32 % (30855)------------------------------
% 0.15/0.32 % (30855)------------------------------
% 0.15/0.32 % (30854)Success in time 0.012 s
% 0.15/0.32 % Vampire---4.8 exiting
%------------------------------------------------------------------------------