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