0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.13 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s 0.13/0.33 % Computer : n029.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:11:39 EDT 2022 0.13/0.34 % 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/sandbox2/benchmark/theBenchmark.p 0.13/0.35 % (5228)Running in auto input_syntax mode. Trying TPTP 0.20/0.40 % (5233)dis+1002_6_add=large:afp=40000:afq=2.0:bsr=on:cond=on:irw=on:lma=on:nm=2:nwc=2.5:nicw=on:sp=reverse_arity:updr=off_7 on theBenchmark 0.20/0.40 % (5233)First to succeed. 0.20/0.40 % (5233)Refutation found. Thanks to Tanya! 0.20/0.40 % SZS status Theorem for theBenchmark 0.20/0.40 % SZS output start Proof for theBenchmark 0.20/0.40 fof(f226,plain,( 0.20/0.40 $false), 0.20/0.40 inference(subsumption_resolution,[],[f178,f214])). 0.20/0.40 fof(f214,plain,( 0.20/0.40 ( ! [X0] : (r1(X0)) )), 0.20/0.40 inference(subsumption_resolution,[],[f212,f178])). 0.20/0.40 fof(f212,plain,( 0.20/0.40 ( ! [X0] : (r1(X0) | r1(sK18(X0))) )), 0.20/0.40 inference(resolution,[],[f208,f150])). 0.20/0.40 fof(f150,plain,( 0.20/0.40 ( ! [X0] : (sP0(X0) | r1(X0)) )), 0.20/0.40 inference(resolution,[],[f149,f143])). 0.20/0.40 fof(f143,plain,( 0.20/0.40 ( ! [X0] : (sP1(X0) | r1(X0)) )), 0.20/0.40 inference(duplicate_literal_removal,[],[f142])). 0.20/0.40 fof(f142,plain,( 0.20/0.40 ( ! [X0] : (r1(X0) | sP1(X0) | sP1(X0)) )), 0.20/0.40 inference(superposition,[],[f93,f92])). 0.20/0.40 fof(f92,plain,( 0.20/0.40 ( ! [X0] : (sK9(X0) = X0 | sP1(X0)) )), 0.20/0.40 inference(cnf_transformation,[],[f48])). 0.20/0.40 fof(f48,plain,( 0.20/0.40 ! [X0] : ((r1(sK9(X0)) & sK9(X0) = X0) | sP1(X0))), 0.20/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f28,f47])). 0.20/0.40 fof(f47,plain,( 0.20/0.40 ! [X0] : (? [X1] : (r1(X1) & X0 = X1) => (r1(sK9(X0)) & sK9(X0) = X0))), 0.20/0.40 introduced(choice_axiom,[])). 0.20/0.40 fof(f28,plain,( 0.20/0.40 ! [X0] : (? [X1] : (r1(X1) & X0 = X1) | sP1(X0))), 0.20/0.40 inference(definition_folding,[],[f25,f27,f26])). 0.20/0.40 fof(f26,plain,( 0.20/0.40 ! [X2] : (? [X3] : (r2(X3,X2) & r1(X3)) | ~sP0(X2))), 0.20/0.40 introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])])). 0.20/0.40 fof(f27,plain,( 0.20/0.40 ! [X0] : (? [X2] : (sP0(X2) & X0 = X2) | ~sP1(X0))), 0.20/0.40 introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])])). 0.20/0.40 fof(f25,plain,( 0.20/0.40 ! [X0] : (? [X1] : (r1(X1) & X0 = X1) | ? [X2] : (? [X3] : (r2(X3,X2) & r1(X3)) & X0 = X2))), 0.20/0.40 inference(ennf_transformation,[],[f14])). 0.20/0.40 fof(f14,plain,( 0.20/0.40 ~? [X0] : (! [X1] : (~r1(X1) | X0 != X1) & ! [X2] : (! [X3] : (~r2(X3,X2) | ~r1(X3)) | X0 != X2))), 0.20/0.40 inference(rectify,[],[f13])). 0.20/0.40 fof(f13,negated_conjecture,( 0.20/0.40 ~? [X27] : (! [X11] : (~r1(X11) | X11 != X27) & ! [X5] : (! [X6] : (~r2(X6,X5) | ~r1(X6)) | X5 != X27))), 0.20/0.40 inference(negated_conjecture,[],[f12])). 0.20/0.40 fof(f12,conjecture,( 0.20/0.40 ? [X27] : (! [X11] : (~r1(X11) | X11 != X27) & ! [X5] : (! [X6] : (~r2(X6,X5) | ~r1(X6)) | X5 != X27))), 0.20/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nonzerosnononesexist)). 0.20/0.40 fof(f93,plain,( 0.20/0.40 ( ! [X0] : (r1(sK9(X0)) | sP1(X0)) )), 0.20/0.40 inference(cnf_transformation,[],[f48])). 0.20/0.40 fof(f149,plain,( 0.20/0.40 ( ! [X0] : (~sP1(X0) | sP0(X0)) )), 0.20/0.40 inference(duplicate_literal_removal,[],[f148])). 0.20/0.40 fof(f148,plain,( 0.20/0.40 ( ! [X0] : (sP0(X0) | ~sP1(X0) | ~sP1(X0)) )), 0.20/0.40 inference(superposition,[],[f89,f88])). 0.20/0.40 fof(f88,plain,( 0.20/0.40 ( ! [X0] : (sK7(X0) = X0 | ~sP1(X0)) )), 0.20/0.40 inference(cnf_transformation,[],[f42])). 0.20/0.40 fof(f42,plain,( 0.20/0.40 ! [X0] : ((sP0(sK7(X0)) & sK7(X0) = X0) | ~sP1(X0))), 0.20/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f40,f41])). 0.20/0.40 fof(f41,plain,( 0.20/0.40 ! [X0] : (? [X1] : (sP0(X1) & X0 = X1) => (sP0(sK7(X0)) & sK7(X0) = X0))), 0.20/0.40 introduced(choice_axiom,[])). 0.20/0.40 fof(f40,plain,( 0.20/0.40 ! [X0] : (? [X1] : (sP0(X1) & X0 = X1) | ~sP1(X0))), 0.20/0.40 inference(rectify,[],[f39])). 0.20/0.40 fof(f39,plain,( 0.20/0.40 ! [X0] : (? [X2] : (sP0(X2) & X0 = X2) | ~sP1(X0))), 0.20/0.40 inference(nnf_transformation,[],[f27])). 0.20/0.40 fof(f89,plain,( 0.20/0.40 ( ! [X0] : (sP0(sK7(X0)) | ~sP1(X0)) )), 0.20/0.40 inference(cnf_transformation,[],[f42])). 0.20/0.40 fof(f208,plain,( 0.20/0.40 ( ! [X1] : (~sP0(sK18(X1)) | r1(X1)) )), 0.20/0.40 inference(duplicate_literal_removal,[],[f207])). 0.20/0.40 fof(f207,plain,( 0.20/0.40 ( ! [X1] : (r1(X1) | ~sP0(sK18(X1)) | ~sP0(sK18(X1))) )), 0.20/0.40 inference(superposition,[],[f90,f196])). 0.20/0.40 fof(f196,plain,( 0.20/0.40 ( ! [X1] : (sK8(sK18(X1)) = X1 | ~sP0(sK18(X1))) )), 0.20/0.40 inference(resolution,[],[f190,f91])). 0.20/0.40 fof(f91,plain,( 0.20/0.40 ( ! [X0] : (r2(sK8(X0),X0) | ~sP0(X0)) )), 0.20/0.40 inference(cnf_transformation,[],[f46])). 0.20/0.40 fof(f46,plain,( 0.20/0.40 ! [X0] : ((r2(sK8(X0),X0) & r1(sK8(X0))) | ~sP0(X0))), 0.20/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f44,f45])). 0.20/0.40 fof(f45,plain,( 0.20/0.40 ! [X0] : (? [X1] : (r2(X1,X0) & r1(X1)) => (r2(sK8(X0),X0) & r1(sK8(X0))))), 0.20/0.40 introduced(choice_axiom,[])). 0.20/0.40 fof(f44,plain,( 0.20/0.40 ! [X0] : (? [X1] : (r2(X1,X0) & r1(X1)) | ~sP0(X0))), 0.20/0.40 inference(rectify,[],[f43])). 0.20/0.40 fof(f43,plain,( 0.20/0.40 ! [X2] : (? [X3] : (r2(X3,X2) & r1(X3)) | ~sP0(X2))), 0.20/0.40 inference(nnf_transformation,[],[f26])). 0.20/0.40 fof(f190,plain,( 0.20/0.40 ( ! [X6,X7] : (~r2(X6,sK18(X7)) | X6 = X7) )), 0.20/0.40 inference(resolution,[],[f137,f176])). 0.20/0.40 fof(f176,plain,( 0.20/0.40 ( ! [X0] : (r2(X0,sK18(X0))) )), 0.20/0.40 inference(resolution,[],[f108,f136])). 0.20/0.40 fof(f136,plain,( 0.20/0.40 ( ! [X2,X1] : (~sP3(X1,X1,X2)) )), 0.20/0.40 inference(equality_resolution,[],[f106])). 0.20/0.40 fof(f106,plain,( 0.20/0.40 ( ! [X2,X0,X1] : (X0 != X1 | ~sP3(X0,X1,X2)) )), 0.20/0.40 inference(cnf_transformation,[],[f63])). 0.20/0.40 fof(f63,plain,( 0.20/0.40 ! [X0,X1,X2] : ((X0 != X1 & ~r2(X2,X0)) | ~sP3(X0,X1,X2))), 0.20/0.40 inference(rectify,[],[f62])). 0.20/0.40 fof(f62,plain,( 0.20/0.40 ! [X2,X1,X0] : ((X1 != X2 & ~r2(X0,X2)) | ~sP3(X2,X1,X0))), 0.20/0.40 inference(nnf_transformation,[],[f31])). 0.20/0.40 fof(f31,plain,( 0.20/0.40 ! [X2,X1,X0] : ((X1 != X2 & ~r2(X0,X2)) | ~sP3(X2,X1,X0))), 0.20/0.40 introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])])). 0.20/0.40 fof(f108,plain,( 0.20/0.40 ( ! [X2,X0] : (sP3(X2,sK18(X0),X0) | r2(X0,X2)) )), 0.20/0.40 inference(cnf_transformation,[],[f65])). 0.20/0.40 fof(f65,plain,( 0.20/0.40 ! [X0] : ! [X2] : ((r2(X0,X2) & sK18(X0) = X2) | sP3(X2,sK18(X0),X0))), 0.20/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK18])],[f32,f64])). 0.20/0.40 fof(f64,plain,( 0.20/0.40 ! [X0] : (? [X1] : ! [X2] : ((r2(X0,X2) & X1 = X2) | sP3(X2,X1,X0)) => ! [X2] : ((r2(X0,X2) & sK18(X0) = X2) | sP3(X2,sK18(X0),X0)))), 0.20/0.40 introduced(choice_axiom,[])). 0.20/0.40 fof(f32,plain,( 0.20/0.40 ! [X0] : ? [X1] : ! [X2] : ((r2(X0,X2) & X1 = X2) | sP3(X2,X1,X0))), 0.20/0.40 inference(definition_folding,[],[f1,f31])). 0.20/0.40 fof(f1,axiom,( 0.20/0.40 ! [X0] : ? [X1] : ! [X2] : ((r2(X0,X2) & X1 = X2) | (X1 != X2 & ~r2(X0,X2)))), 0.20/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2)). 0.20/0.40 fof(f137,plain,( 0.20/0.40 ( ! [X3,X0,X1] : (~r2(X1,X3) | ~r2(X0,X3) | X0 = X1) )), 0.20/0.40 inference(equality_resolution,[],[f109])). 0.20/0.40 fof(f109,plain,( 0.20/0.40 ( ! [X2,X3,X0,X1] : (~r2(X1,X2) | X2 != X3 | ~r2(X0,X3) | X0 = X1) )), 0.20/0.40 inference(cnf_transformation,[],[f18])). 0.20/0.40 fof(f18,plain,( 0.20/0.40 ! [X0,X1] : (! [X2] : (~r2(X1,X2) | ! [X3] : (X2 != X3 | ~r2(X0,X3))) | X0 = X1)), 0.20/0.40 inference(rectify,[],[f6])). 0.20/0.40 fof(f6,axiom,( 0.20/0.40 ! [X22,X23] : (! [X24] : (~r2(X23,X24) | ! [X25] : (X24 != X25 | ~r2(X22,X25))) | X22 = X23)), 0.20/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3a)). 0.20/0.40 fof(f90,plain,( 0.20/0.40 ( ! [X0] : (r1(sK8(X0)) | ~sP0(X0)) )), 0.20/0.40 inference(cnf_transformation,[],[f46])). 0.20/0.40 fof(f178,plain,( 0.20/0.40 ( ! [X0] : (~r1(sK18(X0))) )), 0.20/0.40 inference(resolution,[],[f176,f138])). 0.20/0.40 fof(f138,plain,( 0.20/0.40 ( ! [X2,X0] : (~r2(X0,X2) | ~r1(X2)) )), 0.20/0.40 inference(equality_resolution,[],[f110])). 0.20/0.40 fof(f110,plain,( 0.20/0.40 ( ! [X2,X0,X1] : (~r2(X0,X1) | X1 != X2 | ~r1(X2)) )), 0.20/0.40 inference(cnf_transformation,[],[f19])). 0.20/0.40 fof(f19,plain,( 0.20/0.40 ! [X0,X1] : (~r2(X0,X1) | ! [X2] : (X1 != X2 | ~r1(X2)))), 0.20/0.40 inference(rectify,[],[f5])). 0.20/0.40 fof(f5,axiom,( 0.20/0.40 ! [X19,X20] : (~r2(X19,X20) | ! [X21] : (X20 != X21 | ~r1(X21)))), 0.20/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7a)). 0.20/0.40 % SZS output end Proof for theBenchmark 0.20/0.40 % (5233)------------------------------ 0.20/0.40 % (5233)Version: Vampire 4.7 (commit 2d02e4655 on 2022-07-11 21:15:24 +0200) 0.20/0.40 % (5233)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 0.20/0.40 % (5233)Termination reason: Refutation 0.20/0.40 0.20/0.40 % (5233)Memory used [KB]: 6396 0.20/0.40 % (5233)Time elapsed: 0.007 s 0.20/0.40 % (5233)------------------------------ 0.20/0.40 % (5233)------------------------------ 0.20/0.40 % (5228)Success in time 0.054 s 0.20/0.40 EOF