TSTP Solution File: ANA024-2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : ANA024-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 : n024.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:38 EDT 2022
% Result : Unsatisfiable 0.12s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ANA024-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n024.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:02:44 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 class_Ring__and__Field_Oordered__idom(t_b)).
% 0.12/0.34 cnf(c1, plain,
% 0.12/0.34 class_Ring__and__Field_Oordered__idom(t_b),
% 0.12/0.34 inference(start, [], [c0])).
% 0.12/0.34
% 0.12/0.34 cnf(c2, axiom,
% 0.12/0.34 class_OrderedGroup_Opordered__ab__group__add(X0) | ~class_Ring__and__Field_Oordered__idom(X0)).
% 0.12/0.34 cnf(a0, assumption,
% 0.12/0.34 t_b = X0).
% 0.12/0.34 cnf(c3, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.34 cnf(c4, plain,
% 0.12/0.34 class_OrderedGroup_Opordered__ab__group__add(X0),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.34
% 0.12/0.34 cnf(c5, axiom,
% 0.12/0.34 class_OrderedGroup_Oab__group__add(X1) | ~class_OrderedGroup_Opordered__ab__group__add(X1)).
% 0.12/0.34 cnf(a1, assumption,
% 0.12/0.34 X0 = X1).
% 0.12/0.34 cnf(c6, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.12/0.34 cnf(c7, plain,
% 0.12/0.34 class_OrderedGroup_Oab__group__add(X1),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.12/0.34
% 0.12/0.34 cnf(c8, axiom,
% 0.12/0.34 c_plus(c_minus(X2,X3,X4),X3,X4) = X2 | ~class_OrderedGroup_Oab__group__add(X4)).
% 0.12/0.34 cnf(a2, assumption,
% 0.12/0.34 X1 = X4).
% 0.12/0.34 cnf(c9, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.12/0.34 cnf(c10, plain,
% 0.12/0.34 c_plus(c_minus(X2,X3,X4),X3,X4) = X2,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.12/0.34
% 0.12/0.34 cnf(c11, axiom,
% 0.12/0.34 c_lessequals(X5,c_minus(X6,X7,X8),X8) | ~c_lessequals(c_plus(X5,X7,X8),X6,X8) | ~class_OrderedGroup_Opordered__ab__group__add(X8)).
% 0.12/0.34 cnf(a3, assumption,
% 0.12/0.34 c_plus(X5,X7,X8) = c_plus(c_minus(X2,X3,X4),X3,X4)).
% 0.12/0.34 cnf(c12, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_subterm_extension, [assumptions([a3])], [c10, c11])).
% 0.12/0.34 cnf(c13, plain,
% 0.12/0.34 c_lessequals(X5,c_minus(X6,X7,X8),X8) | ~class_OrderedGroup_Opordered__ab__group__add(X8),
% 0.12/0.34 inference(strict_subterm_extension, [assumptions([a3])], [c10, c11])).
% 0.12/0.34 cnf(c14, plain,
% 0.12/0.34 ~c_lessequals(X2,X6,X8),
% 0.12/0.34 inference(strict_subterm_extension, [assumptions([a3])], [c10, c11])).
% 0.12/0.34
% 0.12/0.34 cnf(c15, axiom,
% 0.12/0.34 c_lessequals(v_k(X9),v_f(X9),t_b)).
% 0.12/0.34 cnf(a4, assumption,
% 0.12/0.34 X2 = v_k(X9)).
% 0.12/0.34 cnf(a5, assumption,
% 0.12/0.34 X6 = v_f(X9)).
% 0.12/0.34 cnf(a6, assumption,
% 0.12/0.34 X8 = t_b).
% 0.12/0.34 cnf(c16, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c14, c15])).
% 0.12/0.34 cnf(c17, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c14, c15])).
% 0.12/0.34
% 0.12/0.34 cnf(c18, axiom,
% 0.12/0.34 ~c_lessequals(c_minus(v_k(v_x),v_g(v_x),t_b),c_minus(v_f(v_x),v_g(v_x),t_b),t_b)).
% 0.12/0.34 cnf(a7, assumption,
% 0.12/0.34 X5 = c_minus(v_k(v_x),v_g(v_x),t_b)).
% 0.12/0.34 cnf(a8, assumption,
% 0.12/0.34 c_minus(X6,X7,X8) = c_minus(v_f(v_x),v_g(v_x),t_b)).
% 0.12/0.34 cnf(a9, assumption,
% 0.12/0.34 X8 = t_b).
% 0.12/0.34 cnf(c19, plain,
% 0.12/0.34 ~class_OrderedGroup_Opordered__ab__group__add(X8),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c13, c18])).
% 0.12/0.34 cnf(c20, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c13, c18])).
% 0.12/0.34
% 0.12/0.34 cnf(c21, plain,
% 0.12/0.34 class_OrderedGroup_Opordered__ab__group__add(X0)).
% 0.12/0.34 cnf(a10, assumption,
% 0.12/0.34 X8 = X0).
% 0.12/0.34 cnf(c22, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(predicate_reduction, [assumptions([a10])], [c19, c21])).
% 0.12/0.34
% 0.12/0.34 cnf(c23, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(constraint_solving, [
% 0.12/0.34 bind(X0, t_b),
% 0.12/0.34 bind(X1, t_b),
% 0.12/0.34 bind(X2, v_k(X9)),
% 0.12/0.34 bind(X3, v_g(v_x)),
% 0.12/0.34 bind(X4, t_b),
% 0.12/0.34 bind(X5, c_minus(X2,X3,X4)),
% 0.12/0.34 bind(X6, v_f(X9)),
% 0.12/0.34 bind(X7, v_g(v_x)),
% 0.12/0.34 bind(X8, t_b),
% 0.12/0.34 bind(X9, v_x)
% 0.12/0.34 ],
% 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 0.12/0.34
% 0.12/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------