%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : CAT016-3 : TPTP v8.1.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n032.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 : Fri Jul 15 00:03:29 EDT 2022 % Result : Unsatisfiable 0.11s 0.32s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : CAT016-3 : TPTP v8.1.0. Released v1.0.0. % 0.11/0.11 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.11/0.31 % Computer : n032.cluster.edu % 0.11/0.31 % Model : x86_64 x86_64 % 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.31 % Memory : 8042.1875MB % 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.31 % CPULimit : 300 % 0.11/0.31 % WCLimit : 600 % 0.11/0.31 % DateTime : Sun May 29 19:01:41 EDT 2022 % 0.11/0.31 % CPUTime : % 0.11/0.32 % SZS status Unsatisfiable % 0.11/0.32 % SZS output begin IncompleteProof % 0.11/0.32 cnf(c0, axiom, % 0.11/0.32 ~there_exists(domain(a))). % 0.11/0.32 cnf(c1, plain, % 0.11/0.32 ~there_exists(domain(a)), % 0.11/0.32 inference(start, [], [c0])). % 0.11/0.32 % 0.11/0.32 cnf(c2, axiom, % 0.11/0.32 there_exists(domain(X0)) | ~there_exists(compose(X0,X1))). % 0.11/0.32 cnf(a0, assumption, % 0.11/0.32 domain(a) = domain(X0)). % 0.11/0.32 cnf(c3, plain, % 0.11/0.32 $false, % 0.11/0.32 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.11/0.32 cnf(c4, plain, % 0.11/0.32 ~there_exists(compose(X0,X1)), % 0.11/0.32 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.11/0.32 % 0.11/0.32 cnf(c5, axiom, % 0.11/0.32 compose(X2,domain(X2)) = X2). % 0.11/0.32 cnf(a1, assumption, % 0.11/0.32 compose(X0,X1) = compose(X2,domain(X2))). % 0.11/0.32 cnf(c6, plain, % 0.11/0.32 $false, % 0.11/0.32 inference(strict_function_extension, [assumptions([a1])], [c4, c5])). % 0.11/0.32 cnf(c7, plain, % 0.11/0.32 $false, % 0.11/0.32 inference(strict_function_extension, [assumptions([a1])], [c4, c5])). % 0.11/0.32 cnf(c8, plain, % 0.11/0.32 X3 != X2 | ~there_exists(X3), % 0.11/0.32 inference(strict_function_extension, [assumptions([a1])], [c4, c5])). % 0.11/0.32 % 0.11/0.32 cnf(a2, assumption, % 0.11/0.32 X3 = X2). % 0.11/0.32 cnf(c9, plain, % 0.11/0.32 ~there_exists(X3), % 0.11/0.32 inference(reflexivity, [assumptions([a2])], [c8])). % 0.11/0.32 % 0.11/0.32 cnf(c10, axiom, % 0.11/0.32 there_exists(a)). % 0.11/0.32 cnf(a3, assumption, % 0.11/0.32 X3 = a). % 0.11/0.32 cnf(c11, plain, % 0.11/0.32 $false, % 0.11/0.32 inference(strict_predicate_extension, [assumptions([a3])], [c9, c10])). % 0.11/0.32 cnf(c12, plain, % 0.11/0.32 $false, % 0.11/0.32 inference(strict_predicate_extension, [assumptions([a3])], [c9, c10])). % 0.11/0.32 % 0.11/0.32 cnf(c13, plain, % 0.11/0.32 $false, % 0.11/0.32 inference(constraint_solving, [ % 0.11/0.32 bind(X0, a), % 0.11/0.32 bind(X1, domain(X2)), % 0.11/0.32 bind(X2, a), % 0.11/0.32 bind(X3, a) % 0.11/0.32 ], % 0.11/0.32 [a0, a1, a2, a3])). % 0.11/0.32 % 0.11/0.32 % SZS output end IncompleteProof %------------------------------------------------------------------------------