TSTP Solution File: NUM802^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : NUM802^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n026.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 13:17:55 EDT 2024
% Result : Theorem 0.13s 0.39s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : NUM802^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % Command : run_vampire %s %d THM
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Jun 22 19:42:24 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.36 This is a TH0_THM_EQU_NAR problem
% 0.13/0.36 Running higher-order theorem proving
% 0.13/0.37 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.13/0.39 % (25472)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.13/0.39 % (25474)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.13/0.39 % (25473)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.13/0.39 % (25475)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.39 % (25476)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.13/0.39 % (25477)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.13/0.39 % (25478)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.39 % (25475)Instruction limit reached!
% 0.13/0.39 % (25475)------------------------------
% 0.13/0.39 % (25475)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39 % (25475)Termination reason: Unknown
% 0.13/0.39 % (25475)Termination phase: Saturation
% 0.13/0.39
% 0.13/0.39 % (25475)Memory used [KB]: 5500
% 0.13/0.39 % (25475)Time elapsed: 0.004 s
% 0.13/0.39 % (25475)Instructions burned: 2 (million)
% 0.13/0.39 % (25475)------------------------------
% 0.13/0.39 % (25475)------------------------------
% 0.13/0.39 % (25476)Instruction limit reached!
% 0.13/0.39 % (25476)------------------------------
% 0.13/0.39 % (25476)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39 % (25476)Termination reason: Unknown
% 0.13/0.39 % (25476)Termination phase: Saturation
% 0.13/0.39
% 0.13/0.39 % (25476)Memory used [KB]: 5500
% 0.13/0.39 % (25476)Time elapsed: 0.004 s
% 0.13/0.39 % (25476)Instructions burned: 2 (million)
% 0.13/0.39 % (25476)------------------------------
% 0.13/0.39 % (25476)------------------------------
% 0.13/0.39 % (25474)Refutation not found, incomplete strategy
% 0.13/0.39 % (25474)------------------------------
% 0.13/0.39 % (25474)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39 % (25474)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 % (25474)Memory used [KB]: 5500
% 0.13/0.39 % (25474)Time elapsed: 0.004 s
% 0.13/0.39 % (25474)Instructions burned: 1 (million)
% 0.13/0.39 % (25474)------------------------------
% 0.13/0.39 % (25474)------------------------------
% 0.13/0.39 % (25472)First to succeed.
% 0.13/0.39 % (25473)Instruction limit reached!
% 0.13/0.39 % (25473)------------------------------
% 0.13/0.39 % (25473)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39 % (25473)Termination reason: Unknown
% 0.13/0.39 % (25473)Termination phase: Saturation
% 0.13/0.39
% 0.13/0.39 % (25473)Memory used [KB]: 5500
% 0.13/0.39 % (25473)Time elapsed: 0.006 s
% 0.13/0.39 % (25473)Instructions burned: 4 (million)
% 0.13/0.39 % (25473)------------------------------
% 0.13/0.39 % (25473)------------------------------
% 0.13/0.39 % (25478)Also succeeded, but the first one will report.
% 0.13/0.39 % (25472)Refutation found. Thanks to Tanya!
% 0.13/0.39 % SZS status Theorem for theBenchmark
% 0.13/0.39 % SZS output start Proof for theBenchmark
% 0.13/0.39 thf(func_def_1, type, absval: $i > $i).
% 0.13/0.39 thf(func_def_3, type, c_less_: $i > $i > $o).
% 0.13/0.39 thf(func_def_7, type, sK0: ($i > $o) > $i).
% 0.13/0.39 thf(func_def_10, type, ph2: !>[X0: $tType]:(X0)).
% 0.13/0.39 thf(f28,plain,(
% 0.13/0.39 $false),
% 0.13/0.39 inference(subsumption_resolution,[],[f25,f13])).
% 0.13/0.39 thf(f13,plain,(
% 0.13/0.39 ((c_less_ @ c_2 @ c0) = $true)),
% 0.13/0.39 inference(cnf_transformation,[],[f11])).
% 0.13/0.39 thf(f11,plain,(
% 0.13/0.39 ! [X0 : $i > $o] : (((X0 @ (absval @ (sK0 @ X0))) = $true) | ($true != (X0 @ c_2))) & ((c_less_ @ c_2 @ c0) = $true) & ! [X2,X3] : (((c_less_ @ X2 @ c0) != $true) | ((absval @ X3) != X2))),
% 0.13/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10])).
% 0.13/0.39 thf(f10,plain,(
% 0.13/0.39 ! [X0 : $i > $o] : (? [X1] : ($true = (X0 @ (absval @ X1))) => ((X0 @ (absval @ (sK0 @ X0))) = $true))),
% 0.13/0.39 introduced(choice_axiom,[])).
% 0.13/0.39 thf(f9,plain,(
% 0.13/0.39 ! [X0 : $i > $o] : (? [X1] : ($true = (X0 @ (absval @ X1))) | ($true != (X0 @ c_2))) & ((c_less_ @ c_2 @ c0) = $true) & ! [X2,X3] : (((c_less_ @ X2 @ c0) != $true) | ((absval @ X3) != X2))),
% 0.13/0.39 inference(rectify,[],[f8])).
% 0.13/0.39 thf(f8,plain,(
% 0.13/0.39 ! [X2 : $i > $o] : (? [X3] : ((X2 @ (absval @ X3)) = $true) | ((X2 @ c_2) != $true)) & ((c_less_ @ c_2 @ c0) = $true) & ! [X1,X0] : (((c_less_ @ X1 @ c0) != $true) | ((absval @ X0) != X1))),
% 0.13/0.39 inference(flattening,[],[f7])).
% 0.13/0.39 thf(f7,plain,(
% 0.13/0.39 (! [X2 : $i > $o] : (? [X3] : ((X2 @ (absval @ X3)) = $true) | ((X2 @ c_2) != $true)) & ! [X1,X0] : (((c_less_ @ X1 @ c0) != $true) | ((absval @ X0) != X1))) & ((c_less_ @ c_2 @ c0) = $true)),
% 0.13/0.39 inference(ennf_transformation,[],[f6])).
% 0.13/0.39 thf(f6,plain,(
% 0.13/0.39 ~(((c_less_ @ c_2 @ c0) = $true) => (! [X1,X0] : (((c_less_ @ X1 @ c0) = $true) => ((absval @ X0) != X1)) => ? [X2 : $i > $o] : (((X2 @ c_2) = $true) & ! [X3] : ((X2 @ (absval @ X3)) != $true))))),
% 0.13/0.39 inference(flattening,[],[f5])).
% 0.13/0.39 thf(f5,plain,(
% 0.13/0.39 ~(((c_less_ @ c_2 @ c0) = $true) => (! [X1,X0] : (((c_less_ @ X1 @ c0) = $true) => ((absval @ X0) != X1)) => ? [X2 : $i > $o] : (((X2 @ c_2) = $true) & ! [X3] : ~((X2 @ (absval @ X3)) = $true))))),
% 0.13/0.39 inference(fool_elimination,[],[f4])).
% 0.13/0.39 thf(f4,plain,(
% 0.13/0.39 ~((c_less_ @ c_2 @ c0) => (! [X0,X1] : ((c_less_ @ X1 @ c0) => ((absval @ X0) != X1)) => ? [X2 : $i > $o] : ((X2 @ c_2) & ! [X3] : ~(X2 @ (absval @ X3)))))),
% 0.13/0.39 inference(rectify,[],[f2])).
% 0.13/0.39 thf(f2,negated_conjecture,(
% 0.13/0.39 ~((c_less_ @ c_2 @ c0) => (! [X1,X0] : ((c_less_ @ X0 @ c0) => ((absval @ X1) != X0)) => ? [X2 : $i > $o] : ((X2 @ c_2) & ! [X3] : ~(X2 @ (absval @ X3)))))),
% 0.13/0.39 inference(negated_conjecture,[],[f1])).
% 0.13/0.39 thf(f1,conjecture,(
% 0.13/0.39 (c_less_ @ c_2 @ c0) => (! [X1,X0] : ((c_less_ @ X0 @ c0) => ((absval @ X1) != X0)) => ? [X2 : $i > $o] : ((X2 @ c_2) & ! [X3] : ~(X2 @ (absval @ X3))))),
% 0.13/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBLEDSOE_FENG_8)).
% 0.13/0.39 thf(f25,plain,(
% 0.13/0.39 ((c_less_ @ c_2 @ c0) != $true)),
% 0.13/0.39 inference(beta_eta_normalization,[],[f24])).
% 0.13/0.39 thf(f24,plain,(
% 0.13/0.39 ($true != ((^[Y0 : $i]: (c_less_ @ ((^[Y1 : $i]: (Y1)) @ Y0) @ ((^[Y1 : $i]: (c0)) @ Y0))) @ c_2))),
% 0.13/0.39 inference(trivial_inequality_removal,[],[f20])).
% 0.13/0.39 thf(f20,plain,(
% 0.13/0.39 ($true != $true) | ($true != ((^[Y0 : $i]: (c_less_ @ ((^[Y1 : $i]: (Y1)) @ Y0) @ ((^[Y1 : $i]: (c0)) @ Y0))) @ c_2))),
% 0.13/0.39 inference(superposition,[],[f15,f14])).
% 0.13/0.39 thf(f14,plain,(
% 0.13/0.39 ( ! [X0 : $i > $o] : (((X0 @ (absval @ (sK0 @ X0))) = $true) | ($true != (X0 @ c_2))) )),
% 0.13/0.39 inference(cnf_transformation,[],[f11])).
% 0.13/0.39 thf(f15,plain,(
% 0.13/0.39 ( ! [X3 : $i] : (((c_less_ @ (absval @ X3) @ c0) != $true)) )),
% 0.13/0.39 inference(equality_resolution,[],[f12])).
% 0.13/0.39 thf(f12,plain,(
% 0.13/0.39 ( ! [X2 : $i,X3 : $i] : (((c_less_ @ X2 @ c0) != $true) | ((absval @ X3) != X2)) )),
% 0.13/0.39 inference(cnf_transformation,[],[f11])).
% 0.13/0.39 % SZS output end Proof for theBenchmark
% 0.13/0.39 % (25472)------------------------------
% 0.13/0.39 % (25472)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39 % (25472)Termination reason: Refutation
% 0.13/0.39
% 0.13/0.39 % (25472)Memory used [KB]: 5500
% 0.13/0.39 % (25472)Time elapsed: 0.006 s
% 0.13/0.39 % (25472)Instructions burned: 2 (million)
% 0.13/0.39 % (25472)------------------------------
% 0.13/0.39 % (25472)------------------------------
% 0.13/0.39 % (25471)Success in time 0.019 s
%------------------------------------------------------------------------------