TSTP Solution File: SEV272^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV272^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n023.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:02:35 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV272^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.03/0.12 % Command : run_vampire %s %d THM
% 0.12/0.33 % Computer : n023.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 19:33:09 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.35 This is a TH0_THM_EQU_NAR problem
% 0.12/0.36 Running higher-order theorem proving
% 0.12/0.36 Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/benchmark/theBenchmark.p -m 16384 -t 300
% 0.21/0.38 % (24327)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 % (24323)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 % (24326)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.38 % (24325)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 % (24324)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 % (24328)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 % (24329)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 % (24326)Instruction limit reached!
% 0.21/0.38 % (24326)------------------------------
% 0.21/0.38 % (24326)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.38 % (24327)Instruction limit reached!
% 0.21/0.38 % (24327)------------------------------
% 0.21/0.38 % (24327)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.38 % (24327)Termination reason: Unknown
% 0.21/0.38 % (24327)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (24327)Memory used [KB]: 1023
% 0.21/0.38 % (24327)Time elapsed: 0.004 s
% 0.21/0.38 % (24327)Instructions burned: 2 (million)
% 0.21/0.38 % (24327)------------------------------
% 0.21/0.38 % (24327)------------------------------
% 0.21/0.38 % (24323)First to succeed.
% 0.21/0.38 % (24326)Termination reason: Unknown
% 0.21/0.38 % (24326)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (24326)Memory used [KB]: 5500
% 0.21/0.38 % (24326)Time elapsed: 0.004 s
% 0.21/0.38 % (24326)Instructions burned: 2 (million)
% 0.21/0.38 % (24326)------------------------------
% 0.21/0.38 % (24326)------------------------------
% 0.21/0.38 % (24329)Also succeeded, but the first one will report.
% 0.21/0.38 % (24324)Also succeeded, but the first one will report.
% 0.21/0.38 % (24323)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% 0.21/0.38 thf(func_def_0, type, cSUCC: (($i > $o) > $o) > ($i > $o) > $o).
% 0.21/0.38 thf(func_def_1, type, cZERO: ($i > $o) > $o).
% 0.21/0.38 thf(f17,plain,(
% 0.21/0.38 $false),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f16])).
% 0.21/0.38 thf(f16,plain,(
% 0.21/0.38 ((^[Y0 : ($i > $o) > $o]: (!! @ ((($i > $o) > $o) > $o) @ (^[Y1 : (($i > $o) > $o) > $o]: (((Y1 @ (^[Y2 : $i > $o]: (~ (?? @ $i @ (^[Y3 : $i]: (Y2 @ Y3)))))) & (!! @ (($i > $o) > $o) @ (^[Y2 : ($i > $o) > $o]: ((Y1 @ Y2) => (Y1 @ ((^[Y3 : ($i > $o) > $o]: ((^[Y4 : $i > $o]: (?? @ $i @ (^[Y5 : $i]: ((Y4 @ Y5) & (Y3 @ (^[Y6 : $i]: ((~ (Y5 = Y6)) & (Y4 @ Y6)))))))))) @ Y2)))))) => (Y1 @ Y0))))) != (^[Y0 : ($i > $o) > $o]: (!! @ ((($i > $o) > $o) > $o) @ (^[Y1 : (($i > $o) > $o) > $o]: (((Y1 @ (^[Y2 : $i > $o]: (~ (?? @ $i @ (^[Y3 : $i]: (Y2 @ Y3)))))) & (!! @ (($i > $o) > $o) @ (^[Y2 : ($i > $o) > $o]: ((Y1 @ Y2) => (Y1 @ ((^[Y3 : ($i > $o) > $o]: ((^[Y4 : $i > $o]: (?? @ $i @ (^[Y5 : $i]: ((Y4 @ Y5) & (Y3 @ (^[Y6 : $i]: ((~ (Y5 = Y6)) & (Y4 @ Y6)))))))))) @ Y2)))))) => (Y1 @ Y0))))))),
% 0.21/0.38 inference(definition_unfolding,[],[f13,f15,f14,f15,f14])).
% 0.21/0.38 thf(f14,plain,(
% 0.21/0.38 (cSUCC = (^[Y0 : ($i > $o) > $o]: ((^[Y1 : $i > $o]: (?? @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ (^[Y3 : $i]: ((~ (Y2 = Y3)) & (Y1 @ Y3)))))))))))),
% 0.21/0.38 inference(cnf_transformation,[],[f7])).
% 0.21/0.38 thf(f7,plain,(
% 0.21/0.38 (cSUCC = (^[Y0 : ($i > $o) > $o]: ((^[Y1 : $i > $o]: (?? @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ (^[Y3 : $i]: ((~ (Y2 = Y3)) & (Y1 @ Y3)))))))))))),
% 0.21/0.38 inference(fool_elimination,[],[f6])).
% 0.21/0.38 thf(f6,plain,(
% 0.21/0.38 (cSUCC = (^[X0 : ($i > $o) > $o, X1 : $i > $o] : (? [X2] : ((X0 @ (^[X3 : $i] : ((X1 @ X3) & (X2 != X3)))) & (X1 @ X2)))))),
% 0.21/0.38 inference(rectify,[],[f1])).
% 0.21/0.38 thf(f1,axiom,(
% 0.21/0.38 (cSUCC = (^[X0 : ($i > $o) > $o, X1 : $i > $o] : (? [X2] : ((X0 @ (^[X3 : $i] : ((X1 @ X3) & (X2 != X3)))) & (X1 @ X2)))))),
% 0.21/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cSUCC_def)).
% 0.21/0.38 thf(f15,plain,(
% 0.21/0.38 (cZERO = (^[Y0 : $i > $o]: (~ (?? @ $i @ (^[Y1 : $i]: (Y0 @ Y1))))))),
% 0.21/0.38 inference(cnf_transformation,[],[f11])).
% 0.21/0.38 thf(f11,plain,(
% 0.21/0.38 (cZERO = (^[Y0 : $i > $o]: (~ (?? @ $i @ (^[Y1 : $i]: (Y0 @ Y1))))))),
% 0.21/0.38 inference(fool_elimination,[],[f10])).
% 0.21/0.38 thf(f10,plain,(
% 0.21/0.38 ((^[X0 : $i > $o] : (~? [X1] : (X0 @ X1))) = cZERO)),
% 0.21/0.38 inference(rectify,[],[f2])).
% 0.21/0.38 thf(f2,axiom,(
% 0.21/0.38 ((^[X1 : $i > $o] : (~? [X2] : (X1 @ X2))) = cZERO)),
% 0.21/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cZERO_def)).
% 0.21/0.38 thf(f13,plain,(
% 0.21/0.38 ((^[Y0 : ($i > $o) > $o]: (!! @ ((($i > $o) > $o) > $o) @ (^[Y1 : (($i > $o) > $o) > $o]: (((Y1 @ cZERO) & (!! @ (($i > $o) > $o) @ (^[Y2 : ($i > $o) > $o]: ((Y1 @ Y2) => (Y1 @ (cSUCC @ Y2)))))) => (Y1 @ Y0))))) != (^[Y0 : ($i > $o) > $o]: (!! @ ((($i > $o) > $o) > $o) @ (^[Y1 : (($i > $o) > $o) > $o]: (((Y1 @ cZERO) & (!! @ (($i > $o) > $o) @ (^[Y2 : ($i > $o) > $o]: ((Y1 @ Y2) => (Y1 @ (cSUCC @ Y2)))))) => (Y1 @ Y0))))))),
% 0.21/0.38 inference(cnf_transformation,[],[f12])).
% 0.21/0.38 thf(f12,plain,(
% 0.21/0.38 ((^[Y0 : ($i > $o) > $o]: (!! @ ((($i > $o) > $o) > $o) @ (^[Y1 : (($i > $o) > $o) > $o]: (((Y1 @ cZERO) & (!! @ (($i > $o) > $o) @ (^[Y2 : ($i > $o) > $o]: ((Y1 @ Y2) => (Y1 @ (cSUCC @ Y2)))))) => (Y1 @ Y0))))) != (^[Y0 : ($i > $o) > $o]: (!! @ ((($i > $o) > $o) > $o) @ (^[Y1 : (($i > $o) > $o) > $o]: (((Y1 @ cZERO) & (!! @ (($i > $o) > $o) @ (^[Y2 : ($i > $o) > $o]: ((Y1 @ Y2) => (Y1 @ (cSUCC @ Y2)))))) => (Y1 @ Y0))))))),
% 0.21/0.38 inference(flattening,[],[f9])).
% 0.21/0.38 thf(f9,plain,(
% 0.21/0.38 ~((^[Y0 : ($i > $o) > $o]: (!! @ ((($i > $o) > $o) > $o) @ (^[Y1 : (($i > $o) > $o) > $o]: (((Y1 @ cZERO) & (!! @ (($i > $o) > $o) @ (^[Y2 : ($i > $o) > $o]: ((Y1 @ Y2) => (Y1 @ (cSUCC @ Y2)))))) => (Y1 @ Y0))))) = (^[Y0 : ($i > $o) > $o]: (!! @ ((($i > $o) > $o) > $o) @ (^[Y1 : (($i > $o) > $o) > $o]: (((Y1 @ cZERO) & (!! @ (($i > $o) > $o) @ (^[Y2 : ($i > $o) > $o]: ((Y1 @ Y2) => (Y1 @ (cSUCC @ Y2)))))) => (Y1 @ Y0))))))),
% 0.21/0.38 inference(fool_elimination,[],[f8])).
% 0.21/0.38 thf(f8,plain,(
% 0.21/0.38 ~((^[X0 : ($i > $o) > $o] : (! [X1 : (($i > $o) > $o) > $o] : ((! [X2 : ($i > $o) > $o] : ((X1 @ X2) => (X1 @ (cSUCC @ X2))) & (X1 @ cZERO)) => (X1 @ X0)))) = (^[X3 : ($i > $o) > $o] : (! [X4 : (($i > $o) > $o) > $o] : ((! [X5 : ($i > $o) > $o] : ((X4 @ X5) => (X4 @ (cSUCC @ X5))) & (X4 @ cZERO)) => (X4 @ X3)))))),
% 0.21/0.38 inference(rectify,[],[f4])).
% 0.21/0.38 thf(f4,negated_conjecture,(
% 0.21/0.38 ~((^[X4 : ($i > $o) > $o] : (! [X5 : (($i > $o) > $o) > $o] : ((! [X6 : ($i > $o) > $o] : ((X5 @ X6) => (X5 @ (cSUCC @ X6))) & (X5 @ cZERO)) => (X5 @ X4)))) = (^[X2 : ($i > $o) > $o] : (! [X7 : (($i > $o) > $o) > $o] : ((! [X6 : ($i > $o) > $o] : ((X7 @ X6) => (X7 @ (cSUCC @ X6))) & (X7 @ cZERO)) => (X7 @ X2)))))),
% 0.21/0.38 inference(negated_conjecture,[],[f3])).
% 0.21/0.38 thf(f3,conjecture,(
% 0.21/0.38 ((^[X4 : ($i > $o) > $o] : (! [X5 : (($i > $o) > $o) > $o] : ((! [X6 : ($i > $o) > $o] : ((X5 @ X6) => (X5 @ (cSUCC @ X6))) & (X5 @ cZERO)) => (X5 @ X4)))) = (^[X2 : ($i > $o) > $o] : (! [X7 : (($i > $o) > $o) > $o] : ((! [X6 : ($i > $o) > $o] : ((X7 @ X6) => (X7 @ (cSUCC @ X6))) & (X7 @ cZERO)) => (X7 @ X2)))))),
% 0.21/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX6007A_pme)).
% 0.21/0.38 % SZS output end Proof for theBenchmark
% 0.21/0.38 % (24323)------------------------------
% 0.21/0.38 % (24323)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.38 % (24323)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (24323)Memory used [KB]: 5500
% 0.21/0.38 % (24323)Time elapsed: 0.005 s
% 0.21/0.38 % (24323)Instructions burned: 2 (million)
% 0.21/0.38 % (24323)------------------------------
% 0.21/0.38 % (24323)------------------------------
% 0.21/0.38 % (24322)Success in time 0.008 s
%------------------------------------------------------------------------------