TSTP Solution File: SYO111^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO111^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 : n019.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:02:57 EDT 2024
% Result : Theorem 0.22s 0.38s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYO111^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n019.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 08:46:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 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.22/0.38 % (15141)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.22/0.38 % (15141)Instruction limit reached!
% 0.22/0.38 % (15141)------------------------------
% 0.22/0.38 % (15141)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (15141)Termination reason: Unknown
% 0.22/0.38 % (15141)Termination phase: Preprocessing 3
% 0.22/0.38
% 0.22/0.38 % (15141)Memory used [KB]: 895
% 0.22/0.38 % (15141)Time elapsed: 0.003 s
% 0.22/0.38 % (15141)Instructions burned: 2 (million)
% 0.22/0.38 % (15141)------------------------------
% 0.22/0.38 % (15141)------------------------------
% 0.22/0.38 % (15138)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 % (15140)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 % (15139)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 % (15142)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 % (15143)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 % (15144)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 % (15145)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 % (15142)Instruction limit reached!
% 0.22/0.38 % (15142)------------------------------
% 0.22/0.38 % (15142)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (15142)Termination reason: Unknown
% 0.22/0.38 % (15142)Termination phase: Property scanning
% 0.22/0.38
% 0.22/0.38 % (15142)Memory used [KB]: 895
% 0.22/0.38 % (15142)Time elapsed: 0.003 s
% 0.22/0.38 % (15142)Instructions burned: 2 (million)
% 0.22/0.38 % (15142)------------------------------
% 0.22/0.38 % (15142)------------------------------
% 0.22/0.38 % (15138)First to succeed.
% 0.22/0.38 % (15139)Also succeeded, but the first one will report.
% 0.22/0.38 % (15138)Refutation found. Thanks to Tanya!
% 0.22/0.38 % SZS status Theorem for theBenchmark
% 0.22/0.38 % SZS output start Proof for theBenchmark
% 0.22/0.38 thf(func_def_0, type, cG: $i > $o).
% 0.22/0.38 thf(func_def_1, type, cN: $i > $o).
% 0.22/0.38 thf(func_def_2, type, cM: $i > $o).
% 0.22/0.38 thf(f72,plain,(
% 0.22/0.38 $false),
% 0.22/0.38 inference(avatar_sat_refutation,[],[f32,f54,f59,f63,f68,f71])).
% 0.22/0.38 thf(f71,plain,(
% 0.22/0.38 ~spl6_7 | spl6_8),
% 0.22/0.38 inference(avatar_contradiction_clause,[],[f70])).
% 0.22/0.38 thf(f70,plain,(
% 0.22/0.38 $false | (~spl6_7 | spl6_8)),
% 0.22/0.38 inference(trivial_inequality_removal,[],[f69])).
% 0.22/0.38 thf(f69,plain,(
% 0.22/0.38 ($true != $true) | (~spl6_7 | spl6_8)),
% 0.22/0.38 inference(superposition,[],[f58,f52])).
% 0.22/0.38 thf(f52,plain,(
% 0.22/0.38 ( ! [X7 : $i] : (((cG @ X7) = $true)) ) | ~spl6_7),
% 0.22/0.38 inference(avatar_component_clause,[],[f51])).
% 0.22/0.38 thf(f51,plain,(
% 0.22/0.38 spl6_7 <=> ! [X7] : ((cG @ X7) = $true)),
% 0.22/0.38 introduced(avatar_definition,[new_symbols(naming,[spl6_7])])).
% 0.22/0.38 thf(f58,plain,(
% 0.22/0.38 ((cG @ sK5) != $true) | spl6_8),
% 0.22/0.38 inference(avatar_component_clause,[],[f56])).
% 0.22/0.38 thf(f56,plain,(
% 0.22/0.38 spl6_8 <=> ((cG @ sK5) = $true)),
% 0.22/0.38 introduced(avatar_definition,[new_symbols(naming,[spl6_8])])).
% 0.22/0.38 thf(f68,plain,(
% 0.22/0.38 ~spl6_1 | ~spl6_6),
% 0.22/0.38 inference(avatar_contradiction_clause,[],[f67])).
% 0.22/0.38 thf(f67,plain,(
% 0.22/0.38 $false | (~spl6_1 | ~spl6_6)),
% 0.22/0.38 inference(trivial_inequality_removal,[],[f66])).
% 0.22/0.38 thf(f66,plain,(
% 0.22/0.38 ($true != $true) | (~spl6_1 | ~spl6_6)),
% 0.22/0.38 inference(superposition,[],[f48,f28])).
% 0.22/0.38 thf(f28,plain,(
% 0.22/0.38 ($true = (cN @ sK0)) | ~spl6_1),
% 0.22/0.38 inference(avatar_component_clause,[],[f26])).
% 0.22/0.38 thf(f26,plain,(
% 0.22/0.38 spl6_1 <=> ($true = (cN @ sK0))),
% 0.22/0.38 introduced(avatar_definition,[new_symbols(naming,[spl6_1])])).
% 0.22/0.38 thf(f48,plain,(
% 0.22/0.38 ( ! [X3 : $i] : (((cN @ X3) != $true)) ) | ~spl6_6),
% 0.22/0.38 inference(avatar_component_clause,[],[f47])).
% 0.22/0.38 thf(f47,plain,(
% 0.22/0.38 spl6_6 <=> ! [X3] : ((cN @ X3) != $true)),
% 0.22/0.38 introduced(avatar_definition,[new_symbols(naming,[spl6_6])])).
% 0.22/0.38 thf(f63,plain,(
% 0.22/0.38 ~spl6_2),
% 0.22/0.38 inference(avatar_contradiction_clause,[],[f62])).
% 0.22/0.38 thf(f62,plain,(
% 0.22/0.38 $false | ~spl6_2),
% 0.22/0.38 inference(trivial_inequality_removal,[],[f61])).
% 0.22/0.38 thf(f61,plain,(
% 0.22/0.38 ($true != $true) | ~spl6_2),
% 0.22/0.38 inference(superposition,[],[f23,f31])).
% 0.22/0.38 thf(f31,plain,(
% 0.22/0.38 ( ! [X0 : $i] : (((cM @ X0) = $true)) ) | ~spl6_2),
% 0.22/0.38 inference(avatar_component_clause,[],[f30])).
% 0.22/0.38 thf(f30,plain,(
% 0.22/0.38 spl6_2 <=> ! [X0] : ((cM @ X0) = $true)),
% 0.22/0.38 introduced(avatar_definition,[new_symbols(naming,[spl6_2])])).
% 0.22/0.38 thf(f23,plain,(
% 0.22/0.38 ((cM @ sK1) != $true)),
% 0.22/0.38 inference(cnf_transformation,[],[f16])).
% 0.22/0.38 thf(f16,plain,(
% 0.22/0.38 ! [X0] : (((cM @ X0) = $true) | ($true = (cN @ sK0))) & ((cM @ sK1) != $true) & ((! [X3] : ((cN @ X3) != $true) & ((cM @ sK2) != $true)) | ! [X5] : ($true = (cM @ X5)) | (((cN @ sK3) = $true) & ! [X7] : ((cG @ X7) = $true)) | ((cG @ sK4) != $true)) & ! [X9] : ($true = (cG @ X9)) & ! [X10] : (((cN @ X10) != $true) | ((cG @ sK5) != $true))),
% 0.22/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f9,f15,f14,f13,f12,f11,f10])).
% 0.22/0.38 thf(f10,plain,(
% 0.22/0.38 ? [X1] : ((cN @ X1) = $true) => ($true = (cN @ sK0))),
% 0.22/0.38 introduced(choice_axiom,[])).
% 0.22/0.38 thf(f11,plain,(
% 0.22/0.38 ? [X2] : ((cM @ X2) != $true) => ((cM @ sK1) != $true)),
% 0.22/0.38 introduced(choice_axiom,[])).
% 0.22/0.38 thf(f12,plain,(
% 0.22/0.38 ? [X4] : ((cM @ X4) != $true) => ((cM @ sK2) != $true)),
% 0.22/0.38 introduced(choice_axiom,[])).
% 0.22/0.38 thf(f13,plain,(
% 0.22/0.38 ? [X6] : ((cN @ X6) = $true) => ((cN @ sK3) = $true)),
% 0.22/0.38 introduced(choice_axiom,[])).
% 0.22/0.38 thf(f14,plain,(
% 0.22/0.38 ? [X8] : ($true != (cG @ X8)) => ((cG @ sK4) != $true)),
% 0.22/0.38 introduced(choice_axiom,[])).
% 0.22/0.38 thf(f15,plain,(
% 0.22/0.38 ? [X11] : ((cG @ X11) != $true) => ((cG @ sK5) != $true)),
% 0.22/0.38 introduced(choice_axiom,[])).
% 0.22/0.38 thf(f9,plain,(
% 0.22/0.38 ! [X0] : (((cM @ X0) = $true) | ? [X1] : ((cN @ X1) = $true)) & ? [X2] : ((cM @ X2) != $true) & ((! [X3] : ((cN @ X3) != $true) & ? [X4] : ((cM @ X4) != $true)) | ! [X5] : ($true = (cM @ X5)) | (? [X6] : ((cN @ X6) = $true) & ! [X7] : ((cG @ X7) = $true)) | ? [X8] : ($true != (cG @ X8))) & ! [X9] : ($true = (cG @ X9)) & ! [X10] : (((cN @ X10) != $true) | ? [X11] : ((cG @ X11) != $true))),
% 0.22/0.38 inference(rectify,[],[f8])).
% 0.22/0.38 thf(f8,plain,(
% 0.22/0.38 ! [X10] : (($true = (cM @ X10)) | ? [X11] : ((cN @ X11) = $true)) & ? [X9] : ($true != (cM @ X9)) & ((! [X1] : ((cN @ X1) != $true) & ? [X2] : ((cM @ X2) != $true)) | ! [X5] : ($true = (cM @ X5)) | (? [X3] : ((cN @ X3) = $true) & ! [X4] : ($true = (cG @ X4))) | ? [X0] : ($true != (cG @ X0))) & ! [X6] : ((cG @ X6) = $true) & ! [X7] : (((cN @ X7) != $true) | ? [X8] : ($true != (cG @ X8)))),
% 0.22/0.38 inference(flattening,[],[f7])).
% 0.22/0.38 thf(f7,plain,(
% 0.22/0.38 (! [X6] : ((cG @ X6) = $true) & ? [X9] : ($true != (cM @ X9)) & ! [X10] : (($true = (cM @ X10)) | ? [X11] : ((cN @ X11) = $true)) & ! [X7] : (((cN @ X7) != $true) | ? [X8] : ($true != (cG @ X8)))) & ((! [X1] : ((cN @ X1) != $true) & ? [X2] : ((cM @ X2) != $true)) | ! [X5] : ($true = (cM @ X5)) | (? [X3] : ((cN @ X3) = $true) & ! [X4] : ($true = (cG @ X4))) | ? [X0] : ($true != (cG @ X0)))),
% 0.22/0.38 inference(ennf_transformation,[],[f6])).
% 0.22/0.38 thf(f6,plain,(
% 0.22/0.38 ~((? [X0] : ($true != (cG @ X0)) | ! [X5] : ($true = (cM @ X5)) | ~(~! [X4] : ($true = (cG @ X4)) | ! [X3] : ((cN @ X3) != $true)) | ~(? [X1] : ((cN @ X1) = $true) | ! [X2] : ((cM @ X2) = $true))) => (? [X6] : ((cG @ X6) != $true) | ! [X9] : ($true = (cM @ X9)) | ~! [X10] : (($true = (cM @ X10)) | ? [X11] : ((cN @ X11) = $true)) | ~! [X7] : (~! [X8] : ($true = (cG @ X8)) | ((cN @ X7) != $true))))),
% 0.22/0.38 inference(flattening,[],[f5])).
% 0.22/0.38 thf(f5,plain,(
% 0.22/0.38 ~((? [X0] : ~($true = (cG @ X0)) | ~(? [X1] : ((cN @ X1) = $true) | ! [X2] : ((cM @ X2) = $true)) | ~(! [X3] : ~((cN @ X3) = $true) | ~! [X4] : ($true = (cG @ X4))) | ! [X5] : ($true = (cM @ X5))) => (? [X6] : ~((cG @ X6) = $true) | ~! [X7] : (~! [X8] : ($true = (cG @ X8)) | ~((cN @ X7) = $true)) | ! [X9] : ($true = (cM @ X9)) | ~! [X10] : (($true = (cM @ X10)) | ? [X11] : ((cN @ X11) = $true))))),
% 0.22/0.38 inference(fool_elimination,[],[f4])).
% 0.22/0.38 thf(f4,plain,(
% 0.22/0.38 ~((? [X0] : ~(cG @ X0) | ~(? [X1] : (cN @ X1) | ! [X2] : (cM @ X2)) | ~(! [X3] : ~(cN @ X3) | ~! [X4] : (cG @ X4)) | ! [X5] : (cM @ X5)) => (? [X6] : ~(cG @ X6) | ~! [X7] : (~! [X8] : (cG @ X8) | ~(cN @ X7)) | ! [X9] : (cM @ X9) | ~! [X10] : (? [X11] : (cN @ X11) | (cM @ X10))))),
% 0.22/0.38 inference(rectify,[],[f2])).
% 0.22/0.38 thf(f2,negated_conjecture,(
% 0.22/0.38 ~((? [X1] : ~(cG @ X1) | ~(? [X3] : (cN @ X3) | ! [X2] : (cM @ X2)) | ~(! [X4] : ~(cN @ X4) | ~! [X5] : (cG @ X5)) | ! [X0] : (cM @ X0)) => (? [X1] : ~(cG @ X1) | ~! [X4] : (~! [X5] : (cG @ X5) | ~(cN @ X4)) | ! [X0] : (cM @ X0) | ~! [X2] : (? [X3] : (cN @ X3) | (cM @ X2))))),
% 0.22/0.38 inference(negated_conjecture,[],[f1])).
% 0.22/0.38 thf(f1,conjecture,(
% 0.22/0.38 (? [X1] : ~(cG @ X1) | ~(? [X3] : (cN @ X3) | ! [X2] : (cM @ X2)) | ~(! [X4] : ~(cN @ X4) | ~! [X5] : (cG @ X5)) | ! [X0] : (cM @ X0)) => (? [X1] : ~(cG @ X1) | ~! [X4] : (~! [X5] : (cG @ X5) | ~(cN @ X4)) | ! [X0] : (cM @ X0) | ~! [X2] : (? [X3] : (cN @ X3) | (cM @ X2)))),
% 0.22/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM80)).
% 0.22/0.38 thf(f59,plain,(
% 0.22/0.38 spl6_6 | ~spl6_8),
% 0.22/0.38 inference(avatar_split_clause,[],[f17,f56,f47])).
% 0.22/0.38 thf(f17,plain,(
% 0.22/0.38 ( ! [X10 : $i] : (((cN @ X10) != $true) | ((cG @ sK5) != $true)) )),
% 0.22/0.38 inference(cnf_transformation,[],[f16])).
% 0.22/0.38 thf(f54,plain,(
% 0.22/0.38 spl6_7),
% 0.22/0.38 inference(avatar_split_clause,[],[f18,f51])).
% 0.22/0.38 thf(f18,plain,(
% 0.22/0.38 ( ! [X9 : $i] : (($true = (cG @ X9))) )),
% 0.22/0.38 inference(cnf_transformation,[],[f16])).
% 0.22/0.38 thf(f32,plain,(
% 0.22/0.38 spl6_1 | spl6_2),
% 0.22/0.38 inference(avatar_split_clause,[],[f24,f30,f26])).
% 0.22/0.38 thf(f24,plain,(
% 0.22/0.38 ( ! [X0 : $i] : (($true = (cN @ sK0)) | ((cM @ X0) = $true)) )),
% 0.22/0.38 inference(cnf_transformation,[],[f16])).
% 0.22/0.38 % SZS output end Proof for theBenchmark
% 0.22/0.38 % (15138)------------------------------
% 0.22/0.38 % (15138)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (15138)Termination reason: Refutation
% 0.22/0.38
% 0.22/0.38 % (15138)Memory used [KB]: 5500
% 0.22/0.38 % (15138)Time elapsed: 0.006 s
% 0.22/0.38 % (15138)Instructions burned: 3 (million)
% 0.22/0.38 % (15138)------------------------------
% 0.22/0.38 % (15138)------------------------------
% 0.22/0.38 % (15137)Success in time 0.007 s
% 0.22/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------