TSTP Solution File: SEU519^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU519^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 : n021.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:18 EDT 2024
% Result : Theorem 0.10s 0.33s
% Output : Refutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : SEU519^2 : TPTP v8.2.0. Released v3.7.0.
% 0.08/0.11 % 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.10/0.31 % Computer : n021.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 15:39:07 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a TH0_THM_EQU_NAR problem
% 0.10/0.31 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.10/0.33 % (26206)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 (3000ds/4Mi)
% 0.10/0.33 % (26209)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.10/0.33 % (26208)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.10/0.33 % (26207)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 (3000ds/27Mi)
% 0.10/0.33 % (26212)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.10/0.33 % (26205)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.10/0.33 % (26210)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.10/0.33 % (26211)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.10/0.33 % (26208)Instruction limit reached!
% 0.10/0.33 % (26208)------------------------------
% 0.10/0.33 % (26208)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.33 % (26208)Termination reason: Unknown
% 0.10/0.33 % (26209)Instruction limit reached!
% 0.10/0.33 % (26209)------------------------------
% 0.10/0.33 % (26209)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.33 % (26208)Termination phase: Saturation
% 0.10/0.33
% 0.10/0.33 % (26208)Memory used [KB]: 5500
% 0.10/0.33 % (26208)Time elapsed: 0.003 s
% 0.10/0.33 % (26208)Instructions burned: 2 (million)
% 0.10/0.33 % (26208)------------------------------
% 0.10/0.33 % (26208)------------------------------
% 0.10/0.33 % (26209)Termination reason: Unknown
% 0.10/0.33 % (26209)Termination phase: Saturation
% 0.10/0.33
% 0.10/0.33 % (26209)Memory used [KB]: 5500
% 0.10/0.33 % (26209)Time elapsed: 0.003 s
% 0.10/0.33 % (26209)Instructions burned: 2 (million)
% 0.10/0.33 % (26209)------------------------------
% 0.10/0.33 % (26209)------------------------------
% 0.10/0.33 % (26212)Refutation not found, incomplete strategy
% 0.10/0.33 % (26212)------------------------------
% 0.10/0.33 % (26212)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.33 % (26212)Termination reason: Refutation not found, incomplete strategy
% 0.10/0.33
% 0.10/0.33
% 0.10/0.33 % (26212)Memory used [KB]: 5500
% 0.10/0.33 % (26212)Time elapsed: 0.003 s
% 0.10/0.33 % (26212)Instructions burned: 2 (million)
% 0.10/0.33 % (26212)------------------------------
% 0.10/0.33 % (26212)------------------------------
% 0.10/0.33 % (26210)First to succeed.
% 0.10/0.33 % (26206)Instruction limit reached!
% 0.10/0.33 % (26206)------------------------------
% 0.10/0.33 % (26206)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.33 % (26206)Termination reason: Unknown
% 0.10/0.33 % (26206)Termination phase: Saturation
% 0.10/0.33
% 0.10/0.33 % (26206)Memory used [KB]: 5500
% 0.10/0.33 % (26206)Time elapsed: 0.005 s
% 0.10/0.33 % (26206)Instructions burned: 5 (million)
% 0.10/0.33 % (26206)------------------------------
% 0.10/0.33 % (26206)------------------------------
% 0.10/0.33 % (26211)Also succeeded, but the first one will report.
% 0.10/0.33 % (26205)Also succeeded, but the first one will report.
% 0.10/0.33 % (26210)Refutation found. Thanks to Tanya!
% 0.10/0.33 % SZS status Theorem for theBenchmark
% 0.10/0.33 % SZS output start Proof for theBenchmark
% 0.10/0.33 thf(func_def_0, type, in: $i > $i > $o).
% 0.10/0.33 thf(func_def_2, type, powerset: $i > $i).
% 0.10/0.33 thf(func_def_11, type, sK3: $i > $i > $i).
% 0.10/0.33 thf(f71,plain,(
% 0.10/0.33 $false),
% 0.10/0.33 inference(avatar_sat_refutation,[],[f54,f62,f67])).
% 0.10/0.33 thf(f67,plain,(
% 0.10/0.33 ~spl6_1),
% 0.10/0.33 inference(avatar_contradiction_clause,[],[f66])).
% 0.10/0.33 thf(f66,plain,(
% 0.10/0.33 $false | ~spl6_1),
% 0.10/0.33 inference(trivial_inequality_removal,[],[f65])).
% 0.10/0.33 thf(f65,plain,(
% 0.10/0.33 ($true != $true) | ~spl6_1),
% 0.10/0.33 inference(superposition,[],[f28,f50])).
% 0.10/0.33 thf(f50,plain,(
% 0.10/0.33 ( ! [X3 : $o] : (($true = X3)) ) | ~spl6_1),
% 0.10/0.33 inference(avatar_component_clause,[],[f49])).
% 0.10/0.33 thf(f49,plain,(
% 0.10/0.33 spl6_1 <=> ! [X3 : $o] : ($true = X3)),
% 0.10/0.33 introduced(avatar_definition,[new_symbols(naming,[spl6_1])])).
% 0.10/0.33 thf(f28,plain,(
% 0.10/0.33 ($true != (in @ emptyset @ (powerset @ sK0)))),
% 0.10/0.33 inference(cnf_transformation,[],[f17])).
% 0.10/0.33 thf(f17,plain,(
% 0.10/0.33 (powersetI = $true) & (emptysetE = $true) & ($true != (in @ emptyset @ (powerset @ sK0)))),
% 0.10/0.33 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f14,f16])).
% 0.10/0.33 thf(f16,plain,(
% 0.10/0.33 ? [X0] : ((in @ emptyset @ (powerset @ X0)) != $true) => ($true != (in @ emptyset @ (powerset @ sK0)))),
% 0.10/0.33 introduced(choice_axiom,[])).
% 0.10/0.33 thf(f14,plain,(
% 0.10/0.33 (powersetI = $true) & (emptysetE = $true) & ? [X0] : ((in @ emptyset @ (powerset @ X0)) != $true)),
% 0.10/0.33 inference(flattening,[],[f13])).
% 0.10/0.33 thf(f13,plain,(
% 0.10/0.33 (? [X0] : ((in @ emptyset @ (powerset @ X0)) != $true) & (powersetI = $true)) & (emptysetE = $true)),
% 0.10/0.33 inference(ennf_transformation,[],[f11])).
% 0.10/0.33 thf(f11,plain,(
% 0.10/0.33 ~((emptysetE = $true) => ((powersetI = $true) => ! [X0] : ((in @ emptyset @ (powerset @ X0)) = $true)))),
% 0.10/0.33 inference(fool_elimination,[],[f10])).
% 0.10/0.33 thf(f10,plain,(
% 0.10/0.33 ~(emptysetE => (powersetI => ! [X0] : (in @ emptyset @ (powerset @ X0))))),
% 0.10/0.33 inference(rectify,[],[f4])).
% 0.10/0.33 thf(f4,negated_conjecture,(
% 0.10/0.33 ~(emptysetE => (powersetI => ! [X2] : (in @ emptyset @ (powerset @ X2))))),
% 0.10/0.33 inference(negated_conjecture,[],[f3])).
% 0.10/0.33 thf(f3,conjecture,(
% 0.10/0.33 emptysetE => (powersetI => ! [X2] : (in @ emptyset @ (powerset @ X2)))),
% 0.10/0.33 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptyinPowerset)).
% 0.10/0.33 thf(f62,plain,(
% 0.10/0.33 ~spl6_2),
% 0.10/0.33 inference(avatar_contradiction_clause,[],[f61])).
% 0.10/0.33 thf(f61,plain,(
% 0.10/0.33 $false | ~spl6_2),
% 0.10/0.33 inference(trivial_inequality_removal,[],[f60])).
% 0.10/0.33 thf(f60,plain,(
% 0.10/0.33 ($true != $true) | ~spl6_2),
% 0.10/0.33 inference(superposition,[],[f28,f59])).
% 0.10/0.33 thf(f59,plain,(
% 0.10/0.33 ( ! [X0 : $i] : (((in @ emptyset @ (powerset @ X0)) = $true)) ) | ~spl6_2),
% 0.10/0.33 inference(trivial_inequality_removal,[],[f56])).
% 0.10/0.33 thf(f56,plain,(
% 0.10/0.33 ( ! [X0 : $i] : (($true != $true) | ((in @ emptyset @ (powerset @ X0)) = $true)) ) | ~spl6_2),
% 0.10/0.33 inference(superposition,[],[f53,f46])).
% 0.10/0.33 thf(f46,plain,(
% 0.10/0.33 ( ! [X0 : $i,X1 : $i] : (((in @ (sK3 @ X1 @ X0) @ X1) = $true) | ((in @ X1 @ (powerset @ X0)) = $true)) )),
% 0.10/0.33 inference(trivial_inequality_removal,[],[f42])).
% 0.10/0.33 thf(f42,plain,(
% 0.10/0.33 ( ! [X0 : $i,X1 : $i] : (((in @ X1 @ (powerset @ X0)) = $true) | ($true != $true) | ((in @ (sK3 @ X1 @ X0) @ X1) = $true)) )),
% 0.10/0.33 inference(definition_unfolding,[],[f36,f30])).
% 0.10/0.33 thf(f30,plain,(
% 0.10/0.33 (powersetI = $true)),
% 0.10/0.33 inference(cnf_transformation,[],[f17])).
% 0.10/0.33 thf(f36,plain,(
% 0.10/0.33 ( ! [X0 : $i,X1 : $i] : (((in @ (sK3 @ X1 @ X0) @ X1) = $true) | ((in @ X1 @ (powerset @ X0)) = $true) | (powersetI != $true)) )),
% 0.10/0.33 inference(cnf_transformation,[],[f27])).
% 0.10/0.33 thf(f27,plain,(
% 0.10/0.33 (! [X0,X1] : ((((in @ (sK3 @ X1 @ X0) @ X0) != $true) & ((in @ (sK3 @ X1 @ X0) @ X1) = $true)) | ((in @ X1 @ (powerset @ X0)) = $true)) | (powersetI != $true)) & ((powersetI = $true) | (! [X5] : (((in @ X5 @ sK4) = $true) | ((in @ X5 @ sK5) != $true)) & ((in @ sK5 @ (powerset @ sK4)) != $true)))),
% 0.10/0.33 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f24,f26,f25])).
% 0.10/0.33 thf(f25,plain,(
% 0.10/0.33 ! [X0,X1] : (? [X2] : (($true != (in @ X2 @ X0)) & ((in @ X2 @ X1) = $true)) => (((in @ (sK3 @ X1 @ X0) @ X0) != $true) & ((in @ (sK3 @ X1 @ X0) @ X1) = $true)))),
% 0.10/0.33 introduced(choice_axiom,[])).
% 0.10/0.33 thf(f26,plain,(
% 0.10/0.33 ? [X3,X4] : (! [X5] : (((in @ X5 @ X3) = $true) | ((in @ X5 @ X4) != $true)) & ($true != (in @ X4 @ (powerset @ X3)))) => (! [X5] : (((in @ X5 @ sK4) = $true) | ((in @ X5 @ sK5) != $true)) & ((in @ sK5 @ (powerset @ sK4)) != $true))),
% 0.10/0.34 introduced(choice_axiom,[])).
% 0.10/0.34 thf(f24,plain,(
% 0.10/0.34 (! [X0,X1] : (? [X2] : (($true != (in @ X2 @ X0)) & ((in @ X2 @ X1) = $true)) | ((in @ X1 @ (powerset @ X0)) = $true)) | (powersetI != $true)) & ((powersetI = $true) | ? [X3,X4] : (! [X5] : (((in @ X5 @ X3) = $true) | ((in @ X5 @ X4) != $true)) & ($true != (in @ X4 @ (powerset @ X3)))))),
% 0.10/0.34 inference(rectify,[],[f23])).
% 0.10/0.34 thf(f23,plain,(
% 0.10/0.34 (! [X0,X1] : (? [X2] : (($true != (in @ X2 @ X0)) & ((in @ X2 @ X1) = $true)) | ((in @ X1 @ (powerset @ X0)) = $true)) | (powersetI != $true)) & ((powersetI = $true) | ? [X0,X1] : (! [X2] : (($true = (in @ X2 @ X0)) | ((in @ X2 @ X1) != $true)) & ((in @ X1 @ (powerset @ X0)) != $true)))),
% 0.10/0.34 inference(nnf_transformation,[],[f12])).
% 0.10/0.34 thf(f12,plain,(
% 0.10/0.34 ! [X0,X1] : (? [X2] : (($true != (in @ X2 @ X0)) & ((in @ X2 @ X1) = $true)) | ((in @ X1 @ (powerset @ X0)) = $true)) <=> (powersetI = $true)),
% 0.10/0.34 inference(ennf_transformation,[],[f7])).
% 0.10/0.34 thf(f7,plain,(
% 0.10/0.34 (powersetI = $true) <=> ! [X1,X0] : (! [X2] : (((in @ X2 @ X1) = $true) => ($true = (in @ X2 @ X0))) => ((in @ X1 @ (powerset @ X0)) = $true))),
% 0.10/0.34 inference(fool_elimination,[],[f6])).
% 0.10/0.34 thf(f6,plain,(
% 0.10/0.34 (! [X0,X1] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (in @ X1 @ (powerset @ X0))) = powersetI)),
% 0.10/0.34 inference(rectify,[],[f2])).
% 0.10/0.34 thf(f2,axiom,(
% 0.10/0.34 (! [X2,X3] : (! [X0] : ((in @ X0 @ X3) => (in @ X0 @ X2)) => (in @ X3 @ (powerset @ X2))) = powersetI)),
% 0.10/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetI)).
% 0.10/0.34 thf(f53,plain,(
% 0.10/0.34 ( ! [X2 : $i] : (((in @ X2 @ emptyset) != $true)) ) | ~spl6_2),
% 0.10/0.34 inference(avatar_component_clause,[],[f52])).
% 0.10/0.34 thf(f52,plain,(
% 0.10/0.34 spl6_2 <=> ! [X2] : ((in @ X2 @ emptyset) != $true)),
% 0.10/0.34 introduced(avatar_definition,[new_symbols(naming,[spl6_2])])).
% 0.10/0.34 thf(f54,plain,(
% 0.10/0.34 spl6_1 | spl6_2),
% 0.10/0.34 inference(avatar_split_clause,[],[f47,f52,f49])).
% 0.10/0.34 thf(f47,plain,(
% 0.10/0.34 ( ! [X2 : $i,X3 : $o] : (((in @ X2 @ emptyset) != $true) | ($true = X3)) )),
% 0.10/0.34 inference(trivial_inequality_removal,[],[f40])).
% 0.10/0.34 thf(f40,plain,(
% 0.10/0.34 ( ! [X2 : $i,X3 : $o] : (($true != $true) | ($true = X3) | ((in @ X2 @ emptyset) != $true)) )),
% 0.10/0.34 inference(definition_unfolding,[],[f31,f29])).
% 0.10/0.34 thf(f29,plain,(
% 0.10/0.34 (emptysetE = $true)),
% 0.10/0.34 inference(cnf_transformation,[],[f17])).
% 0.10/0.34 thf(f31,plain,(
% 0.10/0.34 ( ! [X2 : $i,X3 : $o] : (((in @ X2 @ emptyset) != $true) | ($true = X3) | (emptysetE != $true)) )),
% 0.10/0.34 inference(cnf_transformation,[],[f22])).
% 0.10/0.34 thf(f22,plain,(
% 0.10/0.34 ((emptysetE = $true) | (((in @ sK1 @ emptyset) = $true) & (sK2 != $true))) & (! [X2] : (((in @ X2 @ emptyset) != $true) | ! [X3 : $o] : ($true = X3)) | (emptysetE != $true))),
% 0.10/0.34 inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f19,f21,f20])).
% 0.10/0.34 thf(f20,plain,(
% 0.10/0.34 ? [X0] : (((in @ X0 @ emptyset) = $true) & ? [X1 : $o] : ($true != X1)) => (((in @ sK1 @ emptyset) = $true) & ? [X1 : $o] : ($true != X1))),
% 0.10/0.34 introduced(choice_axiom,[])).
% 0.10/0.34 thf(f21,plain,(
% 0.10/0.34 ? [X1 : $o] : ($true != X1) => (sK2 != $true)),
% 0.10/0.34 introduced(choice_axiom,[])).
% 0.10/0.34 thf(f19,plain,(
% 0.10/0.34 ((emptysetE = $true) | ? [X0] : (((in @ X0 @ emptyset) = $true) & ? [X1 : $o] : ($true != X1))) & (! [X2] : (((in @ X2 @ emptyset) != $true) | ! [X3 : $o] : ($true = X3)) | (emptysetE != $true))),
% 0.10/0.34 inference(rectify,[],[f18])).
% 0.10/0.34 thf(f18,plain,(
% 0.10/0.34 ((emptysetE = $true) | ? [X0] : (((in @ X0 @ emptyset) = $true) & ? [X1 : $o] : ($true != X1))) & (! [X0] : (((in @ X0 @ emptyset) != $true) | ! [X1 : $o] : ($true = X1)) | (emptysetE != $true))),
% 0.10/0.34 inference(nnf_transformation,[],[f15])).
% 0.10/0.34 thf(f15,plain,(
% 0.10/0.34 (emptysetE = $true) <=> ! [X0] : (((in @ X0 @ emptyset) != $true) | ! [X1 : $o] : ($true = X1))),
% 0.10/0.34 inference(ennf_transformation,[],[f9])).
% 0.10/0.34 thf(f9,plain,(
% 0.10/0.34 ! [X0] : (((in @ X0 @ emptyset) = $true) => ! [X1 : $o] : ($true = X1)) <=> (emptysetE = $true)),
% 0.10/0.34 inference(fool_elimination,[],[f8])).
% 0.10/0.34 thf(f8,plain,(
% 0.10/0.34 (! [X0] : ((in @ X0 @ emptyset) => ! [X1 : $o] : X1) = emptysetE)),
% 0.10/0.34 inference(rectify,[],[f1])).
% 0.10/0.34 thf(f1,axiom,(
% 0.10/0.34 (! [X0] : ((in @ X0 @ emptyset) => ! [X1 : $o] : X1) = emptysetE)),
% 0.10/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptysetE)).
% 0.10/0.34 % SZS output end Proof for theBenchmark
% 0.10/0.34 % (26210)------------------------------
% 0.10/0.34 % (26210)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.34 % (26210)Termination reason: Refutation
% 0.10/0.34
% 0.10/0.34 % (26210)Memory used [KB]: 5500
% 0.10/0.34 % (26210)Time elapsed: 0.004 s
% 0.10/0.34 % (26210)Instructions burned: 3 (million)
% 0.10/0.34 % (26210)------------------------------
% 0.10/0.34 % (26210)------------------------------
% 0.10/0.34 % (26204)Success in time 0.005 s
% 0.10/0.34 % Vampire---4.8 exiting
%------------------------------------------------------------------------------