TSTP Solution File: HWV010-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : HWV010-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 : n006.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:14 EDT 2022
% Result : Unsatisfiable 0.23s 0.40s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : HWV010-1 : TPTP v8.1.0. Released v2.5.0.
% 0.08/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.36 % Computer : n006.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Fri Jun 17 07:44:26 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.23/0.40 % SZS status Unsatisfiable
% 0.23/0.40 % SZS output begin IncompleteProof
% 0.23/0.40 cnf(c0, axiom,
% 0.23/0.40 n0 = int_level(t_139) | p_Empty(t_139)).
% 0.23/0.40 cnf(c1, plain,
% 0.23/0.40 n0 = int_level(t_139) | p_Empty(t_139),
% 0.23/0.40 inference(start, [], [c0])).
% 0.23/0.40
% 0.23/0.40 cnf(c2, axiom,
% 0.23/0.40 p_Empty(X0) | n0 != int_level(X0)).
% 0.23/0.40 cnf(a0, assumption,
% 0.23/0.40 int_level(X0) = int_level(t_139)).
% 0.23/0.40 cnf(a1, assumption,
% 0.23/0.40 n0 = X1).
% 0.23/0.40 cnf(c3, plain,
% 0.23/0.40 p_Empty(t_139),
% 0.23/0.40 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.23/0.40 cnf(c4, plain,
% 0.23/0.40 p_Empty(X0),
% 0.23/0.40 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.23/0.40 cnf(c5, plain,
% 0.23/0.40 n0 != X1,
% 0.23/0.40 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.23/0.40
% 0.23/0.40 cnf(a2, assumption,
% 0.23/0.40 n0 = X1).
% 0.23/0.40 cnf(c6, plain,
% 0.23/0.40 $false,
% 0.23/0.40 inference(reflexivity, [assumptions([a2])], [c5])).
% 0.23/0.40
% 0.23/0.40 cnf(c7, axiom,
% 0.23/0.40 n0 != int_level(t_139) | ~p_Empty(t_139)).
% 0.23/0.40 cnf(a3, assumption,
% 0.23/0.40 X0 = t_139).
% 0.23/0.40 cnf(c8, plain,
% 0.23/0.40 $false,
% 0.23/0.40 inference(strict_predicate_extension, [assumptions([a3])], [c4, c7])).
% 0.23/0.40 cnf(c9, plain,
% 0.23/0.40 n0 != int_level(t_139),
% 0.23/0.40 inference(strict_predicate_extension, [assumptions([a3])], [c4, c7])).
% 0.23/0.40
% 0.23/0.40 cnf(c10, plain,
% 0.23/0.40 n0 = int_level(X0)).
% 0.23/0.40 cnf(a4, assumption,
% 0.23/0.40 int_level(t_139) = int_level(X0)).
% 0.23/0.40 cnf(a5, assumption,
% 0.23/0.40 n0 = X2).
% 0.23/0.40 cnf(c11, plain,
% 0.23/0.40 $false,
% 0.23/0.40 inference(equality_reduction, [assumptions([a4, a5])], [c9, c10])).
% 0.23/0.40 cnf(c12, plain,
% 0.23/0.40 n0 != X2,
% 0.23/0.40 inference(equality_reduction, [assumptions([a4, a5])], [c9, c10])).
% 0.23/0.40
% 0.23/0.40 cnf(a6, assumption,
% 0.23/0.40 n0 = X2).
% 0.23/0.40 cnf(c13, plain,
% 0.23/0.40 $false,
% 0.23/0.40 inference(reflexivity, [assumptions([a6])], [c12])).
% 0.23/0.40
% 0.23/0.40 cnf(c14, axiom,
% 0.23/0.40 ~p_Empty(X3) | n0 = int_level(X3)).
% 0.23/0.40 cnf(a7, assumption,
% 0.23/0.40 t_139 = X3).
% 0.23/0.40 cnf(c15, plain,
% 0.23/0.40 $false,
% 0.23/0.40 inference(strict_predicate_extension, [assumptions([a7])], [c3, c14])).
% 0.23/0.40 cnf(c16, plain,
% 0.23/0.40 n0 = int_level(X3),
% 0.23/0.40 inference(strict_predicate_extension, [assumptions([a7])], [c3, c14])).
% 0.23/0.40
% 0.23/0.40 cnf(c17, plain,
% 0.23/0.40 n0 != int_level(t_139)).
% 0.23/0.40 cnf(a8, assumption,
% 0.23/0.40 int_level(t_139) = int_level(X3)).
% 0.23/0.40 cnf(a9, assumption,
% 0.23/0.40 n0 = X4).
% 0.23/0.40 cnf(c18, plain,
% 0.23/0.40 $false,
% 0.23/0.40 inference(subterm_reduction, [assumptions([a8, a9])], [c16, c17])).
% 0.23/0.40 cnf(c19, plain,
% 0.23/0.40 n0 != X4,
% 0.23/0.40 inference(subterm_reduction, [assumptions([a8, a9])], [c16, c17])).
% 0.23/0.40
% 0.23/0.40 cnf(a10, assumption,
% 0.23/0.40 n0 = X4).
% 0.23/0.40 cnf(c20, plain,
% 0.23/0.40 $false,
% 0.23/0.40 inference(reflexivity, [assumptions([a10])], [c19])).
% 0.23/0.40
% 0.23/0.40 cnf(c21, plain,
% 0.23/0.40 $false,
% 0.23/0.40 inference(constraint_solving, [
% 0.23/0.40 bind(X0, t_139),
% 0.23/0.40 bind(X1, n0),
% 0.23/0.40 bind(X2, n0),
% 0.23/0.40 bind(X3, t_139),
% 0.23/0.40 bind(X4, n0)
% 0.23/0.40 ],
% 0.23/0.40 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 0.23/0.40
% 0.23/0.40 % SZS output end IncompleteProof
%------------------------------------------------------------------------------