TSTP Solution File: SEU740^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU740^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 : n015.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:10 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.08/0.12 % Problem : SEU740^2 : TPTP v8.2.0. Released v3.7.0.
% 0.08/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.14/0.35 % Computer : n015.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 15:33: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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.37 % (15419)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 % (15423)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.37 % (15422)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.37 % (15426)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.37 % (15424)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 % (15420)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 % (15425)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 % (15421)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 % (15422)Instruction limit reached!
% 0.14/0.37 % (15422)------------------------------
% 0.14/0.37 % (15422)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (15422)Termination reason: Unknown
% 0.14/0.37 % (15423)Instruction limit reached!
% 0.14/0.37 % (15423)------------------------------
% 0.14/0.37 % (15423)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (15423)Termination reason: Unknown
% 0.14/0.37 % (15423)Termination phase: Unused predicate definition removal
% 0.14/0.37
% 0.14/0.37 % (15423)Memory used [KB]: 895
% 0.14/0.37 % (15423)Time elapsed: 0.003 s
% 0.14/0.37 % (15423)Instructions burned: 2 (million)
% 0.14/0.37 % (15423)------------------------------
% 0.14/0.37 % (15423)------------------------------
% 0.14/0.37 % (15422)Termination phase: Preprocessing 3
% 0.14/0.37
% 0.14/0.37 % (15422)Memory used [KB]: 895
% 0.14/0.37 % (15422)Time elapsed: 0.003 s
% 0.14/0.37 % (15422)Instructions burned: 2 (million)
% 0.14/0.37 % (15422)------------------------------
% 0.14/0.37 % (15422)------------------------------
% 0.14/0.37 % (15426)Instruction limit reached!
% 0.14/0.37 % (15426)------------------------------
% 0.14/0.37 % (15426)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (15426)Termination reason: Unknown
% 0.14/0.37 % (15426)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (15426)Memory used [KB]: 5500
% 0.14/0.37 % (15426)Time elapsed: 0.004 s
% 0.14/0.37 % (15426)Instructions burned: 3 (million)
% 0.14/0.37 % (15426)------------------------------
% 0.14/0.37 % (15426)------------------------------
% 0.14/0.38 % (15420)Instruction limit reached!
% 0.14/0.38 % (15420)------------------------------
% 0.14/0.38 % (15420)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (15420)Termination reason: Unknown
% 0.14/0.38 % (15420)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (15420)Memory used [KB]: 5500
% 0.14/0.38 % (15420)Time elapsed: 0.005 s
% 0.14/0.38 % (15420)Instructions burned: 4 (million)
% 0.14/0.38 % (15420)------------------------------
% 0.14/0.38 % (15420)------------------------------
% 0.14/0.38 % (15424)First to succeed.
% 0.14/0.38 % (15419)Also succeeded, but the first one will report.
% 0.14/0.38 % (15421)Also succeeded, but the first one will report.
% 0.14/0.38 % (15424)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, powerset: $i > $i).
% 0.14/0.38 thf(func_def_2, type, binunion: $i > $i > $i).
% 0.14/0.38 thf(func_def_5, type, binintersect: $i > $i > $i).
% 0.14/0.38 thf(f55,plain,(
% 0.14/0.38 $false),
% 0.14/0.38 inference(subsumption_resolution,[],[f54,f52])).
% 0.14/0.38 thf(f52,plain,(
% 0.14/0.38 ((in @ sK4 @ sK1) != $true)),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f51])).
% 0.14/0.38 thf(f51,plain,(
% 0.14/0.38 ((in @ sK4 @ sK1) != $true) | ($true != $true)),
% 0.14/0.38 inference(superposition,[],[f34,f49])).
% 0.14/0.38 thf(f49,plain,(
% 0.14/0.38 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X5 @ (binunion @ X4 @ X3)) = $true) | ((in @ X5 @ X4) != $true)) )),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f48])).
% 0.14/0.38 thf(f48,plain,(
% 0.14/0.38 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X5 @ (binunion @ X4 @ X3)) = $true) | ($true != $true) | ((in @ X5 @ X4) != $true)) )),
% 0.14/0.38 inference(definition_unfolding,[],[f40,f29])).
% 0.14/0.38 thf(f29,plain,(
% 0.14/0.38 (binunionIL = $true)),
% 0.14/0.38 inference(cnf_transformation,[],[f20])).
% 0.14/0.38 thf(f20,plain,(
% 0.14/0.38 ((((in @ sK2 @ (powerset @ sK0)) = $true) & (((in @ sK3 @ (powerset @ sK0)) = $true) & (((in @ sK4 @ (binunion @ sK1 @ sK3)) != $true) & ($true = (in @ sK4 @ sK0)) & ($true = (in @ sK4 @ (binintersect @ sK1 @ sK2)))))) & ($true = (in @ sK1 @ (powerset @ sK0)))) & (binintersectEL = $true) & (binunionIL = $true)),
% 0.14/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f13,f19,f18,f17,f16])).
% 0.14/0.38 thf(f16,plain,(
% 0.14/0.38 ? [X0,X1] : (? [X2] : (((in @ X2 @ (powerset @ X0)) = $true) & ? [X3] : (((in @ X3 @ (powerset @ X0)) = $true) & ? [X4] : (((in @ X4 @ (binunion @ X1 @ X3)) != $true) & ((in @ X4 @ X0) = $true) & ((in @ X4 @ (binintersect @ X1 @ X2)) = $true)))) & ((in @ X1 @ (powerset @ X0)) = $true)) => (? [X2] : (((in @ X2 @ (powerset @ sK0)) = $true) & ? [X3] : (((in @ X3 @ (powerset @ sK0)) = $true) & ? [X4] : (($true != (in @ X4 @ (binunion @ sK1 @ X3))) & ((in @ X4 @ sK0) = $true) & ((in @ X4 @ (binintersect @ sK1 @ X2)) = $true)))) & ($true = (in @ sK1 @ (powerset @ sK0))))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f17,plain,(
% 0.14/0.38 ? [X2] : (((in @ X2 @ (powerset @ sK0)) = $true) & ? [X3] : (((in @ X3 @ (powerset @ sK0)) = $true) & ? [X4] : (($true != (in @ X4 @ (binunion @ sK1 @ X3))) & ((in @ X4 @ sK0) = $true) & ((in @ X4 @ (binintersect @ sK1 @ X2)) = $true)))) => (((in @ sK2 @ (powerset @ sK0)) = $true) & ? [X3] : (((in @ X3 @ (powerset @ sK0)) = $true) & ? [X4] : (($true != (in @ X4 @ (binunion @ sK1 @ X3))) & ((in @ X4 @ sK0) = $true) & ((in @ X4 @ (binintersect @ sK1 @ sK2)) = $true))))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f18,plain,(
% 0.14/0.38 ? [X3] : (((in @ X3 @ (powerset @ sK0)) = $true) & ? [X4] : (($true != (in @ X4 @ (binunion @ sK1 @ X3))) & ((in @ X4 @ sK0) = $true) & ((in @ X4 @ (binintersect @ sK1 @ sK2)) = $true))) => (((in @ sK3 @ (powerset @ sK0)) = $true) & ? [X4] : (($true != (in @ X4 @ (binunion @ sK1 @ sK3))) & ((in @ X4 @ sK0) = $true) & ((in @ X4 @ (binintersect @ sK1 @ sK2)) = $true)))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f19,plain,(
% 0.14/0.38 ? [X4] : (($true != (in @ X4 @ (binunion @ sK1 @ sK3))) & ((in @ X4 @ sK0) = $true) & ((in @ X4 @ (binintersect @ sK1 @ sK2)) = $true)) => (((in @ sK4 @ (binunion @ sK1 @ sK3)) != $true) & ($true = (in @ sK4 @ sK0)) & ($true = (in @ sK4 @ (binintersect @ sK1 @ sK2))))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f13,plain,(
% 0.14/0.38 ? [X0,X1] : (? [X2] : (((in @ X2 @ (powerset @ X0)) = $true) & ? [X3] : (((in @ X3 @ (powerset @ X0)) = $true) & ? [X4] : (((in @ X4 @ (binunion @ X1 @ X3)) != $true) & ((in @ X4 @ X0) = $true) & ((in @ X4 @ (binintersect @ X1 @ X2)) = $true)))) & ((in @ X1 @ (powerset @ X0)) = $true)) & (binintersectEL = $true) & (binunionIL = $true)),
% 0.14/0.38 inference(flattening,[],[f12])).
% 0.14/0.38 thf(f12,plain,(
% 0.14/0.38 (? [X1,X0] : (? [X2] : (? [X3] : (? [X4] : ((((in @ X4 @ (binunion @ X1 @ X3)) != $true) & ((in @ X4 @ (binintersect @ X1 @ X2)) = $true)) & ((in @ X4 @ X0) = $true)) & ((in @ X3 @ (powerset @ X0)) = $true)) & ((in @ X2 @ (powerset @ X0)) = $true)) & ((in @ X1 @ (powerset @ X0)) = $true)) & (binintersectEL = $true)) & (binunionIL = $true)),
% 0.14/0.38 inference(ennf_transformation,[],[f7])).
% 0.14/0.38 thf(f7,plain,(
% 0.14/0.38 ~((binunionIL = $true) => ((binintersectEL = $true) => ! [X1,X0] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X0)) = $true) => ! [X3] : (((in @ X3 @ (powerset @ X0)) = $true) => ! [X4] : (((in @ X4 @ X0) = $true) => (((in @ X4 @ (binintersect @ X1 @ X2)) = $true) => ((in @ X4 @ (binunion @ X1 @ X3)) = $true))))))))),
% 0.14/0.38 inference(fool_elimination,[],[f6])).
% 0.14/0.38 thf(f6,plain,(
% 0.14/0.38 ~(binunionIL => (binintersectEL => ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X3] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ X0) => ((in @ X4 @ (binintersect @ X1 @ X2)) => (in @ X4 @ (binunion @ X1 @ X3)))))))))),
% 0.14/0.38 inference(rectify,[],[f4])).
% 0.14/0.38 thf(f4,negated_conjecture,(
% 0.14/0.38 ~(binunionIL => (binintersectEL => ! [X0,X3] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X5] : ((in @ X5 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => ((in @ X2 @ (binintersect @ X3 @ X4)) => (in @ X2 @ (binunion @ X3 @ X5)))))))))),
% 0.14/0.38 inference(negated_conjecture,[],[f3])).
% 0.14/0.38 thf(f3,conjecture,(
% 0.14/0.38 binunionIL => (binintersectEL => ! [X0,X3] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X5] : ((in @ X5 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => ((in @ X2 @ (binintersect @ X3 @ X4)) => (in @ X2 @ (binunion @ X3 @ X5))))))))),
% 0.14/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inIntersectImpInUnion)).
% 0.14/0.38 thf(f40,plain,(
% 0.14/0.38 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X5 @ X4) != $true) | ((in @ X5 @ (binunion @ X4 @ X3)) = $true) | (binunionIL != $true)) )),
% 0.14/0.38 inference(cnf_transformation,[],[f28])).
% 0.14/0.38 thf(f28,plain,(
% 0.14/0.38 ((binunionIL = $true) | (($true = (in @ sK10 @ sK9)) & ((in @ sK10 @ (binunion @ sK9 @ sK8)) != $true))) & (! [X3,X4,X5] : (((in @ X5 @ X4) != $true) | ((in @ X5 @ (binunion @ X4 @ X3)) = $true)) | (binunionIL != $true))),
% 0.14/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10])],[f26,f27])).
% 0.14/0.38 thf(f27,plain,(
% 0.14/0.38 ? [X0,X1,X2] : (((in @ X2 @ X1) = $true) & ($true != (in @ X2 @ (binunion @ X1 @ X0)))) => (($true = (in @ sK10 @ sK9)) & ((in @ sK10 @ (binunion @ sK9 @ sK8)) != $true))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f26,plain,(
% 0.14/0.38 ((binunionIL = $true) | ? [X0,X1,X2] : (((in @ X2 @ X1) = $true) & ($true != (in @ X2 @ (binunion @ X1 @ X0))))) & (! [X3,X4,X5] : (((in @ X5 @ X4) != $true) | ((in @ X5 @ (binunion @ X4 @ X3)) = $true)) | (binunionIL != $true))),
% 0.14/0.38 inference(rectify,[],[f25])).
% 0.14/0.38 thf(f25,plain,(
% 0.14/0.38 ((binunionIL = $true) | ? [X0,X1,X2] : (((in @ X2 @ X1) = $true) & ($true != (in @ X2 @ (binunion @ X1 @ X0))))) & (! [X0,X1,X2] : (((in @ X2 @ X1) != $true) | ($true = (in @ X2 @ (binunion @ X1 @ X0)))) | (binunionIL != $true))),
% 0.14/0.38 inference(nnf_transformation,[],[f14])).
% 0.14/0.38 thf(f14,plain,(
% 0.14/0.38 (binunionIL = $true) <=> ! [X0,X1,X2] : (((in @ X2 @ X1) != $true) | ($true = (in @ X2 @ (binunion @ X1 @ X0))))),
% 0.14/0.38 inference(ennf_transformation,[],[f11])).
% 0.14/0.38 thf(f11,plain,(
% 0.14/0.38 ! [X0,X1,X2] : (((in @ X2 @ X1) = $true) => ($true = (in @ X2 @ (binunion @ X1 @ X0)))) <=> (binunionIL = $true)),
% 0.14/0.38 inference(fool_elimination,[],[f10])).
% 0.14/0.38 thf(f10,plain,(
% 0.14/0.38 (binunionIL = ! [X0,X1,X2] : ((in @ X2 @ X1) => (in @ X2 @ (binunion @ X1 @ X0))))),
% 0.14/0.38 inference(rectify,[],[f1])).
% 0.14/0.38 thf(f1,axiom,(
% 0.14/0.38 (binunionIL = ! [X1,X0,X2] : ((in @ X2 @ X0) => (in @ X2 @ (binunion @ X0 @ X1))))),
% 0.14/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionIL)).
% 0.14/0.38 thf(f34,plain,(
% 0.14/0.38 ((in @ sK4 @ (binunion @ sK1 @ sK3)) != $true)),
% 0.14/0.38 inference(cnf_transformation,[],[f20])).
% 0.14/0.38 thf(f54,plain,(
% 0.14/0.38 ((in @ sK4 @ sK1) = $true)),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f53])).
% 0.14/0.38 thf(f53,plain,(
% 0.14/0.38 ($true != $true) | ((in @ sK4 @ sK1) = $true)),
% 0.14/0.38 inference(superposition,[],[f50,f32])).
% 0.14/0.38 thf(f32,plain,(
% 0.14/0.38 ($true = (in @ sK4 @ (binintersect @ sK1 @ sK2)))),
% 0.14/0.38 inference(cnf_transformation,[],[f20])).
% 0.14/0.38 thf(f50,plain,(
% 0.14/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X2 @ (binintersect @ X1 @ X0)) != $true) | ((in @ X2 @ X1) = $true)) )),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f43])).
% 0.14/0.38 thf(f43,plain,(
% 0.14/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X2 @ X1) = $true) | ($true != $true) | ((in @ X2 @ (binintersect @ X1 @ X0)) != $true)) )),
% 0.14/0.38 inference(definition_unfolding,[],[f39,f30])).
% 0.14/0.38 thf(f30,plain,(
% 0.14/0.38 (binintersectEL = $true)),
% 0.14/0.38 inference(cnf_transformation,[],[f20])).
% 0.14/0.38 thf(f39,plain,(
% 0.14/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X2 @ X1) = $true) | ((in @ X2 @ (binintersect @ X1 @ X0)) != $true) | (binintersectEL != $true)) )),
% 0.14/0.38 inference(cnf_transformation,[],[f24])).
% 0.14/0.38 thf(f24,plain,(
% 0.14/0.38 (! [X0,X1,X2] : (((in @ X2 @ X1) = $true) | ((in @ X2 @ (binintersect @ X1 @ X0)) != $true)) | (binintersectEL != $true)) & ((binintersectEL = $true) | (((in @ sK7 @ sK6) != $true) & ((in @ sK7 @ (binintersect @ sK6 @ sK5)) = $true)))),
% 0.14/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f22,f23])).
% 0.14/0.38 thf(f23,plain,(
% 0.14/0.38 ? [X3,X4,X5] : (((in @ X5 @ X4) != $true) & ((in @ X5 @ (binintersect @ X4 @ X3)) = $true)) => (((in @ sK7 @ sK6) != $true) & ((in @ sK7 @ (binintersect @ sK6 @ sK5)) = $true))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f22,plain,(
% 0.14/0.38 (! [X0,X1,X2] : (((in @ X2 @ X1) = $true) | ((in @ X2 @ (binintersect @ X1 @ X0)) != $true)) | (binintersectEL != $true)) & ((binintersectEL = $true) | ? [X3,X4,X5] : (((in @ X5 @ X4) != $true) & ((in @ X5 @ (binintersect @ X4 @ X3)) = $true)))),
% 0.14/0.38 inference(rectify,[],[f21])).
% 0.14/0.38 thf(f21,plain,(
% 0.14/0.38 (! [X1,X2,X0] : (((in @ X0 @ X2) = $true) | ($true != (in @ X0 @ (binintersect @ X2 @ X1)))) | (binintersectEL != $true)) & ((binintersectEL = $true) | ? [X1,X2,X0] : (((in @ X0 @ X2) != $true) & ($true = (in @ X0 @ (binintersect @ X2 @ X1)))))),
% 0.14/0.38 inference(nnf_transformation,[],[f15])).
% 0.14/0.38 thf(f15,plain,(
% 0.14/0.38 ! [X1,X2,X0] : (((in @ X0 @ X2) = $true) | ($true != (in @ X0 @ (binintersect @ X2 @ X1)))) <=> (binintersectEL = $true)),
% 0.14/0.38 inference(ennf_transformation,[],[f9])).
% 0.14/0.38 thf(f9,plain,(
% 0.14/0.38 (binintersectEL = $true) <=> ! [X2,X0,X1] : (($true = (in @ X0 @ (binintersect @ X2 @ X1))) => ((in @ X0 @ X2) = $true))),
% 0.14/0.38 inference(fool_elimination,[],[f8])).
% 0.14/0.38 thf(f8,plain,(
% 0.14/0.38 (! [X0,X1,X2] : ((in @ X0 @ (binintersect @ X2 @ X1)) => (in @ X0 @ X2)) = binintersectEL)),
% 0.14/0.38 inference(rectify,[],[f2])).
% 0.14/0.38 thf(f2,axiom,(
% 0.14/0.38 (! [X2,X1,X0] : ((in @ X2 @ (binintersect @ X0 @ X1)) => (in @ X2 @ X0)) = binintersectEL)),
% 0.14/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectEL)).
% 0.14/0.38 % SZS output end Proof for theBenchmark
% 0.14/0.38 % (15424)------------------------------
% 0.14/0.38 % (15424)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (15424)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (15424)Memory used [KB]: 5500
% 0.14/0.38 % (15424)Time elapsed: 0.007 s
% 0.14/0.38 % (15424)Instructions burned: 4 (million)
% 0.14/0.38 % (15424)------------------------------
% 0.14/0.38 % (15424)------------------------------
% 0.14/0.38 % (15418)Success in time 0.009 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------