TSTP Solution File: SEU738^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU738^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:51:09 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU738^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n007.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 17:18:38 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH0_THM_EQU_NAR problem
% 0.15/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/sandbox2/benchmark/theBenchmark.p
% 0.15/0.37 % (15572)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.15/0.37 % (15573)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.15/0.37 % (15574)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.15/0.37 % (15575)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.37 % (15578)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.37 % (15577)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.15/0.37 % (15575)Instruction limit reached!
% 0.15/0.37 % (15575)------------------------------
% 0.15/0.37 % (15575)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (15575)Termination reason: Unknown
% 0.15/0.37 % (15575)Termination phase: Property scanning
% 0.15/0.37
% 0.15/0.37 % (15575)Memory used [KB]: 895
% 0.15/0.37 % (15575)Time elapsed: 0.003 s
% 0.15/0.37 % (15575)Instructions burned: 2 (million)
% 0.15/0.37 % (15575)------------------------------
% 0.15/0.37 % (15575)------------------------------
% 0.15/0.38 % (15572)First to succeed.
% 0.15/0.38 % (15573)Instruction limit reached!
% 0.15/0.38 % (15573)------------------------------
% 0.15/0.38 % (15573)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (15573)Termination reason: Unknown
% 0.15/0.38 % (15573)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (15573)Memory used [KB]: 5500
% 0.15/0.38 % (15573)Time elapsed: 0.005 s
% 0.15/0.38 % (15573)Instructions burned: 4 (million)
% 0.15/0.38 % (15573)------------------------------
% 0.15/0.38 % (15573)------------------------------
% 0.15/0.38 % (15574)Also succeeded, but the first one will report.
% 0.15/0.38 % (15572)Refutation found. Thanks to Tanya!
% 0.15/0.38 % SZS status Theorem for theBenchmark
% 0.15/0.38 % SZS output start Proof for theBenchmark
% 0.15/0.38 thf(func_def_0, type, in: $i > $i > $o).
% 0.15/0.38 thf(func_def_1, type, powerset: $i > $i).
% 0.15/0.38 thf(func_def_2, type, binunion: $i > $i > $i).
% 0.15/0.38 thf(f35,plain,(
% 0.15/0.38 $false),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f33])).
% 0.15/0.38 thf(f33,plain,(
% 0.15/0.38 ($true = $false)),
% 0.15/0.38 inference(superposition,[],[f32,f20])).
% 0.15/0.38 thf(f20,plain,(
% 0.15/0.38 ($true = (in @ sK3 @ sK1))),
% 0.15/0.38 inference(cnf_transformation,[],[f15])).
% 0.15/0.38 thf(f15,plain,(
% 0.15/0.38 (binunionIL = $true) & (((((in @ sK3 @ sK0) = $true) & ($true = (in @ sK3 @ sK1)) & ($true != (in @ sK3 @ (binunion @ sK1 @ sK2)))) & ((in @ sK2 @ (powerset @ sK0)) = $true)) & ($true = (in @ sK1 @ (powerset @ sK0))))),
% 0.15/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f11,f14,f13,f12])).
% 0.15/0.38 thf(f12,plain,(
% 0.15/0.38 ? [X0,X1] : (? [X2] : (? [X3] : (((in @ X3 @ X0) = $true) & ((in @ X3 @ X1) = $true) & ((in @ X3 @ (binunion @ X1 @ X2)) != $true)) & ($true = (in @ X2 @ (powerset @ X0)))) & ((in @ X1 @ (powerset @ X0)) = $true)) => (? [X2] : (? [X3] : (($true = (in @ X3 @ sK0)) & ($true = (in @ X3 @ sK1)) & ($true != (in @ X3 @ (binunion @ sK1 @ X2)))) & ((in @ X2 @ (powerset @ sK0)) = $true)) & ($true = (in @ sK1 @ (powerset @ sK0))))),
% 0.15/0.38 introduced(choice_axiom,[])).
% 0.15/0.38 thf(f13,plain,(
% 0.15/0.38 ? [X2] : (? [X3] : (($true = (in @ X3 @ sK0)) & ($true = (in @ X3 @ sK1)) & ($true != (in @ X3 @ (binunion @ sK1 @ X2)))) & ((in @ X2 @ (powerset @ sK0)) = $true)) => (? [X3] : (($true = (in @ X3 @ sK0)) & ($true = (in @ X3 @ sK1)) & ($true != (in @ X3 @ (binunion @ sK1 @ sK2)))) & ((in @ sK2 @ (powerset @ sK0)) = $true))),
% 0.15/0.38 introduced(choice_axiom,[])).
% 0.15/0.38 thf(f14,plain,(
% 0.15/0.38 ? [X3] : (($true = (in @ X3 @ sK0)) & ($true = (in @ X3 @ sK1)) & ($true != (in @ X3 @ (binunion @ sK1 @ sK2)))) => (((in @ sK3 @ sK0) = $true) & ($true = (in @ sK3 @ sK1)) & ($true != (in @ sK3 @ (binunion @ sK1 @ sK2))))),
% 0.15/0.38 introduced(choice_axiom,[])).
% 0.15/0.38 thf(f11,plain,(
% 0.15/0.38 (binunionIL = $true) & ? [X0,X1] : (? [X2] : (? [X3] : (((in @ X3 @ X0) = $true) & ((in @ X3 @ X1) = $true) & ((in @ X3 @ (binunion @ X1 @ X2)) != $true)) & ($true = (in @ X2 @ (powerset @ X0)))) & ((in @ X1 @ (powerset @ X0)) = $true))),
% 0.15/0.38 inference(flattening,[],[f10])).
% 0.15/0.38 thf(f10,plain,(
% 0.15/0.38 ? [X0,X1] : (? [X2] : (? [X3] : ((((in @ X3 @ X1) = $true) & ((in @ X3 @ (binunion @ X1 @ X2)) != $true)) & ((in @ X3 @ X0) = $true)) & ($true = (in @ X2 @ (powerset @ X0)))) & ((in @ X1 @ (powerset @ X0)) = $true)) & (binunionIL = $true)),
% 0.15/0.38 inference(ennf_transformation,[],[f9])).
% 0.15/0.38 thf(f9,plain,(
% 0.15/0.38 ~((binunionIL = $true) => ! [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (($true = (in @ X2 @ (powerset @ X0))) => ! [X3] : (((in @ X3 @ X0) = $true) => (((in @ X3 @ (binunion @ X1 @ X2)) != $true) => ((in @ X3 @ X1) != $true))))))),
% 0.15/0.38 inference(flattening,[],[f6])).
% 0.15/0.38 thf(f6,plain,(
% 0.15/0.38 ~((binunionIL = $true) => ! [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (($true = (in @ X2 @ (powerset @ X0))) => ! [X3] : (((in @ X3 @ X0) = $true) => (~((in @ X3 @ (binunion @ X1 @ X2)) = $true) => ~((in @ X3 @ X1) = $true))))))),
% 0.15/0.38 inference(fool_elimination,[],[f5])).
% 0.15/0.38 thf(f5,plain,(
% 0.15/0.38 ~(binunionIL => ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X3] : ((in @ X3 @ X0) => (~(in @ X3 @ (binunion @ X1 @ X2)) => ~(in @ X3 @ X1))))))),
% 0.15/0.38 inference(rectify,[],[f3])).
% 0.15/0.38 thf(f3,negated_conjecture,(
% 0.15/0.38 ~(binunionIL => ! [X0,X3] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => (~(in @ X2 @ (binunion @ X3 @ X4)) => ~(in @ X2 @ X3))))))),
% 0.15/0.38 inference(negated_conjecture,[],[f2])).
% 0.15/0.38 thf(f2,conjecture,(
% 0.15/0.38 binunionIL => ! [X0,X3] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => (~(in @ X2 @ (binunion @ X3 @ X4)) => ~(in @ X2 @ X3)))))),
% 0.15/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionTILcontra)).
% 0.15/0.38 thf(f32,plain,(
% 0.15/0.38 ((in @ sK3 @ sK1) = $false)),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f31])).
% 0.15/0.38 thf(f31,plain,(
% 0.15/0.38 ((in @ sK3 @ sK1) = $false) | ($true != $true)),
% 0.15/0.38 inference(superposition,[],[f19,f30])).
% 0.15/0.38 thf(f30,plain,(
% 0.15/0.38 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (in @ X1 @ (binunion @ X3 @ X2))) | ((in @ X1 @ X3) = $false)) )),
% 0.15/0.38 inference(binary_proxy_clausification,[],[f29])).
% 0.15/0.38 thf(f29,plain,(
% 0.15/0.38 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = ((in @ X1 @ X3) => (in @ X1 @ (binunion @ X3 @ X2))))) )),
% 0.15/0.38 inference(beta_eta_normalization,[],[f28])).
% 0.15/0.38 thf(f28,plain,(
% 0.15/0.38 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((in @ X1 @ Y0) => (in @ X1 @ (binunion @ Y0 @ X2)))) @ X3))) )),
% 0.15/0.38 inference(pi_clausification,[],[f27])).
% 0.15/0.38 thf(f27,plain,(
% 0.15/0.38 ( ! [X2 : $i,X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((in @ X1 @ Y0) => (in @ X1 @ (binunion @ Y0 @ X2))))))) )),
% 0.15/0.38 inference(beta_eta_normalization,[],[f26])).
% 0.15/0.38 thf(f26,plain,(
% 0.15/0.38 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ Y1) => (in @ X1 @ (binunion @ Y1 @ Y0)))))) @ X2))) )),
% 0.15/0.38 inference(pi_clausification,[],[f25])).
% 0.15/0.38 thf(f25,plain,(
% 0.15/0.38 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ Y1) => (in @ X1 @ (binunion @ Y1 @ Y0))))))) = $true)) )),
% 0.15/0.38 inference(beta_eta_normalization,[],[f24])).
% 0.15/0.38 thf(f24,plain,(
% 0.15/0.38 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => (in @ Y0 @ (binunion @ Y2 @ Y1)))))))) @ X1))) )),
% 0.15/0.38 inference(pi_clausification,[],[f23])).
% 0.15/0.38 thf(f23,plain,(
% 0.15/0.38 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => (in @ Y0 @ (binunion @ Y2 @ Y1))))))))))),
% 0.15/0.38 inference(definition_unfolding,[],[f22,f16])).
% 0.15/0.38 thf(f16,plain,(
% 0.15/0.38 (binunionIL = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => (in @ Y0 @ (binunion @ Y2 @ Y1))))))))))),
% 0.15/0.38 inference(cnf_transformation,[],[f8])).
% 0.15/0.38 thf(f8,plain,(
% 0.15/0.38 (binunionIL = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => (in @ Y0 @ (binunion @ Y2 @ Y1))))))))))),
% 0.15/0.38 inference(fool_elimination,[],[f7])).
% 0.15/0.38 thf(f7,plain,(
% 0.15/0.38 (! [X0,X1,X2] : ((in @ X2 @ X0) => (in @ X2 @ (binunion @ X0 @ X1))) = binunionIL)),
% 0.15/0.38 inference(rectify,[],[f1])).
% 0.15/0.38 thf(f1,axiom,(
% 0.15/0.38 (! [X0,X1,X2] : ((in @ X2 @ X0) => (in @ X2 @ (binunion @ X0 @ X1))) = binunionIL)),
% 0.15/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionIL)).
% 0.15/0.38 thf(f22,plain,(
% 0.15/0.38 (binunionIL = $true)),
% 0.15/0.38 inference(cnf_transformation,[],[f15])).
% 0.15/0.38 thf(f19,plain,(
% 0.15/0.38 ($true != (in @ sK3 @ (binunion @ sK1 @ sK2)))),
% 0.15/0.38 inference(cnf_transformation,[],[f15])).
% 0.15/0.38 % SZS output end Proof for theBenchmark
% 0.15/0.38 % (15572)------------------------------
% 0.15/0.38 % (15572)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (15572)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (15572)Memory used [KB]: 5500
% 0.15/0.38 % (15572)Time elapsed: 0.006 s
% 0.15/0.38 % (15572)Instructions burned: 3 (million)
% 0.15/0.38 % (15572)------------------------------
% 0.15/0.38 % (15572)------------------------------
% 0.15/0.38 % (15571)Success in time 0.005 s
% 0.15/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------