0.06/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s 0.13/0.33 % Computer : n012.cluster.edu 0.13/0.33 % Model : x86_64 x86_64 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.33 % Memory : 8042.1875MB 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.33 % CPULimit : 960 0.13/0.33 % WCLimit : 120 0.13/0.33 % DateTime : Tue Aug 9 02:13:44 EDT 2022 0.13/0.33 % CPUTime : 0.13/0.34 This is a FOF_ problem 0.13/0.34 Running vampire --ignore_missing on --mode casc -t 960 /export/starexec/sandbox/benchmark/theBenchmark.p 0.13/0.34 % (29858)Running in auto input_syntax mode. Trying TPTP 0.20/0.38 % (29866)lrs+11_20_av=off:bs=unit_only:bsr=on:bce=on:cond=on:fde=none:gs=on:gsem=on:irw=on:nm=4:nwc=1:stl=30:sos=theory:sp=reverse_arity:uhcvi=on_3 on theBenchmark 0.20/0.40 % (29861)dis+2_2:1_aac=none:afp=100000:afq=1.1:amm=sco:anc=none:bsr=on:fsr=off:gs=on:gsem=on:lcm=reverse:lma=on:nm=64:nwc=1:sos=on_6 on theBenchmark 0.20/0.40 % (29859)lrs-11_12_av=off:nm=32:nwc=1.3:stl=30:sd=3:ss=axioms:sos=all_2 on theBenchmark 0.20/0.40 % (29864)lrs+11_128_av=off:bsr=on:cond=on:gs=on:lcm=reverse:lma=on:nm=32:nwc=1:stl=30:sd=5:ss=axioms:st=3.0_1 on theBenchmark 0.20/0.40 % (29863)lrs+1011_5_add=large:afp=1000:afq=1.2:anc=none:fsr=off:irw=on:lma=on:nm=64:newcnf=on:nwc=1:stl=30:sd=3:ss=axioms:st=2.0:sos=on:sac=on:sp=reverse_arity:urr=on:updr=off_10 on theBenchmark 0.20/0.40 % (29862)dis+1011_24_add=large:afr=on:afp=4000:afq=1.0:anc=none:bs=unit_only:bce=on:cond=fast:gs=on:nm=32:nwc=2.5:nicw=on:sp=occurrence:updr=off_39 on theBenchmark 0.20/0.40 % (29860)lrs+2_3:1_add=large:afr=on:afp=10000:afq=1.1:amm=off:anc=none:er=known:fde=unused:gs=on:gsaa=from_current:gsem=on:lma=on:nm=32:newcnf=on:nwc=4:sas=z3:stl=30:sd=1:ss=axioms:st=5.0:sac=on:sp=occurrence:updr=off_2 on theBenchmark 0.20/0.41 % (29861)Refutation not found, incomplete strategy% (29861)------------------------------ 0.20/0.41 % (29861)Version: Vampire 4.7 (commit 2d02e4655 on 2022-07-11 21:15:24 +0200) 0.20/0.41 % (29861)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 0.20/0.41 WARNING Broken Constraint: if sat_solver(z3) has been set then avatar(off) is equal to on 0.20/0.41 % (29861)Termination reason: Refutation not found, incomplete strategy 0.20/0.41 0.20/0.41 % (29861)Memory used [KB]: 10874 0.20/0.41 % (29861)Time elapsed: 0.004 s 0.20/0.41 % (29861)------------------------------ 0.20/0.41 % (29861)------------------------------ 0.20/0.41 % (29865)ott+11_16_av=off:gs=on:gsem=on:irw=on:lma=on:nm=64:newcnf=on:nwc=1.3:sas=z3:sp=reverse_arity_14 on theBenchmark 0.20/0.41 % (29859)First to succeed. 0.20/0.41 % (29862)Also succeeded, but the first one will report. 0.20/0.41 % (29859)Refutation found. Thanks to Tanya! 0.20/0.41 % SZS status Theorem for theBenchmark 0.20/0.41 % SZS output start Proof for theBenchmark 0.20/0.41 fof(f235,plain,( 0.20/0.41 $false), 0.20/0.41 inference(subsumption_resolution,[],[f234,f105])). 0.20/0.41 fof(f105,plain,( 0.20/0.41 member(sK3(union(sK1,sK2),sK0),sK0)), 0.20/0.41 inference(resolution,[],[f98,f28])). 0.20/0.41 fof(f28,plain,( 0.20/0.41 ( ! [X0,X1] : (member(sK3(X0,X1),X1) | ~intersect(X0,X1)) )), 0.20/0.41 inference(cnf_transformation,[],[f19])). 0.20/0.41 fof(f19,plain,( 0.20/0.41 ! [X0,X1] : (((member(sK3(X0,X1),X1) & member(sK3(X0,X1),X0)) | ~intersect(X0,X1)) & (intersect(X0,X1) | ! [X3] : (~member(X3,X1) | ~member(X3,X0))))), 0.20/0.41 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f17,f18])). 0.20/0.41 fof(f18,plain,( 0.20/0.41 ! [X0,X1] : (? [X2] : (member(X2,X1) & member(X2,X0)) => (member(sK3(X0,X1),X1) & member(sK3(X0,X1),X0)))), 0.20/0.41 introduced(choice_axiom,[])). 0.20/0.41 fof(f17,plain,( 0.20/0.41 ! [X0,X1] : ((? [X2] : (member(X2,X1) & member(X2,X0)) | ~intersect(X0,X1)) & (intersect(X0,X1) | ! [X3] : (~member(X3,X1) | ~member(X3,X0))))), 0.20/0.41 inference(rectify,[],[f16])). 0.20/0.41 fof(f16,plain,( 0.20/0.41 ! [X0,X1] : ((? [X2] : (member(X2,X1) & member(X2,X0)) | ~intersect(X0,X1)) & (intersect(X0,X1) | ! [X2] : (~member(X2,X1) | ~member(X2,X0))))), 0.20/0.41 inference(nnf_transformation,[],[f4])). 0.20/0.41 fof(f4,axiom,( 0.20/0.41 ! [X0,X1] : (? [X2] : (member(X2,X1) & member(X2,X0)) <=> intersect(X0,X1))), 0.20/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn)). 0.20/0.41 fof(f98,plain,( 0.20/0.41 intersect(union(sK1,sK2),sK0)), 0.20/0.41 inference(resolution,[],[f90,f29])). 0.20/0.41 fof(f29,plain,( 0.20/0.41 ( ! [X0,X1] : (intersect(X1,X0) | ~intersect(X0,X1)) )), 0.20/0.41 inference(cnf_transformation,[],[f9])). 0.20/0.41 fof(f9,plain,( 0.20/0.41 ! [X0,X1] : (intersect(X1,X0) | ~intersect(X0,X1))), 0.20/0.41 inference(ennf_transformation,[],[f3])). 0.20/0.41 fof(f3,axiom,( 0.20/0.41 ! [X0,X1] : (intersect(X0,X1) => intersect(X1,X0))), 0.20/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_intersect)). 0.20/0.41 fof(f90,plain,( 0.20/0.41 intersect(sK0,union(sK1,sK2))), 0.20/0.41 inference(resolution,[],[f89,f56])). 0.20/0.41 fof(f56,plain,( 0.20/0.41 intersect(sK0,sK1) | intersect(sK0,union(sK1,sK2))), 0.20/0.41 inference(resolution,[],[f55,f20])). 0.20/0.41 fof(f20,plain,( 0.20/0.41 intersect(sK0,sK2) | intersect(sK0,sK1) | intersect(sK0,union(sK1,sK2))), 0.20/0.41 inference(cnf_transformation,[],[f13])). 0.20/0.41 fof(f13,plain,( 0.20/0.41 (~intersect(sK0,union(sK1,sK2)) | (~intersect(sK0,sK1) & ~intersect(sK0,sK2))) & (intersect(sK0,union(sK1,sK2)) | intersect(sK0,sK1) | intersect(sK0,sK2))), 0.20/0.41 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f11,f12])). 0.20/0.41 fof(f12,plain,( 0.20/0.41 ? [X0,X1,X2] : ((~intersect(X0,union(X1,X2)) | (~intersect(X0,X1) & ~intersect(X0,X2))) & (intersect(X0,union(X1,X2)) | intersect(X0,X1) | intersect(X0,X2))) => ((~intersect(sK0,union(sK1,sK2)) | (~intersect(sK0,sK1) & ~intersect(sK0,sK2))) & (intersect(sK0,union(sK1,sK2)) | intersect(sK0,sK1) | intersect(sK0,sK2)))), 0.20/0.41 introduced(choice_axiom,[])). 0.20/0.41 fof(f11,plain,( 0.20/0.41 ? [X0,X1,X2] : ((~intersect(X0,union(X1,X2)) | (~intersect(X0,X1) & ~intersect(X0,X2))) & (intersect(X0,union(X1,X2)) | intersect(X0,X1) | intersect(X0,X2)))), 0.20/0.41 inference(flattening,[],[f10])). 0.20/0.41 fof(f10,plain,( 0.20/0.41 ? [X0,X1,X2] : ((~intersect(X0,union(X1,X2)) | (~intersect(X0,X1) & ~intersect(X0,X2))) & (intersect(X0,union(X1,X2)) | (intersect(X0,X1) | intersect(X0,X2))))), 0.20/0.41 inference(nnf_transformation,[],[f8])). 0.20/0.41 fof(f8,plain,( 0.20/0.41 ? [X0,X1,X2] : ((intersect(X0,X1) | intersect(X0,X2)) <~> intersect(X0,union(X1,X2)))), 0.20/0.41 inference(ennf_transformation,[],[f2])). 0.20/0.41 fof(f2,negated_conjecture,( 0.20/0.41 ~! [X0,X1,X2] : ((intersect(X0,X1) | intersect(X0,X2)) <=> intersect(X0,union(X1,X2)))), 0.20/0.41 inference(negated_conjecture,[],[f1])). 0.20/0.41 fof(f1,conjecture,( 0.20/0.41 ! [X0,X1,X2] : ((intersect(X0,X1) | intersect(X0,X2)) <=> intersect(X0,union(X1,X2)))), 0.20/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersect_with_union)). 0.20/0.41 fof(f55,plain,( 0.20/0.41 ~intersect(sK0,sK2)), 0.20/0.41 inference(duplicate_literal_removal,[],[f52])). 0.20/0.41 fof(f52,plain,( 0.20/0.41 ~intersect(sK0,sK2) | ~intersect(sK0,sK2)), 0.20/0.41 inference(resolution,[],[f50,f27])). 0.20/0.41 fof(f27,plain,( 0.20/0.41 ( ! [X0,X1] : (member(sK3(X0,X1),X0) | ~intersect(X0,X1)) )), 0.20/0.41 inference(cnf_transformation,[],[f19])). 0.20/0.41 fof(f50,plain,( 0.20/0.41 ( ! [X4] : (~member(sK3(X4,sK2),sK0) | ~intersect(X4,sK2)) )), 0.20/0.41 inference(resolution,[],[f47,f28])). 0.20/0.41 fof(f47,plain,( 0.20/0.41 ( ! [X1] : (~member(X1,sK2) | ~member(X1,sK0)) )), 0.20/0.41 inference(subsumption_resolution,[],[f42,f26])). 0.20/0.41 fof(f26,plain,( 0.20/0.41 ( ! [X3,X0,X1] : (intersect(X0,X1) | ~member(X3,X1) | ~member(X3,X0)) )), 0.20/0.41 inference(cnf_transformation,[],[f19])). 0.20/0.41 fof(f42,plain,( 0.20/0.41 ( ! [X1] : (~intersect(sK0,sK2) | ~member(X1,sK0) | ~member(X1,sK2)) )), 0.20/0.41 inference(resolution,[],[f31,f25])). 0.20/0.41 fof(f25,plain,( 0.20/0.41 ( ! [X2,X0,X1] : (member(X2,union(X0,X1)) | ~member(X2,X1)) )), 0.20/0.41 inference(cnf_transformation,[],[f15])). 0.20/0.41 fof(f15,plain,( 0.20/0.41 ! [X0,X1,X2] : ((member(X2,union(X0,X1)) | (~member(X2,X1) & ~member(X2,X0))) & (member(X2,X1) | member(X2,X0) | ~member(X2,union(X0,X1))))), 0.20/0.41 inference(flattening,[],[f14])). 0.20/0.41 fof(f14,plain,( 0.20/0.41 ! [X0,X1,X2] : ((member(X2,union(X0,X1)) | (~member(X2,X1) & ~member(X2,X0))) & ((member(X2,X1) | member(X2,X0)) | ~member(X2,union(X0,X1))))), 0.20/0.41 inference(nnf_transformation,[],[f7])). 0.20/0.41 fof(f7,axiom,( 0.20/0.41 ! [X0,X1,X2] : (member(X2,union(X0,X1)) <=> (member(X2,X1) | member(X2,X0)))), 0.20/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn)). 0.20/0.41 fof(f31,plain,( 0.20/0.41 ( ! [X0] : (~member(X0,union(sK1,sK2)) | ~intersect(sK0,sK2) | ~member(X0,sK0)) )), 0.20/0.41 inference(resolution,[],[f21,f26])). 0.20/0.41 fof(f21,plain,( 0.20/0.41 ~intersect(sK0,union(sK1,sK2)) | ~intersect(sK0,sK2)), 0.20/0.41 inference(cnf_transformation,[],[f13])). 0.20/0.41 fof(f89,plain,( 0.20/0.41 ~intersect(sK0,sK1)), 0.20/0.41 inference(duplicate_literal_removal,[],[f86])). 0.20/0.41 fof(f86,plain,( 0.20/0.41 ~intersect(sK0,sK1) | ~intersect(sK0,sK1)), 0.20/0.41 inference(resolution,[],[f84,f27])). 0.20/0.41 fof(f84,plain,( 0.20/0.41 ( ! [X4] : (~member(sK3(X4,sK1),sK0) | ~intersect(X4,sK1)) )), 0.20/0.41 inference(resolution,[],[f81,f28])). 0.20/0.41 fof(f81,plain,( 0.20/0.41 ( ! [X0] : (~member(X0,sK1) | ~member(X0,sK0)) )), 0.20/0.41 inference(subsumption_resolution,[],[f75,f26])). 0.20/0.41 fof(f75,plain,( 0.20/0.41 ( ! [X0] : (~intersect(sK0,sK1) | ~member(X0,sK0) | ~member(X0,sK1)) )), 0.20/0.41 inference(resolution,[],[f33,f24])). 0.20/0.41 fof(f24,plain,( 0.20/0.41 ( ! [X2,X0,X1] : (member(X2,union(X0,X1)) | ~member(X2,X0)) )), 0.20/0.41 inference(cnf_transformation,[],[f15])). 0.20/0.41 fof(f33,plain,( 0.20/0.41 ( ! [X0] : (~member(X0,union(sK1,sK2)) | ~intersect(sK0,sK1) | ~member(X0,sK0)) )), 0.20/0.41 inference(resolution,[],[f22,f26])). 0.20/0.41 fof(f22,plain,( 0.20/0.41 ~intersect(sK0,union(sK1,sK2)) | ~intersect(sK0,sK1)), 0.20/0.41 inference(cnf_transformation,[],[f13])). 0.20/0.41 fof(f234,plain,( 0.20/0.41 ~member(sK3(union(sK1,sK2),sK0),sK0)), 0.20/0.41 inference(subsumption_resolution,[],[f230,f197])). 0.20/0.41 fof(f197,plain,( 0.20/0.41 ~member(sK3(union(sK1,sK2),sK0),sK1)), 0.20/0.41 inference(resolution,[],[f110,f89])). 0.20/0.41 fof(f110,plain,( 0.20/0.41 ( ! [X0] : (intersect(sK0,X0) | ~member(sK3(union(sK1,sK2),sK0),X0)) )), 0.20/0.41 inference(resolution,[],[f105,f26])). 0.20/0.41 fof(f230,plain,( 0.20/0.41 member(sK3(union(sK1,sK2),sK0),sK1) | ~member(sK3(union(sK1,sK2),sK0),sK0)), 0.20/0.41 inference(resolution,[],[f49,f104])). 0.20/0.41 fof(f104,plain,( 0.20/0.41 member(sK3(union(sK1,sK2),sK0),union(sK1,sK2))), 0.20/0.41 inference(resolution,[],[f98,f27])). 0.20/0.41 fof(f49,plain,( 0.20/0.41 ( ! [X2,X3] : (~member(X2,union(X3,sK2)) | member(X2,X3) | ~member(X2,sK0)) )), 0.20/0.41 inference(resolution,[],[f47,f23])). 0.20/0.41 fof(f23,plain,( 0.20/0.41 ( ! [X2,X0,X1] : (member(X2,X1) | member(X2,X0) | ~member(X2,union(X0,X1))) )), 0.20/0.41 inference(cnf_transformation,[],[f15])). 0.20/0.41 % SZS output end Proof for theBenchmark 0.20/0.41 % (29859)------------------------------ 0.20/0.41 % (29859)Version: Vampire 4.7 (commit 2d02e4655 on 2022-07-11 21:15:24 +0200) 0.20/0.41 % (29859)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 0.20/0.41 % (29859)Termination reason: Refutation 0.20/0.41 0.20/0.41 % (29859)Memory used [KB]: 2046 0.20/0.41 % (29859)Time elapsed: 0.010 s 0.20/0.41 % (29859)------------------------------ 0.20/0.41 % (29859)------------------------------ 0.20/0.41 % (29858)Success in time 0.07 s 0.20/0.42 EOF