TSTP Solution File: SYO383^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO383^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 : 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:14 EDT 2024
% Result : Theorem 0.15s 0.33s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SYO383^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.10 % 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.09/0.30 % Computer : n010.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon May 20 09:45:52 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.30 This is a TH0_THM_NEQ_NAR problem
% 0.09/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.32 % (9010)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.15/0.32 % (9009)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.15/0.32 % (9011)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.32 % (9012)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.32 % (9015)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.32 % (9013)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.32 % (9014)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.15/0.32 % (9012)Instruction limit reached!
% 0.15/0.32 % (9012)------------------------------
% 0.15/0.32 % (9012)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (9012)Termination reason: Unknown
% 0.15/0.32 % (9012)Termination phase: Preprocessing 1
% 0.15/0.32
% 0.15/0.32 % (9012)Memory used [KB]: 895
% 0.15/0.32 % (9012)Time elapsed: 0.002 s
% 0.15/0.32 % (9012)Instructions burned: 2 (million)
% 0.15/0.32 % (9012)------------------------------
% 0.15/0.32 % (9012)------------------------------
% 0.15/0.32 % (9013)Instruction limit reached!
% 0.15/0.32 % (9013)------------------------------
% 0.15/0.32 % (9013)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (9013)Termination reason: Unknown
% 0.15/0.32 % (9013)Termination phase: Saturation
% 0.15/0.32
% 0.15/0.32 % (9013)Memory used [KB]: 5500
% 0.15/0.32 % (9013)Time elapsed: 0.003 s
% 0.15/0.32 % (9013)Instructions burned: 3 (million)
% 0.15/0.32 % (9013)------------------------------
% 0.15/0.32 % (9013)------------------------------
% 0.15/0.32 % (9016)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.15/0.32 % (9010)Instruction limit reached!
% 0.15/0.32 % (9010)------------------------------
% 0.15/0.32 % (9010)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (9010)Termination reason: Unknown
% 0.15/0.32 % (9010)Termination phase: Saturation
% 0.15/0.32
% 0.15/0.32 % (9010)Memory used [KB]: 5500
% 0.15/0.32 % (9010)Time elapsed: 0.004 s
% 0.15/0.32 % (9010)Instructions burned: 4 (million)
% 0.15/0.32 % (9010)------------------------------
% 0.15/0.32 % (9010)------------------------------
% 0.15/0.32 % (9009)First to succeed.
% 0.15/0.32 % (9016)Instruction limit reached!
% 0.15/0.32 % (9016)------------------------------
% 0.15/0.32 % (9016)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (9016)Termination reason: Unknown
% 0.15/0.32 % (9016)Termination phase: Saturation
% 0.15/0.32
% 0.15/0.32 % (9016)Memory used [KB]: 5500
% 0.15/0.32 % (9016)Time elapsed: 0.003 s
% 0.15/0.32 % (9016)Instructions burned: 3 (million)
% 0.15/0.32 % (9016)------------------------------
% 0.15/0.32 % (9016)------------------------------
% 0.15/0.33 % (9014)Also succeeded, but the first one will report.
% 0.15/0.33 % (9009)Refutation found. Thanks to Tanya!
% 0.15/0.33 % SZS status Theorem for theBenchmark
% 0.15/0.33 % SZS output start Proof for theBenchmark
% 0.15/0.33 thf(func_def_0, type, cQ_2: $i > $i > $i > $o).
% 0.15/0.33 thf(func_def_1, type, f: $i > $i).
% 0.15/0.33 thf(func_def_2, type, cP_1: $i > $i > $o).
% 0.15/0.33 thf(func_def_3, type, cQ_1: $i > $i > $i > $o).
% 0.15/0.33 thf(f45,plain,(
% 0.15/0.33 $false),
% 0.15/0.33 inference(avatar_sat_refutation,[],[f29,f34,f39,f44])).
% 0.15/0.33 thf(f44,plain,(
% 0.15/0.33 ~spl0_1),
% 0.15/0.33 inference(avatar_contradiction_clause,[],[f43])).
% 0.15/0.33 thf(f43,plain,(
% 0.15/0.33 $false | ~spl0_1),
% 0.15/0.33 inference(trivial_inequality_removal,[],[f42])).
% 0.15/0.33 thf(f42,plain,(
% 0.15/0.33 ($true != $true) | ~spl0_1),
% 0.15/0.33 inference(superposition,[],[f41,f9])).
% 0.15/0.33 thf(f9,plain,(
% 0.15/0.33 ((cP_1 @ c @ c) = $true)),
% 0.15/0.33 inference(cnf_transformation,[],[f7])).
% 0.15/0.33 thf(f7,plain,(
% 0.15/0.33 ((cP_1 @ a @ a) = $true) & ! [X0,X1,X2,X3,X4,X5] : (($true != (cP_1 @ (f @ X5) @ X3)) | ($true != (cQ_1 @ X1 @ X0 @ X5)) | ($true != (cP_1 @ (f @ X1) @ X2)) | ($true = (cQ_2 @ X2 @ X4 @ X3)) | ($true != (cP_1 @ (f @ X0) @ X4))) & ! [X6] : ((cP_1 @ d @ X6) = $true) & ((cQ_1 @ a @ b @ c) = $true) & ((cP_1 @ b @ b) = $true) & ! [X7,X8] : (($true != (cP_1 @ X7 @ X8)) | ($true = (cP_1 @ (f @ X7) @ X8))) & ((cP_1 @ c @ c) = $true) & ! [X9,X10,X11] : ($true != (cQ_2 @ X10 @ X9 @ X11))),
% 0.15/0.33 inference(rectify,[],[f6])).
% 0.15/0.33 thf(f6,plain,(
% 0.15/0.33 ((cP_1 @ a @ a) = $true) & ! [X9,X6,X10,X7,X11,X8] : (($true != (cP_1 @ (f @ X8) @ X7)) | ($true != (cQ_1 @ X6 @ X9 @ X8)) | ($true != (cP_1 @ (f @ X6) @ X10)) | ((cQ_2 @ X10 @ X11 @ X7) = $true) | ($true != (cP_1 @ (f @ X9) @ X11))) & ! [X0] : ((cP_1 @ d @ X0) = $true) & ((cQ_1 @ a @ b @ c) = $true) & ((cP_1 @ b @ b) = $true) & ! [X2,X1] : (($true != (cP_1 @ X2 @ X1)) | ($true = (cP_1 @ (f @ X2) @ X1))) & ((cP_1 @ c @ c) = $true) & ! [X3,X4,X5] : ($true != (cQ_2 @ X4 @ X3 @ X5))),
% 0.15/0.33 inference(flattening,[],[f5])).
% 0.15/0.33 thf(f5,plain,(
% 0.15/0.33 ~~(! [X0] : ((cP_1 @ d @ X0) = $true) & ((cQ_1 @ a @ b @ c) = $true) & ((cP_1 @ b @ b) = $true) & ((cP_1 @ a @ a) = $true) & ((cP_1 @ c @ c) = $true) & ! [X1,X2] : (~($true = (cP_1 @ X2 @ X1)) | ($true = (cP_1 @ (f @ X2) @ X1))) & ! [X3,X4,X5] : ~($true = (cQ_2 @ X4 @ X3 @ X5)) & ! [X6,X7,X8,X9,X10,X11] : (~($true = (cP_1 @ (f @ X8) @ X7)) | ~($true = (cP_1 @ (f @ X9) @ X11)) | ~($true = (cQ_1 @ X6 @ X9 @ X8)) | ~($true = (cP_1 @ (f @ X6) @ X10)) | ((cQ_2 @ X10 @ X11 @ X7) = $true)))),
% 0.15/0.33 inference(fool_elimination,[],[f4])).
% 0.15/0.33 thf(f4,plain,(
% 0.15/0.33 ~~(! [X0] : (cP_1 @ d @ X0) & (cQ_1 @ a @ b @ c) & (cP_1 @ b @ b) & (cP_1 @ a @ a) & (cP_1 @ c @ c) & ! [X1,X2] : (~(cP_1 @ X2 @ X1) | (cP_1 @ (f @ X2) @ X1)) & ! [X3,X4,X5] : ~(cQ_2 @ X4 @ X3 @ X5) & ! [X6,X7,X8,X9,X10,X11] : (~(cP_1 @ (f @ X8) @ X7) | ~(cP_1 @ (f @ X9) @ X11) | ~(cQ_1 @ X6 @ X9 @ X8) | ~(cP_1 @ (f @ X6) @ X10) | (cQ_2 @ X10 @ X11 @ X7)))),
% 0.15/0.33 inference(rectify,[],[f2])).
% 0.15/0.33 thf(f2,negated_conjecture,(
% 0.15/0.33 ~~(! [X0] : (cP_1 @ d @ X0) & (cQ_1 @ a @ b @ c) & (cP_1 @ b @ b) & (cP_1 @ a @ a) & (cP_1 @ c @ c) & ! [X1,X0] : (~(cP_1 @ X0 @ X1) | (cP_1 @ (f @ X0) @ X1)) & ! [X1,X0,X2] : ~(cQ_2 @ X0 @ X1 @ X2) & ! [X0,X5,X2,X1,X3,X4] : (~(cP_1 @ (f @ X2) @ X5) | ~(cP_1 @ (f @ X1) @ X4) | ~(cQ_1 @ X0 @ X1 @ X2) | ~(cP_1 @ (f @ X0) @ X3) | (cQ_2 @ X3 @ X4 @ X5)))),
% 0.15/0.33 inference(negated_conjecture,[],[f1])).
% 0.15/0.33 thf(f1,conjecture,(
% 0.15/0.33 ~(! [X0] : (cP_1 @ d @ X0) & (cQ_1 @ a @ b @ c) & (cP_1 @ b @ b) & (cP_1 @ a @ a) & (cP_1 @ c @ c) & ! [X1,X0] : (~(cP_1 @ X0 @ X1) | (cP_1 @ (f @ X0) @ X1)) & ! [X1,X0,X2] : ~(cQ_2 @ X0 @ X1 @ X2) & ! [X0,X5,X2,X1,X3,X4] : (~(cP_1 @ (f @ X2) @ X5) | ~(cP_1 @ (f @ X1) @ X4) | ~(cQ_1 @ X0 @ X1 @ X2) | ~(cP_1 @ (f @ X0) @ X3) | (cQ_2 @ X3 @ X4 @ X5)))),
% 0.15/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM409_1)).
% 0.15/0.33 thf(f41,plain,(
% 0.15/0.33 ( ! [X0 : $i] : (($true != (cP_1 @ c @ X0))) ) | ~spl0_1),
% 0.15/0.33 inference(trivial_inequality_removal,[],[f40])).
% 0.15/0.33 thf(f40,plain,(
% 0.15/0.33 ( ! [X0 : $i] : (($true != $true) | ($true != (cP_1 @ c @ X0))) ) | ~spl0_1),
% 0.15/0.33 inference(superposition,[],[f22,f10])).
% 0.15/0.33 thf(f10,plain,(
% 0.15/0.33 ( ! [X8 : $i,X7 : $i] : (($true = (cP_1 @ (f @ X7) @ X8)) | ($true != (cP_1 @ X7 @ X8))) )),
% 0.15/0.33 inference(cnf_transformation,[],[f7])).
% 0.15/0.33 thf(f22,plain,(
% 0.15/0.33 ( ! [X0 : $i] : (($true != (cP_1 @ (f @ c) @ X0))) ) | ~spl0_1),
% 0.15/0.33 inference(avatar_component_clause,[],[f21])).
% 0.15/0.33 thf(f21,plain,(
% 0.15/0.33 spl0_1 <=> ! [X0] : ($true != (cP_1 @ (f @ c) @ X0))),
% 0.15/0.33 introduced(avatar_definition,[new_symbols(naming,[spl0_1])])).
% 0.15/0.33 thf(f39,plain,(
% 0.15/0.33 ~spl0_3),
% 0.15/0.33 inference(avatar_contradiction_clause,[],[f38])).
% 0.15/0.33 thf(f38,plain,(
% 0.15/0.33 $false | ~spl0_3),
% 0.15/0.33 inference(trivial_inequality_removal,[],[f37])).
% 0.15/0.33 thf(f37,plain,(
% 0.15/0.33 ($true != $true) | ~spl0_3),
% 0.15/0.33 inference(superposition,[],[f36,f15])).
% 0.15/0.33 thf(f15,plain,(
% 0.15/0.33 ((cP_1 @ a @ a) = $true)),
% 0.15/0.33 inference(cnf_transformation,[],[f7])).
% 0.15/0.33 thf(f36,plain,(
% 0.15/0.33 ( ! [X0 : $i] : (($true != (cP_1 @ a @ X0))) ) | ~spl0_3),
% 0.15/0.33 inference(trivial_inequality_removal,[],[f35])).
% 0.15/0.33 thf(f35,plain,(
% 0.15/0.33 ( ! [X0 : $i] : (($true != $true) | ($true != (cP_1 @ a @ X0))) ) | ~spl0_3),
% 0.15/0.33 inference(superposition,[],[f28,f10])).
% 0.15/0.33 thf(f28,plain,(
% 0.15/0.33 ( ! [X1 : $i] : (($true != (cP_1 @ (f @ a) @ X1))) ) | ~spl0_3),
% 0.15/0.33 inference(avatar_component_clause,[],[f27])).
% 0.15/0.33 thf(f27,plain,(
% 0.15/0.33 spl0_3 <=> ! [X1] : ($true != (cP_1 @ (f @ a) @ X1))),
% 0.15/0.33 introduced(avatar_definition,[new_symbols(naming,[spl0_3])])).
% 0.15/0.33 thf(f34,plain,(
% 0.15/0.33 ~spl0_2),
% 0.15/0.33 inference(avatar_contradiction_clause,[],[f33])).
% 0.15/0.33 thf(f33,plain,(
% 0.15/0.33 $false | ~spl0_2),
% 0.15/0.33 inference(trivial_inequality_removal,[],[f32])).
% 0.15/0.33 thf(f32,plain,(
% 0.15/0.33 ($true != $true) | ~spl0_2),
% 0.15/0.33 inference(superposition,[],[f31,f11])).
% 0.15/0.33 thf(f11,plain,(
% 0.15/0.33 ((cP_1 @ b @ b) = $true)),
% 0.15/0.33 inference(cnf_transformation,[],[f7])).
% 0.15/0.33 thf(f31,plain,(
% 0.15/0.33 ( ! [X0 : $i] : (($true != (cP_1 @ b @ X0))) ) | ~spl0_2),
% 0.15/0.33 inference(trivial_inequality_removal,[],[f30])).
% 0.15/0.33 thf(f30,plain,(
% 0.15/0.33 ( ! [X0 : $i] : (($true != (cP_1 @ b @ X0)) | ($true != $true)) ) | ~spl0_2),
% 0.15/0.33 inference(superposition,[],[f25,f10])).
% 0.15/0.33 thf(f25,plain,(
% 0.15/0.33 ( ! [X2 : $i] : (($true != (cP_1 @ (f @ b) @ X2))) ) | ~spl0_2),
% 0.15/0.33 inference(avatar_component_clause,[],[f24])).
% 0.15/0.33 thf(f24,plain,(
% 0.15/0.33 spl0_2 <=> ! [X2] : ($true != (cP_1 @ (f @ b) @ X2))),
% 0.15/0.33 introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
% 0.15/0.33 thf(f29,plain,(
% 0.15/0.33 spl0_1 | spl0_2 | spl0_3),
% 0.15/0.33 inference(avatar_split_clause,[],[f19,f27,f24,f21])).
% 0.15/0.33 thf(f19,plain,(
% 0.15/0.33 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (cP_1 @ (f @ c) @ X0)) | ($true != (cP_1 @ (f @ b) @ X2)) | ($true != (cP_1 @ (f @ a) @ X1))) )),
% 0.15/0.33 inference(trivial_inequality_removal,[],[f18])).
% 0.15/0.33 thf(f18,plain,(
% 0.15/0.33 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != $true) | ($true != (cP_1 @ (f @ c) @ X0)) | ($true != (cP_1 @ (f @ b) @ X2)) | ($true != (cP_1 @ (f @ a) @ X1))) )),
% 0.15/0.33 inference(superposition,[],[f17,f12])).
% 0.15/0.33 thf(f12,plain,(
% 0.15/0.33 ((cQ_1 @ a @ b @ c) = $true)),
% 0.15/0.33 inference(cnf_transformation,[],[f7])).
% 0.15/0.33 thf(f17,plain,(
% 0.15/0.33 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i,X5 : $i] : (($true != (cQ_1 @ X4 @ X3 @ X5)) | ((cP_1 @ (f @ X5) @ X2) != $true) | ($true != (cP_1 @ (f @ X4) @ X0)) | ($true != (cP_1 @ (f @ X3) @ X1))) )),
% 0.15/0.33 inference(trivial_inequality_removal,[],[f16])).
% 0.15/0.33 thf(f16,plain,(
% 0.15/0.33 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i,X5 : $i] : (($true != $true) | ((cP_1 @ (f @ X5) @ X2) != $true) | ($true != (cP_1 @ (f @ X4) @ X0)) | ($true != (cQ_1 @ X4 @ X3 @ X5)) | ($true != (cP_1 @ (f @ X3) @ X1))) )),
% 0.15/0.33 inference(superposition,[],[f8,f14])).
% 0.15/0.33 thf(f14,plain,(
% 0.15/0.33 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i,X5 : $i] : (($true = (cQ_2 @ X2 @ X4 @ X3)) | ($true != (cP_1 @ (f @ X0) @ X4)) | ($true != (cP_1 @ (f @ X1) @ X2)) | ($true != (cP_1 @ (f @ X5) @ X3)) | ($true != (cQ_1 @ X1 @ X0 @ X5))) )),
% 0.15/0.33 inference(cnf_transformation,[],[f7])).
% 0.15/0.33 thf(f8,plain,(
% 0.15/0.33 ( ! [X10 : $i,X11 : $i,X9 : $i] : (($true != (cQ_2 @ X10 @ X9 @ X11))) )),
% 0.15/0.33 inference(cnf_transformation,[],[f7])).
% 0.15/0.33 % SZS output end Proof for theBenchmark
% 0.15/0.33 % (9009)------------------------------
% 0.15/0.33 % (9009)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (9009)Termination reason: Refutation
% 0.15/0.33
% 0.15/0.33 % (9009)Memory used [KB]: 5500
% 0.15/0.33 % (9009)Time elapsed: 0.006 s
% 0.15/0.33 % (9009)Instructions burned: 6 (million)
% 0.15/0.33 % (9009)------------------------------
% 0.15/0.33 % (9009)------------------------------
% 0.15/0.33 % (9008)Success in time 0.005 s
% 0.15/0.33 % Vampire---4.8 exiting
%------------------------------------------------------------------------------