0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : vampire -m 90000 --mode casc -t %d %s 0.02/0.23 % Computer : n141.star.cs.uiowa.edu 0.02/0.23 % Model : x86_64 x86_64 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.23 % Memory : 32218.625MB 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.23 % CPULimit : 300 0.02/0.23 % DateTime : Sat Jul 14 04:47:26 CDT 2018 0.02/0.23 % CPUTime : 0.02/0.23 Hi Geoff, go and have some cold beer while I am trying to solve this very hard problem! 0.02/0.23 % remaining time: 6000 next slice time: 36 0.06/0.26 dis+1010_5_add=large:afp=10000:afq=1.2:amm=off:bs=unit_only:bsr=on:bce=on:cond=fast:fsr=off:fde=none:gsp=input_only:gs=on:irw=on:lma=on:nm=4:newcnf=on:nwc=1.3:nicw=on:sos=all:sac=on:updr=off_34 on theBenchmark 0.06/0.34 % Refutation found. Thanks to Tanya! 0.06/0.34 % SZS status Theorem for theBenchmark 0.06/0.34 % SZS output start Proof for theBenchmark 0.06/0.34 fof(f6,axiom,( 0.06/0.34 ! [X0,X1] : (int_less(X0,X1) <=> ? [X6] : (int_less(int_zero,X6) & plus(X0,X6) = X1))), 0.06/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_and_inverse)). 0.06/0.34 fof(f9,axiom,( 0.06/0.34 ! [X0] : (int_leq(int_one,X0) <=> int_less(int_zero,X0))), 0.06/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_successor_of_zero)). 0.06/0.34 fof(f10,axiom,( 0.06/0.34 ! [X0,X1,X6] : ((int_less(X0,X1) & int_less(X1,X6)) => int_less(X0,X6))), 0.06/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_transitive)). 0.06/0.34 fof(f11,conjecture,( 0.06/0.34 ! [X0,X1] : ((int_leq(int_one,X1) & int_leq(X0,n) & int_less(X1,X0)) => real_zero = a(X0,X1))), 0.06/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ut)). 0.06/0.34 fof(f12,negated_conjecture,( 0.06/0.34 ~! [X0,X1] : ((int_leq(int_one,X1) & int_leq(X0,n) & int_less(X1,X0)) => real_zero = a(X0,X1))), 0.06/0.34 inference(negated_conjecture,[],[f11])). 0.06/0.34 fof(f13,axiom,( 0.06/0.34 ! [X0,X1] : (int_leq(X0,X1) <=> (X0 = X1 | int_less(X0,X1)))), 0.06/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_leq)). 0.06/0.34 fof(f14,axiom,( 0.06/0.34 ! [X0,X1] : ((int_leq(X0,n) & int_leq(X1,n) & int_leq(int_one,X1) & int_leq(int_one,X0)) => (! [X7] : ((int_less(int_zero,X7) & plus(X1,X7) = X0) => ! [X6] : ((int_leq(X6,X1) & int_leq(int_one,X6)) => real_zero = a(plus(X6,X7),X6))) & ! [X7] : ((plus(X0,X7) = X1 & int_leq(int_zero,X7)) => ! [X6] : ((int_leq(X6,X0) & int_leq(int_one,X6)) => a(X6,plus(X6,X7)) = lu(X6,plus(X6,X7))))))), 0.06/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qiu)). 0.06/0.34 fof(f15,plain,( 0.06/0.34 ! [X0,X1] : ((int_leq(X0,n) & int_leq(X1,n) & int_leq(int_one,X1) & int_leq(int_one,X0)) => (! [X2] : ((int_less(int_zero,X2) & plus(X1,X2) = X0) => ! [X3] : ((int_leq(X3,X1) & int_leq(int_one,X3)) => real_zero = a(plus(X3,X2),X3))) & ! [X4] : ((plus(X0,X4) = X1 & int_leq(int_zero,X4)) => ! [X5] : ((int_leq(X5,X0) & int_leq(int_one,X5)) => a(X5,plus(X5,X4)) = lu(X5,plus(X5,X4))))))), 0.06/0.34 inference(rectify,[],[f14])). 0.06/0.34 fof(f16,plain,( 0.06/0.34 ! [X0,X1] : (int_less(X0,X1) <=> ? [X2] : (int_less(int_zero,X2) & plus(X0,X2) = X1))), 0.06/0.34 inference(rectify,[],[f6])). 0.06/0.34 fof(f17,plain,( 0.06/0.34 ! [X0,X1,X2] : ((int_less(X0,X1) & int_less(X1,X2)) => int_less(X0,X2))), 0.06/0.34 inference(rectify,[],[f10])). 0.06/0.34 fof(f19,plain,( 0.06/0.34 ? [X0,X1] : (real_zero != a(X0,X1) & (int_leq(int_one,X1) & int_leq(X0,n) & int_less(X1,X0)))), 0.06/0.34 inference(ennf_transformation,[],[f12])). 0.06/0.34 fof(f20,plain,( 0.06/0.34 ? [X0,X1] : (real_zero != a(X0,X1) & int_leq(int_one,X1) & int_leq(X0,n) & int_less(X1,X0))), 0.06/0.34 inference(flattening,[],[f19])). 0.06/0.34 fof(f21,plain,( 0.06/0.34 ! [X0,X1] : ((! [X2] : (! [X3] : (real_zero = a(plus(X3,X2),X3) | (~int_leq(X3,X1) | ~int_leq(int_one,X3))) | (~int_less(int_zero,X2) | plus(X1,X2) != X0)) & ! [X4] : (! [X5] : (a(X5,plus(X5,X4)) = lu(X5,plus(X5,X4)) | (~int_leq(X5,X0) | ~int_leq(int_one,X5))) | (plus(X0,X4) != X1 | ~int_leq(int_zero,X4)))) | (~int_leq(X0,n) | ~int_leq(X1,n) | ~int_leq(int_one,X1) | ~int_leq(int_one,X0)))), 0.06/0.34 inference(ennf_transformation,[],[f15])). 0.06/0.34 fof(f22,plain,( 0.06/0.34 ! [X0,X1] : ((! [X2] : (! [X3] : (real_zero = a(plus(X3,X2),X3) | ~int_leq(X3,X1) | ~int_leq(int_one,X3)) | ~int_less(int_zero,X2) | plus(X1,X2) != X0) & ! [X4] : (! [X5] : (a(X5,plus(X5,X4)) = lu(X5,plus(X5,X4)) | ~int_leq(X5,X0) | ~int_leq(int_one,X5)) | plus(X0,X4) != X1 | ~int_leq(int_zero,X4))) | ~int_leq(X0,n) | ~int_leq(X1,n) | ~int_leq(int_one,X1) | ~int_leq(int_one,X0))), 0.06/0.34 inference(flattening,[],[f21])). 0.06/0.34 fof(f24,plain,( 0.06/0.34 ! [X0,X1,X2] : (int_less(X0,X2) | (~int_less(X0,X1) | ~int_less(X1,X2)))), 0.06/0.34 inference(ennf_transformation,[],[f17])). 0.06/0.34 fof(f25,plain,( 0.06/0.34 ! [X0,X1,X2] : (int_less(X0,X2) | ~int_less(X0,X1) | ~int_less(X1,X2))), 0.06/0.34 inference(flattening,[],[f24])). 0.06/0.34 fof(f28,plain,( 0.06/0.34 int_less(sK1,sK0)), 0.06/0.34 inference(cnf_transformation,[],[f20])). 0.06/0.34 fof(f29,plain,( 0.06/0.34 int_leq(sK0,n)), 0.06/0.34 inference(cnf_transformation,[],[f20])). 0.06/0.34 fof(f30,plain,( 0.06/0.34 int_leq(int_one,sK1)), 0.06/0.34 inference(cnf_transformation,[],[f20])). 0.06/0.34 fof(f31,plain,( 0.06/0.34 real_zero != a(sK0,sK1)), 0.06/0.34 inference(cnf_transformation,[],[f20])). 0.06/0.34 fof(f32,plain,( 0.06/0.34 ( ! [X2,X0,X3,X1] : (~int_leq(int_one,X0) | ~int_leq(int_one,X1) | ~int_leq(X1,n) | ~int_leq(X0,n) | plus(X1,X2) != X0 | ~int_less(int_zero,X2) | ~int_leq(int_one,X3) | ~int_leq(X3,X1) | real_zero = a(plus(X3,X2),X3)) )), 0.06/0.34 inference(cnf_transformation,[],[f22])). 0.06/0.34 fof(f37,plain,( 0.06/0.34 ( ! [X0] : (~int_less(int_zero,X0) | int_leq(int_one,X0)) )), 0.06/0.34 inference(cnf_transformation,[],[f9])). 0.06/0.34 fof(f38,plain,( 0.06/0.34 ( ! [X0] : (int_less(int_zero,X0) | ~int_leq(int_one,X0)) )), 0.06/0.34 inference(cnf_transformation,[],[f9])). 0.06/0.34 fof(f42,plain,( 0.06/0.34 ( ! [X0,X1] : (plus(X0,sK2(X0,X1)) = X1 | ~int_less(X0,X1)) )), 0.06/0.34 inference(cnf_transformation,[],[f16])). 0.06/0.34 fof(f43,plain,( 0.06/0.34 ( ! [X0,X1] : (int_less(int_zero,sK2(X0,X1)) | ~int_less(X0,X1)) )), 0.06/0.34 inference(cnf_transformation,[],[f16])). 0.06/0.34 fof(f45,plain,( 0.06/0.34 ( ! [X0,X1] : (int_less(X0,X1) | X0 = X1 | ~int_leq(X0,X1)) )), 0.06/0.34 inference(cnf_transformation,[],[f13])). 0.06/0.34 fof(f46,plain,( 0.06/0.34 ( ! [X0,X1] : (~int_less(X0,X1) | int_leq(X0,X1)) )), 0.06/0.34 inference(cnf_transformation,[],[f13])). 0.06/0.34 fof(f47,plain,( 0.06/0.34 ( ! [X0,X1] : (X0 != X1 | int_leq(X0,X1)) )), 0.06/0.34 inference(cnf_transformation,[],[f13])). 0.06/0.34 fof(f48,plain,( 0.06/0.34 ( ! [X2,X0,X1] : (~int_less(X1,X2) | ~int_less(X0,X1) | int_less(X0,X2)) )), 0.06/0.34 inference(cnf_transformation,[],[f25])). 0.06/0.34 fof(f51,plain,( 0.06/0.34 ( ! [X2,X3,X1] : (real_zero = a(plus(X3,X2),X3) | ~int_leq(int_one,X1) | ~int_leq(X1,n) | ~int_leq(plus(X1,X2),n) | ~int_less(int_zero,X2) | ~int_leq(int_one,X3) | ~int_leq(X3,X1) | ~int_leq(int_one,plus(X1,X2))) )), 0.06/0.34 inference(equality_resolution,[],[f32])). 0.06/0.34 fof(f54,plain,( 0.06/0.34 ( ! [X1] : (int_leq(X1,X1)) )), 0.06/0.34 inference(equality_resolution,[],[f47])). 0.06/0.34 fof(f56,plain,( 0.06/0.34 ( ! [X2] : (~int_less(sK0,X2) | int_less(sK1,X2)) )), 0.06/0.34 inference(resolution,[],[f28,f48])). 0.06/0.34 fof(f57,plain,( 0.06/0.34 ( ! [X3] : (~int_less(X3,sK1) | int_less(X3,sK0)) )), 0.06/0.34 inference(resolution,[],[f28,f48])). 0.06/0.34 fof(f58,plain,( 0.06/0.34 int_leq(sK1,sK0)), 0.06/0.34 inference(resolution,[],[f28,f46])). 0.06/0.34 fof(f59,plain,( 0.06/0.34 plus(sK1,sK2(sK1,sK0)) = sK0), 0.06/0.34 inference(resolution,[],[f28,f42])). 0.06/0.34 fof(f60,plain,( 0.06/0.34 int_less(int_zero,sK2(sK1,sK0))), 0.06/0.34 inference(resolution,[],[f28,f43])). 0.06/0.34 fof(f62,plain,( 0.06/0.34 int_less(sK0,n) | n = sK0), 0.06/0.34 inference(resolution,[],[f29,f45])). 0.06/0.34 fof(f63,plain,( 0.06/0.34 int_less(int_zero,sK1)), 0.06/0.34 inference(resolution,[],[f30,f38])). 0.06/0.34 fof(f82,plain,( 0.06/0.34 ( ! [X10,X8,X9] : (~int_leq(int_one,plus(X10,sK2(X8,X9))) | ~int_leq(int_one,X10) | ~int_leq(X10,n) | ~int_leq(plus(X10,sK2(X8,X9)),n) | ~int_less(int_zero,sK2(X8,X9)) | ~int_leq(int_one,X8) | ~int_leq(X8,X10) | real_zero = a(X9,X8) | ~int_less(X8,X9)) )), 0.06/0.34 inference(superposition,[],[f51,f42])). 0.06/0.34 fof(f180,plain,( 0.06/0.34 int_less(int_zero,sK0)), 0.06/0.34 inference(resolution,[],[f57,f63])). 0.06/0.34 fof(f215,plain,( 0.06/0.34 spl3_0 <=> n = sK0), 0.06/0.34 introduced(avatar_definition,[new_symbols(naming,[spl3_0])])). 0.06/0.34 fof(f216,plain,( 0.06/0.34 n = sK0 | ~spl3_0), 0.06/0.34 inference(avatar_component_clause,[],[f215])). 0.06/0.34 fof(f221,plain,( 0.06/0.34 spl3_2 <=> int_less(sK0,n)), 0.06/0.34 introduced(avatar_definition,[new_symbols(naming,[spl3_2])])). 0.06/0.34 fof(f222,plain,( 0.06/0.34 int_less(sK0,n) | ~spl3_2), 0.06/0.34 inference(avatar_component_clause,[],[f221])). 0.06/0.34 fof(f223,plain,( 0.06/0.34 spl3_0 | spl3_2), 0.06/0.34 inference(avatar_split_clause,[],[f62,f221,f215])). 0.06/0.34 fof(f224,plain,( 0.06/0.34 int_less(sK1,n) | ~spl3_2), 0.06/0.34 inference(resolution,[],[f222,f56])). 0.06/0.34 fof(f234,plain,( 0.06/0.34 int_leq(sK1,n) | ~spl3_2), 0.06/0.34 inference(resolution,[],[f224,f46])). 0.06/0.34 fof(f4032,plain,( 0.06/0.34 int_leq(int_one,sK0)), 0.06/0.34 inference(resolution,[],[f180,f37])). 0.06/0.34 fof(f4205,plain,( 0.06/0.34 ~int_leq(int_one,sK0) | ~int_leq(int_one,sK1) | ~int_leq(sK1,n) | ~int_leq(plus(sK1,sK2(sK1,sK0)),n) | ~int_less(int_zero,sK2(sK1,sK0)) | ~int_leq(int_one,sK1) | ~int_leq(sK1,sK1) | real_zero = a(sK0,sK1) | ~int_less(sK1,sK0)), 0.06/0.34 inference(superposition,[],[f82,f59])). 0.06/0.34 fof(f4213,plain,( 0.06/0.34 ~int_leq(int_one,sK0) | ~int_leq(int_one,sK1) | ~int_leq(sK1,n) | ~int_leq(plus(sK1,sK2(sK1,sK0)),n) | ~int_less(int_zero,sK2(sK1,sK0)) | ~int_leq(sK1,sK1) | real_zero = a(sK0,sK1) | ~int_less(sK1,sK0)), 0.06/0.34 inference(duplicate_literal_removal,[],[f4205])). 0.06/0.34 fof(f4217,plain,( 0.06/0.34 ~int_leq(sK0,n) | ~int_leq(int_one,sK0) | ~int_leq(int_one,sK1) | ~int_leq(sK1,n) | ~int_less(int_zero,sK2(sK1,sK0)) | ~int_leq(sK1,sK1) | real_zero = a(sK0,sK1) | ~int_less(sK1,sK0)), 0.06/0.34 inference(forward_demodulation,[],[f4213,f59])). 0.06/0.34 fof(f4218,plain,( 0.06/0.34 ~int_leq(sK1,n) | ~int_leq(sK1,sK1)), 0.06/0.34 inference(global_subsumption,[],[f29,f28,f30,f31,f4032,f60,f4217])). 0.06/0.34 fof(f4451,plain,( 0.06/0.34 spl3_35 <=> ~int_leq(sK1,sK1)), 0.06/0.34 introduced(avatar_definition,[new_symbols(naming,[spl3_35])])). 0.06/0.34 fof(f4452,plain,( 0.06/0.34 ~int_leq(sK1,sK1) | ~spl3_35), 0.06/0.34 inference(avatar_component_clause,[],[f4451])). 0.06/0.34 fof(f4457,plain,( 0.06/0.34 spl3_37 <=> ~int_leq(sK1,n)), 0.06/0.34 introduced(avatar_definition,[new_symbols(naming,[spl3_37])])). 0.06/0.34 fof(f4458,plain,( 0.06/0.34 ~int_leq(sK1,n) | ~spl3_37), 0.06/0.34 inference(avatar_component_clause,[],[f4457])). 0.06/0.34 fof(f4459,plain,( 0.06/0.34 ~spl3_35 | ~spl3_37), 0.06/0.34 inference(avatar_split_clause,[],[f4218,f4457,f4451])). 0.06/0.34 fof(f4460,plain,( 0.06/0.34 $false | ~spl3_35), 0.06/0.34 inference(resolution,[],[f4452,f54])). 0.06/0.34 fof(f4463,plain,( 0.06/0.34 spl3_35), 0.06/0.34 inference(avatar_contradiction_clause,[],[f4460])). 0.06/0.34 fof(f4464,plain,( 0.06/0.34 $false | (~spl3_2 | ~spl3_37)), 0.06/0.34 inference(subsumption_resolution,[],[f234,f4458])). 0.06/0.34 fof(f4467,plain,( 0.06/0.34 ~spl3_2 | spl3_37), 0.06/0.34 inference(avatar_contradiction_clause,[],[f4464])). 0.06/0.34 fof(f4473,plain,( 0.06/0.34 int_leq(sK1,n) | ~spl3_0), 0.06/0.34 inference(backward_demodulation,[],[f216,f58])). 0.06/0.34 fof(f4523,plain,( 0.06/0.34 $false | (~spl3_0 | ~spl3_37)), 0.06/0.34 inference(subsumption_resolution,[],[f4458,f4473])). 0.06/0.34 fof(f4525,plain,( 0.06/0.34 ~spl3_0 | spl3_37), 0.06/0.34 inference(avatar_contradiction_clause,[],[f4523])). 0.06/0.34 fof(f4526,plain,( 0.06/0.34 $false), 0.06/0.34 inference(avatar_sat_refutation,[],[f223,f4459,f4463,f4467,f4525])). 0.06/0.34 % SZS output end Proof for theBenchmark 0.06/0.34 % ------------------------------ 0.06/0.34 % Version: Vampire 4.2 (commit c955596 on 2017-07-21 22:07:53 +0100) 0.06/0.34 % Termination reason: Refutation 0.06/0.34 0.06/0.34 % Memory used [KB]: 12537 0.06/0.34 % Time elapsed: 0.080 s 0.06/0.34 % ------------------------------ 0.06/0.34 % ------------------------------ 0.06/0.34 % Success in time 0.111 s 0.18/0.42 EOF