0.12/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 8 -t %s %d 0.12/0.33 % Computer : n011.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 : 960 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Tue Aug 9 02:36:06 EDT 2022 0.19/0.33 % CPUTime : 0.19/0.38 % (9672)dis+1003_1:1_aac=none:amm=off:ep=R:erd=off:newcnf=on:sac=on:skr=on:sos=all:i=31:si=on:rawr=on:rtra=on_0 on theBenchmark for (1199ds/31Mi) 0.19/0.38 % (9672)First to succeed. 0.19/0.39 % (9672)Refutation found. Thanks to Tanya! 0.19/0.39 % SZS status Theorem for theBenchmark 0.19/0.39 % SZS output start Proof for theBenchmark 0.19/0.39 fof(f280,plain,( 0.19/0.39 $false), 0.19/0.39 inference(avatar_sat_refutation,[],[f49,f129,f279])). 0.19/0.39 fof(f279,plain,( 0.19/0.39 ~spl5_1), 0.19/0.39 inference(avatar_contradiction_clause,[],[f278])). 0.19/0.39 fof(f278,plain,( 0.19/0.39 $false | ~spl5_1), 0.19/0.39 inference(subsumption_resolution,[],[f265,f132])). 0.19/0.39 fof(f132,plain,( 0.19/0.39 member(sK3(sK1,sK0),sK0) | ~spl5_1), 0.19/0.39 inference(resolution,[],[f45,f30])). 0.19/0.39 fof(f30,plain,( 0.19/0.39 ( ! [X0,X1] : (member(sK3(X0,X1),X1) | ~intersect(X0,X1)) )), 0.19/0.39 inference(cnf_transformation,[],[f6])). 0.19/0.39 fof(f6,axiom,( 0.19/0.39 ! [X0,X1] : (intersect(X0,X1) <=> ? [X2] : (member(X2,X0) & member(X2,X1)))), 0.19/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn)). 0.19/0.39 fof(f45,plain,( 0.19/0.39 intersect(sK1,sK0) | ~spl5_1), 0.19/0.39 inference(avatar_component_clause,[],[f44])). 0.19/0.39 fof(f44,plain,( 0.19/0.39 spl5_1 <=> intersect(sK1,sK0)), 0.19/0.39 introduced(avatar_definition,[new_symbols(naming,[spl5_1])])). 0.19/0.39 fof(f265,plain,( 0.19/0.39 ~member(sK3(sK1,sK0),sK0) | ~spl5_1), 0.19/0.39 inference(resolution,[],[f166,f130])). 0.19/0.39 fof(f130,plain,( 0.19/0.39 member(sK3(sK1,sK0),sK1) | ~spl5_1), 0.19/0.39 inference(resolution,[],[f45,f31])). 0.19/0.39 fof(f31,plain,( 0.19/0.39 ( ! [X0,X1] : (~intersect(X0,X1) | member(sK3(X0,X1),X0)) )), 0.19/0.39 inference(cnf_transformation,[],[f6])). 0.19/0.39 fof(f166,plain,( 0.19/0.39 ( ! [X0] : (~member(X0,sK1) | ~member(X0,sK0)) ) | ~spl5_1), 0.19/0.39 inference(resolution,[],[f153,f25])). 0.19/0.39 fof(f25,plain,( 0.19/0.39 ( ! [X2,X0,X1] : (member(X1,intersection(X0,X2)) | ~member(X1,X0) | ~member(X1,X2)) )), 0.19/0.39 inference(cnf_transformation,[],[f11])). 0.19/0.39 fof(f11,plain,( 0.19/0.39 ! [X0,X2,X1] : (member(X1,intersection(X0,X2)) <=> (member(X1,X2) & member(X1,X0)))), 0.19/0.39 inference(rectify,[],[f10])). 0.19/0.39 fof(f10,axiom,( 0.19/0.39 ! [X0,X2,X1] : (member(X2,intersection(X0,X1)) <=> (member(X2,X0) & member(X2,X1)))), 0.19/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn)). 0.19/0.39 fof(f153,plain,( 0.19/0.39 ( ! [X0] : (~member(X0,intersection(sK1,sK0))) ) | ~spl5_1), 0.19/0.39 inference(subsumption_resolution,[],[f150,f21])). 0.19/0.39 fof(f21,plain,( 0.19/0.39 ( ! [X0] : (~member(X0,empty_set)) )), 0.19/0.39 inference(cnf_transformation,[],[f5])). 0.19/0.39 fof(f5,axiom,( 0.19/0.39 ! [X0] : ~member(X0,empty_set)), 0.19/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set_defn)). 0.19/0.39 fof(f150,plain,( 0.19/0.39 ( ! [X0] : (member(X0,empty_set) | ~member(X0,intersection(sK1,sK0))) ) | ~spl5_1), 0.19/0.39 inference(resolution,[],[f134,f39])). 0.19/0.39 fof(f39,plain,( 0.19/0.39 ( ! [X2,X0,X1] : (member(X2,X1) | ~member(X2,X0) | ~sQ4_eqProxy(X0,X1)) )), 0.19/0.39 inference(equality_proxy_replacement,[],[f28,f34])). 0.19/0.39 fof(f34,plain,( 0.19/0.39 ! [X0,X1] : (sQ4_eqProxy(X0,X1) <=> X0 = X1)), 0.19/0.39 introduced(equality_proxy_definition,[new_symbols(naming,[sQ4_eqProxy])])). 0.19/0.39 fof(f28,plain,( 0.19/0.39 ( ! [X2,X0,X1] : (X0 != X1 | ~member(X2,X0) | member(X2,X1)) )), 0.19/0.39 inference(cnf_transformation,[],[f13])). 0.19/0.39 fof(f13,plain,( 0.19/0.39 ! [X1,X0] : (! [X2] : (member(X2,X1) <=> member(X2,X0)) <=> X0 = X1)), 0.19/0.39 inference(rectify,[],[f8])). 0.19/0.39 fof(f8,axiom,( 0.19/0.39 ! [X1,X0] : (! [X2] : (member(X2,X1) <=> member(X2,X0)) <=> X0 = X1)), 0.19/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn)). 0.19/0.39 fof(f134,plain,( 0.19/0.39 sQ4_eqProxy(intersection(sK1,sK0),empty_set) | ~spl5_1), 0.19/0.39 inference(resolution,[],[f133,f36])). 0.19/0.39 fof(f36,plain,( 0.19/0.39 ( ! [X0,X1] : (sQ4_eqProxy(X0,X1) | not_equal(X0,X1)) )), 0.19/0.39 inference(equality_proxy_replacement,[],[f19,f34])). 0.19/0.39 fof(f19,plain,( 0.19/0.39 ( ! [X0,X1] : (X0 = X1 | not_equal(X0,X1)) )), 0.19/0.39 inference(cnf_transformation,[],[f3])). 0.19/0.39 fof(f3,axiom,( 0.19/0.39 ! [X0,X1] : (not_equal(X0,X1) <=> X0 != X1)), 0.19/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_equal_defn)). 0.19/0.39 fof(f133,plain,( 0.19/0.39 ~not_equal(intersection(sK1,sK0),empty_set) | ~spl5_1), 0.19/0.39 inference(subsumption_resolution,[],[f18,f45])). 0.19/0.39 fof(f18,plain,( 0.19/0.39 ~not_equal(intersection(sK1,sK0),empty_set) | ~intersect(sK1,sK0)), 0.19/0.39 inference(cnf_transformation,[],[f15])). 0.19/0.39 fof(f15,plain,( 0.19/0.39 ? [X0,X1] : (not_equal(intersection(X1,X0),empty_set) <~> intersect(X1,X0))), 0.19/0.39 inference(ennf_transformation,[],[f12])). 0.19/0.39 fof(f12,plain,( 0.19/0.39 ~! [X0,X1] : (intersect(X1,X0) <=> not_equal(intersection(X1,X0),empty_set))), 0.19/0.39 inference(rectify,[],[f2])). 0.19/0.39 fof(f2,negated_conjecture,( 0.19/0.39 ~! [X1,X0] : (not_equal(intersection(X0,X1),empty_set) <=> intersect(X0,X1))), 0.19/0.39 inference(negated_conjecture,[],[f1])). 0.19/0.39 fof(f1,conjecture,( 0.19/0.39 ! [X1,X0] : (not_equal(intersection(X0,X1),empty_set) <=> intersect(X0,X1))), 0.19/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th119)). 0.19/0.39 fof(f129,plain,( 0.19/0.39 ~spl5_2), 0.19/0.39 inference(avatar_contradiction_clause,[],[f128])). 0.19/0.39 fof(f128,plain,( 0.19/0.39 $false | ~spl5_2), 0.19/0.39 inference(subsumption_resolution,[],[f113,f98])). 0.19/0.39 fof(f98,plain,( 0.19/0.39 member(sK2(intersection(sK1,sK0),empty_set),sK0) | ~spl5_2), 0.19/0.39 inference(resolution,[],[f54,f24])). 0.19/0.39 fof(f24,plain,( 0.19/0.39 ( ! [X2,X0,X1] : (~member(X1,intersection(X0,X2)) | member(X1,X2)) )), 0.19/0.39 inference(cnf_transformation,[],[f11])). 0.19/0.39 fof(f54,plain,( 0.19/0.39 member(sK2(intersection(sK1,sK0),empty_set),intersection(sK1,sK0)) | ~spl5_2), 0.19/0.39 inference(subsumption_resolution,[],[f53,f21])). 0.19/0.39 fof(f53,plain,( 0.19/0.39 member(sK2(intersection(sK1,sK0),empty_set),intersection(sK1,sK0)) | member(sK2(intersection(sK1,sK0),empty_set),empty_set) | ~spl5_2), 0.19/0.39 inference(resolution,[],[f50,f41])). 0.19/0.39 fof(f41,plain,( 0.19/0.39 ( ! [X0,X1] : (member(sK2(X0,X1),X0) | member(sK2(X0,X1),X1) | sQ4_eqProxy(X0,X1)) )), 0.19/0.39 inference(equality_proxy_replacement,[],[f26,f34])). 0.19/0.39 fof(f26,plain,( 0.19/0.39 ( ! [X0,X1] : (X0 = X1 | member(sK2(X0,X1),X0) | member(sK2(X0,X1),X1)) )), 0.19/0.39 inference(cnf_transformation,[],[f13])). 0.19/0.39 fof(f50,plain,( 0.19/0.39 ~sQ4_eqProxy(intersection(sK1,sK0),empty_set) | ~spl5_2), 0.19/0.39 inference(resolution,[],[f48,f35])). 0.19/0.39 fof(f35,plain,( 0.19/0.39 ( ! [X0,X1] : (~not_equal(X0,X1) | ~sQ4_eqProxy(X0,X1)) )), 0.19/0.39 inference(equality_proxy_replacement,[],[f20,f34])). 0.19/0.39 fof(f20,plain,( 0.19/0.39 ( ! [X0,X1] : (X0 != X1 | ~not_equal(X0,X1)) )), 0.19/0.39 inference(cnf_transformation,[],[f3])). 0.19/0.39 fof(f48,plain,( 0.19/0.39 not_equal(intersection(sK1,sK0),empty_set) | ~spl5_2), 0.19/0.39 inference(avatar_component_clause,[],[f47])). 0.19/0.39 fof(f47,plain,( 0.19/0.39 spl5_2 <=> not_equal(intersection(sK1,sK0),empty_set)), 0.19/0.39 introduced(avatar_definition,[new_symbols(naming,[spl5_2])])). 0.19/0.39 fof(f113,plain,( 0.19/0.39 ~member(sK2(intersection(sK1,sK0),empty_set),sK0) | ~spl5_2), 0.19/0.39 inference(resolution,[],[f97,f56])). 0.19/0.39 fof(f56,plain,( 0.19/0.39 ( ! [X0] : (~member(X0,sK1) | ~member(X0,sK0)) ) | ~spl5_2), 0.19/0.39 inference(resolution,[],[f55,f32])). 0.19/0.39 fof(f32,plain,( 0.19/0.39 ( ! [X2,X0,X1] : (~member(X2,X1) | intersect(X0,X1) | ~member(X2,X0)) )), 0.19/0.39 inference(cnf_transformation,[],[f6])). 0.19/0.39 fof(f55,plain,( 0.19/0.39 ~intersect(sK1,sK0) | ~spl5_2), 0.19/0.39 inference(subsumption_resolution,[],[f18,f48])). 0.19/0.39 fof(f97,plain,( 0.19/0.39 member(sK2(intersection(sK1,sK0),empty_set),sK1) | ~spl5_2), 0.19/0.39 inference(resolution,[],[f54,f23])). 0.19/0.39 fof(f23,plain,( 0.19/0.39 ( ! [X2,X0,X1] : (member(X1,X0) | ~member(X1,intersection(X0,X2))) )), 0.19/0.39 inference(cnf_transformation,[],[f11])). 0.19/0.39 fof(f49,plain,( 0.19/0.39 spl5_1 | spl5_2), 0.19/0.39 inference(avatar_split_clause,[],[f17,f47,f44])). 0.19/0.39 fof(f17,plain,( 0.19/0.39 not_equal(intersection(sK1,sK0),empty_set) | intersect(sK1,sK0)), 0.19/0.39 inference(cnf_transformation,[],[f15])). 0.19/0.39 % SZS output end Proof for theBenchmark 0.19/0.39 % (9672)------------------------------ 0.19/0.39 % (9672)Version: Vampire 4.7 (commit 01f454171 on 2022-07-15 16:59:05 +0200) 0.19/0.39 % (9672)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 0.19/0.39 % (9672)Termination reason: Refutation 0.19/0.39 0.19/0.39 % (9672)Memory used [KB]: 6012 0.19/0.39 % (9672)Time elapsed: 0.007 s 0.19/0.39 % (9672)Instructions burned: 8 (million) 0.19/0.39 % (9672)------------------------------ 0.19/0.39 % (9672)------------------------------ 0.19/0.39 % (9669)Success in time 0.046 s 0.19/0.39 EOF