%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GRP166-4 : 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 : n018.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:27 EDT 2022 % Result : Unsatisfiable 115.28s 15.03s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP166-4 : 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.12/0.34 % Computer : n018.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jun 13 04:06:57 EDT 2022 % 0.12/0.34 % CPUTime : % 115.28/15.03 % SZS status Unsatisfiable % 115.28/15.03 % SZS output begin IncompleteProof % 115.28/15.03 cnf(c0, axiom, % 115.28/15.03 a != greatest_lower_bound(a,multiply(b,a))). % 115.28/15.03 cnf(c1, plain, % 115.28/15.03 a != greatest_lower_bound(a,multiply(b,a)), % 115.28/15.03 inference(start, [], [c0])). % 115.28/15.03 % 115.28/15.03 cnf(c2, axiom, % 115.28/15.03 greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0)). % 115.28/15.03 cnf(a0, assumption, % 115.28/15.03 greatest_lower_bound(a,multiply(b,a)) = greatest_lower_bound(X1,X0)). % 115.28/15.03 cnf(c3, plain, % 115.28/15.03 $false, % 115.28/15.03 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 115.28/15.03 cnf(c4, plain, % 115.28/15.03 $false, % 115.28/15.03 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 115.28/15.03 cnf(c5, plain, % 115.28/15.03 X2 != greatest_lower_bound(X0,X1) | a != X2, % 115.28/15.03 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 115.28/15.03 % 115.28/15.03 cnf(c6, axiom, % 115.28/15.03 multiply(greatest_lower_bound(X3,X4),X5) = greatest_lower_bound(multiply(X3,X5),multiply(X4,X5))). % 115.28/15.03 cnf(a1, assumption, % 115.28/15.03 greatest_lower_bound(X6,X7) = greatest_lower_bound(X0,X1)). % 115.28/15.03 cnf(c7, plain, % 115.28/15.03 a != X2, % 115.28/15.03 inference(lazy_function_extension, [assumptions([a1])], [c5, c6])). % 115.28/15.03 cnf(c8, plain, % 115.28/15.03 $false, % 115.28/15.03 inference(lazy_function_extension, [assumptions([a1])], [c5, c6])). % 115.28/15.03 cnf(c9, plain, % 115.28/15.03 X6 != multiply(X3,X5) | X7 != multiply(X4,X5) | X8 != multiply(greatest_lower_bound(X3,X4),X5) | X2 != X8, % 115.28/15.03 inference(lazy_function_extension, [assumptions([a1])], [c5, c6])). % 115.28/15.03 % 115.28/15.03 cnf(a2, assumption, % 115.28/15.03 X6 = multiply(X3,X5)). % 115.28/15.03 cnf(c10, plain, % 115.28/15.03 X7 != multiply(X4,X5) | X8 != multiply(greatest_lower_bound(X3,X4),X5) | X2 != X8, % 115.28/15.03 inference(reflexivity, [assumptions([a2])], [c9])). % 115.28/15.03 % 115.28/15.03 cnf(c11, axiom, % 115.28/15.03 multiply(identity,X9) = X9). % 115.28/15.03 cnf(a3, assumption, % 115.28/15.03 multiply(X4,X5) = multiply(identity,X9)). % 115.28/15.03 cnf(c12, plain, % 115.28/15.03 X8 != multiply(greatest_lower_bound(X3,X4),X5) | X2 != X8, % 115.28/15.03 inference(strict_function_extension, [assumptions([a3])], [c10, c11])). % 115.28/15.03 cnf(c13, plain, % 115.28/15.03 $false, % 115.28/15.03 inference(strict_function_extension, [assumptions([a3])], [c10, c11])). % 115.28/15.03 cnf(c14, plain, % 115.28/15.03 X10 != X9 | X7 != X10, % 115.28/15.03 inference(strict_function_extension, [assumptions([a3])], [c10, c11])). % 115.28/15.03 % 115.28/15.03 cnf(a4, assumption, % 115.28/15.03 X10 = X9). % 115.28/15.03 cnf(c15, plain, % 115.28/15.03 X7 != X10, % 115.28/15.03 inference(reflexivity, [assumptions([a4])], [c14])). % 115.28/15.03 % 115.28/15.03 cnf(a5, assumption, % 115.28/15.03 X7 = X10). % 115.28/15.03 cnf(c16, plain, % 115.28/15.03 $false, % 115.28/15.03 inference(reflexivity, [assumptions([a5])], [c15])). % 115.28/15.03 % 115.28/15.03 cnf(c17, axiom, % 115.28/15.03 identity = greatest_lower_bound(b,identity)). % 115.28/15.03 cnf(a6, assumption, % 115.28/15.03 greatest_lower_bound(X3,X4) = greatest_lower_bound(b,identity)). % 115.28/15.03 cnf(c18, plain, % 115.28/15.03 X2 != X8, % 115.28/15.03 inference(strict_function_extension, [assumptions([a6])], [c12, c17])). % 115.28/15.03 cnf(c19, plain, % 115.28/15.03 $false, % 115.28/15.03 inference(strict_function_extension, [assumptions([a6])], [c12, c17])). % 115.28/15.03 cnf(c20, plain, % 115.28/15.03 X11 != identity | X8 != multiply(X11,X5), % 115.28/15.03 inference(strict_function_extension, [assumptions([a6])], [c12, c17])). % 115.28/15.03 % 115.28/15.03 cnf(a7, assumption, % 115.28/15.03 X11 = identity). % 115.28/15.03 cnf(c21, plain, % 115.28/15.03 X8 != multiply(X11,X5), % 115.28/15.03 inference(reflexivity, [assumptions([a7])], [c20])). % 115.28/15.03 % 115.28/15.03 cnf(c22, plain, % 115.28/15.03 X7 = multiply(X4,X5)). % 115.28/15.03 cnf(a8, assumption, % 115.28/15.03 multiply(X11,X5) = multiply(X4,X5)). % 115.28/15.03 cnf(c23, plain, % 115.28/15.03 $false, % 115.28/15.03 inference(equality_reduction, [assumptions([a8])], [c21, c22])). % 115.28/15.03 cnf(c24, plain, % 115.28/15.03 X8 != X7, % 115.28/15.03 inference(equality_reduction, [assumptions([a8])], [c21, c22])). % 115.28/15.03 % 115.28/15.03 cnf(a9, assumption, % 115.28/15.03 X8 = X7). % 115.28/15.03 cnf(c25, plain, % 115.28/15.03 $false, % 115.28/15.03 inference(reflexivity, [assumptions([a9])], [c24])). % 115.28/15.03 % 115.28/15.03 cnf(a10, assumption, % 115.28/15.03 X2 = X8). % 115.28/15.03 cnf(c26, plain, % 115.28/15.03 $false, % 115.28/15.03 inference(reflexivity, [assumptions([a10])], [c18])). % 115.28/15.03 % 115.28/15.03 cnf(a11, assumption, % 115.28/15.03 a = X2). % 115.28/15.03 cnf(c27, plain, % 115.28/15.03 $false, % 115.28/15.03 inference(reflexivity, [assumptions([a11])], [c7])). % 115.28/15.03 % 115.28/15.03 cnf(c28, plain, % 115.28/15.03 $false, % 115.28/15.03 inference(constraint_solving, [ % 115.28/15.03 bind(X0, multiply(b,a)), % 115.28/15.03 bind(X1, a), % 115.28/15.03 bind(X2, a), % 115.28/15.03 bind(X3, b), % 115.28/15.03 bind(X4, identity), % 115.28/15.03 bind(X5, a), % 115.28/15.03 bind(X8, a), % 115.28/15.03 bind(X6, multiply(b,a)), % 115.28/15.03 bind(X7, a), % 115.28/15.03 bind(X9, a), % 115.28/15.03 bind(X10, a), % 115.28/15.03 bind(X11, identity) % 115.28/15.03 ], % 115.28/15.03 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 115.28/15.03 % 115.28/15.03 % SZS output end IncompleteProof %------------------------------------------------------------------------------