0.00/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.10 % Command : vampire --mode casc -t %d %s 0.11/0.31 % Computer : n012.cluster.edu 0.11/0.31 % Model : x86_64 x86_64 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.31 % Memory : 8042.1875MB 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.31 % CPULimit : 960 0.11/0.31 % DateTime : Thu Jul 2 07:25:51 EDT 2020 0.11/0.32 % CPUTime : 0.17/0.38 % lrs-11_12_av=off:nm=32:nwc=1.3:stl=30:sd=3:ss=axioms:sos=all_2 on theBenchmark 0.42/0.60 % Refutation found. Thanks to Tanya! 0.42/0.60 % SZS status Theorem for theBenchmark 0.42/0.60 % SZS output start Proof for theBenchmark 0.42/0.60 fof(f14760,plain,( 0.42/0.60 $false), 0.42/0.60 inference(subsumption_resolution,[],[f14748,f36])). 0.42/0.60 fof(f36,plain,( 0.42/0.60 ( ! [X0] : (~member(X0,empty_set)) )), 0.42/0.60 inference(cnf_transformation,[],[f7])). 0.42/0.60 fof(f7,axiom,( 0.42/0.60 ! [X0] : ~member(X0,empty_set)), 0.42/0.60 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set)). 0.42/0.60 fof(f14748,plain,( 0.42/0.60 member(sK2(empty_set,intersection(difference(sK1,sK0),sK0)),empty_set)), 0.42/0.60 inference(resolution,[],[f14747,f44])). 0.42/0.60 fof(f44,plain,( 0.42/0.60 ( ! [X0,X1] : (subset(X0,X1) | member(sK2(X0,X1),X0)) )), 0.42/0.60 inference(cnf_transformation,[],[f32])). 0.42/0.60 fof(f32,plain,( 0.42/0.60 ! [X0,X1] : ((subset(X0,X1) | (~member(sK2(X0,X1),X1) & member(sK2(X0,X1),X0))) & (! [X3] : (member(X3,X1) | ~member(X3,X0)) | ~subset(X0,X1)))), 0.42/0.60 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f30,f31])). 0.42/0.60 fof(f31,plain,( 0.42/0.60 ! [X1,X0] : (? [X2] : (~member(X2,X1) & member(X2,X0)) => (~member(sK2(X0,X1),X1) & member(sK2(X0,X1),X0)))), 0.42/0.60 introduced(choice_axiom,[])). 0.42/0.60 fof(f30,plain,( 0.42/0.60 ! [X0,X1] : ((subset(X0,X1) | ? [X2] : (~member(X2,X1) & member(X2,X0))) & (! [X3] : (member(X3,X1) | ~member(X3,X0)) | ~subset(X0,X1)))), 0.42/0.60 inference(rectify,[],[f29])). 0.42/0.60 fof(f29,plain,( 0.42/0.60 ! [X0,X1] : ((subset(X0,X1) | ? [X2] : (~member(X2,X1) & member(X2,X0))) & (! [X2] : (member(X2,X1) | ~member(X2,X0)) | ~subset(X0,X1)))), 0.42/0.60 inference(nnf_transformation,[],[f22])). 0.42/0.60 fof(f22,plain,( 0.42/0.60 ! [X0,X1] : (subset(X0,X1) <=> ! [X2] : (member(X2,X1) | ~member(X2,X0)))), 0.42/0.60 inference(ennf_transformation,[],[f17])). 0.42/0.60 fof(f17,plain,( 0.42/0.60 ! [X0,X1] : (subset(X0,X1) <=> ! [X2] : (member(X2,X0) => member(X2,X1)))), 0.42/0.60 inference(rectify,[],[f6])). 0.42/0.60 fof(f6,axiom,( 0.42/0.60 ! [X1,X2] : (subset(X1,X2) <=> ! [X0] : (member(X0,X1) => member(X0,X2)))), 0.42/0.60 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset)). 0.42/0.60 fof(f14747,plain,( 0.42/0.60 ~subset(empty_set,intersection(difference(sK1,sK0),sK0))), 0.42/0.60 inference(subsumption_resolution,[],[f14722,f540])). 0.42/0.60 fof(f540,plain,( 0.42/0.60 member(sK2(intersection(difference(sK1,sK0),sK0),empty_set),sK0) | ~subset(empty_set,intersection(difference(sK1,sK0),sK0))), 0.42/0.60 inference(resolution,[],[f124,f39])). 0.42/0.60 fof(f39,plain,( 0.42/0.60 ( ! [X2,X0,X1] : (member(X0,X2) | ~member(X0,intersection(X1,X2))) )), 0.42/0.60 inference(cnf_transformation,[],[f26])). 0.42/0.60 fof(f26,plain,( 0.42/0.60 ! [X0,X1,X2] : (((member(X0,X2) & member(X0,X1)) | ~member(X0,intersection(X1,X2))) & (member(X0,intersection(X1,X2)) | ~member(X0,X2) | ~member(X0,X1)))), 0.42/0.60 inference(flattening,[],[f25])). 0.42/0.60 fof(f25,plain,( 0.42/0.60 ! [X0,X1,X2] : (((member(X0,X2) & member(X0,X1)) | ~member(X0,intersection(X1,X2))) & (member(X0,intersection(X1,X2)) | (~member(X0,X2) | ~member(X0,X1))))), 0.42/0.60 inference(nnf_transformation,[],[f1])). 0.42/0.60 fof(f1,axiom,( 0.42/0.60 ! [X0,X1,X2] : ((member(X0,X2) & member(X0,X1)) <=> member(X0,intersection(X1,X2)))), 0.42/0.60 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection)). 0.42/0.60 fof(f124,plain,( 0.42/0.60 member(sK2(intersection(difference(sK1,sK0),sK0),empty_set),intersection(difference(sK1,sK0),sK0)) | ~subset(empty_set,intersection(difference(sK1,sK0),sK0))), 0.42/0.60 inference(resolution,[],[f49,f44])). 0.42/0.60 fof(f49,plain,( 0.42/0.60 ~subset(intersection(difference(sK1,sK0),sK0),empty_set) | ~subset(empty_set,intersection(difference(sK1,sK0),sK0))), 0.42/0.60 inference(resolution,[],[f34,f35])). 0.42/0.60 fof(f35,plain,( 0.42/0.60 ( ! [X0,X1] : (equal_set(X0,X1) | ~subset(X1,X0) | ~subset(X0,X1)) )), 0.42/0.60 inference(cnf_transformation,[],[f21])). 0.42/0.60 fof(f21,plain,( 0.42/0.60 ! [X0,X1] : (equal_set(X0,X1) | ~subset(X1,X0) | ~subset(X0,X1))), 0.42/0.60 inference(flattening,[],[f20])). 0.42/0.60 fof(f20,plain,( 0.42/0.60 ! [X0,X1] : (equal_set(X0,X1) | (~subset(X1,X0) | ~subset(X0,X1)))), 0.42/0.60 inference(ennf_transformation,[],[f18])). 0.42/0.60 fof(f18,plain,( 0.42/0.60 ! [X0,X1] : ((subset(X1,X0) & subset(X0,X1)) => equal_set(X0,X1))), 0.42/0.60 inference(unused_predicate_definition_removal,[],[f15])). 0.42/0.60 fof(f15,plain,( 0.42/0.60 ! [X0,X1] : ((subset(X1,X0) & subset(X0,X1)) <=> equal_set(X0,X1))), 0.42/0.60 inference(rectify,[],[f8])). 0.42/0.60 fof(f8,axiom,( 0.42/0.60 ! [X1,X2] : ((subset(X2,X1) & subset(X1,X2)) <=> equal_set(X1,X2))), 0.42/0.60 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_set)). 0.42/0.60 fof(f34,plain,( 0.42/0.60 ~equal_set(intersection(difference(sK1,sK0),sK0),empty_set)), 0.42/0.60 inference(cnf_transformation,[],[f24])). 0.42/0.60 fof(f24,plain,( 0.42/0.60 ~equal_set(intersection(difference(sK1,sK0),sK0),empty_set) & subset(sK0,sK1)), 0.42/0.60 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f19,f23])). 0.42/0.60 fof(f23,plain,( 0.42/0.60 ? [X0,X1] : (~equal_set(intersection(difference(X1,X0),X0),empty_set) & subset(X0,X1)) => (~equal_set(intersection(difference(sK1,sK0),sK0),empty_set) & subset(sK0,sK1))), 0.42/0.60 introduced(choice_axiom,[])). 0.42/0.60 fof(f19,plain,( 0.42/0.60 ? [X0,X1] : (~equal_set(intersection(difference(X1,X0),X0),empty_set) & subset(X0,X1))), 0.42/0.60 inference(ennf_transformation,[],[f14])). 0.42/0.60 fof(f14,plain,( 0.42/0.60 ~! [X0,X1] : (subset(X0,X1) => equal_set(intersection(difference(X1,X0),X0),empty_set))), 0.42/0.60 inference(rectify,[],[f13])). 0.42/0.60 fof(f13,negated_conjecture,( 0.42/0.60 ~! [X1,X4] : (subset(X1,X4) => equal_set(intersection(difference(X4,X1),X1),empty_set))), 0.42/0.60 inference(negated_conjecture,[],[f12])). 0.42/0.60 fof(f12,conjecture,( 0.42/0.60 ! [X1,X4] : (subset(X1,X4) => equal_set(intersection(difference(X4,X1),X1),empty_set))), 0.42/0.60 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI28)). 0.42/0.60 fof(f14722,plain,( 0.42/0.60 ~subset(empty_set,intersection(difference(sK1,sK0),sK0)) | ~member(sK2(intersection(difference(sK1,sK0),sK0),empty_set),sK0)), 0.42/0.60 inference(resolution,[],[f539,f41])). 0.42/0.60 fof(f41,plain,( 0.42/0.60 ( ! [X2,X0,X1] : (~member(X0,X1) | ~member(X0,difference(X2,X1))) )), 0.42/0.60 inference(cnf_transformation,[],[f28])). 0.42/0.60 fof(f28,plain,( 0.42/0.60 ! [X0,X1,X2] : ((member(X0,difference(X2,X1)) | member(X0,X1) | ~member(X0,X2)) & ((~member(X0,X1) & member(X0,X2)) | ~member(X0,difference(X2,X1))))), 0.42/0.60 inference(flattening,[],[f27])). 0.42/0.60 fof(f27,plain,( 0.42/0.60 ! [X0,X1,X2] : ((member(X0,difference(X2,X1)) | (member(X0,X1) | ~member(X0,X2))) & ((~member(X0,X1) & member(X0,X2)) | ~member(X0,difference(X2,X1))))), 0.42/0.60 inference(nnf_transformation,[],[f16])). 0.42/0.60 fof(f16,plain,( 0.42/0.60 ! [X0,X1,X2] : (member(X0,difference(X2,X1)) <=> (~member(X0,X1) & member(X0,X2)))), 0.42/0.60 inference(rectify,[],[f3])). 0.42/0.60 fof(f3,axiom,( 0.42/0.60 ! [X2,X1,X4] : (member(X2,difference(X4,X1)) <=> (~member(X2,X1) & member(X2,X4)))), 0.42/0.60 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference)). 0.42/0.60 fof(f539,plain,( 0.42/0.60 member(sK2(intersection(difference(sK1,sK0),sK0),empty_set),difference(sK1,sK0)) | ~subset(empty_set,intersection(difference(sK1,sK0),sK0))), 0.42/0.60 inference(resolution,[],[f124,f38])). 0.42/0.60 fof(f38,plain,( 0.42/0.60 ( ! [X2,X0,X1] : (member(X0,X1) | ~member(X0,intersection(X1,X2))) )), 0.42/0.60 inference(cnf_transformation,[],[f26])). 0.42/0.60 % SZS output end Proof for theBenchmark 0.42/0.60 % ------------------------------ 0.42/0.60 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 0.42/0.60 % Termination reason: Refutation 0.42/0.60 0.42/0.60 % Memory used [KB]: 3198 0.42/0.60 % Time elapsed: 0.222 s 0.42/0.60 % ------------------------------ 0.42/0.60 % ------------------------------ 0.42/0.60 % Success in time 0.281 s 0.44/0.60 EOF