%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : KRS012-1 : TPTP v8.1.0. Released v2.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 : Sun Jul 17 03:12:48 EDT 2022 % Result : Unsatisfiable 0.13s 0.28s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.02/0.08 % Problem : KRS012-1 : TPTP v8.1.0. Released v2.0.0. % 0.02/0.08 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.08/0.27 % Computer : n032.cluster.edu % 0.08/0.27 % Model : x86_64 x86_64 % 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.27 % Memory : 8042.1875MB % 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64 % 0.08/0.27 % CPULimit : 300 % 0.08/0.27 % WCLimit : 600 % 0.08/0.27 % DateTime : Tue Jun 7 08:21:50 EDT 2022 % 0.08/0.27 % CPUTime : % 0.13/0.28 % SZS status Unsatisfiable % 0.13/0.28 % SZS output begin IncompleteProof % 0.13/0.28 cnf(c0, axiom, % 0.13/0.28 c(exists)). % 0.13/0.28 cnf(c1, plain, % 0.13/0.28 c(exists), % 0.13/0.28 inference(start, [], [c0])). % 0.13/0.28 % 0.13/0.28 cnf(c2, axiom, % 0.13/0.28 ~d(X0) | ~r(X1,X0) | ~c(X1) | e(X0)). % 0.13/0.28 cnf(a0, assumption, % 0.13/0.28 exists = X1). % 0.13/0.28 cnf(c3, plain, % 0.13/0.28 $false, % 0.13/0.28 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.28 cnf(c4, plain, % 0.13/0.28 ~d(X0) | ~r(X1,X0) | e(X0), % 0.13/0.28 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.28 % 0.13/0.28 cnf(c5, axiom, % 0.13/0.28 ~r(X2,X3) | ~c(X2) | d(X3)). % 0.13/0.28 cnf(a1, assumption, % 0.13/0.28 X0 = X3). % 0.13/0.28 cnf(c6, plain, % 0.13/0.28 ~r(X1,X0) | e(X0), % 0.13/0.28 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.13/0.28 cnf(c7, plain, % 0.13/0.28 ~r(X2,X3) | ~c(X2), % 0.13/0.28 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.13/0.28 % 0.13/0.28 cnf(c8, axiom, % 0.13/0.28 r(X4,u1r1(X4)) | f(X4)). % 0.13/0.28 cnf(a2, assumption, % 0.13/0.28 X2 = X4). % 0.13/0.28 cnf(a3, assumption, % 0.13/0.28 X3 = u1r1(X4)). % 0.13/0.28 cnf(c9, plain, % 0.13/0.28 ~c(X2), % 0.13/0.28 inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])). % 0.13/0.28 cnf(c10, plain, % 0.13/0.28 f(X4), % 0.13/0.28 inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])). % 0.13/0.28 % 0.13/0.28 cnf(c11, axiom, % 0.13/0.28 ~f(exists)). % 0.13/0.28 cnf(a4, assumption, % 0.13/0.28 X4 = exists). % 0.13/0.28 cnf(c12, plain, % 0.13/0.28 $false, % 0.13/0.28 inference(strict_predicate_extension, [assumptions([a4])], [c10, c11])). % 0.13/0.28 cnf(c13, plain, % 0.13/0.28 $false, % 0.13/0.28 inference(strict_predicate_extension, [assumptions([a4])], [c10, c11])). % 0.13/0.28 % 0.13/0.28 cnf(c14, plain, % 0.13/0.28 c(exists)). % 0.13/0.28 cnf(a5, assumption, % 0.13/0.28 X2 = exists). % 0.13/0.28 cnf(c15, plain, % 0.13/0.28 $false, % 0.13/0.28 inference(predicate_reduction, [assumptions([a5])], [c9, c14])). % 0.13/0.28 % 0.13/0.28 cnf(c16, plain, % 0.13/0.28 r(X2,X3)). % 0.13/0.28 cnf(a6, assumption, % 0.13/0.28 X1 = X2). % 0.13/0.28 cnf(a7, assumption, % 0.13/0.28 X0 = X3). % 0.13/0.28 cnf(c17, plain, % 0.13/0.28 e(X0), % 0.13/0.28 inference(predicate_reduction, [assumptions([a6, a7])], [c6, c16])). % 0.13/0.28 % 0.13/0.28 cnf(c18, axiom, % 0.13/0.28 ~e(u1r1(X5)) | f(X5)). % 0.13/0.28 cnf(a8, assumption, % 0.13/0.28 X0 = u1r1(X5)). % 0.13/0.28 cnf(c19, plain, % 0.13/0.28 $false, % 0.13/0.28 inference(strict_predicate_extension, [assumptions([a8])], [c17, c18])). % 0.13/0.28 cnf(c20, plain, % 0.13/0.28 f(X5), % 0.13/0.28 inference(strict_predicate_extension, [assumptions([a8])], [c17, c18])). % 0.13/0.28 % 0.13/0.28 cnf(c21, plain, % 0.13/0.28 ~f(X4)). % 0.13/0.28 cnf(a9, assumption, % 0.13/0.28 X5 = X4). % 0.13/0.28 cnf(c22, plain, % 0.13/0.28 $false, % 0.13/0.28 inference(predicate_reduction, [assumptions([a9])], [c20, c21])). % 0.13/0.28 % 0.13/0.28 cnf(c23, plain, % 0.13/0.28 $false, % 0.13/0.28 inference(constraint_solving, [ % 0.13/0.28 bind(X0, u1r1(X4)), % 0.13/0.28 bind(X1, exists), % 0.13/0.28 bind(X2, exists), % 0.13/0.28 bind(X3, u1r1(X4)), % 0.13/0.28 bind(X4, exists), % 0.13/0.28 bind(X5, exists) % 0.13/0.28 ], % 0.13/0.28 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])). % 0.13/0.28 % 0.13/0.28 % SZS output end IncompleteProof %------------------------------------------------------------------------------