TSTP Solution File: SEU722^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU722^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:51:02 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU722^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/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.14/0.36 % Computer : n011.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 16:42:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/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.14/0.39 % (13506)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.14/0.39 % (13501)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.14/0.39 % (13503)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.14/0.39 % (13502)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.14/0.39 % (13504)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.39 % (13507)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.39 % (13508)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.14/0.39 % (13504)Instruction limit reached!
% 0.14/0.39 % (13504)------------------------------
% 0.14/0.39 % (13504)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (13504)Termination reason: Unknown
% 0.14/0.39 % (13504)Termination phase: Preprocessing 3
% 0.14/0.39
% 0.14/0.39 % (13504)Memory used [KB]: 895
% 0.14/0.39 % (13504)Time elapsed: 0.003 s
% 0.14/0.39 % (13504)Instructions burned: 2 (million)
% 0.14/0.39 % (13504)------------------------------
% 0.14/0.39 % (13504)------------------------------
% 0.14/0.39 % (13508)Instruction limit reached!
% 0.14/0.39 % (13508)------------------------------
% 0.14/0.39 % (13508)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (13508)Termination reason: Unknown
% 0.14/0.39 % (13508)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (13508)Memory used [KB]: 5500
% 0.14/0.39 % (13508)Time elapsed: 0.003 s
% 0.14/0.39 % (13508)Instructions burned: 3 (million)
% 0.14/0.39 % (13508)------------------------------
% 0.14/0.39 % (13508)------------------------------
% 0.14/0.39 % (13506)First to succeed.
% 0.14/0.39 % (13505)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.14/0.39 % (13502)Instruction limit reached!
% 0.14/0.39 % (13502)------------------------------
% 0.14/0.39 % (13502)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (13502)Termination reason: Unknown
% 0.14/0.39 % (13502)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (13502)Memory used [KB]: 5500
% 0.14/0.39 % (13502)Time elapsed: 0.005 s
% 0.14/0.39 % (13502)Instructions burned: 4 (million)
% 0.14/0.39 % (13502)------------------------------
% 0.14/0.39 % (13502)------------------------------
% 0.14/0.39 % (13507)Also succeeded, but the first one will report.
% 0.14/0.39 % (13505)Instruction limit reached!
% 0.14/0.39 % (13505)------------------------------
% 0.14/0.39 % (13505)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (13505)Termination reason: Unknown
% 0.14/0.39 % (13505)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (13505)Memory used [KB]: 5500
% 0.14/0.39 % (13505)Time elapsed: 0.003 s
% 0.14/0.39 % (13505)Instructions burned: 3 (million)
% 0.14/0.39 % (13505)------------------------------
% 0.14/0.39 % (13505)------------------------------
% 0.14/0.39 % (13501)Also succeeded, but the first one will report.
% 0.14/0.39 % (13506)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% 0.14/0.39 thf(func_def_0, type, in: $i > $i > $o).
% 0.14/0.39 thf(func_def_1, type, powerset: $i > $i).
% 0.14/0.39 thf(func_def_2, type, binintersect: $i > $i > $i).
% 0.14/0.39 thf(f37,plain,(
% 0.14/0.39 $false),
% 0.14/0.39 inference(subsumption_resolution,[],[f36,f28])).
% 0.14/0.39 thf(f28,plain,(
% 0.14/0.39 ((in @ sK6 @ sK5) != $true)),
% 0.14/0.39 inference(cnf_transformation,[],[f21])).
% 0.14/0.39 thf(f21,plain,(
% 0.14/0.39 (((in @ sK3 @ (powerset @ sK4)) = $true) & (((in @ sK5 @ (powerset @ sK4)) = $true) & (((in @ sK6 @ sK5) != $true) & ((in @ sK6 @ sK4) = $true) & ((in @ sK6 @ (binintersect @ sK3 @ sK5)) = $true)))) & (binintersectER = $true)),
% 0.14/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f17,f20,f19,f18])).
% 0.14/0.39 thf(f18,plain,(
% 0.14/0.39 ? [X0,X1] : (((in @ X0 @ (powerset @ X1)) = $true) & ? [X2] : (((in @ X2 @ (powerset @ X1)) = $true) & ? [X3] : (((in @ X3 @ X2) != $true) & ((in @ X3 @ X1) = $true) & ((in @ X3 @ (binintersect @ X0 @ X2)) = $true)))) => (((in @ sK3 @ (powerset @ sK4)) = $true) & ? [X2] : (((in @ X2 @ (powerset @ sK4)) = $true) & ? [X3] : (((in @ X3 @ X2) != $true) & ((in @ X3 @ sK4) = $true) & ((in @ X3 @ (binintersect @ sK3 @ X2)) = $true))))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f19,plain,(
% 0.14/0.39 ? [X2] : (((in @ X2 @ (powerset @ sK4)) = $true) & ? [X3] : (((in @ X3 @ X2) != $true) & ((in @ X3 @ sK4) = $true) & ((in @ X3 @ (binintersect @ sK3 @ X2)) = $true))) => (((in @ sK5 @ (powerset @ sK4)) = $true) & ? [X3] : (((in @ X3 @ sK5) != $true) & ((in @ X3 @ sK4) = $true) & ((in @ X3 @ (binintersect @ sK3 @ sK5)) = $true)))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f20,plain,(
% 0.14/0.39 ? [X3] : (((in @ X3 @ sK5) != $true) & ((in @ X3 @ sK4) = $true) & ((in @ X3 @ (binintersect @ sK3 @ sK5)) = $true)) => (((in @ sK6 @ sK5) != $true) & ((in @ sK6 @ sK4) = $true) & ((in @ sK6 @ (binintersect @ sK3 @ sK5)) = $true))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f17,plain,(
% 0.14/0.39 ? [X0,X1] : (((in @ X0 @ (powerset @ X1)) = $true) & ? [X2] : (((in @ X2 @ (powerset @ X1)) = $true) & ? [X3] : (((in @ X3 @ X2) != $true) & ((in @ X3 @ X1) = $true) & ((in @ X3 @ (binintersect @ X0 @ X2)) = $true)))) & (binintersectER = $true)),
% 0.14/0.39 inference(rectify,[],[f11])).
% 0.14/0.39 thf(f11,plain,(
% 0.14/0.39 ? [X1,X0] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (((in @ X2 @ (powerset @ X0)) = $true) & ? [X3] : (((in @ X3 @ X2) != $true) & ($true = (in @ X3 @ X0)) & ((in @ X3 @ (binintersect @ X1 @ X2)) = $true)))) & (binintersectER = $true)),
% 0.14/0.39 inference(flattening,[],[f10])).
% 0.14/0.39 thf(f10,plain,(
% 0.14/0.39 ? [X0,X1] : (? [X2] : (? [X3] : ((((in @ X3 @ (binintersect @ X1 @ X2)) = $true) & ((in @ X3 @ X2) != $true)) & ($true = (in @ X3 @ X0))) & ((in @ X2 @ (powerset @ X0)) = $true)) & ((in @ X1 @ (powerset @ X0)) = $true)) & (binintersectER = $true)),
% 0.14/0.39 inference(ennf_transformation,[],[f9])).
% 0.14/0.39 thf(f9,plain,(
% 0.14/0.39 ~((binintersectER = $true) => ! [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X0)) = $true) => ! [X3] : (($true = (in @ X3 @ X0)) => (((in @ X3 @ X2) != $true) => ((in @ X3 @ (binintersect @ X1 @ X2)) != $true))))))),
% 0.14/0.39 inference(flattening,[],[f8])).
% 0.14/0.39 thf(f8,plain,(
% 0.14/0.39 ~((binintersectER = $true) => ! [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X0)) = $true) => ! [X3] : (($true = (in @ X3 @ X0)) => (~((in @ X3 @ X2) = $true) => ~((in @ X3 @ (binintersect @ X1 @ X2)) = $true))))))),
% 0.14/0.39 inference(fool_elimination,[],[f7])).
% 0.14/0.39 thf(f7,plain,(
% 0.14/0.39 ~(binintersectER => ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X3] : ((in @ X3 @ X0) => (~(in @ X3 @ X2) => ~(in @ X3 @ (binintersect @ X1 @ X2)))))))),
% 0.14/0.39 inference(rectify,[],[f3])).
% 0.14/0.39 thf(f3,negated_conjecture,(
% 0.14/0.39 ~(binintersectER => ! [X0,X3] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => (~(in @ X2 @ X4) => ~(in @ X2 @ (binintersect @ X3 @ X4)))))))),
% 0.14/0.39 inference(negated_conjecture,[],[f2])).
% 0.14/0.39 thf(f2,conjecture,(
% 0.14/0.39 binintersectER => ! [X0,X3] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => (~(in @ X2 @ X4) => ~(in @ X2 @ (binintersect @ X3 @ X4))))))),
% 0.14/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectTERcontra)).
% 0.14/0.39 thf(f36,plain,(
% 0.14/0.39 ((in @ sK6 @ sK5) = $true)),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f35])).
% 0.14/0.39 thf(f35,plain,(
% 0.14/0.39 ($true != $true) | ((in @ sK6 @ sK5) = $true)),
% 0.14/0.39 inference(superposition,[],[f34,f26])).
% 0.14/0.39 thf(f26,plain,(
% 0.14/0.39 ((in @ sK6 @ (binintersect @ sK3 @ sK5)) = $true)),
% 0.14/0.39 inference(cnf_transformation,[],[f21])).
% 0.14/0.39 thf(f34,plain,(
% 0.14/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X4 @ (binintersect @ X5 @ X3)) != $true) | ((in @ X4 @ X3) = $true)) )),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f33])).
% 0.14/0.39 thf(f33,plain,(
% 0.14/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != $true) | ((in @ X4 @ X3) = $true) | ((in @ X4 @ (binintersect @ X5 @ X3)) != $true)) )),
% 0.14/0.39 inference(definition_unfolding,[],[f22,f25])).
% 0.14/0.39 thf(f25,plain,(
% 0.14/0.39 (binintersectER = $true)),
% 0.14/0.39 inference(cnf_transformation,[],[f21])).
% 0.14/0.39 thf(f22,plain,(
% 0.14/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X4 @ (binintersect @ X5 @ X3)) != $true) | ((in @ X4 @ X3) = $true) | (binintersectER != $true)) )),
% 0.14/0.39 inference(cnf_transformation,[],[f16])).
% 0.14/0.39 thf(f16,plain,(
% 0.14/0.39 ((binintersectER = $true) | (((in @ sK1 @ (binintersect @ sK2 @ sK0)) = $true) & ($true != (in @ sK1 @ sK0)))) & (! [X3,X4,X5] : (((in @ X4 @ (binintersect @ X5 @ X3)) != $true) | ((in @ X4 @ X3) = $true)) | (binintersectER != $true))),
% 0.14/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f14,f15])).
% 0.14/0.39 thf(f15,plain,(
% 0.14/0.39 ? [X0,X1,X2] : (((in @ X1 @ (binintersect @ X2 @ X0)) = $true) & ((in @ X1 @ X0) != $true)) => (((in @ sK1 @ (binintersect @ sK2 @ sK0)) = $true) & ($true != (in @ sK1 @ sK0)))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f14,plain,(
% 0.14/0.39 ((binintersectER = $true) | ? [X0,X1,X2] : (((in @ X1 @ (binintersect @ X2 @ X0)) = $true) & ((in @ X1 @ X0) != $true))) & (! [X3,X4,X5] : (((in @ X4 @ (binintersect @ X5 @ X3)) != $true) | ((in @ X4 @ X3) = $true)) | (binintersectER != $true))),
% 0.14/0.39 inference(rectify,[],[f13])).
% 0.14/0.39 thf(f13,plain,(
% 0.14/0.39 ((binintersectER = $true) | ? [X0,X1,X2] : (((in @ X1 @ (binintersect @ X2 @ X0)) = $true) & ((in @ X1 @ X0) != $true))) & (! [X0,X1,X2] : (((in @ X1 @ (binintersect @ X2 @ X0)) != $true) | ((in @ X1 @ X0) = $true)) | (binintersectER != $true))),
% 0.14/0.39 inference(nnf_transformation,[],[f12])).
% 0.14/0.39 thf(f12,plain,(
% 0.14/0.39 (binintersectER = $true) <=> ! [X0,X1,X2] : (((in @ X1 @ (binintersect @ X2 @ X0)) != $true) | ((in @ X1 @ X0) = $true))),
% 0.14/0.39 inference(ennf_transformation,[],[f6])).
% 0.14/0.39 thf(f6,plain,(
% 0.14/0.39 (binintersectER = $true) <=> ! [X1,X0,X2] : (((in @ X1 @ (binintersect @ X2 @ X0)) = $true) => ((in @ X1 @ X0) = $true))),
% 0.14/0.39 inference(fool_elimination,[],[f5])).
% 0.14/0.39 thf(f5,plain,(
% 0.14/0.39 (binintersectER = ! [X0,X1,X2] : ((in @ X1 @ (binintersect @ X2 @ X0)) => (in @ X1 @ X0)))),
% 0.14/0.39 inference(rectify,[],[f1])).
% 0.14/0.39 thf(f1,axiom,(
% 0.14/0.39 (binintersectER = ! [X1,X2,X0] : ((in @ X2 @ (binintersect @ X0 @ X1)) => (in @ X2 @ X1)))),
% 0.14/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectER)).
% 0.14/0.39 % SZS output end Proof for theBenchmark
% 0.14/0.39 % (13506)------------------------------
% 0.14/0.39 % (13506)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (13506)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (13506)Memory used [KB]: 5500
% 0.14/0.39 % (13506)Time elapsed: 0.005 s
% 0.14/0.39 % (13506)Instructions burned: 3 (million)
% 0.14/0.39 % (13506)------------------------------
% 0.14/0.39 % (13506)------------------------------
% 0.14/0.39 % (13500)Success in time 0.006 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------