TSTP Solution File: SEU769^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU769^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:23 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU769^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n021.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 16:32:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH0_THM_EQU_NAR problem
% 0.15/0.35 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.37 % (23690)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.37 % (23693)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.37 % (23695)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.37 % (23696)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.37 % (23689)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.37 % (23692)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.37 % (23694)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.37 % (23692)Instruction limit reached!
% 0.15/0.37 % (23692)------------------------------
% 0.15/0.37 % (23692)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (23692)Termination reason: Unknown
% 0.15/0.37 % (23692)Termination phase: Property scanning
% 0.15/0.37 % (23693)Instruction limit reached!
% 0.15/0.37 % (23693)------------------------------
% 0.15/0.37 % (23693)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (23693)Termination reason: Unknown
% 0.15/0.37 % (23693)Termination phase: Saturation
% 0.15/0.37
% 0.15/0.37 % (23693)Memory used [KB]: 5500
% 0.15/0.37 % (23693)Time elapsed: 0.004 s
% 0.15/0.37 % (23693)Instructions burned: 3 (million)
% 0.15/0.37 % (23693)------------------------------
% 0.15/0.37 % (23693)------------------------------
% 0.15/0.37
% 0.15/0.37 % (23692)Memory used [KB]: 895
% 0.15/0.37 % (23692)Time elapsed: 0.003 s
% 0.15/0.37 % (23692)Instructions burned: 2 (million)
% 0.15/0.37 % (23692)------------------------------
% 0.15/0.37 % (23692)------------------------------
% 0.15/0.37 % (23696)Instruction limit reached!
% 0.15/0.37 % (23696)------------------------------
% 0.15/0.37 % (23696)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (23696)Termination reason: Unknown
% 0.15/0.37 % (23696)Termination phase: Saturation
% 0.15/0.37
% 0.15/0.37 % (23696)Memory used [KB]: 5500
% 0.15/0.37 % (23696)Time elapsed: 0.004 s
% 0.15/0.37 % (23696)Instructions burned: 3 (million)
% 0.15/0.37 % (23696)------------------------------
% 0.15/0.37 % (23696)------------------------------
% 0.15/0.38 % (23694)Refutation not found, incomplete strategy
% 0.15/0.38 % (23694)------------------------------
% 0.15/0.38 % (23694)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (23694)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.38
% 0.15/0.38
% 0.15/0.38 % (23694)Memory used [KB]: 5500
% 0.15/0.38 % (23694)Time elapsed: 0.004 s
% 0.15/0.38 % (23694)Instructions burned: 2 (million)
% 0.15/0.38 % (23694)------------------------------
% 0.15/0.38 % (23694)------------------------------
% 0.15/0.38 % (23691)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 % (23695)First to succeed.
% 0.15/0.38 % (23690)Instruction limit reached!
% 0.15/0.38 % (23690)------------------------------
% 0.15/0.38 % (23690)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (23690)Termination reason: Unknown
% 0.15/0.38 % (23690)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (23690)Memory used [KB]: 5500
% 0.15/0.38 % (23690)Time elapsed: 0.005 s
% 0.15/0.38 % (23690)Instructions burned: 4 (million)
% 0.15/0.38 % (23690)------------------------------
% 0.15/0.38 % (23690)------------------------------
% 0.15/0.38 % (23689)Also succeeded, but the first one will report.
% 0.15/0.38 % (23695)Refutation found. Thanks to Tanya!
% 0.15/0.38 % SZS status Theorem for theBenchmark
% 0.15/0.38 % SZS output start Proof for theBenchmark
% 0.15/0.38 thf(func_def_0, type, in: $i > $i > $o).
% 0.15/0.38 thf(func_def_1, type, powerset: $i > $i).
% 0.15/0.38 thf(func_def_2, type, dsetconstr: $i > ($i > $o) > $i).
% 0.15/0.38 thf(func_def_5, type, subset: $i > $i > $o).
% 0.15/0.38 thf(func_def_6, type, cartprod: $i > $i > $i).
% 0.15/0.38 thf(func_def_7, type, breln: $i > $i > $i > $o).
% 0.15/0.38 thf(func_def_8, type, breln1: $i > $i > $o).
% 0.15/0.38 thf(func_def_9, type, breln1Set: $i > $i).
% 0.15/0.38 thf(func_def_17, type, sK1: $i > $o).
% 0.15/0.38 thf(func_def_23, type, ph6: !>[X0: $tType]:(X0)).
% 0.15/0.38 thf(f49,plain,(
% 0.15/0.38 $false),
% 0.15/0.38 inference(subsumption_resolution,[],[f48,f45])).
% 0.15/0.38 thf(f45,plain,(
% 0.15/0.38 ((subset @ sK4 @ (cartprod @ sK3 @ sK3)) != $true)),
% 0.15/0.38 inference(beta_eta_normalization,[],[f40])).
% 0.15/0.38 thf(f40,plain,(
% 0.15/0.38 ($true != ((^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $i]: (subset @ Y4 @ (cartprod @ Y2 @ Y3))))))) @ Y0 @ Y0 @ Y1)))) @ sK3 @ sK4))),
% 0.15/0.38 inference(definition_unfolding,[],[f33,f35])).
% 0.15/0.38 thf(f35,plain,(
% 0.15/0.38 (breln1 = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $i]: (subset @ Y4 @ (cartprod @ Y2 @ Y3))))))) @ Y0 @ Y0 @ Y1)))))),
% 0.15/0.38 inference(definition_unfolding,[],[f29,f30])).
% 0.15/0.38 thf(f30,plain,(
% 0.15/0.38 (breln = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: (subset @ Y2 @ (cartprod @ Y0 @ Y1))))))))),
% 0.15/0.38 inference(cnf_transformation,[],[f17])).
% 0.15/0.38 thf(f17,plain,(
% 0.15/0.38 (breln = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: (subset @ Y2 @ (cartprod @ Y0 @ Y1))))))))),
% 0.15/0.38 inference(fool_elimination,[],[f16])).
% 0.15/0.38 thf(f16,plain,(
% 0.15/0.38 (breln = (^[X0 : $i, X1 : $i, X2 : $i] : (subset @ X2 @ (cartprod @ X0 @ X1))))),
% 0.15/0.38 inference(rectify,[],[f2])).
% 0.15/0.38 thf(f2,axiom,(
% 0.15/0.38 (breln = (^[X0 : $i, X4 : $i, X5 : $i] : (subset @ X5 @ (cartprod @ X0 @ X4))))),
% 0.15/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln)).
% 0.15/0.38 thf(f29,plain,(
% 0.15/0.38 (breln1 = (^[Y0 : $i]: ((^[Y1 : $i]: (breln @ Y0 @ Y0 @ Y1)))))),
% 0.15/0.38 inference(cnf_transformation,[],[f9])).
% 0.15/0.38 thf(f9,plain,(
% 0.15/0.38 (breln1 = (^[Y0 : $i]: ((^[Y1 : $i]: (breln @ Y0 @ Y0 @ Y1)))))),
% 0.15/0.38 inference(fool_elimination,[],[f8])).
% 0.15/0.38 thf(f8,plain,(
% 0.15/0.38 ((^[X0 : $i, X1 : $i] : (breln @ X0 @ X0 @ X1)) = breln1)),
% 0.15/0.38 inference(rectify,[],[f3])).
% 0.15/0.38 thf(f3,axiom,(
% 0.15/0.38 ((^[X0 : $i, X6 : $i] : (breln @ X0 @ X0 @ X6)) = breln1)),
% 0.15/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1)).
% 0.15/0.38 thf(f33,plain,(
% 0.15/0.38 ($true != (breln1 @ sK3 @ sK4))),
% 0.15/0.38 inference(cnf_transformation,[],[f25])).
% 0.15/0.38 thf(f25,plain,(
% 0.15/0.38 (dsetconstrER = $true) & (($true != (breln1 @ sK3 @ sK4)) & ($true = (in @ sK4 @ (breln1Set @ sK3))))),
% 0.15/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f18,f24])).
% 0.15/0.38 thf(f24,plain,(
% 0.15/0.38 ? [X0,X1] : (((breln1 @ X0 @ X1) != $true) & ($true = (in @ X1 @ (breln1Set @ X0)))) => (($true != (breln1 @ sK3 @ sK4)) & ($true = (in @ sK4 @ (breln1Set @ sK3))))),
% 0.15/0.38 introduced(choice_axiom,[])).
% 0.15/0.38 thf(f18,plain,(
% 0.15/0.38 (dsetconstrER = $true) & ? [X0,X1] : (((breln1 @ X0 @ X1) != $true) & ($true = (in @ X1 @ (breln1Set @ X0))))),
% 0.15/0.38 inference(ennf_transformation,[],[f13])).
% 0.15/0.38 thf(f13,plain,(
% 0.15/0.38 ~((dsetconstrER = $true) => ! [X0,X1] : (($true = (in @ X1 @ (breln1Set @ X0))) => ((breln1 @ X0 @ X1) = $true)))),
% 0.15/0.38 inference(fool_elimination,[],[f12])).
% 0.15/0.38 thf(f12,plain,(
% 0.15/0.38 ~(dsetconstrER => ! [X0,X1] : ((in @ X1 @ (breln1Set @ X0)) => (breln1 @ X0 @ X1)))),
% 0.15/0.38 inference(rectify,[],[f6])).
% 0.15/0.38 thf(f6,negated_conjecture,(
% 0.15/0.38 ~(dsetconstrER => ! [X0,X6] : ((in @ X6 @ (breln1Set @ X0)) => (breln1 @ X0 @ X6)))),
% 0.15/0.38 inference(negated_conjecture,[],[f5])).
% 0.15/0.38 thf(f5,conjecture,(
% 0.15/0.38 dsetconstrER => ! [X0,X6] : ((in @ X6 @ (breln1Set @ X0)) => (breln1 @ X0 @ X6))),
% 0.15/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1SetBreln1)).
% 0.15/0.38 thf(f48,plain,(
% 0.15/0.38 ((subset @ sK4 @ (cartprod @ sK3 @ sK3)) = $true)),
% 0.15/0.38 inference(beta_eta_normalization,[],[f47])).
% 0.15/0.38 thf(f47,plain,(
% 0.15/0.38 ($true = ((^[Y0 : $i]: (subset @ Y0 @ (cartprod @ sK3 @ sK3))) @ sK4))),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f46])).
% 0.15/0.38 thf(f46,plain,(
% 0.15/0.38 ($true = ((^[Y0 : $i]: (subset @ Y0 @ (cartprod @ sK3 @ sK3))) @ sK4)) | ($true != $true)),
% 0.15/0.38 inference(superposition,[],[f43,f44])).
% 0.15/0.38 thf(f44,plain,(
% 0.15/0.38 ($true = (in @ sK4 @ (dsetconstr @ (powerset @ (cartprod @ sK3 @ sK3)) @ (^[Y0 : $i]: (subset @ Y0 @ (cartprod @ sK3 @ sK3))))))),
% 0.15/0.38 inference(beta_eta_normalization,[],[f41])).
% 0.15/0.38 thf(f41,plain,(
% 0.15/0.38 ($true = (in @ sK4 @ ((^[Y0 : $i]: (dsetconstr @ (powerset @ (cartprod @ Y0 @ Y0)) @ (^[Y1 : $i]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $i]: ((^[Y5 : $i]: ((^[Y6 : $i]: (subset @ Y6 @ (cartprod @ Y4 @ Y5))))))) @ Y2 @ Y2 @ Y3)))) @ Y0 @ Y1)))) @ sK3)))),
% 0.15/0.38 inference(definition_unfolding,[],[f32,f36])).
% 0.15/0.38 thf(f36,plain,(
% 0.15/0.38 (breln1Set = (^[Y0 : $i]: (dsetconstr @ (powerset @ (cartprod @ Y0 @ Y0)) @ (^[Y1 : $i]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $i]: ((^[Y5 : $i]: ((^[Y6 : $i]: (subset @ Y6 @ (cartprod @ Y4 @ Y5))))))) @ Y2 @ Y2 @ Y3)))) @ Y0 @ Y1)))))),
% 0.15/0.38 inference(definition_unfolding,[],[f31,f35])).
% 0.15/0.38 thf(f31,plain,(
% 0.15/0.38 (breln1Set = (^[Y0 : $i]: (dsetconstr @ (powerset @ (cartprod @ Y0 @ Y0)) @ (^[Y1 : $i]: (breln1 @ Y0 @ Y1)))))),
% 0.15/0.38 inference(cnf_transformation,[],[f11])).
% 0.15/0.38 thf(f11,plain,(
% 0.15/0.38 (breln1Set = (^[Y0 : $i]: (dsetconstr @ (powerset @ (cartprod @ Y0 @ Y0)) @ (^[Y1 : $i]: (breln1 @ Y0 @ Y1)))))),
% 0.15/0.38 inference(fool_elimination,[],[f10])).
% 0.15/0.38 thf(f10,plain,(
% 0.15/0.38 ((^[X0 : $i] : (dsetconstr @ (powerset @ (cartprod @ X0 @ X0)) @ (^[X1 : $i] : (breln1 @ X0 @ X1)))) = breln1Set)),
% 0.15/0.38 inference(rectify,[],[f4])).
% 0.15/0.38 thf(f4,axiom,(
% 0.15/0.38 ((^[X0 : $i] : (dsetconstr @ (powerset @ (cartprod @ X0 @ X0)) @ (^[X6 : $i] : (breln1 @ X0 @ X6)))) = breln1Set)),
% 0.15/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1Set)).
% 0.15/0.38 thf(f32,plain,(
% 0.15/0.38 ($true = (in @ sK4 @ (breln1Set @ sK3)))),
% 0.15/0.38 inference(cnf_transformation,[],[f25])).
% 0.15/0.38 thf(f43,plain,(
% 0.15/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (($true != (in @ X0 @ (dsetconstr @ X2 @ X1))) | ($true = (X1 @ X0))) )),
% 0.15/0.38 inference(beta_eta_normalization,[],[f42])).
% 0.15/0.38 thf(f42,plain,(
% 0.15/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (($true != (in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0))))) | ($true = (X1 @ X0))) )),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f37])).
% 0.15/0.38 thf(f37,plain,(
% 0.15/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (($true != $true) | ($true != (in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0))))) | ($true = (X1 @ X0))) )),
% 0.15/0.38 inference(definition_unfolding,[],[f28,f34])).
% 0.15/0.38 thf(f34,plain,(
% 0.15/0.38 (dsetconstrER = $true)),
% 0.15/0.38 inference(cnf_transformation,[],[f25])).
% 0.15/0.38 thf(f28,plain,(
% 0.15/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (($true = (X1 @ X0)) | ($true != (in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0))))) | (dsetconstrER != $true)) )),
% 0.15/0.38 inference(cnf_transformation,[],[f23])).
% 0.15/0.38 thf(f23,plain,(
% 0.15/0.38 (! [X0,X1 : $i > $o,X2] : (($true = (X1 @ X0)) | ($true != (in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))))) | (dsetconstrER != $true)) & ((dsetconstrER = $true) | (($true != (sK1 @ sK0)) & ($true = (in @ sK0 @ (dsetconstr @ sK2 @ (^[Y0 : $i]: (sK1 @ Y0)))))))),
% 0.15/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f21,f22])).
% 0.15/0.38 thf(f22,plain,(
% 0.15/0.38 ? [X3,X4 : $i > $o,X5] : (($true != (X4 @ X3)) & ($true = (in @ X3 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (X4 @ Y0)))))) => (($true != (sK1 @ sK0)) & ($true = (in @ sK0 @ (dsetconstr @ sK2 @ (^[Y0 : $i]: (sK1 @ Y0))))))),
% 0.15/0.38 introduced(choice_axiom,[])).
% 0.15/0.38 thf(f21,plain,(
% 0.15/0.38 (! [X0,X1 : $i > $o,X2] : (($true = (X1 @ X0)) | ($true != (in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))))) | (dsetconstrER != $true)) & ((dsetconstrER = $true) | ? [X3,X4 : $i > $o,X5] : (($true != (X4 @ X3)) & ($true = (in @ X3 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (X4 @ Y0)))))))),
% 0.15/0.38 inference(rectify,[],[f20])).
% 0.15/0.38 thf(f20,plain,(
% 0.15/0.38 (! [X0,X1 : $i > $o,X2] : (($true = (X1 @ X0)) | ($true != (in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))))) | (dsetconstrER != $true)) & ((dsetconstrER = $true) | ? [X0,X1 : $i > $o,X2] : (($true != (X1 @ X0)) & ($true = (in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))))))),
% 0.15/0.38 inference(nnf_transformation,[],[f19])).
% 0.15/0.38 thf(f19,plain,(
% 0.15/0.38 ! [X0,X1 : $i > $o,X2] : (($true = (X1 @ X0)) | ($true != (in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))))) <=> (dsetconstrER = $true)),
% 0.15/0.38 inference(ennf_transformation,[],[f15])).
% 0.15/0.38 thf(f15,plain,(
% 0.15/0.38 ! [X0,X1 : $i > $o,X2] : (($true = (in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0))))) => ($true = (X1 @ X0))) <=> (dsetconstrER = $true)),
% 0.15/0.38 inference(fool_elimination,[],[f14])).
% 0.15/0.38 thf(f14,plain,(
% 0.15/0.38 (dsetconstrER = ! [X0,X1 : $i > $o,X2] : ((in @ X0 @ (dsetconstr @ X2 @ (^[X3 : $i] : (X1 @ X3)))) => (X1 @ X0)))),
% 0.15/0.38 inference(rectify,[],[f1])).
% 0.15/0.38 thf(f1,axiom,(
% 0.15/0.38 (dsetconstrER = ! [X2,X1 : $i > $o,X0] : ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))) => (X1 @ X2)))),
% 0.15/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrER)).
% 0.15/0.38 % SZS output end Proof for theBenchmark
% 0.15/0.38 % (23695)------------------------------
% 0.15/0.38 % (23695)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (23695)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (23695)Memory used [KB]: 5500
% 0.15/0.38 % (23695)Time elapsed: 0.006 s
% 0.15/0.38 % (23695)Instructions burned: 4 (million)
% 0.15/0.38 % (23695)------------------------------
% 0.15/0.38 % (23695)------------------------------
% 0.15/0.38 % (23688)Success in time 0.007 s
% 0.15/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------