TSTP Solution File: HWV009-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : HWV009-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:13 EDT 2022
% Result : Unsatisfiable 0.20s 0.41s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HWV009-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n003.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 Jun 17 09:12:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.41 % SZS status Unsatisfiable
% 0.20/0.41 % SZS output begin IncompleteProof
% 0.20/0.41 cnf(c0, axiom,
% 0.20/0.41 p_Reset(t_139)).
% 0.20/0.41 cnf(c1, plain,
% 0.20/0.41 p_Reset(t_139),
% 0.20/0.41 inference(start, [], [c0])).
% 0.20/0.41
% 0.20/0.41 cnf(c2, axiom,
% 0.20/0.41 n0 = int_level(plus(X0,n1)) | ~p_Reset(X0)).
% 0.20/0.41 cnf(a0, assumption,
% 0.20/0.41 t_139 = X0).
% 0.20/0.41 cnf(c3, plain,
% 0.20/0.41 $false,
% 0.20/0.41 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.41 cnf(c4, plain,
% 0.20/0.41 n0 = int_level(plus(X0,n1)),
% 0.20/0.41 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.41
% 0.20/0.41 cnf(c5, axiom,
% 0.20/0.41 p_Rd_error(plus(t_139,n1)) | p_Wr_error(plus(t_139,n1)) | n0 != int_level(plus(t_139,n1))).
% 0.20/0.41 cnf(a1, assumption,
% 0.20/0.41 int_level(plus(t_139,n1)) = int_level(plus(X0,n1))).
% 0.20/0.41 cnf(a2, assumption,
% 0.20/0.41 n0 = X1).
% 0.20/0.41 cnf(c6, plain,
% 0.20/0.41 $false,
% 0.20/0.41 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.20/0.41 cnf(c7, plain,
% 0.20/0.41 p_Rd_error(plus(t_139,n1)) | p_Wr_error(plus(t_139,n1)),
% 0.20/0.41 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.20/0.41 cnf(c8, plain,
% 0.20/0.41 n0 != X1,
% 0.20/0.41 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.20/0.41
% 0.20/0.41 cnf(a3, assumption,
% 0.20/0.41 n0 = X1).
% 0.20/0.41 cnf(c9, plain,
% 0.20/0.41 $false,
% 0.20/0.41 inference(reflexivity, [assumptions([a3])], [c8])).
% 0.20/0.41
% 0.20/0.41 cnf(c10, axiom,
% 0.20/0.41 ~p_Rd_error(plus(X2,n1)) | ~p_Reset(X2)).
% 0.20/0.41 cnf(a4, assumption,
% 0.20/0.41 plus(t_139,n1) = plus(X2,n1)).
% 0.20/0.41 cnf(c11, plain,
% 0.20/0.41 p_Wr_error(plus(t_139,n1)),
% 0.20/0.41 inference(strict_predicate_extension, [assumptions([a4])], [c7, c10])).
% 0.20/0.41 cnf(c12, plain,
% 0.20/0.41 ~p_Reset(X2),
% 0.20/0.41 inference(strict_predicate_extension, [assumptions([a4])], [c7, c10])).
% 0.20/0.41
% 0.20/0.41 cnf(c13, plain,
% 0.20/0.41 p_Reset(t_139)).
% 0.20/0.41 cnf(a5, assumption,
% 0.20/0.41 X2 = t_139).
% 0.20/0.41 cnf(c14, plain,
% 0.20/0.41 $false,
% 0.20/0.41 inference(predicate_reduction, [assumptions([a5])], [c12, c13])).
% 0.20/0.41
% 0.20/0.41 cnf(c15, axiom,
% 0.20/0.41 ~p_Wr_error(plus(X3,n1)) | ~p_Reset(X3)).
% 0.20/0.41 cnf(a6, assumption,
% 0.20/0.41 plus(t_139,n1) = plus(X3,n1)).
% 0.20/0.41 cnf(c16, plain,
% 0.20/0.41 $false,
% 0.20/0.41 inference(strict_predicate_extension, [assumptions([a6])], [c11, c15])).
% 0.20/0.41 cnf(c17, plain,
% 0.20/0.41 ~p_Reset(X3),
% 0.20/0.41 inference(strict_predicate_extension, [assumptions([a6])], [c11, c15])).
% 0.20/0.41
% 0.20/0.41 cnf(c18, plain,
% 0.20/0.41 p_Reset(t_139)).
% 0.20/0.41 cnf(a7, assumption,
% 0.20/0.41 X3 = t_139).
% 0.20/0.41 cnf(c19, plain,
% 0.20/0.41 $false,
% 0.20/0.41 inference(predicate_reduction, [assumptions([a7])], [c17, c18])).
% 0.20/0.41
% 0.20/0.41 cnf(c20, plain,
% 0.20/0.41 $false,
% 0.20/0.41 inference(constraint_solving, [
% 0.20/0.41 bind(X0, t_139),
% 0.20/0.41 bind(X1, n0),
% 0.20/0.41 bind(X2, t_139),
% 0.20/0.41 bind(X3, t_139)
% 0.20/0.41 ],
% 0.20/0.41 [a0, a1, a2, a3, a4, a5, a6, a7])).
% 0.20/0.41
% 0.20/0.41 % SZS output end IncompleteProof
%------------------------------------------------------------------------------