TSTP Solution File: SEU599^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU599^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 : n013.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:52 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SEU599^2 : TPTP v8.2.0. Released v3.7.0.
% 0.11/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.15/0.36 % Computer : n013.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 17:47:53 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TH0_THM_EQU_NAR problem
% 0.15/0.37 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.15/0.39 % (9056)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.39 % (9058)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.39 % (9057)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.39 % (9059)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.39 % (9055)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.39 % (9053)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.39 % (9056)Instruction limit reached!
% 0.15/0.39 % (9056)------------------------------
% 0.15/0.39 % (9056)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (9057)Instruction limit reached!
% 0.15/0.39 % (9057)------------------------------
% 0.15/0.39 % (9057)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (9057)Termination reason: Unknown
% 0.15/0.39 % (9057)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (9057)Memory used [KB]: 895
% 0.15/0.39 % (9057)Time elapsed: 0.004 s
% 0.15/0.39 % (9057)Instructions burned: 3 (million)
% 0.15/0.39 % (9057)------------------------------
% 0.15/0.39 % (9057)------------------------------
% 0.15/0.39 % (9056)Termination reason: Unknown
% 0.15/0.39 % (9056)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (9056)Memory used [KB]: 1023
% 0.15/0.39 % (9056)Time elapsed: 0.004 s
% 0.15/0.39 % (9056)Instructions burned: 3 (million)
% 0.15/0.39 % (9056)------------------------------
% 0.15/0.39 % (9056)------------------------------
% 0.15/0.39 % (9060)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.39 % (9060)Instruction limit reached!
% 0.15/0.39 % (9060)------------------------------
% 0.15/0.39 % (9060)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (9060)Termination reason: Unknown
% 0.15/0.39 % (9060)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (9060)Memory used [KB]: 5500
% 0.15/0.39 % (9060)Time elapsed: 0.004 s
% 0.15/0.39 % (9060)Instructions burned: 3 (million)
% 0.15/0.39 % (9060)------------------------------
% 0.15/0.39 % (9060)------------------------------
% 0.15/0.39 % (9059)First to succeed.
% 0.15/0.39 % (9058)Also succeeded, but the first one will report.
% 0.15/0.39 % (9059)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% 0.15/0.39 thf(func_def_0, type, in: $i > $i > $o).
% 0.15/0.39 thf(func_def_3, type, subset: $i > $i > $o).
% 0.15/0.39 thf(func_def_5, type, binintersect: $i > $i > $i).
% 0.15/0.39 thf(func_def_15, type, sK6: $i > $i > $i).
% 0.15/0.39 thf(f76,plain,(
% 0.15/0.39 $false),
% 0.15/0.39 inference(subsumption_resolution,[],[f75,f46])).
% 0.15/0.39 thf(f46,plain,(
% 0.15/0.39 ($true != (subset @ sK8 @ sK7))),
% 0.15/0.39 inference(cnf_transformation,[],[f32])).
% 0.15/0.39 thf(f32,plain,(
% 0.15/0.39 (binintersectER = $true) & (subsetI1 = $true) & (((binintersect @ sK8 @ sK7) = sK8) & ($true != (subset @ sK8 @ sK7))) & (in__Cong = $true)),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8])],[f30,f31])).
% 0.15/0.39 thf(f31,plain,(
% 0.15/0.39 ? [X0,X1] : (((binintersect @ X1 @ X0) = X1) & ((subset @ X1 @ X0) != $true)) => (((binintersect @ sK8 @ sK7) = sK8) & ($true != (subset @ sK8 @ sK7)))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f30,plain,(
% 0.15/0.39 (binintersectER = $true) & (subsetI1 = $true) & ? [X0,X1] : (((binintersect @ X1 @ X0) = X1) & ((subset @ X1 @ X0) != $true)) & (in__Cong = $true)),
% 0.15/0.39 inference(rectify,[],[f19])).
% 0.15/0.39 thf(f19,plain,(
% 0.15/0.39 (binintersectER = $true) & (subsetI1 = $true) & ? [X1,X0] : (((binintersect @ X0 @ X1) = X0) & ((subset @ X0 @ X1) != $true)) & (in__Cong = $true)),
% 0.15/0.39 inference(flattening,[],[f18])).
% 0.15/0.39 thf(f18,plain,(
% 0.15/0.39 ((? [X1,X0] : (((binintersect @ X0 @ X1) = X0) & ((subset @ X0 @ X1) != $true)) & (binintersectER = $true)) & (subsetI1 = $true)) & (in__Cong = $true)),
% 0.15/0.39 inference(ennf_transformation,[],[f10])).
% 0.15/0.39 thf(f10,plain,(
% 0.15/0.39 ~((in__Cong = $true) => ((subsetI1 = $true) => ((binintersectER = $true) => ! [X1,X0] : (((binintersect @ X0 @ X1) = X0) => ((subset @ X0 @ X1) = $true)))))),
% 0.15/0.39 inference(fool_elimination,[],[f9])).
% 0.15/0.39 thf(f9,plain,(
% 0.15/0.39 ~(in__Cong => (subsetI1 => (binintersectER => ! [X0,X1] : (((binintersect @ X0 @ X1) = X0) => (subset @ X0 @ X1)))))),
% 0.15/0.39 inference(rectify,[],[f5])).
% 0.15/0.39 thf(f5,negated_conjecture,(
% 0.15/0.39 ~(in__Cong => (subsetI1 => (binintersectER => ! [X0,X1] : (((binintersect @ X0 @ X1) = X0) => (subset @ X0 @ X1)))))),
% 0.15/0.39 inference(negated_conjecture,[],[f4])).
% 0.15/0.39 thf(f4,conjecture,(
% 0.15/0.39 in__Cong => (subsetI1 => (binintersectER => ! [X0,X1] : (((binintersect @ X0 @ X1) = X0) => (subset @ X0 @ X1))))),
% 0.15/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectSubset1)).
% 0.15/0.39 thf(f75,plain,(
% 0.15/0.39 ($true = (subset @ sK8 @ sK7))),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f74])).
% 0.15/0.39 thf(f74,plain,(
% 0.15/0.39 ($true = (subset @ sK8 @ sK7)) | ($true != $true)),
% 0.15/0.39 inference(superposition,[],[f67,f73])).
% 0.15/0.39 thf(f73,plain,(
% 0.15/0.39 ($true = (in @ (sK6 @ sK7 @ sK8) @ sK7))),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f72])).
% 0.15/0.39 thf(f72,plain,(
% 0.15/0.39 ($true != $true) | ($true = (in @ (sK6 @ sK7 @ sK8) @ sK7))),
% 0.15/0.39 inference(superposition,[],[f71,f70])).
% 0.15/0.39 thf(f70,plain,(
% 0.15/0.39 ($true = (in @ (sK6 @ sK7 @ sK8) @ sK8))),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f69])).
% 0.15/0.39 thf(f69,plain,(
% 0.15/0.39 ($true != $true) | ($true = (in @ (sK6 @ sK7 @ sK8) @ sK8))),
% 0.15/0.39 inference(superposition,[],[f46,f66])).
% 0.15/0.39 thf(f66,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (((subset @ X3 @ X4) = $true) | ($true = (in @ (sK6 @ X4 @ X3) @ X3))) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f59])).
% 0.15/0.39 thf(f59,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (($true = (in @ (sK6 @ X4 @ X3) @ X3)) | ($true != $true) | ((subset @ X3 @ X4) = $true)) )),
% 0.15/0.39 inference(definition_unfolding,[],[f42,f48])).
% 0.15/0.39 thf(f48,plain,(
% 0.15/0.39 (subsetI1 = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f32])).
% 0.15/0.39 thf(f42,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (((subset @ X3 @ X4) = $true) | ($true = (in @ (sK6 @ X4 @ X3) @ X3)) | (subsetI1 != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f29])).
% 0.15/0.39 thf(f29,plain,(
% 0.15/0.39 ((subsetI1 = $true) | (((subset @ sK4 @ sK5) != $true) & ! [X2] : (($true != (in @ X2 @ sK4)) | ($true = (in @ X2 @ sK5))))) & (! [X3,X4] : (((subset @ X3 @ X4) = $true) | (($true = (in @ (sK6 @ X4 @ X3) @ X3)) & ((in @ (sK6 @ X4 @ X3) @ X4) != $true))) | (subsetI1 != $true))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f26,f28,f27])).
% 0.15/0.39 thf(f27,plain,(
% 0.15/0.39 ? [X0,X1] : (((subset @ X0 @ X1) != $true) & ! [X2] : (((in @ X2 @ X0) != $true) | ((in @ X2 @ X1) = $true))) => (((subset @ sK4 @ sK5) != $true) & ! [X2] : (($true != (in @ X2 @ sK4)) | ($true = (in @ X2 @ sK5))))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f28,plain,(
% 0.15/0.39 ! [X3,X4] : (? [X5] : (((in @ X5 @ X3) = $true) & ((in @ X5 @ X4) != $true)) => (($true = (in @ (sK6 @ X4 @ X3) @ X3)) & ((in @ (sK6 @ X4 @ X3) @ X4) != $true)))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f26,plain,(
% 0.15/0.39 ((subsetI1 = $true) | ? [X0,X1] : (((subset @ X0 @ X1) != $true) & ! [X2] : (((in @ X2 @ X0) != $true) | ((in @ X2 @ X1) = $true)))) & (! [X3,X4] : (((subset @ X3 @ X4) = $true) | ? [X5] : (((in @ X5 @ X3) = $true) & ((in @ X5 @ X4) != $true))) | (subsetI1 != $true))),
% 0.15/0.39 inference(rectify,[],[f25])).
% 0.15/0.39 thf(f25,plain,(
% 0.15/0.39 ((subsetI1 = $true) | ? [X1,X0] : (((subset @ X1 @ X0) != $true) & ! [X2] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true)))) & (! [X1,X0] : (((subset @ X1 @ X0) = $true) | ? [X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true))) | (subsetI1 != $true))),
% 0.15/0.39 inference(nnf_transformation,[],[f15])).
% 0.15/0.39 thf(f15,plain,(
% 0.15/0.39 (subsetI1 = $true) <=> ! [X1,X0] : (((subset @ X1 @ X0) = $true) | ? [X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)))),
% 0.15/0.39 inference(ennf_transformation,[],[f8])).
% 0.15/0.39 thf(f8,plain,(
% 0.15/0.39 ! [X0,X1] : (! [X2] : (((in @ X2 @ X1) = $true) => ((in @ X2 @ X0) = $true)) => ((subset @ X1 @ X0) = $true)) <=> (subsetI1 = $true)),
% 0.15/0.39 inference(fool_elimination,[],[f7])).
% 0.15/0.39 thf(f7,plain,(
% 0.15/0.39 (subsetI1 = ! [X0,X1] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (subset @ X1 @ X0)))),
% 0.15/0.39 inference(rectify,[],[f2])).
% 0.15/0.39 thf(f2,axiom,(
% 0.15/0.39 (subsetI1 = ! [X1,X0] : (! [X2] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (subset @ X0 @ X1)))),
% 0.15/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetI1)).
% 0.15/0.39 thf(f71,plain,(
% 0.15/0.39 ( ! [X0 : $i] : (((in @ X0 @ sK8) != $true) | ((in @ X0 @ sK7) = $true)) )),
% 0.15/0.39 inference(superposition,[],[f68,f47])).
% 0.15/0.39 thf(f47,plain,(
% 0.15/0.39 ((binintersect @ sK8 @ sK7) = sK8)),
% 0.15/0.39 inference(cnf_transformation,[],[f32])).
% 0.15/0.39 thf(f68,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X3 @ (binintersect @ X4 @ X5)) != $true) | ($true = (in @ X3 @ X5))) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f63])).
% 0.15/0.39 thf(f63,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true = (in @ X3 @ X5)) | ((in @ X3 @ (binintersect @ X4 @ X5)) != $true) | ($true != $true)) )),
% 0.15/0.39 inference(definition_unfolding,[],[f50,f49])).
% 0.15/0.39 thf(f49,plain,(
% 0.15/0.39 (binintersectER = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f32])).
% 0.15/0.39 thf(f50,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true = (in @ X3 @ X5)) | ((in @ X3 @ (binintersect @ X4 @ X5)) != $true) | (binintersectER != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f36])).
% 0.15/0.39 thf(f36,plain,(
% 0.15/0.39 ((binintersectER = $true) | (($true != (in @ sK9 @ sK11)) & ($true = (in @ sK9 @ (binintersect @ sK10 @ sK11))))) & (! [X3,X4,X5] : (($true = (in @ X3 @ X5)) | ((in @ X3 @ (binintersect @ X4 @ X5)) != $true)) | (binintersectER != $true))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11])],[f34,f35])).
% 0.15/0.39 thf(f35,plain,(
% 0.15/0.39 ? [X0,X1,X2] : (($true != (in @ X0 @ X2)) & ((in @ X0 @ (binintersect @ X1 @ X2)) = $true)) => (($true != (in @ sK9 @ sK11)) & ($true = (in @ sK9 @ (binintersect @ sK10 @ sK11))))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f34,plain,(
% 0.15/0.39 ((binintersectER = $true) | ? [X0,X1,X2] : (($true != (in @ X0 @ X2)) & ((in @ X0 @ (binintersect @ X1 @ X2)) = $true))) & (! [X3,X4,X5] : (($true = (in @ X3 @ X5)) | ((in @ X3 @ (binintersect @ X4 @ X5)) != $true)) | (binintersectER != $true))),
% 0.15/0.39 inference(rectify,[],[f33])).
% 0.15/0.39 thf(f33,plain,(
% 0.15/0.39 ((binintersectER = $true) | ? [X0,X2,X1] : (($true != (in @ X0 @ X1)) & ((in @ X0 @ (binintersect @ X2 @ X1)) = $true))) & (! [X0,X2,X1] : (($true = (in @ X0 @ X1)) | ((in @ X0 @ (binintersect @ X2 @ X1)) != $true)) | (binintersectER != $true))),
% 0.15/0.39 inference(nnf_transformation,[],[f17])).
% 0.15/0.39 thf(f17,plain,(
% 0.15/0.39 (binintersectER = $true) <=> ! [X0,X2,X1] : (($true = (in @ X0 @ X1)) | ((in @ X0 @ (binintersect @ X2 @ X1)) != $true))),
% 0.15/0.39 inference(ennf_transformation,[],[f12])).
% 0.15/0.39 thf(f12,plain,(
% 0.15/0.39 ! [X0,X1,X2] : (((in @ X0 @ (binintersect @ X2 @ X1)) = $true) => ($true = (in @ X0 @ X1))) <=> (binintersectER = $true)),
% 0.15/0.39 inference(fool_elimination,[],[f11])).
% 0.15/0.39 thf(f11,plain,(
% 0.15/0.39 (binintersectER = ! [X0,X1,X2] : ((in @ X0 @ (binintersect @ X2 @ X1)) => (in @ X0 @ X1)))),
% 0.15/0.39 inference(rectify,[],[f3])).
% 0.15/0.39 thf(f3,axiom,(
% 0.15/0.39 (binintersectER = ! [X2,X1,X0] : ((in @ X2 @ (binintersect @ X0 @ X1)) => (in @ X2 @ X1)))),
% 0.15/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectER)).
% 0.15/0.39 thf(f67,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (((in @ (sK6 @ X4 @ X3) @ X4) != $true) | ((subset @ X3 @ X4) = $true)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f60])).
% 0.15/0.39 thf(f60,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (((in @ (sK6 @ X4 @ X3) @ X4) != $true) | ((subset @ X3 @ X4) = $true) | ($true != $true)) )),
% 0.15/0.39 inference(definition_unfolding,[],[f41,f48])).
% 0.15/0.39 thf(f41,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (((subset @ X3 @ X4) = $true) | ((in @ (sK6 @ X4 @ X3) @ X4) != $true) | (subsetI1 != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f29])).
% 0.15/0.39 % SZS output end Proof for theBenchmark
% 0.15/0.39 % (9059)------------------------------
% 0.15/0.39 % (9059)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (9059)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (9059)Memory used [KB]: 5500
% 0.15/0.39 % (9059)Time elapsed: 0.007 s
% 0.15/0.39 % (9059)Instructions burned: 4 (million)
% 0.15/0.39 % (9059)------------------------------
% 0.15/0.39 % (9059)------------------------------
% 0.15/0.39 % (9052)Success in time 0.009 s
% 0.15/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------