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