%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : PUZ130+1 : TPTP v8.1.0. Released v4.1.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n025.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 : Mon Jul 18 18:19:01 EDT 2022 % Result : Theorem 5.68s 1.09s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : PUZ130+1 : TPTP v8.1.0. Released v4.1.0. % 0.10/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n025.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sat May 28 23:01:11 EDT 2022 % 0.12/0.33 % CPUTime : % 5.68/1.09 % SZS status Theorem % 5.68/1.09 % SZS output begin IncompleteProof % 5.68/1.09 cnf(c0, axiom, % 5.68/1.09 ~hates(jon,jon)). % 5.68/1.09 cnf(c1, plain, % 5.68/1.09 ~hates(jon,jon), % 5.68/1.09 inference(start, [], [c0])). % 5.68/1.09 % 5.68/1.09 cnf(c2, axiom, % 5.68/1.09 hates(owner_of(X0),owner_of(X1)) | ~chased(X1,X0) | ~dog(X1) | ~cat(X0)). % 5.68/1.09 cnf(a0, assumption, % 5.68/1.09 X2 = jon). % 5.68/1.09 cnf(a1, assumption, % 5.68/1.09 X3 = jon). % 5.68/1.09 cnf(c3, plain, % 5.68/1.09 $false, % 5.68/1.09 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 5.68/1.09 cnf(c4, plain, % 5.68/1.09 ~chased(X1,X0) | ~dog(X1) | ~cat(X0), % 5.68/1.09 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 5.68/1.09 cnf(c5, plain, % 5.68/1.09 owner_of(X0) != X2 | owner_of(X1) != X3, % 5.68/1.09 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 5.68/1.09 % 5.68/1.09 cnf(c6, axiom, % 5.68/1.09 owner_of(X4) = X5 | ~owner(X5,X4) | ~pet(X4) | ~human(X5)). % 5.68/1.09 cnf(a2, assumption, % 5.68/1.09 owner_of(X0) = owner_of(X4)). % 5.68/1.09 cnf(c7, plain, % 5.68/1.09 owner_of(X1) != X3, % 5.68/1.09 inference(strict_function_extension, [assumptions([a2])], [c5, c6])). % 5.68/1.09 cnf(c8, plain, % 5.68/1.09 ~owner(X5,X4) | ~pet(X4) | ~human(X5), % 5.68/1.09 inference(strict_function_extension, [assumptions([a2])], [c5, c6])). % 5.68/1.09 cnf(c9, plain, % 5.68/1.09 X6 != X5 | X6 != X2, % 5.68/1.09 inference(strict_function_extension, [assumptions([a2])], [c5, c6])). % 5.68/1.09 % 5.68/1.09 cnf(a3, assumption, % 5.68/1.09 X6 = X5). % 5.68/1.09 cnf(c10, plain, % 5.68/1.09 X6 != X2, % 5.68/1.09 inference(reflexivity, [assumptions([a3])], [c9])). % 5.68/1.09 % 5.68/1.09 cnf(a4, assumption, % 5.68/1.09 X6 = X2). % 5.68/1.09 cnf(c11, plain, % 5.68/1.09 $false, % 5.68/1.09 inference(reflexivity, [assumptions([a4])], [c10])). % 5.68/1.09 % 5.68/1.09 cnf(c12, axiom, % 5.68/1.09 owner(jon,garfield)). % 5.68/1.09 cnf(a5, assumption, % 5.68/1.09 X5 = jon). % 5.68/1.09 cnf(a6, assumption, % 5.68/1.09 X4 = garfield). % 5.68/1.09 cnf(c13, plain, % 5.68/1.09 ~pet(X4) | ~human(X5), % 5.68/1.09 inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c12])). % 5.68/1.09 cnf(c14, plain, % 5.68/1.09 $false, % 5.68/1.09 inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c12])). % 5.68/1.09 % 5.68/1.09 cnf(c15, axiom, % 5.68/1.09 pet(X7) | ~cat(X7)). % 5.68/1.09 cnf(a7, assumption, % 5.68/1.09 X4 = X7). % 5.68/1.09 cnf(c16, plain, % 5.68/1.09 ~human(X5), % 5.68/1.09 inference(strict_predicate_extension, [assumptions([a7])], [c13, c15])). % 5.68/1.09 cnf(c17, plain, % 5.68/1.09 ~cat(X7), % 5.68/1.09 inference(strict_predicate_extension, [assumptions([a7])], [c13, c15])). % 5.68/1.09 % 5.68/1.09 cnf(c18, axiom, % 5.68/1.09 cat(garfield)). % 5.68/1.09 cnf(a8, assumption, % 5.68/1.09 X7 = garfield). % 5.68/1.09 cnf(c19, plain, % 5.68/1.09 $false, % 5.68/1.09 inference(strict_predicate_extension, [assumptions([a8])], [c17, c18])). % 5.68/1.09 cnf(c20, plain, % 5.68/1.09 $false, % 5.68/1.09 inference(strict_predicate_extension, [assumptions([a8])], [c17, c18])). % 5.68/1.09 % 5.68/1.09 cnf(c21, axiom, % 5.68/1.09 human(jon)). % 5.68/1.09 cnf(a9, assumption, % 5.68/1.09 X5 = jon). % 5.68/1.09 cnf(c22, plain, % 5.68/1.09 $false, % 5.68/1.09 inference(strict_predicate_extension, [assumptions([a9])], [c16, c21])). % 5.68/1.09 cnf(c23, plain, % 5.68/1.09 $false, % 5.68/1.09 inference(strict_predicate_extension, [assumptions([a9])], [c16, c21])). % 5.68/1.09 % 5.68/1.09 cnf(c24, axiom, % 5.68/1.09 owner_of(X8) = X9 | ~owner(X9,X8) | ~pet(X8) | ~human(X9)). % 5.68/1.09 cnf(a10, assumption, % 5.68/1.09 owner_of(X1) = owner_of(X8)). % 5.68/1.09 cnf(c25, plain, % 5.68/1.09 $false, % 5.68/1.09 inference(strict_function_extension, [assumptions([a10])], [c7, c24])). % 5.68/1.09 cnf(c26, plain, % 5.68/1.09 ~owner(X9,X8) | ~pet(X8) | ~human(X9), % 5.68/1.09 inference(strict_function_extension, [assumptions([a10])], [c7, c24])). % 5.68/1.09 cnf(c27, plain, % 5.68/1.09 X10 != X9 | X10 != X3, % 5.68/1.09 inference(strict_function_extension, [assumptions([a10])], [c7, c24])). % 5.68/1.09 % 5.68/1.09 cnf(a11, assumption, % 5.68/1.09 X10 = X9). % 5.68/1.09 cnf(c28, plain, % 5.68/1.09 X10 != X3, % 5.68/1.09 inference(reflexivity, [assumptions([a11])], [c27])). % 5.68/1.09 % 5.68/1.09 cnf(a12, assumption, % 5.68/1.09 X10 = X3). % 5.68/1.09 cnf(c29, plain, % 5.68/1.09 $false, % 5.68/1.09 inference(reflexivity, [assumptions([a12])], [c28])). % 5.68/1.09 % 5.68/1.09 cnf(c30, axiom, % 5.68/1.09 owner(jon,odie)). % 5.68/1.09 cnf(a13, assumption, % 5.68/1.09 X9 = jon). % 5.68/1.09 cnf(a14, assumption, % 5.68/1.09 X8 = odie). % 5.68/1.09 cnf(c31, plain, % 5.68/1.09 ~pet(X8) | ~human(X9), % 5.68/1.09 inference(strict_predicate_extension, [assumptions([a13, a14])], [c26, c30])). % 5.68/1.09 cnf(c32, plain, % 5.68/1.09 $false, % 5.68/1.09 inference(strict_predicate_extension, [assumptions([a13, a14])], [c26, c30])). % 5.68/1.09 % 5.68/1.09 cnf(c33, axiom, % 5.68/1.09 pet(X11) | ~dog(X11)). % 5.68/1.09 cnf(a15, assumption, % 5.68/1.09 X8 = X11). % 5.68/1.09 cnf(c34, plain, % 5.68/1.09 ~human(X9), % 5.68/1.09 inference(strict_predicate_extension, [assumptions([a15])], [c31, c33])). % 5.68/1.09 cnf(c35, plain, % 5.68/1.09 ~dog(X11), % 5.68/1.09 inference(strict_predicate_extension, [assumptions([a15])], [c31, c33])). % 5.68/1.09 % 5.68/1.09 cnf(c36, axiom, % 5.68/1.09 dog(odie)). % 5.68/1.09 cnf(a16, assumption, % 5.68/1.09 X11 = odie). % 5.68/1.09 cnf(c37, plain, % 5.68/1.09 $false, % 5.68/1.09 inference(strict_predicate_extension, [assumptions([a16])], [c35, c36])). % 5.68/1.09 cnf(c38, plain, % 5.68/1.09 $false, % 5.68/1.09 inference(strict_predicate_extension, [assumptions([a16])], [c35, c36])). % 5.68/1.09 % 5.68/1.09 cnf(c39, plain, % 5.68/1.09 human(X5)). % 5.68/1.09 cnf(a17, assumption, % 5.68/1.09 X9 = X5). % 5.68/1.09 cnf(c40, plain, % 5.68/1.09 $false, % 5.68/1.09 inference(predicate_reduction, [assumptions([a17])], [c34, c39])). % 5.68/1.09 % 5.68/1.09 cnf(c41, axiom, % 5.68/1.09 chased(odie,garfield)). % 5.68/1.09 cnf(a18, assumption, % 5.68/1.09 X1 = odie). % 5.68/1.09 cnf(a19, assumption, % 5.68/1.09 X0 = garfield). % 5.68/1.09 cnf(c42, plain, % 5.68/1.09 ~dog(X1) | ~cat(X0), % 5.68/1.09 inference(strict_predicate_extension, [assumptions([a18, a19])], [c4, c41])). % 5.68/1.09 cnf(c43, plain, % 5.68/1.09 $false, % 5.68/1.09 inference(strict_predicate_extension, [assumptions([a18, a19])], [c4, c41])). % 5.68/1.09 % 5.68/1.09 cnf(c44, plain, % 5.68/1.09 dog(X11)). % 5.68/1.09 cnf(a20, assumption, % 5.68/1.09 X1 = X11). % 5.68/1.09 cnf(c45, plain, % 5.68/1.09 ~cat(X0), % 5.68/1.09 inference(predicate_reduction, [assumptions([a20])], [c42, c44])). % 5.68/1.09 % 5.68/1.09 cnf(c46, plain, % 5.68/1.09 cat(X7)). % 5.68/1.09 cnf(a21, assumption, % 5.68/1.09 X0 = X7). % 5.68/1.09 cnf(c47, plain, % 5.68/1.09 $false, % 5.68/1.09 inference(predicate_reduction, [assumptions([a21])], [c45, c46])). % 5.68/1.09 % 5.68/1.09 cnf(c48, plain, % 5.68/1.09 $false, % 5.68/1.09 inference(constraint_solving, [ % 5.68/1.09 bind(X0, garfield), % 5.68/1.09 bind(X1, odie), % 5.68/1.09 bind(X2, jon), % 5.68/1.09 bind(X3, jon), % 5.68/1.09 bind(X4, garfield), % 5.68/1.09 bind(X5, jon), % 5.68/1.09 bind(X6, jon), % 5.68/1.09 bind(X7, garfield), % 5.68/1.09 bind(X8, odie), % 5.68/1.09 bind(X9, jon), % 5.68/1.09 bind(X10, jon), % 5.68/1.09 bind(X11, odie) % 5.68/1.09 ], % 5.68/1.09 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])). % 5.68/1.09 % 5.68/1.09 % SZS output end IncompleteProof %------------------------------------------------------------------------------