%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GRP161-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 : n019.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:25 EDT 2022 % Result : Unsatisfiable 0.14s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.14 % Problem : GRP161-1 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.09/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.36 % Computer : n019.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 09:48:25 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.37 % SZS status Unsatisfiable % 0.14/0.37 % SZS output begin IncompleteProof % 0.14/0.37 cnf(c0, axiom, % 0.14/0.37 a != greatest_lower_bound(a,a)). % 0.14/0.37 cnf(c1, plain, % 0.14/0.37 a != greatest_lower_bound(a,a), % 0.14/0.37 inference(start, [], [c0])). % 0.14/0.37 % 0.14/0.37 cnf(c2, axiom, % 0.14/0.37 greatest_lower_bound(X0,X0) = X0). % 0.14/0.37 cnf(a0, assumption, % 0.14/0.37 greatest_lower_bound(a,a) = greatest_lower_bound(X0,X0)). % 0.14/0.37 cnf(c3, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.14/0.37 cnf(c4, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.14/0.37 cnf(c5, plain, % 0.14/0.37 X1 != X0 | a != X1, % 0.14/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.14/0.37 % 0.14/0.37 cnf(a1, assumption, % 0.14/0.37 X1 = X0). % 0.14/0.37 cnf(c6, plain, % 0.14/0.37 a != X1, % 0.14/0.37 inference(reflexivity, [assumptions([a1])], [c5])). % 0.14/0.37 % 0.14/0.37 cnf(a2, assumption, % 0.14/0.37 a = X1). % 0.14/0.37 cnf(c7, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(reflexivity, [assumptions([a2])], [c6])). % 0.14/0.37 % 0.14/0.37 cnf(c8, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(constraint_solving, [ % 0.14/0.37 bind(X0, a), % 0.14/0.37 bind(X1, a) % 0.14/0.37 ], % 0.14/0.37 [a0, a1, a2])). % 0.14/0.37 % 0.14/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------