TSTP Solution File: ANA027-2 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : ANA027-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 : n025.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:40 EDT 2022

% Result   : Unsatisfiable 7.64s 1.36s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : ANA027-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34  % Computer : n025.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 Jul  8 07:00:59 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 7.64/1.36  % SZS status Unsatisfiable
% 7.64/1.36  % SZS output begin IncompleteProof
% 7.64/1.36  cnf(c0, axiom,
% 7.64/1.36  	class_Ring__and__Field_Oordered__idom(t_b)).
% 7.64/1.36  cnf(c1, plain,
% 7.64/1.36  	class_Ring__and__Field_Oordered__idom(t_b),
% 7.64/1.36  	inference(start, [], [c0])).
% 7.64/1.36  
% 7.64/1.36  cnf(c2, axiom,
% 7.64/1.36  	class_OrderedGroup_Ocomm__monoid__add(X0) | ~class_Ring__and__Field_Oordered__idom(X0)).
% 7.64/1.36  cnf(a0, assumption,
% 7.64/1.36  	t_b = X0).
% 7.64/1.36  cnf(c3, plain,
% 7.64/1.36  	$false,
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 7.64/1.36  cnf(c4, plain,
% 7.64/1.36  	class_OrderedGroup_Ocomm__monoid__add(X0),
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 7.64/1.36  
% 7.64/1.36  cnf(c5, axiom,
% 7.64/1.36  	c_plus(c_0,X1,X2) = X1 | ~class_OrderedGroup_Ocomm__monoid__add(X2)).
% 7.64/1.36  cnf(a1, assumption,
% 7.64/1.36  	X0 = X2).
% 7.64/1.36  cnf(c6, plain,
% 7.64/1.36  	$false,
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 7.64/1.36  cnf(c7, plain,
% 7.64/1.36  	c_plus(c_0,X1,X2) = X1,
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 7.64/1.36  
% 7.64/1.36  cnf(c8, axiom,
% 7.64/1.36  	c_lessequals(X3,c_minus(X4,X5,X6),X6) | ~c_lessequals(c_plus(X3,X5,X6),X4,X6) | ~class_OrderedGroup_Opordered__ab__group__add(X6)).
% 7.64/1.36  cnf(a2, assumption,
% 7.64/1.36  	c_plus(X3,X5,X6) = c_plus(c_0,X1,X2)).
% 7.64/1.36  cnf(c9, plain,
% 7.64/1.36  	$false,
% 7.64/1.36  	inference(strict_subterm_extension, [assumptions([a2])], [c7, c8])).
% 7.64/1.36  cnf(c10, plain,
% 7.64/1.36  	c_lessequals(X3,c_minus(X4,X5,X6),X6) | ~class_OrderedGroup_Opordered__ab__group__add(X6),
% 7.64/1.36  	inference(strict_subterm_extension, [assumptions([a2])], [c7, c8])).
% 7.64/1.36  cnf(c11, plain,
% 7.64/1.36  	~c_lessequals(X1,X4,X6),
% 7.64/1.36  	inference(strict_subterm_extension, [assumptions([a2])], [c7, c8])).
% 7.64/1.36  
% 7.64/1.36  cnf(c12, axiom,
% 7.64/1.36  	c_lessequals(X7,X8,X9) | ~c_lessequals(X7,X10,X9) | ~c_lessequals(X10,X8,X9) | ~class_Orderings_Oorder(X9)).
% 7.64/1.36  cnf(a3, assumption,
% 7.64/1.36  	X1 = X7).
% 7.64/1.36  cnf(a4, assumption,
% 7.64/1.36  	X4 = X8).
% 7.64/1.36  cnf(a5, assumption,
% 7.64/1.36  	X6 = X9).
% 7.64/1.36  cnf(c13, plain,
% 7.64/1.36  	$false,
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c11, c12])).
% 7.64/1.36  cnf(c14, plain,
% 7.64/1.36  	~c_lessequals(X7,X10,X9) | ~c_lessequals(X10,X8,X9) | ~class_Orderings_Oorder(X9),
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c11, c12])).
% 7.64/1.36  
% 7.64/1.36  cnf(c15, axiom,
% 7.64/1.36  	c_lessequals(v_g(v_x),v_k(v_x),t_b)).
% 7.64/1.36  cnf(a6, assumption,
% 7.64/1.36  	X7 = v_g(v_x)).
% 7.64/1.36  cnf(a7, assumption,
% 7.64/1.36  	X10 = v_k(v_x)).
% 7.64/1.36  cnf(a8, assumption,
% 7.64/1.36  	X9 = t_b).
% 7.64/1.36  cnf(c16, plain,
% 7.64/1.36  	~c_lessequals(X10,X8,X9) | ~class_Orderings_Oorder(X9),
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c14, c15])).
% 7.64/1.36  cnf(c17, plain,
% 7.64/1.36  	$false,
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c14, c15])).
% 7.64/1.36  
% 7.64/1.36  cnf(c18, axiom,
% 7.64/1.36  	c_lessequals(c_plus(X11,X12,X13),X14,X13) | ~c_lessequals(X11,c_minus(X14,X12,X13),X13) | ~class_OrderedGroup_Opordered__ab__group__add(X13)).
% 7.64/1.36  cnf(a9, assumption,
% 7.64/1.36  	X15 = X10).
% 7.64/1.36  cnf(a10, assumption,
% 7.64/1.36  	X16 = X8).
% 7.64/1.36  cnf(a11, assumption,
% 7.64/1.36  	X17 = X9).
% 7.64/1.36  cnf(c19, plain,
% 7.64/1.36  	~class_Orderings_Oorder(X9),
% 7.64/1.36  	inference(lazy_predicate_extension, [assumptions([a9, a10, a11])], [c16, c18])).
% 7.64/1.36  cnf(c20, plain,
% 7.64/1.36  	~c_lessequals(X11,c_minus(X14,X12,X13),X13) | ~class_OrderedGroup_Opordered__ab__group__add(X13),
% 7.64/1.36  	inference(lazy_predicate_extension, [assumptions([a9, a10, a11])], [c16, c18])).
% 7.64/1.36  cnf(c21, plain,
% 7.64/1.36  	c_plus(X11,X12,X13) != X15 | X14 != X16 | X13 != X17,
% 7.64/1.36  	inference(lazy_predicate_extension, [assumptions([a9, a10, a11])], [c16, c18])).
% 7.64/1.36  
% 7.64/1.36  cnf(c22, axiom,
% 7.64/1.36  	c_plus(c_0,X18,X19) = X18 | ~class_OrderedGroup_Ocomm__monoid__add(X19)).
% 7.64/1.36  cnf(a12, assumption,
% 7.64/1.36  	c_plus(X11,X12,X13) = c_plus(c_0,X18,X19)).
% 7.64/1.36  cnf(c23, plain,
% 7.64/1.36  	X14 != X16 | X13 != X17,
% 7.64/1.36  	inference(strict_function_extension, [assumptions([a12])], [c21, c22])).
% 7.64/1.36  cnf(c24, plain,
% 7.64/1.36  	~class_OrderedGroup_Ocomm__monoid__add(X19),
% 7.64/1.36  	inference(strict_function_extension, [assumptions([a12])], [c21, c22])).
% 7.64/1.36  cnf(c25, plain,
% 7.64/1.36  	X20 != X18 | X20 != X15,
% 7.64/1.36  	inference(strict_function_extension, [assumptions([a12])], [c21, c22])).
% 7.64/1.36  
% 7.64/1.36  cnf(a13, assumption,
% 7.64/1.36  	X20 = X18).
% 7.64/1.36  cnf(c26, plain,
% 7.64/1.36  	X20 != X15,
% 7.64/1.36  	inference(reflexivity, [assumptions([a13])], [c25])).
% 7.64/1.36  
% 7.64/1.36  cnf(a14, assumption,
% 7.64/1.36  	X20 = X15).
% 7.64/1.36  cnf(c27, plain,
% 7.64/1.36  	$false,
% 7.64/1.36  	inference(reflexivity, [assumptions([a14])], [c26])).
% 7.64/1.36  
% 7.64/1.36  cnf(c28, plain,
% 7.64/1.36  	class_OrderedGroup_Ocomm__monoid__add(X0)).
% 7.64/1.36  cnf(a15, assumption,
% 7.64/1.36  	X19 = X0).
% 7.64/1.36  cnf(c29, plain,
% 7.64/1.36  	$false,
% 7.64/1.36  	inference(predicate_reduction, [assumptions([a15])], [c24, c28])).
% 7.64/1.36  
% 7.64/1.36  cnf(a16, assumption,
% 7.64/1.36  	X14 = X16).
% 7.64/1.36  cnf(c30, plain,
% 7.64/1.36  	X13 != X17,
% 7.64/1.36  	inference(reflexivity, [assumptions([a16])], [c23])).
% 7.64/1.36  
% 7.64/1.36  cnf(a17, assumption,
% 7.64/1.36  	X13 = X17).
% 7.64/1.36  cnf(c31, plain,
% 7.64/1.36  	$false,
% 7.64/1.36  	inference(reflexivity, [assumptions([a17])], [c30])).
% 7.64/1.36  
% 7.64/1.36  cnf(c32, axiom,
% 7.64/1.36  	c_lessequals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b)).
% 7.64/1.36  cnf(a18, assumption,
% 7.64/1.36  	X11 = c_0).
% 7.64/1.36  cnf(a19, assumption,
% 7.64/1.36  	c_minus(X14,X12,X13) = c_minus(v_f(v_x),v_k(v_x),t_b)).
% 7.64/1.36  cnf(a20, assumption,
% 7.64/1.36  	X13 = t_b).
% 7.64/1.36  cnf(c33, plain,
% 7.64/1.36  	~class_OrderedGroup_Opordered__ab__group__add(X13),
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a18, a19, a20])], [c20, c32])).
% 7.64/1.36  cnf(c34, plain,
% 7.64/1.36  	$false,
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a18, a19, a20])], [c20, c32])).
% 7.64/1.36  
% 7.64/1.36  cnf(c35, axiom,
% 7.64/1.36  	class_OrderedGroup_Opordered__ab__group__add(X21) | ~class_OrderedGroup_Olordered__ab__group__abs(X21)).
% 7.64/1.36  cnf(a21, assumption,
% 7.64/1.36  	X13 = X21).
% 7.64/1.36  cnf(c36, plain,
% 7.64/1.36  	$false,
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a21])], [c33, c35])).
% 7.64/1.36  cnf(c37, plain,
% 7.64/1.36  	~class_OrderedGroup_Olordered__ab__group__abs(X21),
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a21])], [c33, c35])).
% 7.64/1.36  
% 7.64/1.36  cnf(c38, axiom,
% 7.64/1.36  	class_OrderedGroup_Olordered__ab__group__abs(X22) | ~class_Ring__and__Field_Oordered__idom(X22)).
% 7.64/1.36  cnf(a22, assumption,
% 7.64/1.36  	X21 = X22).
% 7.64/1.36  cnf(c39, plain,
% 7.64/1.36  	$false,
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a22])], [c37, c38])).
% 7.64/1.36  cnf(c40, plain,
% 7.64/1.36  	~class_Ring__and__Field_Oordered__idom(X22),
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a22])], [c37, c38])).
% 7.64/1.36  
% 7.64/1.36  cnf(c41, plain,
% 7.64/1.36  	class_Ring__and__Field_Oordered__idom(t_b)).
% 7.64/1.36  cnf(a23, assumption,
% 7.64/1.36  	X22 = t_b).
% 7.64/1.36  cnf(c42, plain,
% 7.64/1.36  	$false,
% 7.64/1.36  	inference(predicate_reduction, [assumptions([a23])], [c40, c41])).
% 7.64/1.36  
% 7.64/1.36  cnf(c43, axiom,
% 7.64/1.36  	class_Orderings_Oorder(X23) | ~class_LOrder_Ojoin__semilorder(X23)).
% 7.64/1.36  cnf(a24, assumption,
% 7.64/1.36  	X9 = X23).
% 7.64/1.36  cnf(c44, plain,
% 7.64/1.36  	$false,
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a24])], [c19, c43])).
% 7.64/1.36  cnf(c45, plain,
% 7.64/1.36  	~class_LOrder_Ojoin__semilorder(X23),
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a24])], [c19, c43])).
% 7.64/1.36  
% 7.64/1.36  cnf(c46, axiom,
% 7.64/1.36  	class_LOrder_Ojoin__semilorder(X24) | ~class_OrderedGroup_Olordered__ab__group__abs(X24)).
% 7.64/1.36  cnf(a25, assumption,
% 7.64/1.36  	X23 = X24).
% 7.64/1.36  cnf(c47, plain,
% 7.64/1.36  	$false,
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a25])], [c45, c46])).
% 7.64/1.36  cnf(c48, plain,
% 7.64/1.36  	~class_OrderedGroup_Olordered__ab__group__abs(X24),
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a25])], [c45, c46])).
% 7.64/1.36  
% 7.64/1.36  cnf(c49, plain,
% 7.64/1.36  	class_OrderedGroup_Olordered__ab__group__abs(X21)).
% 7.64/1.36  cnf(a26, assumption,
% 7.64/1.36  	X24 = X21).
% 7.64/1.36  cnf(c50, plain,
% 7.64/1.36  	$false,
% 7.64/1.36  	inference(predicate_reduction, [assumptions([a26])], [c48, c49])).
% 7.64/1.36  
% 7.64/1.36  cnf(c51, axiom,
% 7.64/1.36  	~c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b)).
% 7.64/1.36  cnf(a27, assumption,
% 7.64/1.36  	X3 = c_0).
% 7.64/1.36  cnf(a28, assumption,
% 7.64/1.36  	c_minus(X4,X5,X6) = c_minus(v_f(v_x),v_g(v_x),t_b)).
% 7.64/1.36  cnf(a29, assumption,
% 7.64/1.36  	X6 = t_b).
% 7.64/1.36  cnf(c52, plain,
% 7.64/1.36  	~class_OrderedGroup_Opordered__ab__group__add(X6),
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a27, a28, a29])], [c10, c51])).
% 7.64/1.36  cnf(c53, plain,
% 7.64/1.36  	$false,
% 7.64/1.36  	inference(strict_predicate_extension, [assumptions([a27, a28, a29])], [c10, c51])).
% 7.64/1.36  
% 7.64/1.36  cnf(c54, plain,
% 7.64/1.36  	class_OrderedGroup_Opordered__ab__group__add(X13)).
% 7.64/1.36  cnf(a30, assumption,
% 7.64/1.36  	X6 = X13).
% 7.64/1.36  cnf(c55, plain,
% 7.64/1.36  	$false,
% 7.64/1.36  	inference(predicate_reduction, [assumptions([a30])], [c52, c54])).
% 7.64/1.36  
% 7.64/1.36  cnf(c56, plain,
% 7.64/1.36  	$false,
% 7.64/1.36  	inference(constraint_solving, [
% 7.64/1.36  		bind(X0, t_b),
% 7.64/1.36  		bind(X1, v_g(v_x)),
% 7.64/1.36  		bind(X2, t_b),
% 7.64/1.36  		bind(X3, c_0),
% 7.64/1.36  		bind(X4, v_f(v_x)),
% 7.64/1.36  		bind(X5, v_g(v_x)),
% 7.64/1.36  		bind(X6, t_b),
% 7.64/1.36  		bind(X7, v_g(v_x)),
% 7.64/1.36  		bind(X8, v_f(v_x)),
% 7.64/1.36  		bind(X9, t_b),
% 7.64/1.36  		bind(X10, v_k(v_x)),
% 7.64/1.36  		bind(X11, c_0),
% 7.64/1.36  		bind(X12, v_k(v_x)),
% 7.64/1.36  		bind(X13, t_b),
% 7.64/1.36  		bind(X14, v_f(v_x)),
% 7.64/1.36  		bind(X15, v_k(v_x)),
% 7.64/1.36  		bind(X16, v_f(v_x)),
% 7.64/1.36  		bind(X17, t_b),
% 7.64/1.36  		bind(X18, v_k(v_x)),
% 7.64/1.36  		bind(X19, t_b),
% 7.64/1.36  		bind(X20, v_k(v_x)),
% 7.64/1.36  		bind(X21, t_b),
% 7.64/1.36  		bind(X22, t_b),
% 7.64/1.36  		bind(X23, t_b),
% 7.64/1.36  		bind(X24, t_b)
% 7.64/1.36  	],
% 7.64/1.36  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28, a29, a30])).
% 7.64/1.36  
% 7.64/1.36  % SZS output end IncompleteProof
%------------------------------------------------------------------------------