%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GRP156-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 : n006.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:24 EDT 2022 % Result : Unsatisfiable 0.20s 0.56s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : GRP156-1 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.35 % Computer : n006.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Tue Jun 14 13:29:11 EDT 2022 % 0.13/0.35 % CPUTime : % 0.20/0.56 % SZS status Unsatisfiable % 0.20/0.56 % SZS output begin IncompleteProof % 0.20/0.56 cnf(c0, axiom, % 0.20/0.56 multiply(a,c) != greatest_lower_bound(multiply(a,c),multiply(b,c))). % 0.20/0.56 cnf(c1, plain, % 0.20/0.56 multiply(a,c) != greatest_lower_bound(multiply(a,c),multiply(b,c)), % 0.20/0.56 inference(start, [], [c0])). % 0.20/0.56 % 0.20/0.56 cnf(c2, axiom, % 0.20/0.56 greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0). % 0.20/0.56 cnf(a0, assumption, % 0.20/0.56 greatest_lower_bound(X2,X3) = greatest_lower_bound(multiply(a,c),multiply(b,c))). % 0.20/0.56 cnf(c3, plain, % 0.20/0.56 $false, % 0.20/0.56 inference(lazy_function_extension, [assumptions([a0])], [c1, c2])). % 0.20/0.56 cnf(c4, plain, % 0.20/0.56 $false, % 0.20/0.56 inference(lazy_function_extension, [assumptions([a0])], [c1, c2])). % 0.20/0.56 cnf(c5, plain, % 0.20/0.56 X2 != X0 | X3 != least_upper_bound(X0,X1) | X4 != X0 | multiply(a,c) != X4, % 0.20/0.56 inference(lazy_function_extension, [assumptions([a0])], [c1, c2])). % 0.20/0.56 % 0.20/0.56 cnf(a1, assumption, % 0.20/0.56 X2 = X0). % 0.20/0.56 cnf(c6, plain, % 0.20/0.56 X3 != least_upper_bound(X0,X1) | X4 != X0 | multiply(a,c) != X4, % 0.20/0.56 inference(reflexivity, [assumptions([a1])], [c5])). % 0.20/0.56 % 0.20/0.56 cnf(c7, axiom, % 0.20/0.56 multiply(least_upper_bound(X5,X6),X7) = least_upper_bound(multiply(X5,X7),multiply(X6,X7))). % 0.20/0.56 cnf(a2, assumption, % 0.20/0.56 least_upper_bound(X0,X1) = least_upper_bound(multiply(X5,X7),multiply(X6,X7))). % 0.20/0.56 cnf(c8, plain, % 0.20/0.56 X4 != X0 | multiply(a,c) != X4, % 0.20/0.56 inference(strict_function_extension, [assumptions([a2])], [c6, c7])). % 0.20/0.56 cnf(c9, plain, % 0.20/0.56 $false, % 0.20/0.56 inference(strict_function_extension, [assumptions([a2])], [c6, c7])). % 0.20/0.56 cnf(c10, plain, % 0.20/0.56 X8 != multiply(least_upper_bound(X5,X6),X7) | X3 != X8, % 0.20/0.56 inference(strict_function_extension, [assumptions([a2])], [c6, c7])). % 0.20/0.56 % 0.20/0.56 cnf(c11, axiom, % 0.20/0.56 b = least_upper_bound(a,b)). % 0.20/0.56 cnf(a3, assumption, % 0.20/0.56 least_upper_bound(X5,X6) = least_upper_bound(a,b)). % 0.20/0.56 cnf(c12, plain, % 0.20/0.56 X3 != X8, % 0.20/0.56 inference(strict_function_extension, [assumptions([a3])], [c10, c11])). % 0.20/0.56 cnf(c13, plain, % 0.20/0.56 $false, % 0.20/0.56 inference(strict_function_extension, [assumptions([a3])], [c10, c11])). % 0.20/0.56 cnf(c14, plain, % 0.20/0.56 X9 != b | X8 != multiply(X9,X7), % 0.20/0.56 inference(strict_function_extension, [assumptions([a3])], [c10, c11])). % 0.20/0.56 % 0.20/0.56 cnf(a4, assumption, % 0.20/0.56 X9 = b). % 0.20/0.56 cnf(c15, plain, % 0.20/0.56 X8 != multiply(X9,X7), % 0.20/0.56 inference(reflexivity, [assumptions([a4])], [c14])). % 0.20/0.56 % 0.20/0.56 cnf(a5, assumption, % 0.20/0.56 X8 = multiply(X9,X7)). % 0.20/0.56 cnf(c16, plain, % 0.20/0.56 $false, % 0.20/0.56 inference(reflexivity, [assumptions([a5])], [c15])). % 0.20/0.56 % 0.20/0.56 cnf(a6, assumption, % 0.20/0.56 X3 = X8). % 0.20/0.56 cnf(c17, plain, % 0.20/0.56 $false, % 0.20/0.56 inference(reflexivity, [assumptions([a6])], [c12])). % 0.20/0.56 % 0.20/0.56 cnf(a7, assumption, % 0.20/0.56 X4 = X0). % 0.20/0.56 cnf(c18, plain, % 0.20/0.56 multiply(a,c) != X4, % 0.20/0.56 inference(reflexivity, [assumptions([a7])], [c8])). % 0.20/0.56 % 0.20/0.56 cnf(a8, assumption, % 0.20/0.56 multiply(a,c) = X4). % 0.20/0.56 cnf(c19, plain, % 0.20/0.56 $false, % 0.20/0.56 inference(reflexivity, [assumptions([a8])], [c18])). % 0.20/0.56 % 0.20/0.56 cnf(c20, plain, % 0.20/0.56 $false, % 0.20/0.56 inference(constraint_solving, [ % 0.20/0.56 bind(X0, multiply(a,c)), % 0.20/0.56 bind(X1, multiply(X6,X7)), % 0.20/0.56 bind(X4, multiply(a,c)), % 0.20/0.56 bind(X2, multiply(a,c)), % 0.20/0.56 bind(X3, multiply(b,c)), % 0.20/0.56 bind(X5, a), % 0.20/0.56 bind(X6, b), % 0.20/0.56 bind(X7, c), % 0.20/0.56 bind(X8, multiply(X9,X7)), % 0.20/0.56 bind(X9, b) % 0.20/0.56 ], % 0.20/0.56 [a0, a1, a2, a3, a4, a5, a6, a7, a8])). % 0.20/0.56 % 0.20/0.56 % SZS output end IncompleteProof %------------------------------------------------------------------------------