TSTP Solution File: SEU618^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU618^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 : n020.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:50:01 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.00/0.12 % Problem : SEU618^2 : TPTP v8.2.0. Released v3.7.0.
% 0.12/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.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 17:08:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_EQU_NAR problem
% 0.13/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.13/0.37 % (25271)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.37 % (25271)Instruction limit reached!
% 0.13/0.37 % (25271)------------------------------
% 0.13/0.37 % (25271)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (25271)Termination reason: Unknown
% 0.13/0.37 % (25271)Termination phase: Property scanning
% 0.13/0.37
% 0.13/0.37 % (25271)Memory used [KB]: 895
% 0.13/0.37 % (25271)Time elapsed: 0.002 s
% 0.13/0.37 % (25271)Instructions burned: 2 (million)
% 0.13/0.37 % (25271)------------------------------
% 0.13/0.37 % (25271)------------------------------
% 0.13/0.37 % (25268)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.13/0.37 % (25269)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.13/0.37 % (25272)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.13/0.37 % (25273)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.13/0.37 % (25274)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.37 % (25270)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.13/0.37 % (25275)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.13/0.37 % (25272)Instruction limit reached!
% 0.13/0.37 % (25272)------------------------------
% 0.13/0.37 % (25272)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (25272)Termination reason: Unknown
% 0.13/0.37 % (25272)Termination phase: Property scanning
% 0.13/0.37
% 0.13/0.37 % (25272)Memory used [KB]: 895
% 0.13/0.37 % (25272)Time elapsed: 0.003 s
% 0.13/0.37 % (25272)Instructions burned: 2 (million)
% 0.13/0.37 % (25272)------------------------------
% 0.13/0.37 % (25272)------------------------------
% 0.13/0.37 % (25275)Instruction limit reached!
% 0.13/0.37 % (25275)------------------------------
% 0.13/0.37 % (25275)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (25275)Termination reason: Unknown
% 0.13/0.37 % (25275)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (25275)Memory used [KB]: 5500
% 0.13/0.37 % (25275)Time elapsed: 0.004 s
% 0.13/0.37 % (25275)Instructions burned: 3 (million)
% 0.13/0.37 % (25275)------------------------------
% 0.13/0.37 % (25275)------------------------------
% 0.13/0.37 % (25269)Instruction limit reached!
% 0.13/0.37 % (25269)------------------------------
% 0.13/0.37 % (25269)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (25269)Termination reason: Unknown
% 0.13/0.37 % (25269)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (25269)Memory used [KB]: 5500
% 0.13/0.37 % (25269)Time elapsed: 0.004 s
% 0.13/0.37 % (25269)Instructions burned: 4 (million)
% 0.13/0.37 % (25269)------------------------------
% 0.13/0.37 % (25269)------------------------------
% 0.13/0.37 % (25273)First to succeed.
% 0.13/0.37 % (25268)Also succeeded, but the first one will report.
% 0.13/0.37 % (25273)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_2, type, setadjoin: $i > $i > $i).
% 0.13/0.37 thf(func_def_3, type, setunion: $i > $i).
% 0.13/0.37 thf(f47,plain,(
% 0.13/0.37 $false),
% 0.13/0.37 inference(subsumption_resolution,[],[f46,f42])).
% 0.13/0.37 thf(f42,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $i] : (((in @ X1 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) = $true)) )),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f39])).
% 0.13/0.37 thf(f39,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $i] : (($true != $true) | ((in @ X1 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) = $true)) )),
% 0.13/0.37 inference(definition_unfolding,[],[f31,f33])).
% 0.13/0.37 thf(f33,plain,(
% 0.13/0.37 (secondinupair = $true)),
% 0.13/0.37 inference(cnf_transformation,[],[f25])).
% 0.13/0.37 thf(f25,plain,(
% 0.13/0.37 ((in @ sK5 @ (setunion @ (setadjoin @ (setadjoin @ sK6 @ emptyset) @ (setadjoin @ (setadjoin @ sK6 @ (setadjoin @ sK5 @ emptyset)) @ emptyset)))) != $true) & (secondinupair = $true) & (setunionI = $true)),
% 0.13/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f13,f24])).
% 0.13/0.37 thf(f24,plain,(
% 0.13/0.37 ? [X0,X1] : ((in @ X0 @ (setunion @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))) != $true) => ((in @ sK5 @ (setunion @ (setadjoin @ (setadjoin @ sK6 @ emptyset) @ (setadjoin @ (setadjoin @ sK6 @ (setadjoin @ sK5 @ emptyset)) @ emptyset)))) != $true)),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f13,plain,(
% 0.13/0.37 ? [X0,X1] : ((in @ X0 @ (setunion @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))) != $true) & (secondinupair = $true) & (setunionI = $true)),
% 0.13/0.37 inference(flattening,[],[f12])).
% 0.13/0.37 thf(f12,plain,(
% 0.13/0.37 (? [X0,X1] : ((in @ X0 @ (setunion @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))) != $true) & (secondinupair = $true)) & (setunionI = $true)),
% 0.13/0.37 inference(ennf_transformation,[],[f11])).
% 0.13/0.37 thf(f11,plain,(
% 0.13/0.37 ~((setunionI = $true) => ((secondinupair = $true) => ! [X1,X0] : ((in @ X0 @ (setunion @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))) = $true)))),
% 0.13/0.37 inference(fool_elimination,[],[f10])).
% 0.13/0.37 thf(f10,plain,(
% 0.13/0.37 ~(setunionI => (secondinupair => ! [X0,X1] : (in @ X0 @ (setunion @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset))))))),
% 0.13/0.37 inference(rectify,[],[f4])).
% 0.13/0.37 thf(f4,negated_conjecture,(
% 0.13/0.37 ~(setunionI => (secondinupair => ! [X3,X1] : (in @ X3 @ (setunion @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X3 @ emptyset)) @ emptyset))))))),
% 0.13/0.37 inference(negated_conjecture,[],[f3])).
% 0.13/0.37 thf(f3,conjecture,(
% 0.13/0.37 setunionI => (secondinupair => ! [X3,X1] : (in @ X3 @ (setunion @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))))),
% 0.13/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairIR)).
% 0.13/0.37 thf(f31,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $i] : (((in @ X1 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) = $true) | (secondinupair != $true)) )),
% 0.13/0.37 inference(cnf_transformation,[],[f23])).
% 0.13/0.37 thf(f23,plain,(
% 0.13/0.37 (! [X0,X1] : ((in @ X1 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) = $true) | (secondinupair != $true)) & ((secondinupair = $true) | ((in @ sK4 @ (setadjoin @ sK3 @ (setadjoin @ sK4 @ emptyset))) != $true))),
% 0.13/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f21,f22])).
% 0.13/0.37 thf(f22,plain,(
% 0.13/0.37 ? [X2,X3] : ((in @ X3 @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset))) != $true) => ((in @ sK4 @ (setadjoin @ sK3 @ (setadjoin @ sK4 @ emptyset))) != $true)),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f21,plain,(
% 0.13/0.37 (! [X0,X1] : ((in @ X1 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) = $true) | (secondinupair != $true)) & ((secondinupair = $true) | ? [X2,X3] : ((in @ X3 @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset))) != $true))),
% 0.13/0.37 inference(rectify,[],[f20])).
% 0.13/0.37 thf(f20,plain,(
% 0.13/0.37 (! [X1,X0] : ((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset))) = $true) | (secondinupair != $true)) & ((secondinupair = $true) | ? [X1,X0] : ((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset))) != $true))),
% 0.13/0.38 inference(nnf_transformation,[],[f9])).
% 0.13/0.38 thf(f9,plain,(
% 0.13/0.38 ! [X1,X0] : ((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset))) = $true) <=> (secondinupair = $true)),
% 0.13/0.38 inference(fool_elimination,[],[f8])).
% 0.13/0.38 thf(f8,plain,(
% 0.13/0.38 (secondinupair = ! [X0,X1] : (in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset))))),
% 0.13/0.38 inference(rectify,[],[f2])).
% 0.13/0.38 thf(f2,axiom,(
% 0.13/0.38 (secondinupair = ! [X3,X1] : (in @ X3 @ (setadjoin @ X1 @ (setadjoin @ X3 @ emptyset))))),
% 0.13/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',secondinupair)).
% 0.13/0.38 thf(f46,plain,(
% 0.13/0.38 ((in @ sK5 @ (setadjoin @ sK6 @ (setadjoin @ sK5 @ emptyset))) != $true)),
% 0.13/0.38 inference(trivial_inequality_removal,[],[f45])).
% 0.13/0.38 thf(f45,plain,(
% 0.13/0.38 ((in @ sK5 @ (setadjoin @ sK6 @ (setadjoin @ sK5 @ emptyset))) != $true) | ($true != $true)),
% 0.13/0.38 inference(superposition,[],[f44,f42])).
% 0.13/0.38 thf(f44,plain,(
% 0.13/0.38 ( ! [X0 : $i] : (((in @ X0 @ (setadjoin @ (setadjoin @ sK6 @ emptyset) @ (setadjoin @ (setadjoin @ sK6 @ (setadjoin @ sK5 @ emptyset)) @ emptyset))) != $true) | ((in @ sK5 @ X0) != $true)) )),
% 0.13/0.38 inference(trivial_inequality_removal,[],[f43])).
% 0.13/0.38 thf(f43,plain,(
% 0.13/0.38 ( ! [X0 : $i] : (($true != $true) | ((in @ X0 @ (setadjoin @ (setadjoin @ sK6 @ emptyset) @ (setadjoin @ (setadjoin @ sK6 @ (setadjoin @ sK5 @ emptyset)) @ emptyset))) != $true) | ((in @ sK5 @ X0) != $true)) )),
% 0.13/0.38 inference(superposition,[],[f34,f41])).
% 0.13/0.38 thf(f41,plain,(
% 0.13/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X2 @ (setunion @ X1)) = $true) | ((in @ X0 @ X1) != $true) | ((in @ X2 @ X0) != $true)) )),
% 0.13/0.38 inference(trivial_inequality_removal,[],[f35])).
% 0.13/0.38 thf(f35,plain,(
% 0.13/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X0 @ X1) != $true) | ($true != $true) | ((in @ X2 @ (setunion @ X1)) = $true) | ((in @ X2 @ X0) != $true)) )),
% 0.13/0.38 inference(definition_unfolding,[],[f29,f32])).
% 0.13/0.38 thf(f32,plain,(
% 0.13/0.38 (setunionI = $true)),
% 0.13/0.38 inference(cnf_transformation,[],[f25])).
% 0.13/0.38 thf(f29,plain,(
% 0.13/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X0 @ X1) != $true) | ((in @ X2 @ X0) != $true) | ((in @ X2 @ (setunion @ X1)) = $true) | (setunionI != $true)) )),
% 0.13/0.38 inference(cnf_transformation,[],[f19])).
% 0.13/0.38 thf(f19,plain,(
% 0.13/0.38 (! [X0,X1,X2] : (((in @ X0 @ X1) != $true) | ((in @ X2 @ X0) != $true) | ((in @ X2 @ (setunion @ X1)) = $true)) | (setunionI != $true)) & ((setunionI = $true) | (((in @ sK0 @ sK1) = $true) & ((in @ sK2 @ sK0) = $true) & ($true != (in @ sK2 @ (setunion @ sK1)))))),
% 0.13/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f17,f18])).
% 0.13/0.38 thf(f18,plain,(
% 0.13/0.38 ? [X3,X4,X5] : (($true = (in @ X3 @ X4)) & ((in @ X5 @ X3) = $true) & ((in @ X5 @ (setunion @ X4)) != $true)) => (((in @ sK0 @ sK1) = $true) & ((in @ sK2 @ sK0) = $true) & ($true != (in @ sK2 @ (setunion @ sK1))))),
% 0.13/0.38 introduced(choice_axiom,[])).
% 0.13/0.38 thf(f17,plain,(
% 0.13/0.38 (! [X0,X1,X2] : (((in @ X0 @ X1) != $true) | ((in @ X2 @ X0) != $true) | ((in @ X2 @ (setunion @ X1)) = $true)) | (setunionI != $true)) & ((setunionI = $true) | ? [X3,X4,X5] : (($true = (in @ X3 @ X4)) & ((in @ X5 @ X3) = $true) & ((in @ X5 @ (setunion @ X4)) != $true)))),
% 0.13/0.38 inference(rectify,[],[f16])).
% 0.13/0.38 thf(f16,plain,(
% 0.13/0.38 (! [X0,X1,X2] : (((in @ X0 @ X1) != $true) | ((in @ X2 @ X0) != $true) | ((in @ X2 @ (setunion @ X1)) = $true)) | (setunionI != $true)) & ((setunionI = $true) | ? [X0,X1,X2] : (((in @ X0 @ X1) = $true) & ((in @ X2 @ X0) = $true) & ((in @ X2 @ (setunion @ X1)) != $true)))),
% 0.13/0.38 inference(nnf_transformation,[],[f15])).
% 0.13/0.38 thf(f15,plain,(
% 0.13/0.38 ! [X0,X1,X2] : (((in @ X0 @ X1) != $true) | ((in @ X2 @ X0) != $true) | ((in @ X2 @ (setunion @ X1)) = $true)) <=> (setunionI = $true)),
% 0.13/0.38 inference(flattening,[],[f14])).
% 0.13/0.38 thf(f14,plain,(
% 0.13/0.38 (setunionI = $true) <=> ! [X1,X2,X0] : ((((in @ X2 @ (setunion @ X1)) = $true) | ((in @ X0 @ X1) != $true)) | ((in @ X2 @ X0) != $true))),
% 0.13/0.38 inference(ennf_transformation,[],[f7])).
% 0.13/0.38 thf(f7,plain,(
% 0.13/0.38 (setunionI = $true) <=> ! [X1,X2,X0] : (((in @ X2 @ X0) = $true) => (((in @ X0 @ X1) = $true) => ((in @ X2 @ (setunion @ X1)) = $true)))),
% 0.13/0.38 inference(fool_elimination,[],[f6])).
% 0.13/0.38 thf(f6,plain,(
% 0.13/0.38 (! [X0,X1,X2] : ((in @ X2 @ X0) => ((in @ X0 @ X1) => (in @ X2 @ (setunion @ X1)))) = setunionI)),
% 0.13/0.38 inference(rectify,[],[f1])).
% 0.13/0.38 thf(f1,axiom,(
% 0.13/0.38 (! [X2,X0,X1] : ((in @ X1 @ X2) => ((in @ X2 @ X0) => (in @ X1 @ (setunion @ X0)))) = setunionI)),
% 0.13/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionI)).
% 0.13/0.38 thf(f34,plain,(
% 0.13/0.38 ((in @ sK5 @ (setunion @ (setadjoin @ (setadjoin @ sK6 @ emptyset) @ (setadjoin @ (setadjoin @ sK6 @ (setadjoin @ sK5 @ emptyset)) @ emptyset)))) != $true)),
% 0.13/0.38 inference(cnf_transformation,[],[f25])).
% 0.13/0.38 % SZS output end Proof for theBenchmark
% 0.13/0.38 % (25273)------------------------------
% 0.13/0.38 % (25273)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (25273)Termination reason: Refutation
% 0.13/0.38
% 0.13/0.38 % (25273)Memory used [KB]: 5500
% 0.13/0.38 % (25273)Time elapsed: 0.006 s
% 0.13/0.38 % (25273)Instructions burned: 4 (million)
% 0.13/0.38 % (25273)------------------------------
% 0.13/0.38 % (25273)------------------------------
% 0.13/0.38 % (25267)Success in time 0.007 s
% 0.13/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------