%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : HWV012-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 : n010.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:16 EDT 2022 % Result : Unsatisfiable 11.53s 1.83s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : HWV012-1 : TPTP v8.1.0. Released v2.5.0. % 0.04/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.35 % Computer : n010.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Fri Jun 17 02:30:38 EDT 2022 % 0.13/0.35 % CPUTime : % 11.53/1.83 % SZS status Unsatisfiable % 11.53/1.83 % SZS output begin IncompleteProof % 11.53/1.83 cnf(c0, axiom, % 11.53/1.83 p_Wr_error(plus(t_139,n1))). % 11.53/1.83 cnf(c1, plain, % 11.53/1.83 p_Wr_error(plus(t_139,n1)), % 11.53/1.83 inference(start, [], [c0])). % 11.53/1.83 % 11.53/1.83 cnf(c2, axiom, % 11.53/1.83 ~p_Wr_error(plus(X0,n1)) | ~gt(fifo_length,int_level(X0)) | p_Rd(X0) | ~p_Wr(X0) | p_Reset(X0)). % 11.53/1.83 cnf(a0, assumption, % 11.53/1.83 plus(t_139,n1) = plus(X0,n1)). % 11.53/1.83 cnf(c3, plain, % 11.53/1.83 $false, % 11.53/1.83 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 11.53/1.83 cnf(c4, plain, % 11.53/1.83 ~gt(fifo_length,int_level(X0)) | p_Rd(X0) | ~p_Wr(X0) | p_Reset(X0), % 11.53/1.83 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 11.53/1.83 % 11.53/1.83 cnf(c5, axiom, % 11.53/1.83 gt(fifo_length,int_level(t_139))). % 11.53/1.83 cnf(a1, assumption, % 11.53/1.83 fifo_length = fifo_length). % 11.53/1.83 cnf(a2, assumption, % 11.53/1.83 int_level(X0) = int_level(t_139)). % 11.53/1.83 cnf(c6, plain, % 11.53/1.83 p_Rd(X0) | ~p_Wr(X0) | p_Reset(X0), % 11.53/1.83 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])). % 11.53/1.83 cnf(c7, plain, % 11.53/1.83 $false, % 11.53/1.83 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])). % 11.53/1.83 % 11.53/1.83 cnf(c8, axiom, % 11.53/1.83 ~p_Wr_error(plus(X1,n1)) | ~p_Rd(X1) | ~p_Wr(X1) | p_Reset(X1)). % 11.53/1.83 cnf(a3, assumption, % 11.53/1.83 X0 = X1). % 11.53/1.83 cnf(c9, plain, % 11.53/1.83 ~p_Wr(X0) | p_Reset(X0), % 11.53/1.83 inference(strict_predicate_extension, [assumptions([a3])], [c6, c8])). % 11.53/1.83 cnf(c10, plain, % 11.53/1.83 ~p_Wr_error(plus(X1,n1)) | ~p_Wr(X1) | p_Reset(X1), % 11.53/1.83 inference(strict_predicate_extension, [assumptions([a3])], [c6, c8])). % 11.53/1.83 % 11.53/1.83 cnf(c11, plain, % 11.53/1.83 p_Wr_error(plus(t_139,n1))). % 11.53/1.83 cnf(a4, assumption, % 11.53/1.83 plus(X1,n1) = plus(t_139,n1)). % 11.53/1.83 cnf(c12, plain, % 11.53/1.83 ~p_Wr(X1) | p_Reset(X1), % 11.53/1.83 inference(predicate_reduction, [assumptions([a4])], [c10, c11])). % 11.53/1.83 % 11.53/1.83 cnf(c13, axiom, % 11.53/1.83 p_Wr(t_139)). % 11.53/1.83 cnf(a5, assumption, % 11.53/1.83 X1 = t_139). % 11.53/1.83 cnf(c14, plain, % 11.53/1.83 p_Reset(X1), % 11.53/1.83 inference(strict_predicate_extension, [assumptions([a5])], [c12, c13])). % 11.53/1.83 cnf(c15, plain, % 11.53/1.83 $false, % 11.53/1.83 inference(strict_predicate_extension, [assumptions([a5])], [c12, c13])). % 11.53/1.83 % 11.53/1.83 cnf(c16, axiom, % 11.53/1.83 ~p_Wr_error(plus(X2,n1)) | ~p_Reset(X2)). % 11.53/1.83 cnf(a6, assumption, % 11.53/1.83 X1 = X2). % 11.53/1.83 cnf(c17, plain, % 11.53/1.83 $false, % 11.53/1.83 inference(strict_predicate_extension, [assumptions([a6])], [c14, c16])). % 11.53/1.83 cnf(c18, plain, % 11.53/1.83 ~p_Wr_error(plus(X2,n1)), % 11.53/1.83 inference(strict_predicate_extension, [assumptions([a6])], [c14, c16])). % 11.53/1.83 % 11.53/1.83 cnf(c19, plain, % 11.53/1.83 p_Wr_error(plus(t_139,n1))). % 11.53/1.83 cnf(a7, assumption, % 11.53/1.83 plus(X2,n1) = plus(t_139,n1)). % 11.53/1.83 cnf(c20, plain, % 11.53/1.83 $false, % 11.53/1.83 inference(predicate_reduction, [assumptions([a7])], [c18, c19])). % 11.53/1.83 % 11.53/1.83 cnf(c21, plain, % 11.53/1.83 p_Wr(X1)). % 11.53/1.83 cnf(a8, assumption, % 11.53/1.83 X0 = X1). % 11.53/1.83 cnf(c22, plain, % 11.53/1.83 p_Reset(X0), % 11.53/1.83 inference(predicate_reduction, [assumptions([a8])], [c9, c21])). % 11.53/1.83 % 11.53/1.83 cnf(c23, plain, % 11.53/1.83 ~p_Reset(X1)). % 11.53/1.83 cnf(a9, assumption, % 11.53/1.83 X0 = X1). % 11.53/1.83 cnf(c24, plain, % 11.53/1.83 $false, % 11.53/1.83 inference(predicate_reduction, [assumptions([a9])], [c22, c23])). % 11.53/1.83 % 11.53/1.83 cnf(c25, plain, % 11.53/1.83 $false, % 11.53/1.83 inference(constraint_solving, [ % 11.53/1.83 bind(X0, t_139), % 11.53/1.83 bind(X1, t_139), % 11.53/1.83 bind(X2, t_139) % 11.53/1.83 ], % 11.53/1.83 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])). % 11.53/1.83 % 11.53/1.83 % SZS output end IncompleteProof %------------------------------------------------------------------------------