%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : FLD034-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 : 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:15:53 EDT 2022 % Result : Unsatisfiable 0.21s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : FLD034-1 : TPTP v8.1.0. Bugfixed v2.1.0. % 0.04/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.34 % Computer : n025.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.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Mon Jun 6 16:15:18 EDT 2022 % 0.14/0.35 % CPUTime : % 0.21/0.36 % SZS status Unsatisfiable % 0.21/0.36 % SZS output begin IncompleteProof % 0.21/0.36 cnf(c0, axiom, % 0.21/0.36 ~equalish(multiply(m,a),a)). % 0.21/0.36 cnf(c1, plain, % 0.21/0.36 ~equalish(multiply(m,a),a), % 0.21/0.36 inference(start, [], [c0])). % 0.21/0.36 % 0.21/0.36 cnf(c2, axiom, % 0.21/0.36 ~equalish(X0,X1) | ~equalish(X2,X0) | equalish(X2,X1)). % 0.21/0.36 cnf(a0, assumption, % 0.21/0.36 multiply(m,a) = X2). % 0.21/0.36 cnf(a1, assumption, % 0.21/0.36 a = X1). % 0.21/0.36 cnf(c3, plain, % 0.21/0.36 $false, % 0.21/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.36 cnf(c4, plain, % 0.21/0.36 ~equalish(X0,X1) | ~equalish(X2,X0), % 0.21/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.36 % 0.21/0.36 cnf(c5, axiom, % 0.21/0.36 ~defined(X3) | equalish(multiply(multiplicative_identity,X3),X3)). % 0.21/0.36 cnf(a2, assumption, % 0.21/0.36 X0 = multiply(multiplicative_identity,X3)). % 0.21/0.36 cnf(a3, assumption, % 0.21/0.36 X1 = X3). % 0.21/0.36 cnf(c6, plain, % 0.21/0.36 ~equalish(X2,X0), % 0.21/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.21/0.36 cnf(c7, plain, % 0.21/0.36 ~defined(X3), % 0.21/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.21/0.36 % 0.21/0.36 cnf(c8, axiom, % 0.21/0.36 defined(a)). % 0.21/0.36 cnf(a4, assumption, % 0.21/0.36 X3 = a). % 0.21/0.36 cnf(c9, plain, % 0.21/0.36 $false, % 0.21/0.36 inference(strict_predicate_extension, [assumptions([a4])], [c7, c8])). % 0.21/0.36 cnf(c10, plain, % 0.21/0.36 $false, % 0.21/0.36 inference(strict_predicate_extension, [assumptions([a4])], [c7, c8])). % 0.21/0.36 % 0.21/0.36 cnf(c11, axiom, % 0.21/0.36 ~equalish(X4,X5) | ~defined(X6) | equalish(multiply(X4,X6),multiply(X5,X6))). % 0.21/0.36 cnf(a5, assumption, % 0.21/0.36 X2 = multiply(X4,X6)). % 0.21/0.36 cnf(a6, assumption, % 0.21/0.36 X0 = multiply(X5,X6)). % 0.21/0.36 cnf(c12, plain, % 0.21/0.36 $false, % 0.21/0.36 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c11])). % 0.21/0.36 cnf(c13, plain, % 0.21/0.36 ~equalish(X4,X5) | ~defined(X6), % 0.21/0.36 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c11])). % 0.21/0.36 % 0.21/0.36 cnf(c14, axiom, % 0.21/0.36 equalish(m,multiplicative_identity)). % 0.21/0.36 cnf(a7, assumption, % 0.21/0.36 X4 = m). % 0.21/0.36 cnf(a8, assumption, % 0.21/0.36 X5 = multiplicative_identity). % 0.21/0.36 cnf(c15, plain, % 0.21/0.36 ~defined(X6), % 0.21/0.36 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])). % 0.21/0.36 cnf(c16, plain, % 0.21/0.36 $false, % 0.21/0.36 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])). % 0.21/0.36 % 0.21/0.36 cnf(c17, plain, % 0.21/0.36 defined(X3)). % 0.21/0.36 cnf(a9, assumption, % 0.21/0.36 X6 = X3). % 0.21/0.36 cnf(c18, plain, % 0.21/0.36 $false, % 0.21/0.36 inference(predicate_reduction, [assumptions([a9])], [c15, c17])). % 0.21/0.36 % 0.21/0.36 cnf(c19, plain, % 0.21/0.36 $false, % 0.21/0.36 inference(constraint_solving, [ % 0.21/0.36 bind(X0, multiply(multiplicative_identity,X3)), % 0.21/0.36 bind(X1, a), % 0.21/0.36 bind(X2, multiply(m,a)), % 0.21/0.36 bind(X3, a), % 0.21/0.36 bind(X4, m), % 0.21/0.36 bind(X5, multiplicative_identity), % 0.21/0.36 bind(X6, a) % 0.21/0.36 ], % 0.21/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])). % 0.21/0.36 % 0.21/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------