%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : ANA023-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n026.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:04:02 EDT 2022
% Result : Unsatisfiable 1.12s 1.32s
% Output : CNFRefutation 1.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 22
% Syntax : Number of formulae : 101 ( 25 unt; 0 def)
% Number of atoms : 225 ( 7 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 254 ( 130 ~; 124 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 170 ( 0 sgn 54 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X3,X4,X5,X2] :
( ~ class_OrderedGroup_Opordered__ab__group__add(X2)
| ~ c_lessequals(c_plus(X5,X4,X2),X3,X2)
| c_lessequals(X5,c_minus(X3,X4,X2),X2) ),
file('<stdin>',cls_OrderedGroup_Ocompare__rls__9_1) ).
fof(c_0_1,axiom,
! [X3,X4,X5,X2] :
( ~ class_OrderedGroup_Opordered__ab__group__add(X2)
| ~ c_lessequals(X5,c_minus(X3,X4,X2),X2)
| c_lessequals(c_plus(X5,X4,X2),X3,X2) ),
file('<stdin>',cls_OrderedGroup_Ocompare__rls__9_0) ).
fof(c_0_2,axiom,
! [X6,X1,X7,X2] :
( ~ class_Orderings_Oorder(X2)
| ~ c_lessequals(X1,X6,X2)
| ~ c_lessequals(X7,X1,X2)
| c_lessequals(X7,X6,X2) ),
file('<stdin>',cls_Orderings_Oorder__class_Oorder__trans_0) ).
fof(c_0_3,axiom,
! [X1,X2] :
( ~ class_OrderedGroup_Ocomm__monoid__add(X2)
| c_plus(c_0,X1,X2) = X1 ),
file('<stdin>',cls_OrderedGroup_Ocomm__monoid__add__class_Oaxioms_0) ).
fof(c_0_4,axiom,
! [X8] :
( ~ class_Ring__and__Field_Oordered__idom(X8)
| class_OrderedGroup_Opordered__ab__group__add(X8) ),
file('<stdin>',clsrel_Ring__and__Field_Oordered__idom_54) ).
fof(c_0_5,axiom,
! [X8] :
( ~ class_Ring__and__Field_Oordered__idom(X8)
| class_Orderings_Olinorder(X8) ),
file('<stdin>',clsrel_Ring__and__Field_Oordered__idom_33) ).
fof(c_0_6,axiom,
! [X8] :
( ~ class_Ring__and__Field_Oordered__idom(X8)
| class_OrderedGroup_Ocomm__monoid__add(X8) ),
file('<stdin>',clsrel_Ring__and__Field_Oordered__idom_23) ).
fof(c_0_7,axiom,
! [X8] :
( ~ class_Orderings_Olinorder(X8)
| class_Orderings_Oorder(X8) ),
file('<stdin>',clsrel_Orderings_Olinorder_4) ).
fof(c_0_8,plain,
! [X3,X4,X5,X2] :
( ~ class_OrderedGroup_Opordered__ab__group__add(X2)
| ~ c_lessequals(c_plus(X5,X4,X2),X3,X2)
| c_lessequals(X5,c_minus(X3,X4,X2),X2) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_9,plain,
! [X3,X4,X5,X2] :
( ~ class_OrderedGroup_Opordered__ab__group__add(X2)
| ~ c_lessequals(X5,c_minus(X3,X4,X2),X2)
| c_lessequals(c_plus(X5,X4,X2),X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_10,plain,
! [X6,X1,X7,X2] :
( ~ class_Orderings_Oorder(X2)
| ~ c_lessequals(X1,X6,X2)
| ~ c_lessequals(X7,X1,X2)
| c_lessequals(X7,X6,X2) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_11,plain,
! [X1,X2] :
( ~ class_OrderedGroup_Ocomm__monoid__add(X2)
| c_plus(c_0,X1,X2) = X1 ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_12,plain,
! [X8] :
( ~ class_Ring__and__Field_Oordered__idom(X8)
| class_OrderedGroup_Opordered__ab__group__add(X8) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_13,plain,
! [X8] :
( ~ class_Ring__and__Field_Oordered__idom(X8)
| class_Orderings_Olinorder(X8) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_14,plain,
! [X8] :
( ~ class_Ring__and__Field_Oordered__idom(X8)
| class_OrderedGroup_Ocomm__monoid__add(X8) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_15,plain,
! [X8] :
( ~ class_Orderings_Olinorder(X8)
| class_Orderings_Oorder(X8) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_16,plain,
! [X6,X7,X8,X9] :
( ~ class_OrderedGroup_Opordered__ab__group__add(X9)
| ~ c_lessequals(c_plus(X8,X7,X9),X6,X9)
| c_lessequals(X8,c_minus(X6,X7,X9),X9) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_17,plain,
! [X6,X7,X8,X9] :
( ~ class_OrderedGroup_Opordered__ab__group__add(X9)
| ~ c_lessequals(X8,c_minus(X6,X7,X9),X9)
| c_lessequals(c_plus(X8,X7,X9),X6,X9) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_18,plain,
! [X8,X9,X10,X11] :
( ~ class_Orderings_Oorder(X11)
| ~ c_lessequals(X9,X8,X11)
| ~ c_lessequals(X10,X9,X11)
| c_lessequals(X10,X8,X11) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_19,plain,
! [X3,X4] :
( ~ class_OrderedGroup_Ocomm__monoid__add(X4)
| c_plus(c_0,X3,X4) = X3 ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_20,plain,
! [X9] :
( ~ class_Ring__and__Field_Oordered__idom(X9)
| class_OrderedGroup_Opordered__ab__group__add(X9) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_21,plain,
! [X9] :
( ~ class_Ring__and__Field_Oordered__idom(X9)
| class_Orderings_Olinorder(X9) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_22,plain,
! [X9] :
( ~ class_Ring__and__Field_Oordered__idom(X9)
| class_OrderedGroup_Ocomm__monoid__add(X9) ),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_23,plain,
! [X9] :
( ~ class_Orderings_Olinorder(X9)
| class_Orderings_Oorder(X9) ),
inference(variable_rename,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
( c_lessequals(X1,c_minus(X2,X3,X4),X4)
| ~ c_lessequals(c_plus(X1,X3,X4),X2,X4)
| ~ class_OrderedGroup_Opordered__ab__group__add(X4) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
( c_lessequals(c_plus(X1,X2,X3),X4,X3)
| ~ c_lessequals(X1,c_minus(X4,X2,X3),X3)
| ~ class_OrderedGroup_Opordered__ab__group__add(X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( c_lessequals(X1,X2,X3)
| ~ c_lessequals(X1,X4,X3)
| ~ c_lessequals(X4,X2,X3)
| ~ class_Orderings_Oorder(X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( c_plus(c_0,X1,X2) = X1
| ~ class_OrderedGroup_Ocomm__monoid__add(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,plain,
( class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
( class_OrderedGroup_Ocomm__monoid__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
( class_Orderings_Oorder(X1)
| ~ class_Orderings_Olinorder(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( c_lessequals(X1,c_minus(X2,X3,X4),X4)
| ~ c_lessequals(c_plus(X1,X3,X4),X2,X4)
| ~ class_OrderedGroup_Opordered__ab__group__add(X4) ),
c_0_24,
[final] ).
cnf(c_0_33,plain,
( c_lessequals(c_plus(X1,X2,X3),X4,X3)
| ~ c_lessequals(X1,c_minus(X4,X2,X3),X3)
| ~ class_OrderedGroup_Opordered__ab__group__add(X3) ),
c_0_25,
[final] ).
cnf(c_0_34,plain,
( c_lessequals(X1,X2,X3)
| ~ c_lessequals(X1,X4,X3)
| ~ c_lessequals(X4,X2,X3)
| ~ class_Orderings_Oorder(X3) ),
c_0_26,
[final] ).
cnf(c_0_35,plain,
( c_plus(c_0,X1,X2) = X1
| ~ class_OrderedGroup_Ocomm__monoid__add(X2) ),
c_0_27,
[final] ).
cnf(c_0_36,plain,
( class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
c_0_28,
[final] ).
cnf(c_0_37,plain,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
c_0_29,
[final] ).
cnf(c_0_38,plain,
( class_OrderedGroup_Ocomm__monoid__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
c_0_30,
[final] ).
cnf(c_0_39,plain,
( class_Orderings_Oorder(X1)
| ~ class_Orderings_Olinorder(X1) ),
c_0_31,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_32_0,axiom,
( c_lessequals(X1,c_minus(X2,X3,X4),X4)
| ~ c_lessequals(c_plus(X1,X3,X4),X2,X4)
| ~ class_OrderedGroup_Opordered__ab__group__add(X4) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_32_1,axiom,
( ~ c_lessequals(c_plus(X1,X3,X4),X2,X4)
| c_lessequals(X1,c_minus(X2,X3,X4),X4)
| ~ class_OrderedGroup_Opordered__ab__group__add(X4) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_32_2,axiom,
( ~ class_OrderedGroup_Opordered__ab__group__add(X4)
| ~ c_lessequals(c_plus(X1,X3,X4),X2,X4)
| c_lessequals(X1,c_minus(X2,X3,X4),X4) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_33_0,axiom,
( c_lessequals(c_plus(X1,X2,X3),X4,X3)
| ~ c_lessequals(X1,c_minus(X4,X2,X3),X3)
| ~ class_OrderedGroup_Opordered__ab__group__add(X3) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_33_1,axiom,
( ~ c_lessequals(X1,c_minus(X4,X2,X3),X3)
| c_lessequals(c_plus(X1,X2,X3),X4,X3)
| ~ class_OrderedGroup_Opordered__ab__group__add(X3) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_33_2,axiom,
( ~ class_OrderedGroup_Opordered__ab__group__add(X3)
| ~ c_lessequals(X1,c_minus(X4,X2,X3),X3)
| c_lessequals(c_plus(X1,X2,X3),X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_34_0,axiom,
( c_lessequals(X1,X2,X3)
| ~ c_lessequals(X1,X4,X3)
| ~ c_lessequals(X4,X2,X3)
| ~ class_Orderings_Oorder(X3) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_34_1,axiom,
( ~ c_lessequals(X1,X4,X3)
| c_lessequals(X1,X2,X3)
| ~ c_lessequals(X4,X2,X3)
| ~ class_Orderings_Oorder(X3) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_34_2,axiom,
( ~ c_lessequals(X4,X2,X3)
| ~ c_lessequals(X1,X4,X3)
| c_lessequals(X1,X2,X3)
| ~ class_Orderings_Oorder(X3) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_34_3,axiom,
( ~ class_Orderings_Oorder(X3)
| ~ c_lessequals(X4,X2,X3)
| ~ c_lessequals(X1,X4,X3)
| c_lessequals(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_35_0,axiom,
( c_plus(c_0,X1,X2) = X1
| ~ class_OrderedGroup_Ocomm__monoid__add(X2) ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_35_1,axiom,
( ~ class_OrderedGroup_Ocomm__monoid__add(X2)
| c_plus(c_0,X1,X2) = X1 ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_36_0,axiom,
( class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_36_1,axiom,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_OrderedGroup_Opordered__ab__group__add(X1) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_37_0,axiom,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_37_1,axiom,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_Orderings_Olinorder(X1) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_38_0,axiom,
( class_OrderedGroup_Ocomm__monoid__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_38_1,axiom,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_OrderedGroup_Ocomm__monoid__add(X1) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_39_0,axiom,
( class_Orderings_Oorder(X1)
| ~ class_Orderings_Olinorder(X1) ),
inference(literals_permutation,[status(thm)],[c_0_39]) ).
cnf(c_0_39_1,axiom,
( ~ class_Orderings_Olinorder(X1)
| class_Orderings_Oorder(X1) ),
inference(literals_permutation,[status(thm)],[c_0_39]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
file('<stdin>',cls_conjecture_3) ).
fof(c_0_1_002,negated_conjecture,
c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b),
file('<stdin>',cls_conjecture_1) ).
fof(c_0_2_003,negated_conjecture,
c_lessequals(v_k(v_x),v_f(v_x),t_b),
file('<stdin>',cls_conjecture_2) ).
fof(c_0_3_004,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
file('<stdin>',tfree_tcs) ).
fof(c_0_4_005,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_5_006,negated_conjecture,
c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b),
c_0_1 ).
fof(c_0_6_007,negated_conjecture,
c_lessequals(v_k(v_x),v_f(v_x),t_b),
c_0_2 ).
fof(c_0_7_008,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
c_0_3 ).
fof(c_0_8_009,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
c_0_4 ).
fof(c_0_9_010,negated_conjecture,
c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b),
c_0_5 ).
fof(c_0_10_011,negated_conjecture,
c_lessequals(v_k(v_x),v_f(v_x),t_b),
c_0_6 ).
fof(c_0_11_012,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
c_0_7 ).
cnf(c_0_12_013,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13_014,negated_conjecture,
c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14_015,negated_conjecture,
c_lessequals(v_k(v_x),v_f(v_x),t_b),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15_016,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16_017,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
c_0_12,
[final] ).
cnf(c_0_17_018,negated_conjecture,
c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b),
c_0_13,
[final] ).
cnf(c_0_18_019,negated_conjecture,
c_lessequals(v_k(v_x),v_f(v_x),t_b),
c_0_14,
[final] ).
cnf(c_0_19_020,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
c_0_15,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_17,plain,
( c_lessequals(X0,c_minus(X1,X2,X3),X3)
| ~ c_lessequals(c_plus(X0,X2,X3),X1,X3)
| ~ class_OrderedGroup_Opordered__ab__group__add(X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p',c_0_32_2) ).
cnf(c_76,plain,
( c_lessequals(X0,c_minus(X1,X2,X3),X3)
| ~ c_lessequals(c_plus(X0,X2,X3),X1,X3)
| ~ class_OrderedGroup_Opordered__ab__group__add(X3) ),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_18866,plain,
( ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
| c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b)
| ~ c_lessequals(c_plus(c_0,v_g(v_x),t_b),v_f(v_x),t_b) ),
inference(instantiation,[status(thm)],[c_76]) ).
cnf(c_12,plain,
( ~ class_Orderings_Oorder(X0)
| ~ c_lessequals(X1,X2,X0)
| c_lessequals(X3,X2,X0)
| ~ c_lessequals(X3,X1,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p',c_0_34_1) ).
cnf(c_71,plain,
( ~ class_Orderings_Oorder(X0)
| ~ c_lessequals(X1,X2,X0)
| c_lessequals(X3,X2,X0)
| ~ c_lessequals(X3,X1,X0) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_18843,plain,
( ~ class_Orderings_Oorder(t_b)
| ~ c_lessequals(v_k(v_x),v_f(v_x),t_b)
| c_lessequals(X0,v_f(v_x),t_b)
| ~ c_lessequals(X0,v_k(v_x),t_b) ),
inference(instantiation,[status(thm)],[c_71]) ).
cnf(c_18859,plain,
( ~ class_Orderings_Oorder(t_b)
| c_lessequals(c_plus(c_0,v_g(v_x),t_b),v_f(v_x),t_b)
| ~ c_lessequals(c_plus(c_0,v_g(v_x),t_b),v_k(v_x),t_b)
| ~ c_lessequals(v_k(v_x),v_f(v_x),t_b) ),
inference(instantiation,[status(thm)],[c_18843]) ).
cnf(c_14,plain,
( c_lessequals(c_plus(X0,X1,X2),X3,X2)
| ~ c_lessequals(X0,c_minus(X3,X1,X2),X2)
| ~ class_OrderedGroup_Opordered__ab__group__add(X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p',c_0_33_2) ).
cnf(c_73,plain,
( c_lessequals(c_plus(X0,X1,X2),X3,X2)
| ~ c_lessequals(X0,c_minus(X3,X1,X2),X2)
| ~ class_OrderedGroup_Opordered__ab__group__add(X2) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_18847,plain,
( ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
| ~ c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b)
| c_lessequals(c_plus(c_0,v_g(v_x),t_b),v_k(v_x),t_b) ),
inference(instantiation,[status(thm)],[c_73]) ).
cnf(c_1,plain,
( ~ class_Orderings_Olinorder(X0)
| class_Orderings_Oorder(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p',c_0_39_0) ).
cnf(c_30,plain,
( ~ class_Orderings_Olinorder(t_b)
| class_Orderings_Oorder(t_b) ),
inference(instantiation,[status(thm)],[c_1]) ).
cnf(c_5,plain,
( ~ class_Ring__and__Field_Oordered__idom(X0)
| class_Orderings_Olinorder(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p',c_0_37_0) ).
cnf(c_28,plain,
( class_Orderings_Olinorder(t_b)
| ~ class_Ring__and__Field_Oordered__idom(t_b) ),
inference(instantiation,[status(thm)],[c_5]) ).
cnf(c_7,plain,
( ~ class_Ring__and__Field_Oordered__idom(X0)
| class_OrderedGroup_Opordered__ab__group__add(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p',c_0_36_0) ).
cnf(c_27,plain,
( ~ class_Ring__and__Field_Oordered__idom(t_b)
| class_OrderedGroup_Opordered__ab__group__add(t_b) ),
inference(instantiation,[status(thm)],[c_7]) ).
cnf(c_20,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p',c_0_16) ).
cnf(c_21,negated_conjecture,
c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b),
file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p',c_0_17) ).
cnf(c_22,negated_conjecture,
c_lessequals(v_k(v_x),v_f(v_x),t_b),
file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p',c_0_18) ).
cnf(c_23,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p',c_0_19) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_18866,c_18859,c_18847,c_30,c_28,c_27,c_20,c_21,c_22,c_23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ANA023-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 8 05:24:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Running in mono-core mode
% 0.21/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.40 % Orientation found
% 0.21/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_208a8a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_d650c7 | grep -v "SZS"
% 0.21/0.43
% 0.21/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % ------ iProver source info
% 0.21/0.43
% 0.21/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.43 % git: non_committed_changes: true
% 0.21/0.43 % git: last_make_outside_of_git: true
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % ------ Input Options
% 0.21/0.43
% 0.21/0.43 % --out_options all
% 0.21/0.43 % --tptp_safe_out true
% 0.21/0.43 % --problem_path ""
% 0.21/0.43 % --include_path ""
% 0.21/0.43 % --clausifier .//eprover
% 0.21/0.43 % --clausifier_options --tstp-format
% 0.21/0.43 % --stdin false
% 0.21/0.43 % --dbg_backtrace false
% 0.21/0.43 % --dbg_dump_prop_clauses false
% 0.21/0.43 % --dbg_dump_prop_clauses_file -
% 0.21/0.43 % --dbg_out_stat false
% 0.21/0.43
% 0.21/0.43 % ------ General Options
% 0.21/0.43
% 0.21/0.43 % --fof false
% 0.21/0.43 % --time_out_real 150.
% 0.21/0.43 % --time_out_prep_mult 0.2
% 0.21/0.43 % --time_out_virtual -1.
% 0.21/0.43 % --schedule none
% 0.21/0.43 % --ground_splitting input
% 0.21/0.43 % --splitting_nvd 16
% 0.21/0.43 % --non_eq_to_eq false
% 0.21/0.43 % --prep_gs_sim true
% 0.21/0.43 % --prep_unflatten false
% 0.21/0.43 % --prep_res_sim true
% 0.21/0.43 % --prep_upred true
% 0.21/0.43 % --res_sim_input true
% 0.21/0.43 % --clause_weak_htbl true
% 0.21/0.43 % --gc_record_bc_elim false
% 0.21/0.43 % --symbol_type_check false
% 0.21/0.43 % --clausify_out false
% 0.21/0.43 % --large_theory_mode false
% 0.21/0.43 % --prep_sem_filter none
% 0.21/0.43 % --prep_sem_filter_out false
% 0.21/0.43 % --preprocessed_out false
% 0.21/0.43 % --sub_typing false
% 0.21/0.43 % --brand_transform false
% 0.21/0.43 % --pure_diseq_elim true
% 0.21/0.43 % --min_unsat_core false
% 0.21/0.43 % --pred_elim true
% 0.21/0.43 % --add_important_lit false
% 0.21/0.43 % --soft_assumptions false
% 0.21/0.43 % --reset_solvers false
% 0.21/0.43 % --bc_imp_inh []
% 0.21/0.43 % --conj_cone_tolerance 1.5
% 0.21/0.43 % --prolific_symb_bound 500
% 0.21/0.43 % --lt_threshold 2000
% 0.21/0.43
% 0.21/0.43 % ------ SAT Options
% 0.21/0.43
% 0.21/0.43 % --sat_mode false
% 0.21/0.43 % --sat_fm_restart_options ""
% 0.21/0.43 % --sat_gr_def false
% 0.21/0.43 % --sat_epr_types true
% 0.21/0.43 % --sat_non_cyclic_types false
% 0.21/0.43 % --sat_finite_models false
% 0.21/0.43 % --sat_fm_lemmas false
% 0.21/0.43 % --sat_fm_prep false
% 0.21/0.43 % --sat_fm_uc_incr true
% 0.21/0.43 % --sat_out_model small
% 0.21/0.43 % --sat_out_clauses false
% 0.21/0.43
% 0.21/0.43 % ------ QBF Options
% 0.21/0.43
% 0.21/0.43 % --qbf_mode false
% 0.21/0.43 % --qbf_elim_univ true
% 0.21/0.43 % --qbf_sk_in true
% 0.21/0.43 % --qbf_pred_elim true
% 0.21/0.43 % --qbf_split 32
% 0.21/0.43
% 0.21/0.43 % ------ BMC1 Options
% 0.21/0.43
% 0.21/0.43 % --bmc1_incremental false
% 0.21/0.43 % --bmc1_axioms reachable_all
% 0.21/0.43 % --bmc1_min_bound 0
% 0.21/0.43 % --bmc1_max_bound -1
% 0.21/0.43 % --bmc1_max_bound_default -1
% 0.21/0.43 % --bmc1_symbol_reachability true
% 0.21/0.43 % --bmc1_property_lemmas false
% 0.21/0.43 % --bmc1_k_induction false
% 0.21/0.43 % --bmc1_non_equiv_states false
% 0.21/0.43 % --bmc1_deadlock false
% 0.21/0.43 % --bmc1_ucm false
% 0.21/0.43 % --bmc1_add_unsat_core none
% 0.21/0.43 % --bmc1_unsat_core_children false
% 0.21/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.43 % --bmc1_out_stat full
% 0.21/0.43 % --bmc1_ground_init false
% 0.21/0.43 % --bmc1_pre_inst_next_state false
% 0.21/0.43 % --bmc1_pre_inst_state false
% 0.21/0.43 % --bmc1_pre_inst_reach_state false
% 0.21/0.43 % --bmc1_out_unsat_core false
% 0.21/0.43 % --bmc1_aig_witness_out false
% 0.21/0.43 % --bmc1_verbose false
% 0.21/0.43 % --bmc1_dump_clauses_tptp false
% 0.21/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.43 % --bmc1_dump_file -
% 0.21/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.43 % --bmc1_ucm_extend_mode 1
% 0.21/0.43 % --bmc1_ucm_init_mode 2
% 0.21/0.43 % --bmc1_ucm_cone_mode none
% 0.21/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.43 % --bmc1_ucm_relax_model 4
% 0.21/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.43 % --bmc1_ucm_layered_model none
% 0.21/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.43
% 0.21/0.43 % ------ AIG Options
% 0.21/0.43
% 0.21/0.43 % --aig_mode false
% 0.21/0.43
% 0.21/0.43 % ------ Instantiation Options
% 0.21/0.43
% 0.21/0.43 % --instantiation_flag true
% 0.21/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.43 % --inst_solver_per_active 750
% 0.21/0.43 % --inst_solver_calls_frac 0.5
% 0.21/0.43 % --inst_passive_queue_type priority_queues
% 0.21/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.43 % --inst_passive_queues_freq [25;2]
% 0.21/0.43 % --inst_dismatching true
% 0.21/0.43 % --inst_eager_unprocessed_to_passive true
% 0.21/0.43 % --inst_prop_sim_given true
% 0.21/0.43 % --inst_prop_sim_new false
% 0.21/0.43 % --inst_orphan_elimination true
% 0.21/0.43 % --inst_learning_loop_flag true
% 0.21/0.43 % --inst_learning_start 3000
% 0.21/0.43 % --inst_learning_factor 2
% 0.21/0.43 % --inst_start_prop_sim_after_learn 3
% 0.21/0.43 % --inst_sel_renew solver
% 0.21/0.43 % --inst_lit_activity_flag true
% 0.21/0.43 % --inst_out_proof true
% 0.21/0.43
% 0.21/0.43 % ------ Resolution Options
% 0.21/0.43
% 0.21/0.43 % --resolution_flag true
% 0.21/0.43 % --res_lit_sel kbo_max
% 0.21/0.43 % --res_to_prop_solver none
% 0.21/0.43 % --res_prop_simpl_new false
% 0.21/0.43 % --res_prop_simpl_given false
% 0.21/0.43 % --res_passive_queue_type priority_queues
% 0.21/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.43 % --res_passive_queues_freq [15;5]
% 0.21/0.43 % --res_forward_subs full
% 0.21/0.43 % --res_backward_subs full
% 0.21/0.43 % --res_forward_subs_resolution true
% 0.21/0.43 % --res_backward_subs_resolution true
% 0.21/0.43 % --res_orphan_elimination false
% 0.21/0.43 % --res_time_limit 1000.
% 0.21/0.43 % --res_out_proof true
% 0.21/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_208a8a.s
% 0.21/0.43 % --modulo true
% 0.21/0.43
% 0.21/0.43 % ------ Combination Options
% 0.21/0.43
% 0.21/0.43 % --comb_res_mult 1000
% 0.21/0.43 % --comb_inst_mult 300
% 0.21/0.43 % ------
% 0.21/0.43
% 0.21/0.43 % ------ Parsing...% successful
% 0.21/0.43
% 0.21/0.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.21/0.43
% 0.21/0.43 % ------ Proving...
% 0.21/0.43 % ------ Problem Properties
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % EPR false
% 0.21/0.43 % Horn true
% 0.21/0.43 % Has equality true
% 0.21/0.43
% 0.21/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43 % % ------ Current options:
% 0.21/0.43
% 0.21/0.43 % ------ Input Options
% 0.21/0.43
% 0.21/0.43 % --out_options all
% 0.21/0.43 % --tptp_safe_out true
% 0.21/0.43 % --problem_path ""
% 0.21/0.43 % --include_path ""
% 0.21/0.43 % --clausifier .//eprover
% 0.21/0.43 % --clausifier_options --tstp-format
% 0.21/0.43 % --stdin false
% 0.21/0.43 % --dbg_backtrace false
% 0.21/0.43 % --dbg_dump_prop_clauses false
% 0.21/0.43 % --dbg_dump_prop_clauses_file -
% 0.21/0.43 % --dbg_out_stat false
% 0.21/0.43
% 0.21/0.43 % ------ General Options
% 0.21/0.43
% 0.21/0.43 % --fof false
% 0.21/0.43 % --time_out_real 150.
% 0.21/0.43 % --time_out_prep_mult 0.2
% 0.21/0.43 % --time_out_virtual -1.
% 0.21/0.43 % --schedule none
% 0.21/0.43 % --ground_splitting input
% 0.21/0.43 % --splitting_nvd 16
% 0.21/0.43 % --non_eq_to_eq false
% 0.21/0.43 % --prep_gs_sim true
% 0.21/0.43 % --prep_unflatten false
% 0.21/0.43 % --prep_res_sim true
% 0.21/0.43 % --prep_upred true
% 0.21/0.43 % --res_sim_input true
% 0.21/0.43 % --clause_weak_htbl true
% 0.21/0.43 % --gc_record_bc_elim false
% 0.21/0.43 % --symbol_type_check false
% 0.21/0.43 % --clausify_out false
% 0.21/0.43 % --large_theory_mode false
% 0.21/0.43 % --prep_sem_filter none
% 0.21/0.43 % --prep_sem_filter_out false
% 0.21/0.43 % --preprocessed_out false
% 0.21/0.43 % --sub_typing false
% 0.21/0.43 % --brand_transform false
% 0.21/0.43 % --pure_diseq_elim true
% 0.21/0.43 % --min_unsat_core false
% 0.21/0.43 % --pred_elim true
% 0.21/0.43 % --add_important_lit false
% 0.21/0.43 % --soft_assumptions false
% 0.21/0.43 % --reset_solvers false
% 0.21/0.43 % --bc_imp_inh []
% 0.21/0.43 % --conj_cone_tolerance 1.5
% 0.21/0.43 % --prolific_symb_bound 500
% 0.21/0.43 % --lt_threshold 2000
% 0.21/0.43
% 0.21/0.43 % ------ SAT Options
% 0.21/0.43
% 0.21/0.43 % --sat_mode false
% 0.21/0.43 % --sat_fm_restart_options ""
% 0.21/0.43 % --sat_gr_def false
% 0.21/0.43 % --sat_epr_types true
% 0.21/0.43 % --sat_non_cyclic_types false
% 0.21/0.43 % --sat_finite_models false
% 0.21/0.43 % --sat_fm_lemmas false
% 0.21/0.43 % --sat_fm_prep false
% 0.21/0.43 % --sat_fm_uc_incr true
% 0.21/0.43 % --sat_out_model small
% 0.21/0.43 % --sat_out_clauses false
% 0.21/0.43
% 0.21/0.43 % ------ QBF Options
% 0.21/0.43
% 0.21/0.43 % --qbf_mode false
% 0.21/0.43 % --qbf_elim_univ true
% 0.21/0.43 % --qbf_sk_in true
% 0.21/0.43 % --qbf_pred_elim true
% 0.21/0.43 % --qbf_split 32
% 0.21/0.43
% 0.21/0.43 % ------ BMC1 Options
% 0.21/0.43
% 0.21/0.43 % --bmc1_incremental false
% 0.21/0.43 % --bmc1_axioms reachable_all
% 0.21/0.43 % --bmc1_min_bound 0
% 0.21/0.43 % --bmc1_max_bound -1
% 0.21/0.43 % --bmc1_max_bound_default -1
% 0.21/0.43 % --bmc1_symbol_reachability true
% 0.21/0.43 % --bmc1_property_lemmas false
% 0.21/0.43 % --bmc1_k_induction false
% 0.21/0.43 % --bmc1_non_equiv_states false
% 0.21/0.43 % --bmc1_deadlock false
% 0.21/0.43 % --bmc1_ucm false
% 0.21/0.43 % --bmc1_add_unsat_core none
% 0.21/0.43 % --bmc1_unsat_core_children false
% 0.21/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.43 % --bmc1_out_stat full
% 0.21/0.43 % --bmc1_ground_init false
% 0.21/0.43 % --bmc1_pre_inst_next_state false
% 0.21/0.43 % --bmc1_pre_inst_state false
% 0.21/0.43 % --bmc1_pre_inst_reach_state false
% 0.21/0.43 % --bmc1_out_unsat_core false
% 0.21/0.43 % --bmc1_aig_witness_out false
% 0.21/0.43 % --bmc1_verbose false
% 0.21/0.43 % --bmc1_dump_clauses_tptp false
% 0.21/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.43 % --bmc1_dump_file -
% 0.21/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.43 % --bmc1_ucm_extend_mode 1
% 0.21/0.43 % --bmc1_ucm_init_mode 2
% 0.21/0.43 % --bmc1_ucm_cone_mode none
% 0.21/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.43 % --bmc1_ucm_relax_model 4
% 0.21/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.43 % --bmc1_ucm_layered_model none
% 0.21/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.43
% 0.21/0.43 % ------ AIG Options
% 0.21/0.43
% 0.21/0.43 % --aig_mode false
% 0.21/0.43
% 0.21/0.43 % ------ Instantiation Options
% 0.21/0.43
% 0.21/0.43 % --instantiation_flag true
% 0.21/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.43 % --inst_solver_per_active 750
% 0.21/0.43 % --inst_solver_calls_frac 0.5
% 0.21/0.43 % --inst_passive_queue_type priority_queues
% 0.21/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.43 % --inst_passive_queues_freq [25;2]
% 0.21/0.43 % --inst_dismatching true
% 0.21/0.43 % --inst_eager_unprocessed_to_passive true
% 0.21/0.43 % --inst_prop_sim_given true
% 0.21/0.43 % --inst_prop_sim_new false
% 0.21/0.43 % --inst_orphan_elimination true
% 0.21/0.43 % --inst_learning_loop_flag true
% 0.21/0.43 % --inst_learning_start 3000
% 0.21/0.43 % --inst_learning_factor 2
% 0.21/0.43 % --inst_start_prop_sim_after_learn 3
% 0.21/0.43 % --inst_sel_renew solver
% 0.21/0.43 % --inst_lit_activity_flag true
% 0.21/0.43 % --inst_out_proof true
% 0.21/0.43
% 0.21/0.43 % ------ Resolution Options
% 0.21/0.43
% 0.21/0.43 % --resolution_flag true
% 0.21/0.43 % --res_lit_sel kbo_max
% 0.21/0.43 % --res_to_prop_solver none
% 0.21/0.43 % --res_prop_simpl_new false
% 0.21/0.43 % --res_prop_simpl_given false
% 0.21/0.43 % --res_passive_queue_type priority_queues
% 0.21/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.43 % --res_passive_queues_freq [15;5]
% 0.21/0.43 % --res_forward_subs full
% 0.21/0.43 % --res_backward_subs full
% 0.21/0.43 % --res_forward_subs_resolution true
% 0.21/0.43 % --res_backward_subs_resolution true
% 0.21/0.43 % --res_orphan_elimination false
% 0.21/0.43 % --res_time_limit 1000.
% 0.21/0.43 % --res_out_proof true
% 0.21/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_208a8a.s
% 0.21/0.43 % --modulo true
% 0.21/0.43
% 0.21/0.43 % ------ Combination Options
% 0.21/0.43
% 0.21/0.43 % --comb_res_mult 1000
% 0.21/0.43 % --comb_inst_mult 300
% 0.21/0.43 % ------
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43 % ------ Proving...
% 0.21/0.43 % warning: shown sat in sat incomplete mode
% 0.21/0.43 %
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43 cnf(c_20,negated_conjecture,
% 0.21/0.43 ( ~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b) ),
% 0.21/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p', c_0_16) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_31,negated_conjecture,
% 0.21/0.43 ( ~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b) ),
% 0.21/0.43 inference(copy,[status(esa)],[c_20]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_47,negated_conjecture,
% 0.21/0.43 ( ~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b) ),
% 0.21/0.43 inference(copy,[status(esa)],[c_31]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_54,negated_conjecture,
% 0.21/0.43 ( ~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b) ),
% 0.21/0.43 inference(copy,[status(esa)],[c_47]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_55,negated_conjecture,
% 0.21/0.43 ( ~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b) ),
% 0.21/0.43 inference(copy,[status(esa)],[c_54]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_123,negated_conjecture,
% 0.21/0.43 ( ~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b) ),
% 0.21/0.43 inference(copy,[status(esa)],[c_55]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_3,plain,
% 0.21/0.43 ( ~ class_OrderedGroup_Opordered__ab__group__add(X0)
% 0.21/0.43 | ~ c_lessequals(c_plus(X1,X2,X0),X3,X0)
% 0.21/0.43 | c_lessequals(X1,c_minus(X3,X2,X0),X0) ),
% 0.21/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p', c_0_33_0) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_89,plain,
% 0.21/0.43 ( ~ class_OrderedGroup_Opordered__ab__group__add(X0)
% 0.21/0.43 | ~ c_lessequals(c_plus(X1,X2,X0),X3,X0)
% 0.21/0.43 | c_lessequals(X1,c_minus(X3,X2,X0),X0) ),
% 0.21/0.43 inference(copy,[status(esa)],[c_3]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_90,plain,
% 0.21/0.43 ( ~ c_lessequals(c_plus(X0,X1,X2),X3,X2)
% 0.21/0.43 | c_lessequals(X0,c_minus(X3,X1,X2),X2)
% 0.21/0.43 | ~ class_OrderedGroup_Opordered__ab__group__add(X2) ),
% 0.21/0.43 inference(rewriting,[status(thm)],[c_89]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_147,plain,
% 0.21/0.43 ( ~ c_lessequals(c_plus(t_b,c_0,v_g(v_x)),v_f(v_x),v_g(v_x))
% 0.21/0.43 | c_lessequals(t_b,c_minus(v_f(v_x),c_0,v_g(v_x)),v_g(v_x))
% 0.21/0.43 | ~ class_OrderedGroup_Opordered__ab__group__add(v_g(v_x)) ),
% 0.21/0.43 inference(resolution,[status(thm)],[c_123,c_90]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_148,plain,
% 0.21/0.43 ( ~ c_lessequals(c_plus(t_b,c_0,v_g(v_x)),v_f(v_x),v_g(v_x))
% 0.21/0.43 | c_lessequals(t_b,c_minus(v_f(v_x),c_0,v_g(v_x)),v_g(v_x))
% 0.21/0.43 | ~ class_OrderedGroup_Opordered__ab__group__add(v_g(v_x)) ),
% 0.21/0.43 inference(rewriting,[status(thm)],[c_147]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_0,plain,
% 0.21/0.43 ( ~ class_OrderedGroup_Opordered__ab__group__add(X0)
% 0.21/0.43 | ~ c_lessequals(X1,c_minus(X2,X3,X0),X0)
% 0.21/0.43 | c_lessequals(c_plus(X1,X3,X0),X2,X0) ),
% 0.21/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p', c_0_32_0) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_83,plain,
% 0.21/0.43 ( ~ class_OrderedGroup_Opordered__ab__group__add(X0)
% 0.21/0.43 | ~ c_lessequals(X1,c_minus(X2,X3,X0),X0)
% 0.21/0.43 | c_lessequals(c_plus(X1,X3,X0),X2,X0) ),
% 0.21/0.43 inference(copy,[status(esa)],[c_0]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_84,plain,
% 0.21/0.43 ( c_lessequals(c_plus(X0,X1,X2),X3,X2)
% 0.21/0.43 | ~ c_lessequals(X0,c_minus(X3,X1,X2),X2)
% 0.21/0.43 | ~ class_OrderedGroup_Opordered__ab__group__add(X2) ),
% 0.21/0.43 inference(rewriting,[status(thm)],[c_83]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_157,plain,
% 0.21/0.43 ( c_lessequals(c_plus(v_g(v_x),t_b,v_f(v_x)),c_0,v_f(v_x))
% 0.21/0.43 | ~ c_lessequals(v_g(v_x),c_minus(c_0,t_b,v_f(v_x)),v_f(v_x))
% 0.21/0.43 | c_lessequals(t_b,c_minus(v_f(v_x),c_0,v_g(v_x)),v_g(v_x))
% 0.21/0.43 | ~ class_OrderedGroup_Opordered__ab__group__add(v_f(v_x))
% 0.21/0.43 | ~ class_OrderedGroup_Opordered__ab__group__add(v_g(v_x)) ),
% 0.21/0.43 inference(resolution,[status(thm)],[c_148,c_84]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_158,plain,
% 0.21/0.43 ( c_lessequals(c_plus(v_g(v_x),t_b,v_f(v_x)),c_0,v_f(v_x))
% 0.21/0.43 | ~ c_lessequals(v_g(v_x),c_minus(c_0,t_b,v_f(v_x)),v_f(v_x))
% 0.21/0.43 | c_lessequals(t_b,c_minus(v_f(v_x),c_0,v_g(v_x)),v_g(v_x))
% 0.21/0.43 | ~ class_OrderedGroup_Opordered__ab__group__add(v_f(v_x))
% 0.21/0.43 | ~ class_OrderedGroup_Opordered__ab__group__add(v_g(v_x)) ),
% 0.21/0.43 inference(rewriting,[status(thm)],[c_157]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_7,plain,
% 0.21/0.43 ( ~ class_Orderings_Oorder(X0)
% 0.21/0.43 | ~ c_lessequals(X1,X2,X0)
% 0.21/0.43 | c_lessequals(X3,X2,X0)
% 0.21/0.43 | ~ c_lessequals(X3,X1,X0) ),
% 0.21/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p', c_0_34_1) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_97,plain,
% 0.21/0.43 ( ~ class_Orderings_Oorder(X0)
% 0.21/0.43 | ~ c_lessequals(X1,X2,X0)
% 0.21/0.43 | c_lessequals(X3,X2,X0)
% 0.21/0.43 | ~ c_lessequals(X3,X1,X0) ),
% 0.21/0.43 inference(copy,[status(esa)],[c_7]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_98,plain,
% 0.21/0.43 ( ~ c_lessequals(X0,X1,X2)
% 0.21/0.43 | c_lessequals(X3,X1,X2)
% 0.21/0.43 | ~ c_lessequals(X3,X0,X2)
% 0.21/0.43 | ~ class_Orderings_Oorder(X2) ),
% 0.21/0.43 inference(rewriting,[status(thm)],[c_97]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_6,plain,
% 0.21/0.43 ( ~ class_Orderings_Oorder(X0)
% 0.21/0.43 | ~ c_lessequals(X1,X2,X0)
% 0.21/0.43 | ~ c_lessequals(X3,X1,X0)
% 0.21/0.43 | c_lessequals(X3,X2,X0) ),
% 0.21/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p', c_0_34_0) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_95,plain,
% 0.21/0.43 ( ~ class_Orderings_Oorder(X0)
% 0.21/0.43 | ~ c_lessequals(X1,X2,X0)
% 0.21/0.43 | ~ c_lessequals(X3,X1,X0)
% 0.21/0.43 | c_lessequals(X3,X2,X0) ),
% 0.21/0.43 inference(copy,[status(esa)],[c_6]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_96,plain,
% 0.21/0.43 ( ~ c_lessequals(X0,X1,X2)
% 0.21/0.43 | ~ c_lessequals(X3,X0,X2)
% 0.21/0.43 | c_lessequals(X3,X1,X2)
% 0.21/0.43 | ~ class_Orderings_Oorder(X2) ),
% 0.21/0.43 inference(rewriting,[status(thm)],[c_95]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_23,negated_conjecture,
% 0.21/0.43 ( class_Ring__and__Field_Oordered__idom(t_b) ),
% 0.21/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p', c_0_19) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_37,negated_conjecture,
% 0.21/0.43 ( class_Ring__and__Field_Oordered__idom(t_b) ),
% 0.21/0.43 inference(copy,[status(esa)],[c_23]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_50,negated_conjecture,
% 0.21/0.43 ( class_Ring__and__Field_Oordered__idom(t_b) ),
% 0.21/0.43 inference(copy,[status(esa)],[c_37]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_51,negated_conjecture,
% 0.21/0.43 ( class_Ring__and__Field_Oordered__idom(t_b) ),
% 0.21/0.43 inference(copy,[status(esa)],[c_50]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_58,negated_conjecture,
% 0.21/0.43 ( class_Ring__and__Field_Oordered__idom(t_b) ),
% 0.21/0.43 inference(copy,[status(esa)],[c_51]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_129,negated_conjecture,
% 0.21/0.43 ( class_Ring__and__Field_Oordered__idom(t_b) ),
% 0.21/0.43 inference(copy,[status(esa)],[c_58]) ).
% 0.21/0.43
% 0.21/0.43 cnf(c_22,negated_conjecture,
% 0.21/0.43 ( c_lessequals(v_k(v_x),v_f(v_x),t_b) ),
% 0.21/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p', c_0_18) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_35,negated_conjecture,
% 0.21/0.44 ( c_lessequals(v_k(v_x),v_f(v_x),t_b) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_22]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_49,negated_conjecture,
% 0.21/0.44 ( c_lessequals(v_k(v_x),v_f(v_x),t_b) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_35]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_52,negated_conjecture,
% 0.21/0.44 ( c_lessequals(v_k(v_x),v_f(v_x),t_b) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_49]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_57,negated_conjecture,
% 0.21/0.44 ( c_lessequals(v_k(v_x),v_f(v_x),t_b) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_52]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_127,negated_conjecture,
% 0.21/0.44 ( c_lessequals(v_k(v_x),v_f(v_x),t_b) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_57]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_21,negated_conjecture,
% 0.21/0.44 ( c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p', c_0_17) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_33,negated_conjecture,
% 0.21/0.44 ( c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_21]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_48,negated_conjecture,
% 0.21/0.44 ( c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_33]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_53,negated_conjecture,
% 0.21/0.44 ( c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_48]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_56,negated_conjecture,
% 0.21/0.44 ( c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_53]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_125,negated_conjecture,
% 0.21/0.44 ( c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_56]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_18,plain,
% 0.21/0.44 ( ~ class_Ring__and__Field_Oordered__idom(X0)
% 0.21/0.44 | class_OrderedGroup_Opordered__ab__group__add(X0) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p', c_0_39_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_119,plain,
% 0.21/0.44 ( ~ class_Ring__and__Field_Oordered__idom(X0)
% 0.21/0.44 | class_OrderedGroup_Opordered__ab__group__add(X0) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_18]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_120,plain,
% 0.21/0.44 ( class_OrderedGroup_Opordered__ab__group__add(X0)
% 0.21/0.44 | ~ class_Ring__and__Field_Oordered__idom(X0) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_119]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_16,plain,
% 0.21/0.44 ( ~ class_Ring__and__Field_Oordered__idom(X0)
% 0.21/0.44 | class_Orderings_Olinorder(X0) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p', c_0_38_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_115,plain,
% 0.21/0.44 ( ~ class_Ring__and__Field_Oordered__idom(X0)
% 0.21/0.44 | class_Orderings_Olinorder(X0) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_16]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_116,plain,
% 0.21/0.44 ( class_Orderings_Olinorder(X0)
% 0.21/0.44 | ~ class_Ring__and__Field_Oordered__idom(X0) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_115]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_14,plain,
% 0.21/0.44 ( ~ class_Ring__and__Field_Oordered__idom(X0)
% 0.21/0.44 | class_OrderedGroup_Ocomm__monoid__add(X0) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p', c_0_37_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_111,plain,
% 0.21/0.44 ( ~ class_Ring__and__Field_Oordered__idom(X0)
% 0.21/0.44 | class_OrderedGroup_Ocomm__monoid__add(X0) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_14]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_112,plain,
% 0.21/0.44 ( class_OrderedGroup_Ocomm__monoid__add(X0)
% 0.21/0.44 | ~ class_Ring__and__Field_Oordered__idom(X0) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_111]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_12,plain,
% 0.21/0.44 ( ~ class_Orderings_Olinorder(X0) | class_Orderings_Oorder(X0) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p', c_0_36_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_107,plain,
% 0.21/0.44 ( ~ class_Orderings_Olinorder(X0) | class_Orderings_Oorder(X0) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_12]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_108,plain,
% 0.21/0.44 ( class_Orderings_Oorder(X0) | ~ class_Orderings_Olinorder(X0) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_107]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_10,plain,
% 0.21/0.44 ( ~ class_OrderedGroup_Ocomm__monoid__add(X0) | c_plus(c_0,X1,X0) = X1 ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p', c_0_35_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_103,plain,
% 0.21/0.44 ( ~ class_OrderedGroup_Ocomm__monoid__add(X0) | c_plus(c_0,X1,X0) = X1 ),
% 0.21/0.44 inference(copy,[status(esa)],[c_10]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_8,plain,
% 0.21/0.44 ( ~ class_Orderings_Oorder(X0)
% 0.21/0.44 | c_lessequals(X1,X2,X0)
% 0.21/0.44 | ~ c_lessequals(X1,X3,X0)
% 0.21/0.44 | ~ c_lessequals(X3,X2,X0) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p', c_0_34_2) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_99,plain,
% 0.21/0.44 ( ~ class_Orderings_Oorder(X0)
% 0.21/0.44 | c_lessequals(X1,X2,X0)
% 0.21/0.44 | ~ c_lessequals(X1,X3,X0)
% 0.21/0.44 | ~ c_lessequals(X3,X2,X0) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_8]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_100,plain,
% 0.21/0.44 ( c_lessequals(X0,X1,X2)
% 0.21/0.44 | ~ c_lessequals(X0,X3,X2)
% 0.21/0.44 | ~ c_lessequals(X3,X1,X2)
% 0.21/0.44 | ~ class_Orderings_Oorder(X2) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_99]) ).
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 % ------ Statistics
% 0.21/0.44
% 0.21/0.44 % ------ General
% 0.21/0.44
% 0.21/0.44 % num_of_input_clauses: 24
% 0.21/0.44 % num_of_input_neg_conjectures: 4
% 0.21/0.44 % num_of_splits: 0
% 0.21/0.44 % num_of_split_atoms: 0
% 0.21/0.44 % num_of_sem_filtered_clauses: 0
% 0.21/0.44 % num_of_subtypes: 0
% 0.21/0.44 % monotx_restored_types: 0
% 0.21/0.44 % sat_num_of_epr_types: 0
% 0.21/0.44 % sat_num_of_non_cyclic_types: 0
% 0.21/0.44 % sat_guarded_non_collapsed_types: 0
% 0.21/0.44 % is_epr: 0
% 0.21/0.44 % is_horn: 1
% 0.21/0.44 % has_eq: 1
% 0.21/0.44 % num_pure_diseq_elim: 0
% 0.21/0.44 % simp_replaced_by: 0
% 0.21/0.44 % res_preprocessed: 8
% 0.21/0.44 % prep_upred: 0
% 0.21/0.44 % prep_unflattend: 0
% 0.21/0.44 % pred_elim_cands: 0
% 0.21/0.44 % pred_elim: 0
% 0.21/0.44 % pred_elim_cl: 0
% 0.21/0.44 % pred_elim_cycles: 0
% 0.21/0.44 % forced_gc_time: 0
% 0.21/0.44 % gc_basic_clause_elim: 0
% 0.21/0.44 % parsing_time: 0.001
% 0.21/0.44 % sem_filter_time: 0.
% 0.21/0.44 % pred_elim_time: 0.
% 0.21/0.44 % out_proof_time: 0.
% 0.21/0.44 % monotx_time: 0.
% 0.21/0.44 % subtype_inf_time: 0.
% 0.21/0.44 % unif_index_cands_time: 0.
% 0.21/0.44 % unif_index_add_time: 0.
% 0.21/0.44 % total_time: 0.025
% 0.21/0.44 % num_of_symbols: 39
% 0.21/0.44 % num_of_terms: 171
% 0.21/0.44
% 0.21/0.44 % ------ Propositional Solver
% 0.21/0.44
% 0.21/0.44 % prop_solver_calls: 1
% 0.21/0.44 % prop_fast_solver_calls: 12
% 0.21/0.44 % prop_num_of_clauses: 26
% 0.21/0.44 % prop_preprocess_simplified: 94
% 0.21/0.44 % prop_fo_subsumed: 0
% 0.21/0.44 % prop_solver_time: 0.
% 0.21/0.44 % prop_fast_solver_time: 0.
% 0.21/0.44 % prop_unsat_core_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ QBF
% 0.21/0.44
% 0.21/0.44 % qbf_q_res: 0
% 0.21/0.44 % qbf_num_tautologies: 0
% 0.21/0.44 % qbf_prep_cycles: 0
% 0.21/0.44
% 0.21/0.44 % ------ BMC1
% 0.21/0.44
% 0.21/0.44 % bmc1_current_bound: -1
% 0.21/0.44 % bmc1_last_solved_bound: -1
% 0.21/0.44 % bmc1_unsat_core_size: -1
% 0.21/0.44 % bmc1_unsat_core_parents_size: -1
% 0.21/0.44 % bmc1_merge_next_fun: 0
% 0.21/0.44 % bmc1_unsat_core_clauses_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation
% 0.21/0.44
% 0.21/0.44 % inst_num_of_clauses: 24
% 0.21/0.44 % inst_num_in_passive: 0
% 0.21/0.44 % inst_num_in_active: 0
% 0.21/0.44 % inst_num_in_unprocessed: 24
% 0.21/0.44 % inst_num_of_loops: 0
% 0.21/0.44 % inst_num_of_learning_restarts: 0
% 0.21/0.44 % inst_num_moves_active_passive: 0
% 0.21/0.44 % inst_lit_activity: 0
% 0.21/0.44 % inst_lit_activity_moves: 0
% 0.21/0.44 % inst_num_tautologies: 0
% 0.21/0.44 % inst_num_prop_implied: 0
% 0.21/0.44 % inst_num_existing_simplified: 0
% 0.21/0.44 % inst_num_eq_res_simplified: 0
% 0.21/0.44 % inst_num_child_elim: 0
% 0.21/0.44 % inst_num_of_dismatching_blockings: 0
% 0.21/0.44 % inst_num_of_non_proper_insts: 0
% 0.21/0.44 % inst_num_of_duplicates: 0
% 0.21/0.44 % inst_inst_num_from_inst_to_res: 0
% 0.21/0.44 % inst_dismatching_checking_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ Resolution
% 0.21/0.44
% 0.21/0.44 % res_num_of_clauses: 29
% 0.21/0.44 % res_num_in_passive: 0
% 0.21/0.44 % res_num_in_active: 16
% 0.21/0.44 % res_num_of_loops: 15
% 0.21/0.44 % res_forward_subset_subsumed: 10
% 0.21/0.44 % res_backward_subset_subsumed: 0
% 0.21/0.44 % res_forward_subsumed: 8
% 0.21/0.44 % res_backward_subsumed: 0
% 0.21/0.44 % res_forward_subsumption_resolution: 0
% 0.21/0.44 % res_backward_subsumption_resolution: 0
% 0.21/0.44 % res_clause_to_clause_subsumption: 9
% 0.21/0.44 % res_orphan_elimination: 0
% 0.21/0.44 % res_tautology_del: 0
% 0.21/0.44 % res_num_eq_res_simplified: 0
% 0.21/0.44 % res_num_sel_changes: 0
% 0.21/0.44 % res_moves_from_active_to_pass: 0
% 0.21/0.44
% 0.21/0.44 % Status Unknown
% 0.21/0.48 % Orienting using strategy ClausalAll
% 0.21/0.48 % Orientation found
% 0.21/0.48 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_208a8a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_910dfc.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_76386c | grep -v "SZS"
% 0.21/0.50
% 0.21/0.50 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.50
% 0.21/0.50 %
% 0.21/0.50 % ------ iProver source info
% 0.21/0.50
% 0.21/0.50 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.50 % git: non_committed_changes: true
% 0.21/0.50 % git: last_make_outside_of_git: true
% 0.21/0.50
% 0.21/0.50 %
% 0.21/0.50 % ------ Input Options
% 0.21/0.50
% 0.21/0.50 % --out_options all
% 0.21/0.50 % --tptp_safe_out true
% 0.21/0.50 % --problem_path ""
% 0.21/0.50 % --include_path ""
% 0.21/0.50 % --clausifier .//eprover
% 0.21/0.50 % --clausifier_options --tstp-format
% 0.21/0.50 % --stdin false
% 0.21/0.50 % --dbg_backtrace false
% 0.21/0.50 % --dbg_dump_prop_clauses false
% 0.21/0.50 % --dbg_dump_prop_clauses_file -
% 0.21/0.50 % --dbg_out_stat false
% 0.21/0.50
% 0.21/0.50 % ------ General Options
% 0.21/0.50
% 0.21/0.50 % --fof false
% 0.21/0.50 % --time_out_real 150.
% 0.21/0.50 % --time_out_prep_mult 0.2
% 0.21/0.50 % --time_out_virtual -1.
% 0.21/0.50 % --schedule none
% 0.21/0.50 % --ground_splitting input
% 0.21/0.50 % --splitting_nvd 16
% 0.21/0.50 % --non_eq_to_eq false
% 0.21/0.50 % --prep_gs_sim true
% 0.21/0.50 % --prep_unflatten false
% 0.21/0.50 % --prep_res_sim true
% 0.21/0.50 % --prep_upred true
% 0.21/0.50 % --res_sim_input true
% 0.21/0.50 % --clause_weak_htbl true
% 0.21/0.50 % --gc_record_bc_elim false
% 0.21/0.50 % --symbol_type_check false
% 0.21/0.50 % --clausify_out false
% 0.21/0.50 % --large_theory_mode false
% 0.21/0.50 % --prep_sem_filter none
% 0.21/0.50 % --prep_sem_filter_out false
% 0.21/0.50 % --preprocessed_out false
% 0.21/0.50 % --sub_typing false
% 0.21/0.50 % --brand_transform false
% 0.21/0.50 % --pure_diseq_elim true
% 0.21/0.50 % --min_unsat_core false
% 0.21/0.50 % --pred_elim true
% 0.21/0.50 % --add_important_lit false
% 0.21/0.50 % --soft_assumptions false
% 0.21/0.50 % --reset_solvers false
% 0.21/0.50 % --bc_imp_inh []
% 0.21/0.50 % --conj_cone_tolerance 1.5
% 0.21/0.50 % --prolific_symb_bound 500
% 0.21/0.50 % --lt_threshold 2000
% 0.21/0.50
% 0.21/0.50 % ------ SAT Options
% 0.21/0.50
% 0.21/0.50 % --sat_mode false
% 0.21/0.50 % --sat_fm_restart_options ""
% 0.21/0.50 % --sat_gr_def false
% 0.21/0.50 % --sat_epr_types true
% 0.21/0.50 % --sat_non_cyclic_types false
% 0.21/0.50 % --sat_finite_models false
% 0.21/0.50 % --sat_fm_lemmas false
% 0.21/0.50 % --sat_fm_prep false
% 0.21/0.50 % --sat_fm_uc_incr true
% 0.21/0.50 % --sat_out_model small
% 0.21/0.50 % --sat_out_clauses false
% 0.21/0.50
% 0.21/0.50 % ------ QBF Options
% 0.21/0.50
% 0.21/0.50 % --qbf_mode false
% 0.21/0.50 % --qbf_elim_univ true
% 0.21/0.50 % --qbf_sk_in true
% 0.21/0.50 % --qbf_pred_elim true
% 0.21/0.50 % --qbf_split 32
% 0.21/0.50
% 0.21/0.50 % ------ BMC1 Options
% 0.21/0.50
% 0.21/0.50 % --bmc1_incremental false
% 0.21/0.50 % --bmc1_axioms reachable_all
% 0.21/0.50 % --bmc1_min_bound 0
% 0.21/0.50 % --bmc1_max_bound -1
% 0.21/0.50 % --bmc1_max_bound_default -1
% 0.21/0.50 % --bmc1_symbol_reachability true
% 0.21/0.50 % --bmc1_property_lemmas false
% 0.21/0.50 % --bmc1_k_induction false
% 0.21/0.50 % --bmc1_non_equiv_states false
% 0.21/0.50 % --bmc1_deadlock false
% 0.21/0.50 % --bmc1_ucm false
% 0.21/0.50 % --bmc1_add_unsat_core none
% 0.21/0.50 % --bmc1_unsat_core_children false
% 0.21/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.50 % --bmc1_out_stat full
% 0.21/0.50 % --bmc1_ground_init false
% 0.21/0.50 % --bmc1_pre_inst_next_state false
% 0.21/0.50 % --bmc1_pre_inst_state false
% 0.21/0.50 % --bmc1_pre_inst_reach_state false
% 0.21/0.50 % --bmc1_out_unsat_core false
% 0.21/0.50 % --bmc1_aig_witness_out false
% 0.21/0.50 % --bmc1_verbose false
% 0.21/0.50 % --bmc1_dump_clauses_tptp false
% 0.21/0.50 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.50 % --bmc1_dump_file -
% 0.21/0.50 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.50 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.50 % --bmc1_ucm_extend_mode 1
% 0.21/0.50 % --bmc1_ucm_init_mode 2
% 0.21/0.50 % --bmc1_ucm_cone_mode none
% 0.21/0.50 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.50 % --bmc1_ucm_relax_model 4
% 0.21/0.50 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.50 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.50 % --bmc1_ucm_layered_model none
% 0.21/0.50 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.50
% 0.21/0.50 % ------ AIG Options
% 0.21/0.50
% 0.21/0.50 % --aig_mode false
% 0.21/0.50
% 0.21/0.50 % ------ Instantiation Options
% 0.21/0.50
% 0.21/0.50 % --instantiation_flag true
% 0.21/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.50 % --inst_solver_per_active 750
% 0.21/0.50 % --inst_solver_calls_frac 0.5
% 0.21/0.50 % --inst_passive_queue_type priority_queues
% 0.21/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.51 % --inst_passive_queues_freq [25;2]
% 0.21/0.51 % --inst_dismatching true
% 0.21/0.51 % --inst_eager_unprocessed_to_passive true
% 0.21/0.51 % --inst_prop_sim_given true
% 0.21/0.51 % --inst_prop_sim_new false
% 0.21/0.51 % --inst_orphan_elimination true
% 0.21/0.51 % --inst_learning_loop_flag true
% 0.21/0.51 % --inst_learning_start 3000
% 0.21/0.51 % --inst_learning_factor 2
% 0.21/0.51 % --inst_start_prop_sim_after_learn 3
% 0.21/0.51 % --inst_sel_renew solver
% 0.21/0.51 % --inst_lit_activity_flag true
% 0.21/0.51 % --inst_out_proof true
% 0.21/0.51
% 0.21/0.51 % ------ Resolution Options
% 0.21/0.51
% 0.21/0.51 % --resolution_flag true
% 0.21/0.51 % --res_lit_sel kbo_max
% 0.21/0.51 % --res_to_prop_solver none
% 0.21/0.51 % --res_prop_simpl_new false
% 0.21/0.51 % --res_prop_simpl_given false
% 0.21/0.51 % --res_passive_queue_type priority_queues
% 0.21/0.51 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.51 % --res_passive_queues_freq [15;5]
% 0.21/0.51 % --res_forward_subs full
% 0.21/0.51 % --res_backward_subs full
% 0.21/0.51 % --res_forward_subs_resolution true
% 0.21/0.51 % --res_backward_subs_resolution true
% 0.21/0.51 % --res_orphan_elimination false
% 0.21/0.51 % --res_time_limit 1000.
% 0.21/0.51 % --res_out_proof true
% 0.21/0.51 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_208a8a.s
% 0.21/0.51 % --modulo true
% 0.21/0.51
% 0.21/0.51 % ------ Combination Options
% 0.21/0.51
% 0.21/0.51 % --comb_res_mult 1000
% 0.21/0.51 % --comb_inst_mult 300
% 0.21/0.51 % ------
% 0.21/0.51
% 0.21/0.51 % ------ Parsing...% successful
% 0.21/0.51
% 0.21/0.51 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.21/0.51
% 0.21/0.51 % ------ Proving...
% 0.21/0.51 % ------ Problem Properties
% 0.21/0.51
% 0.21/0.51 %
% 0.21/0.51 % EPR false
% 0.21/0.51 % Horn true
% 0.21/0.51 % Has equality true
% 0.21/0.51
% 0.21/0.51 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.51
% 0.21/0.51
% 0.21/0.51 % % ------ Current options:
% 0.21/0.51
% 0.21/0.51 % ------ Input Options
% 0.21/0.51
% 0.21/0.51 % --out_options all
% 0.21/0.51 % --tptp_safe_out true
% 0.21/0.51 % --problem_path ""
% 0.21/0.51 % --include_path ""
% 0.21/0.51 % --clausifier .//eprover
% 0.21/0.51 % --clausifier_options --tstp-format
% 0.21/0.51 % --stdin false
% 0.21/0.51 % --dbg_backtrace false
% 0.21/0.51 % --dbg_dump_prop_clauses false
% 0.21/0.51 % --dbg_dump_prop_clauses_file -
% 0.21/0.51 % --dbg_out_stat false
% 0.21/0.51
% 0.21/0.51 % ------ General Options
% 0.21/0.51
% 0.21/0.51 % --fof false
% 0.21/0.51 % --time_out_real 150.
% 0.21/0.51 % --time_out_prep_mult 0.2
% 0.21/0.51 % --time_out_virtual -1.
% 0.21/0.51 % --schedule none
% 0.21/0.51 % --ground_splitting input
% 0.21/0.51 % --splitting_nvd 16
% 0.21/0.51 % --non_eq_to_eq false
% 0.21/0.51 % --prep_gs_sim true
% 0.21/0.51 % --prep_unflatten false
% 0.21/0.51 % --prep_res_sim true
% 0.21/0.51 % --prep_upred true
% 0.21/0.51 % --res_sim_input true
% 0.21/0.51 % --clause_weak_htbl true
% 0.21/0.51 % --gc_record_bc_elim false
% 0.21/0.51 % --symbol_type_check false
% 0.21/0.51 % --clausify_out false
% 0.21/0.51 % --large_theory_mode false
% 0.21/0.51 % --prep_sem_filter none
% 0.21/0.51 % --prep_sem_filter_out false
% 0.21/0.51 % --preprocessed_out false
% 0.21/0.51 % --sub_typing false
% 0.21/0.51 % --brand_transform false
% 0.21/0.51 % --pure_diseq_elim true
% 0.21/0.51 % --min_unsat_core false
% 0.21/0.51 % --pred_elim true
% 0.21/0.51 % --add_important_lit false
% 0.21/0.51 % --soft_assumptions false
% 0.21/0.51 % --reset_solvers false
% 0.21/0.51 % --bc_imp_inh []
% 0.21/0.51 % --conj_cone_tolerance 1.5
% 0.21/0.51 % --prolific_symb_bound 500
% 0.21/0.51 % --lt_threshold 2000
% 0.21/0.51
% 0.21/0.51 % ------ SAT Options
% 0.21/0.51
% 0.21/0.51 % --sat_mode false
% 0.21/0.51 % --sat_fm_restart_options ""
% 0.21/0.51 % --sat_gr_def false
% 0.21/0.51 % --sat_epr_types true
% 0.21/0.51 % --sat_non_cyclic_types false
% 0.21/0.51 % --sat_finite_models false
% 0.21/0.51 % --sat_fm_lemmas false
% 0.21/0.51 % --sat_fm_prep false
% 0.21/0.51 % --sat_fm_uc_incr true
% 0.21/0.51 % --sat_out_model small
% 0.21/0.51 % --sat_out_clauses false
% 0.21/0.51
% 0.21/0.51 % ------ QBF Options
% 0.21/0.51
% 0.21/0.51 % --qbf_mode false
% 0.21/0.51 % --qbf_elim_univ true
% 0.21/0.51 % --qbf_sk_in true
% 0.21/0.51 % --qbf_pred_elim true
% 0.21/0.51 % --qbf_split 32
% 0.21/0.51
% 0.21/0.51 % ------ BMC1 Options
% 0.21/0.51
% 0.21/0.51 % --bmc1_incremental false
% 0.21/0.51 % --bmc1_axioms reachable_all
% 0.21/0.51 % --bmc1_min_bound 0
% 0.21/0.51 % --bmc1_max_bound -1
% 0.21/0.51 % --bmc1_max_bound_default -1
% 0.21/0.51 % --bmc1_symbol_reachability true
% 0.21/0.51 % --bmc1_property_lemmas false
% 0.21/0.51 % --bmc1_k_induction false
% 0.21/0.51 % --bmc1_non_equiv_states false
% 0.21/0.51 % --bmc1_deadlock false
% 0.21/0.51 % --bmc1_ucm false
% 0.21/0.51 % --bmc1_add_unsat_core none
% 0.21/0.51 % --bmc1_unsat_core_children false
% 0.21/0.51 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.51 % --bmc1_out_stat full
% 0.21/0.51 % --bmc1_ground_init false
% 0.21/0.51 % --bmc1_pre_inst_next_state false
% 0.21/0.51 % --bmc1_pre_inst_state false
% 0.21/0.51 % --bmc1_pre_inst_reach_state false
% 0.21/0.51 % --bmc1_out_unsat_core false
% 0.21/0.51 % --bmc1_aig_witness_out false
% 0.21/0.51 % --bmc1_verbose false
% 0.21/0.51 % --bmc1_dump_clauses_tptp false
% 0.21/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.51 % --bmc1_dump_file -
% 0.21/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.51 % --bmc1_ucm_extend_mode 1
% 0.21/0.51 % --bmc1_ucm_init_mode 2
% 0.21/0.51 % --bmc1_ucm_cone_mode none
% 0.21/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.51 % --bmc1_ucm_relax_model 4
% 0.21/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.51 % --bmc1_ucm_layered_model none
% 0.21/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.51
% 0.21/0.51 % ------ AIG Options
% 0.21/0.51
% 0.21/0.51 % --aig_mode false
% 0.21/0.51
% 0.21/0.51 % ------ Instantiation Options
% 0.21/0.51
% 0.21/0.51 % --instantiation_flag true
% 0.21/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.51 % --inst_solver_per_active 750
% 0.21/0.51 % --inst_solver_calls_frac 0.5
% 0.21/0.51 % --inst_passive_queue_type priority_queues
% 0.21/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.51 % --inst_passive_queues_freq [25;2]
% 0.21/0.51 % --inst_dismatching true
% 0.21/0.51 % --inst_eager_unprocessed_to_passive true
% 0.21/0.51 % --inst_prop_sim_given true
% 1.12/1.32 % --inst_prop_sim_new false
% 1.12/1.32 % --inst_orphan_elimination true
% 1.12/1.32 % --inst_learning_loop_flag true
% 1.12/1.32 % --inst_learning_start 3000
% 1.12/1.32 % --inst_learning_factor 2
% 1.12/1.32 % --inst_start_prop_sim_after_learn 3
% 1.12/1.32 % --inst_sel_renew solver
% 1.12/1.32 % --inst_lit_activity_flag true
% 1.12/1.32 % --inst_out_proof true
% 1.12/1.32
% 1.12/1.32 % ------ Resolution Options
% 1.12/1.32
% 1.12/1.32 % --resolution_flag true
% 1.12/1.32 % --res_lit_sel kbo_max
% 1.12/1.32 % --res_to_prop_solver none
% 1.12/1.32 % --res_prop_simpl_new false
% 1.12/1.32 % --res_prop_simpl_given false
% 1.12/1.32 % --res_passive_queue_type priority_queues
% 1.12/1.32 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.12/1.32 % --res_passive_queues_freq [15;5]
% 1.12/1.32 % --res_forward_subs full
% 1.12/1.32 % --res_backward_subs full
% 1.12/1.32 % --res_forward_subs_resolution true
% 1.12/1.32 % --res_backward_subs_resolution true
% 1.12/1.32 % --res_orphan_elimination false
% 1.12/1.32 % --res_time_limit 1000.
% 1.12/1.32 % --res_out_proof true
% 1.12/1.32 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_208a8a.s
% 1.12/1.32 % --modulo true
% 1.12/1.32
% 1.12/1.32 % ------ Combination Options
% 1.12/1.32
% 1.12/1.32 % --comb_res_mult 1000
% 1.12/1.32 % --comb_inst_mult 300
% 1.12/1.32 % ------
% 1.12/1.32
% 1.12/1.32
% 1.12/1.32
% 1.12/1.32 % ------ Proving...
% 1.12/1.32 %
% 1.12/1.32
% 1.12/1.32
% 1.12/1.32 % ------ Statistics
% 1.12/1.32
% 1.12/1.32 % ------ General
% 1.12/1.32
% 1.12/1.32 % num_of_input_clauses: 24
% 1.12/1.32 % num_of_input_neg_conjectures: 4
% 1.12/1.32 % num_of_splits: 0
% 1.12/1.32 % num_of_split_atoms: 0
% 1.12/1.32 % num_of_sem_filtered_clauses: 0
% 1.12/1.32 % num_of_subtypes: 0
% 1.12/1.32 % monotx_restored_types: 0
% 1.12/1.32 % sat_num_of_epr_types: 0
% 1.12/1.32 % sat_num_of_non_cyclic_types: 0
% 1.12/1.32 % sat_guarded_non_collapsed_types: 0
% 1.12/1.32 % is_epr: 0
% 1.12/1.32 % is_horn: 1
% 1.12/1.32 % has_eq: 1
% 1.12/1.32 % num_pure_diseq_elim: 0
% 1.12/1.32 % simp_replaced_by: 0
% 1.12/1.32 % res_preprocessed: 8
% 1.12/1.32 % prep_upred: 0
% 1.12/1.32 % prep_unflattend: 0
% 1.12/1.32 % pred_elim_cands: 0
% 1.12/1.32 % pred_elim: 0
% 1.12/1.32 % pred_elim_cl: 0
% 1.12/1.32 % pred_elim_cycles: 0
% 1.12/1.32 % forced_gc_time: 0
% 1.12/1.32 % gc_basic_clause_elim: 0
% 1.12/1.32 % parsing_time: 0.001
% 1.12/1.32 % sem_filter_time: 0.
% 1.12/1.32 % pred_elim_time: 0.
% 1.12/1.32 % out_proof_time: 0.
% 1.12/1.32 % monotx_time: 0.
% 1.12/1.32 % subtype_inf_time: 0.
% 1.12/1.32 % unif_index_cands_time: 0.002
% 1.12/1.32 % unif_index_add_time: 0.002
% 1.12/1.32 % total_time: 0.833
% 1.12/1.32 % num_of_symbols: 39
% 1.12/1.32 % num_of_terms: 1794
% 1.12/1.32
% 1.12/1.32 % ------ Propositional Solver
% 1.12/1.32
% 1.12/1.32 % prop_solver_calls: 4
% 1.12/1.32 % prop_fast_solver_calls: 12
% 1.12/1.32 % prop_num_of_clauses: 44
% 1.12/1.32 % prop_preprocess_simplified: 154
% 1.12/1.32 % prop_fo_subsumed: 0
% 1.12/1.32 % prop_solver_time: 0.
% 1.12/1.32 % prop_fast_solver_time: 0.
% 1.12/1.32 % prop_unsat_core_time: 0.
% 1.12/1.32
% 1.12/1.32 % ------ QBF
% 1.12/1.32
% 1.12/1.32 % qbf_q_res: 0
% 1.12/1.32 % qbf_num_tautologies: 0
% 1.12/1.32 % qbf_prep_cycles: 0
% 1.12/1.32
% 1.12/1.32 % ------ BMC1
% 1.12/1.32
% 1.12/1.32 % bmc1_current_bound: -1
% 1.12/1.32 % bmc1_last_solved_bound: -1
% 1.12/1.32 % bmc1_unsat_core_size: -1
% 1.12/1.32 % bmc1_unsat_core_parents_size: -1
% 1.12/1.32 % bmc1_merge_next_fun: 0
% 1.12/1.32 % bmc1_unsat_core_clauses_time: 0.
% 1.12/1.32
% 1.12/1.32 % ------ Instantiation
% 1.12/1.32
% 1.12/1.32 % inst_num_of_clauses: 36
% 1.12/1.32 % inst_num_in_passive: 2
% 1.12/1.32 % inst_num_in_active: 30
% 1.12/1.32 % inst_num_in_unprocessed: 2
% 1.12/1.32 % inst_num_of_loops: 34
% 1.12/1.32 % inst_num_of_learning_restarts: 0
% 1.12/1.32 % inst_num_moves_active_passive: 0
% 1.12/1.32 % inst_lit_activity: 8
% 1.12/1.32 % inst_lit_activity_moves: 0
% 1.12/1.32 % inst_num_tautologies: 0
% 1.12/1.32 % inst_num_prop_implied: 0
% 1.12/1.32 % inst_num_existing_simplified: 0
% 1.12/1.32 % inst_num_eq_res_simplified: 0
% 1.12/1.32 % inst_num_child_elim: 0
% 1.12/1.32 % inst_num_of_dismatching_blockings: 0
% 1.12/1.32 % inst_num_of_non_proper_insts: 28
% 1.12/1.32 % inst_num_of_duplicates: 12
% 1.12/1.32 % inst_inst_num_from_inst_to_res: 0
% 1.12/1.32 % inst_dismatching_checking_time: 0.
% 1.12/1.32
% 1.12/1.32 % ------ Resolution
% 1.12/1.32
% 1.12/1.32 % res_num_of_clauses: 4128
% 1.12/1.32 % res_num_in_passive: 3139
% 1.12/1.32 % res_num_in_active: 980
% 1.12/1.32 % res_num_of_loops: 1000
% 1.12/1.32 % res_forward_subset_subsumed: 114
% 1.12/1.32 % res_backward_subset_subsumed: 1
% 1.12/1.32 % res_forward_subsumed: 26
% 1.12/1.32 % res_backward_subsumed: 0
% 1.12/1.32 % res_forward_subsumption_resolution: 724
% 1.12/1.32 % res_backward_subsumption_resolution: 3
% 1.12/1.32 % res_clause_to_clause_subsumption: 28658
% 1.12/1.32 % res_orphan_elimination: 0
% 1.12/1.32 % res_tautology_del: 1
% 1.12/1.32 % res_num_eq_res_simplified: 0
% 1.12/1.32 % res_num_sel_changes: 0
% 1.12/1.32 % res_moves_from_active_to_pass: 0
% 1.12/1.32
% 1.12/1.32 % Status Unsatisfiable
% 1.12/1.32 % SZS status Unsatisfiable
% 1.12/1.32 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------