TSTP Solution File: SYO160^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO160^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 : n003.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:03:16 EDT 2024
% Result : Theorem 0.16s 0.40s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYO160^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.15 % 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.16/0.37 % Computer : n003.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 20 09:12:23 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a TH0_THM_NEQ_NAR problem
% 0.16/0.37 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.16/0.39 % (30524)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 (2999ds/275Mi)
% 0.16/0.39 % (30522)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.16/0.39 % (30520)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 (2999ds/4Mi)
% 0.16/0.39 % (30521)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 (2999ds/27Mi)
% 0.16/0.39 % (30525)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.16/0.39 % (30522)Instruction limit reached!
% 0.16/0.39 % (30522)------------------------------
% 0.16/0.39 % (30522)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.39 % (30522)Termination reason: Unknown
% 0.16/0.39 % (30522)Termination phase: Saturation
% 0.16/0.39
% 0.16/0.39 % (30522)Memory used [KB]: 5500
% 0.16/0.39 % (30522)Time elapsed: 0.004 s
% 0.16/0.39 % (30522)Instructions burned: 2 (million)
% 0.16/0.39 % (30522)------------------------------
% 0.16/0.39 % (30522)------------------------------
% 0.16/0.39 % (30526)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.16/0.39 % (30523)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 (2999ds/2Mi)
% 0.16/0.39 % (30523)Instruction limit reached!
% 0.16/0.39 % (30523)------------------------------
% 0.16/0.39 % (30523)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.39 % (30523)Termination reason: Unknown
% 0.16/0.39 % (30523)Termination phase: Saturation
% 0.16/0.39
% 0.16/0.39 % (30523)Memory used [KB]: 5500
% 0.16/0.39 % (30523)Time elapsed: 0.005 s
% 0.16/0.39 % (30523)Instructions burned: 2 (million)
% 0.16/0.39 % (30523)------------------------------
% 0.16/0.39 % (30523)------------------------------
% 0.16/0.39 % (30524)First to succeed.
% 0.16/0.39 % (30526)Instruction limit reached!
% 0.16/0.39 % (30526)------------------------------
% 0.16/0.39 % (30526)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.39 % (30526)Termination reason: Unknown
% 0.16/0.39 % (30526)Termination phase: Saturation
% 0.16/0.39
% 0.16/0.40 % (30526)Memory used [KB]: 5500
% 0.16/0.40 % (30526)Time elapsed: 0.005 s
% 0.16/0.40 % (30526)Instructions burned: 4 (million)
% 0.16/0.40 % (30526)------------------------------
% 0.16/0.40 % (30526)------------------------------
% 0.16/0.40 % (30520)Also succeeded, but the first one will report.
% 0.16/0.40 % (30521)Also succeeded, but the first one will report.
% 0.16/0.40 % (30524)Refutation found. Thanks to Tanya!
% 0.16/0.40 % SZS status Theorem for theBenchmark
% 0.16/0.40 % SZS output start Proof for theBenchmark
% 0.16/0.40 thf(func_def_1, type, cR: $i > $o).
% 0.16/0.40 thf(func_def_4, type, cQ: $i > $o).
% 0.16/0.40 thf(func_def_5, type, cP: $i > $o).
% 0.16/0.40 thf(f66,plain,(
% 0.16/0.40 $false),
% 0.16/0.40 inference(avatar_sat_refutation,[],[f19,f32,f38,f44,f47,f53,f59,f65])).
% 0.16/0.40 thf(f65,plain,(
% 0.16/0.40 ~spl0_1 | spl0_4),
% 0.16/0.40 inference(avatar_contradiction_clause,[],[f64])).
% 0.16/0.40 thf(f64,plain,(
% 0.16/0.40 $false | (~spl0_1 | spl0_4)),
% 0.16/0.40 inference(subsumption_resolution,[],[f63,f15])).
% 0.16/0.40 thf(f15,plain,(
% 0.16/0.40 ( ! [X2 : $i] : (($true = (cQ @ X2))) ) | ~spl0_1),
% 0.16/0.40 inference(avatar_component_clause,[],[f14])).
% 0.16/0.40 thf(f14,plain,(
% 0.16/0.40 spl0_1 <=> ! [X2] : ($true = (cQ @ X2))),
% 0.16/0.40 introduced(avatar_definition,[new_symbols(naming,[spl0_1])])).
% 0.16/0.40 thf(f63,plain,(
% 0.16/0.40 ($true != (cQ @ b)) | spl0_4),
% 0.16/0.40 inference(trivial_inequality_removal,[],[f61])).
% 0.16/0.40 thf(f61,plain,(
% 0.16/0.40 ($true != (cQ @ b)) | ($true != $true) | spl0_4),
% 0.16/0.40 inference(superposition,[],[f27,f9])).
% 0.16/0.40 thf(f9,plain,(
% 0.16/0.40 ( ! [X3 : $i] : (($true = (cR @ X3)) | ($true != (cQ @ X3))) )),
% 0.16/0.40 inference(cnf_transformation,[],[f8])).
% 0.16/0.40 thf(f8,plain,(
% 0.16/0.40 ! [X0] : (((cR @ X0) = $true) | ((cP @ X0) != $true)) & (((cR @ c) != $true) | ((cR @ b) != $true) | ((cR @ a) != $true)) & (! [X1] : ($true = (cP @ X1)) | ! [X2] : ($true = (cQ @ X2))) & ! [X3] : (($true = (cR @ X3)) | ($true != (cQ @ X3)))),
% 0.16/0.40 inference(rectify,[],[f7])).
% 0.16/0.40 thf(f7,plain,(
% 0.16/0.40 ! [X2] : (($true = (cR @ X2)) | ((cP @ X2) != $true)) & (((cR @ c) != $true) | ((cR @ b) != $true) | ((cR @ a) != $true)) & (! [X0] : ((cP @ X0) = $true) | ! [X1] : ($true = (cQ @ X1))) & ! [X3] : (($true = (cR @ X3)) | ($true != (cQ @ X3)))),
% 0.16/0.40 inference(flattening,[],[f6])).
% 0.16/0.40 thf(f6,plain,(
% 0.16/0.40 (((cR @ c) != $true) | ((cR @ b) != $true) | ((cR @ a) != $true)) & (! [X2] : (($true = (cR @ X2)) | ((cP @ X2) != $true)) & ! [X3] : (($true = (cR @ X3)) | ($true != (cQ @ X3))) & (! [X0] : ((cP @ X0) = $true) | ! [X1] : ($true = (cQ @ X1))))),
% 0.16/0.40 inference(ennf_transformation,[],[f5])).
% 0.16/0.40 thf(f5,plain,(
% 0.16/0.40 ~((! [X2] : (((cP @ X2) = $true) => ($true = (cR @ X2))) & ! [X3] : (($true = (cQ @ X3)) => ($true = (cR @ X3))) & (! [X0] : ((cP @ X0) = $true) | ! [X1] : ($true = (cQ @ X1)))) => (((cR @ c) = $true) & ((cR @ b) = $true) & ((cR @ a) = $true)))),
% 0.16/0.40 inference(fool_elimination,[],[f4])).
% 0.16/0.40 thf(f4,plain,(
% 0.16/0.40 ~(((! [X0] : (cP @ X0) | ! [X1] : (cQ @ X1)) & ! [X2] : ((cP @ X2) => (cR @ X2)) & ! [X3] : ((cQ @ X3) => (cR @ X3))) => ((cR @ a) & (cR @ c) & (cR @ b)))),
% 0.16/0.40 inference(rectify,[],[f2])).
% 0.16/0.40 thf(f2,negated_conjecture,(
% 0.16/0.40 ~(((! [X0] : (cP @ X0) | ! [X0] : (cQ @ X0)) & ! [X0] : ((cP @ X0) => (cR @ X0)) & ! [X0] : ((cQ @ X0) => (cR @ X0))) => ((cR @ a) & (cR @ c) & (cR @ b)))),
% 0.16/0.40 inference(negated_conjecture,[],[f1])).
% 0.16/0.40 thf(f1,conjecture,(
% 0.16/0.40 ((! [X0] : (cP @ X0) | ! [X0] : (cQ @ X0)) & ! [X0] : ((cP @ X0) => (cR @ X0)) & ! [X0] : ((cQ @ X0) => (cR @ X0))) => ((cR @ a) & (cR @ c) & (cR @ b))),
% 0.16/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cDISJ_THIRD)).
% 0.16/0.40 thf(f27,plain,(
% 0.16/0.40 ((cR @ b) != $true) | spl0_4),
% 0.16/0.40 inference(avatar_component_clause,[],[f25])).
% 0.16/0.40 thf(f25,plain,(
% 0.16/0.40 spl0_4 <=> ((cR @ b) = $true)),
% 0.16/0.40 introduced(avatar_definition,[new_symbols(naming,[spl0_4])])).
% 0.16/0.40 thf(f59,plain,(
% 0.16/0.40 ~spl0_1 | spl0_5),
% 0.16/0.40 inference(avatar_contradiction_clause,[],[f58])).
% 0.16/0.40 thf(f58,plain,(
% 0.16/0.40 $false | (~spl0_1 | spl0_5)),
% 0.16/0.40 inference(subsumption_resolution,[],[f57,f15])).
% 0.16/0.40 thf(f57,plain,(
% 0.16/0.40 ((cQ @ c) != $true) | spl0_5),
% 0.16/0.40 inference(trivial_inequality_removal,[],[f55])).
% 0.16/0.40 thf(f55,plain,(
% 0.16/0.40 ((cQ @ c) != $true) | ($true != $true) | spl0_5),
% 0.16/0.40 inference(superposition,[],[f31,f9])).
% 0.16/0.40 thf(f31,plain,(
% 0.16/0.40 ((cR @ c) != $true) | spl0_5),
% 0.16/0.40 inference(avatar_component_clause,[],[f29])).
% 0.16/0.40 thf(f29,plain,(
% 0.16/0.40 spl0_5 <=> ((cR @ c) = $true)),
% 0.16/0.40 introduced(avatar_definition,[new_symbols(naming,[spl0_5])])).
% 0.16/0.40 thf(f53,plain,(
% 0.16/0.40 ~spl0_2 | spl0_4),
% 0.16/0.40 inference(avatar_contradiction_clause,[],[f52])).
% 0.16/0.40 thf(f52,plain,(
% 0.16/0.40 $false | (~spl0_2 | spl0_4)),
% 0.16/0.40 inference(subsumption_resolution,[],[f50,f18])).
% 0.16/0.40 thf(f18,plain,(
% 0.16/0.40 ( ! [X1 : $i] : (($true = (cP @ X1))) ) | ~spl0_2),
% 0.16/0.40 inference(avatar_component_clause,[],[f17])).
% 0.16/0.40 thf(f17,plain,(
% 0.16/0.40 spl0_2 <=> ! [X1] : ($true = (cP @ X1))),
% 0.16/0.40 introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
% 0.16/0.40 thf(f50,plain,(
% 0.16/0.40 ((cP @ b) != $true) | spl0_4),
% 0.16/0.40 inference(trivial_inequality_removal,[],[f48])).
% 0.16/0.40 thf(f48,plain,(
% 0.16/0.40 ($true != $true) | ((cP @ b) != $true) | spl0_4),
% 0.16/0.40 inference(superposition,[],[f27,f12])).
% 0.16/0.40 thf(f12,plain,(
% 0.16/0.40 ( ! [X0 : $i] : (((cR @ X0) = $true) | ((cP @ X0) != $true)) )),
% 0.16/0.40 inference(cnf_transformation,[],[f8])).
% 0.16/0.40 thf(f47,plain,(
% 0.16/0.40 ~spl0_1 | spl0_3),
% 0.16/0.40 inference(avatar_contradiction_clause,[],[f46])).
% 0.16/0.40 thf(f46,plain,(
% 0.16/0.40 $false | (~spl0_1 | spl0_3)),
% 0.16/0.40 inference(trivial_inequality_removal,[],[f45])).
% 0.16/0.40 thf(f45,plain,(
% 0.16/0.40 ($true != $true) | (~spl0_1 | spl0_3)),
% 0.16/0.40 inference(superposition,[],[f42,f15])).
% 0.16/0.40 thf(f42,plain,(
% 0.16/0.40 ($true != (cQ @ a)) | spl0_3),
% 0.16/0.40 inference(trivial_inequality_removal,[],[f40])).
% 0.16/0.40 thf(f40,plain,(
% 0.16/0.40 ($true != (cQ @ a)) | ($true != $true) | spl0_3),
% 0.16/0.40 inference(superposition,[],[f23,f9])).
% 0.16/0.40 thf(f23,plain,(
% 0.16/0.40 ((cR @ a) != $true) | spl0_3),
% 0.16/0.40 inference(avatar_component_clause,[],[f21])).
% 0.16/0.40 thf(f21,plain,(
% 0.16/0.40 spl0_3 <=> ((cR @ a) = $true)),
% 0.16/0.40 introduced(avatar_definition,[new_symbols(naming,[spl0_3])])).
% 0.16/0.40 thf(f44,plain,(
% 0.16/0.40 ~spl0_2 | spl0_3),
% 0.16/0.40 inference(avatar_contradiction_clause,[],[f43])).
% 0.16/0.40 thf(f43,plain,(
% 0.16/0.40 $false | (~spl0_2 | spl0_3)),
% 0.16/0.40 inference(subsumption_resolution,[],[f41,f18])).
% 0.16/0.40 thf(f41,plain,(
% 0.16/0.40 ((cP @ a) != $true) | spl0_3),
% 0.16/0.40 inference(trivial_inequality_removal,[],[f39])).
% 0.16/0.40 thf(f39,plain,(
% 0.16/0.40 ($true != $true) | ((cP @ a) != $true) | spl0_3),
% 0.16/0.40 inference(superposition,[],[f23,f12])).
% 0.16/0.40 thf(f38,plain,(
% 0.16/0.40 ~spl0_2 | spl0_5),
% 0.16/0.40 inference(avatar_contradiction_clause,[],[f37])).
% 0.16/0.40 thf(f37,plain,(
% 0.16/0.40 $false | (~spl0_2 | spl0_5)),
% 0.16/0.40 inference(subsumption_resolution,[],[f36,f18])).
% 0.16/0.40 thf(f36,plain,(
% 0.16/0.40 ((cP @ c) != $true) | spl0_5),
% 0.16/0.40 inference(trivial_inequality_removal,[],[f35])).
% 0.16/0.40 thf(f35,plain,(
% 0.16/0.40 ($true != $true) | ((cP @ c) != $true) | spl0_5),
% 0.16/0.40 inference(superposition,[],[f31,f12])).
% 0.16/0.40 thf(f32,plain,(
% 0.16/0.40 ~spl0_3 | ~spl0_4 | ~spl0_5),
% 0.16/0.40 inference(avatar_split_clause,[],[f11,f29,f25,f21])).
% 0.16/0.40 thf(f11,plain,(
% 0.16/0.40 ((cR @ b) != $true) | ((cR @ a) != $true) | ((cR @ c) != $true)),
% 0.16/0.40 inference(cnf_transformation,[],[f8])).
% 0.16/0.40 thf(f19,plain,(
% 0.16/0.40 spl0_1 | spl0_2),
% 0.16/0.40 inference(avatar_split_clause,[],[f10,f17,f14])).
% 0.16/0.40 thf(f10,plain,(
% 0.16/0.40 ( ! [X2 : $i,X1 : $i] : (($true = (cP @ X1)) | ($true = (cQ @ X2))) )),
% 0.16/0.40 inference(cnf_transformation,[],[f8])).
% 0.16/0.40 % SZS output end Proof for theBenchmark
% 0.16/0.40 % (30524)------------------------------
% 0.16/0.40 % (30524)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (30524)Termination reason: Refutation
% 0.16/0.40
% 0.16/0.40 % (30524)Memory used [KB]: 5500
% 0.16/0.40 % (30524)Time elapsed: 0.007 s
% 0.16/0.40 % (30524)Instructions burned: 4 (million)
% 0.16/0.40 % (30524)------------------------------
% 0.16/0.40 % (30524)------------------------------
% 0.16/0.40 % (30518)Success in time 0.009 s
% 0.16/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------