%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : FLD023-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 : n029.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:49 EDT 2022 % Result : Unsatisfiable 0.19s 0.43s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : FLD023-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.13/0.33 % Computer : n029.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Mon Jun 6 22:06:19 EDT 2022 % 0.13/0.33 % CPUTime : % 0.19/0.43 % SZS status Unsatisfiable % 0.19/0.43 % SZS output begin IncompleteProof % 0.19/0.43 cnf(c0, axiom, % 0.19/0.43 ~equalish(additive_identity,add(b,additive_inverse(a)))). % 0.19/0.43 cnf(c1, plain, % 0.19/0.43 ~equalish(additive_identity,add(b,additive_inverse(a))), % 0.19/0.43 inference(start, [], [c0])). % 0.19/0.43 % 0.19/0.43 cnf(c2, axiom, % 0.19/0.43 ~equalish(X0,X1) | ~equalish(X2,X0) | equalish(X2,X1)). % 0.19/0.43 cnf(a0, assumption, % 0.19/0.43 additive_identity = X2). % 0.19/0.43 cnf(a1, assumption, % 0.19/0.43 add(b,additive_inverse(a)) = X1). % 0.19/0.43 cnf(c3, plain, % 0.19/0.43 $false, % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.19/0.43 cnf(c4, plain, % 0.19/0.43 ~equalish(X0,X1) | ~equalish(X2,X0), % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.19/0.43 % 0.19/0.43 cnf(c5, axiom, % 0.19/0.43 ~equalish(X3,X4) | ~defined(X5) | equalish(add(X3,X5),add(X4,X5))). % 0.19/0.43 cnf(a2, assumption, % 0.19/0.43 X0 = add(X3,X5)). % 0.19/0.43 cnf(a3, assumption, % 0.19/0.43 X1 = add(X4,X5)). % 0.19/0.43 cnf(c6, plain, % 0.19/0.43 ~equalish(X2,X0), % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.19/0.43 cnf(c7, plain, % 0.19/0.43 ~equalish(X3,X4) | ~defined(X5), % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.19/0.43 % 0.19/0.43 cnf(c8, axiom, % 0.19/0.43 equalish(a,b)). % 0.19/0.43 cnf(a4, assumption, % 0.19/0.43 X3 = a). % 0.19/0.43 cnf(a5, assumption, % 0.19/0.43 X4 = b). % 0.19/0.43 cnf(c9, plain, % 0.19/0.43 ~defined(X5), % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.19/0.43 cnf(c10, plain, % 0.19/0.43 $false, % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.19/0.43 % 0.19/0.43 cnf(c11, axiom, % 0.19/0.43 ~defined(X6) | defined(additive_inverse(X6))). % 0.19/0.43 cnf(a6, assumption, % 0.19/0.43 X5 = additive_inverse(X6)). % 0.19/0.43 cnf(c12, plain, % 0.19/0.43 $false, % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a6])], [c9, c11])). % 0.19/0.43 cnf(c13, plain, % 0.19/0.43 ~defined(X6), % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a6])], [c9, c11])). % 0.19/0.43 % 0.19/0.43 cnf(c14, axiom, % 0.19/0.43 defined(a)). % 0.19/0.43 cnf(a7, assumption, % 0.19/0.43 X6 = a). % 0.19/0.43 cnf(c15, plain, % 0.19/0.43 $false, % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a7])], [c13, c14])). % 0.19/0.43 cnf(c16, plain, % 0.19/0.43 $false, % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a7])], [c13, c14])). % 0.19/0.43 % 0.19/0.43 cnf(c17, axiom, % 0.19/0.43 ~equalish(X7,X8) | equalish(X8,X7)). % 0.19/0.43 cnf(a8, assumption, % 0.19/0.43 X2 = X8). % 0.19/0.43 cnf(a9, assumption, % 0.19/0.43 X0 = X7). % 0.19/0.43 cnf(c18, plain, % 0.19/0.43 $false, % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c17])). % 0.19/0.43 cnf(c19, plain, % 0.19/0.43 ~equalish(X7,X8), % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c17])). % 0.19/0.43 % 0.19/0.43 cnf(c20, axiom, % 0.19/0.43 ~defined(X9) | equalish(add(X9,additive_inverse(X9)),additive_identity)). % 0.19/0.43 cnf(a10, assumption, % 0.19/0.43 X7 = add(X9,additive_inverse(X9))). % 0.19/0.43 cnf(a11, assumption, % 0.19/0.43 X8 = additive_identity). % 0.19/0.43 cnf(c21, plain, % 0.19/0.43 $false, % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a10, a11])], [c19, c20])). % 0.19/0.43 cnf(c22, plain, % 0.19/0.43 ~defined(X9), % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a10, a11])], [c19, c20])). % 0.19/0.43 % 0.19/0.43 cnf(c23, plain, % 0.19/0.43 defined(X6)). % 0.19/0.43 cnf(a12, assumption, % 0.19/0.43 X9 = X6). % 0.19/0.43 cnf(c24, plain, % 0.19/0.43 $false, % 0.19/0.43 inference(predicate_reduction, [assumptions([a12])], [c22, c23])). % 0.19/0.43 % 0.19/0.43 cnf(c25, plain, % 0.19/0.43 $false, % 0.19/0.43 inference(constraint_solving, [ % 0.19/0.43 bind(X0, add(X3,X5)), % 0.19/0.43 bind(X1, add(b,additive_inverse(a))), % 0.19/0.43 bind(X2, additive_identity), % 0.19/0.43 bind(X3, a), % 0.19/0.43 bind(X4, b), % 0.19/0.43 bind(X5, additive_inverse(a)), % 0.19/0.43 bind(X6, a), % 0.19/0.43 bind(X7, add(X3,X5)), % 0.19/0.43 bind(X8, additive_identity), % 0.19/0.43 bind(X9, a) % 0.19/0.43 ], % 0.19/0.43 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])). % 0.19/0.43 % 0.19/0.43 % SZS output end IncompleteProof %------------------------------------------------------------------------------