TSTP Solution File: SEU647^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU647^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 : n018.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:18 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.07/0.13 % Problem : SEU647^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n018.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 18:22:08 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 % (12217)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 % (12218)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 % (12219)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 % (12220)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.38 % (12220)Instruction limit reached!
% 0.15/0.38 % (12220)------------------------------
% 0.15/0.38 % (12220)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (12220)Termination reason: Unknown
% 0.15/0.38 % (12220)Termination phase: Property scanning
% 0.15/0.38
% 0.15/0.38 % (12220)Memory used [KB]: 895
% 0.15/0.38 % (12220)Time elapsed: 0.003 s
% 0.15/0.38 % (12220)Instructions burned: 2 (million)
% 0.15/0.38 % (12220)------------------------------
% 0.15/0.38 % (12220)------------------------------
% 0.15/0.38 % (12224)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.38 % (12218)Instruction limit reached!
% 0.15/0.38 % (12218)------------------------------
% 0.15/0.38 % (12218)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (12218)Termination reason: Unknown
% 0.15/0.38 % (12218)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (12218)Memory used [KB]: 5500
% 0.15/0.38 % (12218)Time elapsed: 0.004 s
% 0.15/0.38 % (12218)Instructions burned: 4 (million)
% 0.15/0.38 % (12218)------------------------------
% 0.15/0.38 % (12218)------------------------------
% 0.15/0.39 % (12221)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.39 % (12221)Instruction limit reached!
% 0.15/0.39 % (12221)------------------------------
% 0.15/0.39 % (12221)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (12221)Termination reason: Unknown
% 0.15/0.39 % (12221)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (12224)Instruction limit reached!
% 0.15/0.39 % (12224)------------------------------
% 0.15/0.39 % (12224)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (12224)Termination reason: Unknown
% 0.15/0.39 % (12221)Memory used [KB]: 895
% 0.15/0.39 % (12224)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (12221)Time elapsed: 0.003 s
% 0.15/0.39 % (12221)Instructions burned: 3 (million)
% 0.15/0.39 % (12224)Memory used [KB]: 5500
% 0.15/0.39 % (12221)------------------------------
% 0.15/0.39 % (12221)------------------------------
% 0.15/0.39 % (12224)Time elapsed: 0.004 s
% 0.15/0.39 % (12224)Instructions burned: 3 (million)
% 0.15/0.39 % (12224)------------------------------
% 0.15/0.39 % (12224)------------------------------
% 0.15/0.39 % (12217)First to succeed.
% 0.15/0.39 % (12223)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.39 % (12219)Also succeeded, but the first one will report.
% 0.15/0.39 % (12217)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(f45,plain,(
% 0.15/0.39 $false),
% 0.15/0.39 inference(subsumption_resolution,[],[f44,f19])).
% 0.15/0.39 thf(f19,plain,(
% 0.15/0.39 (sK1 != sK2)),
% 0.15/0.39 inference(cnf_transformation,[],[f15])).
% 0.15/0.39 thf(f15,plain,(
% 0.15/0.39 ((sK1 != sK2) & ((setadjoin @ (setadjoin @ sK2 @ emptyset) @ (setadjoin @ (setadjoin @ sK2 @ (setadjoin @ sK3 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ sK1 @ emptyset) @ (setadjoin @ (setadjoin @ sK1 @ (setadjoin @ sK0 @ emptyset)) @ emptyset)))) & (setukpairinjL1 = $true) & (setadjoinIL = $true)),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f13,f14])).
% 0.15/0.39 thf(f14,plain,(
% 0.15/0.39 ? [X0,X1,X2,X3] : ((X1 != X2) & ((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))) => ((sK1 != sK2) & ((setadjoin @ (setadjoin @ sK2 @ emptyset) @ (setadjoin @ (setadjoin @ sK2 @ (setadjoin @ sK3 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ sK1 @ emptyset) @ (setadjoin @ (setadjoin @ sK1 @ (setadjoin @ sK0 @ emptyset)) @ emptyset))))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f13,plain,(
% 0.15/0.39 ? [X0,X1,X2,X3] : ((X1 != X2) & ((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))) & (setukpairinjL1 = $true) & (setadjoinIL = $true)),
% 0.15/0.39 inference(flattening,[],[f12])).
% 0.15/0.39 thf(f12,plain,(
% 0.15/0.39 (? [X0,X1,X2,X3] : ((X1 != X2) & ((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))) & (setukpairinjL1 = $true)) & (setadjoinIL = $true)),
% 0.15/0.39 inference(ennf_transformation,[],[f9])).
% 0.15/0.39 thf(f9,plain,(
% 0.15/0.39 ~((setadjoinIL = $true) => ((setukpairinjL1 = $true) => ! [X0,X1,X2,X3] : (((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset))) => (X1 = X2))))),
% 0.15/0.39 inference(fool_elimination,[],[f8])).
% 0.15/0.39 thf(f8,plain,(
% 0.15/0.39 ~(setadjoinIL => (setukpairinjL1 => ! [X0,X1,X2,X3] : (((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset))) => (X1 = X2))))),
% 0.15/0.39 inference(rectify,[],[f4])).
% 0.15/0.39 thf(f4,negated_conjecture,(
% 0.15/0.39 ~(setadjoinIL => (setukpairinjL1 => ! [X3,X2,X0,X1] : (((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) => (X0 = X2))))),
% 0.15/0.39 inference(negated_conjecture,[],[f3])).
% 0.15/0.39 thf(f3,conjecture,(
% 0.15/0.39 setadjoinIL => (setukpairinjL1 => ! [X3,X2,X0,X1] : (((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) => (X0 = X2)))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairinjL2)).
% 0.15/0.39 thf(f44,plain,(
% 0.15/0.39 (sK1 = sK2)),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f42])).
% 0.15/0.39 thf(f42,plain,(
% 0.15/0.39 (sK1 = sK2) | ($false = $true)),
% 0.15/0.39 inference(superposition,[],[f31,f40])).
% 0.15/0.39 thf(f40,plain,(
% 0.15/0.39 ((in @ (setadjoin @ sK2 @ emptyset) @ (setadjoin @ (setadjoin @ sK1 @ emptyset) @ (setadjoin @ (setadjoin @ sK1 @ (setadjoin @ sK0 @ emptyset)) @ emptyset))) = $true)),
% 0.15/0.39 inference(superposition,[],[f35,f18])).
% 0.15/0.39 thf(f18,plain,(
% 0.15/0.39 ((setadjoin @ (setadjoin @ sK2 @ emptyset) @ (setadjoin @ (setadjoin @ sK2 @ (setadjoin @ sK3 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ sK1 @ emptyset) @ (setadjoin @ (setadjoin @ sK1 @ (setadjoin @ sK0 @ emptyset)) @ emptyset)))),
% 0.15/0.39 inference(cnf_transformation,[],[f15])).
% 0.15/0.39 thf(f35,plain,(
% 0.15/0.39 ( ! [X2 : $i,X1 : $i] : (($true = (in @ X2 @ (setadjoin @ X2 @ X1)))) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f34])).
% 0.15/0.39 thf(f34,plain,(
% 0.15/0.39 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: (in @ Y0 @ (setadjoin @ Y0 @ X1))) @ X2) = $true)) )),
% 0.15/0.39 inference(pi_clausification,[],[f33])).
% 0.15/0.39 thf(f33,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: (in @ Y0 @ (setadjoin @ Y0 @ X1)))))) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f32])).
% 0.15/0.39 thf(f32,plain,(
% 0.15/0.39 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ Y0))))) @ X1) = $true)) )),
% 0.15/0.39 inference(pi_clausification,[],[f23])).
% 0.15/0.39 thf(f23,plain,(
% 0.15/0.39 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ Y0)))))) = $true)),
% 0.15/0.39 inference(definition_unfolding,[],[f21,f16])).
% 0.15/0.39 thf(f16,plain,(
% 0.15/0.39 (setadjoinIL = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f15])).
% 0.15/0.39 thf(f21,plain,(
% 0.15/0.39 (setadjoinIL = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ Y0)))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f7])).
% 0.15/0.39 thf(f7,plain,(
% 0.15/0.39 (setadjoinIL = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ Y0)))))))),
% 0.15/0.39 inference(fool_elimination,[],[f6])).
% 0.15/0.39 thf(f6,plain,(
% 0.15/0.39 (setadjoinIL = ! [X0,X1] : (in @ X0 @ (setadjoin @ X0 @ X1)))),
% 0.15/0.39 inference(rectify,[],[f1])).
% 0.15/0.39 thf(f1,axiom,(
% 0.15/0.39 (setadjoinIL = ! [X0,X1] : (in @ X0 @ (setadjoin @ X0 @ X1)))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinIL)).
% 0.15/0.39 thf(f31,plain,(
% 0.15/0.39 ( ! [X2 : $i,X3 : $i,X1 : $i] : (((in @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) = $false) | (X1 = X2)) )),
% 0.15/0.39 inference(equality_proxy_clausification,[],[f30])).
% 0.15/0.39 thf(f30,plain,(
% 0.15/0.39 ( ! [X2 : $i,X3 : $i,X1 : $i] : (((X2 = X1) = $true) | ((in @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) = $false)) )),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f29])).
% 0.15/0.39 thf(f29,plain,(
% 0.15/0.39 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = ((in @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) => (X2 = X1)))) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f28])).
% 0.15/0.39 thf(f28,plain,(
% 0.15/0.39 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((in @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ Y0 @ emptyset)) @ emptyset))) => (X2 = X1))) @ X3))) )),
% 0.15/0.39 inference(pi_clausification,[],[f27])).
% 0.15/0.39 thf(f27,plain,(
% 0.15/0.39 ( ! [X2 : $i,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((in @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ Y0 @ emptyset)) @ emptyset))) => (X2 = X1)))) = $true)) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f26])).
% 0.15/0.39 thf(f26,plain,(
% 0.15/0.39 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))) => (Y0 = X1))))) @ X2))) )),
% 0.15/0.39 inference(pi_clausification,[],[f25])).
% 0.15/0.39 thf(f25,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))) => (Y0 = X1)))))))) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f24])).
% 0.15/0.39 thf(f24,plain,(
% 0.15/0.39 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y2 @ emptyset)) @ emptyset))) => (Y1 = Y0))))))) @ X1) = $true)) )),
% 0.15/0.39 inference(pi_clausification,[],[f22])).
% 0.15/0.39 thf(f22,plain,(
% 0.15/0.39 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y2 @ emptyset)) @ emptyset))) => (Y1 = Y0)))))))) = $true)),
% 0.15/0.39 inference(definition_unfolding,[],[f20,f17])).
% 0.15/0.39 thf(f17,plain,(
% 0.15/0.39 (setukpairinjL1 = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f15])).
% 0.15/0.39 thf(f20,plain,(
% 0.15/0.39 (setukpairinjL1 = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y2 @ emptyset)) @ emptyset))) => (Y1 = Y0)))))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f11])).
% 0.15/0.39 thf(f11,plain,(
% 0.15/0.39 (setukpairinjL1 = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y2 @ emptyset)) @ emptyset))) => (Y1 = Y0)))))))))),
% 0.15/0.39 inference(fool_elimination,[],[f10])).
% 0.15/0.39 thf(f10,plain,(
% 0.15/0.39 (setukpairinjL1 = ! [X0,X1,X2] : ((in @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X0 @ emptyset)) @ emptyset))) => (X1 = X2)))),
% 0.15/0.39 inference(rectify,[],[f2])).
% 0.15/0.39 thf(f2,axiom,(
% 0.15/0.39 (setukpairinjL1 = ! [X1,X2,X0] : ((in @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) => (X0 = X2)))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairinjL1)).
% 0.15/0.39 % SZS output end Proof for theBenchmark
% 0.15/0.39 % (12217)------------------------------
% 0.15/0.39 % (12217)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (12217)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (12217)Memory used [KB]: 5500
% 0.15/0.39 % (12217)Time elapsed: 0.009 s
% 0.15/0.39 % (12217)Instructions burned: 7 (million)
% 0.15/0.39 % (12217)------------------------------
% 0.15/0.39 % (12217)------------------------------
% 0.15/0.39 % (12216)Success in time 0.009 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------