%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT078+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 8 06:12:37 AM UTC 2026
% Result : Theorem 0.30s 0.66s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 64
% Syntax : Number of formulae : 570 ( 308 unt; 0 def)
% Number of atoms : 1247 ( 376 equ)
% Maximal formula atoms : 21 ( 2 avg)
% Number of connectives : 1233 ( 556 ~; 502 |; 135 &)
% ( 16 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-4 aty)
% Number of functors : 21 ( 21 usr; 14 con; 0-4 aty)
% Number of variables : 761 ( 34 sgn 193 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X6,X7,X8,X9] :
( axis_subsumes(X6,X7,X8,X9)
<=> ! [X1] :
( in_closed(X1,X6,X7)
=> in_closed(X1,X8,X9) ) ),
file('<stdin>',axis_subsumes_def) ).
fof(c_0_1,axiom,
! [X6,X7,X8,X9] :
( axis_compatible(X6,X7,X8,X9)
<=> ? [X1] :
( in_closed(X1,X6,X7)
& in_closed(X1,X8,X9) ) ),
file('<stdin>',axis_compatible_def) ).
fof(c_0_2,axiom,
! [X6,X7,X8,X9] :
( axis_conflict(X6,X7,X8,X9)
<=> ~ ? [X1] :
( in_closed(X1,X6,X7)
& in_closed(X1,X8,X9) ) ),
file('<stdin>',axis_conflict_def) ).
fof(c_0_3,axiom,
! [X1,X4,X5] :
( in_open(X1,X4,X5)
<=> ( less(X4,X1)
& less(X1,X5) ) ),
file('<stdin>',in_open) ).
fof(c_0_4,axiom,
! [X1,X4,X5] :
( in_ropen(X1,X4,X5)
<=> ( leq(X4,X1)
& less(X1,X5) ) ),
file('<stdin>',in_ropen) ).
fof(c_0_5,axiom,
! [X1,X4,X5] :
( in_lopen(X1,X4,X5)
<=> ( less(X4,X1)
& leq(X1,X5) ) ),
file('<stdin>',in_lopen) ).
fof(c_0_6,axiom,
! [X1,X4,X5] :
( in_closed(X1,X4,X5)
<=> ( leq(X4,X1)
& leq(X1,X5) ) ),
file('<stdin>',in_closed) ).
fof(c_0_7,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('<stdin>',leq_trans) ).
fof(c_0_8,axiom,
! [X1,X2,X3] :
( ( less(X1,X2)
& leq(X2,X3) )
=> less(X1,X3) ),
file('<stdin>',less_leq_trans) ).
fof(c_0_9,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& less(X2,X3) )
=> less(X1,X3) ),
file('<stdin>',leq_less_trans) ).
fof(c_0_10,axiom,
! [X1,X2,X3] :
( ( less(X1,X2)
& less(X2,X3) )
=> less(X1,X3) ),
file('<stdin>',transitive) ).
fof(c_0_11,axiom,
! [X11,X12] :
( ( is_verdict(X11)
& is_verdict(X12) )
=> ( box_verdict(X11,X12) = conflict
| box_verdict(X11,X12) = compatible
| box_verdict(X11,X12) = unknown ) ),
file('<stdin>',box_verdict_total) ).
fof(c_0_12,axiom,
! [X1,X2] :
( ( leq(X1,X2)
& leq(X2,X1) )
=> X1 = X2 ),
file('<stdin>',leq_antisym) ).
fof(c_0_13,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> ( less(X1,X2)
| X1 = X2 ) ),
file('<stdin>',leq_def) ).
fof(c_0_14,axiom,
! [X1,X2] :
( less(X1,X2)
=> leq(X1,X2) ),
file('<stdin>',less_implies_leq) ).
fof(c_0_15,axiom,
! [X11,X12] :
( ( is_verdict(X11)
& is_verdict(X12)
& ( X11 = unknown
| X12 = unknown )
& X11 != conflict
& X12 != conflict )
=> box_verdict(X11,X12) = unknown ),
file('<stdin>',box_unknown) ).
fof(c_0_16,axiom,
! [X11,X12] :
( ( is_verdict(X11)
& is_verdict(X12)
& X11 = compatible
& X12 = compatible )
=> box_verdict(X11,X12) = compatible ),
file('<stdin>',box_compatible) ).
fof(c_0_17,axiom,
! [X11,X12] :
( ( is_verdict(X11)
& is_verdict(X12)
& ( X11 = conflict
| X12 = conflict ) )
=> box_verdict(X11,X12) = conflict ),
file('<stdin>',box_conflict) ).
fof(c_0_18,axiom,
! [X1,X2] :
( less(X1,X2)
| X1 = X2
| less(X2,X1) ),
file('<stdin>',trichotomy) ).
fof(c_0_19,axiom,
! [X1] : ~ less(X1,X1),
file('<stdin>',irreflexive) ).
fof(c_0_20,axiom,
! [X10] :
( is_verdict(X10)
=> ( X10 = conflict
| X10 = compatible
| X10 = unknown ) ),
file('<stdin>',verdict_enum) ).
fof(c_0_21,axiom,
less(v800,v1200),
file('<stdin>',ord_v800_v1200) ).
fof(c_0_22,axiom,
less(v600,v1200),
file('<stdin>',ord_v600_v1200) ).
fof(c_0_23,axiom,
less(v600,v800),
file('<stdin>',ord_v600_v800) ).
fof(c_0_24,axiom,
less(v200,v1200),
file('<stdin>',ord_v200_v1200) ).
fof(c_0_25,axiom,
less(v200,v800),
file('<stdin>',ord_v200_v800) ).
fof(c_0_26,axiom,
less(v200,v600),
file('<stdin>',ord_v200_v600) ).
fof(c_0_27,axiom,
less(v32,v1200),
file('<stdin>',ord_v32_v1200) ).
fof(c_0_28,axiom,
less(v32,v800),
file('<stdin>',ord_v32_v800) ).
fof(c_0_29,axiom,
less(v32,v600),
file('<stdin>',ord_v32_v600) ).
fof(c_0_30,axiom,
less(v32,v200),
file('<stdin>',ord_v32_v200) ).
fof(c_0_31,axiom,
less(v8,v1200),
file('<stdin>',ord_v8_v1200) ).
fof(c_0_32,axiom,
less(v8,v800),
file('<stdin>',ord_v8_v800) ).
fof(c_0_33,axiom,
less(v8,v600),
file('<stdin>',ord_v8_v600) ).
fof(c_0_34,axiom,
less(v8,v200),
file('<stdin>',ord_v8_v200) ).
fof(c_0_35,axiom,
less(v8,v32),
file('<stdin>',ord_v8_v32) ).
fof(c_0_36,axiom,
less(v0,v1200),
file('<stdin>',ord_v0_v1200) ).
fof(c_0_37,axiom,
less(v0,v800),
file('<stdin>',ord_v0_v800) ).
fof(c_0_38,axiom,
less(v0,v600),
file('<stdin>',ord_v0_v600) ).
fof(c_0_39,axiom,
less(v0,v200),
file('<stdin>',ord_v0_v200) ).
fof(c_0_40,axiom,
less(v0,v32),
file('<stdin>',ord_v0_v32) ).
fof(c_0_41,axiom,
less(v0,v8),
file('<stdin>',ord_v0_v8) ).
fof(c_0_42,axiom,
val(v1200),
file('<stdin>',val_v1200) ).
fof(c_0_43,axiom,
val(v800),
file('<stdin>',val_v800) ).
fof(c_0_44,axiom,
val(v600),
file('<stdin>',val_v600) ).
fof(c_0_45,axiom,
val(v200),
file('<stdin>',val_v200) ).
fof(c_0_46,axiom,
val(v32),
file('<stdin>',val_v32) ).
fof(c_0_47,axiom,
val(v8),
file('<stdin>',val_v8) ).
fof(c_0_48,axiom,
val(v0),
file('<stdin>',val_v0) ).
fof(c_0_49,axiom,
is_verdict(unknown),
file('<stdin>',unknown_is_verdict) ).
fof(c_0_50,axiom,
is_verdict(compatible),
file('<stdin>',compatible_is_verdict) ).
fof(c_0_51,axiom,
is_verdict(conflict),
file('<stdin>',conflict_is_verdict) ).
fof(c_0_52,axiom,
( v0 != v8
& v0 != v32
& v0 != v200
& v0 != v600
& v0 != v800
& v0 != v1200
& v8 != v32
& v8 != v200
& v8 != v600
& v8 != v800
& v8 != v1200
& v32 != v200
& v32 != v600
& v32 != v800
& v32 != v1200
& v200 != v600
& v200 != v800
& v200 != v1200
& v600 != v800
& v600 != v1200
& v800 != v1200 ),
file('<stdin>',distinct) ).
fof(c_0_53,axiom,
compatible != unknown,
file('<stdin>',verdicts_distinct_cp_un) ).
fof(c_0_54,axiom,
conflict != unknown,
file('<stdin>',verdicts_distinct_cf_un) ).
fof(c_0_55,axiom,
conflict != compatible,
file('<stdin>',verdicts_distinct_cf_cp) ).
fof(c_0_56,axiom,
! [X6,X7,X8,X9] :
( axis_subsumes(X6,X7,X8,X9)
<=> ! [X1] :
( in_closed(X1,X6,X7)
=> in_closed(X1,X8,X9) ) ),
c_0_0 ).
fof(c_0_57,axiom,
! [X6,X7,X8,X9] :
( axis_compatible(X6,X7,X8,X9)
<=> ? [X1] :
( in_closed(X1,X6,X7)
& in_closed(X1,X8,X9) ) ),
c_0_1 ).
fof(c_0_58,axiom,
! [X6,X7,X8,X9] :
( axis_conflict(X6,X7,X8,X9)
<=> ~ ? [X1] :
( in_closed(X1,X6,X7)
& in_closed(X1,X8,X9) ) ),
c_0_2 ).
fof(c_0_59,axiom,
! [X1,X4,X5] :
( in_open(X1,X4,X5)
<=> ( less(X4,X1)
& less(X1,X5) ) ),
c_0_3 ).
fof(c_0_60,axiom,
! [X1,X4,X5] :
( in_ropen(X1,X4,X5)
<=> ( leq(X4,X1)
& less(X1,X5) ) ),
c_0_4 ).
fof(c_0_61,axiom,
! [X1,X4,X5] :
( in_lopen(X1,X4,X5)
<=> ( less(X4,X1)
& leq(X1,X5) ) ),
c_0_5 ).
fof(c_0_62,axiom,
! [X1,X4,X5] :
( in_closed(X1,X4,X5)
<=> ( leq(X4,X1)
& leq(X1,X5) ) ),
c_0_6 ).
fof(c_0_63,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
c_0_7 ).
fof(c_0_64,axiom,
! [X1,X2,X3] :
( ( less(X1,X2)
& leq(X2,X3) )
=> less(X1,X3) ),
c_0_8 ).
fof(c_0_65,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& less(X2,X3) )
=> less(X1,X3) ),
c_0_9 ).
fof(c_0_66,axiom,
! [X1,X2,X3] :
( ( less(X1,X2)
& less(X2,X3) )
=> less(X1,X3) ),
c_0_10 ).
fof(c_0_67,axiom,
! [X11,X12] :
( ( is_verdict(X11)
& is_verdict(X12) )
=> ( box_verdict(X11,X12) = conflict
| box_verdict(X11,X12) = compatible
| box_verdict(X11,X12) = unknown ) ),
c_0_11 ).
fof(c_0_68,axiom,
! [X1,X2] :
( ( leq(X1,X2)
& leq(X2,X1) )
=> X1 = X2 ),
c_0_12 ).
fof(c_0_69,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> ( less(X1,X2)
| X1 = X2 ) ),
c_0_13 ).
fof(c_0_70,axiom,
! [X1,X2] :
( less(X1,X2)
=> leq(X1,X2) ),
c_0_14 ).
fof(c_0_71,axiom,
! [X11,X12] :
( ( is_verdict(X11)
& is_verdict(X12)
& ( X11 = unknown
| X12 = unknown )
& X11 != conflict
& X12 != conflict )
=> box_verdict(X11,X12) = unknown ),
c_0_15 ).
fof(c_0_72,axiom,
! [X11,X12] :
( ( is_verdict(X11)
& is_verdict(X12)
& X11 = compatible
& X12 = compatible )
=> box_verdict(X11,X12) = compatible ),
c_0_16 ).
fof(c_0_73,axiom,
! [X11,X12] :
( ( is_verdict(X11)
& is_verdict(X12)
& ( X11 = conflict
| X12 = conflict ) )
=> box_verdict(X11,X12) = conflict ),
c_0_17 ).
fof(c_0_74,axiom,
! [X1,X2] :
( less(X1,X2)
| X1 = X2
| less(X2,X1) ),
c_0_18 ).
fof(c_0_75,plain,
! [X1] : ~ less(X1,X1),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
fof(c_0_76,axiom,
! [X10] :
( is_verdict(X10)
=> ( X10 = conflict
| X10 = compatible
| X10 = unknown ) ),
c_0_20 ).
fof(c_0_77,axiom,
less(v800,v1200),
c_0_21 ).
fof(c_0_78,axiom,
less(v600,v1200),
c_0_22 ).
fof(c_0_79,axiom,
less(v600,v800),
c_0_23 ).
fof(c_0_80,axiom,
less(v200,v1200),
c_0_24 ).
fof(c_0_81,axiom,
less(v200,v800),
c_0_25 ).
fof(c_0_82,axiom,
less(v200,v600),
c_0_26 ).
fof(c_0_83,axiom,
less(v32,v1200),
c_0_27 ).
fof(c_0_84,axiom,
less(v32,v800),
c_0_28 ).
fof(c_0_85,axiom,
less(v32,v600),
c_0_29 ).
fof(c_0_86,axiom,
less(v32,v200),
c_0_30 ).
fof(c_0_87,axiom,
less(v8,v1200),
c_0_31 ).
fof(c_0_88,axiom,
less(v8,v800),
c_0_32 ).
fof(c_0_89,axiom,
less(v8,v600),
c_0_33 ).
fof(c_0_90,axiom,
less(v8,v200),
c_0_34 ).
fof(c_0_91,axiom,
less(v8,v32),
c_0_35 ).
fof(c_0_92,axiom,
less(v0,v1200),
c_0_36 ).
fof(c_0_93,axiom,
less(v0,v800),
c_0_37 ).
fof(c_0_94,axiom,
less(v0,v600),
c_0_38 ).
fof(c_0_95,axiom,
less(v0,v200),
c_0_39 ).
fof(c_0_96,axiom,
less(v0,v32),
c_0_40 ).
fof(c_0_97,axiom,
less(v0,v8),
c_0_41 ).
fof(c_0_98,axiom,
val(v1200),
c_0_42 ).
fof(c_0_99,axiom,
val(v800),
c_0_43 ).
fof(c_0_100,axiom,
val(v600),
c_0_44 ).
fof(c_0_101,axiom,
val(v200),
c_0_45 ).
fof(c_0_102,axiom,
val(v32),
c_0_46 ).
fof(c_0_103,axiom,
val(v8),
c_0_47 ).
fof(c_0_104,axiom,
val(v0),
c_0_48 ).
fof(c_0_105,axiom,
is_verdict(unknown),
c_0_49 ).
fof(c_0_106,axiom,
is_verdict(compatible),
c_0_50 ).
fof(c_0_107,axiom,
is_verdict(conflict),
c_0_51 ).
fof(c_0_108,axiom,
( v0 != v8
& v0 != v32
& v0 != v200
& v0 != v600
& v0 != v800
& v0 != v1200
& v8 != v32
& v8 != v200
& v8 != v600
& v8 != v800
& v8 != v1200
& v32 != v200
& v32 != v600
& v32 != v800
& v32 != v1200
& v200 != v600
& v200 != v800
& v200 != v1200
& v600 != v800
& v600 != v1200
& v800 != v1200 ),
c_0_52 ).
fof(c_0_109,axiom,
compatible != unknown,
c_0_53 ).
fof(c_0_110,axiom,
conflict != unknown,
c_0_54 ).
fof(c_0_111,axiom,
conflict != compatible,
c_0_55 ).
fof(c_0_112,plain,
! [X10,X11,X12,X13,X14,X15,X16,X17,X18] :
( ( ~ axis_subsumes(X10,X11,X12,X13)
| ~ in_closed(X14,X10,X11)
| in_closed(X14,X12,X13) )
& ( in_closed(esk3_4(X15,X16,X17,X18),X15,X16)
| axis_subsumes(X15,X16,X17,X18) )
& ( ~ in_closed(esk3_4(X15,X16,X17,X18),X17,X18)
| axis_subsumes(X15,X16,X17,X18) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_56])])])])])]) ).
fof(c_0_113,plain,
! [X10,X11,X12,X13,X15,X16,X17,X18,X19] :
( ( in_closed(esk2_4(X10,X11,X12,X13),X10,X11)
| ~ axis_compatible(X10,X11,X12,X13) )
& ( in_closed(esk2_4(X10,X11,X12,X13),X12,X13)
| ~ axis_compatible(X10,X11,X12,X13) )
& ( ~ in_closed(X19,X15,X16)
| ~ in_closed(X19,X17,X18)
| axis_compatible(X15,X16,X17,X18) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_57])])])])])]) ).
fof(c_0_114,plain,
! [X10,X11,X12,X13,X14,X15,X16,X17,X18] :
( ( ~ axis_conflict(X10,X11,X12,X13)
| ~ in_closed(X14,X10,X11)
| ~ in_closed(X14,X12,X13) )
& ( in_closed(esk1_4(X15,X16,X17,X18),X15,X16)
| axis_conflict(X15,X16,X17,X18) )
& ( in_closed(esk1_4(X15,X16,X17,X18),X17,X18)
| axis_conflict(X15,X16,X17,X18) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_58])])])])])]) ).
fof(c_0_115,plain,
! [X6,X7,X8,X9,X10,X11] :
( ( less(X7,X6)
| ~ in_open(X6,X7,X8) )
& ( less(X6,X8)
| ~ in_open(X6,X7,X8) )
& ( ~ less(X10,X9)
| ~ less(X9,X11)
| in_open(X9,X10,X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_59])])])])]) ).
fof(c_0_116,plain,
! [X6,X7,X8,X9,X10,X11] :
( ( leq(X7,X6)
| ~ in_ropen(X6,X7,X8) )
& ( less(X6,X8)
| ~ in_ropen(X6,X7,X8) )
& ( ~ leq(X10,X9)
| ~ less(X9,X11)
| in_ropen(X9,X10,X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_60])])])])]) ).
fof(c_0_117,plain,
! [X6,X7,X8,X9,X10,X11] :
( ( less(X7,X6)
| ~ in_lopen(X6,X7,X8) )
& ( leq(X6,X8)
| ~ in_lopen(X6,X7,X8) )
& ( ~ less(X10,X9)
| ~ leq(X9,X11)
| in_lopen(X9,X10,X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_61])])])])]) ).
fof(c_0_118,plain,
! [X6,X7,X8,X9,X10,X11] :
( ( leq(X7,X6)
| ~ in_closed(X6,X7,X8) )
& ( leq(X6,X8)
| ~ in_closed(X6,X7,X8) )
& ( ~ leq(X10,X9)
| ~ leq(X9,X11)
| in_closed(X9,X10,X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_62])])])])]) ).
fof(c_0_119,plain,
! [X4,X5,X6] :
( ~ leq(X4,X5)
| ~ leq(X5,X6)
| leq(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_63])]) ).
fof(c_0_120,plain,
! [X4,X5,X6] :
( ~ less(X4,X5)
| ~ leq(X5,X6)
| less(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_64])]) ).
fof(c_0_121,plain,
! [X4,X5,X6] :
( ~ leq(X4,X5)
| ~ less(X5,X6)
| less(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_65])]) ).
fof(c_0_122,plain,
! [X4,X5,X6] :
( ~ less(X4,X5)
| ~ less(X5,X6)
| less(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_66])]) ).
fof(c_0_123,plain,
! [X13,X14] :
( ~ is_verdict(X13)
| ~ is_verdict(X14)
| box_verdict(X13,X14) = conflict
| box_verdict(X13,X14) = compatible
| box_verdict(X13,X14) = unknown ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_67])]) ).
fof(c_0_124,plain,
! [X3,X4] :
( ~ leq(X3,X4)
| ~ leq(X4,X3)
| X3 = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_68])]) ).
fof(c_0_125,plain,
! [X3,X4,X5,X6] :
( ( ~ leq(X3,X4)
| less(X3,X4)
| X3 = X4 )
& ( ~ less(X5,X6)
| leq(X5,X6) )
& ( X5 != X6
| leq(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_69])])])])]) ).
fof(c_0_126,plain,
! [X3,X4] :
( ~ less(X3,X4)
| leq(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_70])]) ).
fof(c_0_127,plain,
! [X13,X14] :
( ( X13 != unknown
| X13 = conflict
| X14 = conflict
| ~ is_verdict(X14)
| ~ is_verdict(X13)
| box_verdict(X13,X14) = unknown )
& ( X14 != unknown
| X13 = conflict
| X14 = conflict
| ~ is_verdict(X14)
| ~ is_verdict(X13)
| box_verdict(X13,X14) = unknown ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_71])])]) ).
fof(c_0_128,plain,
! [X13,X14] :
( ~ is_verdict(X13)
| ~ is_verdict(X14)
| X13 != compatible
| X14 != compatible
| box_verdict(X13,X14) = compatible ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_72])]) ).
fof(c_0_129,plain,
! [X13,X14] :
( ( X13 != conflict
| ~ is_verdict(X14)
| ~ is_verdict(X13)
| box_verdict(X13,X14) = conflict )
& ( X14 != conflict
| ~ is_verdict(X14)
| ~ is_verdict(X13)
| box_verdict(X13,X14) = conflict ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_73])])]) ).
fof(c_0_130,plain,
! [X3,X4] :
( less(X3,X4)
| X3 = X4
| less(X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_74]) ).
fof(c_0_131,plain,
! [X2] : ~ less(X2,X2),
inference(variable_rename,[status(thm)],[c_0_75]) ).
fof(c_0_132,plain,
! [X11] :
( ~ is_verdict(X11)
| X11 = conflict
| X11 = compatible
| X11 = unknown ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_76])]) ).
fof(c_0_133,axiom,
less(v800,v1200),
c_0_77 ).
fof(c_0_134,axiom,
less(v600,v1200),
c_0_78 ).
fof(c_0_135,axiom,
less(v600,v800),
c_0_79 ).
fof(c_0_136,axiom,
less(v200,v1200),
c_0_80 ).
fof(c_0_137,axiom,
less(v200,v800),
c_0_81 ).
fof(c_0_138,axiom,
less(v200,v600),
c_0_82 ).
fof(c_0_139,axiom,
less(v32,v1200),
c_0_83 ).
fof(c_0_140,axiom,
less(v32,v800),
c_0_84 ).
fof(c_0_141,axiom,
less(v32,v600),
c_0_85 ).
fof(c_0_142,axiom,
less(v32,v200),
c_0_86 ).
fof(c_0_143,axiom,
less(v8,v1200),
c_0_87 ).
fof(c_0_144,axiom,
less(v8,v800),
c_0_88 ).
fof(c_0_145,axiom,
less(v8,v600),
c_0_89 ).
fof(c_0_146,axiom,
less(v8,v200),
c_0_90 ).
fof(c_0_147,axiom,
less(v8,v32),
c_0_91 ).
fof(c_0_148,axiom,
less(v0,v1200),
c_0_92 ).
fof(c_0_149,axiom,
less(v0,v800),
c_0_93 ).
fof(c_0_150,axiom,
less(v0,v600),
c_0_94 ).
fof(c_0_151,axiom,
less(v0,v200),
c_0_95 ).
fof(c_0_152,axiom,
less(v0,v32),
c_0_96 ).
fof(c_0_153,axiom,
less(v0,v8),
c_0_97 ).
fof(c_0_154,axiom,
val(v1200),
c_0_98 ).
fof(c_0_155,axiom,
val(v800),
c_0_99 ).
fof(c_0_156,axiom,
val(v600),
c_0_100 ).
fof(c_0_157,axiom,
val(v200),
c_0_101 ).
fof(c_0_158,axiom,
val(v32),
c_0_102 ).
fof(c_0_159,axiom,
val(v8),
c_0_103 ).
fof(c_0_160,axiom,
val(v0),
c_0_104 ).
fof(c_0_161,axiom,
is_verdict(unknown),
c_0_105 ).
fof(c_0_162,axiom,
is_verdict(compatible),
c_0_106 ).
fof(c_0_163,axiom,
is_verdict(conflict),
c_0_107 ).
fof(c_0_164,axiom,
( v0 != v8
& v0 != v32
& v0 != v200
& v0 != v600
& v0 != v800
& v0 != v1200
& v8 != v32
& v8 != v200
& v8 != v600
& v8 != v800
& v8 != v1200
& v32 != v200
& v32 != v600
& v32 != v800
& v32 != v1200
& v200 != v600
& v200 != v800
& v200 != v1200
& v600 != v800
& v600 != v1200
& v800 != v1200 ),
c_0_108 ).
fof(c_0_165,axiom,
compatible != unknown,
c_0_109 ).
fof(c_0_166,axiom,
conflict != unknown,
c_0_110 ).
fof(c_0_167,axiom,
conflict != compatible,
c_0_111 ).
cnf(c_0_168,plain,
( axis_subsumes(X1,X2,X3,X4)
| ~ in_closed(esk3_4(X1,X2,X3,X4),X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_112]) ).
cnf(c_0_169,plain,
( in_closed(esk2_4(X1,X2,X3,X4),X1,X2)
| ~ axis_compatible(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_170,plain,
( in_closed(esk2_4(X1,X2,X3,X4),X3,X4)
| ~ axis_compatible(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_171,plain,
( axis_subsumes(X1,X2,X3,X4)
| in_closed(esk3_4(X1,X2,X3,X4),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_112]) ).
cnf(c_0_172,plain,
( axis_conflict(X1,X2,X3,X4)
| in_closed(esk1_4(X1,X2,X3,X4),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_114]) ).
cnf(c_0_173,plain,
( axis_conflict(X1,X2,X3,X4)
| in_closed(esk1_4(X1,X2,X3,X4),X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_114]) ).
cnf(c_0_174,plain,
( ~ in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5)
| ~ axis_conflict(X4,X5,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_114]) ).
cnf(c_0_175,plain,
( in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5)
| ~ axis_subsumes(X4,X5,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_112]) ).
cnf(c_0_176,plain,
( axis_compatible(X1,X2,X3,X4)
| ~ in_closed(X5,X3,X4)
| ~ in_closed(X5,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_177,plain,
( less(X2,X1)
| ~ in_open(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_115]) ).
cnf(c_0_178,plain,
( less(X1,X3)
| ~ in_open(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_115]) ).
cnf(c_0_179,plain,
( leq(X2,X1)
| ~ in_ropen(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_180,plain,
( less(X1,X3)
| ~ in_ropen(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_181,plain,
( less(X2,X1)
| ~ in_lopen(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_117]) ).
cnf(c_0_182,plain,
( leq(X1,X3)
| ~ in_lopen(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_117]) ).
cnf(c_0_183,plain,
( leq(X2,X1)
| ~ in_closed(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_184,plain,
( leq(X1,X3)
| ~ in_closed(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_185,plain,
( in_open(X1,X2,X3)
| ~ less(X1,X3)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_115]) ).
cnf(c_0_186,plain,
( in_ropen(X1,X2,X3)
| ~ less(X1,X3)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_187,plain,
( in_lopen(X1,X2,X3)
| ~ leq(X1,X3)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_117]) ).
cnf(c_0_188,plain,
( in_closed(X1,X2,X3)
| ~ leq(X1,X3)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_189,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_190,plain,
( less(X1,X2)
| ~ leq(X3,X2)
| ~ less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_120]) ).
cnf(c_0_191,plain,
( less(X1,X2)
| ~ less(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_121]) ).
cnf(c_0_192,plain,
( less(X1,X2)
| ~ less(X3,X2)
| ~ less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_122]) ).
cnf(c_0_193,plain,
( box_verdict(X1,X2) = unknown
| box_verdict(X1,X2) = compatible
| box_verdict(X1,X2) = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(split_conjunct,[status(thm)],[c_0_123]) ).
cnf(c_0_194,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
cnf(c_0_195,plain,
( X1 = X2
| less(X1,X2)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_196,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_126]) ).
cnf(c_0_197,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_198,plain,
( box_verdict(X1,X2) = unknown
| X2 = conflict
| X1 = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != unknown ),
inference(split_conjunct,[status(thm)],[c_0_127]) ).
cnf(c_0_199,plain,
( box_verdict(X1,X2) = unknown
| X2 = conflict
| X1 = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X2 != unknown ),
inference(split_conjunct,[status(thm)],[c_0_127]) ).
cnf(c_0_200,plain,
( box_verdict(X1,X2) = compatible
| X2 != compatible
| X1 != compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(split_conjunct,[status(thm)],[c_0_128]) ).
cnf(c_0_201,plain,
( box_verdict(X1,X2) = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != conflict ),
inference(split_conjunct,[status(thm)],[c_0_129]) ).
cnf(c_0_202,plain,
( box_verdict(X1,X2) = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X2 != conflict ),
inference(split_conjunct,[status(thm)],[c_0_129]) ).
cnf(c_0_203,plain,
( less(X1,X2)
| X2 = X1
| less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_130]) ).
cnf(c_0_204,plain,
~ less(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_131]) ).
cnf(c_0_205,plain,
( leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_206,plain,
( X1 = unknown
| X1 = compatible
| X1 = conflict
| ~ is_verdict(X1) ),
inference(split_conjunct,[status(thm)],[c_0_132]) ).
cnf(c_0_207,plain,
less(v800,v1200),
inference(split_conjunct,[status(thm)],[c_0_133]) ).
cnf(c_0_208,plain,
less(v600,v1200),
inference(split_conjunct,[status(thm)],[c_0_134]) ).
cnf(c_0_209,plain,
less(v600,v800),
inference(split_conjunct,[status(thm)],[c_0_135]) ).
cnf(c_0_210,plain,
less(v200,v1200),
inference(split_conjunct,[status(thm)],[c_0_136]) ).
cnf(c_0_211,plain,
less(v200,v800),
inference(split_conjunct,[status(thm)],[c_0_137]) ).
cnf(c_0_212,plain,
less(v200,v600),
inference(split_conjunct,[status(thm)],[c_0_138]) ).
cnf(c_0_213,plain,
less(v32,v1200),
inference(split_conjunct,[status(thm)],[c_0_139]) ).
cnf(c_0_214,plain,
less(v32,v800),
inference(split_conjunct,[status(thm)],[c_0_140]) ).
cnf(c_0_215,plain,
less(v32,v600),
inference(split_conjunct,[status(thm)],[c_0_141]) ).
cnf(c_0_216,plain,
less(v32,v200),
inference(split_conjunct,[status(thm)],[c_0_142]) ).
cnf(c_0_217,plain,
less(v8,v1200),
inference(split_conjunct,[status(thm)],[c_0_143]) ).
cnf(c_0_218,plain,
less(v8,v800),
inference(split_conjunct,[status(thm)],[c_0_144]) ).
cnf(c_0_219,plain,
less(v8,v600),
inference(split_conjunct,[status(thm)],[c_0_145]) ).
cnf(c_0_220,plain,
less(v8,v200),
inference(split_conjunct,[status(thm)],[c_0_146]) ).
cnf(c_0_221,plain,
less(v8,v32),
inference(split_conjunct,[status(thm)],[c_0_147]) ).
cnf(c_0_222,plain,
less(v0,v1200),
inference(split_conjunct,[status(thm)],[c_0_148]) ).
cnf(c_0_223,plain,
less(v0,v800),
inference(split_conjunct,[status(thm)],[c_0_149]) ).
cnf(c_0_224,plain,
less(v0,v600),
inference(split_conjunct,[status(thm)],[c_0_150]) ).
cnf(c_0_225,plain,
less(v0,v200),
inference(split_conjunct,[status(thm)],[c_0_151]) ).
cnf(c_0_226,plain,
less(v0,v32),
inference(split_conjunct,[status(thm)],[c_0_152]) ).
cnf(c_0_227,plain,
less(v0,v8),
inference(split_conjunct,[status(thm)],[c_0_153]) ).
cnf(c_0_228,plain,
val(v1200),
inference(split_conjunct,[status(thm)],[c_0_154]) ).
cnf(c_0_229,plain,
val(v800),
inference(split_conjunct,[status(thm)],[c_0_155]) ).
cnf(c_0_230,plain,
val(v600),
inference(split_conjunct,[status(thm)],[c_0_156]) ).
cnf(c_0_231,plain,
val(v200),
inference(split_conjunct,[status(thm)],[c_0_157]) ).
cnf(c_0_232,plain,
val(v32),
inference(split_conjunct,[status(thm)],[c_0_158]) ).
cnf(c_0_233,plain,
val(v8),
inference(split_conjunct,[status(thm)],[c_0_159]) ).
cnf(c_0_234,plain,
val(v0),
inference(split_conjunct,[status(thm)],[c_0_160]) ).
cnf(c_0_235,plain,
is_verdict(unknown),
inference(split_conjunct,[status(thm)],[c_0_161]) ).
cnf(c_0_236,plain,
is_verdict(compatible),
inference(split_conjunct,[status(thm)],[c_0_162]) ).
cnf(c_0_237,plain,
is_verdict(conflict),
inference(split_conjunct,[status(thm)],[c_0_163]) ).
cnf(c_0_238,plain,
v0 != v8,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_239,plain,
v0 != v32,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_240,plain,
v0 != v200,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_241,plain,
v0 != v600,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_242,plain,
v0 != v800,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_243,plain,
v0 != v1200,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_244,plain,
v8 != v32,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_245,plain,
v8 != v200,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_246,plain,
v8 != v600,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_247,plain,
v8 != v800,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_248,plain,
v8 != v1200,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_249,plain,
v32 != v200,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_250,plain,
v32 != v600,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_251,plain,
v32 != v800,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_252,plain,
v32 != v1200,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_253,plain,
v200 != v600,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_254,plain,
v200 != v800,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_255,plain,
v200 != v1200,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_256,plain,
v600 != v800,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_257,plain,
v600 != v1200,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_258,plain,
v800 != v1200,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_259,plain,
compatible != unknown,
inference(split_conjunct,[status(thm)],[c_0_165]) ).
cnf(c_0_260,plain,
conflict != unknown,
inference(split_conjunct,[status(thm)],[c_0_166]) ).
cnf(c_0_261,plain,
conflict != compatible,
inference(split_conjunct,[status(thm)],[c_0_167]) ).
cnf(c_0_262,plain,
( axis_subsumes(X1,X2,X3,X4)
| ~ in_closed(esk3_4(X1,X2,X3,X4),X3,X4) ),
c_0_168,
[final] ).
cnf(c_0_263,plain,
( in_closed(esk2_4(X1,X2,X3,X4),X1,X2)
| ~ axis_compatible(X1,X2,X3,X4) ),
c_0_169,
[final] ).
cnf(c_0_264,plain,
( in_closed(esk2_4(X1,X2,X3,X4),X3,X4)
| ~ axis_compatible(X1,X2,X3,X4) ),
c_0_170,
[final] ).
cnf(c_0_265,plain,
( axis_subsumes(X1,X2,X3,X4)
| in_closed(esk3_4(X1,X2,X3,X4),X1,X2) ),
c_0_171,
[final] ).
cnf(c_0_266,plain,
( axis_conflict(X1,X2,X3,X4)
| in_closed(esk1_4(X1,X2,X3,X4),X1,X2) ),
c_0_172,
[final] ).
cnf(c_0_267,plain,
( axis_conflict(X1,X2,X3,X4)
| in_closed(esk1_4(X1,X2,X3,X4),X3,X4) ),
c_0_173,
[final] ).
cnf(c_0_268,plain,
( ~ in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5)
| ~ axis_conflict(X4,X5,X2,X3) ),
c_0_174,
[final] ).
cnf(c_0_269,plain,
( in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5)
| ~ axis_subsumes(X4,X5,X2,X3) ),
c_0_175,
[final] ).
cnf(c_0_270,plain,
( axis_compatible(X1,X2,X3,X4)
| ~ in_closed(X5,X3,X4)
| ~ in_closed(X5,X1,X2) ),
c_0_176,
[final] ).
cnf(c_0_271,plain,
( less(X2,X1)
| ~ in_open(X1,X2,X3) ),
c_0_177,
[final] ).
cnf(c_0_272,plain,
( less(X1,X3)
| ~ in_open(X1,X2,X3) ),
c_0_178,
[final] ).
cnf(c_0_273,plain,
( leq(X2,X1)
| ~ in_ropen(X1,X2,X3) ),
c_0_179,
[final] ).
cnf(c_0_274,plain,
( less(X1,X3)
| ~ in_ropen(X1,X2,X3) ),
c_0_180,
[final] ).
cnf(c_0_275,plain,
( less(X2,X1)
| ~ in_lopen(X1,X2,X3) ),
c_0_181,
[final] ).
cnf(c_0_276,plain,
( leq(X1,X3)
| ~ in_lopen(X1,X2,X3) ),
c_0_182,
[final] ).
cnf(c_0_277,plain,
( leq(X2,X1)
| ~ in_closed(X1,X2,X3) ),
c_0_183,
[final] ).
cnf(c_0_278,plain,
( leq(X1,X3)
| ~ in_closed(X1,X2,X3) ),
c_0_184,
[final] ).
cnf(c_0_279,plain,
( in_open(X1,X2,X3)
| ~ less(X1,X3)
| ~ less(X2,X1) ),
c_0_185,
[final] ).
cnf(c_0_280,plain,
( in_ropen(X1,X2,X3)
| ~ less(X1,X3)
| ~ leq(X2,X1) ),
c_0_186,
[final] ).
cnf(c_0_281,plain,
( in_lopen(X1,X2,X3)
| ~ leq(X1,X3)
| ~ less(X2,X1) ),
c_0_187,
[final] ).
cnf(c_0_282,plain,
( in_closed(X1,X2,X3)
| ~ leq(X1,X3)
| ~ leq(X2,X1) ),
c_0_188,
[final] ).
cnf(c_0_283,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
c_0_189,
[final] ).
cnf(c_0_284,plain,
( less(X1,X2)
| ~ leq(X3,X2)
| ~ less(X1,X3) ),
c_0_190,
[final] ).
cnf(c_0_285,plain,
( less(X1,X2)
| ~ less(X3,X2)
| ~ leq(X1,X3) ),
c_0_191,
[final] ).
cnf(c_0_286,plain,
( less(X1,X2)
| ~ less(X3,X2)
| ~ less(X1,X3) ),
c_0_192,
[final] ).
cnf(c_0_287,plain,
( box_verdict(X1,X2) = unknown
| box_verdict(X1,X2) = compatible
| box_verdict(X1,X2) = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
c_0_193,
[final] ).
cnf(c_0_288,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
c_0_194,
[final] ).
cnf(c_0_289,plain,
( X1 = X2
| less(X1,X2)
| ~ leq(X1,X2) ),
c_0_195,
[final] ).
cnf(c_0_290,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
c_0_196,
[final] ).
cnf(c_0_291,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
c_0_197,
[final] ).
cnf(c_0_292,plain,
( box_verdict(X1,X2) = unknown
| X2 = conflict
| X1 = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != unknown ),
c_0_198,
[final] ).
cnf(c_0_293,plain,
( box_verdict(X1,X2) = unknown
| X2 = conflict
| X1 = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X2 != unknown ),
c_0_199,
[final] ).
cnf(c_0_294,plain,
( box_verdict(X1,X2) = compatible
| X2 != compatible
| X1 != compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
c_0_200,
[final] ).
cnf(c_0_295,plain,
( box_verdict(X1,X2) = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != conflict ),
c_0_201,
[final] ).
cnf(c_0_296,plain,
( box_verdict(X1,X2) = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X2 != conflict ),
c_0_202,
[final] ).
cnf(c_0_297,plain,
( less(X1,X2)
| X2 = X1
| less(X2,X1) ),
c_0_203,
[final] ).
cnf(c_0_298,plain,
~ less(X1,X1),
c_0_204,
[final] ).
cnf(c_0_299,plain,
( leq(X1,X2)
| X1 != X2 ),
c_0_205,
[final] ).
cnf(c_0_300,plain,
( X1 = unknown
| X1 = compatible
| X1 = conflict
| ~ is_verdict(X1) ),
c_0_206,
[final] ).
cnf(c_0_301,plain,
less(v800,v1200),
c_0_207,
[final] ).
cnf(c_0_302,plain,
less(v600,v1200),
c_0_208,
[final] ).
cnf(c_0_303,plain,
less(v600,v800),
c_0_209,
[final] ).
cnf(c_0_304,plain,
less(v200,v1200),
c_0_210,
[final] ).
cnf(c_0_305,plain,
less(v200,v800),
c_0_211,
[final] ).
cnf(c_0_306,plain,
less(v200,v600),
c_0_212,
[final] ).
cnf(c_0_307,plain,
less(v32,v1200),
c_0_213,
[final] ).
cnf(c_0_308,plain,
less(v32,v800),
c_0_214,
[final] ).
cnf(c_0_309,plain,
less(v32,v600),
c_0_215,
[final] ).
cnf(c_0_310,plain,
less(v32,v200),
c_0_216,
[final] ).
cnf(c_0_311,plain,
less(v8,v1200),
c_0_217,
[final] ).
cnf(c_0_312,plain,
less(v8,v800),
c_0_218,
[final] ).
cnf(c_0_313,plain,
less(v8,v600),
c_0_219,
[final] ).
cnf(c_0_314,plain,
less(v8,v200),
c_0_220,
[final] ).
cnf(c_0_315,plain,
less(v8,v32),
c_0_221,
[final] ).
cnf(c_0_316,plain,
less(v0,v1200),
c_0_222,
[final] ).
cnf(c_0_317,plain,
less(v0,v800),
c_0_223,
[final] ).
cnf(c_0_318,plain,
less(v0,v600),
c_0_224,
[final] ).
cnf(c_0_319,plain,
less(v0,v200),
c_0_225,
[final] ).
cnf(c_0_320,plain,
less(v0,v32),
c_0_226,
[final] ).
cnf(c_0_321,plain,
less(v0,v8),
c_0_227,
[final] ).
cnf(c_0_322,plain,
val(v1200),
c_0_228,
[final] ).
cnf(c_0_323,plain,
val(v800),
c_0_229,
[final] ).
cnf(c_0_324,plain,
val(v600),
c_0_230,
[final] ).
cnf(c_0_325,plain,
val(v200),
c_0_231,
[final] ).
cnf(c_0_326,plain,
val(v32),
c_0_232,
[final] ).
cnf(c_0_327,plain,
val(v8),
c_0_233,
[final] ).
cnf(c_0_328,plain,
val(v0),
c_0_234,
[final] ).
cnf(c_0_329,plain,
is_verdict(unknown),
c_0_235,
[final] ).
cnf(c_0_330,plain,
is_verdict(compatible),
c_0_236,
[final] ).
cnf(c_0_331,plain,
is_verdict(conflict),
c_0_237,
[final] ).
cnf(c_0_332,plain,
v8 != v0,
c_0_238,
[final] ).
cnf(c_0_333,plain,
v32 != v0,
c_0_239,
[final] ).
cnf(c_0_334,plain,
v200 != v0,
c_0_240,
[final] ).
cnf(c_0_335,plain,
v600 != v0,
c_0_241,
[final] ).
cnf(c_0_336,plain,
v800 != v0,
c_0_242,
[final] ).
cnf(c_0_337,plain,
v1200 != v0,
c_0_243,
[final] ).
cnf(c_0_338,plain,
v32 != v8,
c_0_244,
[final] ).
cnf(c_0_339,plain,
v200 != v8,
c_0_245,
[final] ).
cnf(c_0_340,plain,
v600 != v8,
c_0_246,
[final] ).
cnf(c_0_341,plain,
v800 != v8,
c_0_247,
[final] ).
cnf(c_0_342,plain,
v1200 != v8,
c_0_248,
[final] ).
cnf(c_0_343,plain,
v200 != v32,
c_0_249,
[final] ).
cnf(c_0_344,plain,
v600 != v32,
c_0_250,
[final] ).
cnf(c_0_345,plain,
v800 != v32,
c_0_251,
[final] ).
cnf(c_0_346,plain,
v1200 != v32,
c_0_252,
[final] ).
cnf(c_0_347,plain,
v600 != v200,
c_0_253,
[final] ).
cnf(c_0_348,plain,
v800 != v200,
c_0_254,
[final] ).
cnf(c_0_349,plain,
v1200 != v200,
c_0_255,
[final] ).
cnf(c_0_350,plain,
v800 != v600,
c_0_256,
[final] ).
cnf(c_0_351,plain,
v1200 != v600,
c_0_257,
[final] ).
cnf(c_0_352,plain,
v1200 != v800,
c_0_258,
[final] ).
cnf(c_0_353,plain,
unknown != compatible,
c_0_259,
[final] ).
cnf(c_0_354,plain,
unknown != conflict,
c_0_260,
[final] ).
cnf(c_0_355,plain,
compatible != conflict,
c_0_261,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_262_0,axiom,
( axis_subsumes(X1,X2,X3,X4)
| ~ in_closed(sk1_esk3_4(X1,X2,X3,X4),X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_262]) ).
cnf(c_0_262_1,axiom,
( ~ in_closed(sk1_esk3_4(X1,X2,X3,X4),X3,X4)
| axis_subsumes(X1,X2,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_262]) ).
cnf(c_0_263_0,axiom,
( in_closed(sk1_esk2_4(X1,X2,X3,X4),X1,X2)
| ~ axis_compatible(X1,X2,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_263]) ).
cnf(c_0_263_1,axiom,
( ~ axis_compatible(X1,X2,X3,X4)
| in_closed(sk1_esk2_4(X1,X2,X3,X4),X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_263]) ).
cnf(c_0_264_0,axiom,
( in_closed(sk1_esk2_4(X1,X2,X3,X4),X3,X4)
| ~ axis_compatible(X1,X2,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_264]) ).
cnf(c_0_264_1,axiom,
( ~ axis_compatible(X1,X2,X3,X4)
| in_closed(sk1_esk2_4(X1,X2,X3,X4),X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_264]) ).
cnf(c_0_265_0,axiom,
( axis_subsumes(X1,X2,X3,X4)
| in_closed(sk1_esk3_4(X1,X2,X3,X4),X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_265]) ).
cnf(c_0_265_1,axiom,
( in_closed(sk1_esk3_4(X1,X2,X3,X4),X1,X2)
| axis_subsumes(X1,X2,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_265]) ).
cnf(c_0_266_0,axiom,
( axis_conflict(X1,X2,X3,X4)
| in_closed(sk1_esk1_4(X1,X2,X3,X4),X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_266]) ).
cnf(c_0_266_1,axiom,
( in_closed(sk1_esk1_4(X1,X2,X3,X4),X1,X2)
| axis_conflict(X1,X2,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_266]) ).
cnf(c_0_267_0,axiom,
( axis_conflict(X1,X2,X3,X4)
| in_closed(sk1_esk1_4(X1,X2,X3,X4),X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_267]) ).
cnf(c_0_267_1,axiom,
( in_closed(sk1_esk1_4(X1,X2,X3,X4),X3,X4)
| axis_conflict(X1,X2,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_267]) ).
cnf(c_0_268_0,axiom,
( ~ in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5)
| ~ axis_conflict(X4,X5,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_268]) ).
cnf(c_0_268_1,axiom,
( ~ in_closed(X1,X4,X5)
| ~ in_closed(X1,X2,X3)
| ~ axis_conflict(X4,X5,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_268]) ).
cnf(c_0_268_2,axiom,
( ~ axis_conflict(X4,X5,X2,X3)
| ~ in_closed(X1,X4,X5)
| ~ in_closed(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_268]) ).
cnf(c_0_269_0,axiom,
( in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5)
| ~ axis_subsumes(X4,X5,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_269]) ).
cnf(c_0_269_1,axiom,
( ~ in_closed(X1,X4,X5)
| in_closed(X1,X2,X3)
| ~ axis_subsumes(X4,X5,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_269]) ).
cnf(c_0_269_2,axiom,
( ~ axis_subsumes(X4,X5,X2,X3)
| ~ in_closed(X1,X4,X5)
| in_closed(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_269]) ).
cnf(c_0_270_0,axiom,
( axis_compatible(X1,X2,X3,X4)
| ~ in_closed(X5,X3,X4)
| ~ in_closed(X5,X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_270]) ).
cnf(c_0_270_1,axiom,
( ~ in_closed(X5,X3,X4)
| axis_compatible(X1,X2,X3,X4)
| ~ in_closed(X5,X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_270]) ).
cnf(c_0_270_2,axiom,
( ~ in_closed(X5,X1,X2)
| ~ in_closed(X5,X3,X4)
| axis_compatible(X1,X2,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_270]) ).
cnf(c_0_271_0,axiom,
( less(X2,X1)
| ~ in_open(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_271]) ).
cnf(c_0_271_1,axiom,
( ~ in_open(X1,X2,X3)
| less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_271]) ).
cnf(c_0_272_0,axiom,
( less(X1,X3)
| ~ in_open(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_272]) ).
cnf(c_0_272_1,axiom,
( ~ in_open(X1,X2,X3)
| less(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_272]) ).
cnf(c_0_273_0,axiom,
( leq(X2,X1)
| ~ in_ropen(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_273]) ).
cnf(c_0_273_1,axiom,
( ~ in_ropen(X1,X2,X3)
| leq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_273]) ).
cnf(c_0_274_0,axiom,
( less(X1,X3)
| ~ in_ropen(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_274]) ).
cnf(c_0_274_1,axiom,
( ~ in_ropen(X1,X2,X3)
| less(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_274]) ).
cnf(c_0_275_0,axiom,
( less(X2,X1)
| ~ in_lopen(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_275]) ).
cnf(c_0_275_1,axiom,
( ~ in_lopen(X1,X2,X3)
| less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_275]) ).
cnf(c_0_276_0,axiom,
( leq(X1,X3)
| ~ in_lopen(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_276]) ).
cnf(c_0_276_1,axiom,
( ~ in_lopen(X1,X2,X3)
| leq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_276]) ).
cnf(c_0_277_0,axiom,
( leq(X2,X1)
| ~ in_closed(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_277]) ).
cnf(c_0_277_1,axiom,
( ~ in_closed(X1,X2,X3)
| leq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_277]) ).
cnf(c_0_278_0,axiom,
( leq(X1,X3)
| ~ in_closed(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_278]) ).
cnf(c_0_278_1,axiom,
( ~ in_closed(X1,X2,X3)
| leq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_278]) ).
cnf(c_0_279_0,axiom,
( in_open(X1,X2,X3)
| ~ less(X1,X3)
| ~ less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_279]) ).
cnf(c_0_279_1,axiom,
( ~ less(X1,X3)
| in_open(X1,X2,X3)
| ~ less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_279]) ).
cnf(c_0_279_2,axiom,
( ~ less(X2,X1)
| ~ less(X1,X3)
| in_open(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_279]) ).
cnf(c_0_280_0,axiom,
( in_ropen(X1,X2,X3)
| ~ less(X1,X3)
| ~ leq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_280]) ).
cnf(c_0_280_1,axiom,
( ~ less(X1,X3)
| in_ropen(X1,X2,X3)
| ~ leq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_280]) ).
cnf(c_0_280_2,axiom,
( ~ leq(X2,X1)
| ~ less(X1,X3)
| in_ropen(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_280]) ).
cnf(c_0_281_0,axiom,
( in_lopen(X1,X2,X3)
| ~ leq(X1,X3)
| ~ less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_281]) ).
cnf(c_0_281_1,axiom,
( ~ leq(X1,X3)
| in_lopen(X1,X2,X3)
| ~ less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_281]) ).
cnf(c_0_281_2,axiom,
( ~ less(X2,X1)
| ~ leq(X1,X3)
| in_lopen(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_281]) ).
cnf(c_0_282_0,axiom,
( in_closed(X1,X2,X3)
| ~ leq(X1,X3)
| ~ leq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_282]) ).
cnf(c_0_282_1,axiom,
( ~ leq(X1,X3)
| in_closed(X1,X2,X3)
| ~ leq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_282]) ).
cnf(c_0_282_2,axiom,
( ~ leq(X2,X1)
| ~ leq(X1,X3)
| in_closed(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_282]) ).
cnf(c_0_283_0,axiom,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_283]) ).
cnf(c_0_283_1,axiom,
( ~ leq(X3,X2)
| leq(X1,X2)
| ~ leq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_283]) ).
cnf(c_0_283_2,axiom,
( ~ leq(X1,X3)
| ~ leq(X3,X2)
| leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_283]) ).
cnf(c_0_284_0,axiom,
( less(X1,X2)
| ~ leq(X3,X2)
| ~ less(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_284]) ).
cnf(c_0_284_1,axiom,
( ~ leq(X3,X2)
| less(X1,X2)
| ~ less(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_284]) ).
cnf(c_0_284_2,axiom,
( ~ less(X1,X3)
| ~ leq(X3,X2)
| less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_284]) ).
cnf(c_0_285_0,axiom,
( less(X1,X2)
| ~ less(X3,X2)
| ~ leq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_285]) ).
cnf(c_0_285_1,axiom,
( ~ less(X3,X2)
| less(X1,X2)
| ~ leq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_285]) ).
cnf(c_0_285_2,axiom,
( ~ leq(X1,X3)
| ~ less(X3,X2)
| less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_285]) ).
cnf(c_0_286_0,axiom,
( less(X1,X2)
| ~ less(X3,X2)
| ~ less(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_286]) ).
cnf(c_0_286_1,axiom,
( ~ less(X3,X2)
| less(X1,X2)
| ~ less(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_286]) ).
cnf(c_0_286_2,axiom,
( ~ less(X1,X3)
| ~ less(X3,X2)
| less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_286]) ).
cnf(c_0_287_0,axiom,
( box_verdict(X1,X2) = unknown
| box_verdict(X1,X2) = compatible
| box_verdict(X1,X2) = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_287]) ).
cnf(c_0_287_1,axiom,
( box_verdict(X1,X2) = compatible
| box_verdict(X1,X2) = unknown
| box_verdict(X1,X2) = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_287]) ).
cnf(c_0_287_2,axiom,
( box_verdict(X1,X2) = conflict
| box_verdict(X1,X2) = compatible
| box_verdict(X1,X2) = unknown
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_287]) ).
cnf(c_0_287_3,axiom,
( ~ is_verdict(X2)
| box_verdict(X1,X2) = conflict
| box_verdict(X1,X2) = compatible
| box_verdict(X1,X2) = unknown
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_287]) ).
cnf(c_0_287_4,axiom,
( ~ is_verdict(X1)
| ~ is_verdict(X2)
| box_verdict(X1,X2) = conflict
| box_verdict(X1,X2) = compatible
| box_verdict(X1,X2) = unknown ),
inference(literals_permutation,[status(thm)],[c_0_287]) ).
cnf(c_0_288_0,axiom,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_288]) ).
cnf(c_0_288_1,axiom,
( ~ leq(X2,X1)
| X1 = X2
| ~ leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_288]) ).
cnf(c_0_288_2,axiom,
( ~ leq(X1,X2)
| ~ leq(X2,X1)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_288]) ).
cnf(c_0_289_0,axiom,
( X1 = X2
| less(X1,X2)
| ~ leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_289]) ).
cnf(c_0_289_1,axiom,
( less(X1,X2)
| X1 = X2
| ~ leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_289]) ).
cnf(c_0_289_2,axiom,
( ~ leq(X1,X2)
| less(X1,X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_289]) ).
cnf(c_0_290_0,axiom,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_290]) ).
cnf(c_0_290_1,axiom,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_290]) ).
cnf(c_0_291_0,axiom,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_291]) ).
cnf(c_0_291_1,axiom,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_291]) ).
cnf(c_0_292_0,axiom,
( box_verdict(X1,X2) = unknown
| X2 = conflict
| X1 = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != unknown ),
inference(literals_permutation,[status(thm)],[c_0_292]) ).
cnf(c_0_292_1,axiom,
( X2 = conflict
| box_verdict(X1,X2) = unknown
| X1 = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != unknown ),
inference(literals_permutation,[status(thm)],[c_0_292]) ).
cnf(c_0_292_2,axiom,
( X1 = conflict
| X2 = conflict
| box_verdict(X1,X2) = unknown
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != unknown ),
inference(literals_permutation,[status(thm)],[c_0_292]) ).
cnf(c_0_292_3,axiom,
( ~ is_verdict(X1)
| X1 = conflict
| X2 = conflict
| box_verdict(X1,X2) = unknown
| ~ is_verdict(X2)
| X1 != unknown ),
inference(literals_permutation,[status(thm)],[c_0_292]) ).
cnf(c_0_292_4,axiom,
( ~ is_verdict(X2)
| ~ is_verdict(X1)
| X1 = conflict
| X2 = conflict
| box_verdict(X1,X2) = unknown
| X1 != unknown ),
inference(literals_permutation,[status(thm)],[c_0_292]) ).
cnf(c_0_292_5,axiom,
( X1 != unknown
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X1 = conflict
| X2 = conflict
| box_verdict(X1,X2) = unknown ),
inference(literals_permutation,[status(thm)],[c_0_292]) ).
cnf(c_0_293_0,axiom,
( box_verdict(X1,X2) = unknown
| X2 = conflict
| X1 = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X2 != unknown ),
inference(literals_permutation,[status(thm)],[c_0_293]) ).
cnf(c_0_293_1,axiom,
( X2 = conflict
| box_verdict(X1,X2) = unknown
| X1 = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X2 != unknown ),
inference(literals_permutation,[status(thm)],[c_0_293]) ).
cnf(c_0_293_2,axiom,
( X1 = conflict
| X2 = conflict
| box_verdict(X1,X2) = unknown
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X2 != unknown ),
inference(literals_permutation,[status(thm)],[c_0_293]) ).
cnf(c_0_293_3,axiom,
( ~ is_verdict(X1)
| X1 = conflict
| X2 = conflict
| box_verdict(X1,X2) = unknown
| ~ is_verdict(X2)
| X2 != unknown ),
inference(literals_permutation,[status(thm)],[c_0_293]) ).
cnf(c_0_293_4,axiom,
( ~ is_verdict(X2)
| ~ is_verdict(X1)
| X1 = conflict
| X2 = conflict
| box_verdict(X1,X2) = unknown
| X2 != unknown ),
inference(literals_permutation,[status(thm)],[c_0_293]) ).
cnf(c_0_293_5,axiom,
( X2 != unknown
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X1 = conflict
| X2 = conflict
| box_verdict(X1,X2) = unknown ),
inference(literals_permutation,[status(thm)],[c_0_293]) ).
cnf(c_0_294_0,axiom,
( box_verdict(X1,X2) = compatible
| X2 != compatible
| X1 != compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_294]) ).
cnf(c_0_294_1,axiom,
( X2 != compatible
| box_verdict(X1,X2) = compatible
| X1 != compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_294]) ).
cnf(c_0_294_2,axiom,
( X1 != compatible
| X2 != compatible
| box_verdict(X1,X2) = compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_294]) ).
cnf(c_0_294_3,axiom,
( ~ is_verdict(X2)
| X1 != compatible
| X2 != compatible
| box_verdict(X1,X2) = compatible
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_294]) ).
cnf(c_0_294_4,axiom,
( ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != compatible
| X2 != compatible
| box_verdict(X1,X2) = compatible ),
inference(literals_permutation,[status(thm)],[c_0_294]) ).
cnf(c_0_295_0,axiom,
( box_verdict(X1,X2) = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != conflict ),
inference(literals_permutation,[status(thm)],[c_0_295]) ).
cnf(c_0_295_1,axiom,
( ~ is_verdict(X1)
| box_verdict(X1,X2) = conflict
| ~ is_verdict(X2)
| X1 != conflict ),
inference(literals_permutation,[status(thm)],[c_0_295]) ).
cnf(c_0_295_2,axiom,
( ~ is_verdict(X2)
| ~ is_verdict(X1)
| box_verdict(X1,X2) = conflict
| X1 != conflict ),
inference(literals_permutation,[status(thm)],[c_0_295]) ).
cnf(c_0_295_3,axiom,
( X1 != conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| box_verdict(X1,X2) = conflict ),
inference(literals_permutation,[status(thm)],[c_0_295]) ).
cnf(c_0_296_0,axiom,
( box_verdict(X1,X2) = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X2 != conflict ),
inference(literals_permutation,[status(thm)],[c_0_296]) ).
cnf(c_0_296_1,axiom,
( ~ is_verdict(X1)
| box_verdict(X1,X2) = conflict
| ~ is_verdict(X2)
| X2 != conflict ),
inference(literals_permutation,[status(thm)],[c_0_296]) ).
cnf(c_0_296_2,axiom,
( ~ is_verdict(X2)
| ~ is_verdict(X1)
| box_verdict(X1,X2) = conflict
| X2 != conflict ),
inference(literals_permutation,[status(thm)],[c_0_296]) ).
cnf(c_0_296_3,axiom,
( X2 != conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| box_verdict(X1,X2) = conflict ),
inference(literals_permutation,[status(thm)],[c_0_296]) ).
cnf(c_0_297_0,axiom,
( less(X1,X2)
| X2 = X1
| less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_297]) ).
cnf(c_0_297_1,axiom,
( X2 = X1
| less(X1,X2)
| less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_297]) ).
cnf(c_0_297_2,axiom,
( less(X2,X1)
| X2 = X1
| less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_297]) ).
cnf(c_0_299_0,axiom,
( leq(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_299]) ).
cnf(c_0_299_1,axiom,
( X1 != X2
| leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_299]) ).
cnf(c_0_300_0,axiom,
( X1 = unknown
| X1 = compatible
| X1 = conflict
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_300]) ).
cnf(c_0_300_1,axiom,
( X1 = compatible
| X1 = unknown
| X1 = conflict
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_300]) ).
cnf(c_0_300_2,axiom,
( X1 = conflict
| X1 = compatible
| X1 = unknown
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_300]) ).
cnf(c_0_300_3,axiom,
( ~ is_verdict(X1)
| X1 = conflict
| X1 = compatible
| X1 = unknown ),
inference(literals_permutation,[status(thm)],[c_0_300]) ).
cnf(c_0_298_0,axiom,
~ less(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_298]) ).
cnf(c_0_332_0,axiom,
v8 != v0,
inference(literals_permutation,[status(thm)],[c_0_332]) ).
cnf(c_0_333_0,axiom,
v32 != v0,
inference(literals_permutation,[status(thm)],[c_0_333]) ).
cnf(c_0_334_0,axiom,
v200 != v0,
inference(literals_permutation,[status(thm)],[c_0_334]) ).
cnf(c_0_335_0,axiom,
v600 != v0,
inference(literals_permutation,[status(thm)],[c_0_335]) ).
cnf(c_0_336_0,axiom,
v800 != v0,
inference(literals_permutation,[status(thm)],[c_0_336]) ).
cnf(c_0_337_0,axiom,
v1200 != v0,
inference(literals_permutation,[status(thm)],[c_0_337]) ).
cnf(c_0_338_0,axiom,
v32 != v8,
inference(literals_permutation,[status(thm)],[c_0_338]) ).
cnf(c_0_339_0,axiom,
v200 != v8,
inference(literals_permutation,[status(thm)],[c_0_339]) ).
cnf(c_0_340_0,axiom,
v600 != v8,
inference(literals_permutation,[status(thm)],[c_0_340]) ).
cnf(c_0_341_0,axiom,
v800 != v8,
inference(literals_permutation,[status(thm)],[c_0_341]) ).
cnf(c_0_342_0,axiom,
v1200 != v8,
inference(literals_permutation,[status(thm)],[c_0_342]) ).
cnf(c_0_343_0,axiom,
v200 != v32,
inference(literals_permutation,[status(thm)],[c_0_343]) ).
cnf(c_0_344_0,axiom,
v600 != v32,
inference(literals_permutation,[status(thm)],[c_0_344]) ).
cnf(c_0_345_0,axiom,
v800 != v32,
inference(literals_permutation,[status(thm)],[c_0_345]) ).
cnf(c_0_346_0,axiom,
v1200 != v32,
inference(literals_permutation,[status(thm)],[c_0_346]) ).
cnf(c_0_347_0,axiom,
v600 != v200,
inference(literals_permutation,[status(thm)],[c_0_347]) ).
cnf(c_0_348_0,axiom,
v800 != v200,
inference(literals_permutation,[status(thm)],[c_0_348]) ).
cnf(c_0_349_0,axiom,
v1200 != v200,
inference(literals_permutation,[status(thm)],[c_0_349]) ).
cnf(c_0_350_0,axiom,
v800 != v600,
inference(literals_permutation,[status(thm)],[c_0_350]) ).
cnf(c_0_351_0,axiom,
v1200 != v600,
inference(literals_permutation,[status(thm)],[c_0_351]) ).
cnf(c_0_352_0,axiom,
v1200 != v800,
inference(literals_permutation,[status(thm)],[c_0_352]) ).
cnf(c_0_353_0,axiom,
unknown != compatible,
inference(literals_permutation,[status(thm)],[c_0_353]) ).
cnf(c_0_354_0,axiom,
unknown != conflict,
inference(literals_permutation,[status(thm)],[c_0_354]) ).
cnf(c_0_355_0,axiom,
compatible != conflict,
inference(literals_permutation,[status(thm)],[c_0_355]) ).
cnf(c_0_301_0,axiom,
less(v800,v1200),
inference(literals_permutation,[status(thm)],[c_0_301]) ).
cnf(c_0_302_0,axiom,
less(v600,v1200),
inference(literals_permutation,[status(thm)],[c_0_302]) ).
cnf(c_0_303_0,axiom,
less(v600,v800),
inference(literals_permutation,[status(thm)],[c_0_303]) ).
cnf(c_0_304_0,axiom,
less(v200,v1200),
inference(literals_permutation,[status(thm)],[c_0_304]) ).
cnf(c_0_305_0,axiom,
less(v200,v800),
inference(literals_permutation,[status(thm)],[c_0_305]) ).
cnf(c_0_306_0,axiom,
less(v200,v600),
inference(literals_permutation,[status(thm)],[c_0_306]) ).
cnf(c_0_307_0,axiom,
less(v32,v1200),
inference(literals_permutation,[status(thm)],[c_0_307]) ).
cnf(c_0_308_0,axiom,
less(v32,v800),
inference(literals_permutation,[status(thm)],[c_0_308]) ).
cnf(c_0_309_0,axiom,
less(v32,v600),
inference(literals_permutation,[status(thm)],[c_0_309]) ).
cnf(c_0_310_0,axiom,
less(v32,v200),
inference(literals_permutation,[status(thm)],[c_0_310]) ).
cnf(c_0_311_0,axiom,
less(v8,v1200),
inference(literals_permutation,[status(thm)],[c_0_311]) ).
cnf(c_0_312_0,axiom,
less(v8,v800),
inference(literals_permutation,[status(thm)],[c_0_312]) ).
cnf(c_0_313_0,axiom,
less(v8,v600),
inference(literals_permutation,[status(thm)],[c_0_313]) ).
cnf(c_0_314_0,axiom,
less(v8,v200),
inference(literals_permutation,[status(thm)],[c_0_314]) ).
cnf(c_0_315_0,axiom,
less(v8,v32),
inference(literals_permutation,[status(thm)],[c_0_315]) ).
cnf(c_0_316_0,axiom,
less(v0,v1200),
inference(literals_permutation,[status(thm)],[c_0_316]) ).
cnf(c_0_317_0,axiom,
less(v0,v800),
inference(literals_permutation,[status(thm)],[c_0_317]) ).
cnf(c_0_318_0,axiom,
less(v0,v600),
inference(literals_permutation,[status(thm)],[c_0_318]) ).
cnf(c_0_319_0,axiom,
less(v0,v200),
inference(literals_permutation,[status(thm)],[c_0_319]) ).
cnf(c_0_320_0,axiom,
less(v0,v32),
inference(literals_permutation,[status(thm)],[c_0_320]) ).
cnf(c_0_321_0,axiom,
less(v0,v8),
inference(literals_permutation,[status(thm)],[c_0_321]) ).
cnf(c_0_322_0,axiom,
val(v1200),
inference(literals_permutation,[status(thm)],[c_0_322]) ).
cnf(c_0_323_0,axiom,
val(v800),
inference(literals_permutation,[status(thm)],[c_0_323]) ).
cnf(c_0_324_0,axiom,
val(v600),
inference(literals_permutation,[status(thm)],[c_0_324]) ).
cnf(c_0_325_0,axiom,
val(v200),
inference(literals_permutation,[status(thm)],[c_0_325]) ).
cnf(c_0_326_0,axiom,
val(v32),
inference(literals_permutation,[status(thm)],[c_0_326]) ).
cnf(c_0_327_0,axiom,
val(v8),
inference(literals_permutation,[status(thm)],[c_0_327]) ).
cnf(c_0_328_0,axiom,
val(v0),
inference(literals_permutation,[status(thm)],[c_0_328]) ).
cnf(c_0_329_0,axiom,
is_verdict(unknown),
inference(literals_permutation,[status(thm)],[c_0_329]) ).
cnf(c_0_330_0,axiom,
is_verdict(compatible),
inference(literals_permutation,[status(thm)],[c_0_330]) ).
cnf(c_0_331_0,axiom,
is_verdict(conflict),
inference(literals_permutation,[status(thm)],[c_0_331]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
~ ? [X1,X2,X3] :
( in_lopen(X1,v0,v600)
& leq(v1200,X1)
& in_lopen(X2,v0,v800)
& leq(v200,X2)
& in_lopen(X3,v0,v32)
& leq(v8,X3) ),
file('<stdin>',odrl341) ).
fof(c_0_1_002,negated_conjecture,
~ ~ ? [X1,X2,X3] :
( in_lopen(X1,v0,v600)
& leq(v1200,X1)
& in_lopen(X2,v0,v800)
& leq(v200,X2)
& in_lopen(X3,v0,v32)
& leq(v8,X3) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
( in_lopen(esk1_0,v0,v600)
& leq(v1200,esk1_0)
& in_lopen(esk2_0,v0,v800)
& leq(v200,esk2_0)
& in_lopen(esk3_0,v0,v32)
& leq(v8,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
cnf(c_0_3_004,negated_conjecture,
in_lopen(esk1_0,v0,v600),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
in_lopen(esk2_0,v0,v800),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
in_lopen(esk3_0,v0,v32),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_007,negated_conjecture,
leq(v1200,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7_008,negated_conjecture,
leq(v200,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8_009,negated_conjecture,
leq(v8,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9_010,negated_conjecture,
in_lopen(esk1_0,v0,v600),
c_0_3,
[final] ).
cnf(c_0_10_011,negated_conjecture,
in_lopen(esk2_0,v0,v800),
c_0_4,
[final] ).
cnf(c_0_11_012,negated_conjecture,
in_lopen(esk3_0,v0,v32),
c_0_5,
[final] ).
cnf(c_0_12_013,negated_conjecture,
leq(v1200,esk1_0),
c_0_6,
[final] ).
cnf(c_0_13_014,negated_conjecture,
leq(v200,esk2_0),
c_0_7,
[final] ).
cnf(c_0_14_015,negated_conjecture,
leq(v8,esk3_0),
c_0_8,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_166,negated_conjecture,
in_lopen(sk2_esk1_0,v0,v600),
file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p',c_0_9) ).
cnf(c_198,negated_conjecture,
in_lopen(sk2_esk1_0,v0,v600),
inference(copy,[status(esa)],[c_166]) ).
cnf(c_222,negated_conjecture,
in_lopen(sk2_esk1_0,v0,v600),
inference(copy,[status(esa)],[c_198]) ).
cnf(c_233,negated_conjecture,
in_lopen(sk2_esk1_0,v0,v600),
inference(copy,[status(esa)],[c_222]) ).
cnf(c_234,negated_conjecture,
in_lopen(sk2_esk1_0,v0,v600),
inference(copy,[status(esa)],[c_233]) ).
cnf(c_744,negated_conjecture,
in_lopen(sk2_esk1_0,v0,v600),
inference(copy,[status(esa)],[c_234]) ).
cnf(c_133,plain,
( leq(X0,X1)
| ~ in_lopen(X0,X2,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p',c_0_276_1) ).
cnf(c_678,plain,
( leq(X0,X1)
| ~ in_lopen(X0,X2,X1) ),
inference(copy,[status(esa)],[c_133]) ).
cnf(c_824,plain,
leq(sk2_esk1_0,v600),
inference(resolution,[status(thm)],[c_744,c_678]) ).
cnf(c_825,plain,
leq(sk2_esk1_0,v600),
inference(rewriting,[status(thm)],[c_824]) ).
cnf(c_108,plain,
( less(X0,X1)
| ~ less(X2,X1)
| ~ leq(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p',c_0_285_2) ).
cnf(c_628,plain,
( less(X0,X1)
| ~ less(X2,X1)
| ~ leq(X0,X2) ),
inference(copy,[status(esa)],[c_108]) ).
cnf(c_853,plain,
( ~ less(v600,X0)
| less(sk2_esk1_0,X0) ),
inference(resolution,[status(thm)],[c_825,c_628]) ).
cnf(c_854,plain,
( ~ less(v600,X0)
| less(sk2_esk1_0,X0) ),
inference(rewriting,[status(thm)],[c_853]) ).
cnf(c_169,negated_conjecture,
leq(v1200,sk2_esk1_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p',c_0_12) ).
cnf(c_204,negated_conjecture,
leq(v1200,sk2_esk1_0),
inference(copy,[status(esa)],[c_169]) ).
cnf(c_225,negated_conjecture,
leq(v1200,sk2_esk1_0),
inference(copy,[status(esa)],[c_204]) ).
cnf(c_230,negated_conjecture,
leq(v1200,sk2_esk1_0),
inference(copy,[status(esa)],[c_225]) ).
cnf(c_237,negated_conjecture,
leq(v1200,sk2_esk1_0),
inference(copy,[status(esa)],[c_230]) ).
cnf(c_750,plain,
leq(v1200,sk2_esk1_0),
inference(copy,[status(esa)],[c_237]) ).
cnf(c_112,plain,
( ~ less(X0,X1)
| less(X0,X2)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p',c_0_284_1) ).
cnf(c_636,plain,
( ~ less(X0,X1)
| less(X0,X2)
| ~ leq(X1,X2) ),
inference(copy,[status(esa)],[c_112]) ).
cnf(c_774,plain,
( ~ less(X0,v1200)
| less(X0,sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_750,c_636]) ).
cnf(c_775,plain,
( ~ less(X0,v1200)
| less(X0,sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_774]) ).
cnf(c_55,plain,
~ less(X0,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p',c_0_298_0) ).
cnf(c_522,plain,
~ less(X0,X0),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_982,plain,
~ less(sk2_esk1_0,v1200),
inference(resolution,[status(thm)],[c_775,c_522]) ).
cnf(c_983,plain,
~ less(sk2_esk1_0,v1200),
inference(rewriting,[status(thm)],[c_982]) ).
cnf(c_1430,plain,
~ less(v600,v1200),
inference(resolution,[status(thm)],[c_854,c_983]) ).
cnf(c_1431,plain,
~ less(v600,v1200),
inference(rewriting,[status(thm)],[c_1430]) ).
cnf(c_29,plain,
less(v600,v1200),
file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p',c_0_302_0) ).
cnf(c_470,plain,
less(v600,v1200),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_3807,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1431,c_470]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT078+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : iprover_modulo %s %d
% 0.09/0.35 % Computer : n019.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 7 14:13:38 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Running in mono-core mode
% 0.13/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.13/0.42 % FOF problem with conjecture
% 0.13/0.42 % 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_04391e.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_a768df.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_db5188 | grep -v "SZS"
% 0.13/0.45
% 0.13/0.45 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.13/0.45
% 0.13/0.45 %
% 0.13/0.45 % ------ iProver source info
% 0.13/0.45
% 0.13/0.45 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.13/0.45 % git: non_committed_changes: true
% 0.13/0.45 % git: last_make_outside_of_git: true
% 0.13/0.45
% 0.13/0.45 %
% 0.13/0.45 % ------ Input Options
% 0.13/0.45
% 0.13/0.45 % --out_options all
% 0.13/0.45 % --tptp_safe_out true
% 0.13/0.45 % --problem_path ""
% 0.13/0.45 % --include_path ""
% 0.13/0.45 % --clausifier .//eprover
% 0.13/0.45 % --clausifier_options --tstp-format
% 0.13/0.45 % --stdin false
% 0.13/0.45 % --dbg_backtrace false
% 0.13/0.45 % --dbg_dump_prop_clauses false
% 0.13/0.45 % --dbg_dump_prop_clauses_file -
% 0.13/0.45 % --dbg_out_stat false
% 0.13/0.45
% 0.13/0.45 % ------ General Options
% 0.13/0.45
% 0.13/0.45 % --fof false
% 0.13/0.45 % --time_out_real 150.
% 0.13/0.45 % --time_out_prep_mult 0.2
% 0.13/0.45 % --time_out_virtual -1.
% 0.13/0.45 % --schedule none
% 0.13/0.45 % --ground_splitting input
% 0.13/0.45 % --splitting_nvd 16
% 0.13/0.45 % --non_eq_to_eq false
% 0.13/0.45 % --prep_gs_sim true
% 0.13/0.45 % --prep_unflatten false
% 0.13/0.45 % --prep_res_sim true
% 0.13/0.45 % --prep_upred true
% 0.13/0.45 % --res_sim_input true
% 0.13/0.45 % --clause_weak_htbl true
% 0.13/0.45 % --gc_record_bc_elim false
% 0.13/0.45 % --symbol_type_check false
% 0.13/0.45 % --clausify_out false
% 0.13/0.45 % --large_theory_mode false
% 0.13/0.45 % --prep_sem_filter none
% 0.13/0.45 % --prep_sem_filter_out false
% 0.13/0.45 % --preprocessed_out false
% 0.13/0.45 % --sub_typing false
% 0.13/0.45 % --brand_transform false
% 0.13/0.45 % --pure_diseq_elim true
% 0.13/0.45 % --min_unsat_core false
% 0.13/0.45 % --pred_elim true
% 0.13/0.45 % --add_important_lit false
% 0.13/0.45 % --soft_assumptions false
% 0.13/0.45 % --reset_solvers false
% 0.13/0.45 % --bc_imp_inh []
% 0.13/0.45 % --conj_cone_tolerance 1.5
% 0.13/0.45 % --prolific_symb_bound 500
% 0.13/0.45 % --lt_threshold 2000
% 0.13/0.45
% 0.13/0.45 % ------ SAT Options
% 0.13/0.45
% 0.13/0.45 % --sat_mode false
% 0.13/0.45 % --sat_fm_restart_options ""
% 0.13/0.45 % --sat_gr_def false
% 0.13/0.45 % --sat_epr_types true
% 0.13/0.45 % --sat_non_cyclic_types false
% 0.13/0.45 % --sat_finite_models false
% 0.13/0.45 % --sat_fm_lemmas false
% 0.13/0.45 % --sat_fm_prep false
% 0.13/0.45 % --sat_fm_uc_incr true
% 0.13/0.45 % --sat_out_model small
% 0.13/0.45 % --sat_out_clauses false
% 0.13/0.45
% 0.13/0.45 % ------ QBF Options
% 0.13/0.45
% 0.13/0.45 % --qbf_mode false
% 0.13/0.45 % --qbf_elim_univ true
% 0.13/0.45 % --qbf_sk_in true
% 0.13/0.45 % --qbf_pred_elim true
% 0.13/0.45 % --qbf_split 32
% 0.13/0.45
% 0.13/0.45 % ------ BMC1 Options
% 0.13/0.45
% 0.13/0.45 % --bmc1_incremental false
% 0.13/0.45 % --bmc1_axioms reachable_all
% 0.13/0.45 % --bmc1_min_bound 0
% 0.13/0.45 % --bmc1_max_bound -1
% 0.13/0.45 % --bmc1_max_bound_default -1
% 0.13/0.45 % --bmc1_symbol_reachability true
% 0.13/0.45 % --bmc1_property_lemmas false
% 0.13/0.45 % --bmc1_k_induction false
% 0.13/0.45 % --bmc1_non_equiv_states false
% 0.13/0.45 % --bmc1_deadlock false
% 0.13/0.45 % --bmc1_ucm false
% 0.13/0.45 % --bmc1_add_unsat_core none
% 0.13/0.45 % --bmc1_unsat_core_children false
% 0.13/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.13/0.45 % --bmc1_out_stat full
% 0.13/0.45 % --bmc1_ground_init false
% 0.13/0.45 % --bmc1_pre_inst_next_state false
% 0.13/0.45 % --bmc1_pre_inst_state false
% 0.13/0.45 % --bmc1_pre_inst_reach_state false
% 0.13/0.45 % --bmc1_out_unsat_core false
% 0.13/0.45 % --bmc1_aig_witness_out false
% 0.13/0.45 % --bmc1_verbose false
% 0.13/0.45 % --bmc1_dump_clauses_tptp false
% 0.20/0.46 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.46 % --bmc1_dump_file -
% 0.20/0.46 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.46 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.46 % --bmc1_ucm_extend_mode 1
% 0.20/0.46 % --bmc1_ucm_init_mode 2
% 0.20/0.46 % --bmc1_ucm_cone_mode none
% 0.20/0.46 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.46 % --bmc1_ucm_relax_model 4
% 0.20/0.46 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.46 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.46 % --bmc1_ucm_layered_model none
% 0.20/0.46 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.46
% 0.20/0.46 % ------ AIG Options
% 0.20/0.46
% 0.20/0.46 % --aig_mode false
% 0.20/0.46
% 0.20/0.46 % ------ Instantiation Options
% 0.20/0.46
% 0.20/0.46 % --instantiation_flag true
% 0.20/0.46 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.46 % --inst_solver_per_active 750
% 0.20/0.46 % --inst_solver_calls_frac 0.5
% 0.20/0.46 % --inst_passive_queue_type priority_queues
% 0.20/0.46 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.46 % --inst_passive_queues_freq [25;2]
% 0.20/0.46 % --inst_dismatching true
% 0.20/0.46 % --inst_eager_unprocessed_to_passive true
% 0.20/0.46 % --inst_prop_sim_given true
% 0.20/0.46 % --inst_prop_sim_new false
% 0.20/0.46 % --inst_orphan_elimination true
% 0.20/0.46 % --inst_learning_loop_flag true
% 0.20/0.46 % --inst_learning_start 3000
% 0.20/0.46 % --inst_learning_factor 2
% 0.20/0.46 % --inst_start_prop_sim_after_learn 3
% 0.20/0.46 % --inst_sel_renew solver
% 0.20/0.46 % --inst_lit_activity_flag true
% 0.20/0.46 % --inst_out_proof true
% 0.20/0.46
% 0.20/0.46 % ------ Resolution Options
% 0.20/0.46
% 0.20/0.46 % --resolution_flag true
% 0.20/0.46 % --res_lit_sel kbo_max
% 0.20/0.46 % --res_to_prop_solver none
% 0.20/0.46 % --res_prop_simpl_new false
% 0.20/0.46 % --res_prop_simpl_given false
% 0.20/0.46 % --res_passive_queue_type priority_queues
% 0.20/0.46 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.46 % --res_passive_queues_freq [15;5]
% 0.20/0.46 % --res_forward_subs full
% 0.20/0.46 % --res_backward_subs full
% 0.20/0.46 % --res_forward_subs_resolution true
% 0.20/0.46 % --res_backward_subs_resolution true
% 0.20/0.46 % --res_orphan_elimination false
% 0.20/0.46 % --res_time_limit 1000.
% 0.20/0.46 % --res_out_proof true
% 0.20/0.46 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_04391e.s
% 0.20/0.46 % --modulo true
% 0.20/0.46
% 0.20/0.46 % ------ Combination Options
% 0.20/0.46
% 0.20/0.46 % --comb_res_mult 1000
% 0.20/0.46 % --comb_inst_mult 300
% 0.20/0.46 % ------
% 0.20/0.46
% 0.20/0.46 % ------ Parsing...% successful
% 0.20/0.46
% 0.20/0.46 % ------ 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.20/0.46
% 0.20/0.46 % ------ Proving...
% 0.20/0.46 % ------ Problem Properties
% 0.20/0.46
% 0.20/0.46 %
% 0.20/0.46 % EPR false
% 0.20/0.46 % Horn false
% 0.20/0.46 % Has equality true
% 0.20/0.46
% 0.20/0.46 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 % % ------ Current options:
% 0.20/0.46
% 0.20/0.46 % ------ Input Options
% 0.20/0.46
% 0.20/0.46 % --out_options all
% 0.20/0.46 % --tptp_safe_out true
% 0.20/0.46 % --problem_path ""
% 0.20/0.46 % --include_path ""
% 0.20/0.46 % --clausifier .//eprover
% 0.20/0.46 % --clausifier_options --tstp-format
% 0.20/0.46 % --stdin false
% 0.20/0.46 % --dbg_backtrace false
% 0.20/0.46 % --dbg_dump_prop_clauses false
% 0.20/0.46 % --dbg_dump_prop_clauses_file -
% 0.20/0.46 % --dbg_out_stat false
% 0.20/0.46
% 0.20/0.46 % ------ General Options
% 0.20/0.46
% 0.20/0.46 % --fof false
% 0.20/0.46 % --time_out_real 150.
% 0.20/0.46 % --time_out_prep_mult 0.2
% 0.20/0.46 % --time_out_virtual -1.
% 0.20/0.46 % --schedule none
% 0.20/0.46 % --ground_splitting input
% 0.20/0.46 % --splitting_nvd 16
% 0.20/0.46 % --non_eq_to_eq false
% 0.20/0.46 % --prep_gs_sim true
% 0.20/0.46 % --prep_unflatten false
% 0.20/0.47 % --prep_res_sim true
% 0.20/0.47 % --prep_upred true
% 0.20/0.47 % --res_sim_input true
% 0.20/0.47 % --clause_weak_htbl true
% 0.20/0.47 % --gc_record_bc_elim false
% 0.20/0.47 % --symbol_type_check false
% 0.20/0.47 % --clausify_out false
% 0.20/0.47 % --large_theory_mode false
% 0.20/0.47 % --prep_sem_filter none
% 0.20/0.47 % --prep_sem_filter_out false
% 0.20/0.47 % --preprocessed_out false
% 0.20/0.47 % --sub_typing false
% 0.20/0.47 % --brand_transform false
% 0.20/0.47 % --pure_diseq_elim true
% 0.20/0.47 % --min_unsat_core false
% 0.20/0.47 % --pred_elim true
% 0.20/0.47 % --add_important_lit false
% 0.20/0.47 % --soft_assumptions false
% 0.20/0.47 % --reset_solvers false
% 0.20/0.47 % --bc_imp_inh []
% 0.20/0.47 % --conj_cone_tolerance 1.5
% 0.20/0.47 % --prolific_symb_bound 500
% 0.20/0.47 % --lt_threshold 2000
% 0.20/0.47
% 0.20/0.47 % ------ SAT Options
% 0.20/0.47
% 0.20/0.47 % --sat_mode false
% 0.20/0.47 % --sat_fm_restart_options ""
% 0.20/0.47 % --sat_gr_def false
% 0.20/0.47 % --sat_epr_types true
% 0.20/0.47 % --sat_non_cyclic_types false
% 0.20/0.47 % --sat_finite_models false
% 0.20/0.47 % --sat_fm_lemmas false
% 0.20/0.47 % --sat_fm_prep false
% 0.20/0.47 % --sat_fm_uc_incr true
% 0.20/0.47 % --sat_out_model small
% 0.20/0.47 % --sat_out_clauses false
% 0.20/0.47
% 0.20/0.47 % ------ QBF Options
% 0.20/0.47
% 0.20/0.47 % --qbf_mode false
% 0.20/0.47 % --qbf_elim_univ true
% 0.20/0.47 % --qbf_sk_in true
% 0.20/0.47 % --qbf_pred_elim true
% 0.20/0.47 % --qbf_split 32
% 0.20/0.47
% 0.20/0.47 % ------ BMC1 Options
% 0.20/0.47
% 0.20/0.47 % --bmc1_incremental false
% 0.20/0.47 % --bmc1_axioms reachable_all
% 0.20/0.47 % --bmc1_min_bound 0
% 0.20/0.47 % --bmc1_max_bound -1
% 0.20/0.47 % --bmc1_max_bound_default -1
% 0.20/0.47 % --bmc1_symbol_reachability true
% 0.20/0.47 % --bmc1_property_lemmas false
% 0.20/0.47 % --bmc1_k_induction false
% 0.20/0.47 % --bmc1_non_equiv_states false
% 0.20/0.47 % --bmc1_deadlock false
% 0.20/0.47 % --bmc1_ucm false
% 0.20/0.47 % --bmc1_add_unsat_core none
% 0.20/0.47 % --bmc1_unsat_core_children false
% 0.20/0.47 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.47 % --bmc1_out_stat full
% 0.20/0.47 % --bmc1_ground_init false
% 0.20/0.47 % --bmc1_pre_inst_next_state false
% 0.20/0.47 % --bmc1_pre_inst_state false
% 0.20/0.47 % --bmc1_pre_inst_reach_state false
% 0.20/0.47 % --bmc1_out_unsat_core false
% 0.20/0.47 % --bmc1_aig_witness_out false
% 0.20/0.47 % --bmc1_verbose false
% 0.20/0.47 % --bmc1_dump_clauses_tptp false
% 0.20/0.47 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.47 % --bmc1_dump_file -
% 0.20/0.47 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.47 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.47 % --bmc1_ucm_extend_mode 1
% 0.20/0.47 % --bmc1_ucm_init_mode 2
% 0.20/0.47 % --bmc1_ucm_cone_mode none
% 0.20/0.47 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.47 % --bmc1_ucm_relax_model 4
% 0.20/0.47 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.47 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.47 % --bmc1_ucm_layered_model none
% 0.20/0.47 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.47
% 0.20/0.47 % ------ AIG Options
% 0.20/0.47
% 0.20/0.47 % --aig_mode false
% 0.20/0.47
% 0.20/0.47 % ------ Instantiation Options
% 0.20/0.47
% 0.20/0.47 % --instantiation_flag true
% 0.20/0.47 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.47 % --inst_solver_per_active 750
% 0.20/0.47 % --inst_solver_calls_frac 0.5
% 0.20/0.47 % --inst_passive_queue_type priority_queues
% 0.20/0.47 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.47 % --inst_passive_queues_freq [25;2]
% 0.20/0.47 % --inst_dismatching true
% 0.20/0.47 % --inst_eager_unprocessed_to_passive true
% 0.20/0.47 % --inst_prop_sim_given true
% 0.20/0.47 % --inst_prop_sim_new false
% 0.20/0.47 % --inst_orphan_elimination true
% 0.20/0.47 % --inst_learning_loop_flag true
% 0.20/0.47 % --inst_learning_start 3000
% 0.20/0.47 % --inst_learning_factor 2
% 0.20/0.47 % --inst_start_prop_sim_after_learn 3
% 0.20/0.47 % --inst_sel_renew solver
% 0.20/0.47 % --inst_lit_activity_flag true
% 0.20/0.47 % --inst_out_proof true
% 0.20/0.47
% 0.20/0.47 % ------ Resolution Options
% 0.20/0.47
% 0.20/0.47 % --resolution_flag true
% 0.20/0.47 % --res_lit_sel kbo_max
% 0.20/0.47 % --res_to_prop_solver none
% 0.20/0.47 % --res_prop_simpl_new false
% 0.20/0.47 % --res_prop_simpl_given false
% 0.20/0.47 % --res_passive_queue_type priority_queues
% 0.20/0.47 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.47 % --res_passive_queues_freq [15;5]
% 0.20/0.47 % --res_forward_subs full
% 0.20/0.47 % --res_backward_subs full
% 0.20/0.47 % --res_forward_subs_resolution true
% 0.20/0.47 % --res_backward_subs_resolution true
% 0.20/0.47 % --res_orphan_elimination false
% 0.20/0.47 % --res_time_limit 1000.
% 0.20/0.47 % --res_out_proof true
% 0.20/0.47 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_04391e.s
% 0.20/0.47 % --modulo true
% 0.20/0.47
% 0.20/0.47 % ------ Combination Options
% 0.20/0.47
% 0.20/0.47 % --comb_res_mult 1000
% 0.20/0.47 % --comb_inst_mult 300
% 0.20/0.47 % ------
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47 % ------ Proving...
% 0.20/0.47 % warning: shown sat in sat incomplete mode
% 0.20/0.47 %
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47 cnf(c_102,negated_conjecture,
% 0.20/0.47 ( in_lopen(sk3_esk3_0,v0,v32) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_11) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_136,negated_conjecture,
% 0.20/0.47 ( in_lopen(sk3_esk3_0,v0,v32) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_102]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_158,negated_conjecture,
% 0.20/0.47 ( in_lopen(sk3_esk3_0,v0,v32) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_136]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_165,negated_conjecture,
% 0.20/0.47 ( in_lopen(sk3_esk3_0,v0,v32) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_158]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_170,negated_conjecture,
% 0.20/0.47 ( in_lopen(sk3_esk3_0,v0,v32) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_165]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_484,negated_conjecture,
% 0.20/0.47 ( in_lopen(sk3_esk3_0,v0,v32) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_170]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_82,plain,
% 0.20/0.47 ( less(X0,X1) | ~ in_lopen(X1,X0,X2) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_355_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_444,plain,
% 0.20/0.47 ( less(X0,X1) | ~ in_lopen(X1,X0,X2) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_82]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_520,plain,
% 0.20/0.47 ( less(v0,sk3_esk3_0) ),
% 0.20/0.47 inference(resolution,[status(thm)],[c_484,c_444]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_521,plain,
% 0.20/0.47 ( less(v0,sk3_esk3_0) ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_520]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_66,plain,
% 0.20/0.47 ( leq(X0,X1) | ~ less(X0,X1) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_371_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_412,plain,
% 0.20/0.47 ( leq(X0,X1) | ~ less(X0,X1) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_66]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_413,plain,
% 0.20/0.47 ( ~ less(X0,X1) | leq(X0,X1) ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_412]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_544,plain,
% 0.20/0.47 ( leq(v0,sk3_esk3_0) ),
% 0.20/0.47 inference(resolution,[status(thm)],[c_521,c_413]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_545,plain,
% 0.20/0.47 ( leq(v0,sk3_esk3_0) ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_544]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_81,plain,
% 0.20/0.47 ( leq(X0,X1) | ~ in_lopen(X0,X2,X1) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_356_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_442,plain,
% 0.20/0.47 ( leq(X0,X1) | ~ in_lopen(X0,X2,X1) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_81]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_518,plain,
% 0.20/0.47 ( leq(sk3_esk3_0,v32) ),
% 0.20/0.47 inference(resolution,[status(thm)],[c_484,c_442]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_519,plain,
% 0.20/0.47 ( leq(sk3_esk3_0,v32) ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_518]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_67,plain,
% 0.20/0.47 ( less(X0,X1) | X0 = X1 | ~ leq(X0,X1) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_370_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_414,plain,
% 0.20/0.47 ( less(X0,X1) | X0 = X1 | ~ leq(X0,X1) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_67]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_415,plain,
% 0.20/0.47 ( less(X0,X1) | ~ leq(X0,X1) | X0 = X1 ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_414]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_540,plain,
% 0.20/0.47 ( less(sk3_esk3_0,v32) | sk3_esk3_0 = v32 ),
% 0.20/0.47 inference(resolution,[status(thm)],[c_519,c_415]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_541,plain,
% 0.20/0.47 ( less(sk3_esk3_0,v32) | sk3_esk3_0 = v32 ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_540]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_101,negated_conjecture,
% 0.20/0.47 ( in_lopen(sk3_esk2_0,v0,v800) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_10) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_134,negated_conjecture,
% 0.20/0.47 ( in_lopen(sk3_esk2_0,v0,v800) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_101]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_157,negated_conjecture,
% 0.20/0.47 ( in_lopen(sk3_esk2_0,v0,v800) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_134]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_166,negated_conjecture,
% 0.20/0.47 ( in_lopen(sk3_esk2_0,v0,v800) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_157]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_169,negated_conjecture,
% 0.20/0.47 ( in_lopen(sk3_esk2_0,v0,v800) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_166]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_482,negated_conjecture,
% 0.20/0.47 ( in_lopen(sk3_esk2_0,v0,v800) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_169]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_514,plain,
% 0.20/0.47 ( less(v0,sk3_esk2_0) ),
% 0.20/0.47 inference(resolution,[status(thm)],[c_482,c_444]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_515,plain,
% 0.20/0.47 ( less(v0,sk3_esk2_0) ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_514]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_536,plain,
% 0.20/0.47 ( leq(v0,sk3_esk2_0) ),
% 0.20/0.47 inference(resolution,[status(thm)],[c_515,c_413]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_537,plain,
% 0.20/0.47 ( leq(v0,sk3_esk2_0) ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_536]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_512,plain,
% 0.20/0.47 ( leq(sk3_esk2_0,v800) ),
% 0.20/0.47 inference(resolution,[status(thm)],[c_482,c_442]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_513,plain,
% 0.20/0.47 ( leq(sk3_esk2_0,v800) ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_512]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_532,plain,
% 0.20/0.47 ( less(sk3_esk2_0,v800) | sk3_esk2_0 = v800 ),
% 0.20/0.47 inference(resolution,[status(thm)],[c_513,c_415]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_533,plain,
% 0.20/0.47 ( less(sk3_esk2_0,v800) | sk3_esk2_0 = v800 ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_532]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_100,negated_conjecture,
% 0.20/0.47 ( in_lopen(sk3_esk1_0,v0,v600) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_9) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_132,negated_conjecture,
% 0.20/0.47 ( in_lopen(sk3_esk1_0,v0,v600) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_100]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_156,negated_conjecture,
% 0.20/0.47 ( in_lopen(sk3_esk1_0,v0,v600) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_132]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_167,negated_conjecture,
% 0.20/0.47 ( in_lopen(sk3_esk1_0,v0,v600) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_156]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_168,negated_conjecture,
% 0.20/0.47 ( in_lopen(sk3_esk1_0,v0,v600) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_167]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_480,negated_conjecture,
% 0.20/0.47 ( in_lopen(sk3_esk1_0,v0,v600) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_168]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_508,plain,
% 0.20/0.47 ( less(v0,sk3_esk1_0) ),
% 0.20/0.47 inference(resolution,[status(thm)],[c_480,c_444]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_509,plain,
% 0.20/0.47 ( less(v0,sk3_esk1_0) ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_508]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_528,plain,
% 0.20/0.47 ( leq(v0,sk3_esk1_0) ),
% 0.20/0.47 inference(resolution,[status(thm)],[c_509,c_413]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_529,plain,
% 0.20/0.47 ( leq(v0,sk3_esk1_0) ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_528]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_506,plain,
% 0.20/0.47 ( leq(sk3_esk1_0,v600) ),
% 0.20/0.47 inference(resolution,[status(thm)],[c_480,c_442]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_507,plain,
% 0.20/0.47 ( leq(sk3_esk1_0,v600) ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_506]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_524,plain,
% 0.20/0.47 ( less(sk3_esk1_0,v600) | sk3_esk1_0 = v600 ),
% 0.20/0.47 inference(resolution,[status(thm)],[c_507,c_415]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_525,plain,
% 0.20/0.47 ( less(sk3_esk1_0,v600) | sk3_esk1_0 = v600 ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_524]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_105,negated_conjecture,
% 0.20/0.47 ( leq(v8,sk3_esk3_0) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_14) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_142,negated_conjecture,
% 0.20/0.47 ( leq(v8,sk3_esk3_0) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_105]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_161,negated_conjecture,
% 0.20/0.47 ( leq(v8,sk3_esk3_0) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_142]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_162,negated_conjecture,
% 0.20/0.47 ( leq(v8,sk3_esk3_0) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_161]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_173,negated_conjecture,
% 0.20/0.47 ( leq(v8,sk3_esk3_0) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_162]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_490,negated_conjecture,
% 0.20/0.47 ( leq(v8,sk3_esk3_0) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_173]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_502,plain,
% 0.20/0.47 ( less(v8,sk3_esk3_0) | v8 = sk3_esk3_0 ),
% 0.20/0.47 inference(resolution,[status(thm)],[c_490,c_415]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_503,plain,
% 0.20/0.47 ( less(v8,sk3_esk3_0) | v8 = sk3_esk3_0 ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_502]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_104,negated_conjecture,
% 0.20/0.47 ( leq(v200,sk3_esk2_0) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_13) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_140,negated_conjecture,
% 0.20/0.47 ( leq(v200,sk3_esk2_0) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_104]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_160,negated_conjecture,
% 0.20/0.47 ( leq(v200,sk3_esk2_0) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_140]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_163,negated_conjecture,
% 0.20/0.47 ( leq(v200,sk3_esk2_0) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_160]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_172,negated_conjecture,
% 0.20/0.47 ( leq(v200,sk3_esk2_0) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_163]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_488,negated_conjecture,
% 0.20/0.47 ( leq(v200,sk3_esk2_0) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_172]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_498,plain,
% 0.20/0.47 ( less(v200,sk3_esk2_0) | v200 = sk3_esk2_0 ),
% 0.20/0.47 inference(resolution,[status(thm)],[c_488,c_415]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_499,plain,
% 0.20/0.47 ( less(v200,sk3_esk2_0) | v200 = sk3_esk2_0 ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_498]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_103,negated_conjecture,
% 0.20/0.47 ( leq(v1200,sk3_esk1_0) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_12) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_138,negated_conjecture,
% 0.20/0.47 ( leq(v1200,sk3_esk1_0) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_103]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_159,negated_conjecture,
% 0.20/0.47 ( leq(v1200,sk3_esk1_0) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_138]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_164,negated_conjecture,
% 0.20/0.47 ( leq(v1200,sk3_esk1_0) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_159]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_171,negated_conjecture,
% 0.20/0.47 ( leq(v1200,sk3_esk1_0) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_164]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_486,negated_conjecture,
% 0.20/0.47 ( leq(v1200,sk3_esk1_0) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_171]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_494,plain,
% 0.20/0.47 ( less(v1200,sk3_esk1_0) | v1200 = sk3_esk1_0 ),
% 0.20/0.47 inference(resolution,[status(thm)],[c_486,c_415]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_495,plain,
% 0.20/0.47 ( less(v1200,sk3_esk1_0) | v1200 = sk3_esk1_0 ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_494]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_89,plain,
% 0.20/0.47 ( ~ leq(X0,X1) | ~ less(X1,X2) | in_ropen(X1,X0,X2) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_348_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_458,plain,
% 0.20/0.47 ( ~ leq(X0,X1) | ~ less(X1,X2) | in_ropen(X1,X0,X2) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_89]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_459,plain,
% 0.20/0.47 ( ~ less(X0,X1) | ~ leq(X2,X0) | in_ropen(X0,X2,X1) ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_458]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_77,plain,
% 0.20/0.47 ( ~ less(X0,X1) | ~ leq(X1,X2) | less(X0,X2) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_360_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_434,plain,
% 0.20/0.47 ( ~ less(X0,X1) | ~ leq(X1,X2) | less(X0,X2) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_77]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_435,plain,
% 0.20/0.47 ( ~ less(X0,X1) | less(X0,X2) | ~ leq(X1,X2) ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_434]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_76,plain,
% 0.20/0.47 ( ~ leq(X0,X1) | ~ less(X1,X2) | less(X0,X2) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_361_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_432,plain,
% 0.20/0.47 ( ~ leq(X0,X1) | ~ less(X1,X2) | less(X0,X2) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_76]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_433,plain,
% 0.20/0.47 ( ~ less(X0,X1) | less(X2,X1) | ~ leq(X2,X0) ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_432]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_72,plain,
% 0.20/0.47 ( X0 != unknown
% 0.20/0.47 | ~ is_verdict(X1)
% 0.20/0.47 | ~ is_verdict(X0)
% 0.20/0.47 | X0 = conflict
% 0.20/0.47 | X1 = conflict
% 0.20/0.47 | box_verdict(X0,X1) = unknown ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_365_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_424,plain,
% 0.20/0.47 ( X0 != unknown
% 0.20/0.47 | ~ is_verdict(X1)
% 0.20/0.47 | ~ is_verdict(X0)
% 0.20/0.47 | X0 = conflict
% 0.20/0.47 | X1 = conflict
% 0.20/0.47 | box_verdict(X0,X1) = unknown ),
% 0.20/0.47 inference(copy,[status(esa)],[c_72]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_425,plain,
% 0.20/0.47 ( ~ is_verdict(X0)
% 0.20/0.47 | ~ is_verdict(X1)
% 0.20/0.47 | box_verdict(X1,X0) = unknown
% 0.20/0.47 | X1 != unknown
% 0.20/0.47 | X1 = conflict
% 0.20/0.47 | X0 = conflict ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_424]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_71,plain,
% 0.20/0.47 ( X0 != unknown
% 0.20/0.47 | ~ is_verdict(X0)
% 0.20/0.47 | ~ is_verdict(X1)
% 0.20/0.47 | X1 = conflict
% 0.20/0.47 | X0 = conflict
% 0.20/0.47 | box_verdict(X1,X0) = unknown ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_366_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_422,plain,
% 0.20/0.47 ( X0 != unknown
% 0.20/0.47 | ~ is_verdict(X0)
% 0.20/0.47 | ~ is_verdict(X1)
% 0.20/0.47 | X1 = conflict
% 0.20/0.47 | X0 = conflict
% 0.20/0.47 | box_verdict(X1,X0) = unknown ),
% 0.20/0.47 inference(copy,[status(esa)],[c_71]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_423,plain,
% 0.20/0.47 ( ~ is_verdict(X0)
% 0.20/0.47 | ~ is_verdict(X1)
% 0.20/0.47 | box_verdict(X1,X0) = unknown
% 0.20/0.47 | X0 != unknown
% 0.20/0.47 | X1 = conflict
% 0.20/0.47 | X0 = conflict ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_422]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_70,plain,
% 0.20/0.47 ( ~ is_verdict(X0)
% 0.20/0.47 | ~ is_verdict(X1)
% 0.20/0.47 | X0 != compatible
% 0.20/0.47 | X1 != compatible
% 0.20/0.47 | box_verdict(X0,X1) = compatible ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_367_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_420,plain,
% 0.20/0.47 ( ~ is_verdict(X0)
% 0.20/0.47 | ~ is_verdict(X1)
% 0.20/0.47 | X0 != compatible
% 0.20/0.47 | X1 != compatible
% 0.20/0.47 | box_verdict(X0,X1) = compatible ),
% 0.20/0.47 inference(copy,[status(esa)],[c_70]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_421,plain,
% 0.20/0.47 ( ~ is_verdict(X0)
% 0.20/0.47 | ~ is_verdict(X1)
% 0.20/0.47 | box_verdict(X0,X1) = compatible
% 0.20/0.47 | X0 != compatible
% 0.20/0.47 | X1 != compatible ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_420]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_69,plain,
% 0.20/0.47 ( X0 != conflict
% 0.20/0.47 | ~ is_verdict(X1)
% 0.20/0.47 | ~ is_verdict(X0)
% 0.20/0.47 | box_verdict(X0,X1) = conflict ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_368_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_418,plain,
% 0.20/0.47 ( X0 != conflict
% 0.20/0.47 | ~ is_verdict(X1)
% 0.20/0.47 | ~ is_verdict(X0)
% 0.20/0.47 | box_verdict(X0,X1) = conflict ),
% 0.20/0.47 inference(copy,[status(esa)],[c_69]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_419,plain,
% 0.20/0.47 ( ~ is_verdict(X0)
% 0.20/0.47 | ~ is_verdict(X1)
% 0.20/0.47 | box_verdict(X1,X0) = conflict
% 0.20/0.47 | X1 != conflict ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_418]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_68,plain,
% 0.20/0.47 ( X0 != conflict
% 0.20/0.47 | ~ is_verdict(X0)
% 0.20/0.47 | ~ is_verdict(X1)
% 0.20/0.47 | box_verdict(X1,X0) = conflict ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_369_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_416,plain,
% 0.20/0.47 ( X0 != conflict
% 0.20/0.47 | ~ is_verdict(X0)
% 0.20/0.47 | ~ is_verdict(X1)
% 0.20/0.47 | box_verdict(X1,X0) = conflict ),
% 0.20/0.47 inference(copy,[status(esa)],[c_68]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_417,plain,
% 0.20/0.47 ( ~ is_verdict(X0)
% 0.20/0.47 | ~ is_verdict(X1)
% 0.20/0.47 | box_verdict(X1,X0) = conflict
% 0.20/0.47 | X0 != conflict ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_416]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_65,plain,
% 0.20/0.47 ( X0 != X1 | leq(X0,X1) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_372_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_410,plain,
% 0.20/0.47 ( X0 != X1 | leq(X0,X1) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_65]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_411,plain,
% 0.20/0.47 ( leq(X0,X1) | X0 != X1 ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_410]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_64,plain,
% 0.20/0.47 ( X0 = conflict | X0 = compatible | X0 = unknown | ~ is_verdict(X0) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_373_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_408,plain,
% 0.20/0.47 ( X0 = conflict | X0 = compatible | X0 = unknown | ~ is_verdict(X0) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_64]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_409,plain,
% 0.20/0.47 ( ~ is_verdict(X0) | X0 = unknown | X0 = compatible | X0 = conflict ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_408]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_7,plain,
% 0.20/0.47 ( less(X0,X1) | X1 = X0 | less(X1,X0) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_9_2) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_294,plain,
% 0.20/0.47 ( less(X0,X1) | X1 = X0 | less(X1,X0) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_7]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_295,plain,
% 0.20/0.47 ( less(X0,X1) | less(X1,X0) | X1 = X0 ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_294]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_4,plain,
% 0.20/0.47 ( box_verdict(X0,X1) = unknown
% 0.20/0.47 | box_verdict(X0,X1) = compatible
% 0.20/0.47 | box_verdict(X0,X1) = conflict
% 0.20/0.47 | ~ is_verdict(X1)
% 0.20/0.47 | ~ is_verdict(X0) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_8_4) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_288,plain,
% 0.20/0.47 ( box_verdict(X0,X1) = unknown
% 0.20/0.47 | box_verdict(X0,X1) = compatible
% 0.20/0.47 | box_verdict(X0,X1) = conflict
% 0.20/0.47 | ~ is_verdict(X1)
% 0.20/0.47 | ~ is_verdict(X0) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_4]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_289,plain,
% 0.20/0.47 ( ~ is_verdict(X0)
% 0.20/0.47 | ~ is_verdict(X1)
% 0.20/0.47 | box_verdict(X1,X0) = unknown
% 0.20/0.47 | box_verdict(X1,X0) = compatible
% 0.20/0.47 | box_verdict(X1,X0) = conflict ),
% 0.20/0.47 inference(rewriting,[status(thm)],[c_288]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_99,plain,
% 0.20/0.47 ( ~ in_closed(sk1_esk3_4(X0,X1,X2,X3),X0,X1)
% 0.20/0.47 | axis_subsumes(X2,X3,X0,X1) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_338_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_478,plain,
% 0.20/0.47 ( ~ in_closed(sk1_esk3_4(X0,X1,X2,X3),X0,X1)
% 0.20/0.47 | axis_subsumes(X2,X3,X0,X1) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_99]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_98,plain,
% 0.20/0.47 ( in_closed(sk1_esk3_4(X0,X1,X2,X3),X2,X3) | axis_subsumes(X2,X3,X0,X1) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_339_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_476,plain,
% 0.20/0.47 ( in_closed(sk1_esk3_4(X0,X1,X2,X3),X2,X3) | axis_subsumes(X2,X3,X0,X1) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_98]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_97,plain,
% 0.20/0.47 ( in_closed(sk1_esk2_4(X0,X1,X2,X3),X2,X3)
% 0.20/0.47 | ~ axis_compatible(X2,X3,X0,X1) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_340_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_474,plain,
% 0.20/0.47 ( in_closed(sk1_esk2_4(X0,X1,X2,X3),X2,X3)
% 0.20/0.47 | ~ axis_compatible(X2,X3,X0,X1) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_97]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_96,plain,
% 0.20/0.47 ( in_closed(sk1_esk2_4(X0,X1,X2,X3),X0,X1)
% 0.20/0.47 | ~ axis_compatible(X2,X3,X0,X1) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_341_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_472,plain,
% 0.20/0.47 ( in_closed(sk1_esk2_4(X0,X1,X2,X3),X0,X1)
% 0.20/0.47 | ~ axis_compatible(X2,X3,X0,X1) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_96]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_95,plain,
% 0.20/0.47 ( in_closed(sk1_esk1_4(X0,X1,X2,X3),X2,X3) | axis_conflict(X2,X3,X0,X1) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_342_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_470,plain,
% 0.20/0.47 ( in_closed(sk1_esk1_4(X0,X1,X2,X3),X2,X3) | axis_conflict(X2,X3,X0,X1) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_95]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_94,plain,
% 0.20/0.47 ( in_closed(sk1_esk1_4(X0,X1,X2,X3),X0,X1) | axis_conflict(X2,X3,X0,X1) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_343_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_468,plain,
% 0.20/0.47 ( in_closed(sk1_esk1_4(X0,X1,X2,X3),X0,X1) | axis_conflict(X2,X3,X0,X1) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_94]) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_93,plain,
% 0.20/0.47 ( ~ in_closed(X0,X1,X2)
% 0.20/0.47 | ~ in_closed(X0,X3,X4)
% 0.20/0.47 | axis_compatible(X1,X2,X3,X4) ),
% 0.20/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_344_0) ).
% 0.20/0.47
% 0.20/0.47 cnf(c_466,plain,
% 0.20/0.47 ( ~ in_closed(X0,X1,X2)
% 0.20/0.47 | ~ in_closed(X0,X3,X4)
% 0.20/0.47 | axis_compatible(X1,X2,X3,X4) ),
% 0.20/0.47 inference(copy,[status(esa)],[c_93]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_92,plain,
% 0.20/0.48 ( ~ in_closed(X0,X1,X2)
% 0.20/0.48 | ~ in_closed(X0,X3,X4)
% 0.20/0.48 | ~ axis_conflict(X1,X2,X3,X4) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_345_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_464,plain,
% 0.20/0.48 ( ~ in_closed(X0,X1,X2)
% 0.20/0.48 | ~ in_closed(X0,X3,X4)
% 0.20/0.48 | ~ axis_conflict(X1,X2,X3,X4) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_92]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_91,plain,
% 0.20/0.48 ( ~ in_closed(X0,X1,X2)
% 0.20/0.48 | in_closed(X0,X3,X4)
% 0.20/0.48 | ~ axis_subsumes(X1,X2,X3,X4) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_346_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_462,plain,
% 0.20/0.48 ( ~ in_closed(X0,X1,X2)
% 0.20/0.48 | in_closed(X0,X3,X4)
% 0.20/0.48 | ~ axis_subsumes(X1,X2,X3,X4) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_91]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_90,plain,
% 0.20/0.48 ( ~ less(X0,X1) | ~ less(X1,X2) | in_open(X1,X0,X2) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_347_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_460,plain,
% 0.20/0.48 ( ~ less(X0,X1) | ~ less(X1,X2) | in_open(X1,X0,X2) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_90]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_88,plain,
% 0.20/0.48 ( ~ less(X0,X1) | ~ leq(X1,X2) | in_lopen(X1,X0,X2) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_349_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_456,plain,
% 0.20/0.48 ( ~ less(X0,X1) | ~ leq(X1,X2) | in_lopen(X1,X0,X2) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_88]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_87,plain,
% 0.20/0.48 ( ~ leq(X0,X1) | ~ leq(X1,X2) | in_closed(X1,X0,X2) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_350_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_454,plain,
% 0.20/0.48 ( ~ leq(X0,X1) | ~ leq(X1,X2) | in_closed(X1,X0,X2) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_87]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_86,plain,
% 0.20/0.48 ( less(X0,X1) | ~ in_open(X1,X0,X2) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_351_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_452,plain,
% 0.20/0.48 ( less(X0,X1) | ~ in_open(X1,X0,X2) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_86]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_85,plain,
% 0.20/0.48 ( less(X0,X1) | ~ in_open(X0,X2,X1) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_352_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_450,plain,
% 0.20/0.48 ( less(X0,X1) | ~ in_open(X0,X2,X1) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_85]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_84,plain,
% 0.20/0.48 ( leq(X0,X1) | ~ in_ropen(X1,X0,X2) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_353_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_448,plain,
% 0.20/0.48 ( leq(X0,X1) | ~ in_ropen(X1,X0,X2) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_84]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_83,plain,
% 0.20/0.48 ( less(X0,X1) | ~ in_ropen(X0,X2,X1) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_354_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_446,plain,
% 0.20/0.48 ( less(X0,X1) | ~ in_ropen(X0,X2,X1) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_83]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_80,plain,
% 0.20/0.48 ( leq(X0,X1) | ~ in_closed(X1,X0,X2) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_357_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_440,plain,
% 0.20/0.48 ( leq(X0,X1) | ~ in_closed(X1,X0,X2) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_80]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_79,plain,
% 0.20/0.48 ( leq(X0,X1) | ~ in_closed(X0,X2,X1) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_358_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_438,plain,
% 0.20/0.48 ( leq(X0,X1) | ~ in_closed(X0,X2,X1) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_79]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_78,plain,
% 0.20/0.48 ( ~ leq(X0,X1) | ~ leq(X1,X2) | leq(X0,X2) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_359_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_436,plain,
% 0.20/0.48 ( ~ leq(X0,X1) | ~ leq(X1,X2) | leq(X0,X2) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_78]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_75,plain,
% 0.20/0.48 ( ~ leq(X0,X1) | ~ leq(X1,X0) | X0 = X1 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_362_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_430,plain,
% 0.20/0.48 ( ~ leq(X0,X1) | ~ leq(X1,X0) | X0 = X1 ),
% 0.20/0.48 inference(copy,[status(esa)],[c_75]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_74,plain,
% 0.20/0.48 ( ~ less(X0,X1) | ~ less(X1,X2) | less(X0,X2) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_363_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_428,plain,
% 0.20/0.48 ( ~ less(X0,X1) | ~ less(X1,X2) | less(X0,X2) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_74]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_63,plain,
% 0.20/0.48 ( ~ less(X0,X0) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_374_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_406,plain,( ~ less(X0,X0) ),inference(copy,[status(esa)],[c_63]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_62,plain,
% 0.20/0.48 ( v0 != v8 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_375_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_404,plain,( v0 != v8 ),inference(copy,[status(esa)],[c_62]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_61,plain,
% 0.20/0.48 ( v0 != v32 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_376_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_402,plain,( v0 != v32 ),inference(copy,[status(esa)],[c_61]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_60,plain,
% 0.20/0.48 ( v0 != v200 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_377_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_400,plain,( v0 != v200 ),inference(copy,[status(esa)],[c_60]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_59,plain,
% 0.20/0.48 ( v0 != v600 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_378_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_398,plain,( v0 != v600 ),inference(copy,[status(esa)],[c_59]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_58,plain,
% 0.20/0.48 ( v0 != v800 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_379_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_396,plain,( v0 != v800 ),inference(copy,[status(esa)],[c_58]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_57,plain,
% 0.20/0.48 ( v0 != v1200 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_380_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_394,plain,( v0 != v1200 ),inference(copy,[status(esa)],[c_57]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_56,plain,
% 0.20/0.48 ( v8 != v32 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_381_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_392,plain,( v8 != v32 ),inference(copy,[status(esa)],[c_56]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_55,plain,
% 0.20/0.48 ( v8 != v200 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_382_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_390,plain,( v8 != v200 ),inference(copy,[status(esa)],[c_55]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_54,plain,
% 0.20/0.48 ( v8 != v600 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_383_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_388,plain,( v8 != v600 ),inference(copy,[status(esa)],[c_54]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_53,plain,
% 0.20/0.48 ( v8 != v800 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_384_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_386,plain,( v8 != v800 ),inference(copy,[status(esa)],[c_53]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_52,plain,
% 0.20/0.48 ( v8 != v1200 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_385_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_384,plain,( v8 != v1200 ),inference(copy,[status(esa)],[c_52]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_51,plain,
% 0.20/0.48 ( v32 != v200 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_386_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_382,plain,( v32 != v200 ),inference(copy,[status(esa)],[c_51]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_50,plain,
% 0.20/0.48 ( v32 != v600 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_387_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_380,plain,( v32 != v600 ),inference(copy,[status(esa)],[c_50]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_49,plain,
% 0.20/0.48 ( v32 != v800 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_388_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_378,plain,( v32 != v800 ),inference(copy,[status(esa)],[c_49]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_48,plain,
% 0.20/0.48 ( v32 != v1200 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_389_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_376,plain,( v32 != v1200 ),inference(copy,[status(esa)],[c_48]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_47,plain,
% 0.20/0.48 ( v200 != v600 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_390_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_374,plain,( v200 != v600 ),inference(copy,[status(esa)],[c_47]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_46,plain,
% 0.20/0.48 ( v200 != v800 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_391_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_372,plain,( v200 != v800 ),inference(copy,[status(esa)],[c_46]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_45,plain,
% 0.20/0.48 ( v200 != v1200 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_392_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_370,plain,( v200 != v1200 ),inference(copy,[status(esa)],[c_45]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_44,plain,
% 0.20/0.48 ( v600 != v800 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_393_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_368,plain,( v600 != v800 ),inference(copy,[status(esa)],[c_44]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_43,plain,
% 0.20/0.48 ( v600 != v1200 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_394_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_366,plain,( v600 != v1200 ),inference(copy,[status(esa)],[c_43]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_42,plain,
% 0.20/0.48 ( v800 != v1200 ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_395_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_364,plain,( v800 != v1200 ),inference(copy,[status(esa)],[c_42]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_41,plain,
% 0.20/0.48 ( less(v800,v1200) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_396_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_362,plain,( less(v800,v1200) ),inference(copy,[status(esa)],[c_41]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_40,plain,
% 0.20/0.48 ( less(v600,v1200) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_397_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_360,plain,( less(v600,v1200) ),inference(copy,[status(esa)],[c_40]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_39,plain,
% 0.20/0.48 ( less(v600,v800) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_398_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_358,plain,( less(v600,v800) ),inference(copy,[status(esa)],[c_39]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_38,plain,
% 0.20/0.48 ( less(v200,v1200) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_399_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_356,plain,( less(v200,v1200) ),inference(copy,[status(esa)],[c_38]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_37,plain,
% 0.20/0.48 ( less(v200,v800) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_400_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_354,plain,( less(v200,v800) ),inference(copy,[status(esa)],[c_37]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_36,plain,
% 0.20/0.48 ( less(v200,v600) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_401_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_352,plain,( less(v200,v600) ),inference(copy,[status(esa)],[c_36]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_35,plain,
% 0.20/0.48 ( less(v32,v1200) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_402_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_350,plain,( less(v32,v1200) ),inference(copy,[status(esa)],[c_35]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_34,plain,
% 0.20/0.48 ( less(v32,v800) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_403_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_348,plain,( less(v32,v800) ),inference(copy,[status(esa)],[c_34]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_33,plain,
% 0.20/0.48 ( less(v32,v600) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_404_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_346,plain,( less(v32,v600) ),inference(copy,[status(esa)],[c_33]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_32,plain,
% 0.20/0.48 ( less(v32,v200) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_405_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_344,plain,( less(v32,v200) ),inference(copy,[status(esa)],[c_32]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_31,plain,
% 0.20/0.48 ( less(v8,v1200) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_406_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_342,plain,( less(v8,v1200) ),inference(copy,[status(esa)],[c_31]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_30,plain,
% 0.20/0.48 ( less(v8,v800) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_407_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_340,plain,( less(v8,v800) ),inference(copy,[status(esa)],[c_30]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_29,plain,
% 0.20/0.48 ( less(v8,v600) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_408_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_338,plain,( less(v8,v600) ),inference(copy,[status(esa)],[c_29]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_28,plain,
% 0.20/0.48 ( less(v8,v200) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_409_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_336,plain,( less(v8,v200) ),inference(copy,[status(esa)],[c_28]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_27,plain,
% 0.20/0.48 ( less(v8,v32) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_410_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_334,plain,( less(v8,v32) ),inference(copy,[status(esa)],[c_27]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_26,plain,
% 0.20/0.48 ( less(v0,v1200) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_411_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_332,plain,( less(v0,v1200) ),inference(copy,[status(esa)],[c_26]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_25,plain,
% 0.20/0.48 ( less(v0,v800) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_412_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_330,plain,( less(v0,v800) ),inference(copy,[status(esa)],[c_25]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_24,plain,
% 0.20/0.48 ( less(v0,v600) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_413_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_328,plain,( less(v0,v600) ),inference(copy,[status(esa)],[c_24]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_23,plain,
% 0.20/0.48 ( less(v0,v200) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_414_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_326,plain,( less(v0,v200) ),inference(copy,[status(esa)],[c_23]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_22,plain,
% 0.20/0.48 ( less(v0,v32) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_415_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_324,plain,( less(v0,v32) ),inference(copy,[status(esa)],[c_22]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_21,plain,
% 0.20/0.48 ( less(v0,v8) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_416_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_322,plain,( less(v0,v8) ),inference(copy,[status(esa)],[c_21]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_20,plain,
% 0.20/0.48 ( val(v1200) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_417_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_320,plain,( val(v1200) ),inference(copy,[status(esa)],[c_20]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_19,plain,
% 0.20/0.48 ( val(v800) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_418_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_318,plain,( val(v800) ),inference(copy,[status(esa)],[c_19]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_18,plain,
% 0.20/0.48 ( val(v600) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_419_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_316,plain,( val(v600) ),inference(copy,[status(esa)],[c_18]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_17,plain,
% 0.20/0.48 ( val(v200) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_420_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_314,plain,( val(v200) ),inference(copy,[status(esa)],[c_17]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_16,plain,
% 0.20/0.48 ( val(v32) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_421_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_312,plain,( val(v32) ),inference(copy,[status(esa)],[c_16]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_15,plain,
% 0.20/0.48 ( val(v8) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_422_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_310,plain,( val(v8) ),inference(copy,[status(esa)],[c_15]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_14,plain,
% 0.20/0.48 ( val(v0) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_423_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_308,plain,( val(v0) ),inference(copy,[status(esa)],[c_14]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_13,plain,
% 0.20/0.48 ( compatible != unknown ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_424_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_306,plain,
% 0.20/0.48 ( compatible != unknown ),
% 0.20/0.48 inference(copy,[status(esa)],[c_13]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_12,plain,
% 0.20/0.48 ( conflict != unknown ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_425_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_304,plain,
% 0.20/0.48 ( conflict != unknown ),
% 0.20/0.48 inference(copy,[status(esa)],[c_12]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_11,plain,
% 0.20/0.48 ( conflict != compatible ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_426_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_302,plain,
% 0.20/0.48 ( conflict != compatible ),
% 0.20/0.48 inference(copy,[status(esa)],[c_11]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_10,plain,
% 0.20/0.48 ( is_verdict(unknown) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_427_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_300,plain,
% 0.20/0.48 ( is_verdict(unknown) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_10]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_9,plain,
% 0.20/0.48 ( is_verdict(compatible) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_428_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_298,plain,
% 0.20/0.48 ( is_verdict(compatible) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_9]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_8,plain,
% 0.20/0.48 ( is_verdict(conflict) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_429_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_296,plain,
% 0.20/0.48 ( is_verdict(conflict) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_8]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_5,plain,
% 0.20/0.48 ( less(X0,X1) | X0 = X1 | less(X1,X0) ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_9_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_290,plain,
% 0.20/0.48 ( less(X0,X1) | X0 = X1 | less(X1,X0) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_5]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_291,plain,
% 0.20/0.48 ( less(X0,X1) | less(X1,X0) | X0 = X1 ),
% 0.20/0.48 inference(rewriting,[status(thm)],[c_290]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_0,plain,
% 0.20/0.48 ( ~ is_verdict(X0)
% 0.20/0.48 | ~ is_verdict(X1)
% 0.20/0.48 | box_verdict(X0,X1) = conflict
% 0.20/0.48 | box_verdict(X0,X1) = compatible
% 0.20/0.48 | box_verdict(X0,X1) = unknown ),
% 0.20/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_a768df.p', c_0_8_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_280,plain,
% 0.20/0.48 ( ~ is_verdict(X0)
% 0.20/0.48 | ~ is_verdict(X1)
% 0.20/0.48 | box_verdict(X0,X1) = conflict
% 0.20/0.48 | box_verdict(X0,X1) = compatible
% 0.20/0.48 | box_verdict(X0,X1) = unknown ),
% 0.20/0.48 inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_281,plain,
% 0.20/0.48 ( ~ is_verdict(X0)
% 0.20/0.48 | ~ is_verdict(X1)
% 0.20/0.48 | box_verdict(X0,X1) = unknown
% 0.20/0.48 | box_verdict(X0,X1) = compatible
% 0.20/0.48 | box_verdict(X0,X1) = conflict ),
% 0.20/0.48 inference(rewriting,[status(thm)],[c_280]) ).
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 % ------ Statistics
% 0.20/0.48
% 0.20/0.48 % ------ General
% 0.20/0.48
% 0.20/0.48 % num_of_input_clauses: 106
% 0.20/0.48 % num_of_input_neg_conjectures: 6
% 0.20/0.48 % num_of_splits: 0
% 0.20/0.48 % num_of_split_atoms: 0
% 0.20/0.48 % num_of_sem_filtered_clauses: 0
% 0.20/0.48 % num_of_subtypes: 0
% 0.20/0.48 % monotx_restored_types: 0
% 0.20/0.48 % sat_num_of_epr_types: 0
% 0.20/0.48 % sat_num_of_non_cyclic_types: 0
% 0.20/0.48 % sat_guarded_non_collapsed_types: 0
% 0.20/0.48 % is_epr: 0
% 0.20/0.48 % is_horn: 0
% 0.20/0.48 % has_eq: 1
% 0.20/0.48 % num_pure_diseq_elim: 0
% 0.20/0.48 % simp_replaced_by: 0
% 0.20/0.48 % res_preprocessed: 12
% 0.20/0.48 % prep_upred: 0
% 0.20/0.48 % prep_unflattend: 0
% 0.20/0.48 % pred_elim_cands: 0
% 0.20/0.48 % pred_elim: 0
% 0.20/0.48 % pred_elim_cl: 0
% 0.20/0.48 % pred_elim_cycles: 0
% 0.20/0.48 % forced_gc_time: 0
% 0.20/0.48 % gc_basic_clause_elim: 0
% 0.20/0.48 % parsing_time: 0.003
% 0.20/0.48 % sem_filter_time: 0.
% 0.20/0.48 % pred_elim_time: 0.
% 0.20/0.48 % out_proof_time: 0.
% 0.20/0.48 % monotx_time: 0.
% 0.20/0.48 % subtype_inf_time: 0.
% 0.20/0.48 % unif_index_cands_time: 0.
% 0.20/0.48 % unif_index_add_time: 0.
% 0.20/0.48 % total_time: 0.055
% 0.20/0.48 % num_of_symbols: 53
% 0.20/0.48 % num_of_terms: 286
% 0.20/0.48
% 0.20/0.48 % ------ Propositional Solver
% 0.20/0.48
% 0.20/0.48 % prop_solver_calls: 1
% 0.20/0.48 % prop_fast_solver_calls: 18
% 0.20/0.48 % prop_num_of_clauses: 126
% 0.20/0.48 % prop_preprocess_simplified: 224
% 0.20/0.48 % prop_fo_subsumed: 0
% 0.20/0.48 % prop_solver_time: 0.
% 0.20/0.48 % prop_fast_solver_time: 0.
% 0.20/0.48 % prop_unsat_core_time: 0.
% 0.20/0.48
% 0.20/0.48 % ------ QBF
% 0.20/0.48
% 0.20/0.48 % qbf_q_res: 0
% 0.20/0.48 % qbf_num_tautologies: 0
% 0.20/0.48 % qbf_prep_cycles: 0
% 0.20/0.48
% 0.20/0.48 % ------ BMC1
% 0.20/0.48
% 0.20/0.48 % bmc1_current_bound: -1
% 0.20/0.48 % bmc1_last_solved_bound: -1
% 0.20/0.48 % bmc1_unsat_core_size: -1
% 0.20/0.48 % bmc1_unsat_core_parents_size: -1
% 0.20/0.48 % bmc1_merge_next_fun: 0
% 0.20/0.48 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.48
% 0.20/0.48 % ------ Instantiation
% 0.20/0.48
% 0.20/0.48 % inst_num_of_clauses: 106
% 0.20/0.48 % inst_num_in_passive: 0
% 0.20/0.48 % inst_num_in_active: 0
% 0.20/0.48 % inst_num_in_unprocessed: 106
% 0.20/0.48 % inst_num_of_loops: 0
% 0.20/0.48 % inst_num_of_learning_restarts: 0
% 0.20/0.48 % inst_num_moves_active_passive: 0
% 0.20/0.48 % inst_lit_activity: 0
% 0.20/0.48 % inst_lit_activity_moves: 0
% 0.20/0.48 % inst_num_tautologies: 0
% 0.20/0.48 % inst_num_prop_implied: 0
% 0.20/0.48 % inst_num_existing_simplified: 0
% 0.20/0.48 % inst_num_eq_res_simplified: 0
% 0.20/0.48 % inst_num_child_elim: 0
% 0.20/0.48 % inst_num_of_dismatching_blockings: 0
% 0.20/0.48 % inst_num_of_non_proper_insts: 0
% 0.20/0.48 % inst_num_of_duplicates: 0
% 0.20/0.48 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.48 % inst_dismatching_checking_time: 0.
% 0.20/0.48
% 0.20/0.48 % ------ Resolution
% 0.20/0.48
% 0.20/0.48 % res_num_of_clauses: 134
% 0.20/0.48 % res_num_in_passive: 0
% 0.20/0.48 % res_num_in_active: 116
% 0.20/0.48 % res_num_of_loops: 22
% 0.20/0.48 % res_forward_subset_subsumed: 8
% 0.20/0.48 % res_backward_subset_subsumed: 0
% 0.20/0.48 % res_forward_subsumed: 0
% 0.20/0.48 % res_backward_subsumed: 0
% 0.20/0.48 % res_forward_subsumption_resolution: 0
% 0.20/0.48 % res_backward_subsumption_resolution: 0
% 0.20/0.48 % res_clause_to_clause_subsumption: 9
% 0.20/0.48 % res_orphan_elimination: 0
% 0.20/0.48 % res_tautology_del: 0
% 0.20/0.48 % res_num_eq_res_simplified: 0
% 0.20/0.48 % res_num_sel_changes: 0
% 0.20/0.48 % res_moves_from_active_to_pass: 0
% 0.20/0.48
% 0.20/0.48 % Status Unknown
% 0.20/0.53 % Orienting using strategy ClausalAll
% 0.20/0.53 % FOF problem with conjecture
% 0.20/0.53 % 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_04391e.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_a768df.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_b3f36c | grep -v "SZS"
% 0.30/0.56
% 0.30/0.56 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.30/0.56
% 0.30/0.56 %
% 0.30/0.56 % ------ iProver source info
% 0.30/0.56
% 0.30/0.56 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.30/0.56 % git: non_committed_changes: true
% 0.30/0.56 % git: last_make_outside_of_git: true
% 0.30/0.56
% 0.30/0.56 %
% 0.30/0.56 % ------ Input Options
% 0.30/0.56
% 0.30/0.56 % --out_options all
% 0.30/0.56 % --tptp_safe_out true
% 0.30/0.56 % --problem_path ""
% 0.30/0.56 % --include_path ""
% 0.30/0.56 % --clausifier .//eprover
% 0.30/0.56 % --clausifier_options --tstp-format
% 0.30/0.56 % --stdin false
% 0.30/0.56 % --dbg_backtrace false
% 0.30/0.56 % --dbg_dump_prop_clauses false
% 0.30/0.56 % --dbg_dump_prop_clauses_file -
% 0.30/0.56 % --dbg_out_stat false
% 0.30/0.56
% 0.30/0.56 % ------ General Options
% 0.30/0.56
% 0.30/0.56 % --fof false
% 0.30/0.56 % --time_out_real 150.
% 0.30/0.56 % --time_out_prep_mult 0.2
% 0.30/0.56 % --time_out_virtual -1.
% 0.30/0.56 % --schedule none
% 0.30/0.56 % --ground_splitting input
% 0.30/0.56 % --splitting_nvd 16
% 0.30/0.56 % --non_eq_to_eq false
% 0.30/0.56 % --prep_gs_sim true
% 0.30/0.56 % --prep_unflatten false
% 0.30/0.56 % --prep_res_sim true
% 0.30/0.56 % --prep_upred true
% 0.30/0.56 % --res_sim_input true
% 0.30/0.56 % --clause_weak_htbl true
% 0.30/0.56 % --gc_record_bc_elim false
% 0.30/0.56 % --symbol_type_check false
% 0.30/0.56 % --clausify_out false
% 0.30/0.56 % --large_theory_mode false
% 0.30/0.56 % --prep_sem_filter none
% 0.30/0.56 % --prep_sem_filter_out false
% 0.30/0.56 % --preprocessed_out false
% 0.30/0.56 % --sub_typing false
% 0.30/0.56 % --brand_transform false
% 0.30/0.56 % --pure_diseq_elim true
% 0.30/0.56 % --min_unsat_core false
% 0.30/0.56 % --pred_elim true
% 0.30/0.56 % --add_important_lit false
% 0.30/0.56 % --soft_assumptions false
% 0.30/0.56 % --reset_solvers false
% 0.30/0.56 % --bc_imp_inh []
% 0.30/0.56 % --conj_cone_tolerance 1.5
% 0.30/0.56 % --prolific_symb_bound 500
% 0.30/0.56 % --lt_threshold 2000
% 0.30/0.56
% 0.30/0.56 % ------ SAT Options
% 0.30/0.56
% 0.30/0.56 % --sat_mode false
% 0.30/0.56 % --sat_fm_restart_options ""
% 0.30/0.56 % --sat_gr_def false
% 0.30/0.56 % --sat_epr_types true
% 0.30/0.56 % --sat_non_cyclic_types false
% 0.30/0.56 % --sat_finite_models false
% 0.30/0.56 % --sat_fm_lemmas false
% 0.30/0.56 % --sat_fm_prep false
% 0.30/0.56 % --sat_fm_uc_incr true
% 0.30/0.56 % --sat_out_model small
% 0.30/0.56 % --sat_out_clauses false
% 0.30/0.56
% 0.30/0.56 % ------ QBF Options
% 0.30/0.56
% 0.30/0.56 % --qbf_mode false
% 0.30/0.56 % --qbf_elim_univ true
% 0.30/0.56 % --qbf_sk_in true
% 0.30/0.56 % --qbf_pred_elim true
% 0.30/0.56 % --qbf_split 32
% 0.30/0.56
% 0.30/0.56 % ------ BMC1 Options
% 0.30/0.56
% 0.30/0.56 % --bmc1_incremental false
% 0.30/0.56 % --bmc1_axioms reachable_all
% 0.30/0.56 % --bmc1_min_bound 0
% 0.30/0.56 % --bmc1_max_bound -1
% 0.30/0.56 % --bmc1_max_bound_default -1
% 0.30/0.56 % --bmc1_symbol_reachability true
% 0.30/0.56 % --bmc1_property_lemmas false
% 0.30/0.56 % --bmc1_k_induction false
% 0.30/0.56 % --bmc1_non_equiv_states false
% 0.30/0.56 % --bmc1_deadlock false
% 0.30/0.56 % --bmc1_ucm false
% 0.30/0.56 % --bmc1_add_unsat_core none
% 0.30/0.56 % --bmc1_unsat_core_children false
% 0.30/0.56 % --bmc1_unsat_core_extrapolate_axioms false
% 0.30/0.56 % --bmc1_out_stat full
% 0.30/0.56 % --bmc1_ground_init false
% 0.30/0.56 % --bmc1_pre_inst_next_state false
% 0.30/0.56 % --bmc1_pre_inst_state false
% 0.30/0.56 % --bmc1_pre_inst_reach_state false
% 0.30/0.56 % --bmc1_out_unsat_core false
% 0.30/0.56 % --bmc1_aig_witness_out false
% 0.30/0.56 % --bmc1_verbose false
% 0.30/0.56 % --bmc1_dump_clauses_tptp false
% 0.30/0.58 % --bmc1_dump_unsat_core_tptp false
% 0.30/0.58 % --bmc1_dump_file -
% 0.30/0.58 % --bmc1_ucm_expand_uc_limit 128
% 0.30/0.58 % --bmc1_ucm_n_expand_iterations 6
% 0.30/0.58 % --bmc1_ucm_extend_mode 1
% 0.30/0.58 % --bmc1_ucm_init_mode 2
% 0.30/0.58 % --bmc1_ucm_cone_mode none
% 0.30/0.58 % --bmc1_ucm_reduced_relation_type 0
% 0.30/0.58 % --bmc1_ucm_relax_model 4
% 0.30/0.58 % --bmc1_ucm_full_tr_after_sat true
% 0.30/0.58 % --bmc1_ucm_expand_neg_assumptions false
% 0.30/0.58 % --bmc1_ucm_layered_model none
% 0.30/0.58 % --bmc1_ucm_max_lemma_size 10
% 0.30/0.58
% 0.30/0.58 % ------ AIG Options
% 0.30/0.58
% 0.30/0.58 % --aig_mode false
% 0.30/0.58
% 0.30/0.58 % ------ Instantiation Options
% 0.30/0.58
% 0.30/0.58 % --instantiation_flag true
% 0.30/0.58 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.30/0.58 % --inst_solver_per_active 750
% 0.30/0.58 % --inst_solver_calls_frac 0.5
% 0.30/0.58 % --inst_passive_queue_type priority_queues
% 0.30/0.58 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.30/0.58 % --inst_passive_queues_freq [25;2]
% 0.30/0.58 % --inst_dismatching true
% 0.30/0.58 % --inst_eager_unprocessed_to_passive true
% 0.30/0.58 % --inst_prop_sim_given true
% 0.30/0.58 % --inst_prop_sim_new false
% 0.30/0.58 % --inst_orphan_elimination true
% 0.30/0.58 % --inst_learning_loop_flag true
% 0.30/0.58 % --inst_learning_start 3000
% 0.30/0.58 % --inst_learning_factor 2
% 0.30/0.58 % --inst_start_prop_sim_after_learn 3
% 0.30/0.58 % --inst_sel_renew solver
% 0.30/0.58 % --inst_lit_activity_flag true
% 0.30/0.58 % --inst_out_proof true
% 0.30/0.58
% 0.30/0.58 % ------ Resolution Options
% 0.30/0.58
% 0.30/0.58 % --resolution_flag true
% 0.30/0.58 % --res_lit_sel kbo_max
% 0.30/0.58 % --res_to_prop_solver none
% 0.30/0.58 % --res_prop_simpl_new false
% 0.30/0.58 % --res_prop_simpl_given false
% 0.30/0.58 % --res_passive_queue_type priority_queues
% 0.30/0.58 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.30/0.58 % --res_passive_queues_freq [15;5]
% 0.30/0.58 % --res_forward_subs full
% 0.30/0.58 % --res_backward_subs full
% 0.30/0.58 % --res_forward_subs_resolution true
% 0.30/0.58 % --res_backward_subs_resolution true
% 0.30/0.58 % --res_orphan_elimination false
% 0.30/0.58 % --res_time_limit 1000.
% 0.30/0.58 % --res_out_proof true
% 0.30/0.58 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_04391e.s
% 0.30/0.58 % --modulo true
% 0.30/0.58
% 0.30/0.58 % ------ Combination Options
% 0.30/0.58
% 0.30/0.58 % --comb_res_mult 1000
% 0.30/0.58 % --comb_inst_mult 300
% 0.30/0.58 % ------
% 0.30/0.58
% 0.30/0.58 % ------ Parsing...% successful
% 0.30/0.58
% 0.30/0.58 % ------ 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.30/0.58
% 0.30/0.58 % ------ Proving...
% 0.30/0.58 % ------ Problem Properties
% 0.30/0.58
% 0.30/0.58 %
% 0.30/0.58 % EPR false
% 0.30/0.58 % Horn false
% 0.30/0.58 % Has equality true
% 0.30/0.58
% 0.30/0.58 % % ------ Input Options Time Limit: Unbounded
% 0.30/0.58
% 0.30/0.58
% 0.30/0.58 % % ------ Current options:
% 0.30/0.58
% 0.30/0.58 % ------ Input Options
% 0.30/0.58
% 0.30/0.58 % --out_options all
% 0.30/0.58 % --tptp_safe_out true
% 0.30/0.58 % --problem_path ""
% 0.30/0.58 % --include_path ""
% 0.30/0.58 % --clausifier .//eprover
% 0.30/0.58 % --clausifier_options --tstp-format
% 0.30/0.58 % --stdin false
% 0.30/0.58 % --dbg_backtrace false
% 0.30/0.58 % --dbg_dump_prop_clauses false
% 0.30/0.58 % --dbg_dump_prop_clauses_file -
% 0.30/0.58 % --dbg_out_stat false
% 0.30/0.58
% 0.30/0.58 % ------ General Options
% 0.30/0.58
% 0.30/0.58 % --fof false
% 0.30/0.58 % --time_out_real 150.
% 0.30/0.58 % --time_out_prep_mult 0.2
% 0.30/0.58 % --time_out_virtual -1.
% 0.30/0.58 % --schedule none
% 0.30/0.58 % --ground_splitting input
% 0.30/0.58 % --splitting_nvd 16
% 0.30/0.58 % --non_eq_to_eq false
% 0.30/0.58 % --prep_gs_sim true
% 0.30/0.58 % --prep_unflatten false
% 0.30/0.58 % --prep_res_sim true
% 0.30/0.58 % --prep_upred true
% 0.30/0.58 % --res_sim_input true
% 0.30/0.58 % --clause_weak_htbl true
% 0.30/0.58 % --gc_record_bc_elim false
% 0.30/0.58 % --symbol_type_check false
% 0.30/0.58 % --clausify_out false
% 0.30/0.58 % --large_theory_mode false
% 0.30/0.58 % --prep_sem_filter none
% 0.30/0.58 % --prep_sem_filter_out false
% 0.30/0.58 % --preprocessed_out false
% 0.30/0.58 % --sub_typing false
% 0.30/0.58 % --brand_transform false
% 0.30/0.58 % --pure_diseq_elim true
% 0.30/0.58 % --min_unsat_core false
% 0.30/0.58 % --pred_elim true
% 0.30/0.58 % --add_important_lit false
% 0.30/0.58 % --soft_assumptions false
% 0.30/0.58 % --reset_solvers false
% 0.30/0.58 % --bc_imp_inh []
% 0.30/0.58 % --conj_cone_tolerance 1.5
% 0.30/0.58 % --prolific_symb_bound 500
% 0.30/0.58 % --lt_threshold 2000
% 0.30/0.58
% 0.30/0.58 % ------ SAT Options
% 0.30/0.58
% 0.30/0.58 % --sat_mode false
% 0.30/0.58 % --sat_fm_restart_options ""
% 0.30/0.58 % --sat_gr_def false
% 0.30/0.58 % --sat_epr_types true
% 0.30/0.58 % --sat_non_cyclic_types false
% 0.30/0.58 % --sat_finite_models false
% 0.30/0.58 % --sat_fm_lemmas false
% 0.30/0.58 % --sat_fm_prep false
% 0.30/0.58 % --sat_fm_uc_incr true
% 0.30/0.58 % --sat_out_model small
% 0.30/0.58 % --sat_out_clauses false
% 0.30/0.58
% 0.30/0.58 % ------ QBF Options
% 0.30/0.58
% 0.30/0.58 % --qbf_mode false
% 0.30/0.58 % --qbf_elim_univ true
% 0.30/0.58 % --qbf_sk_in true
% 0.30/0.58 % --qbf_pred_elim true
% 0.30/0.58 % --qbf_split 32
% 0.30/0.58
% 0.30/0.58 % ------ BMC1 Options
% 0.30/0.58
% 0.30/0.58 % --bmc1_incremental false
% 0.30/0.58 % --bmc1_axioms reachable_all
% 0.30/0.58 % --bmc1_min_bound 0
% 0.30/0.58 % --bmc1_max_bound -1
% 0.30/0.58 % --bmc1_max_bound_default -1
% 0.30/0.58 % --bmc1_symbol_reachability true
% 0.30/0.58 % --bmc1_property_lemmas false
% 0.30/0.58 % --bmc1_k_induction false
% 0.30/0.58 % --bmc1_non_equiv_states false
% 0.30/0.58 % --bmc1_deadlock false
% 0.30/0.58 % --bmc1_ucm false
% 0.30/0.58 % --bmc1_add_unsat_core none
% 0.30/0.58 % --bmc1_unsat_core_children false
% 0.30/0.58 % --bmc1_unsat_core_extrapolate_axioms false
% 0.30/0.58 % --bmc1_out_stat full
% 0.30/0.58 % --bmc1_ground_init false
% 0.30/0.58 % --bmc1_pre_inst_next_state false
% 0.30/0.58 % --bmc1_pre_inst_state false
% 0.30/0.58 % --bmc1_pre_inst_reach_state false
% 0.30/0.58 % --bmc1_out_unsat_core false
% 0.30/0.58 % --bmc1_aig_witness_out false
% 0.30/0.58 % --bmc1_verbose false
% 0.30/0.58 % --bmc1_dump_clauses_tptp false
% 0.30/0.58 % --bmc1_dump_unsat_core_tptp false
% 0.30/0.58 % --bmc1_dump_file -
% 0.30/0.58 % --bmc1_ucm_expand_uc_limit 128
% 0.30/0.58 % --bmc1_ucm_n_expand_iterations 6
% 0.30/0.58 % --bmc1_ucm_extend_mode 1
% 0.30/0.58 % --bmc1_ucm_init_mode 2
% 0.30/0.58 % --bmc1_ucm_cone_mode none
% 0.30/0.58 % --bmc1_ucm_reduced_relation_type 0
% 0.30/0.58 % --bmc1_ucm_relax_model 4
% 0.30/0.58 % --bmc1_ucm_full_tr_after_sat true
% 0.30/0.58 % --bmc1_ucm_expand_neg_assumptions false
% 0.30/0.58 % --bmc1_ucm_layered_model none
% 0.30/0.58 % --bmc1_ucm_max_lemma_size 10
% 0.30/0.58
% 0.30/0.58 % ------ AIG Options
% 0.30/0.58
% 0.30/0.58 % --aig_mode false
% 0.30/0.58
% 0.30/0.58 % ------ Instantiation Options
% 0.30/0.58
% 0.30/0.58 % --instantiation_flag true
% 0.30/0.58 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.30/0.58 % --inst_solver_per_active 750
% 0.30/0.58 % --inst_solver_calls_frac 0.5
% 0.30/0.58 % --inst_passive_queue_type priority_queues
% 0.30/0.58 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.30/0.58 % --inst_passive_queues_freq [25;2]
% 0.30/0.58 % --inst_dismatching true
% 0.30/0.58 % --inst_eager_unprocessed_to_passive true
% 0.30/0.58 % --inst_prop_sim_given true
% 0.30/0.65 % --inst_prop_sim_new false
% 0.30/0.65 % --inst_orphan_elimination true
% 0.30/0.65 % --inst_learning_loop_flag true
% 0.30/0.65 % --inst_learning_start 3000
% 0.30/0.65 % --inst_learning_factor 2
% 0.30/0.65 % --inst_start_prop_sim_after_learn 3
% 0.30/0.65 % --inst_sel_renew solver
% 0.30/0.65 % --inst_lit_activity_flag true
% 0.30/0.65 % --inst_out_proof true
% 0.30/0.65
% 0.30/0.65 % ------ Resolution Options
% 0.30/0.65
% 0.30/0.65 % --resolution_flag true
% 0.30/0.65 % --res_lit_sel kbo_max
% 0.30/0.65 % --res_to_prop_solver none
% 0.30/0.65 % --res_prop_simpl_new false
% 0.30/0.65 % --res_prop_simpl_given false
% 0.30/0.65 % --res_passive_queue_type priority_queues
% 0.30/0.65 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.30/0.65 % --res_passive_queues_freq [15;5]
% 0.30/0.65 % --res_forward_subs full
% 0.30/0.65 % --res_backward_subs full
% 0.30/0.65 % --res_forward_subs_resolution true
% 0.30/0.65 % --res_backward_subs_resolution true
% 0.30/0.65 % --res_orphan_elimination false
% 0.30/0.65 % --res_time_limit 1000.
% 0.30/0.65 % --res_out_proof true
% 0.30/0.65 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_04391e.s
% 0.30/0.65 % --modulo true
% 0.30/0.65
% 0.30/0.65 % ------ Combination Options
% 0.30/0.65
% 0.30/0.65 % --comb_res_mult 1000
% 0.30/0.65 % --comb_inst_mult 300
% 0.30/0.65 % ------
% 0.30/0.65
% 0.30/0.65
% 0.30/0.65
% 0.30/0.65 % ------ Proving...
% 0.30/0.65 %
% 0.30/0.65
% 0.30/0.65
% 0.30/0.65 % Resolution empty clause
% 0.30/0.65
% 0.30/0.65 % ------ Statistics
% 0.30/0.65
% 0.30/0.65 % ------ General
% 0.30/0.65
% 0.30/0.65 % num_of_input_clauses: 172
% 0.30/0.65 % num_of_input_neg_conjectures: 6
% 0.30/0.65 % num_of_splits: 0
% 0.30/0.65 % num_of_split_atoms: 0
% 0.30/0.65 % num_of_sem_filtered_clauses: 0
% 0.30/0.65 % num_of_subtypes: 0
% 0.30/0.65 % monotx_restored_types: 0
% 0.30/0.65 % sat_num_of_epr_types: 0
% 0.30/0.65 % sat_num_of_non_cyclic_types: 0
% 0.30/0.65 % sat_guarded_non_collapsed_types: 0
% 0.30/0.65 % is_epr: 0
% 0.30/0.65 % is_horn: 0
% 0.30/0.65 % has_eq: 1
% 0.30/0.65 % num_pure_diseq_elim: 0
% 0.30/0.65 % simp_replaced_by: 0
% 0.30/0.65 % res_preprocessed: 12
% 0.30/0.65 % prep_upred: 0
% 0.30/0.65 % prep_unflattend: 0
% 0.30/0.65 % pred_elim_cands: 0
% 0.30/0.65 % pred_elim: 0
% 0.30/0.65 % pred_elim_cl: 0
% 0.30/0.65 % pred_elim_cycles: 0
% 0.30/0.65 % forced_gc_time: 0
% 0.30/0.65 % gc_basic_clause_elim: 0
% 0.30/0.65 % parsing_time: 0.007
% 0.30/0.65 % sem_filter_time: 0.
% 0.30/0.65 % pred_elim_time: 0.
% 0.30/0.65 % out_proof_time: 0.001
% 0.30/0.65 % monotx_time: 0.
% 0.30/0.65 % subtype_inf_time: 0.
% 0.30/0.65 % unif_index_cands_time: 0.
% 0.30/0.65 % unif_index_add_time: 0.
% 0.30/0.65 % total_time: 0.113
% 0.30/0.65 % num_of_symbols: 53
% 0.30/0.65 % num_of_terms: 1039
% 0.30/0.65
% 0.30/0.65 % ------ Propositional Solver
% 0.30/0.65
% 0.30/0.65 % prop_solver_calls: 1
% 0.30/0.65 % prop_fast_solver_calls: 18
% 0.30/0.65 % prop_num_of_clauses: 147
% 0.30/0.65 % prop_preprocess_simplified: 467
% 0.30/0.65 % prop_fo_subsumed: 0
% 0.30/0.65 % prop_solver_time: 0.
% 0.30/0.65 % prop_fast_solver_time: 0.
% 0.30/0.65 % prop_unsat_core_time: 0.
% 0.30/0.65
% 0.30/0.65 % ------ QBF
% 0.30/0.65
% 0.30/0.65 % qbf_q_res: 0
% 0.30/0.65 % qbf_num_tautologies: 0
% 0.30/0.65 % qbf_prep_cycles: 0
% 0.30/0.65
% 0.30/0.65 % ------ BMC1
% 0.30/0.65
% 0.30/0.65 % bmc1_current_bound: -1
% 0.30/0.65 % bmc1_last_solved_bound: -1
% 0.30/0.65 % bmc1_unsat_core_size: -1
% 0.30/0.65 % bmc1_unsat_core_parents_size: -1
% 0.30/0.65 % bmc1_merge_next_fun: 0
% 0.30/0.65 % bmc1_unsat_core_clauses_time: 0.
% 0.30/0.65
% 0.30/0.65 % ------ Instantiation
% 0.30/0.65
% 0.30/0.65 % inst_num_of_clauses: 170
% 0.30/0.65 % inst_num_in_passive: 0
% 0.30/0.65 % inst_num_in_active: 0
% 0.30/0.65 % inst_num_in_unprocessed: 172
% 0.30/0.65 % inst_num_of_loops: 0
% 0.30/0.66 % inst_num_of_learning_restarts: 0
% 0.30/0.66 % inst_num_moves_active_passive: 0
% 0.30/0.66 % inst_lit_activity: 0
% 0.30/0.66 % inst_lit_activity_moves: 0
% 0.30/0.66 % inst_num_tautologies: 0
% 0.30/0.66 % inst_num_prop_implied: 0
% 0.30/0.66 % inst_num_existing_simplified: 0
% 0.30/0.66 % inst_num_eq_res_simplified: 0
% 0.30/0.66 % inst_num_child_elim: 0
% 0.30/0.66 % inst_num_of_dismatching_blockings: 0
% 0.30/0.66 % inst_num_of_non_proper_insts: 0
% 0.30/0.66 % inst_num_of_duplicates: 0
% 0.30/0.66 % inst_inst_num_from_inst_to_res: 0
% 0.30/0.66 % inst_dismatching_checking_time: 0.
% 0.30/0.66
% 0.30/0.66 % ------ Resolution
% 0.30/0.66
% 0.30/0.66 % res_num_of_clauses: 888
% 0.30/0.66 % res_num_in_passive: 580
% 0.30/0.66 % res_num_in_active: 260
% 0.30/0.66 % res_num_of_loops: 171
% 0.30/0.66 % res_forward_subset_subsumed: 474
% 0.30/0.66 % res_backward_subset_subsumed: 44
% 0.30/0.66 % res_forward_subsumed: 24
% 0.30/0.66 % res_backward_subsumed: 0
% 0.30/0.66 % res_forward_subsumption_resolution: 1
% 0.30/0.66 % res_backward_subsumption_resolution: 0
% 0.30/0.66 % res_clause_to_clause_subsumption: 659
% 0.30/0.66 % res_orphan_elimination: 0
% 0.30/0.66 % res_tautology_del: 32
% 0.30/0.66 % res_num_eq_res_simplified: 0
% 0.30/0.66 % res_num_sel_changes: 0
% 0.30/0.66 % res_moves_from_active_to_pass: 0
% 0.30/0.66
% 0.30/0.66 % Status Unsatisfiable
% 0.30/0.66 % SZS status Theorem
% 0.30/0.66 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------