TSTP Solution File: SEU613^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU613^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 : n012.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:59 EDT 2024
% Result : Theorem 0.13s 0.38s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU613^2 : TPTP v8.2.0. Released v3.7.0.
% 0.12/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.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 16:20:37 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_EQU_NAR problem
% 0.13/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.13/0.37 % (14587)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.13/0.37 % (14580)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.13/0.37 % (14582)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.13/0.37 % (14583)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.37 % (14584)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.13/0.37 % (14581)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.13/0.37 % (14587)Instruction limit reached!
% 0.13/0.37 % (14587)------------------------------
% 0.13/0.37 % (14587)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (14585)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.13/0.37 % (14587)Termination reason: Unknown
% 0.13/0.37 % (14587)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (14587)Memory used [KB]: 895
% 0.13/0.37 % (14587)Time elapsed: 0.003 s
% 0.13/0.37 % (14587)Instructions burned: 3 (million)
% 0.13/0.37 % (14587)------------------------------
% 0.13/0.37 % (14587)------------------------------
% 0.13/0.37 % (14583)Instruction limit reached!
% 0.13/0.37 % (14583)------------------------------
% 0.13/0.37 % (14583)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (14583)Termination reason: Unknown
% 0.13/0.37 % (14583)Termination phase: Property scanning
% 0.13/0.37 % (14584)Instruction limit reached!
% 0.13/0.37 % (14584)------------------------------
% 0.13/0.37 % (14584)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (14584)Termination reason: Unknown
% 0.13/0.37 % (14584)Termination phase: Property scanning
% 0.13/0.37
% 0.13/0.37 % (14584)Memory used [KB]: 895
% 0.13/0.37 % (14584)Time elapsed: 0.003 s
% 0.13/0.37 % (14584)Instructions burned: 2 (million)
% 0.13/0.37 % (14584)------------------------------
% 0.13/0.37 % (14584)------------------------------
% 0.13/0.37
% 0.13/0.37 % (14583)Memory used [KB]: 895
% 0.13/0.37 % (14583)Time elapsed: 0.003 s
% 0.13/0.37 % (14583)Instructions burned: 2 (million)
% 0.13/0.37 % (14583)------------------------------
% 0.13/0.37 % (14583)------------------------------
% 0.13/0.38 % (14586)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.38 % (14581)Instruction limit reached!
% 0.13/0.38 % (14581)------------------------------
% 0.13/0.38 % (14581)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (14581)Termination reason: Unknown
% 0.13/0.38 % (14581)Termination phase: Saturation
% 0.13/0.38
% 0.13/0.38 % (14581)Memory used [KB]: 5500
% 0.13/0.38 % (14585)Refutation not found, incomplete strategy
% 0.13/0.38 % (14585)------------------------------
% 0.13/0.38 % (14585)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (14585)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 % (14585)Memory used [KB]: 5500
% 0.13/0.38 % (14585)Time elapsed: 0.004 s
% 0.13/0.38 % (14585)Instructions burned: 3 (million)
% 0.13/0.38 % (14585)------------------------------
% 0.13/0.38 % (14585)------------------------------
% 0.13/0.38 % (14581)Time elapsed: 0.005 s
% 0.13/0.38 % (14581)Instructions burned: 4 (million)
% 0.13/0.38 % (14581)------------------------------
% 0.13/0.38 % (14581)------------------------------
% 0.13/0.38 % (14580)First to succeed.
% 0.13/0.38 % (14582)Also succeeded, but the first one will report.
% 0.13/0.38 % (14580)Refutation found. Thanks to Tanya!
% 0.13/0.38 % SZS status Theorem for theBenchmark
% 0.13/0.38 % SZS output start Proof for theBenchmark
% 0.13/0.38 thf(func_def_0, type, in: $i > $i > $o).
% 0.13/0.38 thf(func_def_1, type, dsetconstr: $i > ($i > $o) > $i).
% 0.13/0.38 thf(func_def_4, type, binunion: $i > $i > $i).
% 0.13/0.38 thf(func_def_6, type, symdiff: $i > $i > $i).
% 0.13/0.38 thf(func_def_21, type, ph4: !>[X0: $tType]:(X0)).
% 0.13/0.38 thf(f64,plain,(
% 0.13/0.38 $false),
% 0.13/0.38 inference(trivial_inequality_removal,[],[f63])).
% 0.13/0.38 thf(f63,plain,(
% 0.13/0.38 ($false = $true)),
% 0.13/0.38 inference(superposition,[],[f24,f61])).
% 0.13/0.38 thf(f61,plain,(
% 0.13/0.38 ((in @ sK2 @ sK1) = $false)),
% 0.13/0.38 inference(trivial_inequality_removal,[],[f59])).
% 0.13/0.38 thf(f59,plain,(
% 0.13/0.38 ($false = $true) | ((in @ sK2 @ sK1) = $false)),
% 0.13/0.38 inference(superposition,[],[f47,f57])).
% 0.13/0.38 thf(f57,plain,(
% 0.13/0.38 ($false = (in @ sK2 @ (binunion @ sK0 @ sK1)))),
% 0.13/0.38 inference(subsumption_resolution,[],[f55,f23])).
% 0.13/0.38 thf(f23,plain,(
% 0.13/0.38 ((in @ sK2 @ sK0) != $true)),
% 0.13/0.38 inference(cnf_transformation,[],[f19])).
% 0.13/0.38 thf(f19,plain,(
% 0.13/0.38 (($true != (in @ sK2 @ (symdiff @ sK0 @ sK1))) & ((in @ sK2 @ sK1) = $true) & ((in @ sK2 @ sK0) != $true)) & (dsetconstrI = $true) & (binunionIR = $true)),
% 0.13/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f17,f18])).
% 0.13/0.38 thf(f18,plain,(
% 0.13/0.38 ? [X0,X1,X2] : (((in @ X2 @ (symdiff @ X0 @ X1)) != $true) & ((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)) => (($true != (in @ sK2 @ (symdiff @ sK0 @ sK1))) & ((in @ sK2 @ sK1) = $true) & ((in @ sK2 @ sK0) != $true))),
% 0.13/0.38 introduced(choice_axiom,[])).
% 0.13/0.38 thf(f17,plain,(
% 0.13/0.38 ? [X0,X1,X2] : (((in @ X2 @ (symdiff @ X0 @ X1)) != $true) & ((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)) & (dsetconstrI = $true) & (binunionIR = $true)),
% 0.13/0.38 inference(flattening,[],[f16])).
% 0.13/0.38 thf(f16,plain,(
% 0.13/0.38 (? [X0,X1,X2] : ((((in @ X2 @ (symdiff @ X0 @ X1)) != $true) & ((in @ X2 @ X1) = $true)) & ((in @ X2 @ X0) != $true)) & (binunionIR = $true)) & (dsetconstrI = $true)),
% 0.13/0.38 inference(ennf_transformation,[],[f15])).
% 0.13/0.38 thf(f15,plain,(
% 0.13/0.38 ~((dsetconstrI = $true) => ((binunionIR = $true) => ! [X0,X1,X2] : (((in @ X2 @ X0) != $true) => (((in @ X2 @ X1) = $true) => ((in @ X2 @ (symdiff @ X0 @ X1)) = $true)))))),
% 0.13/0.38 inference(flattening,[],[f8])).
% 0.13/0.38 thf(f8,plain,(
% 0.13/0.38 ~((dsetconstrI = $true) => ((binunionIR = $true) => ! [X0,X1,X2] : (~((in @ X2 @ X0) = $true) => (((in @ X2 @ X1) = $true) => ((in @ X2 @ (symdiff @ X0 @ X1)) = $true)))))),
% 0.13/0.38 inference(fool_elimination,[],[f7])).
% 0.13/0.38 thf(f7,plain,(
% 0.13/0.38 ~(dsetconstrI => (binunionIR => ! [X0,X1,X2] : (~(in @ X2 @ X0) => ((in @ X2 @ X1) => (in @ X2 @ (symdiff @ X0 @ X1))))))),
% 0.13/0.38 inference(rectify,[],[f5])).
% 0.13/0.38 thf(f5,negated_conjecture,(
% 0.13/0.38 ~(dsetconstrI => (binunionIR => ! [X0,X4,X2] : (~(in @ X2 @ X0) => ((in @ X2 @ X4) => (in @ X2 @ (symdiff @ X0 @ X4))))))),
% 0.13/0.38 inference(negated_conjecture,[],[f4])).
% 0.13/0.38 thf(f4,conjecture,(
% 0.13/0.38 dsetconstrI => (binunionIR => ! [X0,X4,X2] : (~(in @ X2 @ X0) => ((in @ X2 @ X4) => (in @ X2 @ (symdiff @ X0 @ X4)))))),
% 0.13/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',symdiffI2)).
% 0.13/0.38 thf(f55,plain,(
% 0.13/0.38 ((in @ sK2 @ sK0) = $true) | ($false = (in @ sK2 @ (binunion @ sK0 @ sK1)))),
% 0.13/0.38 inference(not_proxy_clausification,[],[f54])).
% 0.13/0.38 thf(f54,plain,(
% 0.13/0.38 ($false = (in @ sK2 @ (binunion @ sK0 @ sK1))) | ($false = (~ (in @ sK2 @ sK0)))),
% 0.13/0.38 inference(binary_proxy_clausification,[],[f52])).
% 0.13/0.38 thf(f52,plain,(
% 0.13/0.38 ($false = (in @ sK2 @ (binunion @ sK0 @ sK1))) | (((~ (in @ sK2 @ sK0)) | (~ (in @ sK2 @ sK1))) = $false)),
% 0.13/0.38 inference(beta_eta_normalization,[],[f51])).
% 0.13/0.38 thf(f51,plain,(
% 0.13/0.38 ($false = ((^[Y0 : $i]: ((~ (in @ Y0 @ sK0)) | (~ (in @ Y0 @ sK1)))) @ sK2)) | ($false = (in @ sK2 @ (binunion @ sK0 @ sK1)))),
% 0.13/0.38 inference(trivial_inequality_removal,[],[f50])).
% 0.13/0.38 thf(f50,plain,(
% 0.13/0.38 ($false = (in @ sK2 @ (binunion @ sK0 @ sK1))) | ($true != $true) | ($false = ((^[Y0 : $i]: ((~ (in @ Y0 @ sK0)) | (~ (in @ Y0 @ sK1)))) @ sK2))),
% 0.13/0.38 inference(superposition,[],[f31,f40])).
% 0.13/0.38 thf(f40,plain,(
% 0.13/0.38 ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : (($true = (in @ X1 @ (dsetconstr @ X2 @ X3))) | ((X3 @ X1) = $false) | ((in @ X1 @ X2) = $false)) )),
% 0.13/0.38 inference(binary_proxy_clausification,[],[f39])).
% 0.13/0.38 thf(f39,plain,(
% 0.13/0.38 ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : (((in @ X1 @ X2) = $false) | (((X3 @ X1) => (in @ X1 @ (dsetconstr @ X2 @ X3))) = $true)) )),
% 0.13/0.38 inference(binary_proxy_clausification,[],[f38])).
% 0.13/0.38 thf(f38,plain,(
% 0.13/0.38 ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : (($true = ((in @ X1 @ X2) => ((X3 @ X1) => (in @ X1 @ (dsetconstr @ X2 @ X3)))))) )),
% 0.13/0.38 inference(beta_eta_normalization,[],[f37])).
% 0.13/0.38 thf(f37,plain,(
% 0.13/0.38 ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : ((((^[Y0 : $i > $o]: ((in @ X1 @ X2) => ((Y0 @ X1) => (in @ X1 @ (dsetconstr @ X2 @ Y0))))) @ X3) = $true)) )),
% 0.13/0.38 inference(pi_clausification,[],[f36])).
% 0.13/0.38 thf(f36,plain,(
% 0.13/0.38 ( ! [X2 : $i,X1 : $i] : (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((in @ X1 @ X2) => ((Y0 @ X1) => (in @ X1 @ (dsetconstr @ X2 @ Y0)))))) = $true)) )),
% 0.13/0.38 inference(beta_eta_normalization,[],[f35])).
% 0.13/0.38 thf(f35,plain,(
% 0.13/0.38 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((in @ X1 @ Y0) => ((Y1 @ X1) => (in @ X1 @ (dsetconstr @ Y0 @ Y1))))))) @ X2))) )),
% 0.13/0.38 inference(pi_clausification,[],[f34])).
% 0.13/0.38 thf(f34,plain,(
% 0.13/0.38 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((in @ X1 @ Y0) => ((Y1 @ X1) => (in @ X1 @ (dsetconstr @ Y0 @ Y1)))))))) = $true)) )),
% 0.13/0.38 inference(beta_eta_normalization,[],[f33])).
% 0.13/0.38 thf(f33,plain,(
% 0.13/0.38 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ Y1) => ((Y2 @ Y0) => (in @ Y0 @ (dsetconstr @ Y1 @ Y2))))))))) @ X1) = $true)) )),
% 0.13/0.38 inference(pi_clausification,[],[f32])).
% 0.13/0.38 thf(f32,plain,(
% 0.13/0.38 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ Y1) => ((Y2 @ Y0) => (in @ Y0 @ (dsetconstr @ Y1 @ Y2)))))))))) = $true)),
% 0.13/0.38 inference(beta_eta_normalization,[],[f30])).
% 0.13/0.38 thf(f30,plain,(
% 0.13/0.38 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ Y1) => ((Y2 @ Y0) => (in @ Y0 @ (dsetconstr @ Y1 @ (^[Y3 : $i]: (Y2 @ Y3)))))))))))) = $true)),
% 0.13/0.38 inference(definition_unfolding,[],[f27,f22])).
% 0.13/0.38 thf(f22,plain,(
% 0.13/0.38 (dsetconstrI = $true)),
% 0.13/0.38 inference(cnf_transformation,[],[f19])).
% 0.13/0.38 thf(f27,plain,(
% 0.13/0.38 (dsetconstrI = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ Y1) => ((Y2 @ Y0) => (in @ Y0 @ (dsetconstr @ Y1 @ (^[Y3 : $i]: (Y2 @ Y3)))))))))))))),
% 0.13/0.38 inference(cnf_transformation,[],[f14])).
% 0.13/0.38 thf(f14,plain,(
% 0.13/0.38 (dsetconstrI = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ Y1) => ((Y2 @ Y0) => (in @ Y0 @ (dsetconstr @ Y1 @ (^[Y3 : $i]: (Y2 @ Y3)))))))))))))),
% 0.13/0.38 inference(fool_elimination,[],[f13])).
% 0.13/0.38 thf(f13,plain,(
% 0.13/0.38 (dsetconstrI = ! [X0 : $i > $o,X1,X2] : ((in @ X2 @ X1) => ((X0 @ X2) => (in @ X2 @ (dsetconstr @ X1 @ (^[X3 : $i] : (X0 @ X3)))))))),
% 0.13/0.38 inference(rectify,[],[f1])).
% 0.13/0.38 thf(f1,axiom,(
% 0.13/0.38 (dsetconstrI = ! [X1 : $i > $o,X0,X2] : ((in @ X2 @ X0) => ((X1 @ X2) => (in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))))))),
% 0.13/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrI)).
% 0.13/0.38 thf(f31,plain,(
% 0.13/0.38 ((in @ sK2 @ (dsetconstr @ (binunion @ sK0 @ sK1) @ (^[Y0 : $i]: ((~ (in @ Y0 @ sK0)) | (~ (in @ Y0 @ sK1)))))) != $true)),
% 0.13/0.38 inference(beta_eta_normalization,[],[f28])).
% 0.13/0.38 thf(f28,plain,(
% 0.13/0.38 ((in @ sK2 @ ((^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (binunion @ Y0 @ Y1) @ (^[Y2 : $i]: ((~ (in @ Y2 @ Y0)) | (~ (in @ Y2 @ Y1)))))))) @ sK0 @ sK1)) != $true)),
% 0.13/0.38 inference(definition_unfolding,[],[f25,f26])).
% 0.13/0.38 thf(f26,plain,(
% 0.13/0.38 (symdiff = (^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (binunion @ Y0 @ Y1) @ (^[Y2 : $i]: ((~ (in @ Y2 @ Y0)) | (~ (in @ Y2 @ Y1)))))))))),
% 0.13/0.38 inference(cnf_transformation,[],[f12])).
% 0.13/0.38 thf(f12,plain,(
% 0.13/0.38 (symdiff = (^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (binunion @ Y0 @ Y1) @ (^[Y2 : $i]: ((~ (in @ Y2 @ Y0)) | (~ (in @ Y2 @ Y1)))))))))),
% 0.13/0.38 inference(fool_elimination,[],[f11])).
% 0.13/0.38 thf(f11,plain,(
% 0.13/0.38 (symdiff = (^[X0 : $i, X1 : $i] : (dsetconstr @ (binunion @ X0 @ X1) @ (^[X2 : $i] : (~(in @ X2 @ X1) | ~(in @ X2 @ X0))))))),
% 0.13/0.38 inference(rectify,[],[f3])).
% 0.13/0.38 thf(f3,axiom,(
% 0.13/0.38 (symdiff = (^[X0 : $i, X4 : $i] : (dsetconstr @ (binunion @ X0 @ X4) @ (^[X2 : $i] : (~(in @ X2 @ X4) | ~(in @ X2 @ X0))))))),
% 0.13/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',symdiff)).
% 0.13/0.38 thf(f25,plain,(
% 0.13/0.38 ($true != (in @ sK2 @ (symdiff @ sK0 @ sK1)))),
% 0.13/0.38 inference(cnf_transformation,[],[f19])).
% 0.13/0.38 thf(f47,plain,(
% 0.13/0.38 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (in @ X2 @ (binunion @ X3 @ X1))) | ((in @ X2 @ X1) = $false)) )),
% 0.13/0.38 inference(binary_proxy_clausification,[],[f46])).
% 0.13/0.38 thf(f46,plain,(
% 0.13/0.38 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((in @ X2 @ X1) => (in @ X2 @ (binunion @ X3 @ X1))) = $true)) )),
% 0.13/0.38 inference(beta_eta_normalization,[],[f45])).
% 0.13/0.38 thf(f45,plain,(
% 0.13/0.38 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((^[Y0 : $i]: ((in @ X2 @ X1) => (in @ X2 @ (binunion @ Y0 @ X1)))) @ X3) = $true)) )),
% 0.13/0.38 inference(pi_clausification,[],[f44])).
% 0.13/0.38 thf(f44,plain,(
% 0.13/0.38 ( ! [X2 : $i,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((in @ X2 @ X1) => (in @ X2 @ (binunion @ Y0 @ X1))))) = $true)) )),
% 0.13/0.38 inference(beta_eta_normalization,[],[f43])).
% 0.13/0.38 thf(f43,plain,(
% 0.13/0.38 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ X1) => (in @ Y0 @ (binunion @ Y1 @ X1)))))) @ X2) = $true)) )),
% 0.13/0.38 inference(pi_clausification,[],[f42])).
% 0.13/0.38 thf(f42,plain,(
% 0.13/0.38 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ X1) => (in @ Y0 @ (binunion @ Y1 @ X1))))))) = $true)) )),
% 0.13/0.38 inference(beta_eta_normalization,[],[f41])).
% 0.13/0.38 thf(f41,plain,(
% 0.13/0.38 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ (binunion @ Y2 @ Y0)))))))) @ X1) = $true)) )),
% 0.13/0.38 inference(pi_clausification,[],[f29])).
% 0.13/0.38 thf(f29,plain,(
% 0.13/0.38 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ (binunion @ Y2 @ Y0))))))))) = $true)),
% 0.13/0.38 inference(definition_unfolding,[],[f21,f20])).
% 0.13/0.38 thf(f20,plain,(
% 0.13/0.38 (binunionIR = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ (binunion @ Y2 @ Y0))))))))))),
% 0.13/0.38 inference(cnf_transformation,[],[f10])).
% 0.13/0.38 thf(f10,plain,(
% 0.13/0.38 (binunionIR = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ (binunion @ Y2 @ Y0))))))))))),
% 0.13/0.38 inference(fool_elimination,[],[f9])).
% 0.13/0.38 thf(f9,plain,(
% 0.13/0.38 (binunionIR = ! [X0,X1,X2] : ((in @ X1 @ X2) => (in @ X1 @ (binunion @ X0 @ X2))))),
% 0.13/0.38 inference(rectify,[],[f2])).
% 0.13/0.38 thf(f2,axiom,(
% 0.13/0.38 (binunionIR = ! [X0,X2,X4] : ((in @ X2 @ X4) => (in @ X2 @ (binunion @ X0 @ X4))))),
% 0.13/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binunionIR)).
% 0.13/0.38 thf(f21,plain,(
% 0.13/0.38 (binunionIR = $true)),
% 0.13/0.38 inference(cnf_transformation,[],[f19])).
% 0.13/0.38 thf(f24,plain,(
% 0.13/0.38 ((in @ sK2 @ sK1) = $true)),
% 0.13/0.38 inference(cnf_transformation,[],[f19])).
% 0.13/0.38 % SZS output end Proof for theBenchmark
% 0.13/0.38 % (14580)------------------------------
% 0.13/0.38 % (14580)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (14580)Termination reason: Refutation
% 0.13/0.38
% 0.13/0.38 % (14580)Memory used [KB]: 5500
% 0.13/0.38 % (14580)Time elapsed: 0.008 s
% 0.13/0.38 % (14580)Instructions burned: 6 (million)
% 0.13/0.38 % (14580)------------------------------
% 0.13/0.38 % (14580)------------------------------
% 0.13/0.38 % (14579)Success in time 0.007 s
% 0.13/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------