TSTP Solution File: SEU576^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU576^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:49:42 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 : SEU576^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.37 % Computer : n002.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sun May 19 17:48:38 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TH0_THM_EQU_NAR problem
% 0.15/0.37 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.39 % (26892)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.39 % (26893)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 (3000ds/27Mi)
% 0.15/0.39 % (26894)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.39 % (26895)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.39 % (26891)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.39 % (26896)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.39 % (26898)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.39 % (26897)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.39 % (26894)Instruction limit reached!
% 0.15/0.39 % (26894)------------------------------
% 0.15/0.39 % (26894)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (26894)Termination reason: Unknown
% 0.15/0.39 % (26894)Termination phase: Property scanning
% 0.15/0.39
% 0.15/0.39 % (26895)Instruction limit reached!
% 0.15/0.39 % (26895)------------------------------
% 0.15/0.39 % (26895)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (26895)Termination reason: Unknown
% 0.15/0.39 % (26895)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (26895)Memory used [KB]: 895
% 0.15/0.39 % (26895)Time elapsed: 0.003 s
% 0.15/0.39 % (26895)Instructions burned: 2 (million)
% 0.15/0.39 % (26895)------------------------------
% 0.15/0.39 % (26895)------------------------------
% 0.15/0.39 % (26894)Memory used [KB]: 895
% 0.15/0.39 % (26894)Time elapsed: 0.003 s
% 0.15/0.39 % (26894)Instructions burned: 2 (million)
% 0.15/0.39 % (26894)------------------------------
% 0.15/0.39 % (26894)------------------------------
% 0.15/0.39 % (26898)Instruction limit reached!
% 0.15/0.39 % (26898)------------------------------
% 0.15/0.39 % (26898)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (26898)Termination reason: Unknown
% 0.15/0.39 % (26898)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (26898)Memory used [KB]: 5500
% 0.15/0.39 % (26898)Time elapsed: 0.004 s
% 0.15/0.39 % (26898)Instructions burned: 3 (million)
% 0.15/0.39 % (26898)------------------------------
% 0.15/0.39 % (26898)------------------------------
% 0.15/0.39 % (26892)Instruction limit reached!
% 0.15/0.39 % (26892)------------------------------
% 0.15/0.39 % (26892)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (26892)Termination reason: Unknown
% 0.15/0.39 % (26892)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (26892)Memory used [KB]: 5500
% 0.15/0.39 % (26892)Time elapsed: 0.005 s
% 0.15/0.39 % (26892)Instructions burned: 4 (million)
% 0.15/0.39 % (26892)------------------------------
% 0.15/0.39 % (26892)------------------------------
% 0.15/0.39 % (26897)First to succeed.
% 0.15/0.39 % (26896)Also succeeded, but the first one will report.
% 0.15/0.39 % (26897)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_1, type, powerset: $i > $i).
% 0.15/0.39 thf(func_def_4, type, subset: $i > $i > $o).
% 0.15/0.39 thf(func_def_10, type, sK2: $i > $i > $i).
% 0.15/0.39 thf(f62,plain,(
% 0.15/0.39 $false),
% 0.15/0.39 inference(subsumption_resolution,[],[f60,f35])).
% 0.15/0.39 thf(f35,plain,(
% 0.15/0.39 ($true != (in @ sK3 @ (powerset @ sK4)))),
% 0.15/0.39 inference(cnf_transformation,[],[f24])).
% 0.15/0.39 thf(f24,plain,(
% 0.15/0.39 (subsetE = $true) & (($true != (in @ sK3 @ (powerset @ sK4))) & ($true = (subset @ sK3 @ sK4))) & (powersetI = $true)),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f22,f23])).
% 0.15/0.39 thf(f23,plain,(
% 0.15/0.39 ? [X0,X1] : (($true != (in @ X0 @ (powerset @ X1))) & ((subset @ X0 @ X1) = $true)) => (($true != (in @ sK3 @ (powerset @ sK4))) & ($true = (subset @ sK3 @ sK4)))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f22,plain,(
% 0.15/0.39 (subsetE = $true) & ? [X0,X1] : (($true != (in @ X0 @ (powerset @ X1))) & ((subset @ X0 @ X1) = $true)) & (powersetI = $true)),
% 0.15/0.39 inference(rectify,[],[f16])).
% 0.15/0.39 thf(f16,plain,(
% 0.15/0.39 (subsetE = $true) & ? [X1,X0] : (((in @ X1 @ (powerset @ X0)) != $true) & ((subset @ X1 @ X0) = $true)) & (powersetI = $true)),
% 0.15/0.39 inference(flattening,[],[f15])).
% 0.15/0.39 thf(f15,plain,(
% 0.15/0.39 (? [X1,X0] : (((in @ X1 @ (powerset @ X0)) != $true) & ((subset @ X1 @ X0) = $true)) & (subsetE = $true)) & (powersetI = $true)),
% 0.15/0.39 inference(ennf_transformation,[],[f9])).
% 0.15/0.39 thf(f9,plain,(
% 0.15/0.39 ~((powersetI = $true) => ((subsetE = $true) => ! [X0,X1] : (((subset @ X1 @ X0) = $true) => ((in @ X1 @ (powerset @ X0)) = $true))))),
% 0.15/0.39 inference(fool_elimination,[],[f8])).
% 0.15/0.39 thf(f8,plain,(
% 0.15/0.39 ~(powersetI => (subsetE => ! [X0,X1] : ((subset @ X1 @ X0) => (in @ X1 @ (powerset @ X0)))))),
% 0.15/0.39 inference(rectify,[],[f4])).
% 0.15/0.39 thf(f4,negated_conjecture,(
% 0.15/0.39 ~(powersetI => (subsetE => ! [X0,X1] : ((subset @ X1 @ X0) => (in @ X1 @ (powerset @ X0)))))),
% 0.15/0.39 inference(negated_conjecture,[],[f3])).
% 0.15/0.39 thf(f3,conjecture,(
% 0.15/0.39 powersetI => (subsetE => ! [X0,X1] : ((subset @ X1 @ X0) => (in @ X1 @ (powerset @ X0))))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetI1)).
% 0.15/0.39 thf(f60,plain,(
% 0.15/0.39 ($true = (in @ sK3 @ (powerset @ sK4)))),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f58])).
% 0.15/0.39 thf(f58,plain,(
% 0.15/0.39 ($true = (in @ sK3 @ (powerset @ sK4))) | ($true != $true)),
% 0.15/0.39 inference(superposition,[],[f51,f57])).
% 0.15/0.39 thf(f57,plain,(
% 0.15/0.39 ($true = (in @ (sK2 @ sK3 @ sK4) @ sK4))),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f56])).
% 0.15/0.39 thf(f56,plain,(
% 0.15/0.39 ($true != $true) | ($true = (in @ (sK2 @ sK3 @ sK4) @ sK4))),
% 0.15/0.39 inference(superposition,[],[f53,f55])).
% 0.15/0.39 thf(f55,plain,(
% 0.15/0.39 ($true = (in @ (sK2 @ sK3 @ sK4) @ sK3))),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f54])).
% 0.15/0.39 thf(f54,plain,(
% 0.15/0.39 ($true = (in @ (sK2 @ sK3 @ sK4) @ sK3)) | ($true != $true)),
% 0.15/0.39 inference(superposition,[],[f35,f50])).
% 0.15/0.39 thf(f50,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (($true = (in @ X4 @ (powerset @ X3))) | ($true = (in @ (sK2 @ X4 @ X3) @ X4))) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f44])).
% 0.15/0.39 thf(f44,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (($true = (in @ (sK2 @ X4 @ X3) @ X4)) | ($true != $true) | ($true = (in @ X4 @ (powerset @ X3)))) )),
% 0.15/0.39 inference(definition_unfolding,[],[f29,f33])).
% 0.15/0.39 thf(f33,plain,(
% 0.15/0.39 (powersetI = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f24])).
% 0.15/0.39 thf(f29,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (($true = (in @ X4 @ (powerset @ X3))) | ($true = (in @ (sK2 @ X4 @ X3) @ X4)) | (powersetI != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f21])).
% 0.15/0.39 thf(f21,plain,(
% 0.15/0.39 ((powersetI = $true) | (((in @ sK1 @ (powerset @ sK0)) != $true) & ! [X2] : (($true = (in @ X2 @ sK0)) | ($true != (in @ X2 @ sK1))))) & (! [X3,X4] : (($true = (in @ X4 @ (powerset @ X3))) | (($true != (in @ (sK2 @ X4 @ X3) @ X3)) & ($true = (in @ (sK2 @ X4 @ X3) @ X4)))) | (powersetI != $true))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f18,f20,f19])).
% 0.15/0.39 thf(f19,plain,(
% 0.15/0.39 ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) != $true) & ! [X2] : (((in @ X2 @ X0) = $true) | ((in @ X2 @ X1) != $true))) => (((in @ sK1 @ (powerset @ sK0)) != $true) & ! [X2] : (($true = (in @ X2 @ sK0)) | ($true != (in @ X2 @ sK1))))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f20,plain,(
% 0.15/0.39 ! [X3,X4] : (? [X5] : (($true != (in @ X5 @ X3)) & ($true = (in @ X5 @ X4))) => (($true != (in @ (sK2 @ X4 @ X3) @ X3)) & ($true = (in @ (sK2 @ X4 @ X3) @ X4))))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f18,plain,(
% 0.15/0.39 ((powersetI = $true) | ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) != $true) & ! [X2] : (((in @ X2 @ X0) = $true) | ((in @ X2 @ X1) != $true)))) & (! [X3,X4] : (($true = (in @ X4 @ (powerset @ X3))) | ? [X5] : (($true != (in @ X5 @ X3)) & ($true = (in @ X5 @ X4)))) | (powersetI != $true))),
% 0.15/0.39 inference(rectify,[],[f17])).
% 0.15/0.39 thf(f17,plain,(
% 0.15/0.39 ((powersetI = $true) | ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) != $true) & ! [X2] : (((in @ X2 @ X0) = $true) | ((in @ X2 @ X1) != $true)))) & (! [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) | ? [X2] : (((in @ X2 @ X0) != $true) & ((in @ X2 @ X1) = $true))) | (powersetI != $true))),
% 0.15/0.39 inference(nnf_transformation,[],[f14])).
% 0.15/0.39 thf(f14,plain,(
% 0.15/0.39 (powersetI = $true) <=> ! [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) | ? [X2] : (((in @ X2 @ X0) != $true) & ((in @ X2 @ X1) = $true)))),
% 0.15/0.39 inference(ennf_transformation,[],[f7])).
% 0.15/0.39 thf(f7,plain,(
% 0.15/0.39 ! [X0,X1] : (! [X2] : (((in @ X2 @ X1) = $true) => ((in @ X2 @ X0) = $true)) => ((in @ X1 @ (powerset @ X0)) = $true)) <=> (powersetI = $true)),
% 0.15/0.39 inference(fool_elimination,[],[f6])).
% 0.15/0.39 thf(f6,plain,(
% 0.15/0.39 (! [X0,X1] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (in @ X1 @ (powerset @ X0))) = powersetI)),
% 0.15/0.39 inference(rectify,[],[f1])).
% 0.15/0.39 thf(f1,axiom,(
% 0.15/0.39 (! [X0,X1] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (in @ X1 @ (powerset @ X0))) = powersetI)),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetI)).
% 0.15/0.39 thf(f53,plain,(
% 0.15/0.39 ( ! [X0 : $i] : (($true != (in @ X0 @ sK3)) | ($true = (in @ X0 @ sK4))) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f52])).
% 0.15/0.39 thf(f52,plain,(
% 0.15/0.39 ( ! [X0 : $i] : (($true != $true) | ($true = (in @ X0 @ sK4)) | ($true != (in @ X0 @ sK3))) )),
% 0.15/0.39 inference(superposition,[],[f49,f34])).
% 0.15/0.39 thf(f34,plain,(
% 0.15/0.39 ($true = (subset @ sK3 @ sK4))),
% 0.15/0.39 inference(cnf_transformation,[],[f24])).
% 0.15/0.39 thf(f49,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (subset @ X2 @ X0)) | ($true != (in @ X1 @ X2)) | ($true = (in @ X1 @ X0))) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f45])).
% 0.15/0.39 thf(f45,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (subset @ X2 @ X0)) | ($true != $true) | ($true != (in @ X1 @ X2)) | ($true = (in @ X1 @ X0))) )),
% 0.15/0.39 inference(definition_unfolding,[],[f40,f36])).
% 0.15/0.39 thf(f36,plain,(
% 0.15/0.39 (subsetE = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f24])).
% 0.15/0.39 thf(f40,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (subset @ X2 @ X0)) | ($true != (in @ X1 @ X2)) | ($true = (in @ X1 @ X0)) | (subsetE != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f28])).
% 0.15/0.39 thf(f28,plain,(
% 0.15/0.39 (! [X0,X1,X2] : (($true != (subset @ X2 @ X0)) | ($true != (in @ X1 @ X2)) | ($true = (in @ X1 @ X0))) | (subsetE != $true)) & ((subsetE = $true) | (($true = (subset @ sK7 @ sK5)) & ($true = (in @ sK6 @ sK7)) & ($true != (in @ sK6 @ sK5))))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f26,f27])).
% 0.15/0.39 thf(f27,plain,(
% 0.15/0.39 ? [X3,X4,X5] : (((subset @ X5 @ X3) = $true) & ($true = (in @ X4 @ X5)) & ($true != (in @ X4 @ X3))) => (($true = (subset @ sK7 @ sK5)) & ($true = (in @ sK6 @ sK7)) & ($true != (in @ sK6 @ sK5)))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f26,plain,(
% 0.15/0.39 (! [X0,X1,X2] : (($true != (subset @ X2 @ X0)) | ($true != (in @ X1 @ X2)) | ($true = (in @ X1 @ X0))) | (subsetE != $true)) & ((subsetE = $true) | ? [X3,X4,X5] : (((subset @ X5 @ X3) = $true) & ($true = (in @ X4 @ X5)) & ($true != (in @ X4 @ X3))))),
% 0.15/0.39 inference(rectify,[],[f25])).
% 0.15/0.39 thf(f25,plain,(
% 0.15/0.39 (! [X1,X2,X0] : (((subset @ X0 @ X1) != $true) | ((in @ X2 @ X0) != $true) | ((in @ X2 @ X1) = $true)) | (subsetE != $true)) & ((subsetE = $true) | ? [X1,X2,X0] : (((subset @ X0 @ X1) = $true) & ((in @ X2 @ X0) = $true) & ((in @ X2 @ X1) != $true)))),
% 0.15/0.39 inference(nnf_transformation,[],[f13])).
% 0.15/0.39 thf(f13,plain,(
% 0.15/0.39 ! [X1,X2,X0] : (((subset @ X0 @ X1) != $true) | ((in @ X2 @ X0) != $true) | ((in @ X2 @ X1) = $true)) <=> (subsetE = $true)),
% 0.15/0.39 inference(flattening,[],[f12])).
% 0.15/0.39 thf(f12,plain,(
% 0.15/0.39 ! [X2,X0,X1] : ((((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) != $true)) | ((subset @ X0 @ X1) != $true)) <=> (subsetE = $true)),
% 0.15/0.39 inference(ennf_transformation,[],[f11])).
% 0.15/0.39 thf(f11,plain,(
% 0.15/0.39 ! [X2,X0,X1] : (((subset @ X0 @ X1) = $true) => (((in @ X2 @ X0) = $true) => ((in @ X2 @ X1) = $true))) <=> (subsetE = $true)),
% 0.15/0.39 inference(fool_elimination,[],[f10])).
% 0.15/0.39 thf(f10,plain,(
% 0.15/0.39 (! [X0,X1,X2] : ((subset @ X0 @ X1) => ((in @ X2 @ X0) => (in @ X2 @ X1))) = subsetE)),
% 0.15/0.39 inference(rectify,[],[f2])).
% 0.15/0.39 thf(f2,axiom,(
% 0.15/0.39 (! [X0,X1,X2] : ((subset @ X0 @ X1) => ((in @ X2 @ X0) => (in @ X2 @ X1))) = subsetE)),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetE)).
% 0.15/0.39 thf(f51,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (($true != (in @ (sK2 @ X4 @ X3) @ X3)) | ($true = (in @ X4 @ (powerset @ X3)))) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f43])).
% 0.15/0.39 thf(f43,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (($true != $true) | ($true != (in @ (sK2 @ X4 @ X3) @ X3)) | ($true = (in @ X4 @ (powerset @ X3)))) )),
% 0.15/0.39 inference(definition_unfolding,[],[f30,f33])).
% 0.15/0.39 thf(f30,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (($true = (in @ X4 @ (powerset @ X3))) | ($true != (in @ (sK2 @ X4 @ X3) @ X3)) | (powersetI != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f21])).
% 0.15/0.39 % SZS output end Proof for theBenchmark
% 0.15/0.39 % (26897)------------------------------
% 0.15/0.39 % (26897)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (26897)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (26897)Memory used [KB]: 5500
% 0.15/0.39 % (26897)Time elapsed: 0.007 s
% 0.15/0.39 % (26897)Instructions burned: 4 (million)
% 0.15/0.39 % (26897)------------------------------
% 0.15/0.39 % (26897)------------------------------
% 0.15/0.39 % (26890)Success in time 0.017 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------