%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : FLD006-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 : n021.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 0.14s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : FLD006-1 : TPTP v8.1.0. Bugfixed v2.1.0. % 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.34 % Computer : n021.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 18:40:20 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.35 % SZS status Unsatisfiable % 0.14/0.35 % SZS output begin IncompleteProof % 0.14/0.35 cnf(c0, axiom, % 0.14/0.35 ~equalish(additive_inverse(additive_identity),additive_identity)). % 0.14/0.35 cnf(c1, plain, % 0.14/0.35 ~equalish(additive_inverse(additive_identity),additive_identity), % 0.14/0.35 inference(start, [], [c0])). % 0.14/0.35 % 0.14/0.35 cnf(c2, axiom, % 0.14/0.35 ~equalish(X0,X1) | ~equalish(X2,X0) | equalish(X2,X1)). % 0.14/0.35 cnf(a0, assumption, % 0.14/0.35 additive_inverse(additive_identity) = X2). % 0.14/0.35 cnf(a1, assumption, % 0.14/0.35 additive_identity = X1). % 0.14/0.35 cnf(c3, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.14/0.35 cnf(c4, plain, % 0.14/0.35 ~equalish(X0,X1) | ~equalish(X2,X0), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.14/0.35 % 0.14/0.35 cnf(c5, axiom, % 0.14/0.35 ~defined(X3) | equalish(add(X3,additive_inverse(X3)),additive_identity)). % 0.14/0.35 cnf(a2, assumption, % 0.14/0.35 X0 = add(X3,additive_inverse(X3))). % 0.14/0.35 cnf(a3, assumption, % 0.14/0.35 X1 = additive_identity). % 0.14/0.35 cnf(c6, plain, % 0.14/0.35 ~equalish(X2,X0), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.14/0.35 cnf(c7, plain, % 0.14/0.35 ~defined(X3), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.14/0.35 % 0.14/0.35 cnf(c8, axiom, % 0.14/0.35 defined(additive_identity)). % 0.14/0.35 cnf(a4, assumption, % 0.14/0.35 X3 = additive_identity). % 0.14/0.35 cnf(c9, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a4])], [c7, c8])). % 0.14/0.35 cnf(c10, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a4])], [c7, c8])). % 0.14/0.35 % 0.14/0.35 cnf(c11, axiom, % 0.14/0.35 ~equalish(X4,X5) | equalish(X5,X4)). % 0.14/0.35 cnf(a5, assumption, % 0.14/0.35 X2 = X5). % 0.14/0.35 cnf(a6, assumption, % 0.14/0.35 X0 = X4). % 0.14/0.35 cnf(c12, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c11])). % 0.14/0.35 cnf(c13, plain, % 0.14/0.35 ~equalish(X4,X5), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c11])). % 0.14/0.35 % 0.14/0.35 cnf(c14, axiom, % 0.14/0.35 ~defined(X6) | equalish(add(additive_identity,X6),X6)). % 0.14/0.35 cnf(a7, assumption, % 0.14/0.35 X4 = add(additive_identity,X6)). % 0.14/0.35 cnf(a8, assumption, % 0.14/0.35 X5 = X6). % 0.14/0.35 cnf(c15, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])). % 0.14/0.35 cnf(c16, plain, % 0.14/0.35 ~defined(X6), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])). % 0.14/0.35 % 0.14/0.35 cnf(c17, axiom, % 0.14/0.35 ~defined(X7) | defined(additive_inverse(X7))). % 0.14/0.35 cnf(a9, assumption, % 0.14/0.35 X6 = additive_inverse(X7)). % 0.14/0.35 cnf(c18, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a9])], [c16, c17])). % 0.14/0.35 cnf(c19, plain, % 0.14/0.35 ~defined(X7), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a9])], [c16, c17])). % 0.14/0.35 % 0.14/0.35 cnf(c20, plain, % 0.14/0.35 defined(X3)). % 0.14/0.35 cnf(a10, assumption, % 0.14/0.35 X7 = X3). % 0.14/0.35 cnf(c21, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(predicate_reduction, [assumptions([a10])], [c19, c20])). % 0.14/0.35 % 0.14/0.35 cnf(c22, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(constraint_solving, [ % 0.14/0.35 bind(X0, add(X3,additive_inverse(X3))), % 0.14/0.35 bind(X1, additive_identity), % 0.14/0.35 bind(X2, additive_inverse(additive_identity)), % 0.14/0.35 bind(X3, additive_identity), % 0.14/0.35 bind(X4, add(X3,additive_inverse(X3))), % 0.14/0.35 bind(X5, additive_inverse(additive_identity)), % 0.14/0.35 bind(X6, additive_inverse(X3)), % 0.14/0.35 bind(X7, additive_identity) % 0.14/0.35 ], % 0.14/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])). % 0.14/0.35 % 0.14/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------