%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GRP159-1 : TPTP v8.1.0. Bugfixed v1.2.1. % 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 10:09:25 EDT 2022 % Result : Unsatisfiable 235.38s 30.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : GRP159-1 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n025.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Mon Jun 13 22:21:39 EDT 2022 % 0.12/0.33 % CPUTime : % 235.38/30.34 % SZS status Unsatisfiable % 235.38/30.34 % SZS output begin IncompleteProof % 235.38/30.34 cnf(c0, axiom, % 235.38/30.34 multiply(c,b) != least_upper_bound(multiply(c,a),multiply(c,b))). % 235.38/30.34 cnf(c1, plain, % 235.38/30.34 multiply(c,b) != least_upper_bound(multiply(c,a),multiply(c,b)), % 235.38/30.34 inference(start, [], [c0])). % 235.38/30.34 % 235.38/30.34 cnf(c2, axiom, % 235.38/30.34 least_upper_bound(X0,X1) = least_upper_bound(X1,X0)). % 235.38/30.34 cnf(a0, assumption, % 235.38/30.34 least_upper_bound(multiply(c,a),multiply(c,b)) = least_upper_bound(X1,X0)). % 235.38/30.34 cnf(c3, plain, % 235.38/30.34 $false, % 235.38/30.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 235.38/30.34 cnf(c4, plain, % 235.38/30.34 $false, % 235.38/30.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 235.38/30.34 cnf(c5, plain, % 235.38/30.34 X2 != least_upper_bound(X0,X1) | multiply(c,b) != X2, % 235.38/30.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 235.38/30.34 % 235.38/30.34 cnf(c6, axiom, % 235.38/30.34 multiply(X3,least_upper_bound(X4,X5)) = least_upper_bound(multiply(X3,X4),multiply(X3,X5))). % 235.38/30.34 cnf(a1, assumption, % 235.38/30.34 least_upper_bound(X0,X1) = least_upper_bound(multiply(X3,X4),multiply(X3,X5))). % 235.38/30.34 cnf(c7, plain, % 235.38/30.34 multiply(c,b) != X2, % 235.38/30.34 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 235.38/30.34 cnf(c8, plain, % 235.38/30.34 $false, % 235.38/30.34 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 235.38/30.34 cnf(c9, plain, % 235.38/30.34 X6 != multiply(X3,least_upper_bound(X4,X5)) | X2 != X6, % 235.38/30.34 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 235.38/30.34 % 235.38/30.34 cnf(c10, axiom, % 235.38/30.34 least_upper_bound(X7,greatest_lower_bound(X7,X8)) = X7). % 235.38/30.34 cnf(a2, assumption, % 235.38/30.34 least_upper_bound(X9,X10) = least_upper_bound(X4,X5)). % 235.38/30.34 cnf(c11, plain, % 235.38/30.34 X2 != X6, % 235.38/30.34 inference(lazy_function_extension, [assumptions([a2])], [c9, c10])). % 235.38/30.34 cnf(c12, plain, % 235.38/30.34 $false, % 235.38/30.34 inference(lazy_function_extension, [assumptions([a2])], [c9, c10])). % 235.38/30.34 cnf(c13, plain, % 235.38/30.34 X9 != X7 | X10 != greatest_lower_bound(X7,X8) | X11 != X7 | X6 != multiply(X3,X11), % 235.38/30.34 inference(lazy_function_extension, [assumptions([a2])], [c9, c10])). % 235.38/30.34 % 235.38/30.34 cnf(a3, assumption, % 235.38/30.34 X9 = X7). % 235.38/30.34 cnf(c14, plain, % 235.38/30.34 X10 != greatest_lower_bound(X7,X8) | X11 != X7 | X6 != multiply(X3,X11), % 235.38/30.34 inference(reflexivity, [assumptions([a3])], [c13])). % 235.38/30.34 % 235.38/30.34 cnf(c15, axiom, % 235.38/30.34 greatest_lower_bound(X12,X13) = greatest_lower_bound(X13,X12)). % 235.38/30.34 cnf(a4, assumption, % 235.38/30.34 greatest_lower_bound(X7,X8) = greatest_lower_bound(X12,X13)). % 235.38/30.34 cnf(c16, plain, % 235.38/30.34 X11 != X7 | X6 != multiply(X3,X11), % 235.38/30.34 inference(strict_function_extension, [assumptions([a4])], [c14, c15])). % 235.38/30.34 cnf(c17, plain, % 235.38/30.34 $false, % 235.38/30.34 inference(strict_function_extension, [assumptions([a4])], [c14, c15])). % 235.38/30.34 cnf(c18, plain, % 235.38/30.34 X14 != greatest_lower_bound(X13,X12) | X10 != X14, % 235.38/30.34 inference(strict_function_extension, [assumptions([a4])], [c14, c15])). % 235.38/30.34 % 235.38/30.34 cnf(c19, axiom, % 235.38/30.34 a = greatest_lower_bound(a,b)). % 235.38/30.34 cnf(a5, assumption, % 235.38/30.34 greatest_lower_bound(X13,X12) = greatest_lower_bound(a,b)). % 235.38/30.34 cnf(c20, plain, % 235.38/30.34 X10 != X14, % 235.38/30.34 inference(strict_function_extension, [assumptions([a5])], [c18, c19])). % 235.38/30.34 cnf(c21, plain, % 235.38/30.34 $false, % 235.38/30.34 inference(strict_function_extension, [assumptions([a5])], [c18, c19])). % 235.38/30.34 cnf(c22, plain, % 235.38/30.34 X15 != a | X14 != X15, % 235.38/30.34 inference(strict_function_extension, [assumptions([a5])], [c18, c19])). % 235.38/30.34 % 235.38/30.34 cnf(a6, assumption, % 235.38/30.34 X15 = a). % 235.38/30.34 cnf(c23, plain, % 235.38/30.34 X14 != X15, % 235.38/30.34 inference(reflexivity, [assumptions([a6])], [c22])). % 235.38/30.34 % 235.38/30.34 cnf(a7, assumption, % 235.38/30.34 X14 = X15). % 235.38/30.34 cnf(c24, plain, % 235.38/30.34 $false, % 235.38/30.34 inference(reflexivity, [assumptions([a7])], [c23])). % 235.38/30.34 % 235.38/30.34 cnf(a8, assumption, % 235.38/30.34 X10 = X14). % 235.38/30.34 cnf(c25, plain, % 235.38/30.34 $false, % 235.38/30.34 inference(reflexivity, [assumptions([a8])], [c20])). % 235.38/30.34 % 235.38/30.34 cnf(a9, assumption, % 235.38/30.34 X11 = X7). % 235.38/30.34 cnf(c26, plain, % 235.38/30.34 X6 != multiply(X3,X11), % 235.38/30.34 inference(reflexivity, [assumptions([a9])], [c16])). % 235.38/30.34 % 235.38/30.34 cnf(a10, assumption, % 235.38/30.34 X6 = multiply(X3,X11)). % 235.38/30.34 cnf(c27, plain, % 235.38/30.34 $false, % 235.38/30.34 inference(reflexivity, [assumptions([a10])], [c26])). % 235.38/30.34 % 235.38/30.34 cnf(a11, assumption, % 235.38/30.34 X2 = X6). % 235.38/30.34 cnf(c28, plain, % 235.38/30.34 $false, % 235.38/30.34 inference(reflexivity, [assumptions([a11])], [c11])). % 235.38/30.34 % 235.38/30.34 cnf(a12, assumption, % 235.38/30.34 multiply(c,b) = X2). % 235.38/30.34 cnf(c29, plain, % 235.38/30.34 $false, % 235.38/30.34 inference(reflexivity, [assumptions([a12])], [c7])). % 235.38/30.34 % 235.38/30.34 cnf(c30, plain, % 235.38/30.34 $false, % 235.38/30.34 inference(constraint_solving, [ % 235.38/30.34 bind(X0, multiply(c,b)), % 235.38/30.34 bind(X1, multiply(c,a)), % 235.38/30.34 bind(X2, multiply(X3,X11)), % 235.38/30.34 bind(X3, c), % 235.38/30.34 bind(X4, b), % 235.38/30.34 bind(X5, a), % 235.38/30.34 bind(X6, multiply(X3,X11)), % 235.38/30.34 bind(X7, b), % 235.38/30.34 bind(X8, a), % 235.38/30.34 bind(X11, b), % 235.38/30.34 bind(X9, b), % 235.38/30.34 bind(X10, a), % 235.38/30.34 bind(X12, b), % 235.38/30.34 bind(X13, a), % 235.38/30.34 bind(X14, a), % 235.38/30.34 bind(X15, a) % 235.38/30.34 ], % 235.38/30.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])). % 235.38/30.34 % 235.38/30.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------