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