0.02/0.08 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.09 % Command : vampire --mode casc -t %d %s 0.09/0.27 % Computer : n032.cluster.edu 0.09/0.27 % Model : x86_64 x86_64 0.09/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.27 % Memory : 8042.1875MB 0.09/0.27 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.27 % CPULimit : 960 0.09/0.27 % DateTime : Thu Jul 2 08:15:19 EDT 2020 0.09/0.28 % CPUTime : 0.13/0.34 % ott+11_2:1_add=large:afp=40000:afq=2.0:amm=sco:anc=none:br=off:cond=on:irw=on:nwc=1:sd=2:ss=axioms:st=2.0:sos=all:urr=on:updr=off_3 on theBenchmark 0.78/0.93 % Time limit reached! 0.78/0.93 % ------------------------------ 0.78/0.93 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 0.78/0.93 % Termination reason: Time limit 0.78/0.93 % Termination phase: Saturation 0.78/0.93 0.78/0.93 % Memory used [KB]: 33517 0.78/0.93 % Time elapsed: 0.600 s 0.78/0.93 % ------------------------------ 0.78/0.93 % ------------------------------ 0.78/0.97 % dis+1010_10_afr=on:afp=100000:afq=2.0:amm=sco:anc=none:ep=RS:fde=unused:gs=on:nwc=1:sos=on:sac=on:sp=occurrence_2 on theBenchmark 0.78/0.98 % Refutation not found, incomplete strategy 0.78/0.98 % ------------------------------ 0.78/0.98 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 0.78/0.98 % Termination reason: Refutation not found, incomplete strategy 0.78/0.98 0.78/0.98 % Memory used [KB]: 10234 0.78/0.98 % Time elapsed: 0.008 s 0.78/0.98 % ------------------------------ 0.78/0.98 % ------------------------------ 0.78/1.01 % ott+1010_5:4_av=off:bd=off:fde=none:irw=on:lma=on:nm=32:nwc=2.5:sd=2:ss=axioms:st=3.0:urr=on_5 on theBenchmark 0.82/1.02 % Refutation found. Thanks to Tanya! 0.82/1.02 % SZS status Theorem for theBenchmark 0.82/1.02 % SZS output start Proof for theBenchmark 0.82/1.02 fof(f1367,plain,( 0.82/1.02 $false), 0.82/1.02 inference(subsumption_resolution,[],[f1346,f677])). 0.82/1.02 fof(f677,plain,( 0.82/1.02 memberP(nil,sK4(sK5,nil,nil))), 0.82/1.02 inference(subsumption_resolution,[],[f676,f231])). 0.82/1.02 fof(f231,plain,( 0.82/1.02 nil != sK0), 0.82/1.02 inference(cnf_transformation,[],[f169])). 0.82/1.02 fof(f169,plain,( 0.82/1.02 (((nil != sK0 & ! [X4] : (! [X5] : (~ssList(X5) | ! [X6] : (~ssList(X6) | app(app(X5,cons(X4,nil)),X6) != sK0 | (memberP(X6,sK4(X4,X5,X6)) & ~leq(X4,sK4(X4,X5,X6)) & lt(X4,sK4(X4,X5,X6)) & memberP(X5,sK4(X4,X5,X6)) & ssItem(sK4(X4,X5,X6))))) | ~ssItem(X4)) & ((nil = sK2 & nil = sK3) | (cons(sK5,nil) = sK2 & ! [X9] : (~ssItem(X9) | ~leq(sK5,X9) | ~memberP(sK3,X9) | sK5 = X9) & memberP(sK3,sK5) & ssItem(sK5))) & sK0 = sK2 & sK1 = sK3 & ssList(sK3)) & ssList(sK2)) & ssList(sK1)) & ssList(sK0)), 0.82/1.02 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f100,f168,f167,f166,f165,f164,f163])). 0.82/1.02 fof(f163,plain,( 0.82/1.02 ? [X0] : (? [X1] : (? [X2] : (? [X3] : (nil != X0 & ! [X4] : (! [X5] : (~ssList(X5) | ! [X6] : (~ssList(X6) | app(app(X5,cons(X4,nil)),X6) != X0 | ? [X7] : (memberP(X6,X7) & ~leq(X4,X7) & lt(X4,X7) & memberP(X5,X7) & ssItem(X7)))) | ~ssItem(X4)) & ((nil = X2 & nil = X3) | ? [X8] : (cons(X8,nil) = X2 & ! [X9] : (~ssItem(X9) | ~leq(X8,X9) | ~memberP(X3,X9) | X8 = X9) & memberP(X3,X8) & ssItem(X8))) & X0 = X2 & X1 = X3 & ssList(X3)) & ssList(X2)) & ssList(X1)) & ssList(X0)) => (? [X1] : (? [X2] : (? [X3] : (nil != sK0 & ! [X4] : (! [X5] : (~ssList(X5) | ! [X6] : (~ssList(X6) | app(app(X5,cons(X4,nil)),X6) != sK0 | ? [X7] : (memberP(X6,X7) & ~leq(X4,X7) & lt(X4,X7) & memberP(X5,X7) & ssItem(X7)))) | ~ssItem(X4)) & ((nil = X2 & nil = X3) | ? [X8] : (cons(X8,nil) = X2 & ! [X9] : (~ssItem(X9) | ~leq(X8,X9) | ~memberP(X3,X9) | X8 = X9) & memberP(X3,X8) & ssItem(X8))) & sK0 = X2 & X1 = X3 & ssList(X3)) & ssList(X2)) & ssList(X1)) & ssList(sK0))), 0.82/1.02 introduced(choice_axiom,[])). 0.82/1.02 fof(f164,plain,( 0.82/1.02 ( ! [X0] : (? [X1] : (? [X2] : (? [X3] : (nil != X0 & ! [X4] : (! [X5] : (~ssList(X5) | ! [X6] : (~ssList(X6) | app(app(X5,cons(X4,nil)),X6) != X0 | ? [X7] : (memberP(X6,X7) & ~leq(X4,X7) & lt(X4,X7) & memberP(X5,X7) & ssItem(X7)))) | ~ssItem(X4)) & ((nil = X2 & nil = X3) | ? [X8] : (cons(X8,nil) = X2 & ! [X9] : (~ssItem(X9) | ~leq(X8,X9) | ~memberP(X3,X9) | X8 = X9) & memberP(X3,X8) & ssItem(X8))) & X0 = X2 & X1 = X3 & ssList(X3)) & ssList(X2)) & ssList(X1)) => (? [X2] : (? [X3] : (nil != X0 & ! [X4] : (! [X5] : (~ssList(X5) | ! [X6] : (~ssList(X6) | app(app(X5,cons(X4,nil)),X6) != X0 | ? [X7] : (memberP(X6,X7) & ~leq(X4,X7) & lt(X4,X7) & memberP(X5,X7) & ssItem(X7)))) | ~ssItem(X4)) & ((nil = X2 & nil = X3) | ? [X8] : (cons(X8,nil) = X2 & ! [X9] : (~ssItem(X9) | ~leq(X8,X9) | ~memberP(X3,X9) | X8 = X9) & memberP(X3,X8) & ssItem(X8))) & X0 = X2 & sK1 = X3 & ssList(X3)) & ssList(X2)) & ssList(sK1))) )), 0.82/1.02 introduced(choice_axiom,[])). 0.82/1.02 fof(f165,plain,( 0.82/1.02 ( ! [X0,X1] : (? [X2] : (? [X3] : (nil != X0 & ! [X4] : (! [X5] : (~ssList(X5) | ! [X6] : (~ssList(X6) | app(app(X5,cons(X4,nil)),X6) != X0 | ? [X7] : (memberP(X6,X7) & ~leq(X4,X7) & lt(X4,X7) & memberP(X5,X7) & ssItem(X7)))) | ~ssItem(X4)) & ((nil = X2 & nil = X3) | ? [X8] : (cons(X8,nil) = X2 & ! [X9] : (~ssItem(X9) | ~leq(X8,X9) | ~memberP(X3,X9) | X8 = X9) & memberP(X3,X8) & ssItem(X8))) & X0 = X2 & X1 = X3 & ssList(X3)) & ssList(X2)) => (? [X3] : (nil != X0 & ! [X4] : (! [X5] : (~ssList(X5) | ! [X6] : (~ssList(X6) | app(app(X5,cons(X4,nil)),X6) != X0 | ? [X7] : (memberP(X6,X7) & ~leq(X4,X7) & lt(X4,X7) & memberP(X5,X7) & ssItem(X7)))) | ~ssItem(X4)) & ((nil = sK2 & nil = X3) | ? [X8] : (cons(X8,nil) = sK2 & ! [X9] : (~ssItem(X9) | ~leq(X8,X9) | ~memberP(X3,X9) | X8 = X9) & memberP(X3,X8) & ssItem(X8))) & sK2 = X0 & X1 = X3 & ssList(X3)) & ssList(sK2))) )), 0.82/1.02 introduced(choice_axiom,[])). 0.82/1.02 fof(f166,plain,( 0.82/1.02 ( ! [X2,X0,X1] : (? [X3] : (nil != X0 & ! [X4] : (! [X5] : (~ssList(X5) | ! [X6] : (~ssList(X6) | app(app(X5,cons(X4,nil)),X6) != X0 | ? [X7] : (memberP(X6,X7) & ~leq(X4,X7) & lt(X4,X7) & memberP(X5,X7) & ssItem(X7)))) | ~ssItem(X4)) & ((nil = X2 & nil = X3) | ? [X8] : (cons(X8,nil) = X2 & ! [X9] : (~ssItem(X9) | ~leq(X8,X9) | ~memberP(X3,X9) | X8 = X9) & memberP(X3,X8) & ssItem(X8))) & X0 = X2 & X1 = X3 & ssList(X3)) => (nil != X0 & ! [X4] : (! [X5] : (~ssList(X5) | ! [X6] : (~ssList(X6) | app(app(X5,cons(X4,nil)),X6) != X0 | ? [X7] : (memberP(X6,X7) & ~leq(X4,X7) & lt(X4,X7) & memberP(X5,X7) & ssItem(X7)))) | ~ssItem(X4)) & ((nil = X2 & nil = sK3) | ? [X8] : (cons(X8,nil) = X2 & ! [X9] : (~ssItem(X9) | ~leq(X8,X9) | ~memberP(sK3,X9) | X8 = X9) & memberP(sK3,X8) & ssItem(X8))) & X0 = X2 & sK3 = X1 & ssList(sK3))) )), 0.82/1.02 introduced(choice_axiom,[])). 0.82/1.02 fof(f167,plain,( 0.82/1.02 ! [X6,X5,X4] : (? [X7] : (memberP(X6,X7) & ~leq(X4,X7) & lt(X4,X7) & memberP(X5,X7) & ssItem(X7)) => (memberP(X6,sK4(X4,X5,X6)) & ~leq(X4,sK4(X4,X5,X6)) & lt(X4,sK4(X4,X5,X6)) & memberP(X5,sK4(X4,X5,X6)) & ssItem(sK4(X4,X5,X6))))), 0.82/1.02 introduced(choice_axiom,[])). 0.82/1.02 fof(f168,plain,( 0.82/1.02 ( ! [X2,X3] : (? [X8] : (cons(X8,nil) = X2 & ! [X9] : (~ssItem(X9) | ~leq(X8,X9) | ~memberP(X3,X9) | X8 = X9) & memberP(X3,X8) & ssItem(X8)) => (cons(sK5,nil) = X2 & ! [X9] : (~ssItem(X9) | ~leq(sK5,X9) | ~memberP(X3,X9) | sK5 = X9) & memberP(X3,sK5) & ssItem(sK5))) )), 0.82/1.02 introduced(choice_axiom,[])). 0.82/1.02 fof(f100,plain,( 0.82/1.02 ? [X0] : (? [X1] : (? [X2] : (? [X3] : (nil != X0 & ! [X4] : (! [X5] : (~ssList(X5) | ! [X6] : (~ssList(X6) | app(app(X5,cons(X4,nil)),X6) != X0 | ? [X7] : (memberP(X6,X7) & ~leq(X4,X7) & lt(X4,X7) & memberP(X5,X7) & ssItem(X7)))) | ~ssItem(X4)) & ((nil = X2 & nil = X3) | ? [X8] : (cons(X8,nil) = X2 & ! [X9] : (~ssItem(X9) | ~leq(X8,X9) | ~memberP(X3,X9) | X8 = X9) & memberP(X3,X8) & ssItem(X8))) & X0 = X2 & X1 = X3 & ssList(X3)) & ssList(X2)) & ssList(X1)) & ssList(X0))), 0.82/1.02 inference(flattening,[],[f99])). 0.82/1.02 fof(f99,plain,( 0.82/1.02 ? [X0] : (? [X1] : (? [X2] : (? [X3] : ((nil != X0 & ! [X4] : (! [X5] : (~ssList(X5) | ! [X6] : (~ssList(X6) | app(app(X5,cons(X4,nil)),X6) != X0 | ? [X7] : ((memberP(X6,X7) & ~leq(X4,X7) & lt(X4,X7) & memberP(X5,X7)) & ssItem(X7)))) | ~ssItem(X4)) & ((nil = X2 & nil = X3) | ? [X8] : ((cons(X8,nil) = X2 & ! [X9] : (~ssItem(X9) | ~leq(X8,X9) | ~memberP(X3,X9) | X8 = X9) & memberP(X3,X8)) & ssItem(X8))) & X0 = X2 & X1 = X3) & ssList(X3)) & ssList(X2)) & ssList(X1)) & ssList(X0))), 0.82/1.02 inference(ennf_transformation,[],[f98])). 0.82/1.02 fof(f98,plain,( 0.82/1.02 ~! [X0] : (ssList(X0) => ! [X1] : (ssList(X1) => ! [X2] : (ssList(X2) => ! [X3] : (ssList(X3) => (nil = X0 | ? [X4] : (? [X5] : (ssList(X5) & ? [X6] : (ssList(X6) & app(app(X5,cons(X4,nil)),X6) = X0 & ! [X7] : (ssItem(X7) => (~memberP(X6,X7) | leq(X4,X7) | ~lt(X4,X7) | ~memberP(X5,X7))))) & ssItem(X4)) | ((nil != X2 | nil != X3) & ! [X8] : (ssItem(X8) => (cons(X8,nil) != X2 | ? [X9] : (ssItem(X9) & leq(X8,X9) & memberP(X3,X9) & X8 != X9) | ~memberP(X3,X8)))) | X0 != X2 | X1 != X3)))))), 0.82/1.02 inference(rectify,[],[f97])). 0.82/1.02 fof(f97,negated_conjecture,( 0.82/1.02 ~! [X0] : (ssList(X0) => ! [X1] : (ssList(X1) => ! [X2] : (ssList(X2) => ! [X3] : (ssList(X3) => (nil = X0 | ? [X4] : (? [X5] : (ssList(X5) & ? [X8] : (ssList(X8) & app(app(X5,cons(X4,nil)),X8) = X0 & ! [X9] : (ssItem(X9) => (~memberP(X8,X9) | leq(X4,X9) | ~lt(X4,X9) | ~memberP(X5,X9))))) & ssItem(X4)) | ((nil != X2 | nil != X3) & ! [X6] : (ssItem(X6) => (cons(X6,nil) != X2 | ? [X7] : (ssItem(X7) & leq(X6,X7) & memberP(X3,X7) & X6 != X7) | ~memberP(X3,X6)))) | X0 != X2 | X1 != X3)))))), 0.82/1.02 inference(negated_conjecture,[],[f96])). 0.82/1.02 fof(f96,conjecture,( 0.82/1.02 ! [X0] : (ssList(X0) => ! [X1] : (ssList(X1) => ! [X2] : (ssList(X2) => ! [X3] : (ssList(X3) => (nil = X0 | ? [X4] : (? [X5] : (ssList(X5) & ? [X8] : (ssList(X8) & app(app(X5,cons(X4,nil)),X8) = X0 & ! [X9] : (ssItem(X9) => (~memberP(X8,X9) | leq(X4,X9) | ~lt(X4,X9) | ~memberP(X5,X9))))) & ssItem(X4)) | ((nil != X2 | nil != X3) & ! [X6] : (ssItem(X6) => (cons(X6,nil) != X2 | ? [X7] : (ssItem(X7) & leq(X6,X7) & memberP(X3,X7) & X6 != X7) | ~memberP(X3,X6)))) | X0 != X2 | X1 != X3)))))), 0.82/1.02 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)). 0.82/1.02 fof(f676,plain,( 0.82/1.02 nil = sK0 | memberP(nil,sK4(sK5,nil,nil))), 0.82/1.02 inference(forward_demodulation,[],[f675,f217])). 0.82/1.02 fof(f217,plain,( 0.82/1.02 sK0 = sK2), 0.82/1.02 inference(cnf_transformation,[],[f169])). 0.82/1.02 fof(f675,plain,( 0.82/1.02 memberP(nil,sK4(sK5,nil,nil)) | nil = sK2), 0.82/1.02 inference(subsumption_resolution,[],[f674,f340])). 0.82/1.02 fof(f340,plain,( 0.82/1.02 ssItem(sK5)), 0.82/1.02 inference(subsumption_resolution,[],[f338,f231])). 0.82/1.02 fof(f338,plain,( 0.82/1.02 nil = sK0 | ssItem(sK5)), 0.82/1.02 inference(superposition,[],[f222,f217])). 0.82/1.02 fof(f222,plain,( 0.82/1.02 nil = sK2 | ssItem(sK5)), 0.82/1.02 inference(cnf_transformation,[],[f169])). 0.82/1.02 fof(f674,plain,( 0.82/1.02 memberP(nil,sK4(sK5,nil,nil)) | ~ssItem(sK5) | nil = sK2), 0.82/1.02 inference(subsumption_resolution,[],[f672,f217])). 0.82/1.02 fof(f672,plain,( 0.82/1.02 sK0 != sK2 | memberP(nil,sK4(sK5,nil,nil)) | ~ssItem(sK5) | nil = sK2), 0.82/1.02 inference(superposition,[],[f645,f225])). 0.82/1.02 fof(f225,plain,( 0.82/1.02 cons(sK5,nil) = sK2 | nil = sK2), 0.82/1.02 inference(cnf_transformation,[],[f169])). 0.82/1.02 fof(f645,plain,( 0.82/1.02 ( ! [X0] : (cons(X0,nil) != sK0 | memberP(nil,sK4(X0,nil,nil)) | ~ssItem(X0)) )), 0.82/1.02 inference(subsumption_resolution,[],[f644,f334])). 0.82/1.02 fof(f334,plain,( 0.82/1.02 ssList(sK0)), 0.82/1.02 inference(forward_demodulation,[],[f214,f217])). 0.82/1.02 fof(f214,plain,( 0.82/1.02 ssList(sK2)), 0.82/1.02 inference(cnf_transformation,[],[f169])). 0.82/1.02 fof(f644,plain,( 0.82/1.02 ( ! [X0] : (cons(X0,nil) != sK0 | memberP(nil,sK4(X0,nil,nil)) | ~ssItem(X0) | ~ssList(sK0)) )), 0.82/1.02 inference(inner_rewriting,[],[f643])). 0.82/1.02 fof(f643,plain,( 0.82/1.02 ( ! [X0] : (cons(X0,nil) != sK0 | memberP(nil,sK4(X0,nil,nil)) | ~ssItem(X0) | ~ssList(cons(X0,nil))) )), 0.82/1.02 inference(subsumption_resolution,[],[f636,f272])). 0.82/1.02 fof(f272,plain,( 0.82/1.02 ssList(nil)), 0.82/1.02 inference(cnf_transformation,[],[f19])). 0.82/1.02 fof(f19,axiom,( 0.82/1.02 ssList(nil)), 0.82/1.02 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17)). 0.82/1.02 fof(f636,plain,( 0.82/1.02 ( ! [X0] : (cons(X0,nil) != sK0 | ~ssList(nil) | memberP(nil,sK4(X0,nil,nil)) | ~ssItem(X0) | ~ssList(cons(X0,nil))) )), 0.82/1.02 inference(superposition,[],[f608,f242])). 0.82/1.02 fof(f242,plain,( 0.82/1.02 ( ! [X0] : (app(nil,X0) = X0 | ~ssList(X0)) )), 0.82/1.02 inference(cnf_transformation,[],[f111])). 0.82/1.02 fof(f111,plain,( 0.82/1.02 ! [X0] : (app(nil,X0) = X0 | ~ssList(X0))), 0.82/1.02 inference(ennf_transformation,[],[f30])). 0.82/1.02 fof(f30,axiom,( 0.82/1.02 ! [X0] : (ssList(X0) => app(nil,X0) = X0)), 0.82/1.02 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28)). 0.82/1.02 fof(f608,plain,( 0.82/1.02 ( ! [X0,X1] : (app(X0,cons(X1,nil)) != sK0 | ~ssList(X0) | memberP(X0,sK4(X1,X0,nil)) | ~ssItem(X1)) )), 0.82/1.02 inference(subsumption_resolution,[],[f607,f334])). 0.82/1.02 fof(f607,plain,( 0.82/1.02 ( ! [X0,X1] : (app(X0,cons(X1,nil)) != sK0 | ~ssList(X0) | memberP(X0,sK4(X1,X0,nil)) | ~ssItem(X1) | ~ssList(sK0)) )), 0.82/1.02 inference(inner_rewriting,[],[f606])). 0.82/1.02 fof(f606,plain,( 0.82/1.02 ( ! [X0,X1] : (app(X0,cons(X1,nil)) != sK0 | ~ssList(X0) | memberP(X0,sK4(X1,X0,nil)) | ~ssItem(X1) | ~ssList(app(X0,cons(X1,nil)))) )), 0.82/1.02 inference(subsumption_resolution,[],[f598,f272])). 0.82/1.02 fof(f598,plain,( 0.82/1.02 ( ! [X0,X1] : (app(X0,cons(X1,nil)) != sK0 | ~ssList(nil) | ~ssList(X0) | memberP(X0,sK4(X1,X0,nil)) | ~ssItem(X1) | ~ssList(app(X0,cons(X1,nil)))) )), 0.82/1.02 inference(superposition,[],[f227,f241])). 0.82/1.02 fof(f241,plain,( 0.82/1.02 ( ! [X0] : (app(X0,nil) = X0 | ~ssList(X0)) )), 0.82/1.02 inference(cnf_transformation,[],[f110])). 0.82/1.02 fof(f110,plain,( 0.82/1.02 ! [X0] : (app(X0,nil) = X0 | ~ssList(X0))), 0.82/1.02 inference(ennf_transformation,[],[f76])). 0.82/1.02 fof(f76,axiom,( 0.82/1.02 ! [X0] : (ssList(X0) => app(X0,nil) = X0)), 0.82/1.02 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84)). 0.82/1.02 fof(f227,plain,( 0.82/1.02 ( ! [X6,X4,X5] : (app(app(X5,cons(X4,nil)),X6) != sK0 | ~ssList(X6) | ~ssList(X5) | memberP(X5,sK4(X4,X5,X6)) | ~ssItem(X4)) )), 0.82/1.02 inference(cnf_transformation,[],[f169])). 0.82/1.02 fof(f1346,plain,( 0.82/1.02 ~memberP(nil,sK4(sK5,nil,nil))), 0.82/1.02 inference(unit_resulting_resolution,[],[f446,f301])). 0.82/1.02 fof(f301,plain,( 0.82/1.02 ( ! [X0] : (~memberP(nil,X0) | ~ssItem(X0)) )), 0.82/1.02 inference(cnf_transformation,[],[f144])). 0.82/1.02 fof(f144,plain,( 0.82/1.02 ! [X0] : (~memberP(nil,X0) | ~ssItem(X0))), 0.82/1.02 inference(ennf_transformation,[],[f89])). 0.82/1.02 fof(f89,axiom,( 0.82/1.02 ! [X0] : (ssItem(X0) => ~memberP(nil,X0))), 0.82/1.02 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38)). 0.82/1.02 fof(f446,plain,( 0.82/1.02 ssItem(sK4(sK5,nil,nil))), 0.82/1.02 inference(subsumption_resolution,[],[f445,f231])). 0.82/1.02 fof(f445,plain,( 0.82/1.02 nil = sK0 | ssItem(sK4(sK5,nil,nil))), 0.82/1.02 inference(forward_demodulation,[],[f444,f217])). 0.82/1.02 fof(f444,plain,( 0.82/1.02 ssItem(sK4(sK5,nil,nil)) | nil = sK2), 0.82/1.02 inference(subsumption_resolution,[],[f443,f340])). 0.82/1.02 fof(f443,plain,( 0.82/1.02 ssItem(sK4(sK5,nil,nil)) | ~ssItem(sK5) | nil = sK2), 0.82/1.02 inference(subsumption_resolution,[],[f441,f217])). 0.82/1.02 fof(f441,plain,( 0.82/1.02 sK0 != sK2 | ssItem(sK4(sK5,nil,nil)) | ~ssItem(sK5) | nil = sK2), 0.82/1.02 inference(superposition,[],[f440,f225])). 0.82/1.02 fof(f440,plain,( 0.82/1.02 ( ! [X0] : (cons(X0,nil) != sK0 | ssItem(sK4(X0,nil,nil)) | ~ssItem(X0)) )), 0.82/1.02 inference(subsumption_resolution,[],[f439,f334])). 0.82/1.02 fof(f439,plain,( 0.82/1.02 ( ! [X0] : (cons(X0,nil) != sK0 | ssItem(sK4(X0,nil,nil)) | ~ssItem(X0) | ~ssList(sK0)) )), 0.82/1.02 inference(inner_rewriting,[],[f438])). 0.82/1.02 fof(f438,plain,( 0.82/1.02 ( ! [X0] : (cons(X0,nil) != sK0 | ssItem(sK4(X0,nil,nil)) | ~ssItem(X0) | ~ssList(cons(X0,nil))) )), 0.82/1.02 inference(subsumption_resolution,[],[f431,f272])). 0.82/1.02 fof(f431,plain,( 0.82/1.02 ( ! [X0] : (cons(X0,nil) != sK0 | ~ssList(nil) | ssItem(sK4(X0,nil,nil)) | ~ssItem(X0) | ~ssList(cons(X0,nil))) )), 0.82/1.02 inference(superposition,[],[f428,f242])). 0.82/1.02 fof(f428,plain,( 0.82/1.02 ( ! [X0,X1] : (app(X0,cons(X1,nil)) != sK0 | ~ssList(X0) | ssItem(sK4(X1,X0,nil)) | ~ssItem(X1)) )), 0.82/1.02 inference(subsumption_resolution,[],[f427,f334])). 0.82/1.02 fof(f427,plain,( 0.82/1.02 ( ! [X0,X1] : (app(X0,cons(X1,nil)) != sK0 | ~ssList(X0) | ssItem(sK4(X1,X0,nil)) | ~ssItem(X1) | ~ssList(sK0)) )), 0.82/1.02 inference(inner_rewriting,[],[f426])). 0.82/1.02 fof(f426,plain,( 0.82/1.02 ( ! [X0,X1] : (app(X0,cons(X1,nil)) != sK0 | ~ssList(X0) | ssItem(sK4(X1,X0,nil)) | ~ssItem(X1) | ~ssList(app(X0,cons(X1,nil)))) )), 0.82/1.02 inference(subsumption_resolution,[],[f418,f272])). 0.82/1.02 fof(f418,plain,( 0.82/1.02 ( ! [X0,X1] : (app(X0,cons(X1,nil)) != sK0 | ~ssList(nil) | ~ssList(X0) | ssItem(sK4(X1,X0,nil)) | ~ssItem(X1) | ~ssList(app(X0,cons(X1,nil)))) )), 0.82/1.02 inference(superposition,[],[f226,f241])). 0.82/1.02 fof(f226,plain,( 0.82/1.02 ( ! [X6,X4,X5] : (app(app(X5,cons(X4,nil)),X6) != sK0 | ~ssList(X6) | ~ssList(X5) | ssItem(sK4(X4,X5,X6)) | ~ssItem(X4)) )), 0.82/1.02 inference(cnf_transformation,[],[f169])). 0.82/1.02 % SZS output end Proof for theBenchmark 0.82/1.02 % ------------------------------ 0.82/1.02 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 0.82/1.02 % Termination reason: Refutation 0.82/1.02 0.82/1.02 % Memory used [KB]: 1535 0.82/1.02 % Time elapsed: 0.014 s 0.82/1.02 % ------------------------------ 0.82/1.02 % ------------------------------ 0.82/1.02 % Success in time 0.737 s 0.82/1.02 EOF