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