%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : FLD071-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 : 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:16:06 EDT 2022 % Result : Unsatisfiable 0.13s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : FLD071-3 : 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.13/0.34 % Computer : n029.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Mon Jun 6 18:11:35 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.35 % SZS status Unsatisfiable % 0.13/0.35 % SZS output begin IncompleteProof % 0.13/0.35 cnf(c0, axiom, % 0.13/0.35 ~less_or_equal(additive_identity,multiply(a,b))). % 0.13/0.35 cnf(c1, plain, % 0.13/0.35 ~less_or_equal(additive_identity,multiply(a,b)), % 0.13/0.35 inference(start, [], [c0])). % 0.13/0.35 % 0.13/0.35 cnf(c2, axiom, % 0.13/0.35 ~product(X0,X1,X2) | ~less_or_equal(additive_identity,X1) | ~less_or_equal(additive_identity,X0) | less_or_equal(additive_identity,X2)). % 0.13/0.35 cnf(a0, assumption, % 0.13/0.35 additive_identity = additive_identity). % 0.13/0.35 cnf(a1, assumption, % 0.13/0.35 multiply(a,b) = X2). % 0.13/0.35 cnf(c3, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.35 cnf(c4, plain, % 0.13/0.35 ~product(X0,X1,X2) | ~less_or_equal(additive_identity,X1) | ~less_or_equal(additive_identity,X0), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.35 % 0.13/0.35 cnf(c5, axiom, % 0.13/0.35 ~defined(X3) | ~defined(X4) | product(X4,X3,multiply(X4,X3))). % 0.13/0.35 cnf(a2, assumption, % 0.13/0.35 X0 = X4). % 0.13/0.35 cnf(a3, assumption, % 0.13/0.35 X1 = X3). % 0.13/0.35 cnf(a4, assumption, % 0.13/0.35 X2 = multiply(X4,X3)). % 0.13/0.35 cnf(c6, plain, % 0.13/0.35 ~less_or_equal(additive_identity,X1) | ~less_or_equal(additive_identity,X0), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])). % 0.13/0.35 cnf(c7, plain, % 0.13/0.35 ~defined(X3) | ~defined(X4), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])). % 0.13/0.35 % 0.13/0.35 cnf(c8, axiom, % 0.13/0.35 defined(b)). % 0.13/0.35 cnf(a5, assumption, % 0.13/0.35 X3 = b). % 0.13/0.35 cnf(c9, plain, % 0.13/0.35 ~defined(X4), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c7, c8])). % 0.13/0.35 cnf(c10, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c7, c8])). % 0.13/0.35 % 0.13/0.35 cnf(c11, axiom, % 0.13/0.35 defined(a)). % 0.13/0.35 cnf(a6, assumption, % 0.13/0.35 X4 = a). % 0.13/0.35 cnf(c12, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6])], [c9, c11])). % 0.13/0.35 cnf(c13, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6])], [c9, c11])). % 0.13/0.35 % 0.13/0.35 cnf(c14, axiom, % 0.13/0.35 less_or_equal(additive_identity,b)). % 0.13/0.35 cnf(a7, assumption, % 0.13/0.35 additive_identity = additive_identity). % 0.13/0.35 cnf(a8, assumption, % 0.13/0.35 X1 = b). % 0.13/0.35 cnf(c15, plain, % 0.13/0.35 ~less_or_equal(additive_identity,X0), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a7, a8])], [c6, c14])). % 0.13/0.35 cnf(c16, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a7, a8])], [c6, c14])). % 0.13/0.35 % 0.13/0.35 cnf(c17, axiom, % 0.13/0.35 less_or_equal(additive_identity,a)). % 0.13/0.35 cnf(a9, assumption, % 0.13/0.35 additive_identity = additive_identity). % 0.13/0.35 cnf(a10, assumption, % 0.13/0.35 X0 = a). % 0.13/0.35 cnf(c18, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c17])). % 0.13/0.35 cnf(c19, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c17])). % 0.13/0.35 % 0.13/0.35 cnf(c20, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(constraint_solving, [ % 0.13/0.35 bind(X0, a), % 0.13/0.35 bind(X1, b), % 0.13/0.35 bind(X2, multiply(a,b)), % 0.13/0.35 bind(X3, b), % 0.13/0.35 bind(X4, a) % 0.13/0.35 ], % 0.13/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])). % 0.13/0.35 % 0.13/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------