TSTP Solution File: SYO109^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO109^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 : n027.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.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO109^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14 % 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.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 10:02:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.14/0.35 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.14/0.37 % (26476)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.14/0.37 % (26475)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37 % (26472)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.14/0.37 % (26476)Instruction limit reached!
% 0.14/0.37 % (26476)------------------------------
% 0.14/0.37 % (26476)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (26476)Termination reason: Unknown
% 0.14/0.37 % (26476)Termination phase: shuffling
% 0.14/0.37
% 0.14/0.37 % (26476)Memory used [KB]: 895
% 0.14/0.37 % (26476)Time elapsed: 0.003 s
% 0.14/0.37 % (26476)Instructions burned: 2 (million)
% 0.14/0.37 % (26476)------------------------------
% 0.14/0.37 % (26476)------------------------------
% 0.14/0.37 % (26477)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.14/0.37 % (26473)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.14/0.37 % (26478)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.37 % (26475)Instruction limit reached!
% 0.14/0.37 % (26475)------------------------------
% 0.14/0.37 % (26475)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (26475)Termination reason: Unknown
% 0.14/0.37 % (26475)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (26475)Memory used [KB]: 5373
% 0.14/0.37 % (26475)Time elapsed: 0.004 s
% 0.14/0.37 % (26475)Instructions burned: 2 (million)
% 0.14/0.37 % (26475)------------------------------
% 0.14/0.37 % (26475)------------------------------
% 0.14/0.38 % (26474)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.14/0.38 % (26473)Instruction limit reached!
% 0.14/0.38 % (26473)------------------------------
% 0.14/0.38 % (26473)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (26473)Termination reason: Unknown
% 0.14/0.38 % (26473)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (26473)Memory used [KB]: 5500
% 0.14/0.38 % (26473)Time elapsed: 0.006 s
% 0.14/0.38 % (26473)Instructions burned: 4 (million)
% 0.14/0.38 % (26473)------------------------------
% 0.14/0.38 % (26473)------------------------------
% 0.14/0.38 % (26472)First to succeed.
% 0.14/0.38 % (26477)Also succeeded, but the first one will report.
% 0.14/0.38 % (26479)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.14/0.38 % (26472)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% 0.14/0.38 thf(func_def_0, type, cP: $i > $o).
% 0.14/0.38 thf(func_def_1, type, cN: $i > $i > $o).
% 0.14/0.38 thf(func_def_2, type, cM: $i > $i > $o).
% 0.14/0.38 thf(func_def_7, type, sK1: $i > $i).
% 0.14/0.38 thf(f56,plain,(
% 0.14/0.38 $false),
% 0.14/0.38 inference(avatar_sat_refutation,[],[f38,f41,f55])).
% 0.14/0.38 thf(f55,plain,(
% 0.14/0.38 spl2_2 | ~spl2_1),
% 0.14/0.38 inference(avatar_split_clause,[],[f54,f33,f36])).
% 0.14/0.38 thf(f36,plain,(
% 0.14/0.38 spl2_2 <=> ! [X1] : ($true = (cP @ X1))),
% 0.14/0.38 introduced(avatar_definition,[new_symbols(naming,[spl2_2])])).
% 0.14/0.38 thf(f33,plain,(
% 0.14/0.38 spl2_1 <=> ! [X0] : ($true = (cN @ (sK1 @ X0) @ X0))),
% 0.14/0.38 introduced(avatar_definition,[new_symbols(naming,[spl2_1])])).
% 0.14/0.38 thf(f54,plain,(
% 0.14/0.38 ( ! [X0 : $i] : (((cP @ X0) = $true)) ) | ~spl2_1),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f53])).
% 0.14/0.38 thf(f53,plain,(
% 0.14/0.38 ( ! [X0 : $i] : (($true != $true) | ((cP @ X0) = $true)) ) | ~spl2_1),
% 0.14/0.38 inference(superposition,[],[f52,f34])).
% 0.14/0.38 thf(f34,plain,(
% 0.14/0.38 ( ! [X0 : $i] : (($true = (cN @ (sK1 @ X0) @ X0))) ) | ~spl2_1),
% 0.14/0.38 inference(avatar_component_clause,[],[f33])).
% 0.14/0.38 thf(f52,plain,(
% 0.14/0.38 ( ! [X0 : $i,X1 : $i] : (($true != (cN @ X1 @ X0)) | ((cP @ X0) = $true)) )),
% 0.14/0.38 inference(subsumption_resolution,[],[f51,f17])).
% 0.14/0.38 thf(f17,plain,(
% 0.14/0.38 ( ! [X0 : $i,X1 : $i] : (((cM @ X0 @ X1) != $true) | ((cP @ X0) = $true)) )),
% 0.14/0.38 inference(cnf_transformation,[],[f11])).
% 0.14/0.38 thf(f11,plain,(
% 0.14/0.38 ! [X0] : (! [X1] : (((cM @ X0 @ X1) != $true) & ((cN @ X0 @ X1) != $true)) | ((cP @ X0) = $true)) & ($true != (cP @ sK0)) & ! [X3,X4] : (($true = (cN @ X3 @ X3)) | (($true != (cN @ X4 @ X3)) & ((cM @ X4 @ X3) != $true)) | ($true = (cM @ X3 @ X3)) | ($true = (cN @ X3 @ X4)) | ((cM @ X3 @ X4) = $true)) & ! [X5] : (($true = (cN @ (sK1 @ X5) @ X5)) | ! [X7] : ($true = (cM @ (sK1 @ X5) @ X7)))),
% 0.14/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f10,f9])).
% 0.14/0.38 thf(f9,plain,(
% 0.14/0.38 ? [X2] : ($true != (cP @ X2)) => ($true != (cP @ sK0))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f10,plain,(
% 0.14/0.38 ! [X5] : (? [X6] : (($true = (cN @ X6 @ X5)) | ! [X7] : ((cM @ X6 @ X7) = $true)) => (($true = (cN @ (sK1 @ X5) @ X5)) | ! [X7] : ($true = (cM @ (sK1 @ X5) @ X7))))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f8,plain,(
% 0.14/0.38 ! [X0] : (! [X1] : (((cM @ X0 @ X1) != $true) & ((cN @ X0 @ X1) != $true)) | ((cP @ X0) = $true)) & ? [X2] : ($true != (cP @ X2)) & ! [X3,X4] : (($true = (cN @ X3 @ X3)) | (($true != (cN @ X4 @ X3)) & ((cM @ X4 @ X3) != $true)) | ($true = (cM @ X3 @ X3)) | ($true = (cN @ X3 @ X4)) | ((cM @ X3 @ X4) = $true)) & ! [X5] : ? [X6] : (($true = (cN @ X6 @ X5)) | ! [X7] : ((cM @ X6 @ X7) = $true))),
% 0.14/0.38 inference(rectify,[],[f7])).
% 0.14/0.38 thf(f7,plain,(
% 0.14/0.38 ! [X3] : (! [X4] : (((cM @ X3 @ X4) != $true) & ($true != (cN @ X3 @ X4))) | ((cP @ X3) = $true)) & ? [X7] : ($true != (cP @ X7)) & ! [X6,X5] : (($true = (cN @ X6 @ X6)) | (($true != (cN @ X5 @ X6)) & ($true != (cM @ X5 @ X6))) | ($true = (cM @ X6 @ X6)) | ($true = (cN @ X6 @ X5)) | ($true = (cM @ X6 @ X5))) & ! [X0] : ? [X1] : (($true = (cN @ X1 @ X0)) | ! [X2] : ($true = (cM @ X1 @ X2)))),
% 0.14/0.38 inference(flattening,[],[f6])).
% 0.14/0.38 thf(f6,plain,(
% 0.14/0.38 ? [X7] : ($true != (cP @ X7)) & (! [X3] : (! [X4] : (((cM @ X3 @ X4) != $true) & ($true != (cN @ X3 @ X4))) | ((cP @ X3) = $true)) & ! [X6,X5] : ((($true = (cN @ X6 @ X6)) | ($true = (cN @ X6 @ X5)) | ($true = (cM @ X6 @ X5)) | ($true = (cM @ X6 @ X6))) | (($true != (cN @ X5 @ X6)) & ($true != (cM @ X5 @ X6)))) & ! [X0] : ? [X1] : (($true = (cN @ X1 @ X0)) | ! [X2] : ($true = (cM @ X1 @ X2))))),
% 0.14/0.38 inference(ennf_transformation,[],[f5])).
% 0.14/0.38 thf(f5,plain,(
% 0.14/0.38 ~((! [X3] : (? [X4] : (((cM @ X3 @ X4) = $true) | ($true = (cN @ X3 @ X4))) => ((cP @ X3) = $true)) & ! [X6,X5] : ((($true = (cM @ X5 @ X6)) | ($true = (cN @ X5 @ X6))) => (($true = (cN @ X6 @ X6)) | ($true = (cN @ X6 @ X5)) | ($true = (cM @ X6 @ X5)) | ($true = (cM @ X6 @ X6)))) & ! [X0] : ? [X1] : (($true = (cN @ X1 @ X0)) | ! [X2] : ($true = (cM @ X1 @ X2)))) => ! [X7] : ($true = (cP @ X7)))),
% 0.14/0.38 inference(fool_elimination,[],[f4])).
% 0.14/0.38 thf(f4,plain,(
% 0.14/0.38 ~((! [X0] : ? [X1] : ((cN @ X1 @ X0) | ! [X2] : (cM @ X1 @ X2)) & ! [X3] : (? [X4] : ((cM @ X3 @ X4) | (cN @ X3 @ X4)) => (cP @ X3)) & ! [X5,X6] : (((cM @ X5 @ X6) | (cN @ X5 @ X6)) => ((cN @ X6 @ X5) | (cN @ X6 @ X6) | (cM @ X6 @ X6) | (cM @ X6 @ X5)))) => ! [X7] : (cP @ X7))),
% 0.14/0.38 inference(rectify,[],[f2])).
% 0.14/0.38 thf(f2,negated_conjecture,(
% 0.14/0.38 ~((! [X2] : ? [X3] : ((cN @ X3 @ X2) | ! [X4] : (cM @ X3 @ X4)) & ! [X0] : (? [X1] : ((cM @ X0 @ X1) | (cN @ X0 @ X1)) => (cP @ X0)) & ! [X2,X5] : (((cM @ X2 @ X5) | (cN @ X2 @ X5)) => ((cN @ X5 @ X2) | (cN @ X5 @ X5) | (cM @ X5 @ X5) | (cM @ X5 @ X2)))) => ! [X5] : (cP @ X5))),
% 0.14/0.38 inference(negated_conjecture,[],[f1])).
% 0.14/0.38 thf(f1,conjecture,(
% 0.14/0.38 (! [X2] : ? [X3] : ((cN @ X3 @ X2) | ! [X4] : (cM @ X3 @ X4)) & ! [X0] : (? [X1] : ((cM @ X0 @ X1) | (cN @ X0 @ X1)) => (cP @ X0)) & ! [X2,X5] : (((cM @ X2 @ X5) | (cN @ X2 @ X5)) => ((cN @ X5 @ X2) | (cN @ X5 @ X5) | (cM @ X5 @ X5) | (cM @ X5 @ X2)))) => ! [X5] : (cP @ X5)),
% 0.14/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM271)).
% 0.14/0.38 thf(f51,plain,(
% 0.14/0.38 ( ! [X0 : $i,X1 : $i] : (((cM @ X0 @ X1) = $true) | ((cP @ X0) = $true) | ($true != (cN @ X1 @ X0))) )),
% 0.14/0.38 inference(subsumption_resolution,[],[f50,f16])).
% 0.14/0.38 thf(f16,plain,(
% 0.14/0.38 ( ! [X0 : $i,X1 : $i] : (((cN @ X0 @ X1) != $true) | ((cP @ X0) = $true)) )),
% 0.14/0.38 inference(cnf_transformation,[],[f11])).
% 0.14/0.38 thf(f50,plain,(
% 0.14/0.38 ( ! [X0 : $i,X1 : $i] : (((cP @ X0) = $true) | ((cN @ X0 @ X0) = $true) | ($true != (cN @ X1 @ X0)) | ((cM @ X0 @ X1) = $true)) )),
% 0.14/0.38 inference(subsumption_resolution,[],[f48,f16])).
% 0.14/0.38 thf(f48,plain,(
% 0.14/0.38 ( ! [X0 : $i,X1 : $i] : (((cN @ X0 @ X1) = $true) | ((cM @ X0 @ X1) = $true) | ($true != (cN @ X1 @ X0)) | ((cN @ X0 @ X0) = $true) | ((cP @ X0) = $true)) )),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f44])).
% 0.14/0.38 thf(f44,plain,(
% 0.14/0.38 ( ! [X0 : $i,X1 : $i] : (((cM @ X0 @ X1) = $true) | ((cP @ X0) = $true) | ($true != (cN @ X1 @ X0)) | ((cN @ X0 @ X1) = $true) | ($true != $true) | ((cN @ X0 @ X0) = $true)) )),
% 0.14/0.38 inference(superposition,[],[f27,f14])).
% 0.14/0.38 thf(f14,plain,(
% 0.14/0.38 ( ! [X3 : $i,X4 : $i] : (($true = (cM @ X3 @ X3)) | ((cM @ X3 @ X4) = $true) | ($true = (cN @ X3 @ X3)) | ($true = (cN @ X3 @ X4)) | ($true != (cN @ X4 @ X3))) )),
% 0.14/0.38 inference(cnf_transformation,[],[f11])).
% 0.14/0.38 thf(f27,plain,(
% 0.14/0.38 ( ! [X0 : $i,X1 : $i] : (($true != (cM @ X1 @ X0)) | ((cP @ X0) = $true)) )),
% 0.14/0.38 inference(subsumption_resolution,[],[f26,f16])).
% 0.14/0.38 thf(f26,plain,(
% 0.14/0.38 ( ! [X0 : $i,X1 : $i] : (($true != (cM @ X1 @ X0)) | ((cN @ X0 @ X1) = $true) | ((cP @ X0) = $true)) )),
% 0.14/0.38 inference(subsumption_resolution,[],[f25,f16])).
% 0.14/0.38 thf(f25,plain,(
% 0.14/0.38 ( ! [X0 : $i,X1 : $i] : (($true != (cM @ X1 @ X0)) | ((cP @ X0) = $true) | ((cN @ X0 @ X0) = $true) | ((cN @ X0 @ X1) = $true)) )),
% 0.14/0.38 inference(subsumption_resolution,[],[f23,f17])).
% 0.14/0.38 thf(f23,plain,(
% 0.14/0.38 ( ! [X0 : $i,X1 : $i] : (((cP @ X0) = $true) | ($true != (cM @ X1 @ X0)) | ((cN @ X0 @ X1) = $true) | ((cM @ X0 @ X1) = $true) | ((cN @ X0 @ X0) = $true)) )),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f21])).
% 0.14/0.38 thf(f21,plain,(
% 0.14/0.38 ( ! [X0 : $i,X1 : $i] : (((cN @ X0 @ X0) = $true) | ($true != (cM @ X1 @ X0)) | ($true != $true) | ((cM @ X0 @ X1) = $true) | ((cN @ X0 @ X1) = $true) | ((cP @ X0) = $true)) )),
% 0.14/0.38 inference(superposition,[],[f17,f13])).
% 0.14/0.38 thf(f13,plain,(
% 0.14/0.38 ( ! [X3 : $i,X4 : $i] : (($true = (cM @ X3 @ X3)) | ($true = (cN @ X3 @ X3)) | ($true = (cN @ X3 @ X4)) | ((cM @ X3 @ X4) = $true) | ((cM @ X4 @ X3) != $true)) )),
% 0.14/0.38 inference(cnf_transformation,[],[f11])).
% 0.14/0.38 thf(f41,plain,(
% 0.14/0.38 ~spl2_2),
% 0.14/0.38 inference(avatar_contradiction_clause,[],[f40])).
% 0.14/0.38 thf(f40,plain,(
% 0.14/0.38 $false | ~spl2_2),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f39])).
% 0.14/0.38 thf(f39,plain,(
% 0.14/0.38 ($true != $true) | ~spl2_2),
% 0.14/0.38 inference(superposition,[],[f15,f37])).
% 0.14/0.38 thf(f37,plain,(
% 0.14/0.38 ( ! [X1 : $i] : (($true = (cP @ X1))) ) | ~spl2_2),
% 0.14/0.38 inference(avatar_component_clause,[],[f36])).
% 0.14/0.38 thf(f15,plain,(
% 0.14/0.38 ($true != (cP @ sK0))),
% 0.14/0.38 inference(cnf_transformation,[],[f11])).
% 0.14/0.38 thf(f38,plain,(
% 0.14/0.38 spl2_1 | spl2_2),
% 0.14/0.38 inference(avatar_split_clause,[],[f31,f36,f33])).
% 0.14/0.38 thf(f31,plain,(
% 0.14/0.38 ( ! [X0 : $i,X1 : $i] : (($true = (cN @ (sK1 @ X0) @ X0)) | ($true = (cP @ X1))) )),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f28])).
% 0.14/0.38 thf(f28,plain,(
% 0.14/0.38 ( ! [X0 : $i,X1 : $i] : (($true != $true) | ($true = (cP @ X1)) | ($true = (cN @ (sK1 @ X0) @ X0))) )),
% 0.14/0.38 inference(superposition,[],[f27,f12])).
% 0.14/0.38 thf(f12,plain,(
% 0.14/0.38 ( ! [X7 : $i,X5 : $i] : (($true = (cM @ (sK1 @ X5) @ X7)) | ($true = (cN @ (sK1 @ X5) @ X5))) )),
% 0.14/0.38 inference(cnf_transformation,[],[f11])).
% 0.14/0.38 % SZS output end Proof for theBenchmark
% 0.14/0.38 % (26472)------------------------------
% 0.14/0.38 % (26472)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (26472)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (26472)Memory used [KB]: 5500
% 0.14/0.38 % (26472)Time elapsed: 0.009 s
% 0.14/0.38 % (26472)Instructions burned: 6 (million)
% 0.14/0.38 % (26472)------------------------------
% 0.14/0.38 % (26472)------------------------------
% 0.14/0.38 % (26468)Success in time 0.014 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------