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