0.10/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.10/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop 0.12/0.33 % Computer : n010.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 960 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Wed Jul 1 17:17:12 EDT 2020 0.12/0.33 % CPUTime : 6.95/1.21 % SZS status Theorem 6.95/1.21 % SZS output begin IncompleteProof 6.95/1.21 cnf(c0, axiom, 6.95/1.21 ~connect(sK38,sK37,sK39) | ~connect(sK37,sK38,sK39)). 6.95/1.21 cnf(c1, plain, 6.95/1.21 ~connect(sK38,sK37,sK39) | ~connect(sK37,sK38,sK39), 6.95/1.21 inference(start, [], [c0])). 6.95/1.21 6.95/1.21 cnf(c2, axiom, 6.95/1.21 connect(sK38,sK37,sK39) | connect(sK37,sK38,sK39)). 6.95/1.21 cnf(a0, assumption, 6.95/1.21 sK38 = sK38). 6.95/1.21 cnf(a1, assumption, 6.95/1.21 sK37 = sK37). 6.95/1.21 cnf(a2, assumption, 6.95/1.21 sK39 = sK39). 6.95/1.21 cnf(c3, plain, 6.95/1.21 ~connect(sK37,sK38,sK39), 6.95/1.21 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). 6.95/1.21 cnf(c4, plain, 6.95/1.21 connect(sK37,sK38,sK39), 6.95/1.21 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). 6.95/1.21 6.95/1.21 cnf(c5, axiom, 6.95/1.21 once(at_the_same_time(at(X0,X1),at(X2,X1))) | ~connect(X0,X2,X1)). 6.95/1.21 cnf(a3, assumption, 6.95/1.21 sK37 = X0). 6.95/1.21 cnf(a4, assumption, 6.95/1.21 sK38 = X2). 6.95/1.21 cnf(a5, assumption, 6.95/1.21 sK39 = X1). 6.95/1.21 cnf(c6, plain, 6.95/1.21 $false, 6.95/1.21 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). 6.95/1.21 cnf(c7, plain, 6.95/1.21 once(at_the_same_time(at(X0,X1),at(X2,X1))), 6.95/1.21 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). 6.95/1.21 6.95/1.21 cnf(c8, axiom, 6.95/1.21 once(at_the_same_time(X3,X4)) | ~once(at_the_same_time(X4,X3))). 6.95/1.21 cnf(a6, assumption, 6.95/1.21 at_the_same_time(at(X0,X1),at(X2,X1)) = at_the_same_time(X4,X3)). 6.95/1.21 cnf(c9, plain, 6.95/1.21 $false, 6.95/1.21 inference(strict_predicate_extension, [assumptions([a6])], [c7, c8])). 6.95/1.21 cnf(c10, plain, 6.95/1.21 once(at_the_same_time(X3,X4)), 6.95/1.21 inference(strict_predicate_extension, [assumptions([a6])], [c7, c8])). 6.95/1.21 6.95/1.21 cnf(c11, axiom, 6.95/1.21 connect(X5,X6,X7) | ~once(at_the_same_time(at(X5,X7),at(X6,X7)))). 6.95/1.21 cnf(a7, assumption, 6.95/1.21 at_the_same_time(X3,X4) = at_the_same_time(at(X5,X7),at(X6,X7))). 6.95/1.21 cnf(c12, plain, 6.95/1.21 $false, 6.95/1.21 inference(strict_predicate_extension, [assumptions([a7])], [c10, c11])). 6.95/1.21 cnf(c13, plain, 6.95/1.21 connect(X5,X6,X7), 6.95/1.21 inference(strict_predicate_extension, [assumptions([a7])], [c10, c11])). 6.95/1.21 6.95/1.21 cnf(c14, plain, 6.95/1.21 ~connect(sK38,sK37,sK39)). 6.95/1.21 cnf(a8, assumption, 6.95/1.21 X5 = sK38). 6.95/1.21 cnf(a9, assumption, 6.95/1.21 X6 = sK37). 6.95/1.21 cnf(a10, assumption, 6.95/1.21 X7 = sK39). 6.95/1.21 cnf(c15, plain, 6.95/1.21 $false, 6.95/1.21 inference(predicate_reduction, [assumptions([a8, a9, a10])], [c13, c14])). 6.95/1.21 6.95/1.21 cnf(c16, axiom, 6.95/1.21 connect(X8,X9,X10) | ~once(at_the_same_time(at(X8,X10),at(X9,X10)))). 6.95/1.21 cnf(a11, assumption, 6.95/1.21 sK37 = X8). 6.95/1.21 cnf(a12, assumption, 6.95/1.21 sK38 = X9). 6.95/1.21 cnf(a13, assumption, 6.95/1.21 sK39 = X10). 6.95/1.21 cnf(c17, plain, 6.95/1.21 $false, 6.95/1.21 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c3, c16])). 6.95/1.21 cnf(c18, plain, 6.95/1.21 ~once(at_the_same_time(at(X8,X10),at(X9,X10))), 6.95/1.21 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c3, c16])). 6.95/1.21 6.95/1.21 cnf(c19, axiom, 6.95/1.21 once(at_the_same_time(X11,X12)) | ~once(at_the_same_time(X12,X11))). 6.95/1.21 cnf(a14, assumption, 6.95/1.21 at_the_same_time(at(X8,X10),at(X9,X10)) = at_the_same_time(X11,X12)). 6.95/1.21 cnf(c20, plain, 6.95/1.21 $false, 6.95/1.21 inference(strict_predicate_extension, [assumptions([a14])], [c18, c19])). 6.95/1.21 cnf(c21, plain, 6.95/1.21 ~once(at_the_same_time(X12,X11)), 6.95/1.21 inference(strict_predicate_extension, [assumptions([a14])], [c18, c19])). 6.95/1.21 6.95/1.21 cnf(c22, axiom, 6.95/1.21 once(at_the_same_time(at(X13,X14),at(X15,X14))) | ~connect(X13,X15,X14)). 6.95/1.21 cnf(a15, assumption, 6.95/1.21 at_the_same_time(X12,X11) = at_the_same_time(at(X13,X14),at(X15,X14))). 6.95/1.21 cnf(c23, plain, 6.95/1.21 $false, 6.95/1.21 inference(strict_predicate_extension, [assumptions([a15])], [c21, c22])). 6.95/1.21 cnf(c24, plain, 6.95/1.21 ~connect(X13,X15,X14), 6.95/1.21 inference(strict_predicate_extension, [assumptions([a15])], [c21, c22])). 6.95/1.21 6.95/1.21 cnf(c25, plain, 6.95/1.21 connect(sK38,sK37,sK39)). 6.95/1.21 cnf(a16, assumption, 6.95/1.21 X13 = sK38). 6.95/1.21 cnf(a17, assumption, 6.95/1.21 X15 = sK37). 6.95/1.21 cnf(a18, assumption, 6.95/1.21 X14 = sK39). 6.95/1.21 cnf(c26, plain, 6.95/1.21 $false, 6.95/1.21 inference(predicate_reduction, [assumptions([a16, a17, a18])], [c24, c25])). 6.95/1.21 6.95/1.21 cnf(c27, plain, 6.95/1.21 $false, 6.95/1.21 inference(constraint_solving, [ 6.95/1.21 bind(X0, sK37), 6.95/1.21 bind(X1, sK39), 6.95/1.21 bind(X2, sK38), 6.95/1.21 bind(X3, at(X2,X1)), 6.95/1.21 bind(X4, at(X0,X1)), 6.95/1.21 bind(X5, sK38), 6.95/1.21 bind(X6, sK37), 6.95/1.21 bind(X7, sK39), 6.95/1.21 bind(X8, sK37), 6.95/1.21 bind(X9, sK38), 6.95/1.21 bind(X10, sK39), 6.95/1.21 bind(X11, at(X8,X10)), 6.95/1.21 bind(X12, at(X9,X10)), 6.95/1.21 bind(X13, sK38), 6.95/1.21 bind(X14, sK39), 6.95/1.21 bind(X15, sK37) 6.95/1.21 ], 6.95/1.21 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18])). 6.95/1.21 6.95/1.21 % SZS output end IncompleteProof 6.95/1.21 EOF