%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : KRS181+1 : TPTP v8.1.0. Bugfixed v5.4.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n021.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:13:11 EDT 2022 % Result : Theorem 0.11s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : KRS181+1 : TPTP v8.1.0. Bugfixed v5.4.0. % 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.11/0.33 % Computer : n021.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 600 % 0.11/0.33 % DateTime : Tue Jun 7 07:10:06 EDT 2022 % 0.11/0.33 % CPUTime : % 0.11/0.34 % SZS status Theorem % 0.11/0.34 % SZS output begin IncompleteProof % 0.11/0.34 cnf(c0, axiom, % 0.11/0.34 nota(sK29,sK31)). % 0.11/0.34 cnf(c1, plain, % 0.11/0.34 nota(sK29,sK31), % 0.11/0.34 inference(start, [], [c0])). % 0.11/0.34 % 0.11/0.34 cnf(c2, axiom, % 0.11/0.34 ~status(sK5(X0,X1),sK6(X0,X1),X1) | ~nota(X0,X1)). % 0.11/0.34 cnf(a0, assumption, % 0.11/0.34 sK29 = X0). % 0.11/0.34 cnf(a1, assumption, % 0.11/0.34 sK31 = X1). % 0.11/0.34 cnf(c3, plain, % 0.11/0.34 $false, % 0.11/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.11/0.34 cnf(c4, plain, % 0.11/0.34 ~status(sK5(X0,X1),sK6(X0,X1),X1), % 0.11/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.11/0.34 % 0.11/0.34 cnf(c5, axiom, % 0.11/0.34 nota(X2,X3) | status(X4,X5,X3) | ~status(X4,X5,X2)). % 0.11/0.34 cnf(a2, assumption, % 0.11/0.34 sK5(X0,X1) = X4). % 0.11/0.34 cnf(a3, assumption, % 0.11/0.34 sK6(X0,X1) = X5). % 0.11/0.34 cnf(a4, assumption, % 0.11/0.34 X1 = X3). % 0.11/0.34 cnf(c6, plain, % 0.11/0.34 $false, % 0.11/0.34 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])). % 0.11/0.34 cnf(c7, plain, % 0.11/0.34 nota(X2,X3) | ~status(X4,X5,X2), % 0.11/0.34 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])). % 0.11/0.34 % 0.11/0.34 cnf(c8, axiom, % 0.11/0.34 ~nota(sK30,sK31)). % 0.11/0.34 cnf(a5, assumption, % 0.11/0.34 X2 = sK30). % 0.11/0.34 cnf(a6, assumption, % 0.11/0.34 X3 = sK31). % 0.11/0.34 cnf(c9, plain, % 0.11/0.34 ~status(X4,X5,X2), % 0.11/0.34 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])). % 0.11/0.34 cnf(c10, plain, % 0.11/0.34 $false, % 0.11/0.34 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])). % 0.11/0.34 % 0.11/0.34 cnf(c11, axiom, % 0.11/0.34 status(X6,X7,X8) | ~status(X6,X7,X9) | ~isa(X9,X8)). % 0.11/0.34 cnf(a7, assumption, % 0.11/0.34 X4 = X6). % 0.11/0.34 cnf(a8, assumption, % 0.11/0.34 X5 = X7). % 0.11/0.34 cnf(a9, assumption, % 0.11/0.34 X2 = X8). % 0.11/0.34 cnf(c12, plain, % 0.11/0.34 $false, % 0.11/0.34 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c9, c11])). % 0.11/0.34 cnf(c13, plain, % 0.11/0.34 ~status(X6,X7,X9) | ~isa(X9,X8), % 0.11/0.34 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c9, c11])). % 0.11/0.34 % 0.11/0.34 cnf(c14, axiom, % 0.11/0.34 status(sK5(X10,X11),sK6(X10,X11),X10) | ~nota(X10,X11)). % 0.11/0.34 cnf(a10, assumption, % 0.11/0.34 X6 = sK5(X10,X11)). % 0.11/0.34 cnf(a11, assumption, % 0.11/0.34 X7 = sK6(X10,X11)). % 0.11/0.34 cnf(a12, assumption, % 0.11/0.34 X9 = X10). % 0.11/0.34 cnf(c15, plain, % 0.11/0.34 ~isa(X9,X8), % 0.11/0.34 inference(strict_predicate_extension, [assumptions([a10, a11, a12])], [c13, c14])). % 0.11/0.34 cnf(c16, plain, % 0.11/0.34 ~nota(X10,X11), % 0.11/0.34 inference(strict_predicate_extension, [assumptions([a10, a11, a12])], [c13, c14])). % 0.11/0.34 % 0.11/0.34 cnf(c17, plain, % 0.11/0.34 nota(sK29,sK31)). % 0.11/0.34 cnf(a13, assumption, % 0.11/0.34 X10 = sK29). % 0.11/0.34 cnf(a14, assumption, % 0.11/0.34 X11 = sK31). % 0.11/0.34 cnf(c18, plain, % 0.11/0.34 $false, % 0.11/0.34 inference(predicate_reduction, [assumptions([a13, a14])], [c16, c17])). % 0.11/0.34 % 0.11/0.34 cnf(c19, axiom, % 0.11/0.34 isa(sK29,sK30)). % 0.11/0.34 cnf(a15, assumption, % 0.11/0.34 X9 = sK29). % 0.11/0.34 cnf(a16, assumption, % 0.11/0.34 X8 = sK30). % 0.11/0.34 cnf(c20, plain, % 0.11/0.34 $false, % 0.11/0.34 inference(strict_predicate_extension, [assumptions([a15, a16])], [c15, c19])). % 0.11/0.34 cnf(c21, plain, % 0.11/0.34 $false, % 0.11/0.34 inference(strict_predicate_extension, [assumptions([a15, a16])], [c15, c19])). % 0.11/0.34 % 0.11/0.34 cnf(c22, plain, % 0.11/0.34 $false, % 0.11/0.34 inference(constraint_solving, [ % 0.11/0.34 bind(X0, sK29), % 0.11/0.34 bind(X1, sK31), % 0.11/0.34 bind(X2, sK30), % 0.11/0.34 bind(X3, sK31), % 0.11/0.34 bind(X4, sK5(X0,X1)), % 0.11/0.34 bind(X5, sK6(X0,X1)), % 0.11/0.34 bind(X6, sK5(X0,X1)), % 0.11/0.34 bind(X7, sK6(X0,X1)), % 0.11/0.34 bind(X8, sK30), % 0.11/0.34 bind(X9, sK29), % 0.11/0.34 bind(X10, sK29), % 0.11/0.34 bind(X11, sK31) % 0.11/0.34 ], % 0.11/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])). % 0.11/0.34 % 0.11/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------