%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : ANA021-2 : TPTP v8.1.0. Released 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 : n015.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 : Thu Jul 14 19:08:36 EDT 2022 % Result : Unsatisfiable 0.13s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : ANA021-2 : TPTP v8.1.0. Released v3.2.0. % 0.10/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n015.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Fri Jul 8 04:55:35 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.35 % SZS status Unsatisfiable % 0.13/0.35 % SZS output begin IncompleteProof % 0.13/0.35 cnf(c0, axiom, % 0.13/0.35 c_0 != v_x). % 0.13/0.35 cnf(c1, plain, % 0.13/0.35 c_0 != v_x, % 0.13/0.35 inference(start, [], [c0])). % 0.13/0.35 % 0.13/0.35 cnf(c2, axiom, % 0.13/0.35 c_0 = X0 | c_less(c_0,X0,tc_nat)). % 0.13/0.35 cnf(a0, assumption, % 0.13/0.35 v_x = X0). % 0.13/0.35 cnf(c3, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.35 cnf(c4, plain, % 0.13/0.35 c_less(c_0,X0,tc_nat), % 0.13/0.35 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.35 cnf(c5, plain, % 0.13/0.35 c_0 != X1 | c_0 != X1, % 0.13/0.35 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.35 % 0.13/0.35 cnf(a1, assumption, % 0.13/0.35 c_0 = X1). % 0.13/0.35 cnf(c6, plain, % 0.13/0.35 c_0 != X1, % 0.13/0.35 inference(reflexivity, [assumptions([a1])], [c5])). % 0.13/0.35 % 0.13/0.35 cnf(a2, assumption, % 0.13/0.35 c_0 = X1). % 0.13/0.35 cnf(c7, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(reflexivity, [assumptions([a2])], [c6])). % 0.13/0.35 % 0.13/0.35 cnf(c8, axiom, % 0.13/0.35 c_Suc(c_minus(X2,c_1,tc_nat)) = X2 | ~c_less(c_0,X2,tc_nat)). % 0.13/0.35 cnf(a3, assumption, % 0.13/0.35 c_0 = c_0). % 0.13/0.35 cnf(a4, assumption, % 0.13/0.35 X0 = X2). % 0.13/0.35 cnf(a5, assumption, % 0.13/0.35 tc_nat = tc_nat). % 0.13/0.35 cnf(c9, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c8])). % 0.13/0.35 cnf(c10, plain, % 0.13/0.35 c_Suc(c_minus(X2,c_1,tc_nat)) = X2, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c8])). % 0.13/0.35 % 0.13/0.35 cnf(c11, axiom, % 0.13/0.35 c_lessequals(c_HOL_Oabs(v_f(c_Suc(X3)),t_a),c_times(v_c,c_HOL_Oabs(v_h(c_Suc(X3)),t_a),t_a),t_a)). % 0.13/0.35 cnf(a6, assumption, % 0.13/0.35 c_Suc(X3) = c_Suc(c_minus(X2,c_1,tc_nat))). % 0.13/0.35 cnf(c12, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_subterm_extension, [assumptions([a6])], [c10, c11])). % 0.13/0.35 cnf(c13, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_subterm_extension, [assumptions([a6])], [c10, c11])). % 0.13/0.35 cnf(c14, plain, % 0.13/0.35 c_lessequals(c_HOL_Oabs(v_f(c_Suc(X3)),t_a),c_times(v_c,c_HOL_Oabs(v_h(X2),t_a),t_a),t_a), % 0.13/0.35 inference(strict_subterm_extension, [assumptions([a6])], [c10, c11])). % 0.13/0.35 % 0.13/0.35 cnf(c15, plain, % 0.13/0.35 c_Suc(c_minus(X2,c_1,tc_nat)) = X2). % 0.13/0.35 cnf(a7, assumption, % 0.13/0.35 c_Suc(X3) = c_Suc(c_minus(X2,c_1,tc_nat))). % 0.13/0.35 cnf(c16, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(equality_reduction, [assumptions([a7])], [c14, c15])). % 0.13/0.35 cnf(c17, plain, % 0.13/0.35 c_lessequals(c_HOL_Oabs(v_f(X2),t_a),c_times(v_c,c_HOL_Oabs(v_h(X2),t_a),t_a),t_a), % 0.13/0.35 inference(equality_reduction, [assumptions([a7])], [c14, c15])). % 0.13/0.35 % 0.13/0.35 cnf(c18, axiom, % 0.13/0.35 ~c_lessequals(c_HOL_Oabs(v_f(v_x),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),t_a)). % 0.13/0.35 cnf(a8, assumption, % 0.13/0.35 c_HOL_Oabs(v_f(X2),t_a) = c_HOL_Oabs(v_f(v_x),t_a)). % 0.13/0.35 cnf(a9, assumption, % 0.13/0.35 c_times(v_c,c_HOL_Oabs(v_h(X2),t_a),t_a) = c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a)). % 0.13/0.35 cnf(a10, assumption, % 0.13/0.35 t_a = t_a). % 0.13/0.35 cnf(c19, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c17, c18])). % 0.13/0.35 cnf(c20, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c17, c18])). % 0.13/0.35 % 0.13/0.35 cnf(c21, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(constraint_solving, [ % 0.13/0.35 bind(X0, v_x), % 0.13/0.35 bind(X1, c_0), % 0.13/0.35 bind(X2, v_x), % 0.13/0.35 bind(X3, c_minus(X2,c_1,tc_nat)) % 0.13/0.35 ], % 0.13/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])). % 0.13/0.35 % 0.13/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------