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