TSTP Solution File: SEU528^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU528^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:23 EDT 2024
% Result : Theorem 0.20s 0.40s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU528^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/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:23:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/0.36 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.20/0.39 % (3972)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.20/0.39 % (3973)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.20/0.39 % (3974)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.39 % (3975)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.20/0.39 % (3971)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.20/0.39 % (3976)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.20/0.39 % (3974)Instruction limit reached!
% 0.20/0.39 % (3974)------------------------------
% 0.20/0.39 % (3974)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39 % (3975)Instruction limit reached!
% 0.20/0.39 % (3975)------------------------------
% 0.20/0.39 % (3975)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39 % (3975)Termination reason: Unknown
% 0.20/0.39 % (3975)Termination phase: Saturation
% 0.20/0.39
% 0.20/0.39 % (3975)Memory used [KB]: 895
% 0.20/0.39 % (3975)Time elapsed: 0.004 s
% 0.20/0.39 % (3975)Instructions burned: 2 (million)
% 0.20/0.39 % (3975)------------------------------
% 0.20/0.39 % (3975)------------------------------
% 0.20/0.39 % (3974)Termination reason: Unknown
% 0.20/0.39 % (3974)Termination phase: Property scanning
% 0.20/0.39
% 0.20/0.39 % (3974)Memory used [KB]: 895
% 0.20/0.39 % (3974)Time elapsed: 0.004 s
% 0.20/0.39 % (3974)Instructions burned: 2 (million)
% 0.20/0.39 % (3974)------------------------------
% 0.20/0.39 % (3974)------------------------------
% 0.20/0.39 % (3976)First to succeed.
% 0.20/0.40 % (3971)Also succeeded, but the first one will report.
% 0.20/0.40 % (3976)Refutation found. Thanks to Tanya!
% 0.20/0.40 % SZS status Theorem for theBenchmark
% 0.20/0.40 % SZS output start Proof for theBenchmark
% 0.20/0.40 thf(func_def_0, type, in: $i > $i > $o).
% 0.20/0.40 thf(func_def_2, type, setadjoin: $i > $i > $i).
% 0.20/0.40 thf(f30,plain,(
% 0.20/0.40 $false),
% 0.20/0.40 inference(subsumption_resolution,[],[f29,f20])).
% 0.20/0.40 thf(f20,plain,(
% 0.20/0.40 (sK1 != sK0)),
% 0.20/0.40 inference(cnf_transformation,[],[f13])).
% 0.20/0.40 thf(f13,plain,(
% 0.20/0.40 ((sK1 != sK0) & ($true = (in @ sK0 @ (setadjoin @ sK1 @ emptyset)))) & (uniqinunit = $true)),
% 0.20/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f10,f12])).
% 0.20/0.40 thf(f12,plain,(
% 0.20/0.40 ? [X0,X1] : ((X0 != X1) & ((in @ X0 @ (setadjoin @ X1 @ emptyset)) = $true)) => ((sK1 != sK0) & ($true = (in @ sK0 @ (setadjoin @ sK1 @ emptyset))))),
% 0.20/0.40 introduced(choice_axiom,[])).
% 0.20/0.40 thf(f10,plain,(
% 0.20/0.40 ? [X0,X1] : ((X0 != X1) & ((in @ X0 @ (setadjoin @ X1 @ emptyset)) = $true)) & (uniqinunit = $true)),
% 0.20/0.40 inference(ennf_transformation,[],[f9])).
% 0.20/0.40 thf(f9,plain,(
% 0.20/0.40 ~((uniqinunit = $true) => ! [X0,X1] : ((X0 != X1) => ((in @ X0 @ (setadjoin @ X1 @ emptyset)) != $true)))),
% 0.20/0.40 inference(flattening,[],[f8])).
% 0.20/0.40 thf(f8,plain,(
% 0.20/0.40 ~((uniqinunit = $true) => ! [X0,X1] : ((X0 != X1) => ~((in @ X0 @ (setadjoin @ X1 @ emptyset)) = $true)))),
% 0.20/0.40 inference(fool_elimination,[],[f7])).
% 0.20/0.40 thf(f7,plain,(
% 0.20/0.40 ~(uniqinunit => ! [X0,X1] : ((X0 != X1) => ~(in @ X0 @ (setadjoin @ X1 @ emptyset))))),
% 0.20/0.40 inference(rectify,[],[f3])).
% 0.20/0.40 thf(f3,negated_conjecture,(
% 0.20/0.40 ~(uniqinunit => ! [X1,X0] : ((X0 != X1) => ~(in @ X1 @ (setadjoin @ X0 @ emptyset))))),
% 0.20/0.40 inference(negated_conjecture,[],[f2])).
% 0.20/0.40 thf(f2,conjecture,(
% 0.20/0.40 uniqinunit => ! [X1,X0] : ((X0 != X1) => ~(in @ X1 @ (setadjoin @ X0 @ emptyset)))),
% 0.20/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',notinsingleton)).
% 0.20/0.40 thf(f29,plain,(
% 0.20/0.40 (sK1 = sK0)),
% 0.20/0.40 inference(trivial_inequality_removal,[],[f28])).
% 0.20/0.40 thf(f28,plain,(
% 0.20/0.40 (sK1 = sK0) | ($true != $true)),
% 0.20/0.40 inference(superposition,[],[f27,f19])).
% 0.20/0.40 thf(f19,plain,(
% 0.20/0.40 ($true = (in @ sK0 @ (setadjoin @ sK1 @ emptyset)))),
% 0.20/0.40 inference(cnf_transformation,[],[f13])).
% 0.20/0.40 thf(f27,plain,(
% 0.20/0.40 ( ! [X2 : $i,X3 : $i] : (((in @ X2 @ (setadjoin @ X3 @ emptyset)) != $true) | (X2 = X3)) )),
% 0.20/0.40 inference(trivial_inequality_removal,[],[f26])).
% 0.20/0.40 thf(f26,plain,(
% 0.20/0.40 ( ! [X2 : $i,X3 : $i] : ((X2 = X3) | ((in @ X2 @ (setadjoin @ X3 @ emptyset)) != $true) | ($true != $true)) )),
% 0.20/0.40 inference(definition_unfolding,[],[f21,f18])).
% 0.20/0.40 thf(f18,plain,(
% 0.20/0.40 (uniqinunit = $true)),
% 0.20/0.40 inference(cnf_transformation,[],[f13])).
% 0.20/0.40 thf(f21,plain,(
% 0.20/0.40 ( ! [X2 : $i,X3 : $i] : (((in @ X2 @ (setadjoin @ X3 @ emptyset)) != $true) | (X2 = X3) | (uniqinunit != $true)) )),
% 0.20/0.40 inference(cnf_transformation,[],[f17])).
% 0.20/0.40 thf(f17,plain,(
% 0.20/0.40 ((uniqinunit = $true) | (($true = (in @ sK2 @ (setadjoin @ sK3 @ emptyset))) & (sK3 != sK2))) & (! [X2,X3] : (((in @ X2 @ (setadjoin @ X3 @ emptyset)) != $true) | (X2 = X3)) | (uniqinunit != $true))),
% 0.20/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f15,f16])).
% 0.20/0.40 thf(f16,plain,(
% 0.20/0.40 ? [X0,X1] : (((in @ X0 @ (setadjoin @ X1 @ emptyset)) = $true) & (X0 != X1)) => (($true = (in @ sK2 @ (setadjoin @ sK3 @ emptyset))) & (sK3 != sK2))),
% 0.20/0.40 introduced(choice_axiom,[])).
% 0.20/0.40 thf(f15,plain,(
% 0.20/0.40 ((uniqinunit = $true) | ? [X0,X1] : (((in @ X0 @ (setadjoin @ X1 @ emptyset)) = $true) & (X0 != X1))) & (! [X2,X3] : (((in @ X2 @ (setadjoin @ X3 @ emptyset)) != $true) | (X2 = X3)) | (uniqinunit != $true))),
% 0.20/0.40 inference(rectify,[],[f14])).
% 0.20/0.40 thf(f14,plain,(
% 0.20/0.40 ((uniqinunit = $true) | ? [X0,X1] : (((in @ X0 @ (setadjoin @ X1 @ emptyset)) = $true) & (X0 != X1))) & (! [X0,X1] : (((in @ X0 @ (setadjoin @ X1 @ emptyset)) != $true) | (X0 = X1)) | (uniqinunit != $true))),
% 0.20/0.40 inference(nnf_transformation,[],[f11])).
% 0.20/0.40 thf(f11,plain,(
% 0.20/0.40 (uniqinunit = $true) <=> ! [X0,X1] : (((in @ X0 @ (setadjoin @ X1 @ emptyset)) != $true) | (X0 = X1))),
% 0.20/0.40 inference(ennf_transformation,[],[f6])).
% 0.20/0.40 thf(f6,plain,(
% 0.20/0.40 (uniqinunit = $true) <=> ! [X0,X1] : (((in @ X0 @ (setadjoin @ X1 @ emptyset)) = $true) => (X0 = X1))),
% 0.20/0.40 inference(fool_elimination,[],[f5])).
% 0.20/0.40 thf(f5,plain,(
% 0.20/0.40 (uniqinunit = ! [X0,X1] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1)))),
% 0.20/0.40 inference(rectify,[],[f1])).
% 0.20/0.40 thf(f1,axiom,(
% 0.20/0.40 (uniqinunit = ! [X0,X1] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1)))),
% 0.20/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',uniqinunit)).
% 0.20/0.40 % SZS output end Proof for theBenchmark
% 0.20/0.40 % (3976)------------------------------
% 0.20/0.40 % (3976)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40 % (3976)Termination reason: Refutation
% 0.20/0.40
% 0.20/0.40 % (3976)Memory used [KB]: 5500
% 0.20/0.40 % (3976)Time elapsed: 0.006 s
% 0.20/0.40 % (3976)Instructions burned: 2 (million)
% 0.20/0.40 % (3976)------------------------------
% 0.20/0.40 % (3976)------------------------------
% 0.20/0.40 % (3970)Success in time 0.03 s
% 0.20/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------