TSTP Solution File: SEU760^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU760^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 : n014.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:19 EDT 2024
% Result : Theorem 0.24s 0.41s
% Output : Refutation 0.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU760^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.38 % Computer : n014.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 300
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Sun May 19 18:06:08 EDT 2024
% 0.15/0.38 % CPUTime :
% 0.15/0.38 This is a TH0_THM_EQU_NAR problem
% 0.15/0.38 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.15/0.40 % (26355)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.40 % (26356)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.40 % (26361)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.40 % (26359)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.40 % (26358)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.40 % (26357)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.40 % (26360)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.40 % (26362)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.40 % (26358)Instruction limit reached!
% 0.15/0.40 % (26358)------------------------------
% 0.15/0.40 % (26358)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (26358)Termination reason: Unknown
% 0.15/0.40 % (26358)Termination phase: Property scanning
% 0.15/0.40 % (26359)Instruction limit reached!
% 0.15/0.40 % (26359)------------------------------
% 0.15/0.40 % (26359)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (26359)Termination reason: Unknown
% 0.15/0.40 % (26359)Termination phase: Property scanning
% 0.15/0.40
% 0.15/0.40 % (26359)Memory used [KB]: 895
% 0.15/0.40 % (26359)Time elapsed: 0.003 s
% 0.15/0.40 % (26359)Instructions burned: 2 (million)
% 0.15/0.40 % (26359)------------------------------
% 0.15/0.40 % (26359)------------------------------
% 0.15/0.40
% 0.15/0.40 % (26358)Memory used [KB]: 895
% 0.15/0.40 % (26358)Time elapsed: 0.003 s
% 0.15/0.40 % (26358)Instructions burned: 2 (million)
% 0.15/0.40 % (26358)------------------------------
% 0.15/0.40 % (26358)------------------------------
% 0.15/0.40 % (26362)Instruction limit reached!
% 0.15/0.40 % (26362)------------------------------
% 0.15/0.40 % (26362)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (26362)Termination reason: Unknown
% 0.15/0.40 % (26362)Termination phase: Saturation
% 0.15/0.40
% 0.15/0.40 % (26362)Memory used [KB]: 5500
% 0.15/0.40 % (26362)Time elapsed: 0.003 s
% 0.15/0.40 % (26362)Instructions burned: 3 (million)
% 0.15/0.40 % (26362)------------------------------
% 0.15/0.40 % (26362)------------------------------
% 0.15/0.40 % (26356)Instruction limit reached!
% 0.15/0.40 % (26356)------------------------------
% 0.15/0.40 % (26356)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (26356)Termination reason: Unknown
% 0.15/0.40 % (26356)Termination phase: Saturation
% 0.15/0.40
% 0.15/0.40 % (26356)Memory used [KB]: 5500
% 0.15/0.40 % (26356)Time elapsed: 0.005 s
% 0.15/0.40 % (26356)Instructions burned: 5 (million)
% 0.15/0.40 % (26356)------------------------------
% 0.15/0.40 % (26356)------------------------------
% 0.15/0.40 % (26361)First to succeed.
% 0.24/0.40 % (26360)Also succeeded, but the first one will report.
% 0.24/0.41 % (26361)Refutation found. Thanks to Tanya!
% 0.24/0.41 % SZS status Theorem for theBenchmark
% 0.24/0.41 % SZS output start Proof for theBenchmark
% 0.24/0.41 thf(func_def_0, type, in: $i > $i > $o).
% 0.24/0.41 thf(func_def_1, type, powerset: $i > $i).
% 0.24/0.41 thf(func_def_2, type, subset: $i > $i > $o).
% 0.24/0.41 thf(func_def_6, type, binintersect: $i > $i > $i).
% 0.24/0.41 thf(func_def_12, type, sK2: $i > $i > $i).
% 0.24/0.41 thf(f84,plain,(
% 0.24/0.41 $false),
% 0.24/0.41 inference(subsumption_resolution,[],[f83,f46])).
% 0.24/0.41 thf(f46,plain,(
% 0.24/0.41 ($true != (subset @ (binintersect @ sK4 @ sK5) @ sK6))),
% 0.24/0.41 inference(cnf_transformation,[],[f29])).
% 0.24/0.41 thf(f29,plain,(
% 0.24/0.41 (subsetI1 = $true) & (((($true = (subset @ sK5 @ sK6)) & ($true = (in @ sK6 @ (powerset @ sK3))) & ($true != (subset @ (binintersect @ sK4 @ sK5) @ sK6))) & ((in @ sK5 @ (powerset @ sK3)) = $true)) & ($true = (in @ sK4 @ (powerset @ sK3)))) & (binintersectER = $true) & (subsetE = $true)),
% 0.24/0.41 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f16,f28,f27,f26])).
% 0.24/0.41 thf(f26,plain,(
% 0.24/0.41 ? [X0,X1] : (? [X2] : (? [X3] : (($true = (subset @ X2 @ X3)) & ((in @ X3 @ (powerset @ X0)) = $true) & ((subset @ (binintersect @ X1 @ X2) @ X3) != $true)) & ($true = (in @ X2 @ (powerset @ X0)))) & ($true = (in @ X1 @ (powerset @ X0)))) => (? [X2] : (? [X3] : (($true = (subset @ X2 @ X3)) & ($true = (in @ X3 @ (powerset @ sK3))) & ($true != (subset @ (binintersect @ sK4 @ X2) @ X3))) & ($true = (in @ X2 @ (powerset @ sK3)))) & ($true = (in @ sK4 @ (powerset @ sK3))))),
% 0.24/0.41 introduced(choice_axiom,[])).
% 0.24/0.41 thf(f27,plain,(
% 0.24/0.41 ? [X2] : (? [X3] : (($true = (subset @ X2 @ X3)) & ($true = (in @ X3 @ (powerset @ sK3))) & ($true != (subset @ (binintersect @ sK4 @ X2) @ X3))) & ($true = (in @ X2 @ (powerset @ sK3)))) => (? [X3] : (($true = (subset @ sK5 @ X3)) & ($true = (in @ X3 @ (powerset @ sK3))) & ($true != (subset @ (binintersect @ sK4 @ sK5) @ X3))) & ((in @ sK5 @ (powerset @ sK3)) = $true))),
% 0.24/0.41 introduced(choice_axiom,[])).
% 0.24/0.41 thf(f28,plain,(
% 0.24/0.41 ? [X3] : (($true = (subset @ sK5 @ X3)) & ($true = (in @ X3 @ (powerset @ sK3))) & ($true != (subset @ (binintersect @ sK4 @ sK5) @ X3))) => (($true = (subset @ sK5 @ sK6)) & ($true = (in @ sK6 @ (powerset @ sK3))) & ($true != (subset @ (binintersect @ sK4 @ sK5) @ sK6)))),
% 0.24/0.41 introduced(choice_axiom,[])).
% 0.24/0.41 thf(f16,plain,(
% 0.24/0.41 (subsetI1 = $true) & ? [X0,X1] : (? [X2] : (? [X3] : (($true = (subset @ X2 @ X3)) & ((in @ X3 @ (powerset @ X0)) = $true) & ((subset @ (binintersect @ X1 @ X2) @ X3) != $true)) & ($true = (in @ X2 @ (powerset @ X0)))) & ($true = (in @ X1 @ (powerset @ X0)))) & (binintersectER = $true) & (subsetE = $true)),
% 0.24/0.41 inference(flattening,[],[f15])).
% 0.24/0.41 thf(f15,plain,(
% 0.24/0.41 ((? [X1,X0] : (? [X2] : (? [X3] : ((((subset @ (binintersect @ X1 @ X2) @ X3) != $true) & ($true = (subset @ X2 @ X3))) & ((in @ X3 @ (powerset @ X0)) = $true)) & ($true = (in @ X2 @ (powerset @ X0)))) & ($true = (in @ X1 @ (powerset @ X0)))) & (binintersectER = $true)) & (subsetE = $true)) & (subsetI1 = $true)),
% 0.24/0.41 inference(ennf_transformation,[],[f8])).
% 0.24/0.41 thf(f8,plain,(
% 0.24/0.41 ~((subsetI1 = $true) => ((subsetE = $true) => ((binintersectER = $true) => ! [X1,X0] : (($true = (in @ X1 @ (powerset @ X0))) => ! [X2] : (($true = (in @ X2 @ (powerset @ X0))) => ! [X3] : (((in @ X3 @ (powerset @ X0)) = $true) => (($true = (subset @ X2 @ X3)) => ((subset @ (binintersect @ X1 @ X2) @ X3) = $true))))))))),
% 0.24/0.41 inference(fool_elimination,[],[f7])).
% 0.24/0.41 thf(f7,plain,(
% 0.24/0.41 ~(subsetI1 => (subsetE => (binintersectER => ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X3] : ((in @ X3 @ (powerset @ X0)) => ((subset @ X2 @ X3) => (subset @ (binintersect @ X1 @ X2) @ X3))))))))),
% 0.24/0.41 inference(rectify,[],[f5])).
% 0.24/0.41 thf(f5,negated_conjecture,(
% 0.24/0.41 ~(subsetI1 => (subsetE => (binintersectER => ! [X0,X3] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X5] : ((in @ X5 @ (powerset @ X0)) => ((subset @ X4 @ X5) => (subset @ (binintersect @ X3 @ X4) @ X5))))))))),
% 0.24/0.41 inference(negated_conjecture,[],[f4])).
% 0.24/0.41 thf(f4,conjecture,(
% 0.24/0.41 subsetI1 => (subsetE => (binintersectER => ! [X0,X3] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X5] : ((in @ X5 @ (powerset @ X0)) => ((subset @ X4 @ X5) => (subset @ (binintersect @ X3 @ X4) @ X5)))))))),
% 0.24/0.41 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',woz13rule2)).
% 0.24/0.41 thf(f83,plain,(
% 0.24/0.41 ($true = (subset @ (binintersect @ sK4 @ sK5) @ sK6))),
% 0.24/0.41 inference(trivial_inequality_removal,[],[f82])).
% 0.24/0.41 thf(f82,plain,(
% 0.24/0.41 ($true != $true) | ($true = (subset @ (binintersect @ sK4 @ sK5) @ sK6))),
% 0.24/0.41 inference(superposition,[],[f71,f81])).
% 0.24/0.41 thf(f81,plain,(
% 0.24/0.41 ($true = (in @ (sK2 @ sK6 @ (binintersect @ sK4 @ sK5)) @ sK6))),
% 0.24/0.41 inference(trivial_inequality_removal,[],[f80])).
% 0.24/0.41 thf(f80,plain,(
% 0.24/0.41 ($true = (in @ (sK2 @ sK6 @ (binintersect @ sK4 @ sK5)) @ sK6)) | ($true != $true)),
% 0.24/0.41 inference(superposition,[],[f77,f79])).
% 0.24/0.41 thf(f79,plain,(
% 0.24/0.41 ($true = (in @ (sK2 @ sK6 @ (binintersect @ sK4 @ sK5)) @ sK5))),
% 0.24/0.41 inference(trivial_inequality_removal,[],[f78])).
% 0.24/0.41 thf(f78,plain,(
% 0.24/0.41 ($true = (in @ (sK2 @ sK6 @ (binintersect @ sK4 @ sK5)) @ sK5)) | ($true != $true)),
% 0.24/0.41 inference(superposition,[],[f69,f73])).
% 0.24/0.41 thf(f73,plain,(
% 0.24/0.41 ($true = (in @ (sK2 @ sK6 @ (binintersect @ sK4 @ sK5)) @ (binintersect @ sK4 @ sK5)))),
% 0.24/0.41 inference(trivial_inequality_removal,[],[f72])).
% 0.24/0.41 thf(f72,plain,(
% 0.24/0.41 ($true != $true) | ($true = (in @ (sK2 @ sK6 @ (binintersect @ sK4 @ sK5)) @ (binintersect @ sK4 @ sK5)))),
% 0.24/0.41 inference(superposition,[],[f46,f70])).
% 0.24/0.41 thf(f70,plain,(
% 0.24/0.41 ( ! [X3 : $i,X4 : $i] : (($true = (subset @ X3 @ X4)) | ($true = (in @ (sK2 @ X4 @ X3) @ X3))) )),
% 0.24/0.41 inference(trivial_inequality_removal,[],[f60])).
% 0.24/0.41 thf(f60,plain,(
% 0.24/0.41 ( ! [X3 : $i,X4 : $i] : (($true != $true) | ($true = (subset @ X3 @ X4)) | ($true = (in @ (sK2 @ X4 @ X3) @ X3))) )),
% 0.24/0.41 inference(definition_unfolding,[],[f38,f49])).
% 0.24/0.41 thf(f49,plain,(
% 0.24/0.41 (subsetI1 = $true)),
% 0.24/0.41 inference(cnf_transformation,[],[f29])).
% 0.24/0.41 thf(f38,plain,(
% 0.24/0.41 ( ! [X3 : $i,X4 : $i] : (($true = (in @ (sK2 @ X4 @ X3) @ X3)) | ($true = (subset @ X3 @ X4)) | (subsetI1 != $true)) )),
% 0.24/0.41 inference(cnf_transformation,[],[f25])).
% 0.24/0.41 thf(f25,plain,(
% 0.24/0.41 ((subsetI1 = $true) | (! [X2] : (($true = (in @ X2 @ sK1)) | ($true != (in @ X2 @ sK0))) & ($true != (subset @ sK0 @ sK1)))) & (! [X3,X4] : ((($true != (in @ (sK2 @ X4 @ X3) @ X4)) & ($true = (in @ (sK2 @ X4 @ X3) @ X3))) | ($true = (subset @ X3 @ X4))) | (subsetI1 != $true))),
% 0.24/0.41 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f22,f24,f23])).
% 0.24/0.41 thf(f23,plain,(
% 0.24/0.41 ? [X0,X1] : (! [X2] : (((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) != $true)) & ((subset @ X0 @ X1) != $true)) => (! [X2] : (($true = (in @ X2 @ sK1)) | ($true != (in @ X2 @ sK0))) & ($true != (subset @ sK0 @ sK1)))),
% 0.24/0.41 introduced(choice_axiom,[])).
% 0.24/0.41 thf(f24,plain,(
% 0.24/0.41 ! [X3,X4] : (? [X5] : (($true != (in @ X5 @ X4)) & ((in @ X5 @ X3) = $true)) => (($true != (in @ (sK2 @ X4 @ X3) @ X4)) & ($true = (in @ (sK2 @ X4 @ X3) @ X3))))),
% 0.24/0.41 introduced(choice_axiom,[])).
% 0.24/0.41 thf(f22,plain,(
% 0.24/0.41 ((subsetI1 = $true) | ? [X0,X1] : (! [X2] : (((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) != $true)) & ((subset @ X0 @ X1) != $true))) & (! [X3,X4] : (? [X5] : (($true != (in @ X5 @ X4)) & ((in @ X5 @ X3) = $true)) | ($true = (subset @ X3 @ X4))) | (subsetI1 != $true))),
% 0.24/0.41 inference(rectify,[],[f21])).
% 0.24/0.41 thf(f21,plain,(
% 0.24/0.41 ((subsetI1 = $true) | ? [X0,X1] : (! [X2] : (((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) != $true)) & ((subset @ X0 @ X1) != $true))) & (! [X0,X1] : (? [X2] : (((in @ X2 @ X1) != $true) & ((in @ X2 @ X0) = $true)) | ((subset @ X0 @ X1) = $true)) | (subsetI1 != $true))),
% 0.24/0.41 inference(nnf_transformation,[],[f19])).
% 0.24/0.41 thf(f19,plain,(
% 0.24/0.41 (subsetI1 = $true) <=> ! [X0,X1] : (? [X2] : (((in @ X2 @ X1) != $true) & ((in @ X2 @ X0) = $true)) | ((subset @ X0 @ X1) = $true))),
% 0.24/0.41 inference(ennf_transformation,[],[f12])).
% 0.24/0.41 thf(f12,plain,(
% 0.24/0.41 (subsetI1 = $true) <=> ! [X1,X0] : (! [X2] : (((in @ X2 @ X0) = $true) => ((in @ X2 @ X1) = $true)) => ((subset @ X0 @ X1) = $true))),
% 0.24/0.41 inference(fool_elimination,[],[f11])).
% 0.24/0.41 thf(f11,plain,(
% 0.24/0.41 (subsetI1 = ! [X0,X1] : (! [X2] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (subset @ X0 @ X1)))),
% 0.24/0.41 inference(rectify,[],[f1])).
% 0.24/0.41 thf(f1,axiom,(
% 0.24/0.41 (subsetI1 = ! [X0,X1] : (! [X2] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (subset @ X0 @ X1)))),
% 0.24/0.41 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetI1)).
% 0.24/0.41 thf(f69,plain,(
% 0.24/0.41 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X3 @ (binintersect @ X5 @ X4)) != $true) | ($true = (in @ X3 @ X4))) )),
% 0.24/0.41 inference(trivial_inequality_removal,[],[f67])).
% 0.24/0.41 thf(f67,plain,(
% 0.24/0.41 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X3 @ (binintersect @ X5 @ X4)) != $true) | ($true = (in @ X3 @ X4)) | ($true != $true)) )),
% 0.24/0.41 inference(definition_unfolding,[],[f54,f43])).
% 0.24/0.41 thf(f43,plain,(
% 0.24/0.41 (binintersectER = $true)),
% 0.24/0.41 inference(cnf_transformation,[],[f29])).
% 0.24/0.41 thf(f54,plain,(
% 0.24/0.41 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X3 @ (binintersect @ X5 @ X4)) != $true) | ($true = (in @ X3 @ X4)) | (binintersectER != $true)) )),
% 0.24/0.41 inference(cnf_transformation,[],[f37])).
% 0.24/0.41 thf(f37,plain,(
% 0.24/0.41 ((binintersectER = $true) | (((in @ sK10 @ (binintersect @ sK12 @ sK11)) = $true) & ($true != (in @ sK10 @ sK11)))) & (! [X3,X4,X5] : (((in @ X3 @ (binintersect @ X5 @ X4)) != $true) | ($true = (in @ X3 @ X4))) | (binintersectER != $true))),
% 0.24/0.41 inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11,sK12])],[f35,f36])).
% 0.24/0.41 thf(f36,plain,(
% 0.24/0.41 ? [X0,X1,X2] : (($true = (in @ X0 @ (binintersect @ X2 @ X1))) & ($true != (in @ X0 @ X1))) => (((in @ sK10 @ (binintersect @ sK12 @ sK11)) = $true) & ($true != (in @ sK10 @ sK11)))),
% 0.24/0.41 introduced(choice_axiom,[])).
% 0.24/0.41 thf(f35,plain,(
% 0.24/0.41 ((binintersectER = $true) | ? [X0,X1,X2] : (($true = (in @ X0 @ (binintersect @ X2 @ X1))) & ($true != (in @ X0 @ X1)))) & (! [X3,X4,X5] : (((in @ X3 @ (binintersect @ X5 @ X4)) != $true) | ($true = (in @ X3 @ X4))) | (binintersectER != $true))),
% 0.24/0.41 inference(rectify,[],[f34])).
% 0.24/0.41 thf(f34,plain,(
% 0.24/0.41 ((binintersectER = $true) | ? [X1,X0,X2] : (($true = (in @ X1 @ (binintersect @ X2 @ X0))) & ($true != (in @ X1 @ X0)))) & (! [X1,X0,X2] : (($true != (in @ X1 @ (binintersect @ X2 @ X0))) | ($true = (in @ X1 @ X0))) | (binintersectER != $true))),
% 0.24/0.41 inference(nnf_transformation,[],[f20])).
% 0.24/0.41 thf(f20,plain,(
% 0.24/0.41 (binintersectER = $true) <=> ! [X1,X0,X2] : (($true != (in @ X1 @ (binintersect @ X2 @ X0))) | ($true = (in @ X1 @ X0)))),
% 0.24/0.41 inference(ennf_transformation,[],[f10])).
% 0.24/0.41 thf(f10,plain,(
% 0.24/0.41 ! [X0,X2,X1] : (($true = (in @ X1 @ (binintersect @ X2 @ X0))) => ($true = (in @ X1 @ X0))) <=> (binintersectER = $true)),
% 0.24/0.41 inference(fool_elimination,[],[f9])).
% 0.24/0.41 thf(f9,plain,(
% 0.24/0.41 (binintersectER = ! [X0,X1,X2] : ((in @ X1 @ (binintersect @ X2 @ X0)) => (in @ X1 @ X0)))),
% 0.24/0.41 inference(rectify,[],[f3])).
% 0.24/0.41 thf(f3,axiom,(
% 0.24/0.41 (binintersectER = ! [X1,X2,X0] : ((in @ X2 @ (binintersect @ X0 @ X1)) => (in @ X2 @ X1)))),
% 0.24/0.41 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectER)).
% 0.24/0.41 thf(f77,plain,(
% 0.24/0.41 ( ! [X0 : $i] : (($true != (in @ X0 @ sK5)) | ($true = (in @ X0 @ sK6))) )),
% 0.24/0.41 inference(trivial_inequality_removal,[],[f74])).
% 0.24/0.41 thf(f74,plain,(
% 0.24/0.41 ( ! [X0 : $i] : (($true != $true) | ($true != (in @ X0 @ sK5)) | ($true = (in @ X0 @ sK6))) )),
% 0.24/0.41 inference(superposition,[],[f68,f48])).
% 0.24/0.41 thf(f48,plain,(
% 0.24/0.41 ($true = (subset @ sK5 @ sK6))),
% 0.24/0.41 inference(cnf_transformation,[],[f29])).
% 0.24/0.41 thf(f68,plain,(
% 0.24/0.41 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (subset @ X3 @ X4)) | ((in @ X5 @ X3) != $true) | ($true = (in @ X5 @ X4))) )),
% 0.24/0.41 inference(trivial_inequality_removal,[],[f64])).
% 0.24/0.41 thf(f64,plain,(
% 0.24/0.41 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true = (in @ X5 @ X4)) | ((in @ X5 @ X3) != $true) | ($true != $true) | ($true != (subset @ X3 @ X4))) )),
% 0.24/0.41 inference(definition_unfolding,[],[f50,f42])).
% 0.24/0.41 thf(f42,plain,(
% 0.24/0.41 (subsetE = $true)),
% 0.24/0.41 inference(cnf_transformation,[],[f29])).
% 0.24/0.41 thf(f50,plain,(
% 0.24/0.41 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (subset @ X3 @ X4)) | ($true = (in @ X5 @ X4)) | ((in @ X5 @ X3) != $true) | (subsetE != $true)) )),
% 0.24/0.41 inference(cnf_transformation,[],[f33])).
% 0.24/0.41 thf(f33,plain,(
% 0.24/0.41 ((subsetE = $true) | (($true = (subset @ sK7 @ sK8)) & ($true != (in @ sK9 @ sK8)) & ((in @ sK9 @ sK7) = $true))) & (! [X3,X4,X5] : (($true != (subset @ X3 @ X4)) | ($true = (in @ X5 @ X4)) | ((in @ X5 @ X3) != $true)) | (subsetE != $true))),
% 0.24/0.41 inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9])],[f31,f32])).
% 0.24/0.41 thf(f32,plain,(
% 0.24/0.41 ? [X0,X1,X2] : (((subset @ X0 @ X1) = $true) & ((in @ X2 @ X1) != $true) & ((in @ X2 @ X0) = $true)) => (($true = (subset @ sK7 @ sK8)) & ($true != (in @ sK9 @ sK8)) & ((in @ sK9 @ sK7) = $true))),
% 0.24/0.41 introduced(choice_axiom,[])).
% 0.24/0.41 thf(f31,plain,(
% 0.24/0.41 ((subsetE = $true) | ? [X0,X1,X2] : (((subset @ X0 @ X1) = $true) & ((in @ X2 @ X1) != $true) & ((in @ X2 @ X0) = $true))) & (! [X3,X4,X5] : (($true != (subset @ X3 @ X4)) | ($true = (in @ X5 @ X4)) | ((in @ X5 @ X3) != $true)) | (subsetE != $true))),
% 0.24/0.41 inference(rectify,[],[f30])).
% 0.24/0.41 thf(f30,plain,(
% 0.24/0.41 ((subsetE = $true) | ? [X2,X0,X1] : (($true = (subset @ X2 @ X0)) & ($true != (in @ X1 @ X0)) & ($true = (in @ X1 @ X2)))) & (! [X2,X0,X1] : (($true != (subset @ X2 @ X0)) | ($true = (in @ X1 @ X0)) | ($true != (in @ X1 @ X2))) | (subsetE != $true))),
% 0.24/0.41 inference(nnf_transformation,[],[f18])).
% 0.24/0.41 thf(f18,plain,(
% 0.24/0.41 (subsetE = $true) <=> ! [X2,X0,X1] : (($true != (subset @ X2 @ X0)) | ($true = (in @ X1 @ X0)) | ($true != (in @ X1 @ X2)))),
% 0.24/0.41 inference(flattening,[],[f17])).
% 0.24/0.41 thf(f17,plain,(
% 0.24/0.41 (subsetE = $true) <=> ! [X0,X2,X1] : ((($true = (in @ X1 @ X0)) | ($true != (in @ X1 @ X2))) | ($true != (subset @ X2 @ X0)))),
% 0.24/0.41 inference(ennf_transformation,[],[f14])).
% 0.24/0.41 thf(f14,plain,(
% 0.24/0.41 (subsetE = $true) <=> ! [X0,X2,X1] : (($true = (subset @ X2 @ X0)) => (($true = (in @ X1 @ X2)) => ($true = (in @ X1 @ X0))))),
% 0.24/0.41 inference(fool_elimination,[],[f13])).
% 0.24/0.41 thf(f13,plain,(
% 0.24/0.41 (! [X0,X1,X2] : ((subset @ X2 @ X0) => ((in @ X1 @ X2) => (in @ X1 @ X0))) = subsetE)),
% 0.24/0.41 inference(rectify,[],[f2])).
% 0.24/0.41 thf(f2,axiom,(
% 0.24/0.41 (! [X1,X2,X0] : ((subset @ X0 @ X1) => ((in @ X2 @ X0) => (in @ X2 @ X1))) = subsetE)),
% 0.24/0.41 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetE)).
% 0.24/0.41 thf(f71,plain,(
% 0.24/0.41 ( ! [X3 : $i,X4 : $i] : (($true != (in @ (sK2 @ X4 @ X3) @ X4)) | ($true = (subset @ X3 @ X4))) )),
% 0.24/0.41 inference(trivial_inequality_removal,[],[f59])).
% 0.24/0.41 thf(f59,plain,(
% 0.24/0.41 ( ! [X3 : $i,X4 : $i] : (($true != $true) | ($true != (in @ (sK2 @ X4 @ X3) @ X4)) | ($true = (subset @ X3 @ X4))) )),
% 0.24/0.41 inference(definition_unfolding,[],[f39,f49])).
% 0.24/0.41 thf(f39,plain,(
% 0.24/0.41 ( ! [X3 : $i,X4 : $i] : (($true != (in @ (sK2 @ X4 @ X3) @ X4)) | ($true = (subset @ X3 @ X4)) | (subsetI1 != $true)) )),
% 0.24/0.41 inference(cnf_transformation,[],[f25])).
% 0.24/0.41 % SZS output end Proof for theBenchmark
% 0.24/0.41 % (26361)------------------------------
% 0.24/0.41 % (26361)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.41 % (26361)Termination reason: Refutation
% 0.24/0.41
% 0.24/0.41 % (26361)Memory used [KB]: 5500
% 0.24/0.41 % (26361)Time elapsed: 0.009 s
% 0.24/0.41 % (26361)Instructions burned: 6 (million)
% 0.24/0.41 % (26361)------------------------------
% 0.24/0.41 % (26361)------------------------------
% 0.24/0.41 % (26354)Success in time 0.022 s
% 0.24/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------