%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : HWV021-1 : TPTP v8.1.0. Released v2.5.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 : Sat Jul 16 18:14:21 EDT 2022 % Result : Unsatisfiable 193.96s 25.09s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : HWV021-1 : TPTP v8.1.0. Released v2.5.0. % 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n021.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 : Fri Jun 17 08:35:15 EDT 2022 % 0.12/0.33 % CPUTime : % 193.96/25.09 % SZS status Unsatisfiable % 193.96/25.09 % SZS output begin IncompleteProof % 193.96/25.09 cnf(c0, axiom, % 193.96/25.09 ~p_Reset(t_139)). % 193.96/25.09 cnf(c1, plain, % 193.96/25.09 ~p_Reset(t_139), % 193.96/25.09 inference(start, [], [c0])). % 193.96/25.09 % 193.96/25.09 cnf(c2, axiom, % 193.96/25.09 ~p_Rd_error(plus(X0,n1)) | ~gt(int_level(X0),n0) | ~p_Rd(X0) | p_Wr(X0) | p_Reset(X0)). % 193.96/25.09 cnf(a0, assumption, % 193.96/25.09 t_139 = X0). % 193.96/25.09 cnf(c3, plain, % 193.96/25.09 $false, % 193.96/25.09 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 193.96/25.09 cnf(c4, plain, % 193.96/25.09 ~p_Rd_error(plus(X0,n1)) | ~gt(int_level(X0),n0) | ~p_Rd(X0) | p_Wr(X0), % 193.96/25.09 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 193.96/25.09 % 193.96/25.09 cnf(c5, axiom, % 193.96/25.09 p_Rd_error(plus(t_139,n1))). % 193.96/25.09 cnf(a1, assumption, % 193.96/25.09 plus(X0,n1) = plus(t_139,n1)). % 193.96/25.09 cnf(c6, plain, % 193.96/25.09 ~gt(int_level(X0),n0) | ~p_Rd(X0) | p_Wr(X0), % 193.96/25.09 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 193.96/25.09 cnf(c7, plain, % 193.96/25.09 $false, % 193.96/25.09 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 193.96/25.09 % 193.96/25.09 cnf(c8, axiom, % 193.96/25.09 gt(X1,n0) | n0 = X1). % 193.96/25.09 cnf(a2, assumption, % 193.96/25.09 int_level(X0) = X1). % 193.96/25.09 cnf(a3, assumption, % 193.96/25.09 n0 = n0). % 193.96/25.09 cnf(c9, plain, % 193.96/25.09 ~p_Rd(X0) | p_Wr(X0), % 193.96/25.09 inference(strict_predicate_extension, [assumptions([a2, a3])], [c6, c8])). % 193.96/25.09 cnf(c10, plain, % 193.96/25.09 n0 = X1, % 193.96/25.09 inference(strict_predicate_extension, [assumptions([a2, a3])], [c6, c8])). % 193.96/25.09 % 193.96/25.09 cnf(c11, axiom, % 193.96/25.09 p_Empty(X2) | n0 != int_level(X2)). % 193.96/25.09 cnf(a4, assumption, % 193.96/25.09 int_level(X2) = X1). % 193.96/25.09 cnf(a5, assumption, % 193.96/25.09 n0 = X3). % 193.96/25.09 cnf(c12, plain, % 193.96/25.09 $false, % 193.96/25.09 inference(strict_subterm_extension, [assumptions([a4, a5])], [c10, c11])). % 193.96/25.09 cnf(c13, plain, % 193.96/25.09 p_Empty(X2), % 193.96/25.09 inference(strict_subterm_extension, [assumptions([a4, a5])], [c10, c11])). % 193.96/25.09 cnf(c14, plain, % 193.96/25.09 n0 != X3, % 193.96/25.09 inference(strict_subterm_extension, [assumptions([a4, a5])], [c10, c11])). % 193.96/25.09 % 193.96/25.09 cnf(a6, assumption, % 193.96/25.09 n0 = X3). % 193.96/25.09 cnf(c15, plain, % 193.96/25.09 $false, % 193.96/25.09 inference(reflexivity, [assumptions([a6])], [c14])). % 193.96/25.09 % 193.96/25.09 cnf(c16, axiom, % 193.96/25.09 ~p_Empty(t_139)). % 193.96/25.09 cnf(a7, assumption, % 193.96/25.09 X2 = t_139). % 193.96/25.09 cnf(c17, plain, % 193.96/25.09 $false, % 193.96/25.09 inference(strict_predicate_extension, [assumptions([a7])], [c13, c16])). % 193.96/25.09 cnf(c18, plain, % 193.96/25.09 $false, % 193.96/25.09 inference(strict_predicate_extension, [assumptions([a7])], [c13, c16])). % 193.96/25.09 % 193.96/25.09 cnf(c19, axiom, % 193.96/25.09 p_Rd(t_139)). % 193.96/25.09 cnf(a8, assumption, % 193.96/25.09 X0 = t_139). % 193.96/25.09 cnf(c20, plain, % 193.96/25.09 p_Wr(X0), % 193.96/25.09 inference(strict_predicate_extension, [assumptions([a8])], [c9, c19])). % 193.96/25.09 cnf(c21, plain, % 193.96/25.09 $false, % 193.96/25.09 inference(strict_predicate_extension, [assumptions([a8])], [c9, c19])). % 193.96/25.09 % 193.96/25.09 cnf(c22, axiom, % 193.96/25.09 ~p_Rd_error(plus(X4,n1)) | ~gt(int_level(X4),n0) | ~p_Rd(X4) | ~p_Wr(X4) | p_Reset(X4)). % 193.96/25.09 cnf(a9, assumption, % 193.96/25.09 X0 = X4). % 193.96/25.09 cnf(c23, plain, % 193.96/25.09 $false, % 193.96/25.09 inference(strict_predicate_extension, [assumptions([a9])], [c20, c22])). % 193.96/25.09 cnf(c24, plain, % 193.96/25.09 ~p_Rd_error(plus(X4,n1)) | ~gt(int_level(X4),n0) | ~p_Rd(X4) | p_Reset(X4), % 193.96/25.09 inference(strict_predicate_extension, [assumptions([a9])], [c20, c22])). % 193.96/25.09 % 193.96/25.09 cnf(c25, plain, % 193.96/25.09 p_Rd_error(plus(X0,n1))). % 193.96/25.09 cnf(a10, assumption, % 193.96/25.09 plus(X4,n1) = plus(X0,n1)). % 193.96/25.09 cnf(c26, plain, % 193.96/25.09 ~gt(int_level(X4),n0) | ~p_Rd(X4) | p_Reset(X4), % 193.96/25.09 inference(predicate_reduction, [assumptions([a10])], [c24, c25])). % 193.96/25.09 % 193.96/25.09 cnf(c27, plain, % 193.96/25.09 gt(int_level(X0),n0)). % 193.96/25.09 cnf(a11, assumption, % 193.96/25.09 int_level(X4) = int_level(X0)). % 193.96/25.09 cnf(a12, assumption, % 193.96/25.09 n0 = n0). % 193.96/25.09 cnf(c28, plain, % 193.96/25.09 ~p_Rd(X4) | p_Reset(X4), % 193.96/25.09 inference(predicate_reduction, [assumptions([a11, a12])], [c26, c27])). % 193.96/25.09 % 193.96/25.09 cnf(c29, plain, % 193.96/25.09 p_Rd(X0)). % 193.96/25.09 cnf(a13, assumption, % 193.96/25.09 X4 = X0). % 193.96/25.09 cnf(c30, plain, % 193.96/25.09 p_Reset(X4), % 193.96/25.09 inference(predicate_reduction, [assumptions([a13])], [c28, c29])). % 193.96/25.09 % 193.96/25.09 cnf(c31, plain, % 193.96/25.09 ~p_Reset(t_139)). % 193.96/25.09 cnf(a14, assumption, % 193.96/25.09 X4 = t_139). % 193.96/25.09 cnf(c32, plain, % 193.96/25.09 $false, % 193.96/25.09 inference(predicate_reduction, [assumptions([a14])], [c30, c31])). % 193.96/25.09 % 193.96/25.09 cnf(c33, plain, % 193.96/25.09 $false, % 193.96/25.09 inference(constraint_solving, [ % 193.96/25.09 bind(X0, t_139), % 193.96/25.09 bind(X1, int_level(X0)), % 193.96/25.09 bind(X2, t_139), % 193.96/25.09 bind(X3, n0), % 193.96/25.09 bind(X4, t_139) % 193.96/25.09 ], % 193.96/25.09 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])). % 193.96/25.09 % 193.96/25.09 % SZS output end IncompleteProof %------------------------------------------------------------------------------