%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : FLD061-1 : TPTP v8.1.0. Bugfixed v2.1.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n023.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 : Sat Jul 16 02:16:02 EDT 2022 % Result : Unsatisfiable 199.06s 27.20s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : FLD061-1 : TPTP v8.1.0. Bugfixed v2.1.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n023.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 : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue Jun 7 00:58:38 EDT 2022 % 0.12/0.33 % CPUTime : % 199.06/27.20 % SZS status Unsatisfiable % 199.06/27.20 % SZS output begin IncompleteProof % 199.06/27.20 cnf(c0, axiom, % 199.06/27.20 less_or_equal(a,b)). % 199.06/27.20 cnf(c1, plain, % 199.06/27.20 less_or_equal(a,b), % 199.06/27.20 inference(start, [], [c0])). % 199.06/27.20 % 199.06/27.20 cnf(c2, axiom, % 199.06/27.20 ~less_or_equal(X0,X1) | ~defined(X2) | less_or_equal(add(X0,X2),add(X1,X2))). % 199.06/27.20 cnf(a0, assumption, % 199.06/27.20 a = X0). % 199.06/27.20 cnf(a1, assumption, % 199.06/27.20 b = X1). % 199.06/27.20 cnf(c3, plain, % 199.06/27.20 $false, % 199.06/27.20 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 199.06/27.20 cnf(c4, plain, % 199.06/27.20 ~defined(X2) | less_or_equal(add(X0,X2),add(X1,X2)), % 199.06/27.20 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 199.06/27.20 % 199.06/27.20 cnf(c5, axiom, % 199.06/27.20 defined(c)). % 199.06/27.20 cnf(a2, assumption, % 199.06/27.20 X2 = c). % 199.06/27.20 cnf(c6, plain, % 199.06/27.20 less_or_equal(add(X0,X2),add(X1,X2)), % 199.06/27.20 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])). % 199.06/27.20 cnf(c7, plain, % 199.06/27.20 $false, % 199.06/27.20 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])). % 199.06/27.20 % 199.06/27.20 cnf(c8, axiom, % 199.06/27.20 ~less_or_equal(X3,X4) | ~less_or_equal(X5,X3) | less_or_equal(X5,X4)). % 199.06/27.20 cnf(a3, assumption, % 199.06/27.20 add(X0,X2) = X5). % 199.06/27.20 cnf(a4, assumption, % 199.06/27.20 add(X1,X2) = X3). % 199.06/27.20 cnf(c9, plain, % 199.06/27.20 $false, % 199.06/27.20 inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])). % 199.06/27.20 cnf(c10, plain, % 199.06/27.20 ~less_or_equal(X3,X4) | less_or_equal(X5,X4), % 199.06/27.20 inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])). % 199.06/27.20 % 199.06/27.20 cnf(c11, axiom, % 199.06/27.20 ~equalish(X6,X7) | ~less_or_equal(X6,X8) | less_or_equal(X7,X8)). % 199.06/27.20 cnf(a5, assumption, % 199.06/27.20 X3 = X7). % 199.06/27.20 cnf(a6, assumption, % 199.06/27.20 X4 = X8). % 199.06/27.20 cnf(c12, plain, % 199.06/27.20 less_or_equal(X5,X4), % 199.06/27.20 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 199.06/27.20 cnf(c13, plain, % 199.06/27.20 ~equalish(X6,X7) | ~less_or_equal(X6,X8), % 199.06/27.20 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 199.06/27.20 % 199.06/27.20 cnf(c14, axiom, % 199.06/27.20 ~defined(X9) | ~defined(X10) | equalish(add(X10,X9),add(X9,X10))). % 199.06/27.20 cnf(a7, assumption, % 199.06/27.20 X6 = add(X10,X9)). % 199.06/27.20 cnf(a8, assumption, % 199.06/27.20 X7 = add(X9,X10)). % 199.06/27.20 cnf(c15, plain, % 199.06/27.20 ~less_or_equal(X6,X8), % 199.06/27.20 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])). % 199.06/27.20 cnf(c16, plain, % 199.06/27.20 ~defined(X9) | ~defined(X10), % 199.06/27.20 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])). % 199.06/27.20 % 199.06/27.20 cnf(c17, axiom, % 199.06/27.20 defined(b)). % 199.06/27.20 cnf(a9, assumption, % 199.06/27.20 X9 = b). % 199.06/27.20 cnf(c18, plain, % 199.06/27.20 ~defined(X10), % 199.06/27.20 inference(strict_predicate_extension, [assumptions([a9])], [c16, c17])). % 199.06/27.20 cnf(c19, plain, % 199.06/27.20 $false, % 199.06/27.20 inference(strict_predicate_extension, [assumptions([a9])], [c16, c17])). % 199.06/27.20 % 199.06/27.20 cnf(c20, plain, % 199.06/27.20 defined(X2)). % 199.06/27.20 cnf(a10, assumption, % 199.06/27.20 X10 = X2). % 199.06/27.20 cnf(c21, plain, % 199.06/27.20 $false, % 199.06/27.20 inference(predicate_reduction, [assumptions([a10])], [c18, c20])). % 199.06/27.20 % 199.06/27.20 cnf(c22, axiom, % 199.06/27.20 ~less_or_equal(X11,X12) | ~defined(X13) | less_or_equal(add(X11,X13),add(X12,X13))). % 199.06/27.20 cnf(a11, assumption, % 199.06/27.20 X6 = add(X11,X13)). % 199.06/27.20 cnf(a12, assumption, % 199.06/27.20 X8 = add(X12,X13)). % 199.06/27.20 cnf(c23, plain, % 199.06/27.20 $false, % 199.06/27.20 inference(strict_predicate_extension, [assumptions([a11, a12])], [c15, c22])). % 199.06/27.20 cnf(c24, plain, % 199.06/27.20 ~less_or_equal(X11,X12) | ~defined(X13), % 199.06/27.20 inference(strict_predicate_extension, [assumptions([a11, a12])], [c15, c22])). % 199.06/27.20 % 199.06/27.20 cnf(c25, axiom, % 199.06/27.20 less_or_equal(c,d)). % 199.06/27.20 cnf(a13, assumption, % 199.06/27.20 X11 = c). % 199.06/27.20 cnf(a14, assumption, % 199.06/27.20 X12 = d). % 199.06/27.20 cnf(c26, plain, % 199.06/27.20 ~defined(X13), % 199.06/27.20 inference(strict_predicate_extension, [assumptions([a13, a14])], [c24, c25])). % 199.06/27.20 cnf(c27, plain, % 199.06/27.20 $false, % 199.06/27.20 inference(strict_predicate_extension, [assumptions([a13, a14])], [c24, c25])). % 199.06/27.20 % 199.06/27.20 cnf(c28, plain, % 199.06/27.20 defined(X9)). % 199.06/27.20 cnf(a15, assumption, % 199.06/27.20 X13 = X9). % 199.06/27.20 cnf(c29, plain, % 199.06/27.20 $false, % 199.06/27.20 inference(predicate_reduction, [assumptions([a15])], [c26, c28])). % 199.06/27.20 % 199.06/27.20 cnf(c30, axiom, % 199.06/27.20 ~less_or_equal(add(a,c),add(d,b))). % 199.06/27.20 cnf(a16, assumption, % 199.06/27.20 X5 = add(a,c)). % 199.06/27.20 cnf(a17, assumption, % 199.06/27.20 X4 = add(d,b)). % 199.06/27.20 cnf(c31, plain, % 199.06/27.20 $false, % 199.06/27.20 inference(strict_predicate_extension, [assumptions([a16, a17])], [c12, c30])). % 199.06/27.20 cnf(c32, plain, % 199.06/27.20 $false, % 199.06/27.20 inference(strict_predicate_extension, [assumptions([a16, a17])], [c12, c30])). % 199.06/27.20 % 199.06/27.20 cnf(c33, plain, % 199.06/27.20 $false, % 199.06/27.20 inference(constraint_solving, [ % 199.06/27.20 bind(X0, a), % 199.06/27.20 bind(X1, b), % 199.06/27.20 bind(X2, c), % 199.06/27.20 bind(X3, add(X1,X2)), % 199.06/27.20 bind(X4, add(X12,X13)), % 199.06/27.20 bind(X5, add(X0,X2)), % 199.06/27.20 bind(X6, add(X10,X9)), % 199.06/27.20 bind(X7, add(X1,X2)), % 199.06/27.20 bind(X8, add(X12,X13)), % 199.06/27.20 bind(X9, b), % 199.06/27.20 bind(X10, c), % 199.06/27.20 bind(X11, c), % 199.06/27.20 bind(X12, d), % 199.06/27.20 bind(X13, b) % 199.06/27.20 ], % 199.06/27.20 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])). % 199.06/27.20 % 199.06/27.20 % SZS output end IncompleteProof %------------------------------------------------------------------------------