TSTP Solution File: SEU586^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU586^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 : n017.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:46 EDT 2024
% Result : Theorem 0.08s 0.28s
% Output : Refutation 0.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.07 % Problem : SEU586^2 : TPTP v8.2.0. Released v3.7.0.
% 0.01/0.08 % 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.08/0.27 % Computer : n017.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Sun May 19 18:20:37 EDT 2024
% 0.08/0.27 % CPUTime :
% 0.08/0.27 This is a TH0_THM_EQU_NAR problem
% 0.08/0.27 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.08/0.28 % (32177)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.08/0.28 % (32174)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.08/0.28 % (32172)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.08/0.28 % (32173)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.08/0.28 % (32178)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.08/0.28 % (32179)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.08/0.28 % (32176)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 (3000ds/2Mi)
% 0.08/0.28 % (32175)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.08/0.28 % (32175)Instruction limit reached!
% 0.08/0.28 % (32175)------------------------------
% 0.08/0.28 % (32175)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.28 % (32175)Termination reason: Unknown
% 0.08/0.28 % (32175)Termination phase: Saturation
% 0.08/0.28
% 0.08/0.28 % (32176)Instruction limit reached!
% 0.08/0.28 % (32176)------------------------------
% 0.08/0.28 % (32176)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.28 % (32176)Termination reason: Unknown
% 0.08/0.28 % (32176)Termination phase: Saturation
% 0.08/0.28
% 0.08/0.28 % (32176)Memory used [KB]: 895
% 0.08/0.28 % (32176)Time elapsed: 0.002 s
% 0.08/0.28 % (32176)Instructions burned: 2 (million)
% 0.08/0.28 % (32176)------------------------------
% 0.08/0.28 % (32176)------------------------------
% 0.08/0.28 % (32175)Memory used [KB]: 895
% 0.08/0.28 % (32175)Time elapsed: 0.002 s
% 0.08/0.28 % (32175)Instructions burned: 2 (million)
% 0.08/0.28 % (32175)------------------------------
% 0.08/0.28 % (32175)------------------------------
% 0.08/0.28 % (32179)Refutation not found, incomplete strategy
% 0.08/0.28 % (32179)------------------------------
% 0.08/0.28 % (32179)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.28 % (32179)Termination reason: Refutation not found, incomplete strategy
% 0.08/0.28
% 0.08/0.28
% 0.08/0.28 % (32179)Memory used [KB]: 5500
% 0.08/0.28 % (32179)Time elapsed: 0.002 s
% 0.08/0.28 % (32179)Instructions burned: 2 (million)
% 0.08/0.28 % (32179)------------------------------
% 0.08/0.28 % (32179)------------------------------
% 0.08/0.28 % (32178)First to succeed.
% 0.08/0.28 % (32173)Instruction limit reached!
% 0.08/0.28 % (32173)------------------------------
% 0.08/0.28 % (32173)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.28 % (32173)Termination reason: Unknown
% 0.08/0.28 % (32173)Termination phase: Saturation
% 0.08/0.28
% 0.08/0.28 % (32173)Memory used [KB]: 5500
% 0.08/0.28 % (32173)Time elapsed: 0.003 s
% 0.08/0.28 % (32173)Instructions burned: 4 (million)
% 0.08/0.28 % (32173)------------------------------
% 0.08/0.28 % (32173)------------------------------
% 0.08/0.28 % (32177)Also succeeded, but the first one will report.
% 0.08/0.28 % (32178)Refutation found. Thanks to Tanya!
% 0.08/0.28 % SZS status Theorem for theBenchmark
% 0.08/0.28 % SZS output start Proof for theBenchmark
% 0.08/0.28 thf(func_def_0, type, in: $i > $i > $o).
% 0.08/0.28 thf(func_def_1, type, binunion: $i > $i > $i).
% 0.08/0.28 thf(f49,plain,(
% 0.08/0.28 $false),
% 0.08/0.28 inference(subsumption_resolution,[],[f48,f30])).
% 0.08/0.28 thf(f30,plain,(
% 0.08/0.28 ((in @ sK4 @ sK6) != $true)),
% 0.08/0.28 inference(cnf_transformation,[],[f19])).
% 0.08/0.28 thf(f19,plain,(
% 0.08/0.28 (((in @ sK4 @ (binunion @ sK5 @ sK6)) = $true) & ((in @ sK4 @ sK6) != $true) & ((in @ sK4 @ sK5) != $true)) & (binunionEcases = $true)),
% 0.08/0.28 inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f17,f18])).
% 0.08/0.28 thf(f18,plain,(
% 0.08/0.28 ? [X0,X1,X2] : (($true = (in @ X0 @ (binunion @ X1 @ X2))) & ($true != (in @ X0 @ X2)) & ((in @ X0 @ X1) != $true)) => (((in @ sK4 @ (binunion @ sK5 @ sK6)) = $true) & ((in @ sK4 @ sK6) != $true) & ((in @ sK4 @ sK5) != $true))),
% 0.08/0.28 introduced(choice_axiom,[])).
% 0.08/0.28 thf(f17,plain,(
% 0.08/0.28 ? [X0,X1,X2] : (($true = (in @ X0 @ (binunion @ X1 @ X2))) & ($true != (in @ X0 @ X2)) & ((in @ X0 @ X1) != $true)) & (binunionEcases = $true)),
% 0.08/0.28 inference(rectify,[],[f12])).
% 0.08/0.28 thf(f12,plain,(
% 0.08/0.28 ? [X1,X0,X2] : (($true = (in @ X1 @ (binunion @ X0 @ X2))) & ($true != (in @ X1 @ X2)) & ($true != (in @ X1 @ X0))) & (binunionEcases = $true)),
% 0.08/0.28 inference(flattening,[],[f11])).
% 0.08/0.28 thf(f11,plain,(
% 0.08/0.28 ? [X1,X0,X2] : ((($true != (in @ X1 @ X2)) & ($true != (in @ X1 @ X0))) & ($true = (in @ X1 @ (binunion @ X0 @ X2)))) & (binunionEcases = $true)),
% 0.08/0.28 inference(ennf_transformation,[],[f6])).
% 0.08/0.28 thf(f6,plain,(
% 0.08/0.28 ~((binunionEcases = $true) => ! [X1,X0,X2] : (($true = (in @ X1 @ (binunion @ X0 @ X2))) => (($true = (in @ X1 @ X2)) | ($true = (in @ X1 @ X0)))))),
% 0.08/0.28 inference(fool_elimination,[],[f5])).
% 0.08/0.28 thf(f5,plain,(
% 0.08/0.28 ~(binunionEcases => ! [X0,X1,X2] : ((in @ X1 @ (binunion @ X0 @ X2)) => ((in @ X1 @ X2) | (in @ X1 @ X0))))),
% 0.08/0.28 inference(rectify,[],[f3])).
% 0.08/0.28 thf(f3,negated_conjecture,(
% 0.08/0.28 ~(binunionEcases => ! [X0,X2,X1] : ((in @ X2 @ (binunion @ X0 @ X1)) => ((in @ X2 @ X1) | (in @ X2 @ X0))))),
% 0.08/0.28 inference(negated_conjecture,[],[f2])).
% 0.08/0.28 thf(f2,conjecture,(
% 0.08/0.28 binunionEcases => ! [X0,X2,X1] : ((in @ X2 @ (binunion @ X0 @ X1)) => ((in @ X2 @ X1) | (in @ X2 @ X0)))),
% 0.08/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binunionE)).
% 0.08/0.28 thf(f48,plain,(
% 0.08/0.28 ((in @ sK4 @ sK6) = $true)),
% 0.08/0.28 inference(subsumption_resolution,[],[f47,f29])).
% 0.08/0.28 thf(f29,plain,(
% 0.08/0.28 ((in @ sK4 @ sK5) != $true)),
% 0.08/0.28 inference(cnf_transformation,[],[f19])).
% 0.08/0.28 thf(f47,plain,(
% 0.08/0.28 ((in @ sK4 @ sK5) = $true) | ((in @ sK4 @ sK6) = $true)),
% 0.08/0.28 inference(trivial_inequality_removal,[],[f46])).
% 0.08/0.28 thf(f46,plain,(
% 0.08/0.28 ((in @ sK4 @ sK5) = $true) | ($true != $true) | ((in @ sK4 @ sK6) = $true)),
% 0.08/0.28 inference(superposition,[],[f44,f31])).
% 0.08/0.28 thf(f31,plain,(
% 0.08/0.28 ((in @ sK4 @ (binunion @ sK5 @ sK6)) = $true)),
% 0.08/0.28 inference(cnf_transformation,[],[f19])).
% 0.08/0.28 thf(f44,plain,(
% 0.08/0.28 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ X0 @ (binunion @ X2 @ X1))) | ($true = (in @ X0 @ X2)) | ((in @ X0 @ X1) = $true)) )),
% 0.08/0.28 inference(condensation,[],[f43])).
% 0.08/0.28 thf(f43,plain,(
% 0.08/0.28 ( ! [X6 : $i,X7 : $i,X4 : $o,X5 : $i] : (($true = X4) | ((in @ X5 @ X6) = $true) | ((in @ X5 @ (binunion @ X7 @ X6)) != $true) | ((in @ X5 @ X7) = $true)) )),
% 0.08/0.28 inference(trivial_inequality_removal,[],[f39])).
% 0.08/0.28 thf(f39,plain,(
% 0.08/0.28 ( ! [X6 : $i,X7 : $i,X4 : $o,X5 : $i] : (($true != $true) | ($true = X4) | ((in @ X5 @ X7) = $true) | ((in @ X5 @ X6) = $true) | ((in @ X5 @ (binunion @ X7 @ X6)) != $true)) )),
% 0.08/0.28 inference(definition_unfolding,[],[f20,f28])).
% 0.08/0.28 thf(f28,plain,(
% 0.08/0.28 (binunionEcases = $true)),
% 0.08/0.28 inference(cnf_transformation,[],[f19])).
% 0.08/0.28 thf(f20,plain,(
% 0.08/0.28 ( ! [X6 : $i,X7 : $i,X4 : $o,X5 : $i] : (($true = X4) | ((in @ X5 @ X7) = $true) | ((in @ X5 @ X6) = $true) | ((in @ X5 @ (binunion @ X7 @ X6)) != $true) | (binunionEcases != $true)) )),
% 0.08/0.28 inference(cnf_transformation,[],[f16])).
% 0.08/0.28 thf(f16,plain,(
% 0.08/0.28 ((binunionEcases = $true) | (($true != sK0) & (($true = sK0) | ((in @ sK1 @ sK3) != $true)) & (($true = sK0) | ($true != (in @ sK1 @ sK2))) & ((in @ sK1 @ (binunion @ sK3 @ sK2)) = $true))) & (! [X4 : $o,X5,X6,X7] : (($true = X4) | (($true != X4) & ((in @ X5 @ X7) = $true)) | (($true != X4) & ((in @ X5 @ X6) = $true)) | ((in @ X5 @ (binunion @ X7 @ X6)) != $true)) | (binunionEcases != $true))),
% 0.08/0.28 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f14,f15])).
% 0.08/0.28 thf(f15,plain,(
% 0.08/0.28 ? [X0 : $o,X1,X2,X3] : (($true != X0) & (($true = X0) | ($true != (in @ X1 @ X3))) & (($true = X0) | ($true != (in @ X1 @ X2))) & ($true = (in @ X1 @ (binunion @ X3 @ X2)))) => (($true != sK0) & (($true = sK0) | ((in @ sK1 @ sK3) != $true)) & (($true = sK0) | ($true != (in @ sK1 @ sK2))) & ((in @ sK1 @ (binunion @ sK3 @ sK2)) = $true))),
% 0.08/0.28 introduced(choice_axiom,[])).
% 0.08/0.28 thf(f14,plain,(
% 0.08/0.28 ((binunionEcases = $true) | ? [X0 : $o,X1,X2,X3] : (($true != X0) & (($true = X0) | ($true != (in @ X1 @ X3))) & (($true = X0) | ($true != (in @ X1 @ X2))) & ($true = (in @ X1 @ (binunion @ X3 @ X2))))) & (! [X4 : $o,X5,X6,X7] : (($true = X4) | (($true != X4) & ((in @ X5 @ X7) = $true)) | (($true != X4) & ((in @ X5 @ X6) = $true)) | ((in @ X5 @ (binunion @ X7 @ X6)) != $true)) | (binunionEcases != $true))),
% 0.08/0.28 inference(rectify,[],[f13])).
% 0.08/0.28 thf(f13,plain,(
% 0.08/0.28 ((binunionEcases = $true) | ? [X3 : $o,X0,X1,X2] : (($true != X3) & (($true = X3) | ($true != (in @ X0 @ X2))) & (($true = X3) | ((in @ X0 @ X1) != $true)) & ($true = (in @ X0 @ (binunion @ X2 @ X1))))) & (! [X3 : $o,X0,X1,X2] : (($true = X3) | (($true != X3) & ($true = (in @ X0 @ X2))) | (($true != X3) & ((in @ X0 @ X1) = $true)) | ($true != (in @ X0 @ (binunion @ X2 @ X1)))) | (binunionEcases != $true))),
% 0.08/0.28 inference(nnf_transformation,[],[f10])).
% 0.08/0.28 thf(f10,plain,(
% 0.08/0.28 (binunionEcases = $true) <=> ! [X3 : $o,X0,X1,X2] : (($true = X3) | (($true != X3) & ($true = (in @ X0 @ X2))) | (($true != X3) & ((in @ X0 @ X1) = $true)) | ($true != (in @ X0 @ (binunion @ X2 @ X1))))),
% 0.08/0.28 inference(flattening,[],[f9])).
% 0.08/0.28 thf(f9,plain,(
% 0.08/0.28 ! [X3 : $o,X2,X0,X1] : (((($true = X3) | (($true != X3) & ((in @ X0 @ X1) = $true))) | (($true != X3) & ($true = (in @ X0 @ X2)))) | ($true != (in @ X0 @ (binunion @ X2 @ X1)))) <=> (binunionEcases = $true)),
% 0.08/0.28 inference(ennf_transformation,[],[f8])).
% 0.08/0.28 thf(f8,plain,(
% 0.08/0.28 ! [X3 : $o,X2,X0,X1] : (($true = (in @ X0 @ (binunion @ X2 @ X1))) => ((($true = (in @ X0 @ X2)) => ($true = X3)) => ((((in @ X0 @ X1) = $true) => ($true = X3)) => ($true = X3)))) <=> (binunionEcases = $true)),
% 0.08/0.28 inference(fool_elimination,[],[f7])).
% 0.08/0.28 thf(f7,plain,(
% 0.08/0.28 (binunionEcases = ! [X0,X1,X2,X3 : $o] : ((in @ X0 @ (binunion @ X2 @ X1)) => (((in @ X0 @ X2) => X3) => (((in @ X0 @ X1) => X3) => X3))))),
% 0.08/0.28 inference(rectify,[],[f1])).
% 0.08/0.28 thf(f1,axiom,(
% 0.08/0.28 (binunionEcases = ! [X2,X1,X0,X3 : $o] : ((in @ X2 @ (binunion @ X0 @ X1)) => (((in @ X2 @ X0) => X3) => (((in @ X2 @ X1) => X3) => X3))))),
% 0.08/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',binunionEcases)).
% 0.08/0.28 % SZS output end Proof for theBenchmark
% 0.08/0.28 % (32178)------------------------------
% 0.08/0.28 % (32178)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.28 % (32178)Termination reason: Refutation
% 0.08/0.28
% 0.08/0.28 % (32178)Memory used [KB]: 5500
% 0.08/0.28 % (32178)Time elapsed: 0.003 s
% 0.08/0.28 % (32178)Instructions burned: 3 (million)
% 0.08/0.28 % (32178)------------------------------
% 0.08/0.28 % (32178)------------------------------
% 0.08/0.28 % (32171)Success in time 0.005 s
% 0.08/0.28 % Vampire---4.8 exiting
%------------------------------------------------------------------------------