TSTP Solution File: SEU515^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU515^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 : n028.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:16 EDT 2024
% Result : Theorem 0.16s 0.39s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU515^2 : TPTP v8.2.0. Released v3.7.0.
% 0.08/0.15 % 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.16/0.36 % Computer : n028.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Sun May 19 17:15:38 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a TH0_THM_EQU_NAR problem
% 0.16/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/sandbox/benchmark/theBenchmark.p
% 0.16/0.39 % (20375)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.16/0.39 % (20379)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.16/0.39 % (20377)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.16/0.39 % (20379)Instruction limit reached!
% 0.16/0.39 % (20379)------------------------------
% 0.16/0.39 % (20379)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.39 % (20379)Termination reason: Unknown
% 0.16/0.39 % (20379)Termination phase: Saturation
% 0.16/0.39
% 0.16/0.39 % (20379)Memory used [KB]: 5373
% 0.16/0.39 % (20382)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.16/0.39 % (20379)Time elapsed: 0.004 s
% 0.16/0.39 % (20381)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.16/0.39 % (20379)Instructions burned: 2 (million)
% 0.16/0.39 % (20379)------------------------------
% 0.16/0.39 % (20379)------------------------------
% 0.16/0.39 % (20376)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.16/0.39 % (20377)First to succeed.
% 0.16/0.39 % (20382)Instruction limit reached!
% 0.16/0.39 % (20382)------------------------------
% 0.16/0.39 % (20382)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.39 % (20382)Termination reason: Unknown
% 0.16/0.39 % (20382)Termination phase: Saturation
% 0.16/0.39
% 0.16/0.39 % (20382)Memory used [KB]: 5500
% 0.16/0.39 % (20382)Time elapsed: 0.004 s
% 0.16/0.39 % (20382)Instructions burned: 3 (million)
% 0.16/0.39 % (20382)------------------------------
% 0.16/0.39 % (20382)------------------------------
% 0.16/0.39 % (20378)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.16/0.39 % (20375)Also succeeded, but the first one will report.
% 0.16/0.39 % (20376)Instruction limit reached!
% 0.16/0.39 % (20376)------------------------------
% 0.16/0.39 % (20376)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.39 % (20376)Termination reason: Unknown
% 0.16/0.39 % (20376)Termination phase: Saturation
% 0.16/0.39
% 0.16/0.39 % (20376)Memory used [KB]: 5500
% 0.16/0.39 % (20376)Time elapsed: 0.005 s
% 0.16/0.39 % (20376)Instructions burned: 4 (million)
% 0.16/0.39 % (20378)Instruction limit reached!
% 0.16/0.39 % (20378)------------------------------
% 0.16/0.39 % (20378)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.39 % (20378)Termination reason: Unknown
% 0.16/0.39 % (20378)Termination phase: Saturation
% 0.16/0.39
% 0.16/0.39 % (20378)Memory used [KB]: 895
% 0.16/0.39 % (20378)Time elapsed: 0.005 s
% 0.16/0.39 % (20378)Instructions burned: 2 (million)
% 0.16/0.39 % (20378)------------------------------
% 0.16/0.39 % (20378)------------------------------
% 0.16/0.39 % (20376)------------------------------
% 0.16/0.39 % (20376)------------------------------
% 0.16/0.39 % (20377)Refutation found. Thanks to Tanya!
% 0.16/0.39 % SZS status Theorem for theBenchmark
% 0.16/0.39 % SZS output start Proof for theBenchmark
% 0.16/0.39 thf(func_def_0, type, in: $i > $i > $o).
% 0.16/0.39 thf(func_def_1, type, setadjoin: $i > $i > $i).
% 0.16/0.39 thf(func_def_4, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.16/0.39 thf(f58,plain,(
% 0.16/0.39 $false),
% 0.16/0.39 inference(avatar_sat_refutation,[],[f43,f48,f49,f57])).
% 0.16/0.39 thf(f57,plain,(
% 0.16/0.39 spl4_3 | spl4_1),
% 0.16/0.39 inference(avatar_split_clause,[],[f54,f36,f45])).
% 0.16/0.39 thf(f45,plain,(
% 0.16/0.39 spl4_3 <=> (sK2 = sK1)),
% 0.16/0.39 introduced(avatar_definition,[new_symbols(naming,[spl4_3])])).
% 0.16/0.39 thf(f36,plain,(
% 0.16/0.39 spl4_1 <=> ((in @ sK2 @ sK0) = $true)),
% 0.16/0.39 introduced(avatar_definition,[new_symbols(naming,[spl4_1])])).
% 0.16/0.39 thf(f54,plain,(
% 0.16/0.39 (sK2 = sK1) | ((in @ sK2 @ sK0) = $true)),
% 0.16/0.39 inference(trivial_inequality_removal,[],[f52])).
% 0.16/0.39 thf(f52,plain,(
% 0.16/0.39 ((in @ sK2 @ sK0) = $true) | ($true = $false) | (sK2 = sK1)),
% 0.16/0.39 inference(superposition,[],[f16,f34])).
% 0.16/0.39 thf(f34,plain,(
% 0.16/0.39 ( ! [X2 : $i,X3 : $i,X1 : $i] : (((in @ X1 @ (setadjoin @ X3 @ X2)) = $false) | ($true = (in @ X1 @ X2)) | (X1 = X3)) )),
% 0.16/0.39 inference(equality_proxy_clausification,[],[f33])).
% 0.16/0.39 thf(f33,plain,(
% 0.16/0.39 ( ! [X2 : $i,X3 : $i,X1 : $i] : (((in @ X1 @ (setadjoin @ X3 @ X2)) = $false) | ((X3 = X1) = $true) | ($true = (in @ X1 @ X2))) )),
% 0.16/0.39 inference(binary_proxy_clausification,[],[f28])).
% 0.16/0.39 thf(f28,plain,(
% 0.16/0.39 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((in @ X1 @ X2) | (X3 = X1)) = $true) | ((in @ X1 @ (setadjoin @ X3 @ X2)) = $false)) )),
% 0.16/0.39 inference(binary_proxy_clausification,[],[f27])).
% 0.16/0.39 thf(f27,plain,(
% 0.16/0.39 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((in @ X1 @ X2) | (X3 = X1)) = (in @ X1 @ (setadjoin @ X3 @ X2)))) )),
% 0.16/0.39 inference(binary_proxy_clausification,[],[f26])).
% 0.16/0.39 thf(f26,plain,(
% 0.16/0.39 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = ((in @ X1 @ (setadjoin @ X3 @ X2)) = ((in @ X1 @ X2) | (X3 = X1))))) )),
% 0.16/0.39 inference(beta_eta_normalization,[],[f25])).
% 0.16/0.39 thf(f25,plain,(
% 0.16/0.39 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((^[Y0 : $i]: ((in @ X1 @ (setadjoin @ Y0 @ X2)) = ((in @ X1 @ X2) | (Y0 = X1)))) @ X3) = $true)) )),
% 0.16/0.39 inference(pi_clausification,[],[f24])).
% 0.16/0.39 thf(f24,plain,(
% 0.16/0.39 ( ! [X2 : $i,X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((in @ X1 @ (setadjoin @ Y0 @ X2)) = ((in @ X1 @ X2) | (Y0 = X1))))))) )),
% 0.16/0.39 inference(beta_eta_normalization,[],[f23])).
% 0.16/0.39 thf(f23,plain,(
% 0.16/0.39 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ (setadjoin @ Y1 @ Y0)) = ((in @ X1 @ Y0) | (Y1 = X1)))))) @ X2))) )),
% 0.16/0.39 inference(pi_clausification,[],[f22])).
% 0.16/0.39 thf(f22,plain,(
% 0.16/0.39 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ (setadjoin @ Y1 @ Y0)) = ((in @ X1 @ Y0) | (Y1 = X1))))))) = $true)) )),
% 0.16/0.39 inference(beta_eta_normalization,[],[f21])).
% 0.16/0.39 thf(f21,plain,(
% 0.16/0.39 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (setadjoin @ Y2 @ Y1)) = ((in @ Y0 @ Y1) | (Y2 = Y0)))))))) @ X1))) )),
% 0.16/0.39 inference(pi_clausification,[],[f20])).
% 0.16/0.39 thf(f20,plain,(
% 0.16/0.39 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (setadjoin @ Y2 @ Y1)) = ((in @ Y0 @ Y1) | (Y2 = Y0))))))))))),
% 0.16/0.39 inference(definition_unfolding,[],[f15,f14])).
% 0.16/0.39 thf(f14,plain,(
% 0.16/0.39 (setadjoinAx = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (setadjoin @ Y2 @ Y1)) = ((in @ Y0 @ Y1) | (Y2 = Y0))))))))))),
% 0.16/0.39 inference(cnf_transformation,[],[f6])).
% 0.16/0.39 thf(f6,plain,(
% 0.16/0.39 (setadjoinAx = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (setadjoin @ Y2 @ Y1)) = ((in @ Y0 @ Y1) | (Y2 = Y0))))))))))),
% 0.16/0.39 inference(fool_elimination,[],[f5])).
% 0.16/0.39 thf(f5,plain,(
% 0.16/0.39 (! [X0,X1,X2] : ((in @ X2 @ (setadjoin @ X0 @ X1)) <=> ((X0 = X2) | (in @ X2 @ X1))) = setadjoinAx)),
% 0.16/0.39 inference(rectify,[],[f1])).
% 0.16/0.39 thf(f1,axiom,(
% 0.16/0.39 (! [X0,X1,X2] : ((in @ X2 @ (setadjoin @ X0 @ X1)) <=> ((X0 = X2) | (in @ X2 @ X1))) = setadjoinAx)),
% 0.16/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinAx)).
% 0.16/0.39 thf(f15,plain,(
% 0.16/0.39 (setadjoinAx = $true)),
% 0.16/0.39 inference(cnf_transformation,[],[f13])).
% 0.16/0.39 thf(f13,plain,(
% 0.16/0.39 (((($true = sK3) | (sK2 != sK1)) & ($true != sK3) & (($true = sK3) | ((in @ sK2 @ sK0) != $true))) & ($true = (in @ sK2 @ (setadjoin @ sK1 @ sK0)))) & (setadjoinAx = $true)),
% 0.16/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f10,f12,f11])).
% 0.16/0.39 thf(f11,plain,(
% 0.16/0.39 ? [X0,X1,X2] : (? [X3 : $o] : ((($true = X3) | (X1 != X2)) & ($true != X3) & (($true = X3) | ($true != (in @ X2 @ X0)))) & ($true = (in @ X2 @ (setadjoin @ X1 @ X0)))) => (? [X3 : $o] : ((($true = X3) | (sK2 != sK1)) & ($true != X3) & (($true = X3) | ((in @ sK2 @ sK0) != $true))) & ($true = (in @ sK2 @ (setadjoin @ sK1 @ sK0))))),
% 0.16/0.39 introduced(choice_axiom,[])).
% 0.16/0.39 thf(f12,plain,(
% 0.16/0.39 ? [X3 : $o] : ((($true = X3) | (sK2 != sK1)) & ($true != X3) & (($true = X3) | ((in @ sK2 @ sK0) != $true))) => ((($true = sK3) | (sK2 != sK1)) & ($true != sK3) & (($true = sK3) | ((in @ sK2 @ sK0) != $true)))),
% 0.16/0.39 introduced(choice_axiom,[])).
% 0.16/0.39 thf(f10,plain,(
% 0.16/0.39 ? [X0,X1,X2] : (? [X3 : $o] : ((($true = X3) | (X1 != X2)) & ($true != X3) & (($true = X3) | ($true != (in @ X2 @ X0)))) & ($true = (in @ X2 @ (setadjoin @ X1 @ X0)))) & (setadjoinAx = $true)),
% 0.16/0.39 inference(flattening,[],[f9])).
% 0.16/0.39 thf(f9,plain,(
% 0.16/0.39 ? [X0,X1,X2] : (? [X3 : $o] : ((($true != X3) & (($true = X3) | ($true != (in @ X2 @ X0)))) & (($true = X3) | (X1 != X2))) & ($true = (in @ X2 @ (setadjoin @ X1 @ X0)))) & (setadjoinAx = $true)),
% 0.16/0.39 inference(ennf_transformation,[],[f8])).
% 0.16/0.39 thf(f8,plain,(
% 0.16/0.39 ~((setadjoinAx = $true) => ! [X0,X1,X2] : (($true = (in @ X2 @ (setadjoin @ X1 @ X0))) => ! [X3 : $o] : (((X1 = X2) => ($true = X3)) => ((($true = (in @ X2 @ X0)) => ($true = X3)) => ($true = X3)))))),
% 0.16/0.39 inference(fool_elimination,[],[f7])).
% 0.16/0.39 thf(f7,plain,(
% 0.16/0.39 ~(setadjoinAx => ! [X0,X1,X2] : ((in @ X2 @ (setadjoin @ X1 @ X0)) => ! [X3 : $o] : (((X1 = X2) => X3) => (((in @ X2 @ X0) => X3) => X3))))),
% 0.16/0.39 inference(rectify,[],[f3])).
% 0.16/0.39 thf(f3,negated_conjecture,(
% 0.16/0.39 ~(setadjoinAx => ! [X1,X0,X2] : ((in @ X2 @ (setadjoin @ X0 @ X1)) => ! [X3 : $o] : (((X0 = X2) => X3) => (((in @ X2 @ X1) => X3) => X3))))),
% 0.16/0.39 inference(negated_conjecture,[],[f2])).
% 0.16/0.39 thf(f2,conjecture,(
% 0.16/0.39 setadjoinAx => ! [X1,X0,X2] : ((in @ X2 @ (setadjoin @ X0 @ X1)) => ! [X3 : $o] : (((X0 = X2) => X3) => (((in @ X2 @ X1) => X3) => X3)))),
% 0.16/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinE)).
% 0.16/0.39 thf(f16,plain,(
% 0.16/0.39 ($true = (in @ sK2 @ (setadjoin @ sK1 @ sK0)))),
% 0.16/0.39 inference(cnf_transformation,[],[f13])).
% 0.16/0.39 thf(f49,plain,(
% 0.16/0.39 ~spl4_2),
% 0.16/0.39 inference(avatar_split_clause,[],[f18,f40])).
% 0.16/0.39 thf(f40,plain,(
% 0.16/0.39 spl4_2 <=> ($true = sK3)),
% 0.16/0.39 introduced(avatar_definition,[new_symbols(naming,[spl4_2])])).
% 0.16/0.39 thf(f18,plain,(
% 0.16/0.39 ($true != sK3)),
% 0.16/0.39 inference(cnf_transformation,[],[f13])).
% 0.16/0.39 thf(f48,plain,(
% 0.16/0.39 spl4_2 | ~spl4_3),
% 0.16/0.39 inference(avatar_split_clause,[],[f19,f45,f40])).
% 0.16/0.39 thf(f19,plain,(
% 0.16/0.39 (sK2 != sK1) | ($true = sK3)),
% 0.16/0.39 inference(cnf_transformation,[],[f13])).
% 0.16/0.39 thf(f43,plain,(
% 0.16/0.39 ~spl4_1 | spl4_2),
% 0.16/0.39 inference(avatar_split_clause,[],[f17,f40,f36])).
% 0.16/0.39 thf(f17,plain,(
% 0.16/0.39 ((in @ sK2 @ sK0) != $true) | ($true = sK3)),
% 0.16/0.39 inference(cnf_transformation,[],[f13])).
% 0.16/0.39 % SZS output end Proof for theBenchmark
% 0.16/0.39 % (20377)------------------------------
% 0.16/0.39 % (20377)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.39 % (20377)Termination reason: Refutation
% 0.16/0.39
% 0.16/0.39 % (20377)Memory used [KB]: 5500
% 0.16/0.39 % (20377)Time elapsed: 0.007 s
% 0.16/0.39 % (20377)Instructions burned: 4 (million)
% 0.16/0.39 % (20377)------------------------------
% 0.16/0.39 % (20377)------------------------------
% 0.16/0.39 % (20374)Success in time 0.011 s
% 0.16/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------