TSTP Solution File: SEU511^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU511^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 : n007.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:15 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU511^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.13 % 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.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 16:02:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH0_THM_EQU_NAR problem
% 0.13/0.34 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.13/0.36 % (20498)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.13/0.36 % (20497)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.13/0.36 % (20499)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.13/0.36 % (20500)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.13/0.36 % (20496)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.13/0.36 % (20493)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.13/0.36 % (20497)Instruction limit reached!
% 0.13/0.36 % (20497)------------------------------
% 0.13/0.36 % (20497)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (20497)Termination reason: Unknown
% 0.13/0.36 % (20497)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (20497)Memory used [KB]: 5500
% 0.13/0.36 % (20497)Time elapsed: 0.003 s
% 0.13/0.36 % (20497)Instructions burned: 2 (million)
% 0.13/0.36 % (20497)------------------------------
% 0.13/0.36 % (20497)------------------------------
% 0.13/0.36 % (20498)Refutation not found, incomplete strategy
% 0.13/0.36 % (20498)------------------------------
% 0.13/0.36 % (20498)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (20498)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.36
% 0.13/0.36
% 0.13/0.36 % (20498)Memory used [KB]: 5500
% 0.13/0.36 % (20498)Time elapsed: 0.003 s
% 0.13/0.36 % (20500)Refutation not found, incomplete strategy
% 0.13/0.36 % (20500)------------------------------
% 0.13/0.36 % (20500)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (20500)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.36
% 0.13/0.36
% 0.13/0.36 % (20500)Memory used [KB]: 5500
% 0.13/0.36 % (20500)Time elapsed: 0.003 s
% 0.13/0.36 % (20500)Instructions burned: 2 (million)
% 0.13/0.36 % (20500)------------------------------
% 0.13/0.36 % (20500)------------------------------
% 0.13/0.36 % (20498)Instructions burned: 2 (million)
% 0.13/0.36 % (20498)------------------------------
% 0.13/0.36 % (20498)------------------------------
% 0.13/0.36 % (20495)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.13/0.36 % (20494)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.13/0.36 % (20499)First to succeed.
% 0.13/0.36 % (20496)Instruction limit reached!
% 0.13/0.36 % (20496)------------------------------
% 0.13/0.36 % (20496)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (20496)Termination reason: Unknown
% 0.13/0.36 % (20496)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (20496)Memory used [KB]: 5500
% 0.13/0.36 % (20496)Time elapsed: 0.003 s
% 0.13/0.36 % (20496)Instructions burned: 2 (million)
% 0.13/0.36 % (20496)------------------------------
% 0.13/0.36 % (20496)------------------------------
% 0.13/0.36 % (20493)Also succeeded, but the first one will report.
% 0.13/0.37 % (20499)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% 0.13/0.37 thf(func_def_0, type, in: $i > $i > $o).
% 0.13/0.37 thf(func_def_4, type, nonempty: $i > $o).
% 0.13/0.37 thf(f53,plain,(
% 0.13/0.37 $false),
% 0.13/0.37 inference(avatar_sat_refutation,[],[f42,f49,f52])).
% 0.13/0.37 thf(f52,plain,(
% 0.13/0.37 ~spl4_1),
% 0.13/0.37 inference(avatar_contradiction_clause,[],[f51])).
% 0.13/0.37 thf(f51,plain,(
% 0.13/0.37 $false | ~spl4_1),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f50])).
% 0.13/0.37 thf(f50,plain,(
% 0.13/0.37 ($true != $true) | ~spl4_1),
% 0.13/0.37 inference(superposition,[],[f38,f43])).
% 0.13/0.37 thf(f43,plain,(
% 0.13/0.37 ($true = (in @ sK3 @ emptyset))),
% 0.13/0.37 inference(forward_demodulation,[],[f24,f35])).
% 0.13/0.37 thf(f35,plain,(
% 0.13/0.37 (emptyset = sK2)),
% 0.13/0.37 inference(equality_proxy_clausification,[],[f34])).
% 0.13/0.37 thf(f34,plain,(
% 0.13/0.37 ((emptyset = sK2) = $true)),
% 0.13/0.37 inference(not_proxy_clausification,[],[f33])).
% 0.13/0.37 thf(f33,plain,(
% 0.13/0.37 ((~ (emptyset = sK2)) != $true)),
% 0.13/0.37 inference(beta_eta_normalization,[],[f31])).
% 0.13/0.37 thf(f31,plain,(
% 0.13/0.37 (((^[Y0 : $i]: (~ (emptyset = Y0))) @ sK2) != $true)),
% 0.13/0.37 inference(definition_unfolding,[],[f25,f27])).
% 0.13/0.37 thf(f27,plain,(
% 0.13/0.37 (nonempty = (^[Y0 : $i]: (~ (emptyset = Y0))))),
% 0.13/0.37 inference(cnf_transformation,[],[f10])).
% 0.13/0.37 thf(f10,plain,(
% 0.13/0.37 (nonempty = (^[Y0 : $i]: (~ (emptyset = Y0))))),
% 0.13/0.37 inference(fool_elimination,[],[f2])).
% 0.13/0.37 thf(f2,axiom,(
% 0.13/0.37 ((^[X0 : $i] : ((emptyset != X0))) = nonempty)),
% 0.13/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nonempty)).
% 0.13/0.37 thf(f25,plain,(
% 0.13/0.37 ((nonempty @ sK2) != $true)),
% 0.13/0.37 inference(cnf_transformation,[],[f20])).
% 0.13/0.37 thf(f20,plain,(
% 0.13/0.37 (emptysetE = $true) & (((nonempty @ sK2) != $true) & ((in @ sK3 @ sK2) = $true))),
% 0.13/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f11,f19,f18])).
% 0.13/0.37 thf(f18,plain,(
% 0.13/0.37 ? [X0] : (((nonempty @ X0) != $true) & ? [X1] : ((in @ X1 @ X0) = $true)) => (((nonempty @ sK2) != $true) & ? [X1] : ((in @ X1 @ sK2) = $true))),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f19,plain,(
% 0.13/0.37 ? [X1] : ((in @ X1 @ sK2) = $true) => ((in @ sK3 @ sK2) = $true)),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f11,plain,(
% 0.13/0.37 (emptysetE = $true) & ? [X0] : (((nonempty @ X0) != $true) & ? [X1] : ((in @ X1 @ X0) = $true))),
% 0.13/0.37 inference(ennf_transformation,[],[f9])).
% 0.13/0.37 thf(f9,plain,(
% 0.13/0.37 ~((emptysetE = $true) => ! [X0] : (? [X1] : ((in @ X1 @ X0) = $true) => ((nonempty @ X0) = $true)))),
% 0.13/0.37 inference(fool_elimination,[],[f8])).
% 0.13/0.37 thf(f8,plain,(
% 0.13/0.37 ~(emptysetE => ! [X0] : (? [X1] : (in @ X1 @ X0) => (nonempty @ X0)))),
% 0.13/0.37 inference(rectify,[],[f4])).
% 0.13/0.37 thf(f4,negated_conjecture,(
% 0.13/0.37 ~(emptysetE => ! [X2] : (? [X0] : (in @ X0 @ X2) => (nonempty @ X2)))),
% 0.13/0.37 inference(negated_conjecture,[],[f3])).
% 0.13/0.37 thf(f3,conjecture,(
% 0.13/0.37 emptysetE => ! [X2] : (? [X0] : (in @ X0 @ X2) => (nonempty @ X2))),
% 0.13/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nonemptyI1)).
% 0.13/0.37 thf(f24,plain,(
% 0.13/0.37 ((in @ sK3 @ sK2) = $true)),
% 0.13/0.37 inference(cnf_transformation,[],[f20])).
% 0.13/0.37 thf(f38,plain,(
% 0.13/0.37 ( ! [X2 : $i] : (($true != (in @ X2 @ emptyset))) ) | ~spl4_1),
% 0.13/0.37 inference(avatar_component_clause,[],[f37])).
% 0.13/0.37 thf(f37,plain,(
% 0.13/0.37 spl4_1 <=> ! [X2] : ($true != (in @ X2 @ emptyset))),
% 0.13/0.37 introduced(avatar_definition,[new_symbols(naming,[spl4_1])])).
% 0.13/0.37 thf(f49,plain,(
% 0.13/0.37 ~spl4_2),
% 0.13/0.37 inference(avatar_contradiction_clause,[],[f48])).
% 0.13/0.37 thf(f48,plain,(
% 0.13/0.37 $false | ~spl4_2),
% 0.13/0.37 inference(equality_resolution,[],[f47])).
% 0.13/0.37 thf(f47,plain,(
% 0.13/0.37 ( ! [X0 : $o] : (($false != X0)) ) | ~spl4_2),
% 0.13/0.37 inference(superposition,[],[f5,f41])).
% 0.13/0.37 thf(f41,plain,(
% 0.13/0.37 ( ! [X3 : $o] : (($true = X3)) ) | ~spl4_2),
% 0.13/0.37 inference(avatar_component_clause,[],[f40])).
% 0.13/0.37 thf(f40,plain,(
% 0.13/0.37 spl4_2 <=> ! [X3 : $o] : ($true = X3)),
% 0.13/0.37 introduced(avatar_definition,[new_symbols(naming,[spl4_2])])).
% 0.13/0.37 thf(f5,plain,(
% 0.13/0.37 ($false != $true)),
% 0.13/0.37 introduced(fool_axiom,[])).
% 0.13/0.37 thf(f42,plain,(
% 0.13/0.37 spl4_1 | spl4_2),
% 0.13/0.37 inference(avatar_split_clause,[],[f32,f40,f37])).
% 0.13/0.37 thf(f32,plain,(
% 0.13/0.37 ( ! [X2 : $i,X3 : $o] : (($true = X3) | ($true != (in @ X2 @ emptyset))) )),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f30])).
% 0.13/0.37 thf(f30,plain,(
% 0.13/0.37 ( ! [X2 : $i,X3 : $o] : (($true != (in @ X2 @ emptyset)) | ($true = X3) | ($true != $true)) )),
% 0.13/0.37 inference(definition_unfolding,[],[f21,f26])).
% 0.13/0.37 thf(f26,plain,(
% 0.13/0.37 (emptysetE = $true)),
% 0.13/0.37 inference(cnf_transformation,[],[f20])).
% 0.13/0.37 thf(f21,plain,(
% 0.13/0.37 ( ! [X2 : $i,X3 : $o] : (($true = X3) | ($true != (in @ X2 @ emptyset)) | (emptysetE != $true)) )),
% 0.13/0.37 inference(cnf_transformation,[],[f17])).
% 0.13/0.37 thf(f17,plain,(
% 0.13/0.37 ((emptysetE = $true) | ((sK1 != $true) & ((in @ sK0 @ emptyset) = $true))) & (! [X2] : (! [X3 : $o] : ($true = X3) | ($true != (in @ X2 @ emptyset))) | (emptysetE != $true))),
% 0.13/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f14,f16,f15])).
% 0.13/0.37 thf(f15,plain,(
% 0.13/0.37 ? [X0] : (? [X1 : $o] : ($true != X1) & ((in @ X0 @ emptyset) = $true)) => (? [X1 : $o] : ($true != X1) & ((in @ sK0 @ emptyset) = $true))),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f16,plain,(
% 0.13/0.37 ? [X1 : $o] : ($true != X1) => (sK1 != $true)),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f14,plain,(
% 0.13/0.37 ((emptysetE = $true) | ? [X0] : (? [X1 : $o] : ($true != X1) & ((in @ X0 @ emptyset) = $true))) & (! [X2] : (! [X3 : $o] : ($true = X3) | ($true != (in @ X2 @ emptyset))) | (emptysetE != $true))),
% 0.13/0.37 inference(rectify,[],[f13])).
% 0.13/0.37 thf(f13,plain,(
% 0.13/0.37 ((emptysetE = $true) | ? [X0] : (? [X1 : $o] : ($true != X1) & ((in @ X0 @ emptyset) = $true))) & (! [X0] : (! [X1 : $o] : ($true = X1) | ((in @ X0 @ emptyset) != $true)) | (emptysetE != $true))),
% 0.13/0.37 inference(nnf_transformation,[],[f12])).
% 0.13/0.37 thf(f12,plain,(
% 0.13/0.37 (emptysetE = $true) <=> ! [X0] : (! [X1 : $o] : ($true = X1) | ((in @ X0 @ emptyset) != $true))),
% 0.13/0.37 inference(ennf_transformation,[],[f7])).
% 0.13/0.37 thf(f7,plain,(
% 0.13/0.37 ! [X0] : (((in @ X0 @ emptyset) = $true) => ! [X1 : $o] : ($true = X1)) <=> (emptysetE = $true)),
% 0.13/0.37 inference(fool_elimination,[],[f6])).
% 0.13/0.37 thf(f6,plain,(
% 0.13/0.37 (emptysetE = ! [X0] : ((in @ X0 @ emptyset) => ! [X1 : $o] : X1))),
% 0.13/0.37 inference(rectify,[],[f1])).
% 0.13/0.37 thf(f1,axiom,(
% 0.13/0.37 (emptysetE = ! [X0] : ((in @ X0 @ emptyset) => ! [X1 : $o] : X1))),
% 0.13/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptysetE)).
% 0.13/0.37 % SZS output end Proof for theBenchmark
% 0.13/0.37 % (20499)------------------------------
% 0.13/0.37 % (20499)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (20499)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (20499)Memory used [KB]: 5500
% 0.13/0.37 % (20499)Time elapsed: 0.004 s
% 0.13/0.37 % (20499)Instructions burned: 2 (million)
% 0.13/0.37 % (20499)------------------------------
% 0.13/0.37 % (20499)------------------------------
% 0.13/0.37 % (20492)Success in time 0.015 s
% 0.13/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------