TSTP Solution File: SEU594^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU594^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 : n019.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:50 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.07/0.13 % Problem : SEU594^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.15 % 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.37 % Computer : n019.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sun May 19 16:08: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/sandbox2/benchmark/theBenchmark.p
% 0.15/0.39 % (25587)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.39 % (25584)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.39 % (25586)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 (3000ds/275Mi)
% 0.15/0.39 % (25585)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 (3000ds/2Mi)
% 0.15/0.39 % (25584)Instruction limit reached!
% 0.15/0.39 % (25584)------------------------------
% 0.15/0.39 % (25584)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (25584)Termination reason: Unknown
% 0.15/0.39 % (25584)Termination phase: Function definition elimination
% 0.15/0.39
% 0.15/0.39 % (25588)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.15/0.39 % (25584)Memory used [KB]: 1023
% 0.15/0.39 % (25584)Time elapsed: 0.003 s
% 0.15/0.39 % (25584)Instructions burned: 3 (million)
% 0.15/0.39 % (25584)------------------------------
% 0.15/0.39 % (25584)------------------------------
% 0.15/0.39 % (25585)Instruction limit reached!
% 0.15/0.39 % (25585)------------------------------
% 0.15/0.39 % (25585)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (25585)Termination reason: Unknown
% 0.15/0.39 % (25585)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (25585)Memory used [KB]: 895
% 0.15/0.39 % (25585)Time elapsed: 0.003 s
% 0.15/0.39 % (25585)Instructions burned: 3 (million)
% 0.15/0.39 % (25585)------------------------------
% 0.15/0.39 % (25585)------------------------------
% 0.15/0.39 % (25588)Instruction limit reached!
% 0.15/0.39 % (25588)------------------------------
% 0.15/0.39 % (25588)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (25588)Termination reason: Unknown
% 0.15/0.39 % (25588)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (25588)Memory used [KB]: 5500
% 0.15/0.39 % (25588)Time elapsed: 0.003 s
% 0.15/0.39 % (25588)Instructions burned: 3 (million)
% 0.15/0.39 % (25588)------------------------------
% 0.15/0.39 % (25588)------------------------------
% 0.15/0.39 % (25586)First to succeed.
% 0.15/0.39 % (25587)Also succeeded, but the first one will report.
% 0.15/0.39 % (25586)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_1, type, dsetconstr: $i > ($i > $o) > $i).
% 0.15/0.39 thf(func_def_4, type, subset: $i > $i > $o).
% 0.15/0.39 thf(func_def_6, type, binintersect: $i > $i > $i).
% 0.15/0.39 thf(func_def_18, type, sK5: $i > $i > $i).
% 0.15/0.39 thf(f85,plain,(
% 0.15/0.39 $false),
% 0.15/0.39 inference(subsumption_resolution,[],[f84,f44])).
% 0.15/0.39 thf(f44,plain,(
% 0.15/0.39 ((subset @ sK3 @ sK4) != $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f27])).
% 0.15/0.39 thf(f27,plain,(
% 0.15/0.39 (((binintersect @ sK4 @ sK3) = sK3) & ((subset @ sK3 @ sK4) != $true)) & (subsetI1 = $true) & (binintersectEL = $true) & (in__Cong = $true)),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f19,f26])).
% 0.15/0.39 thf(f26,plain,(
% 0.15/0.39 ? [X0,X1] : (((binintersect @ X1 @ X0) = X0) & ((subset @ X0 @ X1) != $true)) => (((binintersect @ sK4 @ sK3) = sK3) & ((subset @ sK3 @ sK4) != $true))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f19,plain,(
% 0.15/0.39 ? [X0,X1] : (((binintersect @ X1 @ X0) = X0) & ((subset @ X0 @ X1) != $true)) & (subsetI1 = $true) & (binintersectEL = $true) & (in__Cong = $true)),
% 0.15/0.39 inference(flattening,[],[f18])).
% 0.15/0.39 thf(f18,plain,(
% 0.15/0.39 ((? [X0,X1] : (((binintersect @ X1 @ X0) = X0) & ((subset @ X0 @ X1) != $true)) & (binintersectEL = $true)) & (subsetI1 = $true)) & (in__Cong = $true)),
% 0.15/0.39 inference(ennf_transformation,[],[f9])).
% 0.15/0.39 thf(f9,plain,(
% 0.15/0.39 ~((in__Cong = $true) => ((subsetI1 = $true) => ((binintersectEL = $true) => ! [X0,X1] : (((binintersect @ X1 @ X0) = X0) => ((subset @ X0 @ X1) = $true)))))),
% 0.15/0.39 inference(fool_elimination,[],[f8])).
% 0.15/0.39 thf(f8,plain,(
% 0.15/0.39 ~(in__Cong => (subsetI1 => (binintersectEL => ! [X0,X1] : (((binintersect @ X1 @ X0) = X0) => (subset @ X0 @ X1)))))),
% 0.15/0.39 inference(rectify,[],[f6])).
% 0.15/0.39 thf(f6,negated_conjecture,(
% 0.15/0.39 ~(in__Cong => (subsetI1 => (binintersectEL => ! [X1,X0] : (((binintersect @ X0 @ X1) = X1) => (subset @ X1 @ X0)))))),
% 0.15/0.39 inference(negated_conjecture,[],[f5])).
% 0.15/0.39 thf(f5,conjecture,(
% 0.15/0.39 in__Cong => (subsetI1 => (binintersectEL => ! [X1,X0] : (((binintersect @ X0 @ X1) = X1) => (subset @ X1 @ X0))))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectSubset3)).
% 0.15/0.39 thf(f84,plain,(
% 0.15/0.39 ((subset @ sK3 @ sK4) = $true)),
% 0.15/0.39 inference(superposition,[],[f82,f45])).
% 0.15/0.39 thf(f45,plain,(
% 0.15/0.39 ((binintersect @ sK4 @ sK3) = sK3)),
% 0.15/0.39 inference(cnf_transformation,[],[f27])).
% 0.15/0.39 thf(f82,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (((subset @ (binintersect @ X0 @ X1) @ X0) = $true)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f81])).
% 0.15/0.39 thf(f81,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (($true != $true) | ((subset @ (binintersect @ X0 @ X1) @ X0) = $true)) )),
% 0.15/0.39 inference(duplicate_literal_removal,[],[f79])).
% 0.15/0.39 thf(f79,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (((subset @ (binintersect @ X0 @ X1) @ X0) = $true) | ((subset @ (binintersect @ X0 @ X1) @ X0) = $true) | ($true != $true)) )),
% 0.15/0.39 inference(superposition,[],[f68,f75])).
% 0.15/0.39 thf(f75,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (in @ (sK5 @ (binintersect @ X0 @ X1) @ X2) @ X0)) | ($true = (subset @ (binintersect @ X0 @ X1) @ X2))) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f74])).
% 0.15/0.39 thf(f74,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (subset @ (binintersect @ X0 @ X1) @ X2)) | ($true = (in @ (sK5 @ (binintersect @ X0 @ X1) @ X2) @ X0)) | ($true != $true)) )),
% 0.15/0.39 inference(superposition,[],[f69,f67])).
% 0.15/0.39 thf(f67,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (($true = (in @ (sK5 @ X1 @ X0) @ X1)) | ((subset @ X1 @ X0) = $true)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f58])).
% 0.15/0.39 thf(f58,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (($true != $true) | ((subset @ X1 @ X0) = $true) | ($true = (in @ (sK5 @ X1 @ X0) @ X1))) )),
% 0.15/0.39 inference(definition_unfolding,[],[f48,f43])).
% 0.15/0.39 thf(f43,plain,(
% 0.15/0.39 (subsetI1 = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f27])).
% 0.15/0.39 thf(f48,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (($true = (in @ (sK5 @ X1 @ X0) @ X1)) | ((subset @ X1 @ X0) = $true) | (subsetI1 != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f32])).
% 0.15/0.39 thf(f32,plain,(
% 0.15/0.39 (! [X0,X1] : ((((in @ (sK5 @ X1 @ X0) @ X0) != $true) & ($true = (in @ (sK5 @ X1 @ X0) @ X1))) | ((subset @ X1 @ X0) = $true)) | (subsetI1 != $true)) & ((subsetI1 = $true) | (! [X5] : (((in @ X5 @ sK6) = $true) | ($true != (in @ X5 @ sK7))) & ($true != (subset @ sK7 @ sK6))))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f29,f31,f30])).
% 0.15/0.39 thf(f30,plain,(
% 0.15/0.39 ! [X0,X1] : (? [X2] : (((in @ X2 @ X0) != $true) & ((in @ X2 @ X1) = $true)) => (((in @ (sK5 @ X1 @ X0) @ X0) != $true) & ($true = (in @ (sK5 @ X1 @ X0) @ X1))))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f31,plain,(
% 0.15/0.39 ? [X3,X4] : (! [X5] : (($true = (in @ X5 @ X3)) | ($true != (in @ X5 @ X4))) & ($true != (subset @ X4 @ X3))) => (! [X5] : (((in @ X5 @ sK6) = $true) | ($true != (in @ X5 @ sK7))) & ($true != (subset @ sK7 @ sK6)))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f29,plain,(
% 0.15/0.39 (! [X0,X1] : (? [X2] : (((in @ X2 @ X0) != $true) & ((in @ X2 @ X1) = $true)) | ((subset @ X1 @ X0) = $true)) | (subsetI1 != $true)) & ((subsetI1 = $true) | ? [X3,X4] : (! [X5] : (($true = (in @ X5 @ X3)) | ($true != (in @ X5 @ X4))) & ($true != (subset @ X4 @ X3))))),
% 0.15/0.39 inference(rectify,[],[f28])).
% 0.15/0.39 thf(f28,plain,(
% 0.15/0.39 (! [X0,X1] : (? [X2] : (((in @ X2 @ X0) != $true) & ((in @ X2 @ X1) = $true)) | ((subset @ X1 @ X0) = $true)) | (subsetI1 != $true)) & ((subsetI1 = $true) | ? [X0,X1] : (! [X2] : (((in @ X2 @ X0) = $true) | ((in @ X2 @ X1) != $true)) & ((subset @ X1 @ X0) != $true)))),
% 0.15/0.39 inference(nnf_transformation,[],[f21])).
% 0.15/0.39 thf(f21,plain,(
% 0.15/0.39 ! [X0,X1] : (? [X2] : (((in @ X2 @ X0) != $true) & ((in @ X2 @ X1) = $true)) | ((subset @ X1 @ X0) = $true)) <=> (subsetI1 = $true)),
% 0.15/0.39 inference(ennf_transformation,[],[f11])).
% 0.15/0.39 thf(f11,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,[],[f10])).
% 0.15/0.39 thf(f10,plain,(
% 0.15/0.39 (! [X0,X1] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (subset @ X1 @ X0)) = subsetI1)),
% 0.15/0.39 inference(rectify,[],[f2])).
% 0.15/0.39 thf(f2,axiom,(
% 0.15/0.39 (! [X1,X0] : (! [X2] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (subset @ X0 @ X1)) = subsetI1)),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetI1)).
% 0.15/0.39 thf(f69,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (in @ X4 @ (binintersect @ X5 @ X3))) | ((in @ X4 @ X5) = $true)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f56])).
% 0.15/0.39 thf(f56,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != $true) | ((in @ X4 @ X5) = $true) | ($true != (in @ X4 @ (binintersect @ X5 @ X3)))) )),
% 0.15/0.39 inference(definition_unfolding,[],[f38,f42])).
% 0.15/0.39 thf(f42,plain,(
% 0.15/0.39 (binintersectEL = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f27])).
% 0.15/0.39 thf(f38,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (in @ X4 @ (binintersect @ X5 @ X3))) | ((in @ X4 @ X5) = $true) | (binintersectEL != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f25])).
% 0.15/0.39 thf(f25,plain,(
% 0.15/0.39 ((binintersectEL = $true) | (($true = (in @ sK1 @ (binintersect @ sK2 @ sK0))) & ((in @ sK1 @ sK2) != $true))) & (! [X3,X4,X5] : (($true != (in @ X4 @ (binintersect @ X5 @ X3))) | ((in @ X4 @ X5) = $true)) | (binintersectEL != $true))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f23,f24])).
% 0.15/0.39 thf(f24,plain,(
% 0.15/0.39 ? [X0,X1,X2] : (((in @ X1 @ (binintersect @ X2 @ X0)) = $true) & ($true != (in @ X1 @ X2))) => (($true = (in @ sK1 @ (binintersect @ sK2 @ sK0))) & ((in @ sK1 @ sK2) != $true))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f23,plain,(
% 0.15/0.39 ((binintersectEL = $true) | ? [X0,X1,X2] : (((in @ X1 @ (binintersect @ X2 @ X0)) = $true) & ($true != (in @ X1 @ X2)))) & (! [X3,X4,X5] : (($true != (in @ X4 @ (binintersect @ X5 @ X3))) | ((in @ X4 @ X5) = $true)) | (binintersectEL != $true))),
% 0.15/0.39 inference(rectify,[],[f22])).
% 0.15/0.39 thf(f22,plain,(
% 0.15/0.39 ((binintersectEL = $true) | ? [X0,X1,X2] : (((in @ X1 @ (binintersect @ X2 @ X0)) = $true) & ($true != (in @ X1 @ X2)))) & (! [X0,X1,X2] : (((in @ X1 @ (binintersect @ X2 @ X0)) != $true) | ($true = (in @ X1 @ X2))) | (binintersectEL != $true))),
% 0.15/0.39 inference(nnf_transformation,[],[f20])).
% 0.15/0.39 thf(f20,plain,(
% 0.15/0.39 (binintersectEL = $true) <=> ! [X0,X1,X2] : (((in @ X1 @ (binintersect @ X2 @ X0)) != $true) | ($true = (in @ X1 @ X2)))),
% 0.15/0.39 inference(ennf_transformation,[],[f13])).
% 0.15/0.39 thf(f13,plain,(
% 0.15/0.39 ! [X0,X1,X2] : (((in @ X1 @ (binintersect @ X2 @ X0)) = $true) => ($true = (in @ X1 @ X2))) <=> (binintersectEL = $true)),
% 0.15/0.39 inference(fool_elimination,[],[f12])).
% 0.15/0.39 thf(f12,plain,(
% 0.15/0.39 (! [X0,X1,X2] : ((in @ X1 @ (binintersect @ X2 @ X0)) => (in @ X1 @ X2)) = binintersectEL)),
% 0.15/0.39 inference(rectify,[],[f4])).
% 0.15/0.39 thf(f4,axiom,(
% 0.15/0.39 (! [X1,X2,X0] : ((in @ X2 @ (binintersect @ X0 @ X1)) => (in @ X2 @ X0)) = binintersectEL)),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectEL)).
% 0.15/0.39 thf(f68,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (((in @ (sK5 @ X1 @ X0) @ X0) != $true) | ((subset @ X1 @ X0) = $true)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f57])).
% 0.15/0.39 thf(f57,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (((subset @ X1 @ X0) = $true) | ($true != $true) | ((in @ (sK5 @ X1 @ X0) @ X0) != $true)) )),
% 0.15/0.39 inference(definition_unfolding,[],[f49,f43])).
% 0.15/0.39 thf(f49,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (((in @ (sK5 @ X1 @ X0) @ X0) != $true) | ((subset @ X1 @ X0) = $true) | (subsetI1 != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f32])).
% 0.15/0.39 % SZS output end Proof for theBenchmark
% 0.15/0.39 % (25586)------------------------------
% 0.15/0.39 % (25586)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (25586)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (25586)Memory used [KB]: 5500
% 0.15/0.39 % (25586)Time elapsed: 0.006 s
% 0.15/0.39 % (25586)Instructions burned: 5 (million)
% 0.15/0.39 % (25586)------------------------------
% 0.15/0.39 % (25586)------------------------------
% 0.15/0.39 % (25580)Success in time 0.016 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------