TSTP Solution File: SYO276^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO276^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n014.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:03:44 EDT 2024
% Result : Theorem 0.21s 0.40s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO276^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/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.15/0.35 % Computer : n014.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 : Mon May 20 09:07:38 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH0_THM_NEQ_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/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 % (24358)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.21/0.39 % (24354)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.21/0.39 % (24360)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.39 % (24357)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.39 % (24359)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.21/0.39 % (24356)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.21/0.39 % (24355)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.21/0.39 % (24358)Instruction limit reached!
% 0.21/0.39 % (24358)------------------------------
% 0.21/0.39 % (24358)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (24358)Termination reason: Unknown
% 0.21/0.39 % (24358)Termination phase: Saturation
% 0.21/0.39
% 0.21/0.39 % (24358)Memory used [KB]: 5500
% 0.21/0.39 % (24361)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.21/0.39 % (24358)Time elapsed: 0.004 s
% 0.21/0.39 % (24358)Instructions burned: 2 (million)
% 0.21/0.39 % (24358)------------------------------
% 0.21/0.39 % (24358)------------------------------
% 0.21/0.39 % (24357)Instruction limit reached!
% 0.21/0.39 % (24357)------------------------------
% 0.21/0.39 % (24357)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (24357)Termination reason: Unknown
% 0.21/0.39 % (24357)Termination phase: Saturation
% 0.21/0.39
% 0.21/0.39 % (24357)Memory used [KB]: 5500
% 0.21/0.39 % (24357)Time elapsed: 0.005 s
% 0.21/0.39 % (24357)Instructions burned: 2 (million)
% 0.21/0.39 % (24357)------------------------------
% 0.21/0.39 % (24357)------------------------------
% 0.21/0.39 % (24356)Refutation not found, incomplete strategy
% 0.21/0.39 % (24356)------------------------------
% 0.21/0.39 % (24356)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (24356)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.39
% 0.21/0.39
% 0.21/0.39 % (24356)Memory used [KB]: 5500
% 0.21/0.39 % (24356)Time elapsed: 0.005 s
% 0.21/0.39 % (24356)Instructions burned: 2 (million)
% 0.21/0.39 % (24356)------------------------------
% 0.21/0.39 % (24356)------------------------------
% 0.21/0.39 % (24361)Instruction limit reached!
% 0.21/0.39 % (24361)------------------------------
% 0.21/0.39 % (24361)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (24361)Termination reason: Unknown
% 0.21/0.39 % (24361)Termination phase: Saturation
% 0.21/0.39
% 0.21/0.39 % (24361)Memory used [KB]: 5500
% 0.21/0.39 % (24361)Time elapsed: 0.006 s
% 0.21/0.39 % (24361)Instructions burned: 3 (million)
% 0.21/0.39 % (24361)------------------------------
% 0.21/0.39 % (24361)------------------------------
% 0.21/0.39 % (24355)Instruction limit reached!
% 0.21/0.39 % (24355)------------------------------
% 0.21/0.39 % (24355)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (24355)Termination reason: Unknown
% 0.21/0.39 % (24355)Termination phase: Saturation
% 0.21/0.39
% 0.21/0.39 % (24355)Memory used [KB]: 5500
% 0.21/0.39 % (24355)Time elapsed: 0.007 s
% 0.21/0.39 % (24355)Instructions burned: 4 (million)
% 0.21/0.39 % (24355)------------------------------
% 0.21/0.39 % (24355)------------------------------
% 0.21/0.40 % (24359)First to succeed.
% 0.21/0.40 % (24354)Also succeeded, but the first one will report.
% 0.21/0.40 % (24359)Refutation found. Thanks to Tanya!
% 0.21/0.40 % SZS status Theorem for theBenchmark
% 0.21/0.40 % SZS output start Proof for theBenchmark
% 0.21/0.40 thf(func_def_1, type, cP: $i > $o).
% 0.21/0.40 thf(func_def_3, type, s: $i > $i).
% 0.21/0.40 thf(func_def_8, type, sK0: ($i > $i > $o) > $i).
% 0.21/0.40 thf(func_def_9, type, sK1: ($i > $i > $o) > $i).
% 0.21/0.40 thf(func_def_12, type, ph3: !>[X0: $tType]:(X0)).
% 0.21/0.40 thf(f90,plain,(
% 0.21/0.40 $false),
% 0.21/0.40 inference(avatar_sat_refutation,[],[f56,f85,f89])).
% 0.21/0.40 thf(f89,plain,(
% 0.21/0.40 spl2_2 | ~spl2_4),
% 0.21/0.40 inference(avatar_contradiction_clause,[],[f88])).
% 0.21/0.40 thf(f88,plain,(
% 0.21/0.40 $false | (spl2_2 | ~spl2_4)),
% 0.21/0.40 inference(trivial_inequality_removal,[],[f87])).
% 0.21/0.40 thf(f87,plain,(
% 0.21/0.40 ((s @ (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) != (s @ (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))))) | (spl2_2 | ~spl2_4)),
% 0.21/0.40 inference(forward_demodulation,[],[f86,f55])).
% 0.21/0.40 thf(f55,plain,(
% 0.21/0.40 ((sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))) = (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) | ~spl2_4),
% 0.21/0.40 inference(avatar_component_clause,[],[f53])).
% 0.21/0.40 thf(f53,plain,(
% 0.21/0.40 spl2_4 <=> ((sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))) = (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))))),
% 0.21/0.40 introduced(avatar_definition,[new_symbols(naming,[spl2_4])])).
% 0.21/0.40 thf(f86,plain,(
% 0.21/0.40 ((s @ (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) != (s @ (sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))))) | spl2_2),
% 0.21/0.40 inference(subsumption_resolution,[],[f81,f46])).
% 0.21/0.40 thf(f46,plain,(
% 0.21/0.40 (n != m) | spl2_2),
% 0.21/0.40 inference(avatar_component_clause,[],[f44])).
% 0.21/0.40 thf(f44,plain,(
% 0.21/0.40 spl2_2 <=> (n = m)),
% 0.21/0.40 introduced(avatar_definition,[new_symbols(naming,[spl2_2])])).
% 0.21/0.40 thf(f81,plain,(
% 0.21/0.40 ((s @ (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) != (s @ (sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))))) | (n = m)),
% 0.21/0.40 inference(equality_proxy_clausification,[],[f80])).
% 0.21/0.40 thf(f80,plain,(
% 0.21/0.40 ((m = n) = $true) | ((s @ (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) != (s @ (sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))))),
% 0.21/0.40 inference(equality_proxy_clausification,[],[f79])).
% 0.21/0.40 thf(f79,plain,(
% 0.21/0.40 (((s @ (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) = (s @ (sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))))) != $true) | ((m = n) = $true)),
% 0.21/0.40 inference(trivial_inequality_removal,[],[f78])).
% 0.21/0.40 thf(f78,plain,(
% 0.21/0.40 ($true != $true) | (((s @ (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) = (s @ (sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))))) != $true) | ((m = n) = $true)),
% 0.21/0.40 inference(boolean_simplification,[],[f77])).
% 0.21/0.40 thf(f77,plain,(
% 0.21/0.40 (((s @ (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) = (s @ (sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))))) != $true) | ((m = n) = $true) | ((cO = cO) != $true)),
% 0.21/0.40 inference(beta_eta_normalization,[],[f57])).
% 0.21/0.40 thf(f57,plain,(
% 0.21/0.40 ($true != ((^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))) @ (s @ (sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) @ (s @ (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))))) | (((^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))) @ n @ m) = $true) | ($true != ((^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))) @ cO @ cO))),
% 0.21/0.40 inference(primitive_instantiation,[],[f11])).
% 0.21/0.40 thf(f11,plain,(
% 0.21/0.40 ( ! [X0 : $i > $i > $o] : (($true != (X0 @ (s @ (sK1 @ X0)) @ (s @ (sK0 @ X0)))) | ((X0 @ cO @ cO) != $true) | ((X0 @ n @ m) = $true)) )),
% 0.21/0.40 inference(cnf_transformation,[],[f9])).
% 0.21/0.40 thf(f9,plain,(
% 0.21/0.40 ((cP @ n) = $true) & ! [X0 : $i > $i > $o] : (((X0 @ n @ m) = $true) | ((X0 @ cO @ cO) != $true) | (($true = (X0 @ (sK1 @ X0) @ (sK0 @ X0))) & ($true != (X0 @ (s @ (sK1 @ X0)) @ (s @ (sK0 @ X0)))))) & ((cP @ m) != $true)),
% 0.21/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f8])).
% 0.21/0.40 thf(f8,plain,(
% 0.21/0.40 ! [X0 : $i > $i > $o] : (? [X1,X2] : (((X0 @ X2 @ X1) = $true) & ($true != (X0 @ (s @ X2) @ (s @ X1)))) => (($true = (X0 @ (sK1 @ X0) @ (sK0 @ X0))) & ($true != (X0 @ (s @ (sK1 @ X0)) @ (s @ (sK0 @ X0))))))),
% 0.21/0.40 introduced(choice_axiom,[])).
% 0.21/0.40 thf(f7,plain,(
% 0.21/0.40 ((cP @ n) = $true) & ! [X0 : $i > $i > $o] : (((X0 @ n @ m) = $true) | ((X0 @ cO @ cO) != $true) | ? [X1,X2] : (((X0 @ X2 @ X1) = $true) & ($true != (X0 @ (s @ X2) @ (s @ X1))))) & ((cP @ m) != $true)),
% 0.21/0.40 inference(flattening,[],[f6])).
% 0.21/0.40 thf(f6,plain,(
% 0.21/0.40 ((cP @ m) != $true) & (((cP @ n) = $true) & ! [X0 : $i > $i > $o] : (((X0 @ n @ m) = $true) | (((X0 @ cO @ cO) != $true) | ? [X1,X2] : (((X0 @ X2 @ X1) = $true) & ($true != (X0 @ (s @ X2) @ (s @ X1)))))))),
% 0.21/0.40 inference(ennf_transformation,[],[f5])).
% 0.21/0.40 thf(f5,plain,(
% 0.21/0.40 ~((((cP @ n) = $true) & ! [X0 : $i > $i > $o] : ((((X0 @ cO @ cO) = $true) & ! [X1,X2] : (((X0 @ X2 @ X1) = $true) => ($true = (X0 @ (s @ X2) @ (s @ X1))))) => ((X0 @ n @ m) = $true))) => ((cP @ m) = $true))),
% 0.21/0.40 inference(fool_elimination,[],[f4])).
% 0.21/0.40 thf(f4,plain,(
% 0.21/0.40 ~(((cP @ n) & ! [X0 : $i > $i > $o] : ((! [X1,X2] : ((X0 @ X2 @ X1) => (X0 @ (s @ X2) @ (s @ X1))) & (X0 @ cO @ cO)) => (X0 @ n @ m))) => (cP @ m))),
% 0.21/0.40 inference(rectify,[],[f2])).
% 0.21/0.40 thf(f2,negated_conjecture,(
% 0.21/0.40 ~(((cP @ n) & ! [X0 : $i > $i > $o] : ((! [X2,X1] : ((X0 @ X1 @ X2) => (X0 @ (s @ X1) @ (s @ X2))) & (X0 @ cO @ cO)) => (X0 @ n @ m))) => (cP @ m))),
% 0.21/0.40 inference(negated_conjecture,[],[f1])).
% 0.21/0.40 thf(f1,conjecture,(
% 0.21/0.40 ((cP @ n) & ! [X0 : $i > $i > $o] : ((! [X2,X1] : ((X0 @ X1 @ X2) => (X0 @ (s @ X1) @ (s @ X2))) & (X0 @ cO @ cO)) => (X0 @ n @ m))) => (cP @ m)),
% 0.21/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBLEDSOE_FENG_SV_I2)).
% 0.21/0.40 thf(f85,plain,(
% 0.21/0.40 ~spl2_2),
% 0.21/0.40 inference(avatar_contradiction_clause,[],[f84])).
% 0.21/0.40 thf(f84,plain,(
% 0.21/0.40 $false | ~spl2_2),
% 0.21/0.40 inference(subsumption_resolution,[],[f83,f10])).
% 0.21/0.40 thf(f10,plain,(
% 0.21/0.40 ((cP @ m) != $true)),
% 0.21/0.40 inference(cnf_transformation,[],[f9])).
% 0.21/0.40 thf(f83,plain,(
% 0.21/0.40 ((cP @ m) = $true) | ~spl2_2),
% 0.21/0.40 inference(superposition,[],[f13,f45])).
% 0.21/0.40 thf(f45,plain,(
% 0.21/0.40 (n = m) | ~spl2_2),
% 0.21/0.40 inference(avatar_component_clause,[],[f44])).
% 0.21/0.40 thf(f13,plain,(
% 0.21/0.40 ((cP @ n) = $true)),
% 0.21/0.40 inference(cnf_transformation,[],[f9])).
% 0.21/0.40 thf(f56,plain,(
% 0.21/0.40 spl2_2 | spl2_4),
% 0.21/0.40 inference(avatar_split_clause,[],[f25,f53,f44])).
% 0.21/0.40 thf(f25,plain,(
% 0.21/0.40 ((sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))) = (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) | (n = m)),
% 0.21/0.40 inference(equality_proxy_clausification,[],[f24])).
% 0.21/0.40 thf(f24,plain,(
% 0.21/0.40 ((sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))) = (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) | ((m = n) = $true)),
% 0.21/0.40 inference(equality_proxy_clausification,[],[f23])).
% 0.21/0.40 thf(f23,plain,(
% 0.21/0.40 (((sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))) = (sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) = $true) | ((m = n) = $true)),
% 0.21/0.40 inference(trivial_inequality_removal,[],[f22])).
% 0.21/0.40 thf(f22,plain,(
% 0.21/0.40 ($true != $true) | ((m = n) = $true) | (((sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))) = (sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) = $true)),
% 0.21/0.40 inference(boolean_simplification,[],[f21])).
% 0.21/0.40 thf(f21,plain,(
% 0.21/0.40 (((sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))) = (sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) = $true) | ((cO = cO) != $true) | ((m = n) = $true)),
% 0.21/0.40 inference(beta_eta_normalization,[],[f14])).
% 0.21/0.40 thf(f14,plain,(
% 0.21/0.40 (((^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))) @ (sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))) @ (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) = $true) | ($true != ((^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))) @ cO @ cO)) | (((^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))) @ n @ m) = $true)),
% 0.21/0.40 inference(primitive_instantiation,[],[f12])).
% 0.21/0.40 thf(f12,plain,(
% 0.21/0.40 ( ! [X0 : $i > $i > $o] : (($true = (X0 @ (sK1 @ X0) @ (sK0 @ X0))) | ((X0 @ cO @ cO) != $true) | ((X0 @ n @ m) = $true)) )),
% 0.21/0.40 inference(cnf_transformation,[],[f9])).
% 0.21/0.40 % SZS output end Proof for theBenchmark
% 0.21/0.40 % (24359)------------------------------
% 0.21/0.40 % (24359)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (24359)Termination reason: Refutation
% 0.21/0.40
% 0.21/0.40 % (24359)Memory used [KB]: 5500
% 0.21/0.40 % (24359)Time elapsed: 0.013 s
% 0.21/0.40 % (24359)Instructions burned: 7 (million)
% 0.21/0.40 % (24359)------------------------------
% 0.21/0.40 % (24359)------------------------------
% 0.21/0.40 % (24353)Success in time 0.034 s
% 0.21/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------