%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : HWV014-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 : n003.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:17 EDT 2022 % Result : Unsatisfiable 0.20s 0.49s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : HWV014-1 : TPTP v8.1.0. Released v2.5.0. % 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n003.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Fri Jun 17 04:43:42 EDT 2022 % 0.12/0.34 % CPUTime : % 0.20/0.49 % SZS status Unsatisfiable % 0.20/0.49 % SZS output begin IncompleteProof % 0.20/0.49 cnf(c0, axiom, % 0.20/0.49 ~p_Reset(x_139)). % 0.20/0.49 cnf(c1, plain, % 0.20/0.49 ~p_Reset(x_139), % 0.20/0.49 inference(start, [], [c0])). % 0.20/0.49 % 0.20/0.49 cnf(c2, axiom, % 0.20/0.49 int_level(plus(X0,n1)) = minus(int_level(X0),n1) | ~gt(int_level(X0),n0) | ~p_Rd(X0) | p_Wr(X0) | p_Reset(X0)). % 0.20/0.49 cnf(a0, assumption, % 0.20/0.49 x_139 = X0). % 0.20/0.49 cnf(c3, plain, % 0.20/0.49 $false, % 0.20/0.49 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.20/0.49 cnf(c4, plain, % 0.20/0.49 int_level(plus(X0,n1)) = minus(int_level(X0),n1) | ~gt(int_level(X0),n0) | ~p_Rd(X0) | p_Wr(X0), % 0.20/0.49 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.20/0.49 % 0.20/0.49 cnf(c5, axiom, % 0.20/0.49 int_level(plus(x_139,n1)) != minus(int_level(x_139),n1)). % 0.20/0.49 cnf(a1, assumption, % 0.20/0.49 minus(int_level(x_139),n1) = minus(int_level(X0),n1)). % 0.20/0.49 cnf(a2, assumption, % 0.20/0.49 int_level(plus(X0,n1)) = X1). % 0.20/0.49 cnf(c6, plain, % 0.20/0.49 ~gt(int_level(X0),n0) | ~p_Rd(X0) | p_Wr(X0), % 0.20/0.49 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])). % 0.20/0.49 cnf(c7, plain, % 0.20/0.49 $false, % 0.20/0.49 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])). % 0.20/0.49 cnf(c8, plain, % 0.20/0.49 int_level(plus(x_139,n1)) != X1, % 0.20/0.49 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])). % 0.20/0.49 % 0.20/0.49 cnf(a3, assumption, % 0.20/0.49 int_level(plus(x_139,n1)) = X1). % 0.20/0.49 cnf(c9, plain, % 0.20/0.49 $false, % 0.20/0.49 inference(reflexivity, [assumptions([a3])], [c8])). % 0.20/0.49 % 0.20/0.49 cnf(c10, axiom, % 0.20/0.49 gt(int_level(x_139),n0)). % 0.20/0.49 cnf(a4, assumption, % 0.20/0.49 int_level(X0) = int_level(x_139)). % 0.20/0.49 cnf(a5, assumption, % 0.20/0.49 n0 = n0). % 0.20/0.49 cnf(c11, plain, % 0.20/0.49 ~p_Rd(X0) | p_Wr(X0), % 0.20/0.49 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c10])). % 0.20/0.49 cnf(c12, plain, % 0.20/0.49 $false, % 0.20/0.49 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c10])). % 0.20/0.49 % 0.20/0.49 cnf(c13, axiom, % 0.20/0.49 p_Rd(x_139)). % 0.20/0.49 cnf(a6, assumption, % 0.20/0.49 X0 = x_139). % 0.20/0.49 cnf(c14, plain, % 0.20/0.49 p_Wr(X0), % 0.20/0.49 inference(strict_predicate_extension, [assumptions([a6])], [c11, c13])). % 0.20/0.49 cnf(c15, plain, % 0.20/0.49 $false, % 0.20/0.49 inference(strict_predicate_extension, [assumptions([a6])], [c11, c13])). % 0.20/0.49 % 0.20/0.49 cnf(c16, axiom, % 0.20/0.49 ~p_Wr(x_139)). % 0.20/0.49 cnf(a7, assumption, % 0.20/0.49 X0 = x_139). % 0.20/0.49 cnf(c17, plain, % 0.20/0.49 $false, % 0.20/0.49 inference(strict_predicate_extension, [assumptions([a7])], [c14, c16])). % 0.20/0.49 cnf(c18, plain, % 0.20/0.49 $false, % 0.20/0.49 inference(strict_predicate_extension, [assumptions([a7])], [c14, c16])). % 0.20/0.49 % 0.20/0.49 cnf(c19, plain, % 0.20/0.49 $false, % 0.20/0.49 inference(constraint_solving, [ % 0.20/0.49 bind(X0, x_139), % 0.20/0.49 bind(X1, int_level(plus(X0,n1))) % 0.20/0.49 ], % 0.20/0.49 [a0, a1, a2, a3, a4, a5, a6, a7])). % 0.20/0.49 % 0.20/0.49 % SZS output end IncompleteProof %------------------------------------------------------------------------------