TSTP Solution File: SEU758^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU758^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 : n002.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:18 EDT 2024
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU758^2 : TPTP v8.2.0. Released v3.7.0.
% 0.06/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 : n002.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 17:40:23 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 % (10684)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 % (10684)Instruction limit reached!
% 0.14/0.37 % (10684)------------------------------
% 0.14/0.37 % (10684)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (10684)Termination reason: Unknown
% 0.14/0.37 % (10684)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (10684)Memory used [KB]: 5500
% 0.14/0.37 % (10684)Time elapsed: 0.003 s
% 0.14/0.37 % (10684)Instructions burned: 3 (million)
% 0.14/0.37 % (10684)------------------------------
% 0.14/0.37 % (10684)------------------------------
% 0.14/0.37 % (10677)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 % (10678)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 % (10683)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 % (10679)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 % (10678)Instruction limit reached!
% 0.14/0.37 % (10678)------------------------------
% 0.14/0.37 % (10678)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (10678)Termination reason: Unknown
% 0.14/0.37 % (10678)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (10678)Memory used [KB]: 5500
% 0.14/0.37 % (10678)Time elapsed: 0.005 s
% 0.14/0.37 % (10678)Instructions burned: 4 (million)
% 0.14/0.37 % (10678)------------------------------
% 0.14/0.37 % (10678)------------------------------
% 0.14/0.37 % (10683)First to succeed.
% 0.20/0.37 % (10677)Also succeeded, but the first one will report.
% 0.20/0.38 % (10679)Also succeeded, but the first one will report.
% 0.20/0.38 % (10683)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for theBenchmark
% 0.20/0.38 % SZS output start Proof for theBenchmark
% 0.20/0.38 thf(func_def_0, type, in: $i > $i > $o).
% 0.20/0.38 thf(func_def_1, type, powerset: $i > $i).
% 0.20/0.38 thf(func_def_4, type, binintersect: $i > $i > $i).
% 0.20/0.38 thf(f60,plain,(
% 0.20/0.38 $false),
% 0.20/0.38 inference(subsumption_resolution,[],[f59,f33])).
% 0.20/0.38 thf(f33,plain,(
% 0.20/0.38 ((in @ sK6 @ sK4) != $true)),
% 0.20/0.38 inference(cnf_transformation,[],[f25])).
% 0.20/0.38 thf(f25,plain,(
% 0.20/0.38 (binintersectEL = $true) & (powersetE = $true) & (((in @ sK3 @ (powerset @ sK4)) = $true) & (($true = (in @ sK5 @ (powerset @ sK4))) & (((in @ sK6 @ (binintersect @ sK3 @ sK5)) = $true) & ((in @ sK6 @ sK4) != $true))))),
% 0.20/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f21,f24,f23,f22])).
% 0.20/0.38 thf(f22,plain,(
% 0.20/0.38 ? [X0,X1] : (($true = (in @ X0 @ (powerset @ X1))) & ? [X2] : (($true = (in @ X2 @ (powerset @ X1))) & ? [X3] : (((in @ X3 @ (binintersect @ X0 @ X2)) = $true) & ((in @ X3 @ X1) != $true)))) => (((in @ sK3 @ (powerset @ sK4)) = $true) & ? [X2] : (((in @ X2 @ (powerset @ sK4)) = $true) & ? [X3] : (((in @ X3 @ (binintersect @ sK3 @ X2)) = $true) & ((in @ X3 @ sK4) != $true))))),
% 0.20/0.38 introduced(choice_axiom,[])).
% 0.20/0.38 thf(f23,plain,(
% 0.20/0.38 ? [X2] : (((in @ X2 @ (powerset @ sK4)) = $true) & ? [X3] : (((in @ X3 @ (binintersect @ sK3 @ X2)) = $true) & ((in @ X3 @ sK4) != $true))) => (($true = (in @ sK5 @ (powerset @ sK4))) & ? [X3] : (($true = (in @ X3 @ (binintersect @ sK3 @ sK5))) & ((in @ X3 @ sK4) != $true)))),
% 0.20/0.38 introduced(choice_axiom,[])).
% 0.20/0.38 thf(f24,plain,(
% 0.20/0.38 ? [X3] : (($true = (in @ X3 @ (binintersect @ sK3 @ sK5))) & ((in @ X3 @ sK4) != $true)) => (((in @ sK6 @ (binintersect @ sK3 @ sK5)) = $true) & ((in @ sK6 @ sK4) != $true))),
% 0.20/0.38 introduced(choice_axiom,[])).
% 0.20/0.38 thf(f21,plain,(
% 0.20/0.38 (binintersectEL = $true) & (powersetE = $true) & ? [X0,X1] : (($true = (in @ X0 @ (powerset @ X1))) & ? [X2] : (($true = (in @ X2 @ (powerset @ X1))) & ? [X3] : (((in @ X3 @ (binintersect @ X0 @ X2)) = $true) & ((in @ X3 @ X1) != $true))))),
% 0.20/0.38 inference(rectify,[],[f14])).
% 0.20/0.38 thf(f14,plain,(
% 0.20/0.38 (binintersectEL = $true) & (powersetE = $true) & ? [X1,X0] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (($true = (in @ X2 @ (powerset @ X0))) & ? [X3] : (((in @ X3 @ (binintersect @ X1 @ X2)) = $true) & ($true != (in @ X3 @ X0)))))),
% 0.20/0.38 inference(flattening,[],[f13])).
% 0.20/0.38 thf(f13,plain,(
% 0.20/0.38 (? [X1,X0] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (($true = (in @ X2 @ (powerset @ X0))) & ? [X3] : (((in @ X3 @ (binintersect @ X1 @ X2)) = $true) & ($true != (in @ X3 @ X0))))) & (binintersectEL = $true)) & (powersetE = $true)),
% 0.20/0.38 inference(ennf_transformation,[],[f7])).
% 0.20/0.38 thf(f7,plain,(
% 0.20/0.38 ~((powersetE = $true) => ((binintersectEL = $true) => ! [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (($true = (in @ X2 @ (powerset @ X0))) => ! [X3] : (((in @ X3 @ (binintersect @ X1 @ X2)) = $true) => ($true = (in @ X3 @ X0)))))))),
% 0.20/0.38 inference(fool_elimination,[],[f6])).
% 0.20/0.38 thf(f6,plain,(
% 0.20/0.38 ~(powersetE => (binintersectEL => ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X3] : ((in @ X3 @ (binintersect @ X1 @ X2)) => (in @ X3 @ X0))))))),
% 0.20/0.38 inference(rectify,[],[f4])).
% 0.20/0.38 thf(f4,negated_conjecture,(
% 0.20/0.38 ~(powersetE => (binintersectEL => ! [X0,X3] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (binintersect @ X3 @ X4)) => (in @ X2 @ X0))))))),
% 0.20/0.38 inference(negated_conjecture,[],[f3])).
% 0.20/0.38 thf(f3,conjecture,(
% 0.20/0.38 powersetE => (binintersectEL => ! [X0,X3] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (binintersect @ X3 @ X4)) => (in @ X2 @ X0)))))),
% 0.20/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',woz13rule0)).
% 0.20/0.38 thf(f59,plain,(
% 0.20/0.38 ((in @ sK6 @ sK4) = $true)),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f58])).
% 0.20/0.38 thf(f58,plain,(
% 0.20/0.38 ((in @ sK6 @ sK4) = $true) | ($true != $true)),
% 0.20/0.38 inference(superposition,[],[f57,f53])).
% 0.20/0.38 thf(f53,plain,(
% 0.20/0.38 ((in @ sK6 @ sK3) = $true)),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f52])).
% 0.20/0.38 thf(f52,plain,(
% 0.20/0.38 ((in @ sK6 @ sK3) = $true) | ($true != $true)),
% 0.20/0.38 inference(superposition,[],[f50,f34])).
% 0.20/0.38 thf(f34,plain,(
% 0.20/0.38 ((in @ sK6 @ (binintersect @ sK3 @ sK5)) = $true)),
% 0.20/0.38 inference(cnf_transformation,[],[f25])).
% 0.20/0.38 thf(f50,plain,(
% 0.20/0.38 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (in @ X5 @ (binintersect @ X4 @ X3))) | ((in @ X5 @ X4) = $true)) )),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f45])).
% 0.20/0.38 thf(f45,plain,(
% 0.20/0.38 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (in @ X5 @ (binintersect @ X4 @ X3))) | ($true != $true) | ((in @ X5 @ X4) = $true)) )),
% 0.20/0.38 inference(definition_unfolding,[],[f30,f38])).
% 0.20/0.38 thf(f38,plain,(
% 0.20/0.38 (binintersectEL = $true)),
% 0.20/0.38 inference(cnf_transformation,[],[f25])).
% 0.20/0.38 thf(f30,plain,(
% 0.20/0.38 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (in @ X5 @ (binintersect @ X4 @ X3))) | ((in @ X5 @ X4) = $true) | (binintersectEL != $true)) )),
% 0.20/0.38 inference(cnf_transformation,[],[f20])).
% 0.20/0.38 thf(f20,plain,(
% 0.20/0.38 ((binintersectEL = $true) | (((in @ sK2 @ (binintersect @ sK1 @ sK0)) = $true) & ((in @ sK2 @ sK1) != $true))) & (! [X3,X4,X5] : (($true != (in @ X5 @ (binintersect @ X4 @ X3))) | ((in @ X5 @ X4) = $true)) | (binintersectEL != $true))),
% 0.20/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f18,f19])).
% 0.20/0.38 thf(f19,plain,(
% 0.20/0.38 ? [X0,X1,X2] : (((in @ X2 @ (binintersect @ X1 @ X0)) = $true) & ((in @ X2 @ X1) != $true)) => (((in @ sK2 @ (binintersect @ sK1 @ sK0)) = $true) & ((in @ sK2 @ sK1) != $true))),
% 0.20/0.38 introduced(choice_axiom,[])).
% 0.20/0.38 thf(f18,plain,(
% 0.20/0.38 ((binintersectEL = $true) | ? [X0,X1,X2] : (((in @ X2 @ (binintersect @ X1 @ X0)) = $true) & ((in @ X2 @ X1) != $true))) & (! [X3,X4,X5] : (($true != (in @ X5 @ (binintersect @ X4 @ X3))) | ((in @ X5 @ X4) = $true)) | (binintersectEL != $true))),
% 0.20/0.38 inference(rectify,[],[f17])).
% 0.20/0.38 thf(f17,plain,(
% 0.20/0.38 ((binintersectEL = $true) | ? [X2,X0,X1] : (($true = (in @ X1 @ (binintersect @ X0 @ X2))) & ($true != (in @ X1 @ X0)))) & (! [X2,X0,X1] : (($true != (in @ X1 @ (binintersect @ X0 @ X2))) | ($true = (in @ X1 @ X0))) | (binintersectEL != $true))),
% 0.20/0.38 inference(nnf_transformation,[],[f12])).
% 0.20/0.38 thf(f12,plain,(
% 0.20/0.38 (binintersectEL = $true) <=> ! [X2,X0,X1] : (($true != (in @ X1 @ (binintersect @ X0 @ X2))) | ($true = (in @ X1 @ X0)))),
% 0.20/0.38 inference(ennf_transformation,[],[f9])).
% 0.20/0.38 thf(f9,plain,(
% 0.20/0.38 (binintersectEL = $true) <=> ! [X2,X0,X1] : (($true = (in @ X1 @ (binintersect @ X0 @ X2))) => ($true = (in @ X1 @ X0)))),
% 0.20/0.38 inference(fool_elimination,[],[f8])).
% 0.20/0.38 thf(f8,plain,(
% 0.20/0.38 (! [X0,X1,X2] : ((in @ X1 @ (binintersect @ X0 @ X2)) => (in @ X1 @ X0)) = binintersectEL)),
% 0.20/0.38 inference(rectify,[],[f2])).
% 0.20/0.38 thf(f2,axiom,(
% 0.20/0.38 (! [X0,X2,X1] : ((in @ X2 @ (binintersect @ X0 @ X1)) => (in @ X2 @ X0)) = binintersectEL)),
% 0.20/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectEL)).
% 0.20/0.38 thf(f57,plain,(
% 0.20/0.38 ( ! [X0 : $i] : (($true != (in @ X0 @ sK3)) | ($true = (in @ X0 @ sK4))) )),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f55])).
% 0.20/0.38 thf(f55,plain,(
% 0.20/0.38 ( ! [X0 : $i] : (($true = (in @ X0 @ sK4)) | ($true != $true) | ($true != (in @ X0 @ sK3))) )),
% 0.20/0.38 inference(superposition,[],[f51,f36])).
% 0.20/0.38 thf(f36,plain,(
% 0.20/0.38 ((in @ sK3 @ (powerset @ sK4)) = $true)),
% 0.20/0.38 inference(cnf_transformation,[],[f25])).
% 0.20/0.38 thf(f51,plain,(
% 0.20/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ X1 @ (powerset @ X2))) | ($true != (in @ X0 @ X1)) | ($true = (in @ X0 @ X2))) )),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f46])).
% 0.20/0.38 thf(f46,plain,(
% 0.20/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ X1 @ (powerset @ X2))) | ($true = (in @ X0 @ X2)) | ($true != (in @ X0 @ X1)) | ($true != $true)) )),
% 0.20/0.38 inference(definition_unfolding,[],[f42,f37])).
% 0.20/0.38 thf(f37,plain,(
% 0.20/0.38 (powersetE = $true)),
% 0.20/0.38 inference(cnf_transformation,[],[f25])).
% 0.20/0.38 thf(f42,plain,(
% 0.20/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (in @ X0 @ X2)) | ($true != (in @ X1 @ (powerset @ X2))) | ($true != (in @ X0 @ X1)) | (powersetE != $true)) )),
% 0.20/0.38 inference(cnf_transformation,[],[f29])).
% 0.20/0.38 thf(f29,plain,(
% 0.20/0.38 (! [X0,X1,X2] : (($true = (in @ X0 @ X2)) | ($true != (in @ X1 @ (powerset @ X2))) | ($true != (in @ X0 @ X1))) | (powersetE != $true)) & ((powersetE = $true) | (($true != (in @ sK7 @ sK9)) & ((in @ sK8 @ (powerset @ sK9)) = $true) & ((in @ sK7 @ sK8) = $true)))),
% 0.20/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9])],[f27,f28])).
% 0.20/0.38 thf(f28,plain,(
% 0.20/0.38 ? [X3,X4,X5] : (($true != (in @ X3 @ X5)) & ($true = (in @ X4 @ (powerset @ X5))) & ((in @ X3 @ X4) = $true)) => (($true != (in @ sK7 @ sK9)) & ((in @ sK8 @ (powerset @ sK9)) = $true) & ((in @ sK7 @ sK8) = $true))),
% 0.20/0.38 introduced(choice_axiom,[])).
% 0.20/0.38 thf(f27,plain,(
% 0.20/0.38 (! [X0,X1,X2] : (($true = (in @ X0 @ X2)) | ($true != (in @ X1 @ (powerset @ X2))) | ($true != (in @ X0 @ X1))) | (powersetE != $true)) & ((powersetE = $true) | ? [X3,X4,X5] : (($true != (in @ X3 @ X5)) & ($true = (in @ X4 @ (powerset @ X5))) & ((in @ X3 @ X4) = $true)))),
% 0.20/0.38 inference(rectify,[],[f26])).
% 0.20/0.38 thf(f26,plain,(
% 0.20/0.38 (! [X1,X2,X0] : (($true = (in @ X1 @ X0)) | ($true != (in @ X2 @ (powerset @ X0))) | ((in @ X1 @ X2) != $true)) | (powersetE != $true)) & ((powersetE = $true) | ? [X1,X2,X0] : (($true != (in @ X1 @ X0)) & ($true = (in @ X2 @ (powerset @ X0))) & ((in @ X1 @ X2) = $true)))),
% 0.20/0.38 inference(nnf_transformation,[],[f16])).
% 0.20/0.38 thf(f16,plain,(
% 0.20/0.38 ! [X1,X2,X0] : (($true = (in @ X1 @ X0)) | ($true != (in @ X2 @ (powerset @ X0))) | ((in @ X1 @ X2) != $true)) <=> (powersetE = $true)),
% 0.20/0.38 inference(flattening,[],[f15])).
% 0.20/0.38 thf(f15,plain,(
% 0.20/0.38 ! [X1,X2,X0] : ((($true = (in @ X1 @ X0)) | ((in @ X1 @ X2) != $true)) | ($true != (in @ X2 @ (powerset @ X0)))) <=> (powersetE = $true)),
% 0.20/0.38 inference(ennf_transformation,[],[f11])).
% 0.20/0.38 thf(f11,plain,(
% 0.20/0.38 ! [X1,X2,X0] : (($true = (in @ X2 @ (powerset @ X0))) => (((in @ X1 @ X2) = $true) => ($true = (in @ X1 @ X0)))) <=> (powersetE = $true)),
% 0.20/0.38 inference(fool_elimination,[],[f10])).
% 0.20/0.38 thf(f10,plain,(
% 0.20/0.38 (! [X0,X1,X2] : ((in @ X2 @ (powerset @ X0)) => ((in @ X1 @ X2) => (in @ X1 @ X0))) = powersetE)),
% 0.20/0.38 inference(rectify,[],[f1])).
% 0.20/0.38 thf(f1,axiom,(
% 0.20/0.38 (! [X0,X2,X1] : ((in @ X1 @ (powerset @ X0)) => ((in @ X2 @ X1) => (in @ X2 @ X0))) = powersetE)),
% 0.20/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetE)).
% 0.20/0.38 % SZS output end Proof for theBenchmark
% 0.20/0.38 % (10683)------------------------------
% 0.20/0.38 % (10683)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (10683)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (10683)Memory used [KB]: 5500
% 0.20/0.38 % (10683)Time elapsed: 0.007 s
% 0.20/0.38 % (10683)Instructions burned: 4 (million)
% 0.20/0.38 % (10683)------------------------------
% 0.20/0.38 % (10683)------------------------------
% 0.20/0.38 % (10676)Success in time 0.009 s
% 0.20/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------