%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : COM004-1 : TPTP v8.1.0. Released v1.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 : n004.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 : Fri Jul 15 01:26:58 EDT 2022 % Result : Unsatisfiable 0.15s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.14 % Problem : COM004-1 : TPTP v8.1.0. Released v1.1.0. % 0.09/0.15 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.15/0.37 % Computer : n004.cluster.edu % 0.15/0.37 % Model : x86_64 x86_64 % 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.37 % Memory : 8042.1875MB % 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.37 % CPULimit : 300 % 0.15/0.37 % WCLimit : 600 % 0.15/0.37 % DateTime : Thu Jun 16 19:32:38 EDT 2022 % 0.15/0.37 % CPUTime : % 0.15/0.38 % SZS status Unsatisfiable % 0.15/0.38 % SZS output begin IncompleteProof % 0.15/0.38 cnf(c0, axiom, % 0.15/0.38 ~failure_node(X0,or(empty,empty))). % 0.15/0.38 cnf(c1, plain, % 0.15/0.38 ~failure_node(X0,or(empty,empty)), % 0.15/0.38 inference(start, [], [c0])). % 0.15/0.38 % 0.15/0.38 cnf(c2, axiom, % 0.15/0.38 ~siblings(X1,X2) | ~contradictory(X3,X4) | ~failure_node(X2,or(X5,X4)) | ~failure_node(X1,or(X6,X3)) | failure_node(parent_of(X1,X2),or(X6,X5))). % 0.15/0.38 cnf(a0, assumption, % 0.15/0.38 X0 = parent_of(X1,X2)). % 0.15/0.38 cnf(a1, assumption, % 0.15/0.38 or(empty,empty) = or(X6,X5)). % 0.15/0.38 cnf(c3, plain, % 0.15/0.38 $false, % 0.15/0.38 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.15/0.38 cnf(c4, plain, % 0.15/0.38 ~siblings(X1,X2) | ~contradictory(X3,X4) | ~failure_node(X2,or(X5,X4)) | ~failure_node(X1,or(X6,X3)), % 0.15/0.38 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.15/0.38 % 0.15/0.38 cnf(c5, axiom, % 0.15/0.38 siblings(left_child_of(X7),right_child_of(X7))). % 0.15/0.38 cnf(a2, assumption, % 0.15/0.38 X8 = X1). % 0.15/0.38 cnf(a3, assumption, % 0.15/0.38 X9 = X2). % 0.15/0.38 cnf(c6, plain, % 0.15/0.38 ~contradictory(X3,X4) | ~failure_node(X2,or(X5,X4)) | ~failure_node(X1,or(X6,X3)), % 0.15/0.38 inference(lazy_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.15/0.38 cnf(c7, plain, % 0.15/0.38 $false, % 0.15/0.38 inference(lazy_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.15/0.38 cnf(c8, plain, % 0.15/0.38 left_child_of(X7) != X8 | right_child_of(X7) != X9, % 0.15/0.38 inference(lazy_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.15/0.38 % 0.15/0.38 cnf(c9, axiom, % 0.15/0.38 n_left = left_child_of(n)). % 0.15/0.38 cnf(a4, assumption, % 0.15/0.38 left_child_of(X7) = left_child_of(n)). % 0.15/0.38 cnf(c10, plain, % 0.15/0.38 right_child_of(X7) != X9, % 0.15/0.38 inference(strict_function_extension, [assumptions([a4])], [c8, c9])). % 0.15/0.38 cnf(c11, plain, % 0.15/0.38 $false, % 0.15/0.38 inference(strict_function_extension, [assumptions([a4])], [c8, c9])). % 0.15/0.38 cnf(c12, plain, % 0.15/0.38 X10 != n_left | X10 != X8, % 0.15/0.38 inference(strict_function_extension, [assumptions([a4])], [c8, c9])). % 0.15/0.38 % 0.15/0.38 cnf(a5, assumption, % 0.15/0.38 X10 = n_left). % 0.15/0.38 cnf(c13, plain, % 0.15/0.38 X10 != X8, % 0.15/0.38 inference(reflexivity, [assumptions([a5])], [c12])). % 0.15/0.38 % 0.15/0.38 cnf(a6, assumption, % 0.15/0.38 X10 = X8). % 0.15/0.38 cnf(c14, plain, % 0.15/0.38 $false, % 0.15/0.38 inference(reflexivity, [assumptions([a6])], [c13])). % 0.15/0.38 % 0.15/0.38 cnf(c15, axiom, % 0.15/0.38 n_right = right_child_of(n)). % 0.15/0.38 cnf(a7, assumption, % 0.15/0.38 right_child_of(X7) = right_child_of(n)). % 0.15/0.38 cnf(c16, plain, % 0.15/0.38 $false, % 0.15/0.38 inference(strict_function_extension, [assumptions([a7])], [c10, c15])). % 0.15/0.38 cnf(c17, plain, % 0.15/0.38 $false, % 0.15/0.38 inference(strict_function_extension, [assumptions([a7])], [c10, c15])). % 0.15/0.38 cnf(c18, plain, % 0.15/0.38 X11 != n_right | X11 != X9, % 0.15/0.38 inference(strict_function_extension, [assumptions([a7])], [c10, c15])). % 0.15/0.38 % 0.15/0.38 cnf(a8, assumption, % 0.15/0.38 X11 = n_right). % 0.15/0.38 cnf(c19, plain, % 0.15/0.38 X11 != X9, % 0.15/0.38 inference(reflexivity, [assumptions([a8])], [c18])). % 0.15/0.38 % 0.15/0.38 cnf(a9, assumption, % 0.15/0.38 X11 = X9). % 0.15/0.38 cnf(c20, plain, % 0.15/0.38 $false, % 0.15/0.38 inference(reflexivity, [assumptions([a9])], [c19])). % 0.15/0.38 % 0.15/0.38 cnf(c21, axiom, % 0.15/0.38 contradictory(X12,negate(X12))). % 0.15/0.38 cnf(a10, assumption, % 0.15/0.38 X3 = X12). % 0.15/0.38 cnf(a11, assumption, % 0.15/0.38 X4 = negate(X12)). % 0.15/0.38 cnf(c22, plain, % 0.15/0.38 ~failure_node(X2,or(X5,X4)) | ~failure_node(X1,or(X6,X3)), % 0.15/0.38 inference(strict_predicate_extension, [assumptions([a10, a11])], [c6, c21])). % 0.15/0.38 cnf(c23, plain, % 0.15/0.38 $false, % 0.15/0.38 inference(strict_predicate_extension, [assumptions([a10, a11])], [c6, c21])). % 0.15/0.38 % 0.15/0.38 cnf(c24, axiom, % 0.15/0.38 failure_node(n_right,or(empty,negate(atom)))). % 0.15/0.38 cnf(a12, assumption, % 0.15/0.38 X2 = n_right). % 0.15/0.38 cnf(a13, assumption, % 0.15/0.38 or(X5,X4) = or(empty,negate(atom))). % 0.15/0.38 cnf(c25, plain, % 0.15/0.38 ~failure_node(X1,or(X6,X3)), % 0.15/0.38 inference(strict_predicate_extension, [assumptions([a12, a13])], [c22, c24])). % 0.15/0.38 cnf(c26, plain, % 0.15/0.38 $false, % 0.15/0.38 inference(strict_predicate_extension, [assumptions([a12, a13])], [c22, c24])). % 0.15/0.38 % 0.15/0.38 cnf(c27, axiom, % 0.15/0.38 failure_node(n_left,or(empty,atom))). % 0.15/0.38 cnf(a14, assumption, % 0.15/0.38 X1 = n_left). % 0.15/0.38 cnf(a15, assumption, % 0.15/0.38 or(X6,X3) = or(empty,atom)). % 0.15/0.38 cnf(c28, plain, % 0.15/0.38 $false, % 0.15/0.38 inference(strict_predicate_extension, [assumptions([a14, a15])], [c25, c27])). % 0.15/0.38 cnf(c29, plain, % 0.15/0.38 $false, % 0.15/0.38 inference(strict_predicate_extension, [assumptions([a14, a15])], [c25, c27])). % 0.15/0.38 % 0.15/0.38 cnf(c30, plain, % 0.15/0.38 $false, % 0.15/0.38 inference(constraint_solving, [ % 0.15/0.38 bind(X0, parent_of(X1,X2)), % 0.15/0.38 bind(X1, n_left), % 0.15/0.38 bind(X2, n_right), % 0.15/0.38 bind(X3, atom), % 0.15/0.38 bind(X4, negate(X12)), % 0.15/0.38 bind(X5, empty), % 0.15/0.38 bind(X6, empty), % 0.15/0.38 bind(X7, n), % 0.15/0.38 bind(X8, n_left), % 0.15/0.38 bind(X9, n_right), % 0.15/0.38 bind(X10, n_left), % 0.15/0.38 bind(X11, n_right), % 0.15/0.38 bind(X12, atom) % 0.15/0.38 ], % 0.15/0.38 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 0.15/0.38 % 0.15/0.38 % SZS output end IncompleteProof %------------------------------------------------------------------------------