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