TSTP Solution File: ANA044-2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : ANA044-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n011.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 : Thu Jul 14 19:08:50 EDT 2022
% Result : Unsatisfiable 0.12s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ANA044-2 : TPTP v8.1.0. Released v3.2.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 : n011.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 Jul 8 05:43:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % SZS status Unsatisfiable
% 0.12/0.34 % SZS output begin IncompleteProof
% 0.12/0.34 cnf(c0, axiom,
% 0.12/0.34 c_lessequals(c_0,v_l(X0,X1),t_b)).
% 0.12/0.34 cnf(c1, plain,
% 0.12/0.34 c_lessequals(c_0,v_l(X0,X1),t_b),
% 0.12/0.34 inference(start, [], [c0])).
% 0.12/0.34
% 0.12/0.34 cnf(c2, axiom,
% 0.12/0.34 c_lessequals(c_0,c_times(X2,X3,X4),X4) | ~c_lessequals(c_0,X2,X4) | ~c_lessequals(c_0,X3,X4) | ~class_Ring__and__Field_Opordered__cancel__semiring(X4)).
% 0.12/0.34 cnf(a0, assumption,
% 0.12/0.34 c_0 = c_0).
% 0.12/0.34 cnf(a1, assumption,
% 0.12/0.34 v_l(X0,X1) = X2).
% 0.12/0.34 cnf(a2, assumption,
% 0.12/0.34 t_b = X4).
% 0.12/0.34 cnf(c3, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.12/0.34 cnf(c4, plain,
% 0.12/0.34 c_lessequals(c_0,c_times(X2,X3,X4),X4) | ~c_lessequals(c_0,X3,X4) | ~class_Ring__and__Field_Opordered__cancel__semiring(X4),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.12/0.34
% 0.12/0.34 cnf(c5, axiom,
% 0.12/0.34 c_HOL_Oabs(X5,X6) = X5 | ~c_lessequals(c_0,X5,X6) | ~class_OrderedGroup_Olordered__ab__group__abs(X6)).
% 0.12/0.34 cnf(a3, assumption,
% 0.12/0.34 c_0 = c_0).
% 0.12/0.34 cnf(a4, assumption,
% 0.12/0.34 c_times(X2,X3,X4) = X5).
% 0.12/0.34 cnf(a5, assumption,
% 0.12/0.34 X4 = X6).
% 0.12/0.34 cnf(c6, plain,
% 0.12/0.34 ~c_lessequals(c_0,X3,X4) | ~class_Ring__and__Field_Opordered__cancel__semiring(X4),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.12/0.34 cnf(c7, plain,
% 0.12/0.34 c_HOL_Oabs(X5,X6) = X5 | ~class_OrderedGroup_Olordered__ab__group__abs(X6),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.12/0.34
% 0.12/0.34 cnf(c8, axiom,
% 0.12/0.34 c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b) != c_HOL_Oabs(c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b),t_b)).
% 0.12/0.34 cnf(a6, assumption,
% 0.12/0.34 c_HOL_Oabs(c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b),t_b) = c_HOL_Oabs(X5,X6)).
% 0.12/0.34 cnf(c9, plain,
% 0.12/0.34 ~class_OrderedGroup_Olordered__ab__group__abs(X6),
% 0.12/0.34 inference(strict_subterm_extension, [assumptions([a6])], [c7, c8])).
% 0.12/0.34 cnf(c10, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_subterm_extension, [assumptions([a6])], [c7, c8])).
% 0.12/0.34 cnf(c11, plain,
% 0.12/0.34 c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b) != X5,
% 0.12/0.34 inference(strict_subterm_extension, [assumptions([a6])], [c7, c8])).
% 0.12/0.34
% 0.12/0.34 cnf(a7, assumption,
% 0.12/0.34 c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b) = X5).
% 0.12/0.34 cnf(c12, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(reflexivity, [assumptions([a7])], [c11])).
% 0.12/0.34
% 0.12/0.34 cnf(c13, axiom,
% 0.12/0.34 class_OrderedGroup_Olordered__ab__group__abs(X7) | ~class_Ring__and__Field_Oordered__idom(X7)).
% 0.12/0.34 cnf(a8, assumption,
% 0.12/0.34 X6 = X7).
% 0.12/0.34 cnf(c14, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a8])], [c9, c13])).
% 0.12/0.34 cnf(c15, plain,
% 0.12/0.34 ~class_Ring__and__Field_Oordered__idom(X7),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a8])], [c9, c13])).
% 0.12/0.34
% 0.12/0.34 cnf(c16, axiom,
% 0.12/0.34 class_Ring__and__Field_Oordered__idom(t_b)).
% 0.12/0.34 cnf(a9, assumption,
% 0.12/0.34 X7 = t_b).
% 0.12/0.34 cnf(c17, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a9])], [c15, c16])).
% 0.12/0.34 cnf(c18, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a9])], [c15, c16])).
% 0.12/0.34
% 0.12/0.34 cnf(c19, axiom,
% 0.12/0.34 c_lessequals(c_0,v_h(X8),t_b)).
% 0.12/0.34 cnf(a10, assumption,
% 0.12/0.34 c_0 = c_0).
% 0.12/0.34 cnf(a11, assumption,
% 0.12/0.34 X3 = v_h(X8)).
% 0.12/0.34 cnf(a12, assumption,
% 0.12/0.34 X4 = t_b).
% 0.12/0.34 cnf(c20, plain,
% 0.12/0.34 ~class_Ring__and__Field_Opordered__cancel__semiring(X4),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a10, a11, a12])], [c6, c19])).
% 0.12/0.34 cnf(c21, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a10, a11, a12])], [c6, c19])).
% 0.12/0.34
% 0.12/0.34 cnf(c22, axiom,
% 0.12/0.34 class_Ring__and__Field_Opordered__cancel__semiring(X9) | ~class_Ring__and__Field_Oordered__idom(X9)).
% 0.12/0.34 cnf(a13, assumption,
% 0.12/0.34 X4 = X9).
% 0.12/0.34 cnf(c23, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a13])], [c20, c22])).
% 0.12/0.34 cnf(c24, plain,
% 0.12/0.34 ~class_Ring__and__Field_Oordered__idom(X9),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a13])], [c20, c22])).
% 0.12/0.34
% 0.12/0.34 cnf(c25, plain,
% 0.12/0.34 class_Ring__and__Field_Oordered__idom(X7)).
% 0.12/0.34 cnf(a14, assumption,
% 0.12/0.34 X9 = X7).
% 0.12/0.34 cnf(c26, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(predicate_reduction, [assumptions([a14])], [c24, c25])).
% 0.12/0.34
% 0.12/0.34 cnf(c27, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(constraint_solving, [
% 0.12/0.34 bind(X0, v_x),
% 0.12/0.34 bind(X1, v_xa),
% 0.12/0.34 bind(X2, v_l(X0,X1)),
% 0.12/0.34 bind(X3, v_h(v_k(v_x,v_xa))),
% 0.12/0.34 bind(X4, t_b),
% 0.12/0.34 bind(X5, c_times(X2,X3,X4)),
% 0.12/0.34 bind(X6, t_b),
% 0.12/0.34 bind(X7, t_b),
% 0.12/0.34 bind(X8, v_k(v_x,v_xa)),
% 0.12/0.34 bind(X9, t_b)
% 0.12/0.34 ],
% 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])).
% 0.12/0.34
% 0.12/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------