%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n029.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 600s % DateTime : Wed Jul 20 19:45:15 EDT 2022 % Result : Unsatisfiable 0.12s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.0. % 0.12/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n029.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Thu Jun 16 00:17:12 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.35 % SZS status Unsatisfiable % 0.12/0.35 % SZS output begin IncompleteProof % 0.12/0.35 cnf(c0, axiom, % 0.12/0.35 ~less_or_equal(a(p),a(q))). % 0.12/0.35 cnf(c1, plain, % 0.12/0.35 ~less_or_equal(a(p),a(q)), % 0.12/0.35 inference(start, [], [c0])). % 0.12/0.35 % 0.12/0.35 cnf(c2, axiom, % 0.12/0.35 less_or_equal(a(X0),a(X1)) | ~less_or_equal(X1,n) | ~less_or_equal(X0,X1) | ~less_or_equal(i,X0)). % 0.12/0.35 cnf(a0, assumption, % 0.12/0.35 a(p) = a(X0)). % 0.12/0.35 cnf(a1, assumption, % 0.12/0.35 a(q) = a(X1)). % 0.12/0.35 cnf(c3, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.35 cnf(c4, plain, % 0.12/0.35 ~less_or_equal(X1,n) | ~less_or_equal(X0,X1) | ~less_or_equal(i,X0), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.35 % 0.12/0.35 cnf(c5, axiom, % 0.12/0.35 less_or_equal(q,n)). % 0.12/0.35 cnf(a2, assumption, % 0.12/0.35 X1 = q). % 0.12/0.35 cnf(a3, assumption, % 0.12/0.35 n = n). % 0.12/0.35 cnf(c6, plain, % 0.12/0.35 ~less_or_equal(X0,X1) | ~less_or_equal(i,X0), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.35 cnf(c7, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.35 % 0.12/0.35 cnf(c8, axiom, % 0.12/0.35 less_or_equal(p,q)). % 0.12/0.35 cnf(a4, assumption, % 0.12/0.35 X0 = p). % 0.12/0.35 cnf(a5, assumption, % 0.12/0.35 X1 = q). % 0.12/0.35 cnf(c9, plain, % 0.12/0.35 ~less_or_equal(i,X0), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.12/0.35 cnf(c10, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.12/0.35 % 0.12/0.35 cnf(c11, axiom, % 0.12/0.35 less(X2,X3) | less_or_equal(X3,X2)). % 0.12/0.35 cnf(a6, assumption, % 0.12/0.35 i = X3). % 0.12/0.35 cnf(a7, assumption, % 0.12/0.35 X0 = X2). % 0.12/0.35 cnf(c12, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])). % 0.12/0.35 cnf(c13, plain, % 0.12/0.35 less(X2,X3), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])). % 0.12/0.35 % 0.12/0.35 cnf(c14, axiom, % 0.12/0.35 less_or_equal(a(X4),a(X5)) | ~less_or_equal(X5,n) | ~less(j,X5) | ~less(X4,i) | ~less_or_equal(m,X4)). % 0.12/0.35 cnf(a8, assumption, % 0.12/0.35 X2 = X4). % 0.12/0.35 cnf(a9, assumption, % 0.12/0.35 X3 = i). % 0.12/0.35 cnf(c15, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])). % 0.12/0.35 cnf(c16, plain, % 0.12/0.35 less_or_equal(a(X4),a(X5)) | ~less_or_equal(X5,n) | ~less(j,X5) | ~less_or_equal(m,X4), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])). % 0.12/0.35 % 0.12/0.35 cnf(c17, plain, % 0.12/0.35 ~less_or_equal(a(p),a(q))). % 0.12/0.35 cnf(a10, assumption, % 0.12/0.35 a(X4) = a(p)). % 0.12/0.35 cnf(a11, assumption, % 0.12/0.35 a(X5) = a(q)). % 0.12/0.35 cnf(c18, plain, % 0.12/0.35 ~less_or_equal(X5,n) | ~less(j,X5) | ~less_or_equal(m,X4), % 0.12/0.35 inference(predicate_reduction, [assumptions([a10, a11])], [c16, c17])). % 0.12/0.35 % 0.12/0.35 cnf(c19, plain, % 0.12/0.35 less_or_equal(X1,n)). % 0.12/0.35 cnf(a12, assumption, % 0.12/0.35 X5 = X1). % 0.12/0.35 cnf(a13, assumption, % 0.12/0.35 n = n). % 0.12/0.35 cnf(c20, plain, % 0.12/0.35 ~less(j,X5) | ~less_or_equal(m,X4), % 0.12/0.35 inference(predicate_reduction, [assumptions([a12, a13])], [c18, c19])). % 0.12/0.35 % 0.12/0.35 cnf(c21, axiom, % 0.12/0.35 less(X6,X7) | less_or_equal(X7,X6)). % 0.12/0.35 cnf(a14, assumption, % 0.12/0.35 j = X6). % 0.12/0.35 cnf(a15, assumption, % 0.12/0.35 X5 = X7). % 0.12/0.35 cnf(c22, plain, % 0.12/0.35 ~less_or_equal(m,X4), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a14, a15])], [c20, c21])). % 0.12/0.35 cnf(c23, plain, % 0.12/0.35 less_or_equal(X7,X6), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a14, a15])], [c20, c21])). % 0.12/0.35 % 0.12/0.35 cnf(c24, axiom, % 0.12/0.35 less_or_equal(a(X8),a(X9)) | ~less_or_equal(X9,j) | ~less_or_equal(X8,X9) | ~less_or_equal(m,X8)). % 0.12/0.35 cnf(a16, assumption, % 0.12/0.35 X7 = X9). % 0.12/0.35 cnf(a17, assumption, % 0.12/0.35 X6 = j). % 0.12/0.35 cnf(c25, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c24])). % 0.12/0.35 cnf(c26, plain, % 0.12/0.35 less_or_equal(a(X8),a(X9)) | ~less_or_equal(X8,X9) | ~less_or_equal(m,X8), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c24])). % 0.12/0.35 % 0.12/0.35 cnf(c27, plain, % 0.12/0.35 ~less_or_equal(a(p),a(q))). % 0.12/0.35 cnf(a18, assumption, % 0.12/0.35 a(X8) = a(p)). % 0.12/0.35 cnf(a19, assumption, % 0.12/0.35 a(X9) = a(q)). % 0.12/0.35 cnf(c28, plain, % 0.12/0.35 ~less_or_equal(X8,X9) | ~less_or_equal(m,X8), % 0.12/0.35 inference(predicate_reduction, [assumptions([a18, a19])], [c26, c27])). % 0.12/0.35 % 0.12/0.35 cnf(c29, plain, % 0.12/0.35 less_or_equal(X0,X1)). % 0.12/0.35 cnf(a20, assumption, % 0.12/0.35 X8 = X0). % 0.12/0.35 cnf(a21, assumption, % 0.12/0.35 X9 = X1). % 0.12/0.35 cnf(c30, plain, % 0.12/0.35 ~less_or_equal(m,X8), % 0.12/0.35 inference(predicate_reduction, [assumptions([a20, a21])], [c28, c29])). % 0.12/0.35 % 0.12/0.35 cnf(c31, axiom, % 0.12/0.35 less_or_equal(m,p)). % 0.12/0.35 cnf(a22, assumption, % 0.12/0.35 m = m). % 0.12/0.35 cnf(a23, assumption, % 0.12/0.35 X8 = p). % 0.12/0.35 cnf(c32, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a22, a23])], [c30, c31])). % 0.12/0.35 cnf(c33, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a22, a23])], [c30, c31])). % 0.12/0.35 % 0.12/0.35 cnf(c34, plain, % 0.12/0.35 less_or_equal(m,X8)). % 0.12/0.35 cnf(a24, assumption, % 0.12/0.35 m = m). % 0.12/0.35 cnf(a25, assumption, % 0.12/0.35 X4 = X8). % 0.12/0.35 cnf(c35, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(predicate_reduction, [assumptions([a24, a25])], [c22, c34])). % 0.12/0.35 % 0.12/0.35 cnf(c36, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(constraint_solving, [ % 0.12/0.35 bind(X0, p), % 0.12/0.35 bind(X1, q), % 0.12/0.35 bind(X2, p), % 0.12/0.35 bind(X3, i), % 0.12/0.35 bind(X4, p), % 0.12/0.35 bind(X5, q), % 0.12/0.35 bind(X6, j), % 0.12/0.35 bind(X7, q), % 0.12/0.35 bind(X8, p), % 0.12/0.35 bind(X9, q) % 0.12/0.35 ], % 0.12/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25])). % 0.12/0.35 % 0.12/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------