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