%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GRP163-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 : 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:26 EDT 2022 % Result : Unsatisfiable 4.67s 0.96s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP163-1 : 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.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 10:30:46 EDT 2022 % 0.12/0.33 % CPUTime : % 4.67/0.96 % SZS status Unsatisfiable % 4.67/0.96 % SZS output begin IncompleteProof % 4.67/0.96 cnf(c0, axiom, % 4.67/0.96 a != greatest_lower_bound(a,c)). % 4.67/0.96 cnf(c1, plain, % 4.67/0.96 a != greatest_lower_bound(a,c), % 4.67/0.96 inference(start, [], [c0])). % 4.67/0.96 % 4.67/0.96 cnf(c2, axiom, % 4.67/0.96 greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2)). % 4.67/0.96 cnf(a0, assumption, % 4.67/0.96 greatest_lower_bound(X3,X4) = greatest_lower_bound(a,c)). % 4.67/0.96 cnf(c3, plain, % 4.67/0.96 $false, % 4.67/0.96 inference(lazy_function_extension, [assumptions([a0])], [c1, c2])). % 4.67/0.96 cnf(c4, plain, % 4.67/0.96 $false, % 4.67/0.96 inference(lazy_function_extension, [assumptions([a0])], [c1, c2])). % 4.67/0.96 cnf(c5, plain, % 4.67/0.96 X3 != greatest_lower_bound(X0,X1) | X4 != X2 | X5 != greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) | a != X5, % 4.67/0.96 inference(lazy_function_extension, [assumptions([a0])], [c1, c2])). % 4.67/0.96 % 4.67/0.96 cnf(c6, axiom, % 4.67/0.96 a = greatest_lower_bound(a,b)). % 4.67/0.96 cnf(a1, assumption, % 4.67/0.96 greatest_lower_bound(X0,X1) = greatest_lower_bound(a,b)). % 4.67/0.96 cnf(c7, plain, % 4.67/0.96 X4 != X2 | X5 != greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) | a != X5, % 4.67/0.96 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 4.67/0.96 cnf(c8, plain, % 4.67/0.96 $false, % 4.67/0.96 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 4.67/0.96 cnf(c9, plain, % 4.67/0.96 X6 != a | X3 != X6, % 4.67/0.96 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 4.67/0.96 % 4.67/0.96 cnf(a2, assumption, % 4.67/0.96 X6 = a). % 4.67/0.96 cnf(c10, plain, % 4.67/0.96 X3 != X6, % 4.67/0.96 inference(reflexivity, [assumptions([a2])], [c9])). % 4.67/0.96 % 4.67/0.96 cnf(a3, assumption, % 4.67/0.96 X3 = X6). % 4.67/0.96 cnf(c11, plain, % 4.67/0.96 $false, % 4.67/0.96 inference(reflexivity, [assumptions([a3])], [c10])). % 4.67/0.96 % 4.67/0.96 cnf(a4, assumption, % 4.67/0.96 X4 = X2). % 4.67/0.96 cnf(c12, plain, % 4.67/0.96 X5 != greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) | a != X5, % 4.67/0.96 inference(reflexivity, [assumptions([a4])], [c7])). % 4.67/0.96 % 4.67/0.96 cnf(c13, axiom, % 4.67/0.96 b = greatest_lower_bound(b,c)). % 4.67/0.96 cnf(a5, assumption, % 4.67/0.96 greatest_lower_bound(X1,X2) = greatest_lower_bound(b,c)). % 4.67/0.96 cnf(c14, plain, % 4.67/0.96 a != X5, % 4.67/0.96 inference(strict_function_extension, [assumptions([a5])], [c12, c13])). % 4.67/0.96 cnf(c15, plain, % 4.67/0.96 $false, % 4.67/0.96 inference(strict_function_extension, [assumptions([a5])], [c12, c13])). % 4.67/0.96 cnf(c16, plain, % 4.67/0.96 X7 != b | X5 != greatest_lower_bound(X0,X7), % 4.67/0.96 inference(strict_function_extension, [assumptions([a5])], [c12, c13])). % 4.67/0.96 % 4.67/0.96 cnf(a6, assumption, % 4.67/0.96 X7 = b). % 4.67/0.96 cnf(c17, plain, % 4.67/0.96 X5 != greatest_lower_bound(X0,X7), % 4.67/0.96 inference(reflexivity, [assumptions([a6])], [c16])). % 4.67/0.96 % 4.67/0.96 cnf(c18, plain, % 4.67/0.96 X3 = greatest_lower_bound(X0,X1)). % 4.67/0.96 cnf(a7, assumption, % 4.67/0.96 greatest_lower_bound(X0,X7) = greatest_lower_bound(X0,X1)). % 4.67/0.96 cnf(c19, plain, % 4.67/0.96 $false, % 4.67/0.96 inference(equality_reduction, [assumptions([a7])], [c17, c18])). % 4.67/0.96 cnf(c20, plain, % 4.67/0.96 X5 != X3, % 4.67/0.96 inference(equality_reduction, [assumptions([a7])], [c17, c18])). % 4.67/0.96 % 4.67/0.96 cnf(a8, assumption, % 4.67/0.96 X5 = X3). % 4.67/0.96 cnf(c21, plain, % 4.67/0.96 $false, % 4.67/0.96 inference(reflexivity, [assumptions([a8])], [c20])). % 4.67/0.96 % 4.67/0.96 cnf(a9, assumption, % 4.67/0.96 a = X5). % 4.67/0.96 cnf(c22, plain, % 4.67/0.96 $false, % 4.67/0.96 inference(reflexivity, [assumptions([a9])], [c14])). % 4.67/0.96 % 4.67/0.96 cnf(c23, plain, % 4.67/0.96 $false, % 4.67/0.96 inference(constraint_solving, [ % 4.67/0.96 bind(X0, a), % 4.67/0.96 bind(X1, b), % 4.67/0.96 bind(X2, c), % 4.67/0.96 bind(X5, a), % 4.67/0.96 bind(X3, a), % 4.67/0.96 bind(X4, c), % 4.67/0.96 bind(X6, a), % 4.67/0.96 bind(X7, b) % 4.67/0.96 ], % 4.67/0.96 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])). % 4.67/0.96 % 4.67/0.96 % SZS output end IncompleteProof %------------------------------------------------------------------------------