TSTP Solution File: SYO221^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SYO221^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n019.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 21:01:21 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.07/0.13 % Problem : SYO221^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_vampire %s %d THM
% 0.13/0.34 % Computer : n019.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 : Sun Jun 23 09:23:39 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.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.13/0.38 % (9719)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.38 % (9721)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.38 % (9723)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.38 % (9720)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.38 % (9724)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.38 % (9725)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.38 % (9723)Instruction limit reached!
% 0.13/0.38 % (9723)------------------------------
% 0.13/0.38 % (9723)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.38 % (9723)Termination reason: Unknown
% 0.13/0.38 % (9723)Termination phase: Saturation
% 0.13/0.38
% 0.13/0.38 % (9723)Memory used [KB]: 5500
% 0.13/0.38 % (9723)Time elapsed: 0.004 s
% 0.13/0.38 % (9723)Instructions burned: 2 (million)
% 0.13/0.38 % (9723)------------------------------
% 0.13/0.38 % (9723)------------------------------
% 0.13/0.38 % (9722)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.39 % (9721)Refutation not found, incomplete strategy
% 0.13/0.39 % (9721)------------------------------
% 0.13/0.39 % (9721)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39 % (9721)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 % (9721)Memory used [KB]: 5500
% 0.13/0.39 % (9721)Time elapsed: 0.004 s
% 0.13/0.39 % (9721)Instructions burned: 2 (million)
% 0.13/0.39 % (9721)------------------------------
% 0.13/0.39 % (9721)------------------------------
% 0.13/0.39 % (9724)First to succeed.
% 0.13/0.39 % (9720)Instruction limit reached!
% 0.13/0.39 % (9720)------------------------------
% 0.13/0.39 % (9720)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39 % (9720)Termination reason: Unknown
% 0.13/0.39 % (9720)Termination phase: Saturation
% 0.13/0.39
% 0.13/0.39 % (9720)Memory used [KB]: 5500
% 0.13/0.39 % (9720)Time elapsed: 0.006 s
% 0.13/0.39 % (9720)Instructions burned: 4 (million)
% 0.13/0.39 % (9720)------------------------------
% 0.13/0.39 % (9720)------------------------------
% 0.13/0.39 % (9722)Instruction limit reached!
% 0.13/0.39 % (9722)------------------------------
% 0.13/0.39 % (9722)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39 % (9722)Termination reason: Unknown
% 0.13/0.39 % (9722)Termination phase: Saturation
% 0.13/0.39
% 0.13/0.39 % (9722)Memory used [KB]: 5500
% 0.13/0.39 % (9722)Time elapsed: 0.005 s
% 0.13/0.39 % (9722)Instructions burned: 2 (million)
% 0.13/0.39 % (9722)------------------------------
% 0.13/0.39 % (9722)------------------------------
% 0.13/0.39 % (9724)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, cP: $i > $o).
% 0.13/0.39 thf(func_def_6, type, sK0: ($i > $o) > $i).
% 0.13/0.39 thf(func_def_9, type, ph2: !>[X0: $tType]:(X0)).
% 0.13/0.39 thf(f63,plain,(
% 0.13/0.39 $false),
% 0.13/0.39 inference(equality_resolution,[],[f60])).
% 0.13/0.39 thf(f60,plain,(
% 0.13/0.39 ( ! [X0 : $i] : ((a != X0)) )),
% 0.13/0.39 inference(subsumption_resolution,[],[f58,f14])).
% 0.13/0.39 thf(f14,plain,(
% 0.13/0.39 (a != b)),
% 0.13/0.39 inference(cnf_transformation,[],[f10])).
% 0.13/0.39 thf(f10,plain,(
% 0.13/0.39 ! [X0 : $i > $o] : ((a != b) & (! [X1] : ((X0 @ X1) != $true) | (($true != (cP @ (sK0 @ X0))) & ($true = (X0 @ (sK0 @ X0)))) | ((X0 @ b) = $true)) & ((cP @ a) = $true))),
% 0.13/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9])).
% 0.13/0.39 thf(f9,plain,(
% 0.13/0.39 ! [X0 : $i > $o] : (? [X2] : (($true != (cP @ X2)) & ((X0 @ X2) = $true)) => (($true != (cP @ (sK0 @ X0))) & ($true = (X0 @ (sK0 @ X0)))))),
% 0.13/0.39 introduced(choice_axiom,[])).
% 0.13/0.39 thf(f8,plain,(
% 0.13/0.39 ! [X0 : $i > $o] : ((a != b) & (! [X1] : ((X0 @ X1) != $true) | ? [X2] : (($true != (cP @ X2)) & ((X0 @ X2) = $true)) | ((X0 @ b) = $true)) & ((cP @ a) = $true))),
% 0.13/0.39 inference(flattening,[],[f7])).
% 0.13/0.39 thf(f7,plain,(
% 0.13/0.39 ! [X0 : $i > $o] : ((! [X1] : ((X0 @ X1) != $true) | ? [X2] : (($true != (cP @ X2)) & ((X0 @ X2) = $true)) | ((X0 @ b) = $true)) & ((a != b) & ((cP @ a) = $true)))),
% 0.13/0.39 inference(ennf_transformation,[],[f6])).
% 0.13/0.39 thf(f6,plain,(
% 0.13/0.39 ~? [X0 : $i > $o] : (((a != b) & ((cP @ a) = $true)) => (((X0 @ b) != $true) & ! [X2] : (((X0 @ X2) = $true) => ($true = (cP @ X2))) & ? [X1] : ((X0 @ X1) = $true)))),
% 0.13/0.39 inference(flattening,[],[f5])).
% 0.13/0.39 thf(f5,plain,(
% 0.13/0.39 ~? [X0 : $i > $o] : (((a != b) & ((cP @ a) = $true)) => (? [X1] : ((X0 @ X1) = $true) & ~((X0 @ b) = $true) & ! [X2] : (((X0 @ X2) = $true) => ($true = (cP @ X2)))))),
% 0.13/0.39 inference(fool_elimination,[],[f4])).
% 0.13/0.39 thf(f4,plain,(
% 0.13/0.39 ~? [X0 : $i > $o] : (((a != b) & (cP @ a)) => (? [X1] : (X0 @ X1) & ~(X0 @ b) & ! [X2] : ((X0 @ X2) => (cP @ X2))))),
% 0.13/0.39 inference(rectify,[],[f2])).
% 0.13/0.39 thf(f2,negated_conjecture,(
% 0.13/0.39 ~? [X0 : $i > $o] : (((a != b) & (cP @ a)) => (? [X2] : (X0 @ X2) & ~(X0 @ b) & ! [X1] : ((X0 @ X1) => (cP @ X1))))),
% 0.13/0.39 inference(negated_conjecture,[],[f1])).
% 0.13/0.39 thf(f1,conjecture,(
% 0.13/0.39 ? [X0 : $i > $o] : (((a != b) & (cP @ a)) => (? [X2] : (X0 @ X2) & ~(X0 @ b) & ! [X1] : ((X0 @ X1) => (cP @ X1))))),
% 0.13/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBLEDSOE6)).
% 0.13/0.39 thf(f58,plain,(
% 0.13/0.39 ( ! [X0 : $i] : ((a != X0) | (a = b)) )),
% 0.13/0.39 inference(trivial_inequality_removal,[],[f55])).
% 0.13/0.39 thf(f55,plain,(
% 0.13/0.39 ( ! [X0 : $i] : ((a != X0) | ($true != $true) | (a = b)) )),
% 0.13/0.39 inference(superposition,[],[f53,f11])).
% 0.13/0.39 thf(f11,plain,(
% 0.13/0.39 ((cP @ a) = $true)),
% 0.13/0.39 inference(cnf_transformation,[],[f10])).
% 0.13/0.39 thf(f53,plain,(
% 0.13/0.39 ( ! [X0 : $i,X1 : $i] : (($true != (cP @ X0)) | (b = X0) | (X0 != X1)) )),
% 0.13/0.39 inference(equality_proxy_clausification,[],[f52])).
% 0.13/0.39 thf(f52,plain,(
% 0.13/0.39 ( ! [X0 : $i,X1 : $i] : (($true != (X0 = X1)) | (b = X0) | ($true != (cP @ X0))) )),
% 0.13/0.39 inference(duplicate_literal_removal,[],[f51])).
% 0.13/0.39 thf(f51,plain,(
% 0.13/0.39 ( ! [X0 : $i,X1 : $i] : ((b = X0) | ($true != (X0 = X1)) | ($true != (cP @ X0)) | (b = X0)) )),
% 0.13/0.39 inference(equality_proxy_clausification,[],[f49])).
% 0.13/0.39 thf(f49,plain,(
% 0.13/0.39 ( ! [X0 : $i,X1 : $i] : ((b = X0) | ($true = (X0 = b)) | ($true != (X0 = X1)) | ($true != (cP @ X0))) )),
% 0.13/0.39 inference(superposition,[],[f13,f21])).
% 0.13/0.39 thf(f21,plain,(
% 0.13/0.39 ( ! [X0 : $i] : (((sK0 @ (= @ X0)) = X0) | (b = X0)) )),
% 0.13/0.39 inference(equality_proxy_clausification,[],[f15])).
% 0.13/0.39 thf(f15,plain,(
% 0.13/0.39 ( ! [X0 : $i] : (($true = (X0 = b)) | ((sK0 @ (= @ X0)) = X0)) )),
% 0.13/0.39 inference(leibniz_equality_elimination,[],[f12])).
% 0.13/0.39 thf(f12,plain,(
% 0.13/0.39 ( ! [X0 : $i > $o,X1 : $i] : (($true = (X0 @ (sK0 @ X0))) | ((X0 @ b) = $true) | ((X0 @ X1) != $true)) )),
% 0.13/0.39 inference(cnf_transformation,[],[f10])).
% 0.13/0.39 thf(f13,plain,(
% 0.13/0.39 ( ! [X0 : $i > $o,X1 : $i] : (($true != (cP @ (sK0 @ X0))) | ((X0 @ X1) != $true) | ((X0 @ b) = $true)) )),
% 0.13/0.39 inference(cnf_transformation,[],[f10])).
% 0.13/0.39 % SZS output end Proof for theBenchmark
% 0.13/0.39 % (9724)------------------------------
% 0.13/0.39 % (9724)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39 % (9724)Termination reason: Refutation
% 0.13/0.39
% 0.13/0.39 % (9724)Memory used [KB]: 5500
% 0.13/0.39 % (9724)Time elapsed: 0.007 s
% 0.13/0.39 % (9724)Instructions burned: 4 (million)
% 0.13/0.39 % (9724)------------------------------
% 0.13/0.39 % (9724)------------------------------
% 0.13/0.39 % (9718)Success in time 0.017 s
%------------------------------------------------------------------------------