0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.04 % Command : vampire -m 90000 --mode casc -t %d %s 0.02/0.24 % Computer : n164.star.cs.uiowa.edu 0.02/0.24 % Model : x86_64 x86_64 0.02/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.24 % Memory : 32218.625MB 0.02/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.24 % CPULimit : 300 0.02/0.24 % DateTime : Sat Jul 14 04:24:10 CDT 2018 0.02/0.24 % CPUTime : 0.02/0.24 Hi Geoff, go and have some cold beer while I am trying to solve this very hard problem! 0.02/0.24 % remaining time: 5999 next slice time: 4 0.06/0.27 dis+1002_2_add=off:afr=on:afp=10000:afq=2.0:amm=off:anc=none:cond=on:er=filter:fsr=off:nm=0:nwc=1.3:sp=occurrence_2 on theBenchmark 0.06/0.28 % Refutation found. Thanks to Tanya! 0.06/0.28 % SZS status Theorem for theBenchmark 0.06/0.28 % SZS output start Proof for theBenchmark 0.06/0.28 fof(f60,axiom,( 0.06/0.28 ! [X11,X12] : s(X11,s(X11,X12)) = X12), 0.06/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz7_7)). 0.06/0.28 fof(f72,conjecture,( 0.06/0.28 ! [X11,X12,X20,X15] : (X12 = X15 | s(X11,X15) != X20 | s(X11,X12) != X20)), 0.06/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz7_8)). 0.06/0.28 fof(f73,negated_conjecture,( 0.06/0.28 ~! [X11,X12,X20,X15] : (X12 = X15 | s(X11,X15) != X20 | s(X11,X12) != X20)), 0.06/0.28 inference(negated_conjecture,[],[f72])). 0.06/0.28 fof(f112,plain,( 0.06/0.28 ~! [X0,X1,X2,X3] : (X1 = X3 | s(X0,X3) != X2 | s(X0,X1) != X2)), 0.06/0.28 inference(rectify,[],[f73])). 0.06/0.28 fof(f122,plain,( 0.06/0.28 ! [X0,X1] : s(X0,s(X0,X1)) = X1), 0.06/0.28 inference(rectify,[],[f60])). 0.06/0.28 fof(f215,plain,( 0.06/0.28 ? [X0,X1,X2,X3] : (X1 != X3 & s(X0,X3) = X2 & s(X0,X1) = X2)), 0.06/0.28 inference(ennf_transformation,[],[f112])). 0.06/0.28 fof(f216,plain,( 0.06/0.28 ? [X0,X1,X2,X3] : (X1 != X3 & s(X0,X3) = X2 & s(X0,X1) = X2) => (sK1 != sK3 & s(sK0,sK3) = sK2 & s(sK0,sK1) = sK2)), 0.06/0.28 introduced(choice_axiom,[])). 0.06/0.28 fof(f217,plain,( 0.06/0.28 sK1 != sK3 & s(sK0,sK3) = sK2 & s(sK0,sK1) = sK2), 0.06/0.28 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f215,f216])). 0.06/0.28 fof(f218,plain,( 0.06/0.28 s(sK0,sK1) = sK2), 0.06/0.28 inference(cnf_transformation,[],[f217])). 0.06/0.28 fof(f219,plain,( 0.06/0.28 s(sK0,sK3) = sK2), 0.06/0.28 inference(cnf_transformation,[],[f217])). 0.06/0.28 fof(f220,plain,( 0.06/0.28 sK1 != sK3), 0.06/0.28 inference(cnf_transformation,[],[f217])). 0.06/0.28 fof(f237,plain,( 0.06/0.28 ( ! [X0,X1] : (s(X0,s(X0,X1)) = X1) )), 0.06/0.28 inference(cnf_transformation,[],[f122])). 0.06/0.28 fof(f395,plain,( 0.06/0.28 s(sK0,sK2) = sK1), 0.06/0.28 inference(superposition,[],[f237,f218])). 0.06/0.28 fof(f396,plain,( 0.06/0.28 s(sK0,sK2) = sK3), 0.06/0.28 inference(superposition,[],[f237,f219])). 0.06/0.28 fof(f411,plain,( 0.06/0.28 sK1 = sK3), 0.06/0.28 inference(forward_demodulation,[],[f396,f395])). 0.06/0.28 fof(f416,plain,( 0.06/0.28 sK1 != sK1), 0.06/0.28 inference(superposition,[],[f220,f411])). 0.06/0.28 fof(f417,plain,( 0.06/0.28 $false), 0.06/0.28 inference(trivial_inequality_removal,[],[f416])). 0.06/0.28 % SZS output end Proof for theBenchmark 0.06/0.28 % ------------------------------ 0.06/0.28 % Version: Vampire 4.2 (commit c955596 on 2017-07-21 22:07:53 +0100) 0.06/0.28 % Termination reason: Refutation 0.06/0.28 0.06/0.28 % Memory used [KB]: 5245 0.06/0.28 % Time elapsed: 0.004 s 0.06/0.28 % ------------------------------ 0.06/0.28 % ------------------------------ 0.06/0.28 % Success in time 0.036 s 0.06/0.29 EOF