%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV002-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 : n017.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:14 EDT 2022 % Result : Unsatisfiable 2.31s 0.66s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV002-1 : TPTP v8.1.0. Released v1.0.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n017.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Tue Jun 14 13:49:24 EDT 2022 % 0.13/0.34 % CPUTime : % 2.31/0.66 % SZS status Unsatisfiable % 2.31/0.66 % SZS output begin IncompleteProof % 2.31/0.66 cnf(c0, axiom, % 2.31/0.66 ~less_than(j,q)). % 2.31/0.66 cnf(c1, plain, % 2.31/0.66 ~less_than(j,q), % 2.31/0.66 inference(start, [], [c0])). % 2.31/0.66 % 2.31/0.66 cnf(c2, axiom, % 2.31/0.66 X0 = X1 | less_than(X1,X0) | less_than(X0,X1)). % 2.31/0.66 cnf(a0, assumption, % 2.31/0.66 j = X1). % 2.31/0.66 cnf(a1, assumption, % 2.31/0.66 q = X0). % 2.31/0.66 cnf(c3, plain, % 2.31/0.66 $false, % 2.31/0.66 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 2.31/0.66 cnf(c4, plain, % 2.31/0.66 X0 = X1 | less_than(X0,X1), % 2.31/0.66 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 2.31/0.66 % 2.31/0.66 cnf(c5, axiom, % 2.31/0.66 less_than(a(q),a(j))). % 2.31/0.66 cnf(a2, assumption, % 2.31/0.66 q = X0). % 2.31/0.66 cnf(c6, plain, % 2.31/0.66 less_than(X0,X1), % 2.31/0.66 inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])). % 2.31/0.66 cnf(c7, plain, % 2.31/0.66 $false, % 2.31/0.66 inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])). % 2.31/0.66 cnf(c8, plain, % 2.31/0.66 less_than(a(X1),a(j)), % 2.31/0.66 inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])). % 2.31/0.66 % 2.31/0.66 cnf(c9, axiom, % 2.31/0.66 ~less_than(X2,X2)). % 2.31/0.66 cnf(a3, assumption, % 2.31/0.66 a(X1) = X2). % 2.31/0.66 cnf(a4, assumption, % 2.31/0.66 a(j) = X2). % 2.31/0.66 cnf(c10, plain, % 2.31/0.66 $false, % 2.31/0.66 inference(strict_predicate_extension, [assumptions([a3, a4])], [c8, c9])). % 2.31/0.66 cnf(c11, plain, % 2.31/0.66 $false, % 2.31/0.66 inference(strict_predicate_extension, [assumptions([a3, a4])], [c8, c9])). % 2.31/0.66 % 2.31/0.66 cnf(c12, axiom, % 2.31/0.66 ~less_than(a(X3),a(k)) | ~less_than(X3,j) | less_than(X3,i)). % 2.31/0.66 cnf(a5, assumption, % 2.31/0.66 X0 = X3). % 2.31/0.66 cnf(a6, assumption, % 2.31/0.66 X1 = j). % 2.31/0.66 cnf(c13, plain, % 2.31/0.66 $false, % 2.31/0.66 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c12])). % 2.31/0.66 cnf(c14, plain, % 2.31/0.66 ~less_than(a(X3),a(k)) | less_than(X3,i), % 2.31/0.66 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c12])). % 2.31/0.66 % 2.31/0.66 cnf(c15, axiom, % 2.31/0.66 ~less_than(X4,X5) | ~less_than(X6,X4) | less_than(X6,X5)). % 2.31/0.66 cnf(a7, assumption, % 2.31/0.66 a(X3) = X6). % 2.31/0.66 cnf(a8, assumption, % 2.31/0.66 a(k) = X5). % 2.31/0.66 cnf(c16, plain, % 2.31/0.66 less_than(X3,i), % 2.31/0.66 inference(strict_predicate_extension, [assumptions([a7, a8])], [c14, c15])). % 2.31/0.66 cnf(c17, plain, % 2.31/0.66 ~less_than(X4,X5) | ~less_than(X6,X4), % 2.31/0.66 inference(strict_predicate_extension, [assumptions([a7, a8])], [c14, c15])). % 2.31/0.66 % 2.31/0.66 cnf(c18, axiom, % 2.31/0.66 less_than(a(j),a(k))). % 2.31/0.66 cnf(a9, assumption, % 2.31/0.66 X4 = a(j)). % 2.31/0.66 cnf(a10, assumption, % 2.31/0.66 X5 = a(k)). % 2.31/0.66 cnf(c19, plain, % 2.31/0.66 ~less_than(X6,X4), % 2.31/0.66 inference(strict_predicate_extension, [assumptions([a9, a10])], [c17, c18])). % 2.31/0.66 cnf(c20, plain, % 2.31/0.66 $false, % 2.31/0.66 inference(strict_predicate_extension, [assumptions([a9, a10])], [c17, c18])). % 2.31/0.66 % 2.31/0.66 cnf(c21, axiom, % 2.31/0.66 less_than(a(q),a(j))). % 2.31/0.66 cnf(a11, assumption, % 2.31/0.66 X6 = a(q)). % 2.31/0.66 cnf(a12, assumption, % 2.31/0.66 X4 = a(j)). % 2.31/0.66 cnf(c22, plain, % 2.31/0.66 $false, % 2.31/0.66 inference(strict_predicate_extension, [assumptions([a11, a12])], [c19, c21])). % 2.31/0.66 cnf(c23, plain, % 2.31/0.66 $false, % 2.31/0.66 inference(strict_predicate_extension, [assumptions([a11, a12])], [c19, c21])). % 2.31/0.66 % 2.31/0.66 cnf(c24, axiom, % 2.31/0.66 ~less_than(q,i)). % 2.31/0.66 cnf(a13, assumption, % 2.31/0.66 X3 = q). % 2.31/0.66 cnf(a14, assumption, % 2.31/0.66 i = i). % 2.31/0.66 cnf(c25, plain, % 2.31/0.66 $false, % 2.31/0.66 inference(strict_predicate_extension, [assumptions([a13, a14])], [c16, c24])). % 2.31/0.66 cnf(c26, plain, % 2.31/0.66 $false, % 2.31/0.66 inference(strict_predicate_extension, [assumptions([a13, a14])], [c16, c24])). % 2.31/0.66 % 2.31/0.66 cnf(c27, plain, % 2.31/0.66 $false, % 2.31/0.66 inference(constraint_solving, [ % 2.31/0.66 bind(X0, q), % 2.31/0.66 bind(X1, j), % 2.31/0.66 bind(X2, a(X1)), % 2.31/0.66 bind(X3, q), % 2.31/0.66 bind(X4, a(j)), % 2.31/0.66 bind(X5, a(k)), % 2.31/0.66 bind(X6, a(X3)) % 2.31/0.66 ], % 2.31/0.66 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])). % 2.31/0.66 % 2.31/0.66 % SZS output end IncompleteProof %------------------------------------------------------------------------------