TSTP Solution File: SEU732^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU732^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 : n010.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:06 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU732^2 : TPTP v8.2.0. Released v3.7.0.
% 0.12/0.15 % 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.36 % Computer : n010.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 17:44:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/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/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 % (16005)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.38 % (16012)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 % (16006)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.38 % (16007)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.38 % (16008)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.38 % (16009)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 % (16010)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.38 % (16008)Instruction limit reached!
% 0.14/0.38 % (16008)------------------------------
% 0.14/0.38 % (16008)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (16009)Instruction limit reached!
% 0.14/0.38 % (16009)------------------------------
% 0.14/0.38 % (16009)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (16008)Termination reason: Unknown
% 0.14/0.38 % (16008)Termination phase: Preprocessing 2
% 0.14/0.38
% 0.14/0.38 % (16008)Memory used [KB]: 895
% 0.14/0.38 % (16008)Time elapsed: 0.003 s
% 0.14/0.38 % (16008)Instructions burned: 2 (million)
% 0.14/0.38 % (16008)------------------------------
% 0.14/0.38 % (16008)------------------------------
% 0.14/0.38 % (16009)Termination reason: Unknown
% 0.14/0.38 % (16009)Termination phase: Property scanning
% 0.14/0.38
% 0.14/0.38 % (16009)Memory used [KB]: 895
% 0.14/0.38 % (16009)Time elapsed: 0.003 s
% 0.14/0.38 % (16009)Instructions burned: 2 (million)
% 0.14/0.38 % (16009)------------------------------
% 0.14/0.38 % (16009)------------------------------
% 0.14/0.38 % (16012)Instruction limit reached!
% 0.14/0.38 % (16012)------------------------------
% 0.14/0.38 % (16012)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (16012)Termination reason: Unknown
% 0.14/0.38 % (16012)Termination phase: Property scanning
% 0.14/0.38
% 0.14/0.38 % (16012)Memory used [KB]: 1023
% 0.14/0.38 % (16012)Time elapsed: 0.003 s
% 0.14/0.38 % (16012)Instructions burned: 3 (million)
% 0.14/0.38 % (16012)------------------------------
% 0.14/0.38 % (16012)------------------------------
% 0.14/0.39 % (16006)Instruction limit reached!
% 0.14/0.39 % (16006)------------------------------
% 0.14/0.39 % (16006)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (16006)Termination reason: Unknown
% 0.14/0.39 % (16006)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (16006)Memory used [KB]: 5500
% 0.14/0.39 % (16006)Time elapsed: 0.005 s
% 0.14/0.39 % (16006)Instructions burned: 5 (million)
% 0.14/0.39 % (16006)------------------------------
% 0.14/0.39 % (16006)------------------------------
% 0.14/0.39 % (16010)First to succeed.
% 0.14/0.39 % (16011)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.39 % (16005)Also succeeded, but the first one will report.
% 0.14/0.39 % (16010)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% 0.14/0.39 thf(func_def_0, type, in: $i > $i > $o).
% 0.14/0.39 thf(func_def_1, type, powerset: $i > $i).
% 0.14/0.39 thf(func_def_2, type, binintersect: $i > $i > $i).
% 0.14/0.39 thf(func_def_3, type, setminus: $i > $i > $i).
% 0.14/0.39 thf(f69,plain,(
% 0.14/0.39 $false),
% 0.14/0.39 inference(subsumption_resolution,[],[f68,f40])).
% 0.14/0.39 thf(f40,plain,(
% 0.14/0.39 ((in @ sK6 @ sK4) = $true)),
% 0.14/0.39 inference(cnf_transformation,[],[f27])).
% 0.14/0.39 thf(f27,plain,(
% 0.14/0.39 (binintersectTELcontra = $true) & (setminusER = $true) & (((($true = (in @ sK6 @ (setminus @ sK4 @ sK3))) & ((in @ sK6 @ sK4) = $true) & ((in @ sK6 @ (binintersect @ sK3 @ sK5)) = $true)) & ($true = (in @ sK5 @ (powerset @ sK4)))) & ((in @ sK3 @ (powerset @ sK4)) = $true))),
% 0.14/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f19,f26,f25,f24])).
% 0.14/0.39 thf(f24,plain,(
% 0.14/0.39 ? [X0,X1] : (? [X2] : (? [X3] : (((in @ X3 @ (setminus @ X1 @ X0)) = $true) & ($true = (in @ X3 @ X1)) & ($true = (in @ X3 @ (binintersect @ X0 @ X2)))) & ((in @ X2 @ (powerset @ X1)) = $true)) & ((in @ X0 @ (powerset @ X1)) = $true)) => (? [X2] : (? [X3] : (((in @ X3 @ (setminus @ sK4 @ sK3)) = $true) & ((in @ X3 @ sK4) = $true) & ((in @ X3 @ (binintersect @ sK3 @ X2)) = $true)) & ($true = (in @ X2 @ (powerset @ sK4)))) & ((in @ sK3 @ (powerset @ sK4)) = $true))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f25,plain,(
% 0.14/0.39 ? [X2] : (? [X3] : (((in @ X3 @ (setminus @ sK4 @ sK3)) = $true) & ((in @ X3 @ sK4) = $true) & ((in @ X3 @ (binintersect @ sK3 @ X2)) = $true)) & ($true = (in @ X2 @ (powerset @ sK4)))) => (? [X3] : (((in @ X3 @ (setminus @ sK4 @ sK3)) = $true) & ((in @ X3 @ sK4) = $true) & ((in @ X3 @ (binintersect @ sK3 @ sK5)) = $true)) & ($true = (in @ sK5 @ (powerset @ sK4))))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f26,plain,(
% 0.14/0.39 ? [X3] : (((in @ X3 @ (setminus @ sK4 @ sK3)) = $true) & ((in @ X3 @ sK4) = $true) & ((in @ X3 @ (binintersect @ sK3 @ sK5)) = $true)) => (($true = (in @ sK6 @ (setminus @ sK4 @ sK3))) & ((in @ sK6 @ sK4) = $true) & ((in @ sK6 @ (binintersect @ sK3 @ sK5)) = $true))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f19,plain,(
% 0.14/0.39 (binintersectTELcontra = $true) & (setminusER = $true) & ? [X0,X1] : (? [X2] : (? [X3] : (((in @ X3 @ (setminus @ X1 @ X0)) = $true) & ($true = (in @ X3 @ X1)) & ($true = (in @ X3 @ (binintersect @ X0 @ X2)))) & ((in @ X2 @ (powerset @ X1)) = $true)) & ((in @ X0 @ (powerset @ X1)) = $true))),
% 0.14/0.39 inference(flattening,[],[f18])).
% 0.14/0.39 thf(f18,plain,(
% 0.14/0.39 (? [X1,X0] : (? [X2] : (? [X3] : ((($true = (in @ X3 @ (binintersect @ X0 @ X2))) & ((in @ X3 @ (setminus @ X1 @ X0)) = $true)) & ($true = (in @ X3 @ X1))) & ((in @ X2 @ (powerset @ X1)) = $true)) & ((in @ X0 @ (powerset @ X1)) = $true)) & (binintersectTELcontra = $true)) & (setminusER = $true)),
% 0.14/0.39 inference(ennf_transformation,[],[f12])).
% 0.14/0.39 thf(f12,plain,(
% 0.14/0.39 ~((setminusER = $true) => ((binintersectTELcontra = $true) => ! [X1,X0] : (((in @ X0 @ (powerset @ X1)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X1)) = $true) => ! [X3] : (($true = (in @ X3 @ X1)) => (((in @ X3 @ (setminus @ X1 @ X0)) = $true) => ($true != (in @ X3 @ (binintersect @ X0 @ X2)))))))))),
% 0.14/0.39 inference(flattening,[],[f9])).
% 0.14/0.39 thf(f9,plain,(
% 0.14/0.39 ~((setminusER = $true) => ((binintersectTELcontra = $true) => ! [X0,X1] : (((in @ X0 @ (powerset @ X1)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X1)) = $true) => ! [X3] : (($true = (in @ X3 @ X1)) => (((in @ X3 @ (setminus @ X1 @ X0)) = $true) => ~($true = (in @ X3 @ (binintersect @ X0 @ X2)))))))))),
% 0.14/0.39 inference(fool_elimination,[],[f8])).
% 0.14/0.39 thf(f8,plain,(
% 0.14/0.39 ~(setminusER => (binintersectTELcontra => ! [X0,X1] : ((in @ X0 @ (powerset @ X1)) => ! [X2] : ((in @ X2 @ (powerset @ X1)) => ! [X3] : ((in @ X3 @ X1) => ((in @ X3 @ (setminus @ X1 @ X0)) => ~(in @ X3 @ (binintersect @ X0 @ X2))))))))),
% 0.14/0.39 inference(rectify,[],[f4])).
% 0.14/0.39 thf(f4,negated_conjecture,(
% 0.14/0.39 ~(setminusER => (binintersectTELcontra => ! [X3,X0] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => ((in @ X2 @ (setminus @ X0 @ X3)) => ~(in @ X2 @ (binintersect @ X3 @ X4))))))))),
% 0.14/0.39 inference(negated_conjecture,[],[f3])).
% 0.14/0.39 thf(f3,conjecture,(
% 0.14/0.39 setminusER => (binintersectTELcontra => ! [X3,X0] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => ((in @ X2 @ (setminus @ X0 @ X3)) => ~(in @ X2 @ (binintersect @ X3 @ X4)))))))),
% 0.14/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',complementTnotintersectT)).
% 0.14/0.39 thf(f68,plain,(
% 0.14/0.39 ((in @ sK6 @ sK4) != $true)),
% 0.14/0.39 inference(subsumption_resolution,[],[f67,f37])).
% 0.14/0.39 thf(f37,plain,(
% 0.14/0.39 ((in @ sK3 @ (powerset @ sK4)) = $true)),
% 0.14/0.39 inference(cnf_transformation,[],[f27])).
% 0.14/0.39 thf(f67,plain,(
% 0.14/0.39 ((in @ sK3 @ (powerset @ sK4)) != $true) | ((in @ sK6 @ sK4) != $true)),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f66])).
% 0.14/0.39 thf(f66,plain,(
% 0.14/0.39 ((in @ sK3 @ (powerset @ sK4)) != $true) | ($true != $true) | ((in @ sK6 @ sK4) != $true)),
% 0.14/0.39 inference(superposition,[],[f65,f38])).
% 0.14/0.39 thf(f38,plain,(
% 0.14/0.39 ($true = (in @ sK5 @ (powerset @ sK4)))),
% 0.14/0.39 inference(cnf_transformation,[],[f27])).
% 0.14/0.39 thf(f65,plain,(
% 0.14/0.39 ( ! [X0 : $i] : (((in @ sK5 @ (powerset @ X0)) != $true) | ((in @ sK3 @ (powerset @ X0)) != $true) | ((in @ sK6 @ X0) != $true)) )),
% 0.14/0.39 inference(subsumption_resolution,[],[f64,f62])).
% 0.14/0.39 thf(f62,plain,(
% 0.14/0.39 ($true != (in @ sK6 @ sK3))),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f61])).
% 0.14/0.39 thf(f61,plain,(
% 0.14/0.39 ($true != $true) | ($true != (in @ sK6 @ sK3))),
% 0.14/0.39 inference(superposition,[],[f60,f41])).
% 0.14/0.39 thf(f41,plain,(
% 0.14/0.39 ($true = (in @ sK6 @ (setminus @ sK4 @ sK3)))),
% 0.14/0.39 inference(cnf_transformation,[],[f27])).
% 0.14/0.39 thf(f60,plain,(
% 0.14/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (in @ X3 @ (setminus @ X5 @ X4))) | ((in @ X3 @ X4) != $true)) )),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f52])).
% 0.14/0.39 thf(f52,plain,(
% 0.14/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X3 @ X4) != $true) | ($true != (in @ X3 @ (setminus @ X5 @ X4))) | ($true != $true)) )),
% 0.14/0.39 inference(definition_unfolding,[],[f34,f42])).
% 0.14/0.39 thf(f42,plain,(
% 0.14/0.39 (setminusER = $true)),
% 0.14/0.39 inference(cnf_transformation,[],[f27])).
% 0.14/0.39 thf(f34,plain,(
% 0.14/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X3 @ X4) != $true) | ($true != (in @ X3 @ (setminus @ X5 @ X4))) | (setminusER != $true)) )),
% 0.14/0.39 inference(cnf_transformation,[],[f23])).
% 0.14/0.39 thf(f23,plain,(
% 0.14/0.39 ((setminusER = $true) | (((in @ sK0 @ sK1) = $true) & ((in @ sK0 @ (setminus @ sK2 @ sK1)) = $true))) & (! [X3,X4,X5] : (((in @ X3 @ X4) != $true) | ($true != (in @ X3 @ (setminus @ X5 @ X4)))) | (setminusER != $true))),
% 0.14/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f21,f22])).
% 0.14/0.39 thf(f22,plain,(
% 0.14/0.39 ? [X0,X1,X2] : (((in @ X0 @ X1) = $true) & ((in @ X0 @ (setminus @ X2 @ X1)) = $true)) => (((in @ sK0 @ sK1) = $true) & ((in @ sK0 @ (setminus @ sK2 @ sK1)) = $true))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f21,plain,(
% 0.14/0.39 ((setminusER = $true) | ? [X0,X1,X2] : (((in @ X0 @ X1) = $true) & ((in @ X0 @ (setminus @ X2 @ X1)) = $true))) & (! [X3,X4,X5] : (((in @ X3 @ X4) != $true) | ($true != (in @ X3 @ (setminus @ X5 @ X4)))) | (setminusER != $true))),
% 0.14/0.39 inference(rectify,[],[f20])).
% 0.14/0.39 thf(f20,plain,(
% 0.14/0.39 ((setminusER = $true) | ? [X0,X1,X2] : (((in @ X0 @ X1) = $true) & ((in @ X0 @ (setminus @ X2 @ X1)) = $true))) & (! [X0,X1,X2] : (((in @ X0 @ X1) != $true) | ((in @ X0 @ (setminus @ X2 @ X1)) != $true)) | (setminusER != $true))),
% 0.14/0.39 inference(nnf_transformation,[],[f17])).
% 0.14/0.39 thf(f17,plain,(
% 0.14/0.39 (setminusER = $true) <=> ! [X0,X1,X2] : (((in @ X0 @ X1) != $true) | ((in @ X0 @ (setminus @ X2 @ X1)) != $true))),
% 0.14/0.39 inference(ennf_transformation,[],[f14])).
% 0.14/0.39 thf(f14,plain,(
% 0.14/0.39 ! [X1,X0,X2] : (((in @ X0 @ (setminus @ X2 @ X1)) = $true) => ((in @ X0 @ X1) != $true)) <=> (setminusER = $true)),
% 0.14/0.39 inference(flattening,[],[f7])).
% 0.14/0.39 thf(f7,plain,(
% 0.14/0.39 (setminusER = $true) <=> ! [X0,X1,X2] : (((in @ X0 @ (setminus @ X2 @ X1)) = $true) => ~((in @ X0 @ X1) = $true))),
% 0.14/0.39 inference(fool_elimination,[],[f6])).
% 0.14/0.39 thf(f6,plain,(
% 0.14/0.39 (setminusER = ! [X0,X1,X2] : ((in @ X0 @ (setminus @ X2 @ X1)) => ~(in @ X0 @ X1)))),
% 0.14/0.39 inference(rectify,[],[f1])).
% 0.14/0.39 thf(f1,axiom,(
% 0.14/0.39 (setminusER = ! [X2,X1,X0] : ((in @ X2 @ (setminus @ X0 @ X1)) => ~(in @ X2 @ X1)))),
% 0.14/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusER)).
% 0.14/0.39 thf(f64,plain,(
% 0.14/0.39 ( ! [X0 : $i] : (((in @ sK3 @ (powerset @ X0)) != $true) | ((in @ sK5 @ (powerset @ X0)) != $true) | ((in @ sK6 @ X0) != $true) | ($true = (in @ sK6 @ sK3))) )),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f63])).
% 0.14/0.39 thf(f63,plain,(
% 0.14/0.39 ( ! [X0 : $i] : (($true != $true) | ((in @ sK3 @ (powerset @ X0)) != $true) | ((in @ sK5 @ (powerset @ X0)) != $true) | ($true = (in @ sK6 @ sK3)) | ((in @ sK6 @ X0) != $true)) )),
% 0.14/0.39 inference(superposition,[],[f59,f39])).
% 0.14/0.39 thf(f39,plain,(
% 0.14/0.39 ((in @ sK6 @ (binintersect @ sK3 @ sK5)) = $true)),
% 0.14/0.39 inference(cnf_transformation,[],[f27])).
% 0.14/0.39 thf(f59,plain,(
% 0.14/0.39 ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $i] : (((in @ X7 @ (binintersect @ X4 @ X6)) != $true) | ((in @ X7 @ X4) = $true) | ((in @ X4 @ (powerset @ X5)) != $true) | ((in @ X7 @ X5) != $true) | ((in @ X6 @ (powerset @ X5)) != $true)) )),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f58])).
% 0.14/0.39 thf(f58,plain,(
% 0.14/0.39 ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $i] : (((in @ X7 @ X4) = $true) | ((in @ X6 @ (powerset @ X5)) != $true) | ((in @ X7 @ X5) != $true) | ((in @ X4 @ (powerset @ X5)) != $true) | ($true != $true) | ((in @ X7 @ (binintersect @ X4 @ X6)) != $true)) )),
% 0.14/0.39 inference(definition_unfolding,[],[f44,f43])).
% 0.14/0.39 thf(f43,plain,(
% 0.14/0.39 (binintersectTELcontra = $true)),
% 0.14/0.39 inference(cnf_transformation,[],[f27])).
% 0.14/0.39 thf(f44,plain,(
% 0.14/0.39 ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $i] : (((in @ X4 @ (powerset @ X5)) != $true) | ((in @ X6 @ (powerset @ X5)) != $true) | ((in @ X7 @ X5) != $true) | ((in @ X7 @ X4) = $true) | ((in @ X7 @ (binintersect @ X4 @ X6)) != $true) | (binintersectTELcontra != $true)) )),
% 0.14/0.39 inference(cnf_transformation,[],[f33])).
% 0.14/0.39 thf(f33,plain,(
% 0.14/0.39 ((binintersectTELcontra = $true) | (((in @ sK7 @ (powerset @ sK8)) = $true) & (((in @ sK9 @ (powerset @ sK8)) = $true) & (((in @ sK10 @ sK8) = $true) & ($true != (in @ sK10 @ sK7)) & ((in @ sK10 @ (binintersect @ sK7 @ sK9)) = $true))))) & (! [X4,X5] : (((in @ X4 @ (powerset @ X5)) != $true) | ! [X6] : (((in @ X6 @ (powerset @ X5)) != $true) | ! [X7] : (((in @ X7 @ X5) != $true) | ((in @ X7 @ X4) = $true) | ((in @ X7 @ (binintersect @ X4 @ X6)) != $true)))) | (binintersectTELcontra != $true))),
% 0.14/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9,sK10])],[f29,f32,f31,f30])).
% 0.14/0.39 thf(f30,plain,(
% 0.14/0.39 ? [X0,X1] : (((in @ X0 @ (powerset @ X1)) = $true) & ? [X2] : (((in @ X2 @ (powerset @ X1)) = $true) & ? [X3] : (($true = (in @ X3 @ X1)) & ((in @ X3 @ X0) != $true) & ($true = (in @ X3 @ (binintersect @ X0 @ X2)))))) => (((in @ sK7 @ (powerset @ sK8)) = $true) & ? [X2] : (($true = (in @ X2 @ (powerset @ sK8))) & ? [X3] : (($true = (in @ X3 @ sK8)) & ((in @ X3 @ sK7) != $true) & ($true = (in @ X3 @ (binintersect @ sK7 @ X2))))))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f31,plain,(
% 0.14/0.39 ? [X2] : (($true = (in @ X2 @ (powerset @ sK8))) & ? [X3] : (($true = (in @ X3 @ sK8)) & ((in @ X3 @ sK7) != $true) & ($true = (in @ X3 @ (binintersect @ sK7 @ X2))))) => (((in @ sK9 @ (powerset @ sK8)) = $true) & ? [X3] : (($true = (in @ X3 @ sK8)) & ((in @ X3 @ sK7) != $true) & ((in @ X3 @ (binintersect @ sK7 @ sK9)) = $true)))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f32,plain,(
% 0.14/0.39 ? [X3] : (($true = (in @ X3 @ sK8)) & ((in @ X3 @ sK7) != $true) & ((in @ X3 @ (binintersect @ sK7 @ sK9)) = $true)) => (((in @ sK10 @ sK8) = $true) & ($true != (in @ sK10 @ sK7)) & ((in @ sK10 @ (binintersect @ sK7 @ sK9)) = $true))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f29,plain,(
% 0.14/0.39 ((binintersectTELcontra = $true) | ? [X0,X1] : (((in @ X0 @ (powerset @ X1)) = $true) & ? [X2] : (((in @ X2 @ (powerset @ X1)) = $true) & ? [X3] : (($true = (in @ X3 @ X1)) & ((in @ X3 @ X0) != $true) & ($true = (in @ X3 @ (binintersect @ X0 @ X2))))))) & (! [X4,X5] : (((in @ X4 @ (powerset @ X5)) != $true) | ! [X6] : (((in @ X6 @ (powerset @ X5)) != $true) | ! [X7] : (((in @ X7 @ X5) != $true) | ((in @ X7 @ X4) = $true) | ((in @ X7 @ (binintersect @ X4 @ X6)) != $true)))) | (binintersectTELcontra != $true))),
% 0.14/0.39 inference(rectify,[],[f28])).
% 0.14/0.39 thf(f28,plain,(
% 0.14/0.39 ((binintersectTELcontra = $true) | ? [X1,X0] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (((in @ X2 @ (powerset @ X0)) = $true) & ? [X3] : (((in @ X3 @ X0) = $true) & ($true != (in @ X3 @ X1)) & ((in @ X3 @ (binintersect @ X1 @ X2)) = $true))))) & (! [X1,X0] : (((in @ X1 @ (powerset @ X0)) != $true) | ! [X2] : (((in @ X2 @ (powerset @ X0)) != $true) | ! [X3] : (((in @ X3 @ X0) != $true) | ($true = (in @ X3 @ X1)) | ((in @ X3 @ (binintersect @ X1 @ X2)) != $true)))) | (binintersectTELcontra != $true))),
% 0.14/0.39 inference(nnf_transformation,[],[f16])).
% 0.14/0.39 thf(f16,plain,(
% 0.14/0.39 (binintersectTELcontra = $true) <=> ! [X1,X0] : (((in @ X1 @ (powerset @ X0)) != $true) | ! [X2] : (((in @ X2 @ (powerset @ X0)) != $true) | ! [X3] : (((in @ X3 @ X0) != $true) | ($true = (in @ X3 @ X1)) | ((in @ X3 @ (binintersect @ X1 @ X2)) != $true))))),
% 0.14/0.39 inference(flattening,[],[f15])).
% 0.14/0.39 thf(f15,plain,(
% 0.14/0.39 ! [X1,X0] : (! [X2] : (! [X3] : ((((in @ X3 @ (binintersect @ X1 @ X2)) != $true) | ($true = (in @ X3 @ X1))) | ((in @ X3 @ X0) != $true)) | ((in @ X2 @ (powerset @ X0)) != $true)) | ((in @ X1 @ (powerset @ X0)) != $true)) <=> (binintersectTELcontra = $true)),
% 0.14/0.39 inference(ennf_transformation,[],[f13])).
% 0.14/0.39 thf(f13,plain,(
% 0.14/0.39 ! [X1,X0] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X0)) = $true) => ! [X3] : (((in @ X3 @ X0) = $true) => (($true != (in @ X3 @ X1)) => ((in @ X3 @ (binintersect @ X1 @ X2)) != $true))))) <=> (binintersectTELcontra = $true)),
% 0.14/0.39 inference(flattening,[],[f11])).
% 0.14/0.39 thf(f11,plain,(
% 0.14/0.39 (binintersectTELcontra = $true) <=> ! [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X0)) = $true) => ! [X3] : (((in @ X3 @ X0) = $true) => (~($true = (in @ X3 @ X1)) => ~((in @ X3 @ (binintersect @ X1 @ X2)) = $true)))))),
% 0.14/0.39 inference(fool_elimination,[],[f10])).
% 0.14/0.39 thf(f10,plain,(
% 0.14/0.39 (binintersectTELcontra = ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X3] : ((in @ X3 @ X0) => (~(in @ X3 @ X1) => ~(in @ X3 @ (binintersect @ X1 @ X2)))))))),
% 0.14/0.39 inference(rectify,[],[f2])).
% 0.14/0.39 thf(f2,axiom,(
% 0.14/0.39 (binintersectTELcontra = ! [X0,X3] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => (~(in @ X2 @ X3) => ~(in @ X2 @ (binintersect @ X3 @ X4)))))))),
% 0.14/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectTELcontra)).
% 0.14/0.39 % SZS output end Proof for theBenchmark
% 0.14/0.39 % (16010)------------------------------
% 0.14/0.39 % (16010)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (16010)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (16010)Memory used [KB]: 5500
% 0.14/0.39 % (16010)Time elapsed: 0.008 s
% 0.14/0.39 % (16010)Instructions burned: 6 (million)
% 0.14/0.39 % (16010)------------------------------
% 0.14/0.39 % (16010)------------------------------
% 0.14/0.39 % (16004)Success in time 0.011 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------