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