%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GRP188-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 : n017.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:37 EDT 2022 % Result : Unsatisfiable 0.22s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : GRP188-2 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.04/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.36 % Computer : n017.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 04:03:37 EDT 2022 % 0.14/0.36 % CPUTime : % 0.22/0.39 % SZS status Unsatisfiable % 0.22/0.39 % SZS output begin IncompleteProof % 0.22/0.39 cnf(c0, axiom, % 0.22/0.39 least_upper_bound(a,b) != least_upper_bound(b,least_upper_bound(a,b))). % 0.22/0.39 cnf(c1, plain, % 0.22/0.39 least_upper_bound(a,b) != least_upper_bound(b,least_upper_bound(a,b)), % 0.22/0.39 inference(start, [], [c0])). % 0.22/0.39 % 0.22/0.39 cnf(c2, axiom, % 0.22/0.39 least_upper_bound(X0,X1) = least_upper_bound(X1,X0)). % 0.22/0.39 cnf(a0, assumption, % 0.22/0.39 least_upper_bound(b,least_upper_bound(a,b)) = least_upper_bound(X1,X0)). % 0.22/0.39 cnf(c3, plain, % 0.22/0.39 $false, % 0.22/0.39 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.22/0.39 cnf(c4, plain, % 0.22/0.39 $false, % 0.22/0.39 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.22/0.39 cnf(c5, plain, % 0.22/0.39 X2 != least_upper_bound(X0,X1) | least_upper_bound(a,b) != X2, % 0.22/0.39 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.22/0.39 % 0.22/0.39 cnf(c6, axiom, % 0.22/0.39 least_upper_bound(X3,least_upper_bound(X4,X5)) = least_upper_bound(least_upper_bound(X3,X4),X5)). % 0.22/0.39 cnf(a1, assumption, % 0.22/0.39 least_upper_bound(X0,X1) = least_upper_bound(least_upper_bound(X3,X4),X5)). % 0.22/0.39 cnf(c7, plain, % 0.22/0.39 least_upper_bound(a,b) != X2, % 0.22/0.39 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 0.22/0.39 cnf(c8, plain, % 0.22/0.39 $false, % 0.22/0.39 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 0.22/0.39 cnf(c9, plain, % 0.22/0.39 X6 != least_upper_bound(X3,least_upper_bound(X4,X5)) | X2 != X6, % 0.22/0.39 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 0.22/0.39 % 0.22/0.39 cnf(c10, axiom, % 0.22/0.39 least_upper_bound(X7,X7) = X7). % 0.22/0.39 cnf(a2, assumption, % 0.22/0.39 least_upper_bound(X4,X5) = least_upper_bound(X7,X7)). % 0.22/0.39 cnf(c11, plain, % 0.22/0.39 X2 != X6, % 0.22/0.39 inference(strict_function_extension, [assumptions([a2])], [c9, c10])). % 0.22/0.39 cnf(c12, plain, % 0.22/0.39 $false, % 0.22/0.39 inference(strict_function_extension, [assumptions([a2])], [c9, c10])). % 0.22/0.39 cnf(c13, plain, % 0.22/0.39 X8 != X7 | X6 != least_upper_bound(X3,X8), % 0.22/0.39 inference(strict_function_extension, [assumptions([a2])], [c9, c10])). % 0.22/0.39 % 0.22/0.39 cnf(a3, assumption, % 0.22/0.39 X8 = X7). % 0.22/0.39 cnf(c14, plain, % 0.22/0.39 X6 != least_upper_bound(X3,X8), % 0.22/0.39 inference(reflexivity, [assumptions([a3])], [c13])). % 0.22/0.39 % 0.22/0.39 cnf(a4, assumption, % 0.22/0.39 X6 = least_upper_bound(X3,X8)). % 0.22/0.39 cnf(c15, plain, % 0.22/0.39 $false, % 0.22/0.39 inference(reflexivity, [assumptions([a4])], [c14])). % 0.22/0.39 % 0.22/0.39 cnf(a5, assumption, % 0.22/0.39 X2 = X6). % 0.22/0.39 cnf(c16, plain, % 0.22/0.39 $false, % 0.22/0.39 inference(reflexivity, [assumptions([a5])], [c11])). % 0.22/0.39 % 0.22/0.39 cnf(a6, assumption, % 0.22/0.39 least_upper_bound(a,b) = X2). % 0.22/0.39 cnf(c17, plain, % 0.22/0.39 $false, % 0.22/0.39 inference(reflexivity, [assumptions([a6])], [c7])). % 0.22/0.39 % 0.22/0.39 cnf(c18, plain, % 0.22/0.39 $false, % 0.22/0.39 inference(constraint_solving, [ % 0.22/0.39 bind(X0, least_upper_bound(a,b)), % 0.22/0.39 bind(X1, b), % 0.22/0.39 bind(X2, least_upper_bound(X3,X8)), % 0.22/0.39 bind(X3, a), % 0.22/0.39 bind(X4, b), % 0.22/0.39 bind(X5, b), % 0.22/0.39 bind(X6, least_upper_bound(X3,X8)), % 0.22/0.39 bind(X7, b), % 0.22/0.39 bind(X8, b) % 0.22/0.39 ], % 0.22/0.39 [a0, a1, a2, a3, a4, a5, a6])). % 0.22/0.39 % 0.22/0.39 % SZS output end IncompleteProof %------------------------------------------------------------------------------