%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : FLD060-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 : n028.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:01 EDT 2022 % Result : Unsatisfiable 28.06s 4.17s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : FLD060-1 : TPTP v8.1.0. Bugfixed v2.1.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.34 % Computer : n028.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Mon Jun 6 11:03:58 EDT 2022 % 0.14/0.34 % CPUTime : % 28.06/4.17 % SZS status Unsatisfiable % 28.06/4.17 % SZS output begin IncompleteProof % 28.06/4.17 cnf(c0, axiom, % 28.06/4.17 ~less_or_equal(add(a,a),add(b,b))). % 28.06/4.17 cnf(c1, plain, % 28.06/4.17 ~less_or_equal(add(a,a),add(b,b)), % 28.06/4.17 inference(start, [], [c0])). % 28.06/4.17 % 28.06/4.17 cnf(c2, axiom, % 28.06/4.17 ~less_or_equal(X0,X1) | ~less_or_equal(X2,X0) | less_or_equal(X2,X1)). % 28.06/4.17 cnf(a0, assumption, % 28.06/4.17 add(a,a) = X2). % 28.06/4.17 cnf(a1, assumption, % 28.06/4.17 add(b,b) = X1). % 28.06/4.17 cnf(c3, plain, % 28.06/4.17 $false, % 28.06/4.17 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 28.06/4.17 cnf(c4, plain, % 28.06/4.17 ~less_or_equal(X0,X1) | ~less_or_equal(X2,X0), % 28.06/4.17 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 28.06/4.17 % 28.06/4.17 cnf(c5, axiom, % 28.06/4.17 ~equalish(X3,X4) | ~less_or_equal(X3,X5) | less_or_equal(X4,X5)). % 28.06/4.17 cnf(a2, assumption, % 28.06/4.17 X0 = X4). % 28.06/4.17 cnf(a3, assumption, % 28.06/4.17 X1 = X5). % 28.06/4.17 cnf(c6, plain, % 28.06/4.17 ~less_or_equal(X2,X0), % 28.06/4.17 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 28.06/4.17 cnf(c7, plain, % 28.06/4.17 ~equalish(X3,X4) | ~less_or_equal(X3,X5), % 28.06/4.17 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 28.06/4.17 % 28.06/4.17 cnf(c8, axiom, % 28.06/4.17 ~defined(X6) | ~defined(X7) | equalish(add(X7,X6),add(X6,X7))). % 28.06/4.17 cnf(a4, assumption, % 28.06/4.17 X3 = add(X7,X6)). % 28.06/4.17 cnf(a5, assumption, % 28.06/4.17 X4 = add(X6,X7)). % 28.06/4.17 cnf(c9, plain, % 28.06/4.17 ~less_or_equal(X3,X5), % 28.06/4.17 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 28.06/4.17 cnf(c10, plain, % 28.06/4.17 ~defined(X6) | ~defined(X7), % 28.06/4.17 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 28.06/4.17 % 28.06/4.17 cnf(c11, axiom, % 28.06/4.17 defined(b)). % 28.06/4.17 cnf(a6, assumption, % 28.06/4.17 X6 = b). % 28.06/4.17 cnf(c12, plain, % 28.06/4.17 ~defined(X7), % 28.06/4.17 inference(strict_predicate_extension, [assumptions([a6])], [c10, c11])). % 28.06/4.17 cnf(c13, plain, % 28.06/4.17 $false, % 28.06/4.17 inference(strict_predicate_extension, [assumptions([a6])], [c10, c11])). % 28.06/4.17 % 28.06/4.17 cnf(c14, axiom, % 28.06/4.17 defined(a)). % 28.06/4.17 cnf(a7, assumption, % 28.06/4.17 X7 = a). % 28.06/4.17 cnf(c15, plain, % 28.06/4.17 $false, % 28.06/4.17 inference(strict_predicate_extension, [assumptions([a7])], [c12, c14])). % 28.06/4.17 cnf(c16, plain, % 28.06/4.17 $false, % 28.06/4.17 inference(strict_predicate_extension, [assumptions([a7])], [c12, c14])). % 28.06/4.17 % 28.06/4.17 cnf(c17, axiom, % 28.06/4.17 ~less_or_equal(X8,X9) | ~defined(X10) | less_or_equal(add(X8,X10),add(X9,X10))). % 28.06/4.17 cnf(a8, assumption, % 28.06/4.17 X3 = add(X8,X10)). % 28.06/4.17 cnf(a9, assumption, % 28.06/4.17 X5 = add(X9,X10)). % 28.06/4.17 cnf(c18, plain, % 28.06/4.17 $false, % 28.06/4.17 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c17])). % 28.06/4.17 cnf(c19, plain, % 28.06/4.17 ~less_or_equal(X8,X9) | ~defined(X10), % 28.06/4.17 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c17])). % 28.06/4.17 % 28.06/4.17 cnf(c20, axiom, % 28.06/4.17 less_or_equal(a,b)). % 28.06/4.17 cnf(a10, assumption, % 28.06/4.17 X8 = a). % 28.06/4.17 cnf(a11, assumption, % 28.06/4.17 X9 = b). % 28.06/4.17 cnf(c21, plain, % 28.06/4.17 ~defined(X10), % 28.06/4.17 inference(strict_predicate_extension, [assumptions([a10, a11])], [c19, c20])). % 28.06/4.17 cnf(c22, plain, % 28.06/4.17 $false, % 28.06/4.17 inference(strict_predicate_extension, [assumptions([a10, a11])], [c19, c20])). % 28.06/4.17 % 28.06/4.17 cnf(c23, plain, % 28.06/4.17 defined(X6)). % 28.06/4.17 cnf(a12, assumption, % 28.06/4.17 X10 = X6). % 28.06/4.17 cnf(c24, plain, % 28.06/4.17 $false, % 28.06/4.17 inference(predicate_reduction, [assumptions([a12])], [c21, c23])). % 28.06/4.17 % 28.06/4.17 cnf(c25, axiom, % 28.06/4.17 ~less_or_equal(X11,X12) | ~defined(X13) | less_or_equal(add(X11,X13),add(X12,X13))). % 28.06/4.17 cnf(a13, assumption, % 28.06/4.17 X2 = add(X11,X13)). % 28.06/4.17 cnf(a14, assumption, % 28.06/4.17 X0 = add(X12,X13)). % 28.06/4.17 cnf(c26, plain, % 28.06/4.17 $false, % 28.06/4.17 inference(strict_predicate_extension, [assumptions([a13, a14])], [c6, c25])). % 28.06/4.17 cnf(c27, plain, % 28.06/4.17 ~less_or_equal(X11,X12) | ~defined(X13), % 28.06/4.17 inference(strict_predicate_extension, [assumptions([a13, a14])], [c6, c25])). % 28.06/4.17 % 28.06/4.17 cnf(c28, plain, % 28.06/4.17 less_or_equal(X8,X9)). % 28.06/4.17 cnf(a15, assumption, % 28.06/4.17 X11 = X8). % 28.06/4.17 cnf(a16, assumption, % 28.06/4.17 X12 = X9). % 28.06/4.17 cnf(c29, plain, % 28.06/4.17 ~defined(X13), % 28.06/4.17 inference(predicate_reduction, [assumptions([a15, a16])], [c27, c28])). % 28.06/4.17 % 28.06/4.17 cnf(c30, plain, % 28.06/4.17 defined(X7)). % 28.06/4.17 cnf(a17, assumption, % 28.06/4.17 X13 = X7). % 28.06/4.17 cnf(c31, plain, % 28.06/4.17 $false, % 28.06/4.17 inference(predicate_reduction, [assumptions([a17])], [c29, c30])). % 28.06/4.17 % 28.06/4.17 cnf(c32, plain, % 28.06/4.17 $false, % 28.06/4.17 inference(constraint_solving, [ % 28.06/4.17 bind(X0, add(X6,X7)), % 28.06/4.17 bind(X1, add(b,b)), % 28.06/4.17 bind(X2, add(a,a)), % 28.06/4.17 bind(X3, add(X7,X6)), % 28.06/4.17 bind(X4, add(X6,X7)), % 28.06/4.17 bind(X5, add(b,b)), % 28.06/4.17 bind(X6, b), % 28.06/4.17 bind(X7, a), % 28.06/4.17 bind(X8, a), % 28.06/4.17 bind(X9, b), % 28.06/4.17 bind(X10, b), % 28.06/4.17 bind(X11, a), % 28.06/4.17 bind(X12, b), % 28.06/4.17 bind(X13, a) % 28.06/4.17 ], % 28.06/4.17 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])). % 28.06/4.17 % 28.06/4.17 % SZS output end IncompleteProof %------------------------------------------------------------------------------