TSTP Solution File: SEU777^2 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU777^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 : n029.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:27 EDT 2024

% Result   : Theorem 0.14s 0.38s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SEU777^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.14/0.35  % Computer : n029.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 19 17:00:53 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a TH0_THM_EQU_NAR problem
% 0.14/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.14/0.37  % (28877)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.14/0.37  % (28872)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.14/0.37  % (28873)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.14/0.37  % (28874)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.14/0.37  % (28878)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.37  % (28876)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.14/0.38  % (28875)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.38  % (28876)Instruction limit reached!
% 0.14/0.38  % (28876)------------------------------
% 0.14/0.38  % (28876)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (28876)Termination reason: Unknown
% 0.14/0.38  % (28876)Termination phase: Property scanning
% 0.14/0.38  
% 0.14/0.38  % (28876)Memory used [KB]: 895
% 0.14/0.38  % (28876)Time elapsed: 0.003 s
% 0.14/0.38  % (28876)Instructions burned: 2 (million)
% 0.14/0.38  % (28876)------------------------------
% 0.14/0.38  % (28876)------------------------------
% 0.14/0.38  % (28873)Instruction limit reached!
% 0.14/0.38  % (28873)------------------------------
% 0.14/0.38  % (28873)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (28873)Termination reason: Unknown
% 0.14/0.38  % (28873)Termination phase: Saturation
% 0.14/0.38  
% 0.14/0.38  % (28873)Memory used [KB]: 5500
% 0.14/0.38  % (28873)Time elapsed: 0.004 s
% 0.14/0.38  % (28873)Instructions burned: 4 (million)
% 0.14/0.38  % (28873)------------------------------
% 0.14/0.38  % (28873)------------------------------
% 0.14/0.38  % (28875)Instruction limit reached!
% 0.14/0.38  % (28875)------------------------------
% 0.14/0.38  % (28875)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (28875)Termination reason: Unknown
% 0.14/0.38  % (28875)Termination phase: Property scanning
% 0.14/0.38  
% 0.14/0.38  % (28875)Memory used [KB]: 1023
% 0.14/0.38  % (28875)Time elapsed: 0.004 s
% 0.14/0.38  % (28875)Instructions burned: 3 (million)
% 0.14/0.38  % (28875)------------------------------
% 0.14/0.38  % (28875)------------------------------
% 0.14/0.38  % (28877)First to succeed.
% 0.14/0.38  % (28879)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.14/0.38  % (28872)Also succeeded, but the first one will report.
% 0.14/0.38  % (28877)Refutation found. Thanks to Tanya!
% 0.14/0.38  % SZS status Theorem for theBenchmark
% 0.14/0.38  % SZS output start Proof for theBenchmark
% 0.14/0.38  thf(func_def_0, type, in: $i > $i > $o).
% 0.14/0.38  thf(func_def_1, type, subset: $i > $i > $o).
% 0.14/0.38  thf(func_def_2, type, kpair: $i > $i > $i).
% 0.14/0.38  thf(func_def_3, type, cartprod: $i > $i > $i).
% 0.14/0.38  thf(func_def_4, type, breln: $i > $i > $i > $o).
% 0.14/0.38  thf(func_def_6, type, dpsetconstr: $i > $i > ($i > $i > $o) > $i).
% 0.14/0.38  thf(func_def_8, type, breln1: $i > $i > $o).
% 0.14/0.38  thf(func_def_9, type, breln1invset: $i > $i > $i).
% 0.14/0.38  thf(func_def_19, type, sK3: $i > $i > $o).
% 0.14/0.38  thf(func_def_27, type, ph10: !>[X0: $tType]:(X0)).
% 0.14/0.38  thf(f51,plain,(
% 0.14/0.38    $false),
% 0.14/0.38    inference(subsumption_resolution,[],[f50,f35])).
% 0.14/0.38  thf(f35,plain,(
% 0.14/0.38    ($true != (in @ (kpair @ sK7 @ sK8) @ sK6))),
% 0.14/0.38    inference(cnf_transformation,[],[f27])).
% 0.14/0.38  thf(f27,plain,(
% 0.14/0.38    (dpsetconstrER = $true) & (($true = (breln1 @ sK5 @ sK6)) & (($true = (in @ sK7 @ sK5)) & (($true != (in @ (kpair @ sK7 @ sK8) @ sK6)) & ($true = (in @ (kpair @ sK8 @ sK7) @ (breln1invset @ sK5 @ sK6))) & ($true = (in @ sK8 @ sK5)))))),
% 0.14/0.38    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8])],[f19,f26,f25,f24])).
% 0.14/0.38  thf(f24,plain,(
% 0.14/0.38    ? [X0,X1] : (((breln1 @ X0 @ X1) = $true) & ? [X2] : (($true = (in @ X2 @ X0)) & ? [X3] : (($true != (in @ (kpair @ X2 @ X3) @ X1)) & ($true = (in @ (kpair @ X3 @ X2) @ (breln1invset @ X0 @ X1))) & ((in @ X3 @ X0) = $true)))) => (($true = (breln1 @ sK5 @ sK6)) & ? [X2] : (((in @ X2 @ sK5) = $true) & ? [X3] : (((in @ (kpair @ X2 @ X3) @ sK6) != $true) & ((in @ (kpair @ X3 @ X2) @ (breln1invset @ sK5 @ sK6)) = $true) & ($true = (in @ X3 @ sK5)))))),
% 0.14/0.38    introduced(choice_axiom,[])).
% 0.14/0.38  thf(f25,plain,(
% 0.14/0.38    ? [X2] : (((in @ X2 @ sK5) = $true) & ? [X3] : (((in @ (kpair @ X2 @ X3) @ sK6) != $true) & ((in @ (kpair @ X3 @ X2) @ (breln1invset @ sK5 @ sK6)) = $true) & ($true = (in @ X3 @ sK5)))) => (($true = (in @ sK7 @ sK5)) & ? [X3] : (((in @ (kpair @ sK7 @ X3) @ sK6) != $true) & ((in @ (kpair @ X3 @ sK7) @ (breln1invset @ sK5 @ sK6)) = $true) & ($true = (in @ X3 @ sK5))))),
% 0.14/0.38    introduced(choice_axiom,[])).
% 0.14/0.38  thf(f26,plain,(
% 0.14/0.38    ? [X3] : (((in @ (kpair @ sK7 @ X3) @ sK6) != $true) & ((in @ (kpair @ X3 @ sK7) @ (breln1invset @ sK5 @ sK6)) = $true) & ($true = (in @ X3 @ sK5))) => (($true != (in @ (kpair @ sK7 @ sK8) @ sK6)) & ($true = (in @ (kpair @ sK8 @ sK7) @ (breln1invset @ sK5 @ sK6))) & ($true = (in @ sK8 @ sK5)))),
% 0.14/0.38    introduced(choice_axiom,[])).
% 0.14/0.38  thf(f19,plain,(
% 0.14/0.38    (dpsetconstrER = $true) & ? [X0,X1] : (((breln1 @ X0 @ X1) = $true) & ? [X2] : (($true = (in @ X2 @ X0)) & ? [X3] : (($true != (in @ (kpair @ X2 @ X3) @ X1)) & ($true = (in @ (kpair @ X3 @ X2) @ (breln1invset @ X0 @ X1))) & ((in @ X3 @ X0) = $true))))),
% 0.14/0.38    inference(flattening,[],[f18])).
% 0.14/0.38  thf(f18,plain,(
% 0.14/0.38    ? [X0,X1] : (? [X2] : (? [X3] : ((($true != (in @ (kpair @ X2 @ X3) @ X1)) & ($true = (in @ (kpair @ X3 @ X2) @ (breln1invset @ X0 @ X1)))) & ((in @ X3 @ X0) = $true)) & ($true = (in @ X2 @ X0))) & ((breln1 @ X0 @ X1) = $true)) & (dpsetconstrER = $true)),
% 0.14/0.38    inference(ennf_transformation,[],[f16])).
% 0.14/0.38  thf(f16,plain,(
% 0.14/0.38    ~((dpsetconstrER = $true) => ! [X0,X1] : (((breln1 @ X0 @ X1) = $true) => ! [X2] : (($true = (in @ X2 @ X0)) => ! [X3] : (((in @ X3 @ X0) = $true) => (($true = (in @ (kpair @ X3 @ X2) @ (breln1invset @ X0 @ X1))) => ($true = (in @ (kpair @ X2 @ X3) @ X1)))))))),
% 0.14/0.38    inference(fool_elimination,[],[f15])).
% 0.14/0.38  thf(f15,plain,(
% 0.14/0.38    ~(dpsetconstrER => ! [X0,X1] : ((breln1 @ X0 @ X1) => ! [X2] : ((in @ X2 @ X0) => ! [X3] : ((in @ X3 @ X0) => ((in @ (kpair @ X3 @ X2) @ (breln1invset @ X0 @ X1)) => (in @ (kpair @ X2 @ X3) @ X1))))))),
% 0.14/0.38    inference(rectify,[],[f6])).
% 0.14/0.38  thf(f6,negated_conjecture,(
% 0.14/0.38    ~(dpsetconstrER => ! [X0,X8] : ((breln1 @ X0 @ X8) => ! [X4] : ((in @ X4 @ X0) => ! [X5] : ((in @ X5 @ X0) => ((in @ (kpair @ X5 @ X4) @ (breln1invset @ X0 @ X8)) => (in @ (kpair @ X4 @ X5) @ X8))))))),
% 0.14/0.38    inference(negated_conjecture,[],[f5])).
% 0.14/0.38  thf(f5,conjecture,(
% 0.14/0.38    dpsetconstrER => ! [X0,X8] : ((breln1 @ X0 @ X8) => ! [X4] : ((in @ X4 @ X0) => ! [X5] : ((in @ X5 @ X0) => ((in @ (kpair @ X5 @ X4) @ (breln1invset @ X0 @ X8)) => (in @ (kpair @ X4 @ X5) @ X8)))))),
% 0.14/0.38    file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1invE)).
% 0.14/0.38  thf(f50,plain,(
% 0.14/0.38    ($true = (in @ (kpair @ sK7 @ sK8) @ sK6))),
% 0.14/0.38    inference(beta_eta_normalization,[],[f49])).
% 0.14/0.38  thf(f49,plain,(
% 0.14/0.38    (((^[Y0 : $i]: ((^[Y1 : $i]: (in @ (kpair @ Y1 @ Y0) @ sK6)))) @ sK8 @ sK7) = $true)),
% 0.14/0.38    inference(trivial_inequality_removal,[],[f48])).
% 0.14/0.38  thf(f48,plain,(
% 0.14/0.38    ($true != $true) | (((^[Y0 : $i]: ((^[Y1 : $i]: (in @ (kpair @ Y1 @ Y0) @ sK6)))) @ sK8 @ sK7) = $true)),
% 0.14/0.38    inference(superposition,[],[f45,f46])).
% 0.14/0.38  thf(f46,plain,(
% 0.14/0.38    ($true = (in @ (kpair @ sK8 @ sK7) @ (dpsetconstr @ sK5 @ sK5 @ (^[Y0 : $i]: ((^[Y1 : $i]: (in @ (kpair @ Y1 @ Y0) @ sK6)))))))),
% 0.14/0.38    inference(beta_eta_normalization,[],[f43])).
% 0.14/0.38  thf(f43,plain,(
% 0.14/0.38    ((in @ (kpair @ sK8 @ sK7) @ ((^[Y0 : $i]: ((^[Y1 : $i]: (dpsetconstr @ Y0 @ Y0 @ (^[Y2 : $i]: ((^[Y3 : $i]: (in @ (kpair @ Y3 @ Y2) @ Y1)))))))) @ sK5 @ sK6)) = $true)),
% 0.14/0.38    inference(definition_unfolding,[],[f34,f32])).
% 0.14/0.38  thf(f32,plain,(
% 0.14/0.38    (breln1invset = (^[Y0 : $i]: ((^[Y1 : $i]: (dpsetconstr @ Y0 @ Y0 @ (^[Y2 : $i]: ((^[Y3 : $i]: (in @ (kpair @ Y3 @ Y2) @ Y1)))))))))),
% 0.14/0.38    inference(cnf_transformation,[],[f9])).
% 0.14/0.38  thf(f9,plain,(
% 0.14/0.38    (breln1invset = (^[Y0 : $i]: ((^[Y1 : $i]: (dpsetconstr @ Y0 @ Y0 @ (^[Y2 : $i]: ((^[Y3 : $i]: (in @ (kpair @ Y3 @ Y2) @ Y1)))))))))),
% 0.14/0.38    inference(fool_elimination,[],[f8])).
% 0.14/0.38  thf(f8,plain,(
% 0.14/0.38    ((^[X0 : $i, X1 : $i] : (dpsetconstr @ X0 @ X0 @ (^[X2 : $i, X3 : $i] : (in @ (kpair @ X3 @ X2) @ X1)))) = breln1invset)),
% 0.14/0.38    inference(rectify,[],[f4])).
% 0.14/0.38  thf(f4,axiom,(
% 0.14/0.38    ((^[X0 : $i, X8 : $i] : (dpsetconstr @ X0 @ X0 @ (^[X4 : $i, X5 : $i] : (in @ (kpair @ X5 @ X4) @ X8)))) = breln1invset)),
% 0.14/0.38    file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1invset)).
% 0.14/0.38  thf(f34,plain,(
% 0.14/0.38    ($true = (in @ (kpair @ sK8 @ sK7) @ (breln1invset @ sK5 @ sK6)))),
% 0.14/0.38    inference(cnf_transformation,[],[f27])).
% 0.14/0.38  thf(f45,plain,(
% 0.14/0.38    ( ! [X8 : $i > $i > $o,X6 : $i,X9 : $i,X7 : $i,X5 : $i] : (($true != (in @ (kpair @ X6 @ X7) @ (dpsetconstr @ X5 @ X9 @ X8))) | ((X8 @ X6 @ X7) = $true)) )),
% 0.14/0.38    inference(beta_eta_normalization,[],[f44])).
% 0.14/0.38  thf(f44,plain,(
% 0.14/0.38    ( ! [X8 : $i > $i > $o,X6 : $i,X9 : $i,X7 : $i,X5 : $i] : (($true != (in @ (kpair @ X6 @ X7) @ (dpsetconstr @ X5 @ X9 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X8 @ Y0 @ Y1))))))) | ((X8 @ X6 @ X7) = $true)) )),
% 0.14/0.38    inference(trivial_inequality_removal,[],[f41])).
% 0.14/0.38  thf(f41,plain,(
% 0.14/0.38    ( ! [X8 : $i > $i > $o,X6 : $i,X9 : $i,X7 : $i,X5 : $i] : (((X8 @ X6 @ X7) = $true) | ($true != $true) | ($true != (in @ (kpair @ X6 @ X7) @ (dpsetconstr @ X5 @ X9 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X8 @ Y0 @ Y1)))))))) )),
% 0.14/0.38    inference(definition_unfolding,[],[f29,f38])).
% 0.14/0.38  thf(f38,plain,(
% 0.14/0.38    (dpsetconstrER = $true)),
% 0.14/0.38    inference(cnf_transformation,[],[f27])).
% 0.14/0.38  thf(f29,plain,(
% 0.14/0.38    ( ! [X8 : $i > $i > $o,X6 : $i,X9 : $i,X7 : $i,X5 : $i] : (((X8 @ X6 @ X7) = $true) | ($true != (in @ (kpair @ X6 @ X7) @ (dpsetconstr @ X5 @ X9 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X8 @ Y0 @ Y1))))))) | (dpsetconstrER != $true)) )),
% 0.14/0.38    inference(cnf_transformation,[],[f23])).
% 0.14/0.38  thf(f23,plain,(
% 0.14/0.38    ((dpsetconstrER = $true) | (($true != (sK3 @ sK1 @ sK2)) & ((in @ (kpair @ sK1 @ sK2) @ (dpsetconstr @ sK0 @ sK4 @ (^[Y0 : $i]: ((^[Y1 : $i]: (sK3 @ Y0 @ Y1)))))) = $true))) & (! [X5,X6,X7,X8 : $i > $i > $o,X9] : (((X8 @ X6 @ X7) = $true) | ($true != (in @ (kpair @ X6 @ X7) @ (dpsetconstr @ X5 @ X9 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X8 @ Y0 @ Y1)))))))) | (dpsetconstrER != $true))),
% 0.14/0.38    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f21,f22])).
% 0.14/0.38  thf(f22,plain,(
% 0.14/0.38    ? [X0,X1,X2,X3 : $i > $i > $o,X4] : (($true != (X3 @ X1 @ X2)) & ($true = (in @ (kpair @ X1 @ X2) @ (dpsetconstr @ X0 @ X4 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X3 @ Y0 @ Y1)))))))) => (($true != (sK3 @ sK1 @ sK2)) & ((in @ (kpair @ sK1 @ sK2) @ (dpsetconstr @ sK0 @ sK4 @ (^[Y0 : $i]: ((^[Y1 : $i]: (sK3 @ Y0 @ Y1)))))) = $true))),
% 0.14/0.38    introduced(choice_axiom,[])).
% 0.14/0.38  thf(f21,plain,(
% 0.14/0.38    ((dpsetconstrER = $true) | ? [X0,X1,X2,X3 : $i > $i > $o,X4] : (($true != (X3 @ X1 @ X2)) & ($true = (in @ (kpair @ X1 @ X2) @ (dpsetconstr @ X0 @ X4 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X3 @ Y0 @ Y1))))))))) & (! [X5,X6,X7,X8 : $i > $i > $o,X9] : (((X8 @ X6 @ X7) = $true) | ($true != (in @ (kpair @ X6 @ X7) @ (dpsetconstr @ X5 @ X9 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X8 @ Y0 @ Y1)))))))) | (dpsetconstrER != $true))),
% 0.14/0.38    inference(rectify,[],[f20])).
% 0.14/0.38  thf(f20,plain,(
% 0.14/0.38    ((dpsetconstrER = $true) | ? [X0,X1,X2,X3 : $i > $i > $o,X4] : (($true != (X3 @ X1 @ X2)) & ($true = (in @ (kpair @ X1 @ X2) @ (dpsetconstr @ X0 @ X4 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X3 @ Y0 @ Y1))))))))) & (! [X0,X1,X2,X3 : $i > $i > $o,X4] : (($true = (X3 @ X1 @ X2)) | ($true != (in @ (kpair @ X1 @ X2) @ (dpsetconstr @ X0 @ X4 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X3 @ Y0 @ Y1)))))))) | (dpsetconstrER != $true))),
% 0.14/0.38    inference(nnf_transformation,[],[f17])).
% 0.14/0.38  thf(f17,plain,(
% 0.14/0.38    (dpsetconstrER = $true) <=> ! [X0,X1,X2,X3 : $i > $i > $o,X4] : (($true = (X3 @ X1 @ X2)) | ($true != (in @ (kpair @ X1 @ X2) @ (dpsetconstr @ X0 @ X4 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X3 @ Y0 @ Y1))))))))),
% 0.14/0.38    inference(ennf_transformation,[],[f12])).
% 0.14/0.38  thf(f12,plain,(
% 0.14/0.38    (dpsetconstrER = $true) <=> ! [X0,X1,X2,X3 : $i > $i > $o,X4] : (($true = (in @ (kpair @ X1 @ X2) @ (dpsetconstr @ X0 @ X4 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X3 @ Y0 @ Y1))))))) => ($true = (X3 @ X1 @ X2)))),
% 0.14/0.38    inference(fool_elimination,[],[f11])).
% 0.14/0.38  thf(f11,plain,(
% 0.14/0.38    (dpsetconstrER = ! [X0,X1,X2,X3 : $i > $i > $o,X4] : ((in @ (kpair @ X1 @ X2) @ (dpsetconstr @ X0 @ X4 @ (^[X5 : $i, X6 : $i] : (X3 @ X5 @ X6)))) => (X3 @ X1 @ X2)))),
% 0.14/0.38    inference(rectify,[],[f2])).
% 0.14/0.38  thf(f2,axiom,(
% 0.14/0.38    (dpsetconstrER = ! [X0,X4,X5,X3 : $i > $i > $o,X1] : ((in @ (kpair @ X4 @ X5) @ (dpsetconstr @ X0 @ X1 @ (^[X6 : $i, X7 : $i] : (X3 @ X6 @ X7)))) => (X3 @ X4 @ X5)))),
% 0.14/0.38    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dpsetconstrER)).
% 0.14/0.38  % SZS output end Proof for theBenchmark
% 0.14/0.38  % (28877)------------------------------
% 0.14/0.38  % (28877)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (28877)Termination reason: Refutation
% 0.14/0.38  
% 0.14/0.38  % (28877)Memory used [KB]: 5500
% 0.14/0.38  % (28877)Time elapsed: 0.008 s
% 0.14/0.38  % (28877)Instructions burned: 5 (million)
% 0.14/0.38  % (28877)------------------------------
% 0.14/0.38  % (28877)------------------------------
% 0.14/0.38  % (28868)Success in time 0.021 s
% 0.14/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------