TSTP Solution File: SEV091^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV091^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n020.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 : Mon Jun 24 16:01:46 EDT 2024
% Result : Theorem 0.21s 0.39s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV091^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.12 % Command : run_vampire %s %d THM
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jun 21 18:16:24 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.12/0.36 Running higher-order theorem proving
% 0.12/0.36 Running /export/starexec/sandbox2/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox2/benchmark/theBenchmark.p -m 16384 -t 300
% 0.21/0.38 % (15921)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.21/0.38 % (15920)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.21/0.38 % (15923)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.38 % (15924)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.21/0.38 % (15925)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.21/0.38 % (15922)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.21/0.38 % (15923)Instruction limit reached!
% 0.21/0.38 % (15923)------------------------------
% 0.21/0.38 % (15923)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.38 % (15923)Termination reason: Unknown
% 0.21/0.38 % (15923)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (15923)Memory used [KB]: 5500
% 0.21/0.38 % (15923)Time elapsed: 0.004 s
% 0.21/0.38 % (15923)Instructions burned: 2 (million)
% 0.21/0.38 % (15923)------------------------------
% 0.21/0.38 % (15923)------------------------------
% 0.21/0.38 % (15924)Instruction limit reached!
% 0.21/0.38 % (15924)------------------------------
% 0.21/0.38 % (15924)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.38 % (15924)Termination reason: Unknown
% 0.21/0.38 % (15924)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (15924)Memory used [KB]: 1023
% 0.21/0.38 % (15924)Time elapsed: 0.004 s
% 0.21/0.38 % (15924)Instructions burned: 2 (million)
% 0.21/0.38 % (15924)------------------------------
% 0.21/0.38 % (15924)------------------------------
% 0.21/0.38 % (15926)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.38 % (15921)Instruction limit reached!
% 0.21/0.38 % (15921)------------------------------
% 0.21/0.38 % (15921)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.38 % (15921)Termination reason: Unknown
% 0.21/0.38 % (15921)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (15921)Memory used [KB]: 5500
% 0.21/0.38 % (15921)Time elapsed: 0.006 s
% 0.21/0.38 % (15921)Instructions burned: 5 (million)
% 0.21/0.38 % (15921)------------------------------
% 0.21/0.38 % (15921)------------------------------
% 0.21/0.39 % (15926)First to succeed.
% 0.21/0.39 % (15926)Refutation found. Thanks to Tanya!
% 0.21/0.39 % SZS status Theorem for theBenchmark
% 0.21/0.39 % SZS output start Proof for theBenchmark
% 0.21/0.39 thf(func_def_0, type, cQ: $i > $i > $o).
% 0.21/0.39 thf(func_def_1, type, cP: $i > $i > $o).
% 0.21/0.39 thf(f77,plain,(
% 0.21/0.39 $false),
% 0.21/0.39 inference(trivial_inequality_removal,[],[f74])).
% 0.21/0.39 thf(f74,plain,(
% 0.21/0.39 ($true != $true)),
% 0.21/0.39 inference(superposition,[],[f14,f65])).
% 0.21/0.39 thf(f65,plain,(
% 0.21/0.39 ( ! [X0 : $i,X1 : $i] : (((cQ @ X0 @ X1) = $true)) )),
% 0.21/0.39 inference(subsumption_resolution,[],[f63,f64])).
% 0.21/0.39 thf(f64,plain,(
% 0.21/0.39 ( ! [X0 : $i] : (($true = (cQ @ sK1 @ X0))) )),
% 0.21/0.39 inference(trivial_inequality_removal,[],[f58])).
% 0.21/0.39 thf(f58,plain,(
% 0.21/0.39 ( ! [X0 : $i] : (($true != $true) | ($true = (cQ @ sK1 @ X0))) )),
% 0.21/0.39 inference(superposition,[],[f16,f56])).
% 0.21/0.39 thf(f56,plain,(
% 0.21/0.39 ( ! [X0 : $i] : (($true = (cQ @ X0 @ sK1))) )),
% 0.21/0.39 inference(subsumption_resolution,[],[f55,f16])).
% 0.21/0.39 thf(f55,plain,(
% 0.21/0.39 ( ! [X0 : $i] : (($true = (cQ @ sK1 @ X0)) | ($true = (cQ @ X0 @ sK1))) )),
% 0.21/0.39 inference(trivial_inequality_removal,[],[f50])).
% 0.21/0.39 thf(f50,plain,(
% 0.21/0.39 ( ! [X0 : $i] : (($true = (cQ @ sK1 @ X0)) | ($true = (cQ @ X0 @ sK1)) | ($true != $true)) )),
% 0.21/0.39 inference(superposition,[],[f29,f48])).
% 0.21/0.39 thf(f48,plain,(
% 0.21/0.39 ( ! [X0 : $i] : (($true = (cQ @ sK0 @ X0)) | ($true = (cQ @ X0 @ sK1))) )),
% 0.21/0.39 inference(trivial_inequality_removal,[],[f44])).
% 0.21/0.39 thf(f44,plain,(
% 0.21/0.39 ( ! [X0 : $i] : (($true = (cQ @ sK0 @ X0)) | ($true != $true) | ($true = (cQ @ X0 @ sK1))) )),
% 0.21/0.39 inference(superposition,[],[f17,f43])).
% 0.21/0.39 thf(f43,plain,(
% 0.21/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((cP @ X0 @ X2) = $true) | ((cQ @ X0 @ X1) = $true) | ((cQ @ X1 @ X2) = $true)) )),
% 0.21/0.39 inference(trivial_inequality_removal,[],[f42])).
% 0.21/0.39 thf(f42,plain,(
% 0.21/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((cP @ X0 @ X2) = $true) | ($true != $true) | ((cQ @ X1 @ X2) = $true) | ((cQ @ X0 @ X1) = $true)) )),
% 0.21/0.39 inference(superposition,[],[f25,f13])).
% 0.21/0.39 thf(f13,plain,(
% 0.21/0.39 ( ! [X10 : $i,X9 : $i] : (($true = (cP @ X10 @ X9)) | ((cQ @ X10 @ X9) = $true)) )),
% 0.21/0.39 inference(cnf_transformation,[],[f11])).
% 0.21/0.39 thf(f11,plain,(
% 0.21/0.39 ($true != (cP @ sK0 @ sK1)) & ! [X2,X3] : (((cQ @ X3 @ X2) != $true) | ((cQ @ X2 @ X3) = $true)) & ! [X4,X5,X6] : (((cQ @ X5 @ X4) = $true) | ((cQ @ X6 @ X4) != $true) | ($true != (cQ @ X5 @ X6))) & ((cQ @ sK2 @ sK3) != $true) & ! [X9,X10] : (($true = (cP @ X10 @ X9)) | ((cQ @ X10 @ X9) = $true)) & ! [X11,X12,X13] : (($true = (cP @ X11 @ X12)) | ($true != (cP @ X13 @ X12)) | ((cP @ X11 @ X13) != $true))),
% 0.21/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f10,f9])).
% 0.21/0.39 thf(f9,plain,(
% 0.21/0.39 ? [X0,X1] : ((cP @ X0 @ X1) != $true) => ($true != (cP @ sK0 @ sK1))),
% 0.21/0.39 introduced(choice_axiom,[])).
% 0.21/0.39 thf(f10,plain,(
% 0.21/0.39 ? [X7,X8] : ($true != (cQ @ X7 @ X8)) => ((cQ @ sK2 @ sK3) != $true)),
% 0.21/0.39 introduced(choice_axiom,[])).
% 0.21/0.39 thf(f8,plain,(
% 0.21/0.39 ? [X0,X1] : ((cP @ X0 @ X1) != $true) & ! [X2,X3] : (((cQ @ X3 @ X2) != $true) | ((cQ @ X2 @ X3) = $true)) & ! [X4,X5,X6] : (((cQ @ X5 @ X4) = $true) | ((cQ @ X6 @ X4) != $true) | ($true != (cQ @ X5 @ X6))) & ? [X7,X8] : ($true != (cQ @ X7 @ X8)) & ! [X9,X10] : (($true = (cP @ X10 @ X9)) | ((cQ @ X10 @ X9) = $true)) & ! [X11,X12,X13] : (($true = (cP @ X11 @ X12)) | ($true != (cP @ X13 @ X12)) | ((cP @ X11 @ X13) != $true))),
% 0.21/0.39 inference(rectify,[],[f7])).
% 0.21/0.39 thf(f7,plain,(
% 0.21/0.39 ? [X13,X12] : ($true != (cP @ X13 @ X12)) & ! [X6,X5] : (($true != (cQ @ X5 @ X6)) | ((cQ @ X6 @ X5) = $true)) & ! [X7,X8,X9] : (((cQ @ X8 @ X7) = $true) | ((cQ @ X9 @ X7) != $true) | ((cQ @ X8 @ X9) != $true)) & ? [X10,X11] : ($true != (cQ @ X10 @ X11)) & ! [X4,X3] : (((cP @ X3 @ X4) = $true) | ($true = (cQ @ X3 @ X4))) & ! [X0,X1,X2] : (((cP @ X0 @ X1) = $true) | ($true != (cP @ X2 @ X1)) | ((cP @ X0 @ X2) != $true))),
% 0.21/0.39 inference(flattening,[],[f6])).
% 0.21/0.39 thf(f6,plain,(
% 0.21/0.39 (? [X13,X12] : ($true != (cP @ X13 @ X12)) & ? [X10,X11] : ($true != (cQ @ X10 @ X11))) & (! [X4,X3] : (((cP @ X3 @ X4) = $true) | ($true = (cQ @ X3 @ X4))) & ! [X6,X5] : (($true != (cQ @ X5 @ X6)) | ((cQ @ X6 @ X5) = $true)) & ! [X8,X7,X9] : (((cQ @ X8 @ X7) = $true) | (((cQ @ X9 @ X7) != $true) | ((cQ @ X8 @ X9) != $true))) & ! [X1,X2,X0] : (((cP @ X0 @ X1) = $true) | (($true != (cP @ X2 @ X1)) | ((cP @ X0 @ X2) != $true))))),
% 0.21/0.39 inference(ennf_transformation,[],[f5])).
% 0.21/0.39 thf(f5,plain,(
% 0.21/0.39 ~((! [X4,X3] : (((cP @ X3 @ X4) = $true) | ($true = (cQ @ X3 @ X4))) & ! [X5,X6] : (($true = (cQ @ X5 @ X6)) => ((cQ @ X6 @ X5) = $true)) & ! [X8,X7,X9] : ((((cQ @ X9 @ X7) = $true) & ((cQ @ X8 @ X9) = $true)) => ((cQ @ X8 @ X7) = $true)) & ! [X1,X2,X0] : ((($true = (cP @ X2 @ X1)) & ((cP @ X0 @ X2) = $true)) => ((cP @ X0 @ X1) = $true))) => (! [X13,X12] : ($true = (cP @ X13 @ X12)) | ! [X11,X10] : ($true = (cQ @ X10 @ X11))))),
% 0.21/0.39 inference(fool_elimination,[],[f4])).
% 0.21/0.39 thf(f4,plain,(
% 0.21/0.39 ~((! [X0,X1,X2] : (((cP @ X0 @ X2) & (cP @ X2 @ X1)) => (cP @ X0 @ X1)) & ! [X3,X4] : ((cQ @ X3 @ X4) | (cP @ X3 @ X4)) & ! [X5,X6] : ((cQ @ X5 @ X6) => (cQ @ X6 @ X5)) & ! [X7,X8,X9] : (((cQ @ X9 @ X7) & (cQ @ X8 @ X9)) => (cQ @ X8 @ X7))) => (! [X10,X11] : (cQ @ X10 @ X11) | ! [X12,X13] : (cP @ X13 @ X12)))),
% 0.21/0.39 inference(rectify,[],[f2])).
% 0.21/0.39 thf(f2,negated_conjecture,(
% 0.21/0.39 ~((! [X0,X2,X1] : (((cP @ X0 @ X1) & (cP @ X1 @ X2)) => (cP @ X0 @ X2)) & ! [X0,X1] : ((cQ @ X0 @ X1) | (cP @ X0 @ X1)) & ! [X0,X1] : ((cQ @ X0 @ X1) => (cQ @ X1 @ X0)) & ! [X2,X0,X1] : (((cQ @ X1 @ X2) & (cQ @ X0 @ X1)) => (cQ @ X0 @ X2))) => (! [X0,X1] : (cQ @ X0 @ X1) | ! [X1,X0] : (cP @ X0 @ X1)))),
% 0.21/0.39 inference(negated_conjecture,[],[f1])).
% 0.21/0.39 thf(f1,conjecture,(
% 0.21/0.39 (! [X0,X2,X1] : (((cP @ X0 @ X1) & (cP @ X1 @ X2)) => (cP @ X0 @ X2)) & ! [X0,X1] : ((cQ @ X0 @ X1) | (cP @ X0 @ X1)) & ! [X0,X1] : ((cQ @ X0 @ X1) => (cQ @ X1 @ X0)) & ! [X2,X0,X1] : (((cQ @ X1 @ X2) & (cQ @ X0 @ X1)) => (cQ @ X0 @ X2))) => (! [X0,X1] : (cQ @ X0 @ X1) | ! [X1,X0] : (cP @ X0 @ X1))),
% 0.21/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cCADE13_pme)).
% 0.21/0.39 thf(f25,plain,(
% 0.21/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((cP @ X2 @ X0) != $true) | ((cQ @ X0 @ X1) = $true) | ($true = (cP @ X2 @ X1))) )),
% 0.21/0.39 inference(trivial_inequality_removal,[],[f24])).
% 0.21/0.39 thf(f24,plain,(
% 0.21/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != $true) | ($true = (cP @ X2 @ X1)) | ((cQ @ X0 @ X1) = $true) | ((cP @ X2 @ X0) != $true)) )),
% 0.21/0.39 inference(superposition,[],[f12,f13])).
% 0.21/0.39 thf(f12,plain,(
% 0.21/0.39 ( ! [X11 : $i,X12 : $i,X13 : $i] : (($true != (cP @ X13 @ X12)) | ($true = (cP @ X11 @ X12)) | ((cP @ X11 @ X13) != $true)) )),
% 0.21/0.39 inference(cnf_transformation,[],[f11])).
% 0.21/0.39 thf(f17,plain,(
% 0.21/0.39 ($true != (cP @ sK0 @ sK1))),
% 0.21/0.39 inference(cnf_transformation,[],[f11])).
% 0.21/0.39 thf(f29,plain,(
% 0.21/0.39 ( ! [X0 : $i] : (($true != (cQ @ sK0 @ X0)) | ($true = (cQ @ sK1 @ X0))) )),
% 0.21/0.39 inference(trivial_inequality_removal,[],[f27])).
% 0.21/0.39 thf(f27,plain,(
% 0.21/0.39 ( ! [X0 : $i] : (($true != (cQ @ sK0 @ X0)) | ($true != $true) | ($true = (cQ @ sK1 @ X0))) )),
% 0.21/0.39 inference(superposition,[],[f15,f21])).
% 0.21/0.39 thf(f21,plain,(
% 0.21/0.39 ((cQ @ sK1 @ sK0) = $true)),
% 0.21/0.39 inference(trivial_inequality_removal,[],[f20])).
% 0.21/0.39 thf(f20,plain,(
% 0.21/0.39 ($true != $true) | ((cQ @ sK1 @ sK0) = $true)),
% 0.21/0.39 inference(superposition,[],[f16,f19])).
% 0.21/0.39 thf(f19,plain,(
% 0.21/0.39 ($true = (cQ @ sK0 @ sK1))),
% 0.21/0.39 inference(trivial_inequality_removal,[],[f18])).
% 0.21/0.39 thf(f18,plain,(
% 0.21/0.39 ($true = (cQ @ sK0 @ sK1)) | ($true != $true)),
% 0.21/0.39 inference(superposition,[],[f17,f13])).
% 0.21/0.39 thf(f15,plain,(
% 0.21/0.39 ( ! [X6 : $i,X4 : $i,X5 : $i] : (($true != (cQ @ X5 @ X6)) | ((cQ @ X5 @ X4) = $true) | ((cQ @ X6 @ X4) != $true)) )),
% 0.21/0.39 inference(cnf_transformation,[],[f11])).
% 0.21/0.39 thf(f16,plain,(
% 0.21/0.39 ( ! [X2 : $i,X3 : $i] : (((cQ @ X3 @ X2) != $true) | ((cQ @ X2 @ X3) = $true)) )),
% 0.21/0.39 inference(cnf_transformation,[],[f11])).
% 0.21/0.39 thf(f63,plain,(
% 0.21/0.39 ( ! [X0 : $i,X1 : $i] : (((cQ @ X0 @ X1) = $true) | ($true != (cQ @ sK1 @ X1))) )),
% 0.21/0.39 inference(trivial_inequality_removal,[],[f57])).
% 0.21/0.39 thf(f57,plain,(
% 0.21/0.39 ( ! [X0 : $i,X1 : $i] : (((cQ @ X0 @ X1) = $true) | ($true != $true) | ($true != (cQ @ sK1 @ X1))) )),
% 0.21/0.39 inference(superposition,[],[f15,f56])).
% 0.21/0.39 thf(f14,plain,(
% 0.21/0.39 ((cQ @ sK2 @ sK3) != $true)),
% 0.21/0.39 inference(cnf_transformation,[],[f11])).
% 0.21/0.39 % SZS output end Proof for theBenchmark
% 0.21/0.39 % (15926)------------------------------
% 0.21/0.39 % (15926)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.39 % (15926)Termination reason: Refutation
% 0.21/0.39
% 0.21/0.39 % (15926)Memory used [KB]: 5500
% 0.21/0.39 % (15926)Time elapsed: 0.011 s
% 0.21/0.39 % (15926)Instructions burned: 10 (million)
% 0.21/0.39 % (15926)------------------------------
% 0.21/0.39 % (15926)------------------------------
% 0.21/0.39 % (15918)Success in time 0.028 s
%------------------------------------------------------------------------------