TSTP Solution File: SYO361^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO361^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 : n010.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.16s 0.42s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYO361^5 : TPTP v8.2.0. Released v4.0.0.
% 0.15/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.39 % Computer : n010.cluster.edu
% 0.16/0.39 % Model : x86_64 x86_64
% 0.16/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.39 % Memory : 8042.1875MB
% 0.16/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.39 % CPULimit : 300
% 0.16/0.39 % WCLimit : 300
% 0.16/0.39 % DateTime : Mon May 20 09:46:08 EDT 2024
% 0.16/0.39 % CPUTime :
% 0.16/0.39 This is a TH0_THM_EQU_NAR problem
% 0.16/0.39 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.41 % (10190)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.41 % (10191)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.41 % (10189)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.41 % (10188)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.41 % (10186)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.41 % (10187)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.41 % (10192)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.41 % (10193)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.41 % (10188)Refutation not found, incomplete strategy
% 0.16/0.41 % (10188)------------------------------
% 0.16/0.41 % (10188)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.41 % (10188)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.41
% 0.16/0.41
% 0.16/0.41 % (10188)Memory used [KB]: 5500
% 0.16/0.41 % (10188)Time elapsed: 0.004 s
% 0.16/0.41 % (10189)Instruction limit reached!
% 0.16/0.41 % (10189)------------------------------
% 0.16/0.41 % (10189)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.41 % (10188)Instructions burned: 1 (million)
% 0.16/0.41 % (10188)------------------------------
% 0.16/0.41 % (10188)------------------------------
% 0.16/0.41 % (10189)Termination reason: Unknown
% 0.16/0.41 % (10190)Instruction limit reached!
% 0.16/0.41 % (10190)------------------------------
% 0.16/0.41 % (10190)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.41 % (10189)Termination phase: Saturation
% 0.16/0.41
% 0.16/0.41 % (10189)Memory used [KB]: 5500
% 0.16/0.41 % (10189)Time elapsed: 0.004 s
% 0.16/0.41 % (10189)Instructions burned: 2 (million)
% 0.16/0.41 % (10189)------------------------------
% 0.16/0.41 % (10189)------------------------------
% 0.16/0.41 % (10190)Termination reason: Unknown
% 0.16/0.41 % (10190)Termination phase: Saturation
% 0.16/0.41
% 0.16/0.41 % (10190)Memory used [KB]: 5500
% 0.16/0.41 % (10190)Time elapsed: 0.004 s
% 0.16/0.41 % (10190)Instructions burned: 2 (million)
% 0.16/0.41 % (10190)------------------------------
% 0.16/0.41 % (10190)------------------------------
% 0.16/0.41 % (10187)Instruction limit reached!
% 0.16/0.41 % (10187)------------------------------
% 0.16/0.41 % (10187)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.41 % (10187)Termination reason: Unknown
% 0.16/0.41 % (10187)Termination phase: Saturation
% 0.16/0.41
% 0.16/0.41 % (10187)Memory used [KB]: 5500
% 0.16/0.41 % (10187)Time elapsed: 0.005 s
% 0.16/0.41 % (10191)First to succeed.
% 0.16/0.41 % (10187)Instructions burned: 4 (million)
% 0.16/0.41 % (10187)------------------------------
% 0.16/0.41 % (10187)------------------------------
% 0.16/0.41 % (10193)Instruction limit reached!
% 0.16/0.41 % (10193)------------------------------
% 0.16/0.41 % (10193)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.41 % (10193)Termination reason: Unknown
% 0.16/0.41 % (10193)Termination phase: Saturation
% 0.16/0.41
% 0.16/0.41 % (10193)Memory used [KB]: 5500
% 0.16/0.41 % (10193)Time elapsed: 0.004 s
% 0.16/0.41 % (10193)Instructions burned: 4 (million)
% 0.16/0.41 % (10193)------------------------------
% 0.16/0.41 % (10193)------------------------------
% 0.16/0.41 % (10192)Also succeeded, but the first one will report.
% 0.16/0.42 % (10191)Refutation found. Thanks to Tanya!
% 0.16/0.42 % SZS status Theorem for theBenchmark
% 0.16/0.42 % SZS output start Proof for theBenchmark
% 0.16/0.42 thf(func_def_5, type, sK2: $i > $i > $o).
% 0.16/0.42 thf(func_def_6, type, sK3: ($i > $i > $o) > $i).
% 0.16/0.42 thf(func_def_9, type, ph5: !>[X0: $tType]:(X0)).
% 0.16/0.42 thf(f63,plain,(
% 0.16/0.42 $false),
% 0.16/0.42 inference(avatar_sat_refutation,[],[f23,f28,f32,f54,f62])).
% 0.16/0.42 thf(f62,plain,(
% 0.16/0.42 ~spl4_1 | spl4_3 | ~spl4_4),
% 0.16/0.42 inference(avatar_contradiction_clause,[],[f61])).
% 0.16/0.42 thf(f61,plain,(
% 0.16/0.42 $false | (~spl4_1 | spl4_3 | ~spl4_4)),
% 0.16/0.42 inference(trivial_inequality_removal,[],[f60])).
% 0.16/0.42 thf(f60,plain,(
% 0.16/0.42 ($true != $true) | (~spl4_1 | spl4_3 | ~spl4_4)),
% 0.16/0.42 inference(superposition,[],[f55,f31])).
% 0.16/0.42 thf(f31,plain,(
% 0.16/0.42 ( ! [X3 : $i] : (((sK2 @ X3 @ X3) = $true)) ) | ~spl4_4),
% 0.16/0.42 inference(avatar_component_clause,[],[f30])).
% 0.16/0.42 thf(f30,plain,(
% 0.16/0.42 spl4_4 <=> ! [X3] : ((sK2 @ X3 @ X3) = $true)),
% 0.16/0.42 introduced(avatar_definition,[new_symbols(naming,[spl4_4])])).
% 0.16/0.42 thf(f55,plain,(
% 0.16/0.42 ((sK2 @ sK0 @ sK0) != $true) | (~spl4_1 | spl4_3)),
% 0.16/0.42 inference(forward_demodulation,[],[f27,f19])).
% 0.16/0.42 thf(f19,plain,(
% 0.16/0.42 (sK1 = sK0) | ~spl4_1),
% 0.16/0.42 inference(avatar_component_clause,[],[f17])).
% 0.16/0.42 thf(f17,plain,(
% 0.16/0.42 spl4_1 <=> (sK1 = sK0)),
% 0.16/0.42 introduced(avatar_definition,[new_symbols(naming,[spl4_1])])).
% 0.16/0.42 thf(f27,plain,(
% 0.16/0.42 ((sK2 @ sK0 @ sK1) != $true) | spl4_3),
% 0.16/0.42 inference(avatar_component_clause,[],[f25])).
% 0.16/0.42 thf(f25,plain,(
% 0.16/0.42 spl4_3 <=> ((sK2 @ sK0 @ sK1) = $true)),
% 0.16/0.42 introduced(avatar_definition,[new_symbols(naming,[spl4_3])])).
% 0.16/0.42 thf(f54,plain,(
% 0.16/0.42 spl4_1 | ~spl4_2),
% 0.16/0.42 inference(avatar_split_clause,[],[f42,f21,f17])).
% 0.16/0.42 thf(f21,plain,(
% 0.16/0.42 spl4_2 <=> ! [X4 : $i > $i > $o] : (($true = (X4 @ sK0 @ sK1)) | ((X4 @ (sK3 @ X4) @ (sK3 @ X4)) != $true))),
% 0.16/0.42 introduced(avatar_definition,[new_symbols(naming,[spl4_2])])).
% 0.16/0.42 thf(f42,plain,(
% 0.16/0.42 (sK1 = sK0) | ~spl4_2),
% 0.16/0.42 inference(equality_proxy_clausification,[],[f41])).
% 0.16/0.42 thf(f41,plain,(
% 0.16/0.42 ($true = (sK1 = sK0)) | ~spl4_2),
% 0.16/0.42 inference(trivial_inequality_removal,[],[f40])).
% 0.16/0.42 thf(f40,plain,(
% 0.16/0.42 ($true != $true) | ($true = (sK1 = sK0)) | ~spl4_2),
% 0.16/0.42 inference(boolean_simplification,[],[f39])).
% 0.16/0.42 thf(f39,plain,(
% 0.16/0.42 (((sK3 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))) = (sK3 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) != $true) | ($true = (sK1 = sK0)) | ~spl4_2),
% 0.16/0.42 inference(beta_eta_normalization,[],[f33])).
% 0.16/0.42 thf(f33,plain,(
% 0.16/0.42 ($true = ((^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))) @ sK0 @ sK1)) | (((^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))) @ (sK3 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))) @ (sK3 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) != $true) | ~spl4_2),
% 0.16/0.42 inference(primitive_instantiation,[],[f22])).
% 0.16/0.42 thf(f22,plain,(
% 0.16/0.42 ( ! [X4 : $i > $i > $o] : (((X4 @ (sK3 @ X4) @ (sK3 @ X4)) != $true) | ($true = (X4 @ sK0 @ sK1))) ) | ~spl4_2),
% 0.16/0.42 inference(avatar_component_clause,[],[f21])).
% 0.16/0.42 thf(f32,plain,(
% 0.16/0.42 ~spl4_1 | spl4_4),
% 0.16/0.42 inference(avatar_split_clause,[],[f15,f30,f17])).
% 0.16/0.42 thf(f15,plain,(
% 0.16/0.42 ( ! [X3 : $i] : ((sK1 != sK0) | ((sK2 @ X3 @ X3) = $true)) )),
% 0.16/0.42 inference(cnf_transformation,[],[f12])).
% 0.16/0.42 thf(f12,plain,(
% 0.16/0.42 ((sK1 != sK0) | (! [X3] : ((sK2 @ X3 @ X3) = $true) & ((sK2 @ sK0 @ sK1) != $true))) & ((sK1 = sK0) | ! [X4 : $i > $i > $o] : (((X4 @ (sK3 @ X4) @ (sK3 @ X4)) != $true) | ($true = (X4 @ sK0 @ sK1))))),
% 0.16/0.42 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f11,f10,f9])).
% 0.16/0.42 thf(f9,plain,(
% 0.16/0.42 ? [X0,X1] : (((X0 != X1) | ? [X2 : $i > $i > $o] : (! [X3] : ((X2 @ X3 @ X3) = $true) & ((X2 @ X0 @ X1) != $true))) & ((X0 = X1) | ! [X4 : $i > $i > $o] : (? [X5] : ($true != (X4 @ X5 @ X5)) | ((X4 @ X0 @ X1) = $true)))) => (((sK1 != sK0) | ? [X2 : $i > $i > $o] : (! [X3] : ((X2 @ X3 @ X3) = $true) & ((X2 @ sK0 @ sK1) != $true))) & ((sK1 = sK0) | ! [X4 : $i > $i > $o] : (? [X5] : ($true != (X4 @ X5 @ X5)) | ($true = (X4 @ sK0 @ sK1)))))),
% 0.16/0.42 introduced(choice_axiom,[])).
% 0.16/0.42 thf(f10,plain,(
% 0.16/0.42 ? [X2 : $i > $i > $o] : (! [X3] : ((X2 @ X3 @ X3) = $true) & ((X2 @ sK0 @ sK1) != $true)) => (! [X3] : ((sK2 @ X3 @ X3) = $true) & ((sK2 @ sK0 @ sK1) != $true))),
% 0.16/0.42 introduced(choice_axiom,[])).
% 0.16/0.42 thf(f11,plain,(
% 0.16/0.42 ! [X4 : $i > $i > $o] : (? [X5] : ($true != (X4 @ X5 @ X5)) => ((X4 @ (sK3 @ X4) @ (sK3 @ X4)) != $true))),
% 0.16/0.42 introduced(choice_axiom,[])).
% 0.16/0.42 thf(f8,plain,(
% 0.16/0.42 ? [X0,X1] : (((X0 != X1) | ? [X2 : $i > $i > $o] : (! [X3] : ((X2 @ X3 @ X3) = $true) & ((X2 @ X0 @ X1) != $true))) & ((X0 = X1) | ! [X4 : $i > $i > $o] : (? [X5] : ($true != (X4 @ X5 @ X5)) | ((X4 @ X0 @ X1) = $true))))),
% 0.16/0.42 inference(rectify,[],[f7])).
% 0.16/0.42 thf(f7,plain,(
% 0.16/0.42 ? [X0,X1] : (((X0 != X1) | ? [X2 : $i > $i > $o] : (! [X3] : ((X2 @ X3 @ X3) = $true) & ((X2 @ X0 @ X1) != $true))) & ((X0 = X1) | ! [X2 : $i > $i > $o] : (? [X3] : ((X2 @ X3 @ X3) != $true) | ((X2 @ X0 @ X1) = $true))))),
% 0.16/0.42 inference(nnf_transformation,[],[f6])).
% 0.16/0.42 thf(f6,plain,(
% 0.16/0.42 ? [X0,X1] : (! [X2 : $i > $i > $o] : (? [X3] : ((X2 @ X3 @ X3) != $true) | ((X2 @ X0 @ X1) = $true)) <~> (X0 = X1))),
% 0.16/0.42 inference(ennf_transformation,[],[f5])).
% 0.16/0.42 thf(f5,plain,(
% 0.16/0.42 ~! [X1,X0] : ((X0 = X1) <=> ! [X2 : $i > $i > $o] : (! [X3] : ((X2 @ X3 @ X3) = $true) => ((X2 @ X0 @ X1) = $true)))),
% 0.16/0.42 inference(fool_elimination,[],[f4])).
% 0.16/0.42 thf(f4,plain,(
% 0.16/0.42 ~! [X0,X1] : (! [X2 : $i > $i > $o] : (! [X3] : (X2 @ X3 @ X3) => (X2 @ X0 @ X1)) <=> (X0 = X1))),
% 0.16/0.42 inference(rectify,[],[f2])).
% 0.16/0.42 thf(f2,negated_conjecture,(
% 0.16/0.42 ~! [X0,X1] : (! [X2 : $i > $i > $o] : (! [X3] : (X2 @ X3 @ X3) => (X2 @ X0 @ X1)) <=> (X0 = X1))),
% 0.16/0.42 inference(negated_conjecture,[],[f1])).
% 0.16/0.42 thf(f1,conjecture,(
% 0.16/0.42 ! [X0,X1] : (! [X2 : $i > $i > $o] : (! [X3] : (X2 @ X3 @ X3) => (X2 @ X0 @ X1)) <=> (X0 = X1))),
% 0.16/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM47)).
% 0.16/0.42 thf(f28,plain,(
% 0.16/0.42 ~spl4_3 | ~spl4_1),
% 0.16/0.42 inference(avatar_split_clause,[],[f14,f17,f25])).
% 0.16/0.42 thf(f14,plain,(
% 0.16/0.42 (sK1 != sK0) | ((sK2 @ sK0 @ sK1) != $true)),
% 0.16/0.42 inference(cnf_transformation,[],[f12])).
% 0.16/0.42 thf(f23,plain,(
% 0.16/0.42 spl4_1 | spl4_2),
% 0.16/0.42 inference(avatar_split_clause,[],[f13,f21,f17])).
% 0.16/0.42 thf(f13,plain,(
% 0.16/0.42 ( ! [X4 : $i > $i > $o] : ((sK1 = sK0) | ($true = (X4 @ sK0 @ sK1)) | ((X4 @ (sK3 @ X4) @ (sK3 @ X4)) != $true)) )),
% 0.16/0.42 inference(cnf_transformation,[],[f12])).
% 0.16/0.42 % SZS output end Proof for theBenchmark
% 0.16/0.42 % (10191)------------------------------
% 0.16/0.42 % (10191)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.42 % (10191)Termination reason: Refutation
% 0.16/0.42
% 0.16/0.42 % (10191)Memory used [KB]: 5500
% 0.16/0.42 % (10191)Time elapsed: 0.005 s
% 0.16/0.42 % (10191)Instructions burned: 3 (million)
% 0.16/0.42 % (10191)------------------------------
% 0.16/0.42 % (10191)------------------------------
% 0.16/0.42 % (10185)Success in time 0.017 s
% 0.16/0.42 % Vampire---4.8 exiting
%------------------------------------------------------------------------------