TSTP Solution File: SYO099^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO099^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 : n032.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:56 EDT 2024
% Result : Theorem 0.15s 0.32s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SYO099^5 : TPTP v8.2.0. Released v4.0.0.
% 0.09/0.11 % 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.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Mon May 20 08:33:52 EDT 2024
% 0.11/0.30 % CPUTime :
% 0.11/0.30 This is a TH0_THM_NEQ_NAR problem
% 0.11/0.30 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.15/0.31 % (2367)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.15/0.31 % (2367)First to succeed.
% 0.15/0.31 % (2369)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.15/0.31 % (2368)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.32 % (2369)Instruction limit reached!
% 0.15/0.32 % (2369)------------------------------
% 0.15/0.32 % (2369)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (2369)Termination reason: Unknown
% 0.15/0.32 % (2369)Termination phase: Saturation
% 0.15/0.32
% 0.15/0.32 % (2369)Memory used [KB]: 5500
% 0.15/0.32 % (2369)Time elapsed: 0.003 s
% 0.15/0.32 % (2369)Instructions burned: 3 (million)
% 0.15/0.32 % (2369)------------------------------
% 0.15/0.32 % (2369)------------------------------
% 0.15/0.32 % (2368)Also succeeded, but the first one will report.
% 0.15/0.32 % (2367)Refutation found. Thanks to Tanya!
% 0.15/0.32 % SZS status Theorem for theBenchmark
% 0.15/0.32 % SZS output start Proof for theBenchmark
% 0.15/0.32 thf(func_def_0, type, cG: $i > $o).
% 0.15/0.32 thf(func_def_1, type, cN: $i > $o).
% 0.15/0.32 thf(func_def_2, type, cM: $i > $o).
% 0.15/0.32 thf(func_def_4, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.15/0.32 thf(f42,plain,(
% 0.15/0.32 $false),
% 0.15/0.32 inference(avatar_sat_refutation,[],[f24,f32,f35,f38,f41])).
% 0.15/0.32 thf(f41,plain,(
% 0.15/0.32 ~spl3_1),
% 0.15/0.32 inference(avatar_contradiction_clause,[],[f40])).
% 0.15/0.32 thf(f40,plain,(
% 0.15/0.32 $false | ~spl3_1),
% 0.15/0.32 inference(trivial_inequality_removal,[],[f39])).
% 0.15/0.32 thf(f39,plain,(
% 0.15/0.32 ($true != $true) | ~spl3_1),
% 0.15/0.32 inference(superposition,[],[f14,f19])).
% 0.15/0.32 thf(f19,plain,(
% 0.15/0.32 ( ! [X4 : $i] : (((cM @ X4) = $true)) ) | ~spl3_1),
% 0.15/0.32 inference(avatar_component_clause,[],[f18])).
% 0.15/0.32 thf(f18,plain,(
% 0.15/0.32 spl3_1 <=> ! [X4] : ((cM @ X4) = $true)),
% 0.15/0.32 introduced(avatar_definition,[new_symbols(naming,[spl3_1])])).
% 0.15/0.32 thf(f14,plain,(
% 0.15/0.32 ($true != (cM @ sK1))),
% 0.15/0.32 inference(cnf_transformation,[],[f12])).
% 0.15/0.32 thf(f12,plain,(
% 0.15/0.32 ! [X0] : ((cG @ X0) = $true) & (((cG @ sK0) != $true) | ! [X2] : ((cN @ X2) != $true)) & ($true != (cM @ sK1)) & (! [X4] : ((cM @ X4) = $true) | ($true = (cN @ sK2)))),
% 0.15/0.32 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f11,f10,f9])).
% 0.15/0.32 thf(f9,plain,(
% 0.15/0.32 ? [X1] : ((cG @ X1) != $true) => ((cG @ sK0) != $true)),
% 0.15/0.32 introduced(choice_axiom,[])).
% 0.15/0.32 thf(f10,plain,(
% 0.15/0.32 ? [X3] : ((cM @ X3) != $true) => ($true != (cM @ sK1))),
% 0.15/0.32 introduced(choice_axiom,[])).
% 0.15/0.32 thf(f11,plain,(
% 0.15/0.32 ? [X5] : ($true = (cN @ X5)) => ($true = (cN @ sK2))),
% 0.15/0.32 introduced(choice_axiom,[])).
% 0.15/0.32 thf(f8,plain,(
% 0.15/0.32 ! [X0] : ((cG @ X0) = $true) & (? [X1] : ((cG @ X1) != $true) | ! [X2] : ((cN @ X2) != $true)) & ? [X3] : ((cM @ X3) != $true) & (! [X4] : ((cM @ X4) = $true) | ? [X5] : ($true = (cN @ X5)))),
% 0.15/0.32 inference(rectify,[],[f7])).
% 0.15/0.32 thf(f7,plain,(
% 0.15/0.32 ! [X0] : ((cG @ X0) = $true) & (? [X3] : ((cG @ X3) != $true) | ! [X4] : ((cN @ X4) != $true)) & ? [X5] : ((cM @ X5) != $true) & (! [X1] : ((cM @ X1) = $true) | ? [X2] : ((cN @ X2) = $true))),
% 0.15/0.32 inference(ennf_transformation,[],[f6])).
% 0.15/0.32 thf(f6,plain,(
% 0.15/0.32 ~(? [X0] : ((cG @ X0) != $true) | ! [X5] : ((cM @ X5) = $true) | ~(~! [X3] : ((cG @ X3) = $true) | ! [X4] : ((cN @ X4) != $true)) | ~(! [X1] : ((cM @ X1) = $true) | ? [X2] : ((cN @ X2) = $true)))),
% 0.15/0.32 inference(flattening,[],[f5])).
% 0.15/0.32 thf(f5,plain,(
% 0.15/0.32 ~(? [X0] : ~((cG @ X0) = $true) | ~(! [X1] : ((cM @ X1) = $true) | ? [X2] : ((cN @ X2) = $true)) | ~(~! [X3] : ((cG @ X3) = $true) | ! [X4] : ~((cN @ X4) = $true)) | ! [X5] : ((cM @ X5) = $true))),
% 0.15/0.32 inference(fool_elimination,[],[f4])).
% 0.15/0.32 thf(f4,plain,(
% 0.15/0.32 ~(? [X0] : ~(cG @ X0) | ~(! [X1] : (cM @ X1) | ? [X2] : (cN @ X2)) | ~(~! [X3] : (cG @ X3) | ! [X4] : ~(cN @ X4)) | ! [X5] : (cM @ X5))),
% 0.15/0.32 inference(rectify,[],[f2])).
% 0.15/0.32 thf(f2,negated_conjecture,(
% 0.15/0.32 ~(? [X1] : ~(cG @ X1) | ~(! [X2] : (cM @ X2) | ? [X3] : (cN @ X3)) | ~(~! [X5] : (cG @ X5) | ! [X4] : ~(cN @ X4)) | ! [X0] : (cM @ X0))),
% 0.15/0.32 inference(negated_conjecture,[],[f1])).
% 0.15/0.32 thf(f1,conjecture,(
% 0.15/0.32 ? [X1] : ~(cG @ X1) | ~(! [X2] : (cM @ X2) | ? [X3] : (cN @ X3)) | ~(~! [X5] : (cG @ X5) | ! [X4] : ~(cN @ X4)) | ! [X0] : (cM @ X0)),
% 0.15/0.32 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM78)).
% 0.15/0.32 thf(f38,plain,(
% 0.15/0.32 ~spl3_2 | ~spl3_3),
% 0.15/0.32 inference(avatar_contradiction_clause,[],[f37])).
% 0.15/0.32 thf(f37,plain,(
% 0.15/0.32 $false | (~spl3_2 | ~spl3_3)),
% 0.15/0.32 inference(trivial_inequality_removal,[],[f36])).
% 0.15/0.32 thf(f36,plain,(
% 0.15/0.32 ($true != $true) | (~spl3_2 | ~spl3_3)),
% 0.15/0.32 inference(superposition,[],[f27,f23])).
% 0.15/0.32 thf(f23,plain,(
% 0.15/0.32 ($true = (cN @ sK2)) | ~spl3_2),
% 0.15/0.32 inference(avatar_component_clause,[],[f21])).
% 0.15/0.32 thf(f21,plain,(
% 0.15/0.32 spl3_2 <=> ($true = (cN @ sK2))),
% 0.15/0.32 introduced(avatar_definition,[new_symbols(naming,[spl3_2])])).
% 0.15/0.32 thf(f27,plain,(
% 0.15/0.32 ( ! [X2 : $i] : (((cN @ X2) != $true)) ) | ~spl3_3),
% 0.15/0.32 inference(avatar_component_clause,[],[f26])).
% 0.15/0.32 thf(f26,plain,(
% 0.15/0.32 spl3_3 <=> ! [X2] : ((cN @ X2) != $true)),
% 0.15/0.32 introduced(avatar_definition,[new_symbols(naming,[spl3_3])])).
% 0.15/0.32 thf(f35,plain,(
% 0.15/0.32 spl3_4),
% 0.15/0.32 inference(avatar_contradiction_clause,[],[f34])).
% 0.15/0.32 thf(f34,plain,(
% 0.15/0.32 $false | spl3_4),
% 0.15/0.32 inference(trivial_inequality_removal,[],[f33])).
% 0.15/0.32 thf(f33,plain,(
% 0.15/0.32 ($true != $true) | spl3_4),
% 0.15/0.32 inference(superposition,[],[f31,f16])).
% 0.15/0.32 thf(f16,plain,(
% 0.15/0.32 ( ! [X0 : $i] : (((cG @ X0) = $true)) )),
% 0.15/0.32 inference(cnf_transformation,[],[f12])).
% 0.15/0.32 thf(f31,plain,(
% 0.15/0.32 ((cG @ sK0) != $true) | spl3_4),
% 0.15/0.32 inference(avatar_component_clause,[],[f29])).
% 0.15/0.32 thf(f29,plain,(
% 0.15/0.32 spl3_4 <=> ((cG @ sK0) = $true)),
% 0.15/0.32 introduced(avatar_definition,[new_symbols(naming,[spl3_4])])).
% 0.15/0.32 thf(f32,plain,(
% 0.15/0.32 spl3_3 | ~spl3_4),
% 0.15/0.32 inference(avatar_split_clause,[],[f15,f29,f26])).
% 0.15/0.32 thf(f15,plain,(
% 0.15/0.32 ( ! [X2 : $i] : (((cG @ sK0) != $true) | ((cN @ X2) != $true)) )),
% 0.15/0.32 inference(cnf_transformation,[],[f12])).
% 0.15/0.32 thf(f24,plain,(
% 0.15/0.32 spl3_1 | spl3_2),
% 0.15/0.32 inference(avatar_split_clause,[],[f13,f21,f18])).
% 0.15/0.32 thf(f13,plain,(
% 0.15/0.32 ( ! [X4 : $i] : (($true = (cN @ sK2)) | ((cM @ X4) = $true)) )),
% 0.15/0.32 inference(cnf_transformation,[],[f12])).
% 0.15/0.32 % SZS output end Proof for theBenchmark
% 0.15/0.32 % (2367)------------------------------
% 0.15/0.32 % (2367)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (2367)Termination reason: Refutation
% 0.15/0.32
% 0.15/0.32 % (2367)Memory used [KB]: 5500
% 0.15/0.32 % (2367)Time elapsed: 0.003 s
% 0.15/0.32 % (2367)Instructions burned: 2 (million)
% 0.15/0.32 % (2367)------------------------------
% 0.15/0.32 % (2367)------------------------------
% 0.15/0.32 % (2364)Success in time 0.002 s
% 0.15/0.32 % Vampire---4.8 exiting
%------------------------------------------------------------------------------