TSTP Solution File: SYO362^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO362^5 : TPTP v8.2.0. Released v4.0.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 : n008.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 09:04:08 EDT 2024
% Result : Theorem 0.22s 0.39s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYO362^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/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.14/0.35 % Computer : n008.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 : Mon May 20 08:58:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 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/sandbox2/benchmark/theBenchmark.p
% 0.22/0.38 % (14806)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.22/0.38 % (14807)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.22/0.38 % (14810)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.22/0.38 % (14811)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.22/0.38 % (14812)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.22/0.38 % (14809)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.22/0.38 % (14810)Instruction limit reached!
% 0.22/0.38 % (14810)------------------------------
% 0.22/0.38 % (14810)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (14810)Termination reason: Unknown
% 0.22/0.38 % (14810)Termination phase: Property scanning
% 0.22/0.38
% 0.22/0.38 % (14810)Memory used [KB]: 895
% 0.22/0.38 % (14810)Time elapsed: 0.003 s
% 0.22/0.38 % (14810)Instructions burned: 2 (million)
% 0.22/0.38 % (14810)------------------------------
% 0.22/0.38 % (14810)------------------------------
% 0.22/0.38 % (14809)Instruction limit reached!
% 0.22/0.38 % (14809)------------------------------
% 0.22/0.38 % (14809)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (14809)Termination reason: Unknown
% 0.22/0.38 % (14809)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (14809)Memory used [KB]: 5500
% 0.22/0.38 % (14809)Time elapsed: 0.003 s
% 0.22/0.38 % (14809)Instructions burned: 2 (million)
% 0.22/0.38 % (14809)------------------------------
% 0.22/0.38 % (14809)------------------------------
% 0.22/0.38 % (14808)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.22/0.38 % (14807)Instruction limit reached!
% 0.22/0.38 % (14807)------------------------------
% 0.22/0.38 % (14807)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (14807)Termination reason: Unknown
% 0.22/0.38 % (14807)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (14807)Memory used [KB]: 5500
% 0.22/0.38 % (14807)Time elapsed: 0.005 s
% 0.22/0.38 % (14807)Instructions burned: 4 (million)
% 0.22/0.38 % (14807)------------------------------
% 0.22/0.38 % (14807)------------------------------
% 0.22/0.38 % (14813)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.22/0.38 % (14813)Instruction limit reached!
% 0.22/0.38 % (14813)------------------------------
% 0.22/0.38 % (14813)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (14813)Termination reason: Unknown
% 0.22/0.38 % (14813)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (14813)Memory used [KB]: 5500
% 0.22/0.38 % (14813)Time elapsed: 0.005 s
% 0.22/0.38 % (14813)Instructions burned: 4 (million)
% 0.22/0.38 % (14813)------------------------------
% 0.22/0.38 % (14813)------------------------------
% 0.22/0.38 % (14812)First to succeed.
% 0.22/0.39 % (14812)Refutation found. Thanks to Tanya!
% 0.22/0.39 % SZS status Theorem for theBenchmark
% 0.22/0.39 % SZS output start Proof for theBenchmark
% 0.22/0.39 thf(func_def_0, type, cK: ($i > $o) > $i > $o).
% 0.22/0.39 thf(func_def_7, type, sK0: $i > $o).
% 0.22/0.39 thf(func_def_8, type, sK1: $i > $o).
% 0.22/0.39 thf(func_def_12, type, ph4: !>[X0: $tType]:(X0)).
% 0.22/0.39 thf(func_def_14, type, sK6: ($i > $o) > $i).
% 0.22/0.39 thf(f84,plain,(
% 0.22/0.39 $false),
% 0.22/0.39 inference(trivial_inequality_removal,[],[f83])).
% 0.22/0.39 thf(f83,plain,(
% 0.22/0.39 ($true = $false)),
% 0.22/0.39 inference(duplicate_literal_removal,[],[f77])).
% 0.22/0.39 thf(f77,plain,(
% 0.22/0.39 ($true = $false) | ($true = $false)),
% 0.22/0.39 inference(superposition,[],[f66,f73])).
% 0.22/0.39 thf(f73,plain,(
% 0.22/0.39 ((sK1 @ (sK6 @ sK1)) = $true)),
% 0.22/0.39 inference(beta_eta_normalization,[],[f72])).
% 0.22/0.39 thf(f72,plain,(
% 0.22/0.39 (((^[Y0 : $i]: (sK1 @ ((^[Y1 : $i]: (Y1)) @ Y0))) @ (sK6 @ (^[Y0 : $i]: (sK1 @ ((^[Y1 : $i]: (Y1)) @ Y0))))) = $true)),
% 0.22/0.39 inference(trivial_inequality_removal,[],[f70])).
% 0.22/0.39 thf(f70,plain,(
% 0.22/0.39 (((^[Y0 : $i]: (sK1 @ ((^[Y1 : $i]: (Y1)) @ Y0))) @ (sK6 @ (^[Y0 : $i]: (sK1 @ ((^[Y1 : $i]: (Y1)) @ Y0))))) = $true) | ($true != $true)),
% 0.22/0.39 inference(equality_factoring,[],[f69])).
% 0.22/0.39 thf(f69,plain,(
% 0.22/0.39 ( ! [X0 : $i > $o] : (((sK1 @ (sK6 @ X0)) = $true) | ($true = (X0 @ (sK6 @ X0)))) )),
% 0.22/0.39 inference(subsumption_resolution,[],[f68,f13])).
% 0.22/0.39 thf(f13,plain,(
% 0.22/0.39 ( ! [X3 : $i] : (($true != (sK0 @ X3)) | ($true = (sK1 @ X3))) )),
% 0.22/0.39 inference(cnf_transformation,[],[f11])).
% 0.22/0.39 thf(f11,plain,(
% 0.22/0.39 ((((cK @ sK0 @ sK2) = $true) & ($true != (cK @ sK1 @ sK2))) & ! [X3] : (($true = (sK1 @ X3)) | ($true != (sK0 @ X3)))) & ! [X4 : $i > $o,X5 : $i > $o] : ((^[Y0 : $i]: ((cK @ X4 @ Y0) | (cK @ X5 @ Y0))) = (cK @ (^[Y0 : $i]: ((X5 @ Y0) | (X4 @ Y0)))))),
% 0.22/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f10,f9])).
% 0.22/0.39 thf(f9,plain,(
% 0.22/0.39 ? [X0 : $i > $o,X1 : $i > $o] : (? [X2] : (($true = (cK @ X0 @ X2)) & ((cK @ X1 @ X2) != $true)) & ! [X3] : (($true = (X1 @ X3)) | ($true != (X0 @ X3)))) => (? [X2] : (((cK @ sK0 @ X2) = $true) & ((cK @ sK1 @ X2) != $true)) & ! [X3] : (($true = (sK1 @ X3)) | ($true != (sK0 @ X3))))),
% 0.22/0.39 introduced(choice_axiom,[])).
% 0.22/0.39 thf(f10,plain,(
% 0.22/0.39 ? [X2] : (((cK @ sK0 @ X2) = $true) & ((cK @ sK1 @ X2) != $true)) => (((cK @ sK0 @ sK2) = $true) & ($true != (cK @ sK1 @ sK2)))),
% 0.22/0.39 introduced(choice_axiom,[])).
% 0.22/0.39 thf(f8,plain,(
% 0.22/0.39 ? [X0 : $i > $o,X1 : $i > $o] : (? [X2] : (($true = (cK @ X0 @ X2)) & ((cK @ X1 @ X2) != $true)) & ! [X3] : (($true = (X1 @ X3)) | ($true != (X0 @ X3)))) & ! [X4 : $i > $o,X5 : $i > $o] : ((^[Y0 : $i]: ((cK @ X4 @ Y0) | (cK @ X5 @ Y0))) = (cK @ (^[Y0 : $i]: ((X5 @ Y0) | (X4 @ Y0)))))),
% 0.22/0.39 inference(rectify,[],[f7])).
% 0.22/0.39 thf(f7,plain,(
% 0.22/0.39 ? [X2 : $i > $o,X3 : $i > $o] : (? [X5] : (($true = (cK @ X2 @ X5)) & ($true != (cK @ X3 @ X5))) & ! [X4] : (($true = (X3 @ X4)) | ($true != (X2 @ X4)))) & ! [X0 : $i > $o,X1 : $i > $o] : ((cK @ (^[Y0 : $i]: ((X1 @ Y0) | (X0 @ Y0)))) = (^[Y0 : $i]: ((cK @ X0 @ Y0) | (cK @ X1 @ Y0))))),
% 0.22/0.39 inference(ennf_transformation,[],[f6])).
% 0.22/0.39 thf(f6,plain,(
% 0.22/0.39 ~(! [X0 : $i > $o,X1 : $i > $o] : ((cK @ (^[Y0 : $i]: ((X1 @ Y0) | (X0 @ Y0)))) = (^[Y0 : $i]: ((cK @ X0 @ Y0) | (cK @ X1 @ Y0)))) => ! [X2 : $i > $o,X3 : $i > $o] : (! [X4] : (($true = (X2 @ X4)) => ($true = (X3 @ X4))) => ! [X5] : (($true = (cK @ X2 @ X5)) => ($true = (cK @ X3 @ X5)))))),
% 0.22/0.39 inference(rectify,[],[f5])).
% 0.22/0.39 thf(f5,plain,(
% 0.22/0.39 ~(! [X0 : $i > $o,X1 : $i > $o] : ((cK @ (^[Y0 : $i]: ((X1 @ Y0) | (X0 @ Y0)))) = (^[Y0 : $i]: ((cK @ X0 @ Y0) | (cK @ X1 @ Y0)))) => ! [X4 : $i > $o,X5 : $i > $o] : (! [X6] : (($true = (X4 @ X6)) => ($true = (X5 @ X6))) => ! [X7] : (($true = (cK @ X4 @ X7)) => ($true = (cK @ X5 @ X7)))))),
% 0.22/0.39 inference(fool_elimination,[],[f4])).
% 0.22/0.39 thf(f4,plain,(
% 0.22/0.39 ~(! [X0 : $i > $o,X1 : $i > $o] : ((cK @ (^[X2 : $i] : ((X0 @ X2) | (X1 @ X2)))) = (^[X3 : $i] : ((cK @ X1 @ X3) | (cK @ X0 @ X3)))) => ! [X4 : $i > $o,X5 : $i > $o] : (! [X6] : ((X4 @ X6) => (X5 @ X6)) => ! [X7] : ((cK @ X4 @ X7) => (cK @ X5 @ X7))))),
% 0.22/0.39 inference(rectify,[],[f2])).
% 0.22/0.39 thf(f2,negated_conjecture,(
% 0.22/0.39 ~(! [X1 : $i > $o,X0 : $i > $o] : ((cK @ (^[X2 : $i] : ((X1 @ X2) | (X0 @ X2)))) = (^[X3 : $i] : ((cK @ X0 @ X3) | (cK @ X1 @ X3)))) => ! [X0 : $i > $o,X1 : $i > $o] : (! [X4] : ((X0 @ X4) => (X1 @ X4)) => ! [X4] : ((cK @ X0 @ X4) => (cK @ X1 @ X4))))),
% 0.22/0.39 inference(negated_conjecture,[],[f1])).
% 0.22/0.39 thf(f1,conjecture,(
% 0.22/0.39 ! [X1 : $i > $o,X0 : $i > $o] : ((cK @ (^[X2 : $i] : ((X1 @ X2) | (X0 @ X2)))) = (^[X3 : $i] : ((cK @ X0 @ X3) | (cK @ X1 @ X3)))) => ! [X0 : $i > $o,X1 : $i > $o] : (! [X4] : ((X0 @ X4) => (X1 @ X4)) => ! [X4] : ((cK @ X0 @ X4) => (cK @ X1 @ X4)))),
% 0.22/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM631A_pme)).
% 0.22/0.39 thf(f68,plain,(
% 0.22/0.39 ( ! [X0 : $i > $o] : (((sK0 @ (sK6 @ X0)) = $true) | ($true = (X0 @ (sK6 @ X0))) | ((sK1 @ (sK6 @ X0)) = $true)) )),
% 0.22/0.39 inference(binary_proxy_clausification,[],[f64])).
% 0.22/0.39 thf(f64,plain,(
% 0.22/0.39 ( ! [X0 : $i > $o] : ((((sK0 @ (sK6 @ X0)) | (X0 @ (sK6 @ X0))) = $true) | ((sK1 @ (sK6 @ X0)) = $true)) )),
% 0.22/0.39 inference(binary_proxy_clausification,[],[f63])).
% 0.22/0.39 thf(f63,plain,(
% 0.22/0.39 ( ! [X0 : $i > $o] : (((sK1 @ (sK6 @ X0)) != ((sK0 @ (sK6 @ X0)) | (X0 @ (sK6 @ X0))))) )),
% 0.22/0.39 inference(beta_eta_normalization,[],[f61])).
% 0.22/0.39 thf(f61,plain,(
% 0.22/0.39 ( ! [X0 : $i > $o] : (((sK1 @ (sK6 @ X0)) != ((^[Y0 : $i]: ((sK0 @ Y0) | (X0 @ Y0))) @ (sK6 @ X0)))) )),
% 0.22/0.39 inference(negative_extensionality,[],[f59])).
% 0.22/0.39 thf(f59,plain,(
% 0.22/0.39 ( ! [X0 : $i > $o] : ((sK1 != (^[Y0 : $i]: ((sK0 @ Y0) | (X0 @ Y0))))) )),
% 0.22/0.39 inference(trivial_inequality_removal,[],[f53])).
% 0.22/0.39 thf(f53,plain,(
% 0.22/0.39 ( ! [X0 : $i > $o] : ((sK1 != (^[Y0 : $i]: ((sK0 @ Y0) | (X0 @ Y0)))) | ($true != $true)) )),
% 0.22/0.39 inference(constrained_superposition,[],[f14,f49])).
% 0.22/0.39 thf(f49,plain,(
% 0.22/0.39 ( ! [X0 : $i > $o] : (((cK @ (^[Y0 : $i]: ((sK0 @ Y0) | (X0 @ Y0))) @ sK2) = $true)) )),
% 0.22/0.39 inference(trivial_inequality_removal,[],[f44])).
% 0.22/0.39 thf(f44,plain,(
% 0.22/0.39 ( ! [X0 : $i > $o] : (($true = $false) | ((cK @ (^[Y0 : $i]: ((sK0 @ Y0) | (X0 @ Y0))) @ sK2) = $true)) )),
% 0.22/0.39 inference(superposition,[],[f42,f15])).
% 0.22/0.39 thf(f15,plain,(
% 0.22/0.39 ((cK @ sK0 @ sK2) = $true)),
% 0.22/0.39 inference(cnf_transformation,[],[f11])).
% 0.22/0.39 thf(f42,plain,(
% 0.22/0.39 ( ! [X6 : $i,X4 : $i > $o,X5 : $i > $o] : (($false = (cK @ X5 @ X6)) | ((cK @ (^[Y0 : $i]: ((X5 @ Y0) | (X4 @ Y0))) @ X6) = $true)) )),
% 0.22/0.39 inference(binary_proxy_clausification,[],[f39])).
% 0.22/0.39 thf(f39,plain,(
% 0.22/0.39 ( ! [X6 : $i,X4 : $i > $o,X5 : $i > $o] : (((cK @ (^[Y0 : $i]: ((X5 @ Y0) | (X4 @ Y0))) @ X6) = $true) | ($false = ((cK @ X4 @ X6) | (cK @ X5 @ X6)))) )),
% 0.22/0.39 inference(binary_proxy_clausification,[],[f38])).
% 0.22/0.39 thf(f38,plain,(
% 0.22/0.39 ( ! [X6 : $i,X4 : $i > $o,X5 : $i > $o] : (((cK @ (^[Y0 : $i]: ((X5 @ Y0) | (X4 @ Y0))) @ X6) = ((cK @ X4 @ X6) | (cK @ X5 @ X6)))) )),
% 0.22/0.39 inference(beta_eta_normalization,[],[f36])).
% 0.22/0.39 thf(f36,plain,(
% 0.22/0.39 ( ! [X6 : $i,X4 : $i > $o,X5 : $i > $o] : (((cK @ (^[Y0 : $i]: ((X5 @ Y0) | (X4 @ Y0))) @ X6) = ((^[Y0 : $i]: ((cK @ X4 @ Y0) | (cK @ X5 @ Y0))) @ X6))) )),
% 0.22/0.39 inference(argument_congruence,[],[f12])).
% 0.22/0.39 thf(f12,plain,(
% 0.22/0.39 ( ! [X4 : $i > $o,X5 : $i > $o] : (((^[Y0 : $i]: ((cK @ X4 @ Y0) | (cK @ X5 @ Y0))) = (cK @ (^[Y0 : $i]: ((X5 @ Y0) | (X4 @ Y0)))))) )),
% 0.22/0.39 inference(cnf_transformation,[],[f11])).
% 0.22/0.39 thf(f14,plain,(
% 0.22/0.39 ($true != (cK @ sK1 @ sK2))),
% 0.22/0.39 inference(cnf_transformation,[],[f11])).
% 0.22/0.39 thf(f66,plain,(
% 0.22/0.39 ( ! [X0 : $i > $o] : (((sK1 @ (sK6 @ X0)) = $false) | ($false = (X0 @ (sK6 @ X0)))) )),
% 0.22/0.39 inference(binary_proxy_clausification,[],[f65])).
% 0.22/0.39 thf(f65,plain,(
% 0.22/0.39 ( ! [X0 : $i > $o] : ((((sK0 @ (sK6 @ X0)) | (X0 @ (sK6 @ X0))) = $false) | ((sK1 @ (sK6 @ X0)) = $false)) )),
% 0.22/0.39 inference(binary_proxy_clausification,[],[f63])).
% 0.22/0.39 % SZS output end Proof for theBenchmark
% 0.22/0.39 % (14812)------------------------------
% 0.22/0.39 % (14812)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (14812)Termination reason: Refutation
% 0.22/0.39
% 0.22/0.39 % (14812)Memory used [KB]: 5628
% 0.22/0.39 % (14812)Time elapsed: 0.012 s
% 0.22/0.39 % (14812)Instructions burned: 13 (million)
% 0.22/0.39 % (14812)------------------------------
% 0.22/0.39 % (14812)------------------------------
% 0.22/0.39 % (14804)Success in time 0.014 s
% 0.22/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------