TSTP Solution File: SYO222^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO222^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 : n003.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:33 EDT 2024
% Result : Theorem 0.16s 0.41s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SYO222^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.15 % 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.16/0.38 % Computer : n003.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Mon May 20 10:26:23 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.16/0.38 This is a TH0_THM_EQU_NAR problem
% 0.16/0.38 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.16/0.40 % (6337)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.16/0.40 % (6338)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.16/0.40 % (6339)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.16/0.40 % (6340)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.40 % (6341)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.16/0.40 % (6342)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.16/0.40 % (6343)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.16/0.40 % (6344)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.16/0.40 % (6340)Instruction limit reached!
% 0.16/0.40 % (6340)------------------------------
% 0.16/0.40 % (6340)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (6340)Termination reason: Unknown
% 0.16/0.40 % (6340)Termination phase: Saturation
% 0.16/0.40
% 0.16/0.40 % (6341)Instruction limit reached!
% 0.16/0.40 % (6341)------------------------------
% 0.16/0.40 % (6341)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (6340)Memory used [KB]: 5373
% 0.16/0.40 % (6340)Time elapsed: 0.003 s
% 0.16/0.40 % (6340)Instructions burned: 2 (million)
% 0.16/0.40 % (6340)------------------------------
% 0.16/0.40 % (6340)------------------------------
% 0.16/0.40 % (6341)Termination reason: Unknown
% 0.16/0.40 % (6341)Termination phase: Saturation
% 0.16/0.40
% 0.16/0.40 % (6341)Memory used [KB]: 895
% 0.16/0.40 % (6341)Time elapsed: 0.003 s
% 0.16/0.40 % (6341)Instructions burned: 2 (million)
% 0.16/0.40 % (6341)------------------------------
% 0.16/0.40 % (6341)------------------------------
% 0.16/0.40 % (6339)Refutation not found, incomplete strategy
% 0.16/0.40 % (6339)------------------------------
% 0.16/0.40 % (6339)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (6339)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.40
% 0.16/0.40
% 0.16/0.40 % (6339)Memory used [KB]: 5500
% 0.16/0.40 % (6339)Time elapsed: 0.004 s
% 0.16/0.40 % (6339)Instructions burned: 2 (million)
% 0.16/0.40 % (6339)------------------------------
% 0.16/0.40 % (6339)------------------------------
% 0.16/0.40 % (6344)Instruction limit reached!
% 0.16/0.40 % (6344)------------------------------
% 0.16/0.40 % (6344)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (6338)Instruction limit reached!
% 0.16/0.40 % (6338)------------------------------
% 0.16/0.40 % (6338)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (6338)Termination reason: Unknown
% 0.16/0.40 % (6338)Termination phase: Saturation
% 0.16/0.40
% 0.16/0.40 % (6338)Memory used [KB]: 5500
% 0.16/0.40 % (6338)Time elapsed: 0.005 s
% 0.16/0.40 % (6338)Instructions burned: 4 (million)
% 0.16/0.40 % (6338)------------------------------
% 0.16/0.40 % (6338)------------------------------
% 0.16/0.40 % (6344)Termination reason: Unknown
% 0.16/0.40 % (6344)Termination phase: Saturation
% 0.16/0.40
% 0.16/0.40 % (6344)Memory used [KB]: 5500
% 0.16/0.40 % (6344)Time elapsed: 0.004 s
% 0.16/0.40 % (6344)Instructions burned: 3 (million)
% 0.16/0.40 % (6344)------------------------------
% 0.16/0.40 % (6344)------------------------------
% 0.16/0.41 % (6337)First to succeed.
% 0.16/0.41 % (6342)Also succeeded, but the first one will report.
% 0.16/0.41 % (6337)Refutation found. Thanks to Tanya!
% 0.16/0.41 % SZS status Theorem for theBenchmark
% 0.16/0.41 % SZS output start Proof for theBenchmark
% 0.16/0.41 thf(func_def_0, type, f: $i > $i).
% 0.16/0.41 thf(func_def_2, type, cP: $i > $o).
% 0.16/0.41 thf(func_def_6, type, sK0: ($i > $o) > $i).
% 0.16/0.41 thf(func_def_9, type, ph2: !>[X0: $tType]:(X0)).
% 0.16/0.41 thf(f102,plain,(
% 0.16/0.41 $false),
% 0.16/0.41 inference(avatar_sat_refutation,[],[f31,f32,f64,f94])).
% 0.16/0.41 thf(f94,plain,(
% 0.16/0.41 ~spl1_4),
% 0.16/0.41 inference(avatar_contradiction_clause,[],[f93])).
% 0.16/0.41 thf(f93,plain,(
% 0.16/0.41 $false | ~spl1_4),
% 0.16/0.41 inference(trivial_inequality_removal,[],[f92])).
% 0.16/0.41 thf(f92,plain,(
% 0.16/0.41 ($true = $false) | ~spl1_4),
% 0.16/0.41 inference(beta_eta_normalization,[],[f76])).
% 0.16/0.41 thf(f76,plain,(
% 0.16/0.41 ($true = ((^[Y0 : $i]: ($false)) @ (f @ (sK0 @ (^[Y0 : $i]: ($false)))))) | ~spl1_4),
% 0.16/0.41 inference(primitive_instantiation,[],[f30])).
% 0.16/0.41 thf(f30,plain,(
% 0.16/0.41 ( ! [X0 : $i > $o] : (($true = (X0 @ (f @ (sK0 @ X0))))) ) | ~spl1_4),
% 0.16/0.41 inference(avatar_component_clause,[],[f29])).
% 0.16/0.41 thf(f29,plain,(
% 0.16/0.41 spl1_4 <=> ! [X0 : $i > $o] : ($true = (X0 @ (f @ (sK0 @ X0))))),
% 0.16/0.41 introduced(avatar_definition,[new_symbols(naming,[spl1_4])])).
% 0.16/0.41 thf(f64,plain,(
% 0.16/0.41 ~spl1_2 | ~spl1_3),
% 0.16/0.41 inference(avatar_contradiction_clause,[],[f63])).
% 0.16/0.41 thf(f63,plain,(
% 0.16/0.41 $false | (~spl1_2 | ~spl1_3)),
% 0.16/0.41 inference(equality_resolution,[],[f62])).
% 0.16/0.41 thf(f62,plain,(
% 0.16/0.41 ( ! [X0 : $i] : (((f @ a) != X0)) ) | (~spl1_2 | ~spl1_3)),
% 0.16/0.41 inference(equality_resolution,[],[f61])).
% 0.16/0.41 thf(f61,plain,(
% 0.16/0.41 ( ! [X0 : $i,X1 : $i] : (((f @ a) != X0) | (X0 != X1)) ) | (~spl1_2 | ~spl1_3)),
% 0.16/0.41 inference(trivial_inequality_removal,[],[f57])).
% 0.16/0.41 thf(f57,plain,(
% 0.16/0.41 ( ! [X0 : $i,X1 : $i] : (($true != $true) | ((f @ a) != X0) | (X0 != X1)) ) | (~spl1_2 | ~spl1_3)),
% 0.16/0.41 inference(superposition,[],[f56,f26])).
% 0.16/0.41 thf(f26,plain,(
% 0.16/0.41 ((cP @ a) = $true) | ~spl1_3),
% 0.16/0.41 inference(avatar_component_clause,[],[f24])).
% 0.16/0.41 thf(f24,plain,(
% 0.16/0.41 spl1_3 <=> ((cP @ a) = $true)),
% 0.16/0.41 introduced(avatar_definition,[new_symbols(naming,[spl1_3])])).
% 0.16/0.41 thf(f56,plain,(
% 0.16/0.41 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((cP @ X1) != $true) | ((f @ X1) != X0) | (X0 != X2)) ) | ~spl1_2),
% 0.16/0.41 inference(equality_proxy_clausification,[],[f53])).
% 0.16/0.41 thf(f53,plain,(
% 0.16/0.41 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((f @ X1) != X0) | ($true != (X0 = X2)) | ((cP @ X1) != $true)) ) | ~spl1_2),
% 0.16/0.41 inference(superposition,[],[f10,f48])).
% 0.16/0.41 thf(f48,plain,(
% 0.16/0.41 ( ! [X0 : $i,X1 : $i] : (((sK0 @ (= @ X0)) = X1) | ((f @ X1) != X0)) ) | ~spl1_2),
% 0.16/0.41 inference(superposition,[],[f21,f34])).
% 0.16/0.41 thf(f34,plain,(
% 0.16/0.41 ( ! [X0 : $i] : (((f @ (sK0 @ (= @ X0))) = X0)) )),
% 0.16/0.41 inference(leibniz_equality_elimination,[],[f11])).
% 0.16/0.41 thf(f11,plain,(
% 0.16/0.41 ( ! [X3 : $i,X0 : $i > $o] : (($true = (X0 @ (f @ (sK0 @ X0)))) | ((X0 @ X3) != $true)) )),
% 0.16/0.41 inference(cnf_transformation,[],[f9])).
% 0.16/0.41 thf(f9,plain,(
% 0.16/0.41 ! [X0 : $i > $o] : ((((cP @ a) = $true) & ! [X1,X2] : (((f @ X1) != (f @ X2)) | (X1 = X2)) & ! [X3] : ((X0 @ X3) != $true)) | (($true = (X0 @ (f @ (sK0 @ X0)))) & ($true != (cP @ (sK0 @ X0)))))),
% 0.16/0.41 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8])).
% 0.16/0.41 thf(f8,plain,(
% 0.16/0.41 ! [X0 : $i > $o] : (? [X4] : (($true = (X0 @ (f @ X4))) & ($true != (cP @ X4))) => (($true = (X0 @ (f @ (sK0 @ X0)))) & ($true != (cP @ (sK0 @ X0)))))),
% 0.16/0.41 introduced(choice_axiom,[])).
% 0.16/0.41 thf(f7,plain,(
% 0.16/0.41 ! [X0 : $i > $o] : ((((cP @ a) = $true) & ! [X1,X2] : (((f @ X1) != (f @ X2)) | (X1 = X2)) & ! [X3] : ((X0 @ X3) != $true)) | ? [X4] : (($true = (X0 @ (f @ X4))) & ($true != (cP @ X4))))),
% 0.16/0.41 inference(flattening,[],[f6])).
% 0.16/0.41 thf(f6,plain,(
% 0.16/0.41 ! [X0 : $i > $o] : ((! [X3] : ((X0 @ X3) != $true) & (! [X1,X2] : (((f @ X1) != (f @ X2)) | (X1 = X2)) & ((cP @ a) = $true))) | ? [X4] : (($true = (X0 @ (f @ X4))) & ($true != (cP @ X4))))),
% 0.16/0.41 inference(ennf_transformation,[],[f5])).
% 0.16/0.41 thf(f5,plain,(
% 0.16/0.41 ~? [X0 : $i > $o] : (((! [X1,X2] : (((f @ X1) = (f @ X2)) => (X1 = X2)) & ((cP @ a) = $true)) => ? [X3] : ((X0 @ X3) = $true)) & ! [X4] : (($true = (X0 @ (f @ X4))) => ($true = (cP @ X4))))),
% 0.16/0.41 inference(fool_elimination,[],[f4])).
% 0.16/0.41 thf(f4,plain,(
% 0.16/0.41 ~? [X0 : $i > $o] : ((((cP @ a) & ! [X1,X2] : (((f @ X1) = (f @ X2)) => (X1 = X2))) => ? [X3] : (X0 @ X3)) & ! [X4] : ((X0 @ (f @ X4)) => (cP @ X4)))),
% 0.16/0.41 inference(rectify,[],[f2])).
% 0.16/0.41 thf(f2,negated_conjecture,(
% 0.16/0.41 ~? [X0 : $i > $o] : ((((cP @ a) & ! [X1,X2] : (((f @ X1) = (f @ X2)) => (X1 = X2))) => ? [X3] : (X0 @ X3)) & ! [X1] : ((X0 @ (f @ X1)) => (cP @ X1)))),
% 0.16/0.41 inference(negated_conjecture,[],[f1])).
% 0.16/0.41 thf(f1,conjecture,(
% 0.16/0.41 ? [X0 : $i > $o] : ((((cP @ a) & ! [X1,X2] : (((f @ X1) = (f @ X2)) => (X1 = X2))) => ? [X3] : (X0 @ X3)) & ! [X1] : ((X0 @ (f @ X1)) => (cP @ X1)))),
% 0.16/0.41 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM115A)).
% 0.16/0.41 thf(f21,plain,(
% 0.16/0.41 ( ! [X2 : $i,X1 : $i] : (((f @ X1) != (f @ X2)) | (X1 = X2)) ) | ~spl1_2),
% 0.16/0.41 inference(avatar_component_clause,[],[f20])).
% 0.16/0.41 thf(f20,plain,(
% 0.16/0.41 spl1_2 <=> ! [X2,X1] : ((X1 = X2) | ((f @ X1) != (f @ X2)))),
% 0.16/0.41 introduced(avatar_definition,[new_symbols(naming,[spl1_2])])).
% 0.16/0.41 thf(f10,plain,(
% 0.16/0.41 ( ! [X3 : $i,X0 : $i > $o] : (($true != (cP @ (sK0 @ X0))) | ((X0 @ X3) != $true)) )),
% 0.16/0.41 inference(cnf_transformation,[],[f9])).
% 0.16/0.41 thf(f32,plain,(
% 0.16/0.41 spl1_4 | spl1_2),
% 0.16/0.41 inference(avatar_split_clause,[],[f13,f20,f29])).
% 0.16/0.41 thf(f13,plain,(
% 0.16/0.41 ( ! [X2 : $i,X0 : $i > $o,X1 : $i] : (((f @ X1) != (f @ X2)) | ($true = (X0 @ (f @ (sK0 @ X0)))) | (X1 = X2)) )),
% 0.16/0.41 inference(cnf_transformation,[],[f9])).
% 0.16/0.41 thf(f31,plain,(
% 0.16/0.41 spl1_3 | spl1_4),
% 0.16/0.41 inference(avatar_split_clause,[],[f15,f29,f24])).
% 0.16/0.41 thf(f15,plain,(
% 0.16/0.41 ( ! [X0 : $i > $o] : (((cP @ a) = $true) | ($true = (X0 @ (f @ (sK0 @ X0))))) )),
% 0.16/0.41 inference(cnf_transformation,[],[f9])).
% 0.16/0.41 % SZS output end Proof for theBenchmark
% 0.16/0.41 % (6337)------------------------------
% 0.16/0.41 % (6337)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.41 % (6337)Termination reason: Refutation
% 0.16/0.41
% 0.16/0.41 % (6337)Memory used [KB]: 5628
% 0.16/0.41 % (6337)Time elapsed: 0.009 s
% 0.16/0.41 % (6337)Instructions burned: 9 (million)
% 0.16/0.41 % (6337)------------------------------
% 0.16/0.41 % (6337)------------------------------
% 0.16/0.41 % (6336)Success in time 0.008 s
% 0.16/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------