0.02/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.04 % Command : vampire --mode casc -m 90000 -t %d %s 0.02/0.24 % Computer : n144.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:38:41 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: 3000 next slice time: 3 0.07/0.27 dis+1002_4_gs=on:inst=on:nm=64:nwc=1.3:sas=z3:sac=on:sfr=on:smm=off:ssnc=none:sp=occurrence:tha=off:thf=on:updr=off_1 on theBenchmark 0.07/0.28 % Refutation found. Thanks to Tanya! 0.07/0.28 % SZS status Theorem for theBenchmark 0.07/0.28 % SZS output start Proof for theBenchmark 0.07/0.28 tff(f1,conjecture,( 0.07/0.28 ? [X0 : $real] : 20.06 != X0), 0.07/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',real_not_equal_problem_2)). 0.07/0.28 tff(f2,negated_conjecture,( 0.07/0.28 ~? [X0 : $real] : 20.06 != X0), 0.07/0.28 inference(negated_conjecture,[],[f1])). 0.07/0.28 tff(f3,plain,( 0.07/0.28 ! [X0 : $real] : 20.06 = X0), 0.07/0.28 inference(ennf_transformation,[],[f2])). 0.07/0.28 tff(f4,plain,( 0.07/0.28 ( ! [X0:$real] : (20.06 = X0) )), 0.07/0.28 inference(cnf_transformation,[],[f3])). 0.07/0.28 tff(f6,plain,( 0.07/0.28 20.06 = 21.06), 0.07/0.28 inference(Instantiation,[],[f4])). 0.07/0.28 tff(f9,plain,( 0.07/0.28 $false), 0.07/0.28 inference(evaluation,[],[f6])). 0.07/0.28 % SZS output end Proof for theBenchmark 0.07/0.28 % ------------------------------ 0.07/0.28 % Version: Vampire 4.1 for CASC J8 Entry 0.07/0.28 % Termination reason: Refutation 0.07/0.28 0.07/0.28 % Memory used [KB]: 511 0.07/0.28 % Time elapsed: 0.013 s 0.07/0.28 % ------------------------------ 0.07/0.28 % ------------------------------ 0.07/0.28 % Success in time 0.041 s 0.07/0.28 EOF