TSTP Solution File: SEU573^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU573^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 : n011.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:41 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SEU573^2 : TPTP v8.2.0. Released v3.7.0.
% 0.08/0.14 % 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.35 % Computer : n011.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 16:19: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/sandbox/benchmark/theBenchmark.p
% 0.14/0.37 % (24626)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 % (24626)Refutation not found, incomplete strategy
% 0.14/0.37 % (24626)------------------------------
% 0.14/0.37 % (24626)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (24626)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37
% 0.14/0.37
% 0.14/0.37 % (24626)Memory used [KB]: 5500
% 0.14/0.37 % (24626)Time elapsed: 0.003 s
% 0.14/0.37 % (24626)Instructions burned: 2 (million)
% 0.14/0.37 % (24626)------------------------------
% 0.14/0.37 % (24626)------------------------------
% 0.14/0.37 % (24619)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 % (24620)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 % (24625)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 % (24624)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.21/0.38 % (24620)Instruction limit reached!
% 0.21/0.38 % (24620)------------------------------
% 0.21/0.38 % (24620)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (24620)Termination reason: Unknown
% 0.21/0.38 % (24620)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (24620)Memory used [KB]: 5500
% 0.21/0.38 % (24620)Time elapsed: 0.005 s
% 0.21/0.38 % (24620)Instructions burned: 4 (million)
% 0.21/0.38 % (24623)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.21/0.38 % (24620)------------------------------
% 0.21/0.38 % (24620)------------------------------
% 0.21/0.38 % (24621)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.21/0.38 % (24623)Instruction limit reached!
% 0.21/0.38 % (24623)------------------------------
% 0.21/0.38 % (24623)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (24623)Termination reason: Unknown
% 0.21/0.38 % (24623)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (24623)Memory used [KB]: 5500
% 0.21/0.38 % (24623)Time elapsed: 0.003 s
% 0.21/0.38 % (24623)Instructions burned: 3 (million)
% 0.21/0.38 % (24623)------------------------------
% 0.21/0.38 % (24623)------------------------------
% 0.21/0.38 % (24625)First to succeed.
% 0.21/0.38 % (24624)Also succeeded, but the first one will report.
% 0.21/0.38 % (24625)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% 0.21/0.38 thf(func_def_0, type, in: $i > $i > $o).
% 0.21/0.38 thf(func_def_1, type, powerset: $i > $i).
% 0.21/0.38 thf(func_def_4, type, subset: $i > $i > $o).
% 0.21/0.38 thf(func_def_15, type, sK7: $i > $i > $i).
% 0.21/0.38 thf(f61,plain,(
% 0.21/0.38 $false),
% 0.21/0.38 inference(subsumption_resolution,[],[f60,f28])).
% 0.21/0.38 thf(f28,plain,(
% 0.21/0.38 ($true != (in @ sK1 @ (powerset @ sK0)))),
% 0.21/0.38 inference(cnf_transformation,[],[f18])).
% 0.21/0.38 thf(f18,plain,(
% 0.21/0.38 (subsetE = $true) & (powersetI = $true) & (($true = (subset @ sK1 @ sK0)) & ($true != (in @ sK1 @ (powerset @ sK0))))),
% 0.21/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f13,f17])).
% 0.21/0.38 thf(f17,plain,(
% 0.21/0.38 ? [X0,X1] : (($true = (subset @ X1 @ X0)) & ((in @ X1 @ (powerset @ X0)) != $true)) => (($true = (subset @ sK1 @ sK0)) & ($true != (in @ sK1 @ (powerset @ sK0))))),
% 0.21/0.38 introduced(choice_axiom,[])).
% 0.21/0.38 thf(f13,plain,(
% 0.21/0.38 (subsetE = $true) & (powersetI = $true) & ? [X0,X1] : (($true = (subset @ X1 @ X0)) & ((in @ X1 @ (powerset @ X0)) != $true))),
% 0.21/0.38 inference(flattening,[],[f12])).
% 0.21/0.38 thf(f12,plain,(
% 0.21/0.38 (? [X0,X1] : (($true = (subset @ X1 @ X0)) & ((in @ X1 @ (powerset @ X0)) != $true)) & (subsetE = $true)) & (powersetI = $true)),
% 0.21/0.38 inference(ennf_transformation,[],[f9])).
% 0.21/0.38 thf(f9,plain,(
% 0.21/0.38 ~((powersetI = $true) => ((subsetE = $true) => ! [X1,X0] : (($true = (subset @ X1 @ X0)) => ((in @ X1 @ (powerset @ X0)) = $true))))),
% 0.21/0.38 inference(fool_elimination,[],[f8])).
% 0.21/0.38 thf(f8,plain,(
% 0.21/0.38 ~(powersetI => (subsetE => ! [X0,X1] : ((subset @ X1 @ X0) => (in @ X1 @ (powerset @ X0)))))),
% 0.21/0.38 inference(rectify,[],[f4])).
% 0.21/0.38 thf(f4,negated_conjecture,(
% 0.21/0.38 ~(powersetI => (subsetE => ! [X1,X0] : ((subset @ X0 @ X1) => (in @ X0 @ (powerset @ X1)))))),
% 0.21/0.38 inference(negated_conjecture,[],[f3])).
% 0.21/0.38 thf(f3,conjecture,(
% 0.21/0.38 powersetI => (subsetE => ! [X1,X0] : ((subset @ X0 @ X1) => (in @ X0 @ (powerset @ X1))))),
% 0.21/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset2powerset)).
% 0.21/0.38 thf(f60,plain,(
% 0.21/0.38 ($true = (in @ sK1 @ (powerset @ sK0)))),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f59])).
% 0.21/0.38 thf(f59,plain,(
% 0.21/0.38 ($true != $true) | ($true = (in @ sK1 @ (powerset @ sK0)))),
% 0.21/0.38 inference(superposition,[],[f48,f58])).
% 0.21/0.38 thf(f58,plain,(
% 0.21/0.38 ($true = (in @ (sK7 @ sK1 @ sK0) @ sK0))),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f57])).
% 0.21/0.38 thf(f57,plain,(
% 0.21/0.38 ($true != $true) | ($true = (in @ (sK7 @ sK1 @ sK0) @ sK0))),
% 0.21/0.38 inference(superposition,[],[f52,f55])).
% 0.21/0.38 thf(f55,plain,(
% 0.21/0.38 ($true = (in @ (sK7 @ sK1 @ sK0) @ sK1))),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f53])).
% 0.21/0.38 thf(f53,plain,(
% 0.21/0.38 ($true != $true) | ($true = (in @ (sK7 @ sK1 @ sK0) @ sK1))),
% 0.21/0.38 inference(superposition,[],[f28,f50])).
% 0.21/0.38 thf(f50,plain,(
% 0.21/0.38 ( ! [X3 : $i,X4 : $i] : (((in @ X4 @ (powerset @ X3)) = $true) | ((in @ (sK7 @ X4 @ X3) @ X4) = $true)) )),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f46])).
% 0.21/0.38 thf(f46,plain,(
% 0.21/0.38 ( ! [X3 : $i,X4 : $i] : (($true != $true) | ((in @ X4 @ (powerset @ X3)) = $true) | ((in @ (sK7 @ X4 @ X3) @ X4) = $true)) )),
% 0.21/0.38 inference(definition_unfolding,[],[f37,f30])).
% 0.21/0.38 thf(f30,plain,(
% 0.21/0.38 (powersetI = $true)),
% 0.21/0.38 inference(cnf_transformation,[],[f18])).
% 0.21/0.38 thf(f37,plain,(
% 0.21/0.38 ( ! [X3 : $i,X4 : $i] : (((in @ (sK7 @ X4 @ X3) @ X4) = $true) | ((in @ X4 @ (powerset @ X3)) = $true) | (powersetI != $true)) )),
% 0.21/0.38 inference(cnf_transformation,[],[f27])).
% 0.21/0.38 thf(f27,plain,(
% 0.21/0.38 ((powersetI = $true) | (! [X2] : (($true != (in @ X2 @ sK6)) | ($true = (in @ X2 @ sK5))) & ($true != (in @ sK6 @ (powerset @ sK5))))) & (! [X3,X4] : ((((in @ (sK7 @ X4 @ X3) @ X4) = $true) & ($true != (in @ (sK7 @ X4 @ X3) @ X3))) | ((in @ X4 @ (powerset @ X3)) = $true)) | (powersetI != $true))),
% 0.21/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f24,f26,f25])).
% 0.21/0.38 thf(f25,plain,(
% 0.21/0.38 ? [X0,X1] : (! [X2] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true)) & ((in @ X1 @ (powerset @ X0)) != $true)) => (! [X2] : (($true != (in @ X2 @ sK6)) | ($true = (in @ X2 @ sK5))) & ($true != (in @ sK6 @ (powerset @ sK5))))),
% 0.21/0.38 introduced(choice_axiom,[])).
% 0.21/0.38 thf(f26,plain,(
% 0.21/0.38 ! [X3,X4] : (? [X5] : (($true = (in @ X5 @ X4)) & ((in @ X5 @ X3) != $true)) => (((in @ (sK7 @ X4 @ X3) @ X4) = $true) & ($true != (in @ (sK7 @ X4 @ X3) @ X3))))),
% 0.21/0.38 introduced(choice_axiom,[])).
% 0.21/0.38 thf(f24,plain,(
% 0.21/0.38 ((powersetI = $true) | ? [X0,X1] : (! [X2] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true)) & ((in @ X1 @ (powerset @ X0)) != $true))) & (! [X3,X4] : (? [X5] : (($true = (in @ X5 @ X4)) & ((in @ X5 @ X3) != $true)) | ((in @ X4 @ (powerset @ X3)) = $true)) | (powersetI != $true))),
% 0.21/0.38 inference(rectify,[],[f23])).
% 0.21/0.38 thf(f23,plain,(
% 0.21/0.38 ((powersetI = $true) | ? [X0,X1] : (! [X2] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true)) & ((in @ X1 @ (powerset @ X0)) != $true))) & (! [X0,X1] : (? [X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)) | ((in @ X1 @ (powerset @ X0)) = $true)) | (powersetI != $true))),
% 0.21/0.38 inference(nnf_transformation,[],[f16])).
% 0.21/0.38 thf(f16,plain,(
% 0.21/0.38 (powersetI = $true) <=> ! [X0,X1] : (? [X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)) | ((in @ X1 @ (powerset @ X0)) = $true))),
% 0.21/0.38 inference(ennf_transformation,[],[f11])).
% 0.21/0.38 thf(f11,plain,(
% 0.21/0.38 ! [X1,X0] : (! [X2] : (((in @ X2 @ X1) = $true) => ((in @ X2 @ X0) = $true)) => ((in @ X1 @ (powerset @ X0)) = $true)) <=> (powersetI = $true)),
% 0.21/0.38 inference(fool_elimination,[],[f10])).
% 0.21/0.38 thf(f10,plain,(
% 0.21/0.38 (powersetI = ! [X0,X1] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (in @ X1 @ (powerset @ X0))))),
% 0.21/0.38 inference(rectify,[],[f1])).
% 0.21/0.38 thf(f1,axiom,(
% 0.21/0.38 (powersetI = ! [X0,X1] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (in @ X1 @ (powerset @ X0))))),
% 0.21/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',powersetI)).
% 0.21/0.38 thf(f52,plain,(
% 0.21/0.38 ( ! [X0 : $i] : (($true != (in @ X0 @ sK1)) | ($true = (in @ X0 @ sK0))) )),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f51])).
% 0.21/0.38 thf(f51,plain,(
% 0.21/0.38 ( ! [X0 : $i] : (($true != $true) | ($true != (in @ X0 @ sK1)) | ($true = (in @ X0 @ sK0))) )),
% 0.21/0.38 inference(superposition,[],[f49,f29])).
% 0.21/0.38 thf(f29,plain,(
% 0.21/0.38 ($true = (subset @ sK1 @ sK0))),
% 0.21/0.38 inference(cnf_transformation,[],[f18])).
% 0.21/0.38 thf(f49,plain,(
% 0.21/0.38 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (subset @ X4 @ X5)) | ($true = (in @ X3 @ X5)) | ((in @ X3 @ X4) != $true)) )),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f43])).
% 0.21/0.38 thf(f43,plain,(
% 0.21/0.38 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (subset @ X4 @ X5)) | ((in @ X3 @ X4) != $true) | ($true = (in @ X3 @ X5)) | ($true != $true)) )),
% 0.21/0.38 inference(definition_unfolding,[],[f32,f31])).
% 0.21/0.38 thf(f31,plain,(
% 0.21/0.38 (subsetE = $true)),
% 0.21/0.38 inference(cnf_transformation,[],[f18])).
% 0.21/0.38 thf(f32,plain,(
% 0.21/0.38 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (subset @ X4 @ X5)) | ($true = (in @ X3 @ X5)) | ((in @ X3 @ X4) != $true) | (subsetE != $true)) )),
% 0.21/0.38 inference(cnf_transformation,[],[f22])).
% 0.21/0.38 thf(f22,plain,(
% 0.21/0.38 ((subsetE = $true) | (((subset @ sK3 @ sK4) = $true) & ((in @ sK2 @ sK4) != $true) & ((in @ sK2 @ sK3) = $true))) & (! [X3,X4,X5] : (($true != (subset @ X4 @ X5)) | ($true = (in @ X3 @ X5)) | ((in @ X3 @ X4) != $true)) | (subsetE != $true))),
% 0.21/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f20,f21])).
% 0.21/0.38 thf(f21,plain,(
% 0.21/0.38 ? [X0,X1,X2] : (($true = (subset @ X1 @ X2)) & ($true != (in @ X0 @ X2)) & ($true = (in @ X0 @ X1))) => (((subset @ sK3 @ sK4) = $true) & ((in @ sK2 @ sK4) != $true) & ((in @ sK2 @ sK3) = $true))),
% 0.21/0.38 introduced(choice_axiom,[])).
% 0.21/0.38 thf(f20,plain,(
% 0.21/0.38 ((subsetE = $true) | ? [X0,X1,X2] : (($true = (subset @ X1 @ X2)) & ($true != (in @ X0 @ X2)) & ($true = (in @ X0 @ X1)))) & (! [X3,X4,X5] : (($true != (subset @ X4 @ X5)) | ($true = (in @ X3 @ X5)) | ((in @ X3 @ X4) != $true)) | (subsetE != $true))),
% 0.21/0.38 inference(rectify,[],[f19])).
% 0.21/0.38 thf(f19,plain,(
% 0.21/0.38 ((subsetE = $true) | ? [X1,X2,X0] : (((subset @ X2 @ X0) = $true) & ($true != (in @ X1 @ X0)) & ((in @ X1 @ X2) = $true))) & (! [X1,X2,X0] : (((subset @ X2 @ X0) != $true) | ($true = (in @ X1 @ X0)) | ((in @ X1 @ X2) != $true)) | (subsetE != $true))),
% 0.21/0.38 inference(nnf_transformation,[],[f15])).
% 0.21/0.38 thf(f15,plain,(
% 0.21/0.38 (subsetE = $true) <=> ! [X1,X2,X0] : (((subset @ X2 @ X0) != $true) | ($true = (in @ X1 @ X0)) | ((in @ X1 @ X2) != $true))),
% 0.21/0.38 inference(flattening,[],[f14])).
% 0.21/0.38 thf(f14,plain,(
% 0.21/0.38 ! [X0,X1,X2] : ((($true = (in @ X1 @ X0)) | ((in @ X1 @ X2) != $true)) | ((subset @ X2 @ X0) != $true)) <=> (subsetE = $true)),
% 0.21/0.38 inference(ennf_transformation,[],[f7])).
% 0.21/0.38 thf(f7,plain,(
% 0.21/0.38 ! [X0,X1,X2] : (((subset @ X2 @ X0) = $true) => (((in @ X1 @ X2) = $true) => ($true = (in @ X1 @ X0)))) <=> (subsetE = $true)),
% 0.21/0.38 inference(fool_elimination,[],[f6])).
% 0.21/0.38 thf(f6,plain,(
% 0.21/0.38 (! [X0,X1,X2] : ((subset @ X2 @ X0) => ((in @ X1 @ X2) => (in @ X1 @ X0))) = subsetE)),
% 0.21/0.38 inference(rectify,[],[f2])).
% 0.21/0.38 thf(f2,axiom,(
% 0.21/0.38 (! [X1,X2,X0] : ((subset @ X0 @ X1) => ((in @ X2 @ X0) => (in @ X2 @ X1))) = subsetE)),
% 0.21/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetE)).
% 0.21/0.38 thf(f48,plain,(
% 0.21/0.38 ( ! [X3 : $i,X4 : $i] : (($true != (in @ (sK7 @ X4 @ X3) @ X3)) | ((in @ X4 @ (powerset @ X3)) = $true)) )),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f47])).
% 0.21/0.38 thf(f47,plain,(
% 0.21/0.38 ( ! [X3 : $i,X4 : $i] : (($true != $true) | ((in @ X4 @ (powerset @ X3)) = $true) | ($true != (in @ (sK7 @ X4 @ X3) @ X3))) )),
% 0.21/0.38 inference(definition_unfolding,[],[f36,f30])).
% 0.21/0.38 thf(f36,plain,(
% 0.21/0.38 ( ! [X3 : $i,X4 : $i] : (($true != (in @ (sK7 @ X4 @ X3) @ X3)) | ((in @ X4 @ (powerset @ X3)) = $true) | (powersetI != $true)) )),
% 0.21/0.38 inference(cnf_transformation,[],[f27])).
% 0.21/0.38 % SZS output end Proof for theBenchmark
% 0.21/0.38 % (24625)------------------------------
% 0.21/0.38 % (24625)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (24625)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (24625)Memory used [KB]: 5500
% 0.21/0.38 % (24625)Time elapsed: 0.007 s
% 0.21/0.38 % (24625)Instructions burned: 4 (million)
% 0.21/0.38 % (24625)------------------------------
% 0.21/0.38 % (24625)------------------------------
% 0.21/0.38 % (24618)Success in time 0.008 s
% 0.21/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------