TSTP Solution File: SEU727^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU727^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 : n023.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:04 EDT 2024
% Result : Theorem 0.19s 0.37s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : SEU727^2 : TPTP v8.2.0. Released v3.7.0.
% 0.02/0.13 % 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.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 18:01:08 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 This is a TH0_THM_EQU_NAR problem
% 0.12/0.34 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.19/0.36 % (28931)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.19/0.36 % (28935)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.19/0.36 % (28936)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.19/0.36 % (28932)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.19/0.36 % (28938)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.19/0.36 % (28934)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.36 % (28937)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.19/0.36 % (28933)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.19/0.36 % (28934)Instruction limit reached!
% 0.19/0.36 % (28934)------------------------------
% 0.19/0.36 % (28934)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.36 % (28934)Termination reason: Unknown
% 0.19/0.36 % (28935)Instruction limit reached!
% 0.19/0.36 % (28935)------------------------------
% 0.19/0.36 % (28935)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.36 % (28935)Termination reason: Unknown
% 0.19/0.36 % (28935)Termination phase: Saturation
% 0.19/0.36
% 0.19/0.36 % (28935)Memory used [KB]: 895
% 0.19/0.36 % (28935)Time elapsed: 0.003 s
% 0.19/0.36 % (28935)Instructions burned: 3 (million)
% 0.19/0.36 % (28935)------------------------------
% 0.19/0.36 % (28935)------------------------------
% 0.19/0.36 % (28934)Termination phase: Saturation
% 0.19/0.36
% 0.19/0.36 % (28934)Memory used [KB]: 895
% 0.19/0.36 % (28934)Time elapsed: 0.003 s
% 0.19/0.36 % (28934)Instructions burned: 3 (million)
% 0.19/0.36 % (28934)------------------------------
% 0.19/0.36 % (28934)------------------------------
% 0.19/0.36 % (28938)Instruction limit reached!
% 0.19/0.36 % (28938)------------------------------
% 0.19/0.36 % (28938)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.36 % (28938)Termination reason: Unknown
% 0.19/0.36 % (28938)Termination phase: Saturation
% 0.19/0.36
% 0.19/0.36 % (28938)Memory used [KB]: 5500
% 0.19/0.36 % (28938)Time elapsed: 0.004 s
% 0.19/0.36 % (28938)Instructions burned: 3 (million)
% 0.19/0.36 % (28938)------------------------------
% 0.19/0.36 % (28938)------------------------------
% 0.19/0.36 % (28936)First to succeed.
% 0.19/0.36 % (28932)Instruction limit reached!
% 0.19/0.36 % (28932)------------------------------
% 0.19/0.36 % (28932)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.36 % (28932)Termination reason: Unknown
% 0.19/0.36 % (28932)Termination phase: Saturation
% 0.19/0.36
% 0.19/0.36 % (28932)Memory used [KB]: 5500
% 0.19/0.36 % (28932)Time elapsed: 0.005 s
% 0.19/0.36 % (28932)Instructions burned: 5 (million)
% 0.19/0.36 % (28932)------------------------------
% 0.19/0.36 % (28932)------------------------------
% 0.19/0.36 % (28937)Also succeeded, but the first one will report.
% 0.19/0.37 % (28936)Refutation found. Thanks to Tanya!
% 0.19/0.37 % SZS status Theorem for theBenchmark
% 0.19/0.37 % SZS output start Proof for theBenchmark
% 0.19/0.37 thf(func_def_0, type, in: $i > $i > $o).
% 0.19/0.37 thf(func_def_1, type, powerset: $i > $i).
% 0.19/0.37 thf(func_def_2, type, setminus: $i > $i > $i).
% 0.19/0.37 thf(f58,plain,(
% 0.19/0.37 $false),
% 0.19/0.37 inference(subsumption_resolution,[],[f57,f36])).
% 0.19/0.37 thf(f36,plain,(
% 0.19/0.37 ((in @ sK5 @ sK4) = $true)),
% 0.19/0.37 inference(cnf_transformation,[],[f25])).
% 0.19/0.37 thf(f25,plain,(
% 0.19/0.37 (setminusER = $true) & ((((in @ sK5 @ (setminus @ sK3 @ (setminus @ sK3 @ sK4))) != $true) & ((in @ sK5 @ sK3) = $true) & ((in @ sK5 @ sK4) = $true)) & ($true = (in @ sK4 @ (powerset @ sK3)))) & (setminusI = $true)),
% 0.19/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f18,f24,f23])).
% 0.19/0.37 thf(f23,plain,(
% 0.19/0.37 ? [X0,X1] : (? [X2] : (((in @ X2 @ (setminus @ X0 @ (setminus @ X0 @ X1))) != $true) & ((in @ X2 @ X0) = $true) & ((in @ X2 @ X1) = $true)) & ((in @ X1 @ (powerset @ X0)) = $true)) => (? [X2] : (((in @ X2 @ (setminus @ sK3 @ (setminus @ sK3 @ sK4))) != $true) & ((in @ X2 @ sK3) = $true) & ((in @ X2 @ sK4) = $true)) & ($true = (in @ sK4 @ (powerset @ sK3))))),
% 0.19/0.37 introduced(choice_axiom,[])).
% 0.19/0.37 thf(f24,plain,(
% 0.19/0.37 ? [X2] : (((in @ X2 @ (setminus @ sK3 @ (setminus @ sK3 @ sK4))) != $true) & ((in @ X2 @ sK3) = $true) & ((in @ X2 @ sK4) = $true)) => (((in @ sK5 @ (setminus @ sK3 @ (setminus @ sK3 @ sK4))) != $true) & ((in @ sK5 @ sK3) = $true) & ((in @ sK5 @ sK4) = $true))),
% 0.19/0.37 introduced(choice_axiom,[])).
% 0.19/0.37 thf(f18,plain,(
% 0.19/0.37 (setminusER = $true) & ? [X0,X1] : (? [X2] : (((in @ X2 @ (setminus @ X0 @ (setminus @ X0 @ X1))) != $true) & ((in @ X2 @ X0) = $true) & ((in @ X2 @ X1) = $true)) & ((in @ X1 @ (powerset @ X0)) = $true)) & (setminusI = $true)),
% 0.19/0.37 inference(flattening,[],[f17])).
% 0.19/0.37 thf(f17,plain,(
% 0.19/0.37 (? [X0,X1] : (? [X2] : ((((in @ X2 @ (setminus @ X0 @ (setminus @ X0 @ X1))) != $true) & ((in @ X2 @ X1) = $true)) & ((in @ X2 @ X0) = $true)) & ((in @ X1 @ (powerset @ X0)) = $true)) & (setminusER = $true)) & (setminusI = $true)),
% 0.19/0.37 inference(ennf_transformation,[],[f11])).
% 0.19/0.37 thf(f11,plain,(
% 0.19/0.37 ~((setminusI = $true) => ((setminusER = $true) => ! [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ X0) = $true) => (((in @ X2 @ X1) = $true) => ((in @ X2 @ (setminus @ X0 @ (setminus @ X0 @ X1))) = $true))))))),
% 0.19/0.37 inference(fool_elimination,[],[f10])).
% 0.19/0.37 thf(f10,plain,(
% 0.19/0.37 ~(setminusI => (setminusER => ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => ((in @ X2 @ X1) => (in @ X2 @ (setminus @ X0 @ (setminus @ X0 @ X1))))))))),
% 0.19/0.37 inference(rectify,[],[f4])).
% 0.19/0.37 thf(f4,negated_conjecture,(
% 0.19/0.37 ~(setminusI => (setminusER => ! [X0,X3] : ((in @ X3 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => ((in @ X2 @ X3) => (in @ X2 @ (setminus @ X0 @ (setminus @ X0 @ X3))))))))),
% 0.19/0.37 inference(negated_conjecture,[],[f3])).
% 0.19/0.37 thf(f3,conjecture,(
% 0.19/0.37 setminusI => (setminusER => ! [X0,X3] : ((in @ X3 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => ((in @ X2 @ X3) => (in @ X2 @ (setminus @ X0 @ (setminus @ X0 @ X3)))))))),
% 0.19/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',doubleComplementI1)).
% 0.19/0.37 thf(f57,plain,(
% 0.19/0.37 ((in @ sK5 @ sK4) != $true)),
% 0.19/0.37 inference(trivial_inequality_removal,[],[f56])).
% 0.19/0.37 thf(f56,plain,(
% 0.19/0.37 ($true != $true) | ((in @ sK5 @ sK4) != $true)),
% 0.19/0.37 inference(superposition,[],[f50,f55])).
% 0.19/0.37 thf(f55,plain,(
% 0.19/0.37 ((in @ sK5 @ (setminus @ sK3 @ sK4)) = $true)),
% 0.19/0.37 inference(subsumption_resolution,[],[f54,f37])).
% 0.19/0.37 thf(f37,plain,(
% 0.19/0.37 ((in @ sK5 @ sK3) = $true)),
% 0.19/0.37 inference(cnf_transformation,[],[f25])).
% 0.19/0.37 thf(f54,plain,(
% 0.19/0.37 ((in @ sK5 @ (setminus @ sK3 @ sK4)) = $true) | ((in @ sK5 @ sK3) != $true)),
% 0.19/0.37 inference(trivial_inequality_removal,[],[f52])).
% 0.19/0.37 thf(f52,plain,(
% 0.19/0.37 ($true != $true) | ((in @ sK5 @ (setminus @ sK3 @ sK4)) = $true) | ((in @ sK5 @ sK3) != $true)),
% 0.19/0.37 inference(superposition,[],[f38,f51])).
% 0.19/0.37 thf(f51,plain,(
% 0.19/0.37 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X3 @ (setminus @ X4 @ X5)) = $true) | ((in @ X3 @ X4) != $true) | ((in @ X3 @ X5) = $true)) )),
% 0.19/0.37 inference(trivial_inequality_removal,[],[f46])).
% 0.19/0.37 thf(f46,plain,(
% 0.19/0.37 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X3 @ (setminus @ X4 @ X5)) = $true) | ($true != $true) | ((in @ X3 @ X4) != $true) | ((in @ X3 @ X5) = $true)) )),
% 0.19/0.37 inference(definition_unfolding,[],[f30,f34])).
% 0.19/0.37 thf(f34,plain,(
% 0.19/0.37 (setminusI = $true)),
% 0.19/0.37 inference(cnf_transformation,[],[f25])).
% 0.19/0.37 thf(f30,plain,(
% 0.19/0.37 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X3 @ (setminus @ X4 @ X5)) = $true) | ((in @ X3 @ X4) != $true) | ((in @ X3 @ X5) = $true) | (setminusI != $true)) )),
% 0.19/0.37 inference(cnf_transformation,[],[f22])).
% 0.19/0.37 thf(f22,plain,(
% 0.19/0.37 ((setminusI = $true) | (((in @ sK0 @ (setminus @ sK1 @ sK2)) != $true) & ((in @ sK0 @ sK1) = $true) & ((in @ sK0 @ sK2) != $true))) & (! [X3,X4,X5] : (((in @ X3 @ (setminus @ X4 @ X5)) = $true) | ((in @ X3 @ X4) != $true) | ((in @ X3 @ X5) = $true)) | (setminusI != $true))),
% 0.19/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f20,f21])).
% 0.19/0.37 thf(f21,plain,(
% 0.19/0.37 ? [X0,X1,X2] : (((in @ X0 @ (setminus @ X1 @ X2)) != $true) & ((in @ X0 @ X1) = $true) & ($true != (in @ X0 @ X2))) => (((in @ sK0 @ (setminus @ sK1 @ sK2)) != $true) & ((in @ sK0 @ sK1) = $true) & ((in @ sK0 @ sK2) != $true))),
% 0.19/0.37 introduced(choice_axiom,[])).
% 0.19/0.37 thf(f20,plain,(
% 0.19/0.37 ((setminusI = $true) | ? [X0,X1,X2] : (((in @ X0 @ (setminus @ X1 @ X2)) != $true) & ((in @ X0 @ X1) = $true) & ($true != (in @ X0 @ X2)))) & (! [X3,X4,X5] : (((in @ X3 @ (setminus @ X4 @ X5)) = $true) | ((in @ X3 @ X4) != $true) | ((in @ X3 @ X5) = $true)) | (setminusI != $true))),
% 0.19/0.37 inference(rectify,[],[f19])).
% 0.19/0.37 thf(f19,plain,(
% 0.19/0.37 ((setminusI = $true) | ? [X2,X1,X0] : (((in @ X2 @ (setminus @ X1 @ X0)) != $true) & ((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true))) & (! [X2,X1,X0] : (((in @ X2 @ (setminus @ X1 @ X0)) = $true) | ((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true)) | (setminusI != $true))),
% 0.19/0.37 inference(nnf_transformation,[],[f15])).
% 0.19/0.37 thf(f15,plain,(
% 0.19/0.37 (setminusI = $true) <=> ! [X2,X1,X0] : (((in @ X2 @ (setminus @ X1 @ X0)) = $true) | ((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true))),
% 0.19/0.37 inference(flattening,[],[f14])).
% 0.19/0.37 thf(f14,plain,(
% 0.19/0.37 (setminusI = $true) <=> ! [X2,X1,X0] : ((((in @ X2 @ (setminus @ X1 @ X0)) = $true) | ((in @ X2 @ X0) = $true)) | ((in @ X2 @ X1) != $true))),
% 0.19/0.37 inference(ennf_transformation,[],[f12])).
% 0.19/0.37 thf(f12,plain,(
% 0.19/0.37 (setminusI = $true) <=> ! [X2,X1,X0] : (((in @ X2 @ X1) = $true) => (((in @ X2 @ X0) != $true) => ((in @ X2 @ (setminus @ X1 @ X0)) = $true)))),
% 0.19/0.37 inference(flattening,[],[f7])).
% 0.19/0.37 thf(f7,plain,(
% 0.19/0.37 ! [X0,X1,X2] : (((in @ X2 @ X1) = $true) => (~((in @ X2 @ X0) = $true) => ((in @ X2 @ (setminus @ X1 @ X0)) = $true))) <=> (setminusI = $true)),
% 0.19/0.37 inference(fool_elimination,[],[f6])).
% 0.19/0.37 thf(f6,plain,(
% 0.19/0.37 (! [X0,X1,X2] : ((in @ X2 @ X1) => (~(in @ X2 @ X0) => (in @ X2 @ (setminus @ X1 @ X0)))) = setminusI)),
% 0.19/0.37 inference(rectify,[],[f1])).
% 0.19/0.37 thf(f1,axiom,(
% 0.19/0.37 (! [X1,X0,X2] : ((in @ X2 @ X0) => (~(in @ X2 @ X1) => (in @ X2 @ (setminus @ X0 @ X1)))) = setminusI)),
% 0.19/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusI)).
% 0.19/0.37 thf(f38,plain,(
% 0.19/0.37 ((in @ sK5 @ (setminus @ sK3 @ (setminus @ sK3 @ sK4))) != $true)),
% 0.19/0.37 inference(cnf_transformation,[],[f25])).
% 0.19/0.37 thf(f50,plain,(
% 0.19/0.37 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X1 @ (setminus @ X0 @ X2)) != $true) | ($true != (in @ X1 @ X2))) )),
% 0.19/0.37 inference(trivial_inequality_removal,[],[f47])).
% 0.19/0.37 thf(f47,plain,(
% 0.19/0.37 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X1 @ (setminus @ X0 @ X2)) != $true) | ($true != (in @ X1 @ X2)) | ($true != $true)) )),
% 0.19/0.37 inference(definition_unfolding,[],[f42,f39])).
% 0.19/0.37 thf(f39,plain,(
% 0.19/0.37 (setminusER = $true)),
% 0.19/0.37 inference(cnf_transformation,[],[f25])).
% 0.19/0.37 thf(f42,plain,(
% 0.19/0.37 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X1 @ (setminus @ X0 @ X2)) != $true) | ($true != (in @ X1 @ X2)) | (setminusER != $true)) )),
% 0.19/0.37 inference(cnf_transformation,[],[f29])).
% 0.19/0.37 thf(f29,plain,(
% 0.19/0.37 (! [X0,X1,X2] : (((in @ X1 @ (setminus @ X0 @ X2)) != $true) | ($true != (in @ X1 @ X2))) | (setminusER != $true)) & ((setminusER = $true) | (((in @ sK7 @ (setminus @ sK6 @ sK8)) = $true) & ((in @ sK7 @ sK8) = $true)))),
% 0.19/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f27,f28])).
% 0.19/0.37 thf(f28,plain,(
% 0.19/0.37 ? [X3,X4,X5] : (((in @ X4 @ (setminus @ X3 @ X5)) = $true) & ($true = (in @ X4 @ X5))) => (((in @ sK7 @ (setminus @ sK6 @ sK8)) = $true) & ((in @ sK7 @ sK8) = $true))),
% 0.19/0.37 introduced(choice_axiom,[])).
% 0.19/0.37 thf(f27,plain,(
% 0.19/0.37 (! [X0,X1,X2] : (((in @ X1 @ (setminus @ X0 @ X2)) != $true) | ($true != (in @ X1 @ X2))) | (setminusER != $true)) & ((setminusER = $true) | ? [X3,X4,X5] : (((in @ X4 @ (setminus @ X3 @ X5)) = $true) & ($true = (in @ X4 @ X5))))),
% 0.19/0.37 inference(rectify,[],[f26])).
% 0.19/0.37 thf(f26,plain,(
% 0.19/0.37 (! [X1,X0,X2] : (((in @ X0 @ (setminus @ X1 @ X2)) != $true) | ($true != (in @ X0 @ X2))) | (setminusER != $true)) & ((setminusER = $true) | ? [X1,X0,X2] : (((in @ X0 @ (setminus @ X1 @ X2)) = $true) & ($true = (in @ X0 @ X2))))),
% 0.19/0.37 inference(nnf_transformation,[],[f16])).
% 0.19/0.37 thf(f16,plain,(
% 0.19/0.37 ! [X1,X0,X2] : (((in @ X0 @ (setminus @ X1 @ X2)) != $true) | ($true != (in @ X0 @ X2))) <=> (setminusER = $true)),
% 0.19/0.37 inference(ennf_transformation,[],[f13])).
% 0.19/0.37 thf(f13,plain,(
% 0.19/0.37 ! [X0,X1,X2] : (((in @ X0 @ (setminus @ X1 @ X2)) = $true) => ($true != (in @ X0 @ X2))) <=> (setminusER = $true)),
% 0.19/0.37 inference(flattening,[],[f9])).
% 0.19/0.37 thf(f9,plain,(
% 0.19/0.37 ! [X0,X1,X2] : (((in @ X0 @ (setminus @ X1 @ X2)) = $true) => ~($true = (in @ X0 @ X2))) <=> (setminusER = $true)),
% 0.19/0.37 inference(fool_elimination,[],[f8])).
% 0.19/0.37 thf(f8,plain,(
% 0.19/0.37 (! [X0,X1,X2] : ((in @ X0 @ (setminus @ X1 @ X2)) => ~(in @ X0 @ X2)) = setminusER)),
% 0.19/0.37 inference(rectify,[],[f2])).
% 0.19/0.37 thf(f2,axiom,(
% 0.19/0.37 (! [X2,X0,X1] : ((in @ X2 @ (setminus @ X0 @ X1)) => ~(in @ X2 @ X1)) = setminusER)),
% 0.19/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusER)).
% 0.19/0.37 % SZS output end Proof for theBenchmark
% 0.19/0.37 % (28936)------------------------------
% 0.19/0.37 % (28936)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.37 % (28936)Termination reason: Refutation
% 0.19/0.37
% 0.19/0.37 % (28936)Memory used [KB]: 5500
% 0.19/0.37 % (28936)Time elapsed: 0.007 s
% 0.19/0.37 % (28936)Instructions burned: 4 (million)
% 0.19/0.37 % (28936)------------------------------
% 0.19/0.37 % (28936)------------------------------
% 0.19/0.37 % (28930)Success in time 0.01 s
% 0.19/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------