TSTP Solution File: SYO095^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO095^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 : n024.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:55 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO095^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.15/0.35 % Computer : n024.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 10:12:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 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/sandbox2/benchmark/theBenchmark.p
% 0.15/0.38 % (12812)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.38 % (12813)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.38 % (12814)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.38 % (12815)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.38 % (12816)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.38 % (12817)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.38 % (12818)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.38 % (12816)Instruction limit reached!
% 0.15/0.38 % (12816)------------------------------
% 0.15/0.38 % (12816)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (12816)Termination reason: Unknown
% 0.15/0.38 % (12816)Termination phase: shuffling
% 0.15/0.38
% 0.15/0.38 % (12816)Memory used [KB]: 895
% 0.15/0.38 % (12816)Time elapsed: 0.003 s
% 0.15/0.38 % (12816)Instructions burned: 2 (million)
% 0.15/0.38 % (12816)------------------------------
% 0.15/0.38 % (12816)------------------------------
% 0.15/0.38 % (12815)Instruction limit reached!
% 0.15/0.38 % (12815)------------------------------
% 0.15/0.38 % (12815)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (12815)Termination reason: Unknown
% 0.15/0.38 % (12815)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (12815)Memory used [KB]: 5500
% 0.15/0.38 % (12815)Time elapsed: 0.004 s
% 0.15/0.38 % (12815)Instructions burned: 2 (million)
% 0.15/0.38 % (12815)------------------------------
% 0.15/0.38 % (12815)------------------------------
% 0.15/0.38 % (12813)Instruction limit reached!
% 0.15/0.38 % (12813)------------------------------
% 0.15/0.38 % (12813)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (12813)Termination reason: Unknown
% 0.15/0.38 % (12813)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (12813)Memory used [KB]: 5500
% 0.15/0.38 % (12813)Time elapsed: 0.006 s
% 0.15/0.38 % (12813)Instructions burned: 4 (million)
% 0.15/0.38 % (12813)------------------------------
% 0.15/0.38 % (12813)------------------------------
% 0.15/0.38 % (12812)First to succeed.
% 0.15/0.38 % (12817)Also succeeded, but the first one will report.
% 0.15/0.38 % (12812)Refutation found. Thanks to Tanya!
% 0.15/0.38 % SZS status Theorem for theBenchmark
% 0.15/0.38 % SZS output start Proof for theBenchmark
% 0.15/0.38 thf(func_def_0, type, cR: $i > $i > $o).
% 0.15/0.38 thf(f78,plain,(
% 0.15/0.38 $false),
% 0.15/0.38 inference(avatar_sat_refutation,[],[f52,f67,f77])).
% 0.15/0.38 thf(f77,plain,(
% 0.15/0.38 ~spl2_1),
% 0.15/0.38 inference(avatar_contradiction_clause,[],[f76])).
% 0.15/0.38 thf(f76,plain,(
% 0.15/0.38 $false | ~spl2_1),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f70])).
% 0.15/0.38 thf(f70,plain,(
% 0.15/0.38 ($false = $true) | ~spl2_1),
% 0.15/0.38 inference(superposition,[],[f14,f47])).
% 0.15/0.38 thf(f47,plain,(
% 0.15/0.38 ( ! [X1 : $i] : (($false = (cR @ X1 @ X1))) ) | ~spl2_1),
% 0.15/0.38 inference(avatar_component_clause,[],[f46])).
% 0.15/0.38 thf(f46,plain,(
% 0.15/0.38 spl2_1 <=> ! [X1] : ($false = (cR @ X1 @ X1))),
% 0.15/0.38 introduced(avatar_definition,[new_symbols(naming,[spl2_1])])).
% 0.15/0.38 thf(f14,plain,(
% 0.15/0.38 ((cR @ sK1 @ sK1) = $true)),
% 0.15/0.38 inference(cnf_transformation,[],[f11])).
% 0.15/0.38 thf(f11,plain,(
% 0.15/0.38 ((cR @ sK0 @ sK0) != $true) & ((cR @ sK1 @ sK1) = $true) & ! [X2,X3] : ((cR @ X2 @ X2) = (cR @ X2 @ X3)) & ! [X4,X5] : ((cR @ X4 @ X4) = (cR @ X5 @ X4))),
% 0.15/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f10,f9])).
% 0.15/0.38 thf(f9,plain,(
% 0.15/0.38 ? [X0] : ((cR @ X0 @ X0) != $true) => ((cR @ sK0 @ sK0) != $true)),
% 0.15/0.38 introduced(choice_axiom,[])).
% 0.15/0.38 thf(f10,plain,(
% 0.15/0.38 ? [X1] : ($true = (cR @ X1 @ X1)) => ((cR @ sK1 @ sK1) = $true)),
% 0.15/0.38 introduced(choice_axiom,[])).
% 0.15/0.38 thf(f8,plain,(
% 0.15/0.38 ? [X0] : ((cR @ X0 @ X0) != $true) & ? [X1] : ($true = (cR @ X1 @ X1)) & ! [X2,X3] : ((cR @ X2 @ X2) = (cR @ X2 @ X3)) & ! [X4,X5] : ((cR @ X4 @ X4) = (cR @ X5 @ X4))),
% 0.15/0.38 inference(rectify,[],[f7])).
% 0.15/0.38 thf(f7,plain,(
% 0.15/0.38 ? [X5] : ((cR @ X5 @ X5) != $true) & ? [X4] : ((cR @ X4 @ X4) = $true) & ! [X0,X1] : ((cR @ X0 @ X0) = (cR @ X0 @ X1)) & ! [X3,X2] : ((cR @ X3 @ X3) = (cR @ X2 @ X3))),
% 0.15/0.38 inference(flattening,[],[f6])).
% 0.15/0.38 thf(f6,plain,(
% 0.15/0.38 (? [X5] : ((cR @ X5 @ X5) != $true) & ? [X4] : ((cR @ X4 @ X4) = $true)) & (! [X0,X1] : ((cR @ X0 @ X0) = (cR @ X0 @ X1)) & ! [X3,X2] : ((cR @ X3 @ X3) = (cR @ X2 @ X3)))),
% 0.15/0.38 inference(ennf_transformation,[],[f5])).
% 0.15/0.38 thf(f5,plain,(
% 0.15/0.38 ~((! [X0,X1] : ((cR @ X0 @ X0) = (cR @ X0 @ X1)) & ! [X3,X2] : ((cR @ X3 @ X3) = (cR @ X2 @ X3))) => (? [X4] : ((cR @ X4 @ X4) = $true) => ! [X5] : ((cR @ X5 @ X5) = $true)))),
% 0.15/0.38 inference(fool_elimination,[],[f4])).
% 0.15/0.38 thf(f4,plain,(
% 0.15/0.38 ~((! [X0,X1] : ((cR @ X0 @ X0) <=> (cR @ X0 @ X1)) & ! [X2,X3] : ((cR @ X3 @ X3) <=> (cR @ X2 @ X3))) => (? [X4] : (cR @ X4 @ X4) => ! [X5] : (cR @ X5 @ X5)))),
% 0.15/0.38 inference(rectify,[],[f2])).
% 0.15/0.38 thf(f2,negated_conjecture,(
% 0.15/0.38 ~((! [X0,X1] : ((cR @ X0 @ X0) <=> (cR @ X0 @ X1)) & ! [X3,X2] : ((cR @ X2 @ X2) <=> (cR @ X3 @ X2))) => (? [X4] : (cR @ X4 @ X4) => ! [X5] : (cR @ X5 @ X5)))),
% 0.15/0.38 inference(negated_conjecture,[],[f1])).
% 0.15/0.38 thf(f1,conjecture,(
% 0.15/0.38 (! [X0,X1] : ((cR @ X0 @ X0) <=> (cR @ X0 @ X1)) & ! [X3,X2] : ((cR @ X2 @ X2) <=> (cR @ X3 @ X2))) => (? [X4] : (cR @ X4 @ X4) => ! [X5] : (cR @ X5 @ X5))),
% 0.15/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM81)).
% 0.15/0.38 thf(f67,plain,(
% 0.15/0.38 ~spl2_2),
% 0.15/0.38 inference(avatar_contradiction_clause,[],[f66])).
% 0.15/0.38 thf(f66,plain,(
% 0.15/0.38 $false | ~spl2_2),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f56])).
% 0.15/0.38 thf(f56,plain,(
% 0.15/0.38 ($false = $true) | ~spl2_2),
% 0.15/0.38 inference(superposition,[],[f31,f50])).
% 0.15/0.38 thf(f50,plain,(
% 0.15/0.38 ( ! [X0 : $i] : (((cR @ X0 @ X0) = $true)) ) | ~spl2_2),
% 0.15/0.38 inference(avatar_component_clause,[],[f49])).
% 0.15/0.38 thf(f49,plain,(
% 0.15/0.38 spl2_2 <=> ! [X0] : ((cR @ X0 @ X0) = $true)),
% 0.15/0.38 introduced(avatar_definition,[new_symbols(naming,[spl2_2])])).
% 0.15/0.38 thf(f31,plain,(
% 0.15/0.38 ($false = (cR @ sK0 @ sK0))),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f26])).
% 0.15/0.38 thf(f26,plain,(
% 0.15/0.38 ($true != $true) | ($false = (cR @ sK0 @ sK0))),
% 0.15/0.38 inference(superposition,[],[f15,f17])).
% 0.15/0.38 thf(f17,plain,(
% 0.15/0.38 ( ! [X4 : $i,X5 : $i] : (((cR @ X5 @ X4) = $true) | ((cR @ X4 @ X4) = $false)) )),
% 0.15/0.38 inference(binary_proxy_clausification,[],[f12])).
% 0.15/0.38 thf(f12,plain,(
% 0.15/0.38 ( ! [X4 : $i,X5 : $i] : (((cR @ X4 @ X4) = (cR @ X5 @ X4))) )),
% 0.15/0.38 inference(cnf_transformation,[],[f11])).
% 0.15/0.38 thf(f15,plain,(
% 0.15/0.38 ((cR @ sK0 @ sK0) != $true)),
% 0.15/0.38 inference(cnf_transformation,[],[f11])).
% 0.15/0.38 thf(f52,plain,(
% 0.15/0.38 spl2_1 | spl2_2),
% 0.15/0.38 inference(avatar_split_clause,[],[f42,f49,f46])).
% 0.15/0.38 thf(f42,plain,(
% 0.15/0.38 ( ! [X0 : $i,X1 : $i] : (((cR @ X0 @ X0) = $true) | ($false = (cR @ X1 @ X1))) )),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f37])).
% 0.15/0.38 thf(f37,plain,(
% 0.15/0.38 ( ! [X0 : $i,X1 : $i] : (((cR @ X0 @ X0) = $true) | ($false = $true) | ($false = (cR @ X1 @ X1))) )),
% 0.15/0.38 inference(superposition,[],[f18,f17])).
% 0.15/0.38 thf(f18,plain,(
% 0.15/0.38 ( ! [X2 : $i,X3 : $i] : (($false = (cR @ X2 @ X3)) | ((cR @ X2 @ X2) = $true)) )),
% 0.15/0.38 inference(binary_proxy_clausification,[],[f13])).
% 0.15/0.38 thf(f13,plain,(
% 0.15/0.38 ( ! [X2 : $i,X3 : $i] : (((cR @ X2 @ X2) = (cR @ X2 @ X3))) )),
% 0.15/0.38 inference(cnf_transformation,[],[f11])).
% 0.15/0.38 % SZS output end Proof for theBenchmark
% 0.15/0.38 % (12812)------------------------------
% 0.15/0.38 % (12812)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (12812)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (12812)Memory used [KB]: 5500
% 0.15/0.38 % (12812)Time elapsed: 0.007 s
% 0.15/0.38 % (12812)Instructions burned: 4 (million)
% 0.15/0.38 % (12812)------------------------------
% 0.15/0.38 % (12812)------------------------------
% 0.15/0.38 % (12808)Success in time 0.007 s
% 0.15/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------