%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GRA005+1 : TPTP v8.1.0. Bugfixed v3.2.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n020.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 : Sat Jul 16 07:18:57 EDT 2022 % Result : Theorem 0.19s 0.53s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : GRA005+1 : TPTP v8.1.0. Bugfixed v3.2.0. % 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n020.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 : Tue May 31 00:53:08 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.53 % SZS status Theorem % 0.19/0.53 % SZS output begin IncompleteProof % 0.19/0.53 cnf(c0, axiom, % 0.19/0.53 head_of(sK26) = head_of(sK28)). % 0.19/0.53 cnf(c1, plain, % 0.19/0.53 head_of(sK26) = head_of(sK28), % 0.19/0.53 inference(start, [], [c0])). % 0.19/0.53 % 0.19/0.53 cnf(c2, axiom, % 0.19/0.53 head_of(X0) != head_of(X1) | tail_of(X2) != tail_of(X1) | ~precedes(X2,X0,X3) | ~shortest_path(X4,X5,X3)). % 0.19/0.53 cnf(a0, assumption, % 0.19/0.53 head_of(X1) = head_of(sK28)). % 0.19/0.53 cnf(a1, assumption, % 0.19/0.53 head_of(sK26) = X6). % 0.19/0.53 cnf(c3, plain, % 0.19/0.53 $false, % 0.19/0.53 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.19/0.53 cnf(c4, plain, % 0.19/0.53 tail_of(X2) != tail_of(X1) | ~precedes(X2,X0,X3) | ~shortest_path(X4,X5,X3), % 0.19/0.53 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.19/0.53 cnf(c5, plain, % 0.19/0.53 head_of(X0) != X6, % 0.19/0.53 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.19/0.53 % 0.19/0.53 cnf(a2, assumption, % 0.19/0.53 head_of(X0) = X6). % 0.19/0.53 cnf(c6, plain, % 0.19/0.53 $false, % 0.19/0.53 inference(reflexivity, [assumptions([a2])], [c5])). % 0.19/0.53 % 0.19/0.53 cnf(c7, axiom, % 0.19/0.53 tail_of(sK25) = tail_of(sK28)). % 0.19/0.53 cnf(a3, assumption, % 0.19/0.53 tail_of(X2) = tail_of(sK25)). % 0.19/0.53 cnf(c8, plain, % 0.19/0.53 ~precedes(X2,X0,X3) | ~shortest_path(X4,X5,X3), % 0.19/0.53 inference(strict_function_extension, [assumptions([a3])], [c4, c7])). % 0.19/0.53 cnf(c9, plain, % 0.19/0.53 $false, % 0.19/0.53 inference(strict_function_extension, [assumptions([a3])], [c4, c7])). % 0.19/0.53 cnf(c10, plain, % 0.19/0.53 X7 != tail_of(sK28) | X7 != tail_of(X1), % 0.19/0.53 inference(strict_function_extension, [assumptions([a3])], [c4, c7])). % 0.19/0.53 % 0.19/0.53 cnf(a4, assumption, % 0.19/0.53 X7 = tail_of(sK28)). % 0.19/0.53 cnf(c11, plain, % 0.19/0.53 X7 != tail_of(X1), % 0.19/0.53 inference(reflexivity, [assumptions([a4])], [c10])). % 0.19/0.53 % 0.19/0.53 cnf(a5, assumption, % 0.19/0.53 X7 = tail_of(X1)). % 0.19/0.53 cnf(c12, plain, % 0.19/0.53 $false, % 0.19/0.53 inference(reflexivity, [assumptions([a5])], [c11])). % 0.19/0.53 % 0.19/0.53 cnf(c13, axiom, % 0.19/0.53 precedes(sK25,sK26,sK27)). % 0.19/0.53 cnf(a6, assumption, % 0.19/0.53 X2 = sK25). % 0.19/0.53 cnf(a7, assumption, % 0.19/0.53 X0 = sK26). % 0.19/0.53 cnf(a8, assumption, % 0.19/0.53 X3 = sK27). % 0.19/0.53 cnf(c14, plain, % 0.19/0.53 ~shortest_path(X4,X5,X3), % 0.19/0.53 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c8, c13])). % 0.19/0.53 cnf(c15, plain, % 0.19/0.53 $false, % 0.19/0.53 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c8, c13])). % 0.19/0.53 % 0.19/0.53 cnf(c16, axiom, % 0.19/0.53 shortest_path(sK23,sK24,sK27)). % 0.19/0.53 cnf(a9, assumption, % 0.19/0.53 X4 = sK23). % 0.19/0.53 cnf(a10, assumption, % 0.19/0.53 X5 = sK24). % 0.19/0.53 cnf(a11, assumption, % 0.19/0.53 X3 = sK27). % 0.19/0.53 cnf(c17, plain, % 0.19/0.53 $false, % 0.19/0.53 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c14, c16])). % 0.19/0.53 cnf(c18, plain, % 0.19/0.53 $false, % 0.19/0.53 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c14, c16])). % 0.19/0.53 % 0.19/0.53 cnf(c19, plain, % 0.19/0.53 $false, % 0.19/0.53 inference(constraint_solving, [ % 0.19/0.53 bind(X0, sK26), % 0.19/0.53 bind(X1, sK28), % 0.19/0.53 bind(X2, sK25), % 0.19/0.53 bind(X3, sK27), % 0.19/0.53 bind(X4, sK23), % 0.19/0.53 bind(X5, sK24), % 0.19/0.53 bind(X6, head_of(sK26)), % 0.19/0.53 bind(X7, tail_of(sK28)) % 0.19/0.53 ], % 0.19/0.53 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.19/0.53 % 0.19/0.53 % SZS output end IncompleteProof %------------------------------------------------------------------------------