0.00/0.05 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.05 % Command : vampire --mode casc -t %d %s 0.02/0.32 % Computer : n139.star.cs.uiowa.edu 0.02/0.32 % Model : x86_64 x86_64 0.02/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.32 % Memory : 32218.625MB 0.02/0.32 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.32 % CPULimit : 300 0.02/0.32 % DateTime : Sat Jul 14 04:47:24 CDT 2018 0.02/0.32 % CPUTime : 0.02/0.36 % dis+10_128_acc=on:add=off:afp=4000:afq=1.4:amm=off:bd=preordered:bce=on:cond=on:fsr=off:fde=unused:gs=on:gsem=on:irw=on:lma=on:nm=64:nwc=1.2:nicw=on:sos=on:sp=occurrence:updr=off:uhcvi=on_2 on theBenchmark 0.57/0.86 % Time limit reached! 0.57/0.86 % ------------------------------ 0.57/0.86 % Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100) 0.57/0.86 % Termination reason: Time limit 0.57/0.86 % Termination phase: Saturation 0.57/0.86 0.57/0.86 % Memory used [KB]: 21236 0.57/0.86 % Time elapsed: 0.500 s 0.57/0.86 % ------------------------------ 0.57/0.86 % ------------------------------ 0.57/0.89 % lrs+4_3_av=off:br=off:nm=0:newcnf=on:nwc=1:stl=30:sp=occurrence:urr=on_32 on theBenchmark 4.87/5.19 % Time limit reached! 4.87/5.19 % ------------------------------ 4.87/5.19 % Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100) 4.87/5.19 % Termination reason: Time limit 4.87/5.19 % Termination phase: Saturation 4.87/5.19 4.87/5.19 % Memory used [KB]: 95691 4.87/5.19 % Time elapsed: 4.300 s 4.87/5.19 % ------------------------------ 4.87/5.19 % ------------------------------ 4.87/5.23 % dis+10_3_add=large:afp=10000:afq=1.0:amm=sco:anc=none:gsp=input_only:gs=on:gsem=off:lcm=reverse:nwc=1:sos=on_6 on theBenchmark 4.93/5.29 % Refutation found. Thanks to Tanya! 4.93/5.29 % SZS status Theorem for theBenchmark 4.93/5.29 % SZS output start Proof for theBenchmark 4.93/5.29 fof(f6,axiom,( 4.93/5.29 ! [X0,X1] : (int_less(X0,X1) <=> ? [X6] : (int_less(int_zero,X6) & plus(X0,X6) = X1))), 4.93/5.29 file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_and_inverse)). 4.93/5.29 fof(f9,axiom,( 4.93/5.29 ! [X0] : (int_leq(int_one,X0) <=> int_less(int_zero,X0))), 4.93/5.29 file('/export/starexec/sandbox/benchmark/theBenchmark.p',one_successor_of_zero)). 4.93/5.29 fof(f10,axiom,( 4.93/5.29 ! [X0,X1,X6] : ((int_less(X0,X1) & int_less(X1,X6)) => int_less(X0,X6))), 4.93/5.29 file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_transitive)). 4.93/5.29 fof(f11,conjecture,( 4.93/5.29 ! [X0,X1] : ((int_leq(int_one,X1) & int_leq(X0,n) & int_less(X1,X0)) => real_zero = a(X0,X1))), 4.93/5.29 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ut)). 4.93/5.29 fof(f12,negated_conjecture,( 4.93/5.29 ~! [X0,X1] : ((int_leq(int_one,X1) & int_leq(X0,n) & int_less(X1,X0)) => real_zero = a(X0,X1))), 4.93/5.29 inference(negated_conjecture,[],[f11])). 4.93/5.29 fof(f13,axiom,( 4.93/5.29 ! [X0,X1] : (int_leq(X0,X1) <=> (X0 = X1 | int_less(X0,X1)))), 4.93/5.29 file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_leq)). 4.93/5.29 fof(f14,axiom,( 4.93/5.29 ! [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))))))), 4.93/5.29 file('/export/starexec/sandbox/benchmark/theBenchmark.p',qiu)). 4.93/5.29 fof(f15,plain,( 4.93/5.29 ! [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))))))), 4.93/5.29 inference(rectify,[],[f14])). 4.93/5.29 fof(f16,plain,( 4.93/5.29 ! [X0,X1] : (int_less(X0,X1) <=> ? [X2] : (int_less(int_zero,X2) & plus(X0,X2) = X1))), 4.93/5.29 inference(rectify,[],[f6])). 4.93/5.29 fof(f17,plain,( 4.93/5.29 ! [X0,X1,X2] : ((int_less(X0,X1) & int_less(X1,X2)) => int_less(X0,X2))), 4.93/5.29 inference(rectify,[],[f10])). 4.93/5.29 fof(f19,plain,( 4.93/5.29 ? [X0,X1] : (real_zero != a(X0,X1) & (int_leq(int_one,X1) & int_leq(X0,n) & int_less(X1,X0)))), 4.93/5.29 inference(ennf_transformation,[],[f12])). 4.93/5.29 fof(f20,plain,( 4.93/5.29 ? [X0,X1] : (real_zero != a(X0,X1) & int_leq(int_one,X1) & int_leq(X0,n) & int_less(X1,X0))), 4.93/5.29 inference(flattening,[],[f19])). 4.93/5.29 fof(f21,plain,( 4.93/5.29 ! [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)))), 4.93/5.29 inference(ennf_transformation,[],[f15])). 4.93/5.29 fof(f22,plain,( 4.93/5.29 ! [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))), 4.93/5.29 inference(flattening,[],[f21])). 4.93/5.29 fof(f24,plain,( 4.93/5.29 ! [X0,X1,X2] : (int_less(X0,X2) | (~int_less(X0,X1) | ~int_less(X1,X2)))), 4.93/5.29 inference(ennf_transformation,[],[f17])). 4.93/5.29 fof(f25,plain,( 4.93/5.29 ! [X0,X1,X2] : (int_less(X0,X2) | ~int_less(X0,X1) | ~int_less(X1,X2))), 4.93/5.29 inference(flattening,[],[f24])). 4.93/5.29 fof(f28,plain,( 4.93/5.29 ? [X0,X1] : (real_zero != a(X0,X1) & int_leq(int_one,X1) & int_leq(X0,n) & int_less(X1,X0)) => (real_zero != a(sK0,sK1) & int_leq(int_one,sK1) & int_leq(sK0,n) & int_less(sK1,sK0))), 4.93/5.29 introduced(choice_axiom,[])). 4.93/5.29 fof(f29,plain,( 4.93/5.29 real_zero != a(sK0,sK1) & int_leq(int_one,sK1) & int_leq(sK0,n) & int_less(sK1,sK0)), 4.93/5.29 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f20,f28])). 4.93/5.29 fof(f30,plain,( 4.93/5.29 ! [X0] : ((int_leq(int_one,X0) | ~int_less(int_zero,X0)) & (int_less(int_zero,X0) | ~int_leq(int_one,X0)))), 4.93/5.29 inference(nnf_transformation,[],[f9])). 4.93/5.29 fof(f31,plain,( 4.93/5.29 ! [X0,X1] : ((int_less(X0,X1) | ! [X2] : (~int_less(int_zero,X2) | plus(X0,X2) != X1)) & (? [X2] : (int_less(int_zero,X2) & plus(X0,X2) = X1) | ~int_less(X0,X1)))), 4.93/5.29 inference(nnf_transformation,[],[f16])). 4.93/5.29 fof(f32,plain,( 4.93/5.29 ! [X0,X1] : ((int_less(X0,X1) | ! [X2] : (~int_less(int_zero,X2) | plus(X0,X2) != X1)) & (? [X3] : (int_less(int_zero,X3) & plus(X0,X3) = X1) | ~int_less(X0,X1)))), 4.93/5.29 inference(rectify,[],[f31])). 4.93/5.29 fof(f33,plain,( 4.93/5.29 ! [X1,X0] : (? [X3] : (int_less(int_zero,X3) & plus(X0,X3) = X1) => (int_less(int_zero,sK2(X0,X1)) & plus(X0,sK2(X0,X1)) = X1))), 4.93/5.29 introduced(choice_axiom,[])). 4.93/5.29 fof(f34,plain,( 4.93/5.29 ! [X0,X1] : ((int_less(X0,X1) | ! [X2] : (~int_less(int_zero,X2) | plus(X0,X2) != X1)) & ((int_less(int_zero,sK2(X0,X1)) & plus(X0,sK2(X0,X1)) = X1) | ~int_less(X0,X1)))), 4.93/5.29 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f32,f33])). 4.93/5.29 fof(f35,plain,( 4.93/5.29 ! [X0,X1] : ((int_leq(X0,X1) | (X0 != X1 & ~int_less(X0,X1))) & ((X0 = X1 | int_less(X0,X1)) | ~int_leq(X0,X1)))), 4.93/5.29 inference(nnf_transformation,[],[f13])). 4.93/5.29 fof(f36,plain,( 4.93/5.29 ! [X0,X1] : ((int_leq(X0,X1) | (X0 != X1 & ~int_less(X0,X1))) & (X0 = X1 | int_less(X0,X1) | ~int_leq(X0,X1)))), 4.93/5.29 inference(flattening,[],[f35])). 4.93/5.29 fof(f37,plain,( 4.93/5.29 int_less(sK1,sK0)), 4.93/5.29 inference(cnf_transformation,[],[f29])). 4.93/5.29 fof(f38,plain,( 4.93/5.29 int_leq(sK0,n)), 4.93/5.29 inference(cnf_transformation,[],[f29])). 4.93/5.29 fof(f39,plain,( 4.93/5.29 int_leq(int_one,sK1)), 4.93/5.29 inference(cnf_transformation,[],[f29])). 4.93/5.29 fof(f40,plain,( 4.93/5.29 real_zero != a(sK0,sK1)), 4.93/5.29 inference(cnf_transformation,[],[f29])). 4.93/5.29 fof(f42,plain,( 4.93/5.29 ( ! [X2,X0,X3,X1] : (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 | ~int_leq(X0,n) | ~int_leq(X1,n) | ~int_leq(int_one,X1) | ~int_leq(int_one,X0)) )), 4.93/5.29 inference(cnf_transformation,[],[f22])). 4.93/5.29 fof(f46,plain,( 4.93/5.29 ( ! [X0] : (~int_leq(int_one,X0) | int_less(int_zero,X0)) )), 4.93/5.29 inference(cnf_transformation,[],[f30])). 4.93/5.29 fof(f47,plain,( 4.93/5.29 ( ! [X0] : (~int_less(int_zero,X0) | int_leq(int_one,X0)) )), 4.93/5.29 inference(cnf_transformation,[],[f30])). 4.93/5.29 fof(f51,plain,( 4.93/5.29 ( ! [X0,X1] : (~int_less(X0,X1) | plus(X0,sK2(X0,X1)) = X1) )), 4.93/5.29 inference(cnf_transformation,[],[f34])). 4.93/5.29 fof(f52,plain,( 4.93/5.29 ( ! [X0,X1] : (int_less(int_zero,sK2(X0,X1)) | ~int_less(X0,X1)) )), 4.93/5.29 inference(cnf_transformation,[],[f34])). 4.93/5.29 fof(f54,plain,( 4.93/5.29 ( ! [X0,X1] : (~int_leq(X0,X1) | int_less(X0,X1) | X0 = X1) )), 4.93/5.29 inference(cnf_transformation,[],[f36])). 4.93/5.29 fof(f55,plain,( 4.93/5.29 ( ! [X0,X1] : (~int_less(X0,X1) | int_leq(X0,X1)) )), 4.93/5.29 inference(cnf_transformation,[],[f36])). 4.93/5.29 fof(f56,plain,( 4.93/5.29 ( ! [X0,X1] : (int_leq(X0,X1) | X0 != X1) )), 4.93/5.29 inference(cnf_transformation,[],[f36])). 4.93/5.29 fof(f57,plain,( 4.93/5.29 ( ! [X2,X0,X1] : (~int_less(X1,X2) | ~int_less(X0,X1) | int_less(X0,X2)) )), 4.93/5.29 inference(cnf_transformation,[],[f25])). 4.93/5.29 fof(f59,plain,( 4.93/5.29 ( ! [X2,X3,X1] : (~int_leq(int_one,plus(X1,X2)) | ~int_leq(X3,X1) | ~int_leq(int_one,X3) | ~int_less(int_zero,X2) | ~int_leq(plus(X1,X2),n) | ~int_leq(X1,n) | ~int_leq(int_one,X1) | real_zero = a(plus(X3,X2),X3)) )), 4.93/5.29 inference(equality_resolution,[],[f42])). 4.93/5.29 fof(f63,plain,( 4.93/5.29 ( ! [X1] : (int_leq(X1,X1)) )), 4.93/5.29 inference(equality_resolution,[],[f56])). 4.93/5.29 fof(f65,plain,( 4.93/5.29 ( ! [X2] : (~int_less(X2,sK1) | int_less(X2,sK0)) )), 4.93/5.29 inference(resolution,[],[f37,f57])). 4.93/5.29 fof(f66,plain,( 4.93/5.29 int_leq(sK1,sK0)), 4.93/5.29 inference(resolution,[],[f37,f55])). 4.93/5.29 fof(f67,plain,( 4.93/5.29 plus(sK1,sK2(sK1,sK0)) = sK0), 4.93/5.29 inference(resolution,[],[f37,f51])). 4.93/5.29 fof(f73,plain,( 4.93/5.29 spl3_0 <=> n = sK0), 4.93/5.29 introduced(avatar_definition,[new_symbols(naming,[spl3_0])])). 4.93/5.29 fof(f74,plain,( 4.93/5.29 n = sK0 | ~spl3_0), 4.93/5.29 inference(avatar_component_clause,[],[f73])). 4.93/5.29 fof(f79,plain,( 4.93/5.29 spl3_2 <=> int_less(sK0,n)), 4.93/5.29 introduced(avatar_definition,[new_symbols(naming,[spl3_2])])). 4.93/5.29 fof(f80,plain,( 4.93/5.29 int_less(sK0,n) | ~spl3_2), 4.93/5.29 inference(avatar_component_clause,[],[f79])). 4.93/5.29 fof(f82,plain,( 4.93/5.29 int_less(int_zero,sK1)), 4.93/5.29 inference(resolution,[],[f39,f46])). 4.93/5.29 fof(f99,plain,( 4.93/5.29 ( ! [X2] : (~int_less(X2,sK0) | int_less(X2,n)) ) | ~spl3_2), 4.93/5.29 inference(resolution,[],[f80,f57])). 4.93/5.29 fof(f287,plain,( 4.93/5.29 int_less(sK1,n) | ~spl3_2), 4.93/5.29 inference(resolution,[],[f37,f99])). 4.93/5.29 fof(f335,plain,( 4.93/5.29 int_less(int_zero,sK0)), 4.93/5.29 inference(resolution,[],[f65,f82])). 4.93/5.29 fof(f338,plain,( 4.93/5.29 int_leq(int_one,sK0)), 4.93/5.29 inference(resolution,[],[f335,f47])). 4.93/5.29 fof(f350,plain,( 4.93/5.29 int_leq(sK1,n) | ~spl3_2), 4.93/5.29 inference(resolution,[],[f287,f55])). 4.93/5.29 fof(f427,plain,( 4.93/5.29 spl3_44 <=> int_leq(sK1,n)), 4.93/5.29 introduced(avatar_definition,[new_symbols(naming,[spl3_44])])). 4.93/5.29 fof(f428,plain,( 4.93/5.29 int_leq(sK1,n) | ~spl3_44), 4.93/5.29 inference(avatar_component_clause,[],[f427])). 4.93/5.29 fof(f430,plain,( 4.93/5.29 spl3_45 <=> ~int_leq(sK1,n)), 4.93/5.29 introduced(avatar_definition,[new_symbols(naming,[spl3_45])])). 4.93/5.29 fof(f431,plain,( 4.93/5.29 ~int_leq(sK1,n) | ~spl3_45), 4.93/5.29 inference(avatar_component_clause,[],[f430])). 4.93/5.29 fof(f450,plain,( 4.93/5.29 spl3_51 <=> ~int_less(int_zero,sK2(sK1,sK0))), 4.93/5.29 introduced(avatar_definition,[new_symbols(naming,[spl3_51])])). 4.93/5.29 fof(f451,plain,( 4.93/5.29 ~int_less(int_zero,sK2(sK1,sK0)) | ~spl3_51), 4.93/5.29 inference(avatar_component_clause,[],[f450])). 4.93/5.29 fof(f453,plain,( 4.93/5.29 spl3_52 <=> ! [X1] : (~int_leq(X1,sK1) | real_zero = a(plus(X1,sK2(sK1,sK0)),X1) | ~int_leq(int_one,X1))), 4.93/5.29 introduced(avatar_definition,[new_symbols(naming,[spl3_52])])). 4.93/5.29 fof(f454,plain,( 4.93/5.29 ( ! [X1] : (~int_leq(int_one,X1) | real_zero = a(plus(X1,sK2(sK1,sK0)),X1) | ~int_leq(X1,sK1)) ) | ~spl3_52), 4.93/5.29 inference(avatar_component_clause,[],[f453])). 4.93/5.29 fof(f457,plain,( 4.93/5.29 $false | (~spl3_2 | ~spl3_45)), 4.93/5.29 inference(subsumption_resolution,[],[f350,f431])). 4.93/5.29 fof(f458,plain,( 4.93/5.29 ~spl3_2 | spl3_45), 4.93/5.29 inference(avatar_contradiction_clause,[],[f457])). 4.93/5.29 fof(f463,plain,( 4.93/5.29 int_leq(sK1,n) | ~spl3_0), 4.93/5.29 inference(backward_demodulation,[],[f74,f66])). 4.93/5.29 fof(f470,plain,( 4.93/5.29 $false | (~spl3_0 | ~spl3_45)), 4.93/5.29 inference(subsumption_resolution,[],[f463,f431])). 4.93/5.29 fof(f471,plain,( 4.93/5.29 ~spl3_0 | spl3_45), 4.93/5.29 inference(avatar_contradiction_clause,[],[f470])). 4.93/5.29 fof(f540,plain,( 4.93/5.29 ~int_less(sK1,sK0) | ~spl3_51), 4.93/5.29 inference(resolution,[],[f451,f52])). 4.93/5.29 fof(f542,plain,( 4.93/5.29 $false | ~spl3_51), 4.93/5.29 inference(subsumption_resolution,[],[f540,f37])). 4.93/5.29 fof(f543,plain,( 4.93/5.29 spl3_51), 4.93/5.29 inference(avatar_contradiction_clause,[],[f542])). 4.93/5.29 fof(f1331,plain,( 4.93/5.29 int_less(sK0,n) | n = sK0), 4.93/5.29 inference(resolution,[],[f38,f54])). 4.93/5.29 fof(f1332,plain,( 4.93/5.29 spl3_0 | spl3_2), 4.93/5.29 inference(avatar_split_clause,[],[f1331,f79,f73])). 4.93/5.29 fof(f3636,plain,( 4.93/5.29 ( ! [X5] : (~int_leq(int_one,sK0) | ~int_leq(X5,sK1) | ~int_leq(int_one,X5) | ~int_less(int_zero,sK2(sK1,sK0)) | ~int_leq(plus(sK1,sK2(sK1,sK0)),n) | ~int_leq(sK1,n) | ~int_leq(int_one,sK1) | real_zero = a(plus(X5,sK2(sK1,sK0)),X5)) )), 4.93/5.29 inference(superposition,[],[f59,f67])). 4.93/5.29 fof(f3641,plain,( 4.93/5.29 ( ! [X5] : (~int_leq(X5,sK1) | ~int_leq(int_one,X5) | ~int_less(int_zero,sK2(sK1,sK0)) | ~int_leq(plus(sK1,sK2(sK1,sK0)),n) | ~int_leq(sK1,n) | ~int_leq(int_one,sK1) | real_zero = a(plus(X5,sK2(sK1,sK0)),X5)) )), 4.93/5.29 inference(subsumption_resolution,[],[f3636,f338])). 4.93/5.29 fof(f3642,plain,( 4.93/5.29 ( ! [X5] : (~int_leq(X5,sK1) | ~int_leq(int_one,X5) | ~int_less(int_zero,sK2(sK1,sK0)) | ~int_leq(plus(sK1,sK2(sK1,sK0)),n) | ~int_leq(int_one,sK1) | real_zero = a(plus(X5,sK2(sK1,sK0)),X5)) ) | ~spl3_44), 4.93/5.29 inference(subsumption_resolution,[],[f3641,f428])). 4.93/5.29 fof(f3643,plain,( 4.93/5.29 ( ! [X5] : (~int_leq(X5,sK1) | ~int_leq(int_one,X5) | ~int_less(int_zero,sK2(sK1,sK0)) | ~int_leq(plus(sK1,sK2(sK1,sK0)),n) | real_zero = a(plus(X5,sK2(sK1,sK0)),X5)) ) | ~spl3_44), 4.93/5.29 inference(subsumption_resolution,[],[f3642,f39])). 4.93/5.29 fof(f3644,plain,( 4.93/5.29 ( ! [X5] : (~int_leq(sK0,n) | ~int_leq(X5,sK1) | ~int_leq(int_one,X5) | ~int_less(int_zero,sK2(sK1,sK0)) | real_zero = a(plus(X5,sK2(sK1,sK0)),X5)) ) | ~spl3_44), 4.93/5.29 inference(forward_demodulation,[],[f3643,f67])). 4.93/5.29 fof(f3645,plain,( 4.93/5.29 ( ! [X5] : (~int_leq(X5,sK1) | ~int_leq(int_one,X5) | ~int_less(int_zero,sK2(sK1,sK0)) | real_zero = a(plus(X5,sK2(sK1,sK0)),X5)) ) | ~spl3_44), 4.93/5.29 inference(subsumption_resolution,[],[f3644,f38])). 4.93/5.29 fof(f3646,plain,( 4.93/5.29 ~spl3_51 | spl3_52 | ~spl3_44), 4.93/5.29 inference(avatar_split_clause,[],[f3645,f427,f453,f450])). 4.93/5.29 fof(f3946,plain,( 4.93/5.29 real_zero = a(plus(sK1,sK2(sK1,sK0)),sK1) | ~int_leq(sK1,sK1) | ~spl3_52), 4.93/5.29 inference(resolution,[],[f454,f39])). 4.93/5.29 fof(f3975,plain,( 4.93/5.29 real_zero = a(plus(sK1,sK2(sK1,sK0)),sK1) | ~spl3_52), 4.93/5.29 inference(subsumption_resolution,[],[f3946,f63])). 4.93/5.29 fof(f3976,plain,( 4.93/5.29 real_zero = a(sK0,sK1) | ~spl3_52), 4.93/5.29 inference(forward_demodulation,[],[f3975,f67])). 4.93/5.29 fof(f3977,plain,( 4.93/5.29 $false | ~spl3_52), 4.93/5.29 inference(subsumption_resolution,[],[f3976,f40])). 4.93/5.29 fof(f3978,plain,( 4.93/5.29 ~spl3_52), 4.93/5.29 inference(avatar_contradiction_clause,[],[f3977])). 4.93/5.29 fof(f4012,plain,( 4.93/5.29 $false), 4.93/5.29 inference(avatar_sat_refutation,[],[f458,f471,f543,f1332,f3646,f3978])). 4.93/5.29 % SZS output end Proof for theBenchmark 4.93/5.29 % ------------------------------ 4.93/5.29 % Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100) 4.93/5.29 % Termination reason: Refutation 4.93/5.29 4.93/5.29 % Memory used [KB]: 11129 4.93/5.29 % Time elapsed: 0.062 s 4.93/5.29 % ------------------------------ 4.93/5.29 % ------------------------------ 4.93/5.29 % Success in time 4.968 s 4.93/5.29 EOF