%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT081+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n017.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.34s 0.60s
% Output : CNFRefutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 51
% Syntax : Number of formulae : 455 ( 193 unt; 0 def)
% Number of atoms : 1093 ( 310 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 1128 ( 490 ~; 502 |; 96 &)
% ( 16 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-4 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-4 aty)
% Number of variables : 759 ( 34 sgn 193 !; 8 ?)
% 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(v600,v800),
file('<stdin>',ord_v600_v800) ).
fof(c_0_22,axiom,
less(v400,v800),
file('<stdin>',ord_v400_v800) ).
fof(c_0_23,axiom,
less(v400,v600),
file('<stdin>',ord_v400_v600) ).
fof(c_0_24,axiom,
less(v200,v800),
file('<stdin>',ord_v200_v800) ).
fof(c_0_25,axiom,
less(v200,v600),
file('<stdin>',ord_v200_v600) ).
fof(c_0_26,axiom,
less(v200,v400),
file('<stdin>',ord_v200_v400) ).
fof(c_0_27,axiom,
less(v0,v800),
file('<stdin>',ord_v0_v800) ).
fof(c_0_28,axiom,
less(v0,v600),
file('<stdin>',ord_v0_v600) ).
fof(c_0_29,axiom,
less(v0,v400),
file('<stdin>',ord_v0_v400) ).
fof(c_0_30,axiom,
less(v0,v200),
file('<stdin>',ord_v0_v200) ).
fof(c_0_31,axiom,
val(v800),
file('<stdin>',val_v800) ).
fof(c_0_32,axiom,
val(v600),
file('<stdin>',val_v600) ).
fof(c_0_33,axiom,
val(v400),
file('<stdin>',val_v400) ).
fof(c_0_34,axiom,
val(v200),
file('<stdin>',val_v200) ).
fof(c_0_35,axiom,
val(v0),
file('<stdin>',val_v0) ).
fof(c_0_36,axiom,
is_verdict(unknown),
file('<stdin>',unknown_is_verdict) ).
fof(c_0_37,axiom,
is_verdict(compatible),
file('<stdin>',compatible_is_verdict) ).
fof(c_0_38,axiom,
is_verdict(conflict),
file('<stdin>',conflict_is_verdict) ).
fof(c_0_39,axiom,
( v0 != v200
& v0 != v400
& v0 != v600
& v0 != v800
& v200 != v400
& v200 != v600
& v200 != v800
& v400 != v600
& v400 != v800
& v600 != v800 ),
file('<stdin>',distinct) ).
fof(c_0_40,axiom,
compatible != unknown,
file('<stdin>',verdicts_distinct_cp_un) ).
fof(c_0_41,axiom,
conflict != unknown,
file('<stdin>',verdicts_distinct_cf_un) ).
fof(c_0_42,axiom,
conflict != compatible,
file('<stdin>',verdicts_distinct_cf_cp) ).
fof(c_0_43,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_44,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_45,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_46,axiom,
! [X1,X4,X5] :
( in_open(X1,X4,X5)
<=> ( less(X4,X1)
& less(X1,X5) ) ),
c_0_3 ).
fof(c_0_47,axiom,
! [X1,X4,X5] :
( in_ropen(X1,X4,X5)
<=> ( leq(X4,X1)
& less(X1,X5) ) ),
c_0_4 ).
fof(c_0_48,axiom,
! [X1,X4,X5] :
( in_lopen(X1,X4,X5)
<=> ( less(X4,X1)
& leq(X1,X5) ) ),
c_0_5 ).
fof(c_0_49,axiom,
! [X1,X4,X5] :
( in_closed(X1,X4,X5)
<=> ( leq(X4,X1)
& leq(X1,X5) ) ),
c_0_6 ).
fof(c_0_50,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
c_0_7 ).
fof(c_0_51,axiom,
! [X1,X2,X3] :
( ( less(X1,X2)
& leq(X2,X3) )
=> less(X1,X3) ),
c_0_8 ).
fof(c_0_52,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& less(X2,X3) )
=> less(X1,X3) ),
c_0_9 ).
fof(c_0_53,axiom,
! [X1,X2,X3] :
( ( less(X1,X2)
& less(X2,X3) )
=> less(X1,X3) ),
c_0_10 ).
fof(c_0_54,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_55,axiom,
! [X1,X2] :
( ( leq(X1,X2)
& leq(X2,X1) )
=> X1 = X2 ),
c_0_12 ).
fof(c_0_56,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> ( less(X1,X2)
| X1 = X2 ) ),
c_0_13 ).
fof(c_0_57,axiom,
! [X1,X2] :
( less(X1,X2)
=> leq(X1,X2) ),
c_0_14 ).
fof(c_0_58,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_59,axiom,
! [X11,X12] :
( ( is_verdict(X11)
& is_verdict(X12)
& X11 = compatible
& X12 = compatible )
=> box_verdict(X11,X12) = compatible ),
c_0_16 ).
fof(c_0_60,axiom,
! [X11,X12] :
( ( is_verdict(X11)
& is_verdict(X12)
& ( X11 = conflict
| X12 = conflict ) )
=> box_verdict(X11,X12) = conflict ),
c_0_17 ).
fof(c_0_61,axiom,
! [X1,X2] :
( less(X1,X2)
| X1 = X2
| less(X2,X1) ),
c_0_18 ).
fof(c_0_62,plain,
! [X1] : ~ less(X1,X1),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
fof(c_0_63,axiom,
! [X10] :
( is_verdict(X10)
=> ( X10 = conflict
| X10 = compatible
| X10 = unknown ) ),
c_0_20 ).
fof(c_0_64,axiom,
less(v600,v800),
c_0_21 ).
fof(c_0_65,axiom,
less(v400,v800),
c_0_22 ).
fof(c_0_66,axiom,
less(v400,v600),
c_0_23 ).
fof(c_0_67,axiom,
less(v200,v800),
c_0_24 ).
fof(c_0_68,axiom,
less(v200,v600),
c_0_25 ).
fof(c_0_69,axiom,
less(v200,v400),
c_0_26 ).
fof(c_0_70,axiom,
less(v0,v800),
c_0_27 ).
fof(c_0_71,axiom,
less(v0,v600),
c_0_28 ).
fof(c_0_72,axiom,
less(v0,v400),
c_0_29 ).
fof(c_0_73,axiom,
less(v0,v200),
c_0_30 ).
fof(c_0_74,axiom,
val(v800),
c_0_31 ).
fof(c_0_75,axiom,
val(v600),
c_0_32 ).
fof(c_0_76,axiom,
val(v400),
c_0_33 ).
fof(c_0_77,axiom,
val(v200),
c_0_34 ).
fof(c_0_78,axiom,
val(v0),
c_0_35 ).
fof(c_0_79,axiom,
is_verdict(unknown),
c_0_36 ).
fof(c_0_80,axiom,
is_verdict(compatible),
c_0_37 ).
fof(c_0_81,axiom,
is_verdict(conflict),
c_0_38 ).
fof(c_0_82,axiom,
( v0 != v200
& v0 != v400
& v0 != v600
& v0 != v800
& v200 != v400
& v200 != v600
& v200 != v800
& v400 != v600
& v400 != v800
& v600 != v800 ),
c_0_39 ).
fof(c_0_83,axiom,
compatible != unknown,
c_0_40 ).
fof(c_0_84,axiom,
conflict != unknown,
c_0_41 ).
fof(c_0_85,axiom,
conflict != compatible,
c_0_42 ).
fof(c_0_86,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_43])])])])])]) ).
fof(c_0_87,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_44])])])])])]) ).
fof(c_0_88,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_45])])])])])]) ).
fof(c_0_89,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_46])])])])]) ).
fof(c_0_90,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_47])])])])]) ).
fof(c_0_91,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_48])])])])]) ).
fof(c_0_92,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_49])])])])]) ).
fof(c_0_93,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_50])]) ).
fof(c_0_94,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_51])]) ).
fof(c_0_95,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_52])]) ).
fof(c_0_96,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_53])]) ).
fof(c_0_97,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_54])]) ).
fof(c_0_98,plain,
! [X3,X4] :
( ~ leq(X3,X4)
| ~ leq(X4,X3)
| X3 = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_55])]) ).
fof(c_0_99,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_56])])])])]) ).
fof(c_0_100,plain,
! [X3,X4] :
( ~ less(X3,X4)
| leq(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_57])]) ).
fof(c_0_101,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_58])])]) ).
fof(c_0_102,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_59])]) ).
fof(c_0_103,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_60])])]) ).
fof(c_0_104,plain,
! [X3,X4] :
( less(X3,X4)
| X3 = X4
| less(X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_61]) ).
fof(c_0_105,plain,
! [X2] : ~ less(X2,X2),
inference(variable_rename,[status(thm)],[c_0_62]) ).
fof(c_0_106,plain,
! [X11] :
( ~ is_verdict(X11)
| X11 = conflict
| X11 = compatible
| X11 = unknown ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_63])]) ).
fof(c_0_107,axiom,
less(v600,v800),
c_0_64 ).
fof(c_0_108,axiom,
less(v400,v800),
c_0_65 ).
fof(c_0_109,axiom,
less(v400,v600),
c_0_66 ).
fof(c_0_110,axiom,
less(v200,v800),
c_0_67 ).
fof(c_0_111,axiom,
less(v200,v600),
c_0_68 ).
fof(c_0_112,axiom,
less(v200,v400),
c_0_69 ).
fof(c_0_113,axiom,
less(v0,v800),
c_0_70 ).
fof(c_0_114,axiom,
less(v0,v600),
c_0_71 ).
fof(c_0_115,axiom,
less(v0,v400),
c_0_72 ).
fof(c_0_116,axiom,
less(v0,v200),
c_0_73 ).
fof(c_0_117,axiom,
val(v800),
c_0_74 ).
fof(c_0_118,axiom,
val(v600),
c_0_75 ).
fof(c_0_119,axiom,
val(v400),
c_0_76 ).
fof(c_0_120,axiom,
val(v200),
c_0_77 ).
fof(c_0_121,axiom,
val(v0),
c_0_78 ).
fof(c_0_122,axiom,
is_verdict(unknown),
c_0_79 ).
fof(c_0_123,axiom,
is_verdict(compatible),
c_0_80 ).
fof(c_0_124,axiom,
is_verdict(conflict),
c_0_81 ).
fof(c_0_125,axiom,
( v0 != v200
& v0 != v400
& v0 != v600
& v0 != v800
& v200 != v400
& v200 != v600
& v200 != v800
& v400 != v600
& v400 != v800
& v600 != v800 ),
c_0_82 ).
fof(c_0_126,axiom,
compatible != unknown,
c_0_83 ).
fof(c_0_127,axiom,
conflict != unknown,
c_0_84 ).
fof(c_0_128,axiom,
conflict != compatible,
c_0_85 ).
cnf(c_0_129,plain,
( axis_subsumes(X1,X2,X3,X4)
| ~ in_closed(esk3_4(X1,X2,X3,X4),X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_130,plain,
( in_closed(esk2_4(X1,X2,X3,X4),X1,X2)
| ~ axis_compatible(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_131,plain,
( in_closed(esk2_4(X1,X2,X3,X4),X3,X4)
| ~ axis_compatible(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_132,plain,
( axis_subsumes(X1,X2,X3,X4)
| in_closed(esk3_4(X1,X2,X3,X4),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_133,plain,
( axis_conflict(X1,X2,X3,X4)
| in_closed(esk1_4(X1,X2,X3,X4),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_134,plain,
( axis_conflict(X1,X2,X3,X4)
| in_closed(esk1_4(X1,X2,X3,X4),X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_135,plain,
( ~ in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5)
| ~ axis_conflict(X4,X5,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_136,plain,
( in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5)
| ~ axis_subsumes(X4,X5,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_137,plain,
( axis_compatible(X1,X2,X3,X4)
| ~ in_closed(X5,X3,X4)
| ~ in_closed(X5,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_138,plain,
( less(X2,X1)
| ~ in_open(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_139,plain,
( less(X1,X3)
| ~ in_open(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_140,plain,
( leq(X2,X1)
| ~ in_ropen(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_141,plain,
( less(X1,X3)
| ~ in_ropen(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_142,plain,
( less(X2,X1)
| ~ in_lopen(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_143,plain,
( leq(X1,X3)
| ~ in_lopen(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_144,plain,
( leq(X2,X1)
| ~ in_closed(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_145,plain,
( leq(X1,X3)
| ~ in_closed(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_146,plain,
( in_open(X1,X2,X3)
| ~ less(X1,X3)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_147,plain,
( in_ropen(X1,X2,X3)
| ~ less(X1,X3)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_148,plain,
( in_lopen(X1,X2,X3)
| ~ leq(X1,X3)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_149,plain,
( in_closed(X1,X2,X3)
| ~ leq(X1,X3)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_150,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_93]) ).
cnf(c_0_151,plain,
( less(X1,X2)
| ~ leq(X3,X2)
| ~ less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_152,plain,
( less(X1,X2)
| ~ less(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_153,plain,
( less(X1,X2)
| ~ less(X3,X2)
| ~ less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_154,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_97]) ).
cnf(c_0_155,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_98]) ).
cnf(c_0_156,plain,
( X1 = X2
| less(X1,X2)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_99]) ).
cnf(c_0_157,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_100]) ).
cnf(c_0_158,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_99]) ).
cnf(c_0_159,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_101]) ).
cnf(c_0_160,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_101]) ).
cnf(c_0_161,plain,
( box_verdict(X1,X2) = compatible
| X2 != compatible
| X1 != compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_162,plain,
( box_verdict(X1,X2) = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != conflict ),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_163,plain,
( box_verdict(X1,X2) = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X2 != conflict ),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_164,plain,
( less(X1,X2)
| X2 = X1
| less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_165,plain,
~ less(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_105]) ).
cnf(c_0_166,plain,
( leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_99]) ).
cnf(c_0_167,plain,
( X1 = unknown
| X1 = compatible
| X1 = conflict
| ~ is_verdict(X1) ),
inference(split_conjunct,[status(thm)],[c_0_106]) ).
cnf(c_0_168,plain,
less(v600,v800),
inference(split_conjunct,[status(thm)],[c_0_107]) ).
cnf(c_0_169,plain,
less(v400,v800),
inference(split_conjunct,[status(thm)],[c_0_108]) ).
cnf(c_0_170,plain,
less(v400,v600),
inference(split_conjunct,[status(thm)],[c_0_109]) ).
cnf(c_0_171,plain,
less(v200,v800),
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_172,plain,
less(v200,v600),
inference(split_conjunct,[status(thm)],[c_0_111]) ).
cnf(c_0_173,plain,
less(v200,v400),
inference(split_conjunct,[status(thm)],[c_0_112]) ).
cnf(c_0_174,plain,
less(v0,v800),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_175,plain,
less(v0,v600),
inference(split_conjunct,[status(thm)],[c_0_114]) ).
cnf(c_0_176,plain,
less(v0,v400),
inference(split_conjunct,[status(thm)],[c_0_115]) ).
cnf(c_0_177,plain,
less(v0,v200),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_178,plain,
val(v800),
inference(split_conjunct,[status(thm)],[c_0_117]) ).
cnf(c_0_179,plain,
val(v600),
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_180,plain,
val(v400),
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_181,plain,
val(v200),
inference(split_conjunct,[status(thm)],[c_0_120]) ).
cnf(c_0_182,plain,
val(v0),
inference(split_conjunct,[status(thm)],[c_0_121]) ).
cnf(c_0_183,plain,
is_verdict(unknown),
inference(split_conjunct,[status(thm)],[c_0_122]) ).
cnf(c_0_184,plain,
is_verdict(compatible),
inference(split_conjunct,[status(thm)],[c_0_123]) ).
cnf(c_0_185,plain,
is_verdict(conflict),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
cnf(c_0_186,plain,
v0 != v200,
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_187,plain,
v0 != v400,
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_188,plain,
v0 != v600,
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_189,plain,
v0 != v800,
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_190,plain,
v200 != v400,
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_191,plain,
v200 != v600,
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_192,plain,
v200 != v800,
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_193,plain,
v400 != v600,
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_194,plain,
v400 != v800,
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_195,plain,
v600 != v800,
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_196,plain,
compatible != unknown,
inference(split_conjunct,[status(thm)],[c_0_126]) ).
cnf(c_0_197,plain,
conflict != unknown,
inference(split_conjunct,[status(thm)],[c_0_127]) ).
cnf(c_0_198,plain,
conflict != compatible,
inference(split_conjunct,[status(thm)],[c_0_128]) ).
cnf(c_0_199,plain,
( axis_subsumes(X1,X2,X3,X4)
| ~ in_closed(esk3_4(X1,X2,X3,X4),X3,X4) ),
c_0_129,
[final] ).
cnf(c_0_200,plain,
( in_closed(esk2_4(X1,X2,X3,X4),X1,X2)
| ~ axis_compatible(X1,X2,X3,X4) ),
c_0_130,
[final] ).
cnf(c_0_201,plain,
( in_closed(esk2_4(X1,X2,X3,X4),X3,X4)
| ~ axis_compatible(X1,X2,X3,X4) ),
c_0_131,
[final] ).
cnf(c_0_202,plain,
( axis_subsumes(X1,X2,X3,X4)
| in_closed(esk3_4(X1,X2,X3,X4),X1,X2) ),
c_0_132,
[final] ).
cnf(c_0_203,plain,
( axis_conflict(X1,X2,X3,X4)
| in_closed(esk1_4(X1,X2,X3,X4),X1,X2) ),
c_0_133,
[final] ).
cnf(c_0_204,plain,
( axis_conflict(X1,X2,X3,X4)
| in_closed(esk1_4(X1,X2,X3,X4),X3,X4) ),
c_0_134,
[final] ).
cnf(c_0_205,plain,
( ~ in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5)
| ~ axis_conflict(X4,X5,X2,X3) ),
c_0_135,
[final] ).
cnf(c_0_206,plain,
( in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5)
| ~ axis_subsumes(X4,X5,X2,X3) ),
c_0_136,
[final] ).
cnf(c_0_207,plain,
( axis_compatible(X1,X2,X3,X4)
| ~ in_closed(X5,X3,X4)
| ~ in_closed(X5,X1,X2) ),
c_0_137,
[final] ).
cnf(c_0_208,plain,
( less(X2,X1)
| ~ in_open(X1,X2,X3) ),
c_0_138,
[final] ).
cnf(c_0_209,plain,
( less(X1,X3)
| ~ in_open(X1,X2,X3) ),
c_0_139,
[final] ).
cnf(c_0_210,plain,
( leq(X2,X1)
| ~ in_ropen(X1,X2,X3) ),
c_0_140,
[final] ).
cnf(c_0_211,plain,
( less(X1,X3)
| ~ in_ropen(X1,X2,X3) ),
c_0_141,
[final] ).
cnf(c_0_212,plain,
( less(X2,X1)
| ~ in_lopen(X1,X2,X3) ),
c_0_142,
[final] ).
cnf(c_0_213,plain,
( leq(X1,X3)
| ~ in_lopen(X1,X2,X3) ),
c_0_143,
[final] ).
cnf(c_0_214,plain,
( leq(X2,X1)
| ~ in_closed(X1,X2,X3) ),
c_0_144,
[final] ).
cnf(c_0_215,plain,
( leq(X1,X3)
| ~ in_closed(X1,X2,X3) ),
c_0_145,
[final] ).
cnf(c_0_216,plain,
( in_open(X1,X2,X3)
| ~ less(X1,X3)
| ~ less(X2,X1) ),
c_0_146,
[final] ).
cnf(c_0_217,plain,
( in_ropen(X1,X2,X3)
| ~ less(X1,X3)
| ~ leq(X2,X1) ),
c_0_147,
[final] ).
cnf(c_0_218,plain,
( in_lopen(X1,X2,X3)
| ~ leq(X1,X3)
| ~ less(X2,X1) ),
c_0_148,
[final] ).
cnf(c_0_219,plain,
( in_closed(X1,X2,X3)
| ~ leq(X1,X3)
| ~ leq(X2,X1) ),
c_0_149,
[final] ).
cnf(c_0_220,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
c_0_150,
[final] ).
cnf(c_0_221,plain,
( less(X1,X2)
| ~ leq(X3,X2)
| ~ less(X1,X3) ),
c_0_151,
[final] ).
cnf(c_0_222,plain,
( less(X1,X2)
| ~ less(X3,X2)
| ~ leq(X1,X3) ),
c_0_152,
[final] ).
cnf(c_0_223,plain,
( less(X1,X2)
| ~ less(X3,X2)
| ~ less(X1,X3) ),
c_0_153,
[final] ).
cnf(c_0_224,plain,
( box_verdict(X1,X2) = unknown
| box_verdict(X1,X2) = compatible
| box_verdict(X1,X2) = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
c_0_154,
[final] ).
cnf(c_0_225,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
c_0_155,
[final] ).
cnf(c_0_226,plain,
( X1 = X2
| less(X1,X2)
| ~ leq(X1,X2) ),
c_0_156,
[final] ).
cnf(c_0_227,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
c_0_157,
[final] ).
cnf(c_0_228,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
c_0_158,
[final] ).
cnf(c_0_229,plain,
( box_verdict(X1,X2) = unknown
| X2 = conflict
| X1 = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != unknown ),
c_0_159,
[final] ).
cnf(c_0_230,plain,
( box_verdict(X1,X2) = unknown
| X2 = conflict
| X1 = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X2 != unknown ),
c_0_160,
[final] ).
cnf(c_0_231,plain,
( box_verdict(X1,X2) = compatible
| X2 != compatible
| X1 != compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
c_0_161,
[final] ).
cnf(c_0_232,plain,
( box_verdict(X1,X2) = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != conflict ),
c_0_162,
[final] ).
cnf(c_0_233,plain,
( box_verdict(X1,X2) = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X2 != conflict ),
c_0_163,
[final] ).
cnf(c_0_234,plain,
( less(X1,X2)
| X2 = X1
| less(X2,X1) ),
c_0_164,
[final] ).
cnf(c_0_235,plain,
~ less(X1,X1),
c_0_165,
[final] ).
cnf(c_0_236,plain,
( leq(X1,X2)
| X1 != X2 ),
c_0_166,
[final] ).
cnf(c_0_237,plain,
( X1 = unknown
| X1 = compatible
| X1 = conflict
| ~ is_verdict(X1) ),
c_0_167,
[final] ).
cnf(c_0_238,plain,
less(v600,v800),
c_0_168,
[final] ).
cnf(c_0_239,plain,
less(v400,v800),
c_0_169,
[final] ).
cnf(c_0_240,plain,
less(v400,v600),
c_0_170,
[final] ).
cnf(c_0_241,plain,
less(v200,v800),
c_0_171,
[final] ).
cnf(c_0_242,plain,
less(v200,v600),
c_0_172,
[final] ).
cnf(c_0_243,plain,
less(v200,v400),
c_0_173,
[final] ).
cnf(c_0_244,plain,
less(v0,v800),
c_0_174,
[final] ).
cnf(c_0_245,plain,
less(v0,v600),
c_0_175,
[final] ).
cnf(c_0_246,plain,
less(v0,v400),
c_0_176,
[final] ).
cnf(c_0_247,plain,
less(v0,v200),
c_0_177,
[final] ).
cnf(c_0_248,plain,
val(v800),
c_0_178,
[final] ).
cnf(c_0_249,plain,
val(v600),
c_0_179,
[final] ).
cnf(c_0_250,plain,
val(v400),
c_0_180,
[final] ).
cnf(c_0_251,plain,
val(v200),
c_0_181,
[final] ).
cnf(c_0_252,plain,
val(v0),
c_0_182,
[final] ).
cnf(c_0_253,plain,
is_verdict(unknown),
c_0_183,
[final] ).
cnf(c_0_254,plain,
is_verdict(compatible),
c_0_184,
[final] ).
cnf(c_0_255,plain,
is_verdict(conflict),
c_0_185,
[final] ).
cnf(c_0_256,plain,
v200 != v0,
c_0_186,
[final] ).
cnf(c_0_257,plain,
v400 != v0,
c_0_187,
[final] ).
cnf(c_0_258,plain,
v600 != v0,
c_0_188,
[final] ).
cnf(c_0_259,plain,
v800 != v0,
c_0_189,
[final] ).
cnf(c_0_260,plain,
v400 != v200,
c_0_190,
[final] ).
cnf(c_0_261,plain,
v600 != v200,
c_0_191,
[final] ).
cnf(c_0_262,plain,
v800 != v200,
c_0_192,
[final] ).
cnf(c_0_263,plain,
v600 != v400,
c_0_193,
[final] ).
cnf(c_0_264,plain,
v800 != v400,
c_0_194,
[final] ).
cnf(c_0_265,plain,
v800 != v600,
c_0_195,
[final] ).
cnf(c_0_266,plain,
unknown != compatible,
c_0_196,
[final] ).
cnf(c_0_267,plain,
unknown != conflict,
c_0_197,
[final] ).
cnf(c_0_268,plain,
compatible != conflict,
c_0_198,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_199_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_199]) ).
cnf(c_0_199_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_199]) ).
cnf(c_0_200_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_200]) ).
cnf(c_0_200_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_200]) ).
cnf(c_0_201_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_201]) ).
cnf(c_0_201_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_201]) ).
cnf(c_0_202_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_202]) ).
cnf(c_0_202_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_202]) ).
cnf(c_0_203_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_203]) ).
cnf(c_0_203_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_203]) ).
cnf(c_0_204_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_204]) ).
cnf(c_0_204_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_204]) ).
cnf(c_0_205_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_205]) ).
cnf(c_0_205_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_205]) ).
cnf(c_0_205_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_205]) ).
cnf(c_0_206_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_206]) ).
cnf(c_0_206_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_206]) ).
cnf(c_0_206_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_206]) ).
cnf(c_0_207_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_207]) ).
cnf(c_0_207_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_207]) ).
cnf(c_0_207_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_207]) ).
cnf(c_0_208_0,axiom,
( less(X2,X1)
| ~ in_open(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_208]) ).
cnf(c_0_208_1,axiom,
( ~ in_open(X1,X2,X3)
| less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_208]) ).
cnf(c_0_209_0,axiom,
( less(X1,X3)
| ~ in_open(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_209]) ).
cnf(c_0_209_1,axiom,
( ~ in_open(X1,X2,X3)
| less(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_209]) ).
cnf(c_0_210_0,axiom,
( leq(X2,X1)
| ~ in_ropen(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_210]) ).
cnf(c_0_210_1,axiom,
( ~ in_ropen(X1,X2,X3)
| leq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_210]) ).
cnf(c_0_211_0,axiom,
( less(X1,X3)
| ~ in_ropen(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_211]) ).
cnf(c_0_211_1,axiom,
( ~ in_ropen(X1,X2,X3)
| less(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_211]) ).
cnf(c_0_212_0,axiom,
( less(X2,X1)
| ~ in_lopen(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_212]) ).
cnf(c_0_212_1,axiom,
( ~ in_lopen(X1,X2,X3)
| less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_212]) ).
cnf(c_0_213_0,axiom,
( leq(X1,X3)
| ~ in_lopen(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_213]) ).
cnf(c_0_213_1,axiom,
( ~ in_lopen(X1,X2,X3)
| leq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_213]) ).
cnf(c_0_214_0,axiom,
( leq(X2,X1)
| ~ in_closed(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_214]) ).
cnf(c_0_214_1,axiom,
( ~ in_closed(X1,X2,X3)
| leq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_214]) ).
cnf(c_0_215_0,axiom,
( leq(X1,X3)
| ~ in_closed(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_215]) ).
cnf(c_0_215_1,axiom,
( ~ in_closed(X1,X2,X3)
| leq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_215]) ).
cnf(c_0_216_0,axiom,
( in_open(X1,X2,X3)
| ~ less(X1,X3)
| ~ less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_216]) ).
cnf(c_0_216_1,axiom,
( ~ less(X1,X3)
| in_open(X1,X2,X3)
| ~ less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_216]) ).
cnf(c_0_216_2,axiom,
( ~ less(X2,X1)
| ~ less(X1,X3)
| in_open(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_216]) ).
cnf(c_0_217_0,axiom,
( in_ropen(X1,X2,X3)
| ~ less(X1,X3)
| ~ leq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_217]) ).
cnf(c_0_217_1,axiom,
( ~ less(X1,X3)
| in_ropen(X1,X2,X3)
| ~ leq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_217]) ).
cnf(c_0_217_2,axiom,
( ~ leq(X2,X1)
| ~ less(X1,X3)
| in_ropen(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_217]) ).
cnf(c_0_218_0,axiom,
( in_lopen(X1,X2,X3)
| ~ leq(X1,X3)
| ~ less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_218]) ).
cnf(c_0_218_1,axiom,
( ~ leq(X1,X3)
| in_lopen(X1,X2,X3)
| ~ less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_218]) ).
cnf(c_0_218_2,axiom,
( ~ less(X2,X1)
| ~ leq(X1,X3)
| in_lopen(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_218]) ).
cnf(c_0_219_0,axiom,
( in_closed(X1,X2,X3)
| ~ leq(X1,X3)
| ~ leq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_219]) ).
cnf(c_0_219_1,axiom,
( ~ leq(X1,X3)
| in_closed(X1,X2,X3)
| ~ leq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_219]) ).
cnf(c_0_219_2,axiom,
( ~ leq(X2,X1)
| ~ leq(X1,X3)
| in_closed(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_219]) ).
cnf(c_0_220_0,axiom,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_220]) ).
cnf(c_0_220_1,axiom,
( ~ leq(X3,X2)
| leq(X1,X2)
| ~ leq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_220]) ).
cnf(c_0_220_2,axiom,
( ~ leq(X1,X3)
| ~ leq(X3,X2)
| leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_220]) ).
cnf(c_0_221_0,axiom,
( less(X1,X2)
| ~ leq(X3,X2)
| ~ less(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_221]) ).
cnf(c_0_221_1,axiom,
( ~ leq(X3,X2)
| less(X1,X2)
| ~ less(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_221]) ).
cnf(c_0_221_2,axiom,
( ~ less(X1,X3)
| ~ leq(X3,X2)
| less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_221]) ).
cnf(c_0_222_0,axiom,
( less(X1,X2)
| ~ less(X3,X2)
| ~ leq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_222]) ).
cnf(c_0_222_1,axiom,
( ~ less(X3,X2)
| less(X1,X2)
| ~ leq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_222]) ).
cnf(c_0_222_2,axiom,
( ~ leq(X1,X3)
| ~ less(X3,X2)
| less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_222]) ).
cnf(c_0_223_0,axiom,
( less(X1,X2)
| ~ less(X3,X2)
| ~ less(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_223]) ).
cnf(c_0_223_1,axiom,
( ~ less(X3,X2)
| less(X1,X2)
| ~ less(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_223]) ).
cnf(c_0_223_2,axiom,
( ~ less(X1,X3)
| ~ less(X3,X2)
| less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_223]) ).
cnf(c_0_224_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_224]) ).
cnf(c_0_224_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_224]) ).
cnf(c_0_224_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_224]) ).
cnf(c_0_224_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_224]) ).
cnf(c_0_224_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_224]) ).
cnf(c_0_225_0,axiom,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_225]) ).
cnf(c_0_225_1,axiom,
( ~ leq(X2,X1)
| X1 = X2
| ~ leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_225]) ).
cnf(c_0_225_2,axiom,
( ~ leq(X1,X2)
| ~ leq(X2,X1)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_225]) ).
cnf(c_0_226_0,axiom,
( X1 = X2
| less(X1,X2)
| ~ leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_226]) ).
cnf(c_0_226_1,axiom,
( less(X1,X2)
| X1 = X2
| ~ leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_226]) ).
cnf(c_0_226_2,axiom,
( ~ leq(X1,X2)
| less(X1,X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_226]) ).
cnf(c_0_227_0,axiom,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_227]) ).
cnf(c_0_227_1,axiom,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_227]) ).
cnf(c_0_228_0,axiom,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_228]) ).
cnf(c_0_228_1,axiom,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_228]) ).
cnf(c_0_229_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_229]) ).
cnf(c_0_229_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_229]) ).
cnf(c_0_229_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_229]) ).
cnf(c_0_229_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_229]) ).
cnf(c_0_229_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_229]) ).
cnf(c_0_229_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_229]) ).
cnf(c_0_230_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_230]) ).
cnf(c_0_230_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_230]) ).
cnf(c_0_230_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_230]) ).
cnf(c_0_230_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_230]) ).
cnf(c_0_230_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_230]) ).
cnf(c_0_230_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_230]) ).
cnf(c_0_231_0,axiom,
( box_verdict(X1,X2) = compatible
| X2 != compatible
| X1 != compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_231]) ).
cnf(c_0_231_1,axiom,
( X2 != compatible
| box_verdict(X1,X2) = compatible
| X1 != compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_231]) ).
cnf(c_0_231_2,axiom,
( X1 != compatible
| X2 != compatible
| box_verdict(X1,X2) = compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_231]) ).
cnf(c_0_231_3,axiom,
( ~ is_verdict(X2)
| X1 != compatible
| X2 != compatible
| box_verdict(X1,X2) = compatible
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_231]) ).
cnf(c_0_231_4,axiom,
( ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != compatible
| X2 != compatible
| box_verdict(X1,X2) = compatible ),
inference(literals_permutation,[status(thm)],[c_0_231]) ).
cnf(c_0_232_0,axiom,
( box_verdict(X1,X2) = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != conflict ),
inference(literals_permutation,[status(thm)],[c_0_232]) ).
cnf(c_0_232_1,axiom,
( ~ is_verdict(X1)
| box_verdict(X1,X2) = conflict
| ~ is_verdict(X2)
| X1 != conflict ),
inference(literals_permutation,[status(thm)],[c_0_232]) ).
cnf(c_0_232_2,axiom,
( ~ is_verdict(X2)
| ~ is_verdict(X1)
| box_verdict(X1,X2) = conflict
| X1 != conflict ),
inference(literals_permutation,[status(thm)],[c_0_232]) ).
cnf(c_0_232_3,axiom,
( X1 != conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| box_verdict(X1,X2) = conflict ),
inference(literals_permutation,[status(thm)],[c_0_232]) ).
cnf(c_0_233_0,axiom,
( box_verdict(X1,X2) = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X2 != conflict ),
inference(literals_permutation,[status(thm)],[c_0_233]) ).
cnf(c_0_233_1,axiom,
( ~ is_verdict(X1)
| box_verdict(X1,X2) = conflict
| ~ is_verdict(X2)
| X2 != conflict ),
inference(literals_permutation,[status(thm)],[c_0_233]) ).
cnf(c_0_233_2,axiom,
( ~ is_verdict(X2)
| ~ is_verdict(X1)
| box_verdict(X1,X2) = conflict
| X2 != conflict ),
inference(literals_permutation,[status(thm)],[c_0_233]) ).
cnf(c_0_233_3,axiom,
( X2 != conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| box_verdict(X1,X2) = conflict ),
inference(literals_permutation,[status(thm)],[c_0_233]) ).
cnf(c_0_234_0,axiom,
( less(X1,X2)
| X2 = X1
| less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_234]) ).
cnf(c_0_234_1,axiom,
( X2 = X1
| less(X1,X2)
| less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_234]) ).
cnf(c_0_234_2,axiom,
( less(X2,X1)
| X2 = X1
| less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_234]) ).
cnf(c_0_236_0,axiom,
( leq(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_236]) ).
cnf(c_0_236_1,axiom,
( X1 != X2
| leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_236]) ).
cnf(c_0_237_0,axiom,
( X1 = unknown
| X1 = compatible
| X1 = conflict
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_237]) ).
cnf(c_0_237_1,axiom,
( X1 = compatible
| X1 = unknown
| X1 = conflict
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_237]) ).
cnf(c_0_237_2,axiom,
( X1 = conflict
| X1 = compatible
| X1 = unknown
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_237]) ).
cnf(c_0_237_3,axiom,
( ~ is_verdict(X1)
| X1 = conflict
| X1 = compatible
| X1 = unknown ),
inference(literals_permutation,[status(thm)],[c_0_237]) ).
cnf(c_0_235_0,axiom,
~ less(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_235]) ).
cnf(c_0_256_0,axiom,
v200 != v0,
inference(literals_permutation,[status(thm)],[c_0_256]) ).
cnf(c_0_257_0,axiom,
v400 != v0,
inference(literals_permutation,[status(thm)],[c_0_257]) ).
cnf(c_0_258_0,axiom,
v600 != v0,
inference(literals_permutation,[status(thm)],[c_0_258]) ).
cnf(c_0_259_0,axiom,
v800 != v0,
inference(literals_permutation,[status(thm)],[c_0_259]) ).
cnf(c_0_260_0,axiom,
v400 != v200,
inference(literals_permutation,[status(thm)],[c_0_260]) ).
cnf(c_0_261_0,axiom,
v600 != v200,
inference(literals_permutation,[status(thm)],[c_0_261]) ).
cnf(c_0_262_0,axiom,
v800 != v200,
inference(literals_permutation,[status(thm)],[c_0_262]) ).
cnf(c_0_263_0,axiom,
v600 != v400,
inference(literals_permutation,[status(thm)],[c_0_263]) ).
cnf(c_0_264_0,axiom,
v800 != v400,
inference(literals_permutation,[status(thm)],[c_0_264]) ).
cnf(c_0_265_0,axiom,
v800 != v600,
inference(literals_permutation,[status(thm)],[c_0_265]) ).
cnf(c_0_266_0,axiom,
unknown != compatible,
inference(literals_permutation,[status(thm)],[c_0_266]) ).
cnf(c_0_267_0,axiom,
unknown != conflict,
inference(literals_permutation,[status(thm)],[c_0_267]) ).
cnf(c_0_268_0,axiom,
compatible != conflict,
inference(literals_permutation,[status(thm)],[c_0_268]) ).
cnf(c_0_238_0,axiom,
less(v600,v800),
inference(literals_permutation,[status(thm)],[c_0_238]) ).
cnf(c_0_239_0,axiom,
less(v400,v800),
inference(literals_permutation,[status(thm)],[c_0_239]) ).
cnf(c_0_240_0,axiom,
less(v400,v600),
inference(literals_permutation,[status(thm)],[c_0_240]) ).
cnf(c_0_241_0,axiom,
less(v200,v800),
inference(literals_permutation,[status(thm)],[c_0_241]) ).
cnf(c_0_242_0,axiom,
less(v200,v600),
inference(literals_permutation,[status(thm)],[c_0_242]) ).
cnf(c_0_243_0,axiom,
less(v200,v400),
inference(literals_permutation,[status(thm)],[c_0_243]) ).
cnf(c_0_244_0,axiom,
less(v0,v800),
inference(literals_permutation,[status(thm)],[c_0_244]) ).
cnf(c_0_245_0,axiom,
less(v0,v600),
inference(literals_permutation,[status(thm)],[c_0_245]) ).
cnf(c_0_246_0,axiom,
less(v0,v400),
inference(literals_permutation,[status(thm)],[c_0_246]) ).
cnf(c_0_247_0,axiom,
less(v0,v200),
inference(literals_permutation,[status(thm)],[c_0_247]) ).
cnf(c_0_248_0,axiom,
val(v800),
inference(literals_permutation,[status(thm)],[c_0_248]) ).
cnf(c_0_249_0,axiom,
val(v600),
inference(literals_permutation,[status(thm)],[c_0_249]) ).
cnf(c_0_250_0,axiom,
val(v400),
inference(literals_permutation,[status(thm)],[c_0_250]) ).
cnf(c_0_251_0,axiom,
val(v200),
inference(literals_permutation,[status(thm)],[c_0_251]) ).
cnf(c_0_252_0,axiom,
val(v0),
inference(literals_permutation,[status(thm)],[c_0_252]) ).
cnf(c_0_253_0,axiom,
is_verdict(unknown),
inference(literals_permutation,[status(thm)],[c_0_253]) ).
cnf(c_0_254_0,axiom,
is_verdict(compatible),
inference(literals_permutation,[status(thm)],[c_0_254]) ).
cnf(c_0_255_0,axiom,
is_verdict(conflict),
inference(literals_permutation,[status(thm)],[c_0_255]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
~ ? [X1,X2] :
( in_lopen(X1,v0,v400)
& leq(v800,X1)
& in_lopen(X2,v0,v600)
& leq(v200,X2) ),
file('<stdin>',odrl402) ).
fof(c_0_1_002,negated_conjecture,
~ ~ ? [X1,X2] :
( in_lopen(X1,v0,v400)
& leq(v800,X1)
& in_lopen(X2,v0,v600)
& leq(v200,X2) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
( in_lopen(esk1_0,v0,v400)
& leq(v800,esk1_0)
& in_lopen(esk2_0,v0,v600)
& leq(v200,esk2_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,v400),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
in_lopen(esk2_0,v0,v600),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
leq(v800,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_007,negated_conjecture,
leq(v200,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7_008,negated_conjecture,
in_lopen(esk1_0,v0,v400),
c_0_3,
[final] ).
cnf(c_0_8_009,negated_conjecture,
in_lopen(esk2_0,v0,v600),
c_0_4,
[final] ).
cnf(c_0_9_010,negated_conjecture,
leq(v800,esk1_0),
c_0_5,
[final] ).
cnf(c_0_10_011,negated_conjecture,
leq(v200,esk2_0),
c_0_6,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_142,negated_conjecture,
in_lopen(sk2_esk1_0,v0,v400),
file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p',c_0_7) ).
cnf(c_172,negated_conjecture,
in_lopen(sk2_esk1_0,v0,v400),
inference(copy,[status(esa)],[c_142]) ).
cnf(c_188,negated_conjecture,
in_lopen(sk2_esk1_0,v0,v400),
inference(copy,[status(esa)],[c_172]) ).
cnf(c_195,negated_conjecture,
in_lopen(sk2_esk1_0,v0,v400),
inference(copy,[status(esa)],[c_188]) ).
cnf(c_196,negated_conjecture,
in_lopen(sk2_esk1_0,v0,v400),
inference(copy,[status(esa)],[c_195]) ).
cnf(c_630,negated_conjecture,
in_lopen(sk2_esk1_0,v0,v400),
inference(copy,[status(esa)],[c_196]) ).
cnf(c_109,plain,
( leq(X0,X1)
| ~ in_lopen(X0,X2,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p',c_0_213_1) ).
cnf(c_564,plain,
( leq(X0,X1)
| ~ in_lopen(X0,X2,X1) ),
inference(copy,[status(esa)],[c_109]) ).
cnf(c_684,plain,
leq(sk2_esk1_0,v400),
inference(resolution,[status(thm)],[c_630,c_564]) ).
cnf(c_685,plain,
leq(sk2_esk1_0,v400),
inference(rewriting,[status(thm)],[c_684]) ).
cnf(c_84,plain,
( less(X0,X1)
| ~ less(X2,X1)
| ~ leq(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p',c_0_222_2) ).
cnf(c_514,plain,
( less(X0,X1)
| ~ less(X2,X1)
| ~ leq(X0,X2) ),
inference(copy,[status(esa)],[c_84]) ).
cnf(c_707,plain,
( ~ less(v400,X0)
| less(sk2_esk1_0,X0) ),
inference(resolution,[status(thm)],[c_685,c_514]) ).
cnf(c_708,plain,
( ~ less(v400,X0)
| less(sk2_esk1_0,X0) ),
inference(rewriting,[status(thm)],[c_707]) ).
cnf(c_144,negated_conjecture,
leq(v800,sk2_esk1_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p',c_0_9) ).
cnf(c_176,negated_conjecture,
leq(v800,sk2_esk1_0),
inference(copy,[status(esa)],[c_144]) ).
cnf(c_190,negated_conjecture,
leq(v800,sk2_esk1_0),
inference(copy,[status(esa)],[c_176]) ).
cnf(c_193,negated_conjecture,
leq(v800,sk2_esk1_0),
inference(copy,[status(esa)],[c_190]) ).
cnf(c_198,negated_conjecture,
leq(v800,sk2_esk1_0),
inference(copy,[status(esa)],[c_193]) ).
cnf(c_634,plain,
leq(v800,sk2_esk1_0),
inference(copy,[status(esa)],[c_198]) ).
cnf(c_88,plain,
( ~ less(X0,X1)
| less(X0,X2)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p',c_0_221_1) ).
cnf(c_522,plain,
( ~ less(X0,X1)
| less(X0,X2)
| ~ leq(X1,X2) ),
inference(copy,[status(esa)],[c_88]) ).
cnf(c_656,plain,
( ~ less(X0,v800)
| less(X0,sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_634,c_522]) ).
cnf(c_657,plain,
( ~ less(X0,v800)
| less(X0,sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_656]) ).
cnf(c_31,plain,
~ less(X0,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p',c_0_235_0) ).
cnf(c_408,plain,
~ less(X0,X0),
inference(copy,[status(esa)],[c_31]) ).
cnf(c_798,plain,
~ less(sk2_esk1_0,v800),
inference(resolution,[status(thm)],[c_657,c_408]) ).
cnf(c_799,plain,
~ less(sk2_esk1_0,v800),
inference(rewriting,[status(thm)],[c_798]) ).
cnf(c_1092,plain,
~ less(v400,v800),
inference(resolution,[status(thm)],[c_708,c_799]) ).
cnf(c_1093,plain,
~ less(v400,v800),
inference(rewriting,[status(thm)],[c_1092]) ).
cnf(c_16,plain,
less(v400,v800),
file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p',c_0_239_0) ).
cnf(c_378,plain,
less(v400,v800),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_2377,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1093,c_378]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT081+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.03 % Command : iprover_modulo %s %d
% 0.08/0.35 % Computer : n017.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 7 14:11:24 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.36 % Running in mono-core mode
% 0.14/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.14/0.41 % FOF problem with conjecture
% 0.14/0.41 % 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/sandbox/tmp/iprover_proof_1339c8.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_da018c.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_7e82b3 | grep -v "SZS"
% 0.14/0.44
% 0.14/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.14/0.44
% 0.14/0.44 %
% 0.14/0.44 % ------ iProver source info
% 0.14/0.44
% 0.14/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.14/0.44 % git: non_committed_changes: true
% 0.14/0.44 % git: last_make_outside_of_git: true
% 0.14/0.44
% 0.14/0.44 %
% 0.14/0.44 % ------ Input Options
% 0.14/0.44
% 0.14/0.44 % --out_options all
% 0.14/0.44 % --tptp_safe_out true
% 0.14/0.44 % --problem_path ""
% 0.14/0.44 % --include_path ""
% 0.14/0.44 % --clausifier .//eprover
% 0.14/0.44 % --clausifier_options --tstp-format
% 0.14/0.44 % --stdin false
% 0.14/0.44 % --dbg_backtrace false
% 0.14/0.44 % --dbg_dump_prop_clauses false
% 0.14/0.44 % --dbg_dump_prop_clauses_file -
% 0.14/0.44 % --dbg_out_stat false
% 0.14/0.44
% 0.14/0.44 % ------ General Options
% 0.14/0.44
% 0.14/0.44 % --fof false
% 0.14/0.44 % --time_out_real 150.
% 0.14/0.44 % --time_out_prep_mult 0.2
% 0.14/0.44 % --time_out_virtual -1.
% 0.14/0.44 % --schedule none
% 0.14/0.44 % --ground_splitting input
% 0.14/0.45 % --splitting_nvd 16
% 0.14/0.45 % --non_eq_to_eq false
% 0.14/0.45 % --prep_gs_sim true
% 0.14/0.45 % --prep_unflatten false
% 0.14/0.45 % --prep_res_sim true
% 0.14/0.45 % --prep_upred true
% 0.14/0.45 % --res_sim_input true
% 0.14/0.45 % --clause_weak_htbl true
% 0.14/0.45 % --gc_record_bc_elim false
% 0.14/0.45 % --symbol_type_check false
% 0.14/0.45 % --clausify_out false
% 0.14/0.45 % --large_theory_mode false
% 0.14/0.45 % --prep_sem_filter none
% 0.14/0.45 % --prep_sem_filter_out false
% 0.14/0.45 % --preprocessed_out false
% 0.14/0.45 % --sub_typing false
% 0.14/0.45 % --brand_transform false
% 0.14/0.45 % --pure_diseq_elim true
% 0.14/0.45 % --min_unsat_core false
% 0.14/0.45 % --pred_elim true
% 0.14/0.45 % --add_important_lit false
% 0.14/0.45 % --soft_assumptions false
% 0.14/0.45 % --reset_solvers false
% 0.14/0.45 % --bc_imp_inh []
% 0.14/0.45 % --conj_cone_tolerance 1.5
% 0.14/0.45 % --prolific_symb_bound 500
% 0.14/0.45 % --lt_threshold 2000
% 0.14/0.45
% 0.14/0.45 % ------ SAT Options
% 0.14/0.45
% 0.14/0.45 % --sat_mode false
% 0.14/0.45 % --sat_fm_restart_options ""
% 0.14/0.45 % --sat_gr_def false
% 0.14/0.45 % --sat_epr_types true
% 0.14/0.45 % --sat_non_cyclic_types false
% 0.14/0.45 % --sat_finite_models false
% 0.14/0.45 % --sat_fm_lemmas false
% 0.14/0.45 % --sat_fm_prep false
% 0.14/0.45 % --sat_fm_uc_incr true
% 0.14/0.45 % --sat_out_model small
% 0.14/0.45 % --sat_out_clauses false
% 0.14/0.45
% 0.14/0.45 % ------ QBF Options
% 0.14/0.45
% 0.14/0.45 % --qbf_mode false
% 0.14/0.45 % --qbf_elim_univ true
% 0.14/0.45 % --qbf_sk_in true
% 0.14/0.45 % --qbf_pred_elim true
% 0.14/0.45 % --qbf_split 32
% 0.14/0.45
% 0.14/0.45 % ------ BMC1 Options
% 0.14/0.45
% 0.14/0.45 % --bmc1_incremental false
% 0.14/0.45 % --bmc1_axioms reachable_all
% 0.14/0.45 % --bmc1_min_bound 0
% 0.14/0.45 % --bmc1_max_bound -1
% 0.14/0.45 % --bmc1_max_bound_default -1
% 0.14/0.45 % --bmc1_symbol_reachability true
% 0.14/0.45 % --bmc1_property_lemmas false
% 0.14/0.45 % --bmc1_k_induction false
% 0.14/0.45 % --bmc1_non_equiv_states false
% 0.14/0.45 % --bmc1_deadlock false
% 0.14/0.45 % --bmc1_ucm false
% 0.14/0.45 % --bmc1_add_unsat_core none
% 0.14/0.45 % --bmc1_unsat_core_children false
% 0.14/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.14/0.45 % --bmc1_out_stat full
% 0.14/0.45 % --bmc1_ground_init false
% 0.14/0.45 % --bmc1_pre_inst_next_state false
% 0.14/0.45 % --bmc1_pre_inst_state false
% 0.14/0.45 % --bmc1_pre_inst_reach_state false
% 0.14/0.45 % --bmc1_out_unsat_core false
% 0.14/0.45 % --bmc1_aig_witness_out false
% 0.14/0.45 % --bmc1_verbose false
% 0.14/0.45 % --bmc1_dump_clauses_tptp false
% 0.14/0.46 % --bmc1_dump_unsat_core_tptp false
% 0.14/0.46 % --bmc1_dump_file -
% 0.14/0.46 % --bmc1_ucm_expand_uc_limit 128
% 0.14/0.46 % --bmc1_ucm_n_expand_iterations 6
% 0.14/0.46 % --bmc1_ucm_extend_mode 1
% 0.14/0.46 % --bmc1_ucm_init_mode 2
% 0.14/0.46 % --bmc1_ucm_cone_mode none
% 0.14/0.46 % --bmc1_ucm_reduced_relation_type 0
% 0.14/0.46 % --bmc1_ucm_relax_model 4
% 0.14/0.46 % --bmc1_ucm_full_tr_after_sat true
% 0.14/0.46 % --bmc1_ucm_expand_neg_assumptions false
% 0.14/0.46 % --bmc1_ucm_layered_model none
% 0.14/0.46 % --bmc1_ucm_max_lemma_size 10
% 0.14/0.46
% 0.14/0.46 % ------ AIG Options
% 0.14/0.46
% 0.14/0.46 % --aig_mode false
% 0.14/0.46
% 0.14/0.46 % ------ Instantiation Options
% 0.14/0.46
% 0.14/0.46 % --instantiation_flag true
% 0.14/0.46 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.14/0.46 % --inst_solver_per_active 750
% 0.14/0.46 % --inst_solver_calls_frac 0.5
% 0.14/0.46 % --inst_passive_queue_type priority_queues
% 0.14/0.46 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.14/0.46 % --inst_passive_queues_freq [25;2]
% 0.14/0.46 % --inst_dismatching true
% 0.14/0.46 % --inst_eager_unprocessed_to_passive true
% 0.14/0.46 % --inst_prop_sim_given true
% 0.14/0.46 % --inst_prop_sim_new false
% 0.14/0.46 % --inst_orphan_elimination true
% 0.14/0.46 % --inst_learning_loop_flag true
% 0.14/0.46 % --inst_learning_start 3000
% 0.14/0.46 % --inst_learning_factor 2
% 0.14/0.46 % --inst_start_prop_sim_after_learn 3
% 0.14/0.46 % --inst_sel_renew solver
% 0.14/0.46 % --inst_lit_activity_flag true
% 0.14/0.46 % --inst_out_proof true
% 0.14/0.46
% 0.14/0.46 % ------ Resolution Options
% 0.14/0.46
% 0.14/0.46 % --resolution_flag true
% 0.14/0.46 % --res_lit_sel kbo_max
% 0.14/0.46 % --res_to_prop_solver none
% 0.14/0.46 % --res_prop_simpl_new false
% 0.14/0.46 % --res_prop_simpl_given false
% 0.14/0.46 % --res_passive_queue_type priority_queues
% 0.14/0.46 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.14/0.46 % --res_passive_queues_freq [15;5]
% 0.14/0.46 % --res_forward_subs full
% 0.14/0.46 % --res_backward_subs full
% 0.14/0.46 % --res_forward_subs_resolution true
% 0.14/0.46 % --res_backward_subs_resolution true
% 0.14/0.46 % --res_orphan_elimination false
% 0.14/0.46 % --res_time_limit 1000.
% 0.14/0.46 % --res_out_proof true
% 0.14/0.46 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_1339c8.s
% 0.14/0.46 % --modulo true
% 0.14/0.46
% 0.14/0.46 % ------ Combination Options
% 0.14/0.46
% 0.14/0.46 % --comb_res_mult 1000
% 0.14/0.46 % --comb_inst_mult 300
% 0.14/0.46 % ------
% 0.14/0.46
% 0.14/0.46 % ------ Parsing...% successful
% 0.14/0.46
% 0.14/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.14/0.46
% 0.14/0.46 % ------ Proving...
% 0.14/0.46 % ------ Problem Properties
% 0.14/0.46
% 0.14/0.46 %
% 0.14/0.46 % EPR false
% 0.14/0.46 % Horn false
% 0.14/0.46 % Has equality true
% 0.14/0.46
% 0.14/0.46 % % ------ Input Options Time Limit: Unbounded
% 0.14/0.46
% 0.14/0.46
% 0.14/0.46 % % ------ Current options:
% 0.14/0.46
% 0.14/0.46 % ------ Input Options
% 0.14/0.46
% 0.14/0.46 % --out_options all
% 0.14/0.46 % --tptp_safe_out true
% 0.14/0.46 % --problem_path ""
% 0.14/0.46 % --include_path ""
% 0.14/0.46 % --clausifier .//eprover
% 0.14/0.46 % --clausifier_options --tstp-format
% 0.14/0.46 % --stdin false
% 0.14/0.46 % --dbg_backtrace false
% 0.14/0.46 % --dbg_dump_prop_clauses false
% 0.14/0.46 % --dbg_dump_prop_clauses_file -
% 0.14/0.46 % --dbg_out_stat false
% 0.14/0.46
% 0.14/0.46 % ------ General Options
% 0.14/0.46
% 0.14/0.46 % --fof false
% 0.14/0.46 % --time_out_real 150.
% 0.14/0.46 % --time_out_prep_mult 0.2
% 0.14/0.46 % --time_out_virtual -1.
% 0.14/0.46 % --schedule none
% 0.14/0.46 % --ground_splitting input
% 0.14/0.46 % --splitting_nvd 16
% 0.14/0.46 % --non_eq_to_eq false
% 0.14/0.46 % --prep_gs_sim true
% 0.14/0.46 % --prep_unflatten false
% 0.14/0.46 % --prep_res_sim true
% 0.14/0.46 % --prep_upred true
% 0.14/0.46 % --res_sim_input true
% 0.14/0.46 % --clause_weak_htbl true
% 0.14/0.46 % --gc_record_bc_elim false
% 0.14/0.46 % --symbol_type_check false
% 0.14/0.46 % --clausify_out false
% 0.14/0.46 % --large_theory_mode false
% 0.14/0.46 % --prep_sem_filter none
% 0.14/0.46 % --prep_sem_filter_out false
% 0.14/0.46 % --preprocessed_out false
% 0.14/0.46 % --sub_typing false
% 0.14/0.46 % --brand_transform false
% 0.14/0.46 % --pure_diseq_elim true
% 0.14/0.46 % --min_unsat_core false
% 0.14/0.46 % --pred_elim true
% 0.14/0.46 % --add_important_lit false
% 0.14/0.46 % --soft_assumptions false
% 0.14/0.46 % --reset_solvers false
% 0.14/0.46 % --bc_imp_inh []
% 0.14/0.46 % --conj_cone_tolerance 1.5
% 0.14/0.46 % --prolific_symb_bound 500
% 0.14/0.46 % --lt_threshold 2000
% 0.14/0.46
% 0.14/0.46 % ------ SAT Options
% 0.14/0.46
% 0.14/0.46 % --sat_mode false
% 0.14/0.46 % --sat_fm_restart_options ""
% 0.14/0.46 % --sat_gr_def false
% 0.14/0.46 % --sat_epr_types true
% 0.14/0.46 % --sat_non_cyclic_types false
% 0.14/0.46 % --sat_finite_models false
% 0.14/0.46 % --sat_fm_lemmas false
% 0.14/0.46 % --sat_fm_prep false
% 0.14/0.46 % --sat_fm_uc_incr true
% 0.14/0.46 % --sat_out_model small
% 0.14/0.46 % --sat_out_clauses false
% 0.14/0.46
% 0.14/0.46 % ------ QBF Options
% 0.14/0.46
% 0.14/0.46 % --qbf_mode false
% 0.14/0.46 % --qbf_elim_univ true
% 0.14/0.46 % --qbf_sk_in true
% 0.14/0.46 % --qbf_pred_elim true
% 0.14/0.46 % --qbf_split 32
% 0.14/0.46
% 0.14/0.46 % ------ BMC1 Options
% 0.14/0.46
% 0.14/0.46 % --bmc1_incremental false
% 0.14/0.46 % --bmc1_axioms reachable_all
% 0.14/0.46 % --bmc1_min_bound 0
% 0.14/0.46 % --bmc1_max_bound -1
% 0.14/0.46 % --bmc1_max_bound_default -1
% 0.14/0.46 % --bmc1_symbol_reachability true
% 0.14/0.46 % --bmc1_property_lemmas false
% 0.14/0.46 % --bmc1_k_induction false
% 0.14/0.46 % --bmc1_non_equiv_states false
% 0.14/0.46 % --bmc1_deadlock false
% 0.14/0.46 % --bmc1_ucm false
% 0.14/0.46 % --bmc1_add_unsat_core none
% 0.14/0.46 % --bmc1_unsat_core_children false
% 0.14/0.46 % --bmc1_unsat_core_extrapolate_axioms false
% 0.14/0.46 % --bmc1_out_stat full
% 0.14/0.46 % --bmc1_ground_init false
% 0.14/0.46 % --bmc1_pre_inst_next_state false
% 0.14/0.46 % --bmc1_pre_inst_state false
% 0.14/0.46 % --bmc1_pre_inst_reach_state false
% 0.14/0.46 % --bmc1_out_unsat_core false
% 0.14/0.46 % --bmc1_aig_witness_out false
% 0.14/0.46 % --bmc1_verbose false
% 0.14/0.46 % --bmc1_dump_clauses_tptp false
% 0.14/0.46 % --bmc1_dump_unsat_core_tptp false
% 0.14/0.46 % --bmc1_dump_file -
% 0.14/0.46 % --bmc1_ucm_expand_uc_limit 128
% 0.14/0.46 % --bmc1_ucm_n_expand_iterations 6
% 0.14/0.46 % --bmc1_ucm_extend_mode 1
% 0.14/0.46 % --bmc1_ucm_init_mode 2
% 0.14/0.46 % --bmc1_ucm_cone_mode none
% 0.14/0.46 % --bmc1_ucm_reduced_relation_type 0
% 0.14/0.46 % --bmc1_ucm_relax_model 4
% 0.14/0.46 % --bmc1_ucm_full_tr_after_sat true
% 0.14/0.46 % --bmc1_ucm_expand_neg_assumptions false
% 0.14/0.46 % --bmc1_ucm_layered_model none
% 0.14/0.46 % --bmc1_ucm_max_lemma_size 10
% 0.14/0.46
% 0.14/0.46 % ------ AIG Options
% 0.14/0.46
% 0.14/0.46 % --aig_mode false
% 0.14/0.46
% 0.14/0.46 % ------ Instantiation Options
% 0.14/0.46
% 0.14/0.46 % --instantiation_flag true
% 0.14/0.46 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.14/0.46 % --inst_solver_per_active 750
% 0.14/0.46 % --inst_solver_calls_frac 0.5
% 0.14/0.46 % --inst_passive_queue_type priority_queues
% 0.14/0.46 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.14/0.46 % --inst_passive_queues_freq [25;2]
% 0.14/0.46 % --inst_dismatching true
% 0.14/0.46 % --inst_eager_unprocessed_to_passive true
% 0.14/0.46 % --inst_prop_sim_given true
% 0.14/0.46 % --inst_prop_sim_new false
% 0.14/0.46 % --inst_orphan_elimination true
% 0.14/0.46 % --inst_learning_loop_flag true
% 0.14/0.46 % --inst_learning_start 3000
% 0.14/0.46 % --inst_learning_factor 2
% 0.14/0.46 % --inst_start_prop_sim_after_learn 3
% 0.14/0.46 % --inst_sel_renew solver
% 0.14/0.46 % --inst_lit_activity_flag true
% 0.14/0.46 % --inst_out_proof true
% 0.14/0.46
% 0.14/0.46 % ------ Resolution Options
% 0.14/0.46
% 0.14/0.46 % --resolution_flag true
% 0.14/0.46 % --res_lit_sel kbo_max
% 0.14/0.46 % --res_to_prop_solver none
% 0.14/0.46 % --res_prop_simpl_new false
% 0.14/0.46 % --res_prop_simpl_given false
% 0.14/0.46 % --res_passive_queue_type priority_queues
% 0.14/0.46 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.14/0.46 % --res_passive_queues_freq [15;5]
% 0.14/0.46 % --res_forward_subs full
% 0.14/0.46 % --res_backward_subs full
% 0.14/0.46 % --res_forward_subs_resolution true
% 0.14/0.46 % --res_backward_subs_resolution true
% 0.14/0.46 % --res_orphan_elimination false
% 0.14/0.46 % --res_time_limit 1000.
% 0.14/0.46 % --res_out_proof true
% 0.14/0.46 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_1339c8.s
% 0.14/0.46 % --modulo true
% 0.14/0.46
% 0.14/0.46 % ------ Combination Options
% 0.14/0.46
% 0.14/0.46 % --comb_res_mult 1000
% 0.14/0.46 % --comb_inst_mult 300
% 0.14/0.46 % ------
% 0.14/0.46
% 0.14/0.46
% 0.14/0.46
% 0.14/0.46 % ------ Proving...
% 0.14/0.46 % warning: shown sat in sat incomplete mode
% 0.14/0.46 %
% 0.14/0.46
% 0.14/0.46
% 0.14/0.46
% 0.14/0.46
% 0.14/0.46 cnf(c_77,negated_conjecture,
% 0.14/0.46 ( in_lopen(sk3_esk2_0,v0,v600) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_8) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_108,negated_conjecture,
% 0.14/0.46 ( in_lopen(sk3_esk2_0,v0,v600) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_77]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_123,negated_conjecture,
% 0.14/0.46 ( in_lopen(sk3_esk2_0,v0,v600) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_108]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_128,negated_conjecture,
% 0.14/0.46 ( in_lopen(sk3_esk2_0,v0,v600) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_123]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_131,negated_conjecture,
% 0.14/0.46 ( in_lopen(sk3_esk2_0,v0,v600) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_128]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_368,negated_conjecture,
% 0.14/0.46 ( in_lopen(sk3_esk2_0,v0,v600) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_131]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_58,plain,
% 0.14/0.46 ( less(X0,X1) | ~ in_lopen(X1,X0,X2) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_259_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_330,plain,
% 0.14/0.46 ( less(X0,X1) | ~ in_lopen(X1,X0,X2) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_58]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_392,plain,
% 0.14/0.46 ( less(v0,sk3_esk2_0) ),
% 0.14/0.46 inference(resolution,[status(thm)],[c_368,c_330]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_393,plain,
% 0.14/0.46 ( less(v0,sk3_esk2_0) ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_392]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_42,plain,
% 0.14/0.46 ( leq(X0,X1) | ~ less(X0,X1) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_275_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_298,plain,
% 0.14/0.46 ( leq(X0,X1) | ~ less(X0,X1) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_42]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_299,plain,
% 0.14/0.46 ( ~ less(X0,X1) | leq(X0,X1) ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_298]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_408,plain,
% 0.14/0.46 ( leq(v0,sk3_esk2_0) ),
% 0.14/0.46 inference(resolution,[status(thm)],[c_393,c_299]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_409,plain,
% 0.14/0.46 ( leq(v0,sk3_esk2_0) ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_408]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_57,plain,
% 0.14/0.46 ( leq(X0,X1) | ~ in_lopen(X0,X2,X1) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_260_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_328,plain,
% 0.14/0.46 ( leq(X0,X1) | ~ in_lopen(X0,X2,X1) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_57]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_390,plain,
% 0.14/0.46 ( leq(sk3_esk2_0,v600) ),
% 0.14/0.46 inference(resolution,[status(thm)],[c_368,c_328]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_391,plain,
% 0.14/0.46 ( leq(sk3_esk2_0,v600) ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_390]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_43,plain,
% 0.14/0.46 ( less(X0,X1) | X0 = X1 | ~ leq(X0,X1) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_274_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_300,plain,
% 0.14/0.46 ( less(X0,X1) | X0 = X1 | ~ leq(X0,X1) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_43]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_301,plain,
% 0.14/0.46 ( less(X0,X1) | ~ leq(X0,X1) | X0 = X1 ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_300]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_404,plain,
% 0.14/0.46 ( less(sk3_esk2_0,v600) | sk3_esk2_0 = v600 ),
% 0.14/0.46 inference(resolution,[status(thm)],[c_391,c_301]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_405,plain,
% 0.14/0.46 ( less(sk3_esk2_0,v600) | sk3_esk2_0 = v600 ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_404]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_76,negated_conjecture,
% 0.14/0.46 ( in_lopen(sk3_esk1_0,v0,v400) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_7) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_106,negated_conjecture,
% 0.14/0.46 ( in_lopen(sk3_esk1_0,v0,v400) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_76]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_122,negated_conjecture,
% 0.14/0.46 ( in_lopen(sk3_esk1_0,v0,v400) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_106]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_129,negated_conjecture,
% 0.14/0.46 ( in_lopen(sk3_esk1_0,v0,v400) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_122]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_130,negated_conjecture,
% 0.14/0.46 ( in_lopen(sk3_esk1_0,v0,v400) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_129]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_366,negated_conjecture,
% 0.14/0.46 ( in_lopen(sk3_esk1_0,v0,v400) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_130]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_386,plain,
% 0.14/0.46 ( less(v0,sk3_esk1_0) ),
% 0.14/0.46 inference(resolution,[status(thm)],[c_366,c_330]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_387,plain,
% 0.14/0.46 ( less(v0,sk3_esk1_0) ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_386]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_400,plain,
% 0.14/0.46 ( leq(v0,sk3_esk1_0) ),
% 0.14/0.46 inference(resolution,[status(thm)],[c_387,c_299]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_401,plain,
% 0.14/0.46 ( leq(v0,sk3_esk1_0) ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_400]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_384,plain,
% 0.14/0.46 ( leq(sk3_esk1_0,v400) ),
% 0.14/0.46 inference(resolution,[status(thm)],[c_366,c_328]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_385,plain,
% 0.14/0.46 ( leq(sk3_esk1_0,v400) ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_384]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_396,plain,
% 0.14/0.46 ( less(sk3_esk1_0,v400) | sk3_esk1_0 = v400 ),
% 0.14/0.46 inference(resolution,[status(thm)],[c_385,c_301]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_397,plain,
% 0.14/0.46 ( less(sk3_esk1_0,v400) | sk3_esk1_0 = v400 ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_396]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_79,negated_conjecture,
% 0.14/0.46 ( leq(v200,sk3_esk2_0) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_10) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_112,negated_conjecture,
% 0.14/0.46 ( leq(v200,sk3_esk2_0) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_79]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_125,negated_conjecture,
% 0.14/0.46 ( leq(v200,sk3_esk2_0) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_112]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_126,negated_conjecture,
% 0.14/0.46 ( leq(v200,sk3_esk2_0) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_125]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_133,negated_conjecture,
% 0.14/0.46 ( leq(v200,sk3_esk2_0) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_126]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_372,negated_conjecture,
% 0.14/0.46 ( leq(v200,sk3_esk2_0) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_133]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_380,plain,
% 0.14/0.46 ( less(v200,sk3_esk2_0) | v200 = sk3_esk2_0 ),
% 0.14/0.46 inference(resolution,[status(thm)],[c_372,c_301]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_381,plain,
% 0.14/0.46 ( less(v200,sk3_esk2_0) | v200 = sk3_esk2_0 ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_380]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_78,negated_conjecture,
% 0.14/0.46 ( leq(v800,sk3_esk1_0) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_9) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_110,negated_conjecture,
% 0.14/0.46 ( leq(v800,sk3_esk1_0) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_78]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_124,negated_conjecture,
% 0.14/0.46 ( leq(v800,sk3_esk1_0) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_110]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_127,negated_conjecture,
% 0.14/0.46 ( leq(v800,sk3_esk1_0) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_124]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_132,negated_conjecture,
% 0.14/0.46 ( leq(v800,sk3_esk1_0) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_127]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_370,negated_conjecture,
% 0.14/0.46 ( leq(v800,sk3_esk1_0) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_132]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_376,plain,
% 0.14/0.46 ( less(v800,sk3_esk1_0) | v800 = sk3_esk1_0 ),
% 0.14/0.46 inference(resolution,[status(thm)],[c_370,c_301]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_377,plain,
% 0.14/0.46 ( less(v800,sk3_esk1_0) | v800 = sk3_esk1_0 ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_376]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_65,plain,
% 0.14/0.46 ( ~ leq(X0,X1) | ~ less(X1,X2) | in_ropen(X1,X0,X2) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_252_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_344,plain,
% 0.14/0.46 ( ~ leq(X0,X1) | ~ less(X1,X2) | in_ropen(X1,X0,X2) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_65]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_345,plain,
% 0.14/0.46 ( ~ less(X0,X1) | ~ leq(X2,X0) | in_ropen(X0,X2,X1) ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_344]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_53,plain,
% 0.14/0.46 ( ~ less(X0,X1) | ~ leq(X1,X2) | less(X0,X2) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_264_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_320,plain,
% 0.14/0.46 ( ~ less(X0,X1) | ~ leq(X1,X2) | less(X0,X2) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_53]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_321,plain,
% 0.14/0.46 ( ~ less(X0,X1) | less(X0,X2) | ~ leq(X1,X2) ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_320]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_52,plain,
% 0.14/0.46 ( ~ leq(X0,X1) | ~ less(X1,X2) | less(X0,X2) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_265_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_318,plain,
% 0.14/0.46 ( ~ leq(X0,X1) | ~ less(X1,X2) | less(X0,X2) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_52]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_319,plain,
% 0.14/0.46 ( ~ less(X0,X1) | less(X2,X1) | ~ leq(X2,X0) ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_318]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_48,plain,
% 0.14/0.46 ( X0 != unknown
% 0.14/0.46 | ~ is_verdict(X1)
% 0.14/0.46 | ~ is_verdict(X0)
% 0.14/0.46 | X0 = conflict
% 0.14/0.46 | X1 = conflict
% 0.14/0.46 | box_verdict(X0,X1) = unknown ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_269_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_310,plain,
% 0.14/0.46 ( X0 != unknown
% 0.14/0.46 | ~ is_verdict(X1)
% 0.14/0.46 | ~ is_verdict(X0)
% 0.14/0.46 | X0 = conflict
% 0.14/0.46 | X1 = conflict
% 0.14/0.46 | box_verdict(X0,X1) = unknown ),
% 0.14/0.46 inference(copy,[status(esa)],[c_48]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_311,plain,
% 0.14/0.46 ( ~ is_verdict(X0)
% 0.14/0.46 | ~ is_verdict(X1)
% 0.14/0.46 | box_verdict(X1,X0) = unknown
% 0.14/0.46 | X1 != unknown
% 0.14/0.46 | X1 = conflict
% 0.14/0.46 | X0 = conflict ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_310]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_47,plain,
% 0.14/0.46 ( X0 != unknown
% 0.14/0.46 | ~ is_verdict(X0)
% 0.14/0.46 | ~ is_verdict(X1)
% 0.14/0.46 | X1 = conflict
% 0.14/0.46 | X0 = conflict
% 0.14/0.46 | box_verdict(X1,X0) = unknown ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_270_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_308,plain,
% 0.14/0.46 ( X0 != unknown
% 0.14/0.46 | ~ is_verdict(X0)
% 0.14/0.46 | ~ is_verdict(X1)
% 0.14/0.46 | X1 = conflict
% 0.14/0.46 | X0 = conflict
% 0.14/0.46 | box_verdict(X1,X0) = unknown ),
% 0.14/0.46 inference(copy,[status(esa)],[c_47]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_309,plain,
% 0.14/0.46 ( ~ is_verdict(X0)
% 0.14/0.46 | ~ is_verdict(X1)
% 0.14/0.46 | box_verdict(X1,X0) = unknown
% 0.14/0.46 | X0 != unknown
% 0.14/0.46 | X1 = conflict
% 0.14/0.46 | X0 = conflict ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_308]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_46,plain,
% 0.14/0.46 ( ~ is_verdict(X0)
% 0.14/0.46 | ~ is_verdict(X1)
% 0.14/0.46 | X0 != compatible
% 0.14/0.46 | X1 != compatible
% 0.14/0.46 | box_verdict(X0,X1) = compatible ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_271_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_306,plain,
% 0.14/0.46 ( ~ is_verdict(X0)
% 0.14/0.46 | ~ is_verdict(X1)
% 0.14/0.46 | X0 != compatible
% 0.14/0.46 | X1 != compatible
% 0.14/0.46 | box_verdict(X0,X1) = compatible ),
% 0.14/0.46 inference(copy,[status(esa)],[c_46]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_307,plain,
% 0.14/0.46 ( ~ is_verdict(X0)
% 0.14/0.46 | ~ is_verdict(X1)
% 0.14/0.46 | box_verdict(X0,X1) = compatible
% 0.14/0.46 | X0 != compatible
% 0.14/0.46 | X1 != compatible ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_306]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_45,plain,
% 0.14/0.46 ( X0 != conflict
% 0.14/0.46 | ~ is_verdict(X1)
% 0.14/0.46 | ~ is_verdict(X0)
% 0.14/0.46 | box_verdict(X0,X1) = conflict ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_272_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_304,plain,
% 0.14/0.46 ( X0 != conflict
% 0.14/0.46 | ~ is_verdict(X1)
% 0.14/0.46 | ~ is_verdict(X0)
% 0.14/0.46 | box_verdict(X0,X1) = conflict ),
% 0.14/0.46 inference(copy,[status(esa)],[c_45]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_305,plain,
% 0.14/0.46 ( ~ is_verdict(X0)
% 0.14/0.46 | ~ is_verdict(X1)
% 0.14/0.46 | box_verdict(X1,X0) = conflict
% 0.14/0.46 | X1 != conflict ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_304]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_44,plain,
% 0.14/0.46 ( X0 != conflict
% 0.14/0.46 | ~ is_verdict(X0)
% 0.14/0.46 | ~ is_verdict(X1)
% 0.14/0.46 | box_verdict(X1,X0) = conflict ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_273_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_302,plain,
% 0.14/0.46 ( X0 != conflict
% 0.14/0.46 | ~ is_verdict(X0)
% 0.14/0.46 | ~ is_verdict(X1)
% 0.14/0.46 | box_verdict(X1,X0) = conflict ),
% 0.14/0.46 inference(copy,[status(esa)],[c_44]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_303,plain,
% 0.14/0.46 ( ~ is_verdict(X0)
% 0.14/0.46 | ~ is_verdict(X1)
% 0.14/0.46 | box_verdict(X1,X0) = conflict
% 0.14/0.46 | X0 != conflict ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_302]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_41,plain,
% 0.14/0.46 ( X0 != X1 | leq(X0,X1) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_276_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_296,plain,
% 0.14/0.46 ( X0 != X1 | leq(X0,X1) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_41]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_297,plain,
% 0.14/0.46 ( leq(X0,X1) | X0 != X1 ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_296]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_40,plain,
% 0.14/0.46 ( X0 = conflict | X0 = compatible | X0 = unknown | ~ is_verdict(X0) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_277_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_294,plain,
% 0.14/0.46 ( X0 = conflict | X0 = compatible | X0 = unknown | ~ is_verdict(X0) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_40]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_295,plain,
% 0.14/0.46 ( ~ is_verdict(X0) | X0 = unknown | X0 = compatible | X0 = conflict ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_294]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_7,plain,
% 0.14/0.46 ( less(X0,X1) | X1 = X0 | less(X1,X0) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_9_2) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_228,plain,
% 0.14/0.46 ( less(X0,X1) | X1 = X0 | less(X1,X0) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_7]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_229,plain,
% 0.14/0.46 ( less(X0,X1) | less(X1,X0) | X1 = X0 ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_228]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_4,plain,
% 0.14/0.46 ( box_verdict(X0,X1) = unknown
% 0.14/0.46 | box_verdict(X0,X1) = compatible
% 0.14/0.46 | box_verdict(X0,X1) = conflict
% 0.14/0.46 | ~ is_verdict(X1)
% 0.14/0.46 | ~ is_verdict(X0) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_8_4) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_222,plain,
% 0.14/0.46 ( box_verdict(X0,X1) = unknown
% 0.14/0.46 | box_verdict(X0,X1) = compatible
% 0.14/0.46 | box_verdict(X0,X1) = conflict
% 0.14/0.46 | ~ is_verdict(X1)
% 0.14/0.46 | ~ is_verdict(X0) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_4]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_223,plain,
% 0.14/0.46 ( ~ is_verdict(X0)
% 0.14/0.46 | ~ is_verdict(X1)
% 0.14/0.46 | box_verdict(X1,X0) = unknown
% 0.14/0.46 | box_verdict(X1,X0) = compatible
% 0.14/0.46 | box_verdict(X1,X0) = conflict ),
% 0.14/0.46 inference(rewriting,[status(thm)],[c_222]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_75,plain,
% 0.14/0.46 ( ~ in_closed(sk1_esk3_4(X0,X1,X2,X3),X0,X1)
% 0.14/0.46 | axis_subsumes(X2,X3,X0,X1) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_242_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_364,plain,
% 0.14/0.46 ( ~ in_closed(sk1_esk3_4(X0,X1,X2,X3),X0,X1)
% 0.14/0.46 | axis_subsumes(X2,X3,X0,X1) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_75]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_74,plain,
% 0.14/0.46 ( in_closed(sk1_esk3_4(X0,X1,X2,X3),X2,X3) | axis_subsumes(X2,X3,X0,X1) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_243_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_362,plain,
% 0.14/0.46 ( in_closed(sk1_esk3_4(X0,X1,X2,X3),X2,X3) | axis_subsumes(X2,X3,X0,X1) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_74]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_73,plain,
% 0.14/0.46 ( in_closed(sk1_esk2_4(X0,X1,X2,X3),X2,X3)
% 0.14/0.46 | ~ axis_compatible(X2,X3,X0,X1) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_244_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_360,plain,
% 0.14/0.46 ( in_closed(sk1_esk2_4(X0,X1,X2,X3),X2,X3)
% 0.14/0.46 | ~ axis_compatible(X2,X3,X0,X1) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_73]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_72,plain,
% 0.14/0.46 ( in_closed(sk1_esk2_4(X0,X1,X2,X3),X0,X1)
% 0.14/0.46 | ~ axis_compatible(X2,X3,X0,X1) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_245_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_358,plain,
% 0.14/0.46 ( in_closed(sk1_esk2_4(X0,X1,X2,X3),X0,X1)
% 0.14/0.46 | ~ axis_compatible(X2,X3,X0,X1) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_72]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_71,plain,
% 0.14/0.46 ( in_closed(sk1_esk1_4(X0,X1,X2,X3),X2,X3) | axis_conflict(X2,X3,X0,X1) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_246_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_356,plain,
% 0.14/0.46 ( in_closed(sk1_esk1_4(X0,X1,X2,X3),X2,X3) | axis_conflict(X2,X3,X0,X1) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_71]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_70,plain,
% 0.14/0.46 ( in_closed(sk1_esk1_4(X0,X1,X2,X3),X0,X1) | axis_conflict(X2,X3,X0,X1) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_247_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_354,plain,
% 0.14/0.46 ( in_closed(sk1_esk1_4(X0,X1,X2,X3),X0,X1) | axis_conflict(X2,X3,X0,X1) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_70]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_69,plain,
% 0.14/0.46 ( ~ in_closed(X0,X1,X2)
% 0.14/0.46 | ~ in_closed(X0,X3,X4)
% 0.14/0.46 | axis_compatible(X1,X2,X3,X4) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_248_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_352,plain,
% 0.14/0.46 ( ~ in_closed(X0,X1,X2)
% 0.14/0.46 | ~ in_closed(X0,X3,X4)
% 0.14/0.46 | axis_compatible(X1,X2,X3,X4) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_69]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_68,plain,
% 0.14/0.46 ( ~ in_closed(X0,X1,X2)
% 0.14/0.46 | ~ in_closed(X0,X3,X4)
% 0.14/0.46 | ~ axis_conflict(X1,X2,X3,X4) ),
% 0.14/0.46 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_249_0) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_350,plain,
% 0.14/0.46 ( ~ in_closed(X0,X1,X2)
% 0.14/0.46 | ~ in_closed(X0,X3,X4)
% 0.14/0.46 | ~ axis_conflict(X1,X2,X3,X4) ),
% 0.14/0.46 inference(copy,[status(esa)],[c_68]) ).
% 0.14/0.46
% 0.14/0.46 cnf(c_67,plain,
% 0.14/0.46 ( ~ in_closed(X0,X1,X2)
% 0.14/0.46 | in_closed(X0,X3,X4)
% 0.21/0.47 | ~ axis_subsumes(X1,X2,X3,X4) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_250_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_348,plain,
% 0.21/0.47 ( ~ in_closed(X0,X1,X2)
% 0.21/0.47 | in_closed(X0,X3,X4)
% 0.21/0.47 | ~ axis_subsumes(X1,X2,X3,X4) ),
% 0.21/0.47 inference(copy,[status(esa)],[c_67]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_66,plain,
% 0.21/0.47 ( ~ less(X0,X1) | ~ less(X1,X2) | in_open(X1,X0,X2) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_251_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_346,plain,
% 0.21/0.47 ( ~ less(X0,X1) | ~ less(X1,X2) | in_open(X1,X0,X2) ),
% 0.21/0.47 inference(copy,[status(esa)],[c_66]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_64,plain,
% 0.21/0.47 ( ~ less(X0,X1) | ~ leq(X1,X2) | in_lopen(X1,X0,X2) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_253_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_342,plain,
% 0.21/0.47 ( ~ less(X0,X1) | ~ leq(X1,X2) | in_lopen(X1,X0,X2) ),
% 0.21/0.47 inference(copy,[status(esa)],[c_64]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_63,plain,
% 0.21/0.47 ( ~ leq(X0,X1) | ~ leq(X1,X2) | in_closed(X1,X0,X2) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_254_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_340,plain,
% 0.21/0.47 ( ~ leq(X0,X1) | ~ leq(X1,X2) | in_closed(X1,X0,X2) ),
% 0.21/0.47 inference(copy,[status(esa)],[c_63]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_62,plain,
% 0.21/0.47 ( less(X0,X1) | ~ in_open(X1,X0,X2) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_255_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_338,plain,
% 0.21/0.47 ( less(X0,X1) | ~ in_open(X1,X0,X2) ),
% 0.21/0.47 inference(copy,[status(esa)],[c_62]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_61,plain,
% 0.21/0.47 ( less(X0,X1) | ~ in_open(X0,X2,X1) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_256_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_336,plain,
% 0.21/0.47 ( less(X0,X1) | ~ in_open(X0,X2,X1) ),
% 0.21/0.47 inference(copy,[status(esa)],[c_61]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_60,plain,
% 0.21/0.47 ( leq(X0,X1) | ~ in_ropen(X1,X0,X2) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_257_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_334,plain,
% 0.21/0.47 ( leq(X0,X1) | ~ in_ropen(X1,X0,X2) ),
% 0.21/0.47 inference(copy,[status(esa)],[c_60]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_59,plain,
% 0.21/0.47 ( less(X0,X1) | ~ in_ropen(X0,X2,X1) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_258_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_332,plain,
% 0.21/0.47 ( less(X0,X1) | ~ in_ropen(X0,X2,X1) ),
% 0.21/0.47 inference(copy,[status(esa)],[c_59]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_56,plain,
% 0.21/0.47 ( leq(X0,X1) | ~ in_closed(X1,X0,X2) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_261_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_326,plain,
% 0.21/0.47 ( leq(X0,X1) | ~ in_closed(X1,X0,X2) ),
% 0.21/0.47 inference(copy,[status(esa)],[c_56]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_55,plain,
% 0.21/0.47 ( leq(X0,X1) | ~ in_closed(X0,X2,X1) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_262_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_324,plain,
% 0.21/0.47 ( leq(X0,X1) | ~ in_closed(X0,X2,X1) ),
% 0.21/0.47 inference(copy,[status(esa)],[c_55]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_54,plain,
% 0.21/0.47 ( ~ leq(X0,X1) | ~ leq(X1,X2) | leq(X0,X2) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_263_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_322,plain,
% 0.21/0.47 ( ~ leq(X0,X1) | ~ leq(X1,X2) | leq(X0,X2) ),
% 0.21/0.47 inference(copy,[status(esa)],[c_54]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_51,plain,
% 0.21/0.47 ( ~ leq(X0,X1) | ~ leq(X1,X0) | X0 = X1 ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_266_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_316,plain,
% 0.21/0.47 ( ~ leq(X0,X1) | ~ leq(X1,X0) | X0 = X1 ),
% 0.21/0.47 inference(copy,[status(esa)],[c_51]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_50,plain,
% 0.21/0.47 ( ~ less(X0,X1) | ~ less(X1,X2) | less(X0,X2) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_267_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_314,plain,
% 0.21/0.47 ( ~ less(X0,X1) | ~ less(X1,X2) | less(X0,X2) ),
% 0.21/0.47 inference(copy,[status(esa)],[c_50]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_39,plain,
% 0.21/0.47 ( ~ less(X0,X0) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_278_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_292,plain,( ~ less(X0,X0) ),inference(copy,[status(esa)],[c_39]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_38,plain,
% 0.21/0.47 ( v0 != v200 ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_279_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_290,plain,( v0 != v200 ),inference(copy,[status(esa)],[c_38]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_37,plain,
% 0.21/0.47 ( v0 != v400 ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_280_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_288,plain,( v0 != v400 ),inference(copy,[status(esa)],[c_37]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_36,plain,
% 0.21/0.47 ( v0 != v600 ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_281_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_286,plain,( v0 != v600 ),inference(copy,[status(esa)],[c_36]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_35,plain,
% 0.21/0.47 ( v0 != v800 ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_282_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_284,plain,( v0 != v800 ),inference(copy,[status(esa)],[c_35]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_34,plain,
% 0.21/0.47 ( v200 != v400 ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_283_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_282,plain,( v200 != v400 ),inference(copy,[status(esa)],[c_34]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_33,plain,
% 0.21/0.47 ( v200 != v600 ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_284_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_280,plain,( v200 != v600 ),inference(copy,[status(esa)],[c_33]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_32,plain,
% 0.21/0.47 ( v200 != v800 ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_285_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_278,plain,( v200 != v800 ),inference(copy,[status(esa)],[c_32]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_31,plain,
% 0.21/0.47 ( v400 != v600 ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_286_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_276,plain,( v400 != v600 ),inference(copy,[status(esa)],[c_31]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_30,plain,
% 0.21/0.47 ( v400 != v800 ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_287_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_274,plain,( v400 != v800 ),inference(copy,[status(esa)],[c_30]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_29,plain,
% 0.21/0.47 ( v600 != v800 ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_288_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_272,plain,( v600 != v800 ),inference(copy,[status(esa)],[c_29]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_28,plain,
% 0.21/0.47 ( less(v600,v800) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_289_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_270,plain,( less(v600,v800) ),inference(copy,[status(esa)],[c_28]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_27,plain,
% 0.21/0.47 ( less(v400,v800) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_290_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_268,plain,( less(v400,v800) ),inference(copy,[status(esa)],[c_27]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_26,plain,
% 0.21/0.47 ( less(v400,v600) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_291_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_266,plain,( less(v400,v600) ),inference(copy,[status(esa)],[c_26]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_25,plain,
% 0.21/0.47 ( less(v200,v800) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_292_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_264,plain,( less(v200,v800) ),inference(copy,[status(esa)],[c_25]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_24,plain,
% 0.21/0.47 ( less(v200,v600) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_293_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_262,plain,( less(v200,v600) ),inference(copy,[status(esa)],[c_24]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_23,plain,
% 0.21/0.47 ( less(v200,v400) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_294_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_260,plain,( less(v200,v400) ),inference(copy,[status(esa)],[c_23]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_22,plain,
% 0.21/0.47 ( less(v0,v800) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_295_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_258,plain,( less(v0,v800) ),inference(copy,[status(esa)],[c_22]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_21,plain,
% 0.21/0.47 ( less(v0,v600) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_296_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_256,plain,( less(v0,v600) ),inference(copy,[status(esa)],[c_21]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_20,plain,
% 0.21/0.47 ( less(v0,v400) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_297_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_254,plain,( less(v0,v400) ),inference(copy,[status(esa)],[c_20]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_19,plain,
% 0.21/0.47 ( less(v0,v200) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_298_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_252,plain,( less(v0,v200) ),inference(copy,[status(esa)],[c_19]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_18,plain,
% 0.21/0.47 ( val(v800) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_299_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_250,plain,( val(v800) ),inference(copy,[status(esa)],[c_18]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_17,plain,
% 0.21/0.47 ( val(v600) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_300_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_248,plain,( val(v600) ),inference(copy,[status(esa)],[c_17]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_16,plain,
% 0.21/0.47 ( val(v400) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_301_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_246,plain,( val(v400) ),inference(copy,[status(esa)],[c_16]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_15,plain,
% 0.21/0.47 ( val(v200) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_302_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_244,plain,( val(v200) ),inference(copy,[status(esa)],[c_15]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_14,plain,
% 0.21/0.47 ( val(v0) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_303_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_242,plain,( val(v0) ),inference(copy,[status(esa)],[c_14]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_13,plain,
% 0.21/0.47 ( compatible != unknown ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_304_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_240,plain,
% 0.21/0.47 ( compatible != unknown ),
% 0.21/0.47 inference(copy,[status(esa)],[c_13]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_12,plain,
% 0.21/0.47 ( conflict != unknown ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_305_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_238,plain,
% 0.21/0.47 ( conflict != unknown ),
% 0.21/0.47 inference(copy,[status(esa)],[c_12]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_11,plain,
% 0.21/0.47 ( conflict != compatible ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_306_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_236,plain,
% 0.21/0.47 ( conflict != compatible ),
% 0.21/0.47 inference(copy,[status(esa)],[c_11]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_10,plain,
% 0.21/0.47 ( is_verdict(unknown) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_307_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_234,plain,
% 0.21/0.47 ( is_verdict(unknown) ),
% 0.21/0.47 inference(copy,[status(esa)],[c_10]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_9,plain,
% 0.21/0.47 ( is_verdict(compatible) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_308_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_232,plain,
% 0.21/0.47 ( is_verdict(compatible) ),
% 0.21/0.47 inference(copy,[status(esa)],[c_9]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_8,plain,
% 0.21/0.47 ( is_verdict(conflict) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_309_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_230,plain,
% 0.21/0.47 ( is_verdict(conflict) ),
% 0.21/0.47 inference(copy,[status(esa)],[c_8]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_5,plain,
% 0.21/0.47 ( less(X0,X1) | X0 = X1 | less(X1,X0) ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_9_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_224,plain,
% 0.21/0.47 ( less(X0,X1) | X0 = X1 | less(X1,X0) ),
% 0.21/0.47 inference(copy,[status(esa)],[c_5]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_225,plain,
% 0.21/0.47 ( less(X0,X1) | less(X1,X0) | X0 = X1 ),
% 0.21/0.47 inference(rewriting,[status(thm)],[c_224]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_0,plain,
% 0.21/0.47 ( ~ is_verdict(X0)
% 0.21/0.47 | ~ is_verdict(X1)
% 0.21/0.47 | box_verdict(X0,X1) = conflict
% 0.21/0.47 | box_verdict(X0,X1) = compatible
% 0.21/0.47 | box_verdict(X0,X1) = unknown ),
% 0.21/0.47 file('/export/starexec/sandbox/tmp/iprover_modulo_da018c.p', c_0_8_0) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_214,plain,
% 0.21/0.47 ( ~ is_verdict(X0)
% 0.21/0.47 | ~ is_verdict(X1)
% 0.21/0.47 | box_verdict(X0,X1) = conflict
% 0.21/0.47 | box_verdict(X0,X1) = compatible
% 0.21/0.47 | box_verdict(X0,X1) = unknown ),
% 0.21/0.47 inference(copy,[status(esa)],[c_0]) ).
% 0.21/0.47
% 0.21/0.47 cnf(c_215,plain,
% 0.21/0.47 ( ~ is_verdict(X0)
% 0.21/0.47 | ~ is_verdict(X1)
% 0.21/0.47 | box_verdict(X0,X1) = unknown
% 0.21/0.47 | box_verdict(X0,X1) = compatible
% 0.21/0.47 | box_verdict(X0,X1) = conflict ),
% 0.21/0.47 inference(rewriting,[status(thm)],[c_214]) ).
% 0.21/0.47
% 0.21/0.47
% 0.21/0.47
% 0.21/0.47 % ------ Statistics
% 0.21/0.47
% 0.21/0.47 % ------ General
% 0.21/0.47
% 0.21/0.47 % num_of_input_clauses: 80
% 0.21/0.47 % num_of_input_neg_conjectures: 4
% 0.21/0.47 % num_of_splits: 0
% 0.21/0.47 % num_of_split_atoms: 0
% 0.21/0.47 % num_of_sem_filtered_clauses: 0
% 0.21/0.47 % num_of_subtypes: 0
% 0.21/0.47 % monotx_restored_types: 0
% 0.21/0.47 % sat_num_of_epr_types: 0
% 0.21/0.47 % sat_num_of_non_cyclic_types: 0
% 0.21/0.47 % sat_guarded_non_collapsed_types: 0
% 0.21/0.47 % is_epr: 0
% 0.21/0.47 % is_horn: 0
% 0.21/0.47 % has_eq: 1
% 0.21/0.47 % num_pure_diseq_elim: 0
% 0.21/0.47 % simp_replaced_by: 0
% 0.21/0.47 % res_preprocessed: 8
% 0.21/0.47 % prep_upred: 0
% 0.21/0.47 % prep_unflattend: 0
% 0.21/0.47 % pred_elim_cands: 0
% 0.21/0.47 % pred_elim: 0
% 0.21/0.47 % pred_elim_cl: 0
% 0.21/0.47 % pred_elim_cycles: 0
% 0.21/0.47 % forced_gc_time: 0
% 0.21/0.47 % gc_basic_clause_elim: 0
% 0.21/0.47 % parsing_time: 0.003
% 0.21/0.47 % sem_filter_time: 0.
% 0.21/0.47 % pred_elim_time: 0.
% 0.21/0.47 % out_proof_time: 0.
% 0.21/0.47 % monotx_time: 0.
% 0.21/0.47 % subtype_inf_time: 0.
% 0.21/0.47 % unif_index_cands_time: 0.
% 0.21/0.47 % unif_index_add_time: 0.
% 0.21/0.47 % total_time: 0.048
% 0.21/0.47 % num_of_symbols: 50
% 0.21/0.47 % num_of_terms: 229
% 0.21/0.47
% 0.21/0.47 % ------ Propositional Solver
% 0.21/0.47
% 0.21/0.47 % prop_solver_calls: 1
% 0.21/0.47 % prop_fast_solver_calls: 12
% 0.21/0.47 % prop_num_of_clauses: 100
% 0.21/0.47 % prop_preprocess_simplified: 182
% 0.21/0.47 % prop_fo_subsumed: 0
% 0.21/0.47 % prop_solver_time: 0.
% 0.21/0.47 % prop_fast_solver_time: 0.
% 0.21/0.47 % prop_unsat_core_time: 0.
% 0.21/0.47
% 0.21/0.47 % ------ QBF
% 0.21/0.47
% 0.21/0.47 % qbf_q_res: 0
% 0.21/0.47 % qbf_num_tautologies: 0
% 0.21/0.47 % qbf_prep_cycles: 0
% 0.21/0.47
% 0.21/0.47 % ------ BMC1
% 0.21/0.47
% 0.21/0.47 % bmc1_current_bound: -1
% 0.21/0.47 % bmc1_last_solved_bound: -1
% 0.21/0.47 % bmc1_unsat_core_size: -1
% 0.21/0.47 % bmc1_unsat_core_parents_size: -1
% 0.21/0.47 % bmc1_merge_next_fun: 0
% 0.21/0.47 % bmc1_unsat_core_clauses_time: 0.
% 0.21/0.47
% 0.21/0.47 % ------ Instantiation
% 0.21/0.47
% 0.21/0.47 % inst_num_of_clauses: 80
% 0.21/0.47 % inst_num_in_passive: 0
% 0.21/0.47 % inst_num_in_active: 0
% 0.21/0.47 % inst_num_in_unprocessed: 80
% 0.21/0.47 % inst_num_of_loops: 0
% 0.21/0.47 % inst_num_of_learning_restarts: 0
% 0.21/0.47 % inst_num_moves_active_passive: 0
% 0.21/0.47 % inst_lit_activity: 0
% 0.21/0.47 % inst_lit_activity_moves: 0
% 0.21/0.47 % inst_num_tautologies: 0
% 0.21/0.47 % inst_num_prop_implied: 0
% 0.21/0.47 % inst_num_existing_simplified: 0
% 0.21/0.47 % inst_num_eq_res_simplified: 0
% 0.21/0.47 % inst_num_child_elim: 0
% 0.21/0.47 % inst_num_of_dismatching_blockings: 0
% 0.21/0.47 % inst_num_of_non_proper_insts: 0
% 0.21/0.47 % inst_num_of_duplicates: 0
% 0.21/0.47 % inst_inst_num_from_inst_to_res: 0
% 0.21/0.47 % inst_dismatching_checking_time: 0.
% 0.21/0.47
% 0.21/0.47 % ------ Resolution
% 0.21/0.47
% 0.21/0.47 % res_num_of_clauses: 103
% 0.21/0.47 % res_num_in_passive: 0
% 0.21/0.47 % res_num_in_active: 85
% 0.21/0.47 % res_num_of_loops: 15
% 0.21/0.47 % res_forward_subset_subsumed: 7
% 0.21/0.47 % res_backward_subset_subsumed: 0
% 0.21/0.47 % res_forward_subsumed: 0
% 0.21/0.47 % res_backward_subsumed: 0
% 0.21/0.47 % res_forward_subsumption_resolution: 0
% 0.21/0.47 % res_backward_subsumption_resolution: 0
% 0.21/0.47 % res_clause_to_clause_subsumption: 6
% 0.21/0.47 % res_orphan_elimination: 0
% 0.21/0.47 % res_tautology_del: 0
% 0.21/0.47 % res_num_eq_res_simplified: 0
% 0.21/0.47 % res_num_sel_changes: 0
% 0.21/0.47 % res_moves_from_active_to_pass: 0
% 0.21/0.47
% 0.21/0.47 % Status Unknown
% 0.21/0.51 % Orienting using strategy ClausalAll
% 0.21/0.51 % FOF problem with conjecture
% 0.21/0.51 % 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/sandbox/tmp/iprover_proof_1339c8.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_da018c.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_fdfd51 | grep -v "SZS"
% 0.21/0.54
% 0.21/0.54 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.54
% 0.21/0.54 %
% 0.21/0.54 % ------ iProver source info
% 0.21/0.54
% 0.21/0.54 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.54 % git: non_committed_changes: true
% 0.21/0.54 % git: last_make_outside_of_git: true
% 0.21/0.54
% 0.21/0.54 %
% 0.21/0.54 % ------ Input Options
% 0.21/0.54
% 0.21/0.54 % --out_options all
% 0.21/0.54 % --tptp_safe_out true
% 0.21/0.54 % --problem_path ""
% 0.21/0.54 % --include_path ""
% 0.21/0.54 % --clausifier .//eprover
% 0.21/0.54 % --clausifier_options --tstp-format
% 0.21/0.54 % --stdin false
% 0.21/0.54 % --dbg_backtrace false
% 0.21/0.54 % --dbg_dump_prop_clauses false
% 0.21/0.54 % --dbg_dump_prop_clauses_file -
% 0.21/0.54 % --dbg_out_stat false
% 0.21/0.54
% 0.21/0.54 % ------ General Options
% 0.21/0.54
% 0.21/0.54 % --fof false
% 0.21/0.54 % --time_out_real 150.
% 0.21/0.54 % --time_out_prep_mult 0.2
% 0.21/0.54 % --time_out_virtual -1.
% 0.21/0.54 % --schedule none
% 0.21/0.54 % --ground_splitting input
% 0.21/0.54 % --splitting_nvd 16
% 0.21/0.54 % --non_eq_to_eq false
% 0.21/0.54 % --prep_gs_sim true
% 0.21/0.54 % --prep_unflatten false
% 0.21/0.54 % --prep_res_sim true
% 0.21/0.54 % --prep_upred true
% 0.21/0.54 % --res_sim_input true
% 0.21/0.54 % --clause_weak_htbl true
% 0.21/0.54 % --gc_record_bc_elim false
% 0.21/0.54 % --symbol_type_check false
% 0.21/0.54 % --clausify_out false
% 0.21/0.54 % --large_theory_mode false
% 0.21/0.54 % --prep_sem_filter none
% 0.21/0.54 % --prep_sem_filter_out false
% 0.21/0.54 % --preprocessed_out false
% 0.21/0.54 % --sub_typing false
% 0.21/0.54 % --brand_transform false
% 0.21/0.54 % --pure_diseq_elim true
% 0.21/0.54 % --min_unsat_core false
% 0.21/0.54 % --pred_elim true
% 0.21/0.54 % --add_important_lit false
% 0.21/0.54 % --soft_assumptions false
% 0.21/0.54 % --reset_solvers false
% 0.21/0.54 % --bc_imp_inh []
% 0.21/0.54 % --conj_cone_tolerance 1.5
% 0.21/0.54 % --prolific_symb_bound 500
% 0.21/0.54 % --lt_threshold 2000
% 0.21/0.54
% 0.21/0.54 % ------ SAT Options
% 0.21/0.54
% 0.21/0.54 % --sat_mode false
% 0.21/0.54 % --sat_fm_restart_options ""
% 0.21/0.54 % --sat_gr_def false
% 0.21/0.54 % --sat_epr_types true
% 0.21/0.54 % --sat_non_cyclic_types false
% 0.21/0.54 % --sat_finite_models false
% 0.21/0.54 % --sat_fm_lemmas false
% 0.21/0.54 % --sat_fm_prep false
% 0.21/0.54 % --sat_fm_uc_incr true
% 0.21/0.54 % --sat_out_model small
% 0.21/0.54 % --sat_out_clauses false
% 0.21/0.54
% 0.21/0.54 % ------ QBF Options
% 0.21/0.54
% 0.21/0.54 % --qbf_mode false
% 0.21/0.54 % --qbf_elim_univ true
% 0.21/0.54 % --qbf_sk_in true
% 0.21/0.54 % --qbf_pred_elim true
% 0.21/0.54 % --qbf_split 32
% 0.21/0.54
% 0.21/0.54 % ------ BMC1 Options
% 0.21/0.54
% 0.21/0.54 % --bmc1_incremental false
% 0.21/0.54 % --bmc1_axioms reachable_all
% 0.21/0.54 % --bmc1_min_bound 0
% 0.21/0.54 % --bmc1_max_bound -1
% 0.21/0.54 % --bmc1_max_bound_default -1
% 0.21/0.54 % --bmc1_symbol_reachability true
% 0.21/0.54 % --bmc1_property_lemmas false
% 0.21/0.54 % --bmc1_k_induction false
% 0.21/0.54 % --bmc1_non_equiv_states false
% 0.21/0.54 % --bmc1_deadlock false
% 0.21/0.54 % --bmc1_ucm false
% 0.21/0.54 % --bmc1_add_unsat_core none
% 0.21/0.54 % --bmc1_unsat_core_children false
% 0.21/0.54 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.54 % --bmc1_out_stat full
% 0.21/0.54 % --bmc1_ground_init false
% 0.21/0.54 % --bmc1_pre_inst_next_state false
% 0.21/0.54 % --bmc1_pre_inst_state false
% 0.21/0.54 % --bmc1_pre_inst_reach_state false
% 0.21/0.54 % --bmc1_out_unsat_core false
% 0.21/0.54 % --bmc1_aig_witness_out false
% 0.21/0.54 % --bmc1_verbose false
% 0.21/0.54 % --bmc1_dump_clauses_tptp false
% 0.21/0.56 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.56 % --bmc1_dump_file -
% 0.21/0.56 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.56 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.56 % --bmc1_ucm_extend_mode 1
% 0.21/0.56 % --bmc1_ucm_init_mode 2
% 0.21/0.56 % --bmc1_ucm_cone_mode none
% 0.21/0.56 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.56 % --bmc1_ucm_relax_model 4
% 0.21/0.56 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.56 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.56 % --bmc1_ucm_layered_model none
% 0.21/0.56 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.56
% 0.21/0.56 % ------ AIG Options
% 0.21/0.56
% 0.21/0.56 % --aig_mode false
% 0.21/0.56
% 0.21/0.56 % ------ Instantiation Options
% 0.21/0.56
% 0.21/0.56 % --instantiation_flag true
% 0.21/0.56 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.56 % --inst_solver_per_active 750
% 0.21/0.56 % --inst_solver_calls_frac 0.5
% 0.21/0.56 % --inst_passive_queue_type priority_queues
% 0.21/0.56 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.56 % --inst_passive_queues_freq [25;2]
% 0.21/0.56 % --inst_dismatching true
% 0.21/0.56 % --inst_eager_unprocessed_to_passive true
% 0.21/0.56 % --inst_prop_sim_given true
% 0.21/0.56 % --inst_prop_sim_new false
% 0.21/0.56 % --inst_orphan_elimination true
% 0.21/0.56 % --inst_learning_loop_flag true
% 0.21/0.56 % --inst_learning_start 3000
% 0.21/0.56 % --inst_learning_factor 2
% 0.21/0.56 % --inst_start_prop_sim_after_learn 3
% 0.21/0.56 % --inst_sel_renew solver
% 0.21/0.56 % --inst_lit_activity_flag true
% 0.21/0.56 % --inst_out_proof true
% 0.21/0.56
% 0.21/0.56 % ------ Resolution Options
% 0.21/0.56
% 0.21/0.56 % --resolution_flag true
% 0.21/0.56 % --res_lit_sel kbo_max
% 0.21/0.56 % --res_to_prop_solver none
% 0.21/0.56 % --res_prop_simpl_new false
% 0.21/0.56 % --res_prop_simpl_given false
% 0.21/0.56 % --res_passive_queue_type priority_queues
% 0.21/0.56 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.56 % --res_passive_queues_freq [15;5]
% 0.21/0.56 % --res_forward_subs full
% 0.21/0.56 % --res_backward_subs full
% 0.21/0.56 % --res_forward_subs_resolution true
% 0.21/0.56 % --res_backward_subs_resolution true
% 0.21/0.56 % --res_orphan_elimination false
% 0.21/0.56 % --res_time_limit 1000.
% 0.21/0.56 % --res_out_proof true
% 0.21/0.56 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_1339c8.s
% 0.21/0.56 % --modulo true
% 0.21/0.56
% 0.21/0.56 % ------ Combination Options
% 0.21/0.56
% 0.21/0.56 % --comb_res_mult 1000
% 0.21/0.56 % --comb_inst_mult 300
% 0.21/0.56 % ------
% 0.21/0.56
% 0.21/0.56 % ------ Parsing...% successful
% 0.21/0.56
% 0.21/0.56 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.21/0.56
% 0.21/0.56 % ------ Proving...
% 0.21/0.56 % ------ Problem Properties
% 0.21/0.56
% 0.21/0.56 %
% 0.21/0.56 % EPR false
% 0.21/0.56 % Horn false
% 0.21/0.56 % Has equality true
% 0.21/0.56
% 0.21/0.56 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.56
% 0.21/0.56
% 0.21/0.56 % % ------ Current options:
% 0.21/0.56
% 0.21/0.56 % ------ Input Options
% 0.21/0.56
% 0.21/0.56 % --out_options all
% 0.21/0.56 % --tptp_safe_out true
% 0.21/0.56 % --problem_path ""
% 0.21/0.56 % --include_path ""
% 0.21/0.56 % --clausifier .//eprover
% 0.21/0.56 % --clausifier_options --tstp-format
% 0.21/0.56 % --stdin false
% 0.21/0.56 % --dbg_backtrace false
% 0.21/0.56 % --dbg_dump_prop_clauses false
% 0.21/0.56 % --dbg_dump_prop_clauses_file -
% 0.21/0.56 % --dbg_out_stat false
% 0.21/0.56
% 0.21/0.56 % ------ General Options
% 0.21/0.56
% 0.21/0.56 % --fof false
% 0.21/0.56 % --time_out_real 150.
% 0.21/0.56 % --time_out_prep_mult 0.2
% 0.21/0.56 % --time_out_virtual -1.
% 0.21/0.56 % --schedule none
% 0.21/0.56 % --ground_splitting input
% 0.21/0.56 % --splitting_nvd 16
% 0.21/0.56 % --non_eq_to_eq false
% 0.21/0.56 % --prep_gs_sim true
% 0.21/0.56 % --prep_unflatten false
% 0.21/0.56 % --prep_res_sim true
% 0.21/0.56 % --prep_upred true
% 0.21/0.56 % --res_sim_input true
% 0.21/0.56 % --clause_weak_htbl true
% 0.21/0.56 % --gc_record_bc_elim false
% 0.21/0.56 % --symbol_type_check false
% 0.21/0.56 % --clausify_out false
% 0.21/0.56 % --large_theory_mode false
% 0.21/0.56 % --prep_sem_filter none
% 0.21/0.56 % --prep_sem_filter_out false
% 0.21/0.56 % --preprocessed_out false
% 0.21/0.56 % --sub_typing false
% 0.21/0.56 % --brand_transform false
% 0.21/0.56 % --pure_diseq_elim true
% 0.21/0.56 % --min_unsat_core false
% 0.21/0.56 % --pred_elim true
% 0.21/0.56 % --add_important_lit false
% 0.21/0.56 % --soft_assumptions false
% 0.21/0.56 % --reset_solvers false
% 0.21/0.56 % --bc_imp_inh []
% 0.21/0.56 % --conj_cone_tolerance 1.5
% 0.21/0.56 % --prolific_symb_bound 500
% 0.21/0.56 % --lt_threshold 2000
% 0.21/0.56
% 0.21/0.56 % ------ SAT Options
% 0.21/0.56
% 0.21/0.56 % --sat_mode false
% 0.21/0.56 % --sat_fm_restart_options ""
% 0.21/0.56 % --sat_gr_def false
% 0.21/0.56 % --sat_epr_types true
% 0.21/0.56 % --sat_non_cyclic_types false
% 0.21/0.56 % --sat_finite_models false
% 0.21/0.56 % --sat_fm_lemmas false
% 0.21/0.56 % --sat_fm_prep false
% 0.21/0.56 % --sat_fm_uc_incr true
% 0.21/0.56 % --sat_out_model small
% 0.21/0.56 % --sat_out_clauses false
% 0.21/0.56
% 0.21/0.56 % ------ QBF Options
% 0.21/0.56
% 0.21/0.56 % --qbf_mode false
% 0.21/0.56 % --qbf_elim_univ true
% 0.21/0.56 % --qbf_sk_in true
% 0.21/0.56 % --qbf_pred_elim true
% 0.21/0.56 % --qbf_split 32
% 0.21/0.56
% 0.21/0.56 % ------ BMC1 Options
% 0.21/0.56
% 0.21/0.56 % --bmc1_incremental false
% 0.21/0.56 % --bmc1_axioms reachable_all
% 0.21/0.56 % --bmc1_min_bound 0
% 0.21/0.56 % --bmc1_max_bound -1
% 0.21/0.56 % --bmc1_max_bound_default -1
% 0.21/0.56 % --bmc1_symbol_reachability true
% 0.21/0.56 % --bmc1_property_lemmas false
% 0.21/0.56 % --bmc1_k_induction false
% 0.21/0.56 % --bmc1_non_equiv_states false
% 0.21/0.56 % --bmc1_deadlock false
% 0.21/0.56 % --bmc1_ucm false
% 0.21/0.56 % --bmc1_add_unsat_core none
% 0.21/0.56 % --bmc1_unsat_core_children false
% 0.21/0.56 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.56 % --bmc1_out_stat full
% 0.21/0.56 % --bmc1_ground_init false
% 0.21/0.56 % --bmc1_pre_inst_next_state false
% 0.21/0.56 % --bmc1_pre_inst_state false
% 0.21/0.56 % --bmc1_pre_inst_reach_state false
% 0.21/0.56 % --bmc1_out_unsat_core false
% 0.21/0.56 % --bmc1_aig_witness_out false
% 0.21/0.56 % --bmc1_verbose false
% 0.21/0.56 % --bmc1_dump_clauses_tptp false
% 0.21/0.56 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.56 % --bmc1_dump_file -
% 0.21/0.56 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.56 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.56 % --bmc1_ucm_extend_mode 1
% 0.21/0.56 % --bmc1_ucm_init_mode 2
% 0.21/0.56 % --bmc1_ucm_cone_mode none
% 0.21/0.56 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.56 % --bmc1_ucm_relax_model 4
% 0.21/0.56 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.56 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.56 % --bmc1_ucm_layered_model none
% 0.21/0.56 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.56
% 0.21/0.56 % ------ AIG Options
% 0.21/0.56
% 0.21/0.56 % --aig_mode false
% 0.21/0.56
% 0.21/0.56 % ------ Instantiation Options
% 0.21/0.56
% 0.21/0.56 % --instantiation_flag true
% 0.21/0.56 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.56 % --inst_solver_per_active 750
% 0.21/0.56 % --inst_solver_calls_frac 0.5
% 0.21/0.56 % --inst_passive_queue_type priority_queues
% 0.21/0.56 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.56 % --inst_passive_queues_freq [25;2]
% 0.21/0.56 % --inst_dismatching true
% 0.21/0.56 % --inst_eager_unprocessed_to_passive true
% 0.21/0.56 % --inst_prop_sim_given true
% 0.34/0.60 % --inst_prop_sim_new false
% 0.34/0.60 % --inst_orphan_elimination true
% 0.34/0.60 % --inst_learning_loop_flag true
% 0.34/0.60 % --inst_learning_start 3000
% 0.34/0.60 % --inst_learning_factor 2
% 0.34/0.60 % --inst_start_prop_sim_after_learn 3
% 0.34/0.60 % --inst_sel_renew solver
% 0.34/0.60 % --inst_lit_activity_flag true
% 0.34/0.60 % --inst_out_proof true
% 0.34/0.60
% 0.34/0.60 % ------ Resolution Options
% 0.34/0.60
% 0.34/0.60 % --resolution_flag true
% 0.34/0.60 % --res_lit_sel kbo_max
% 0.34/0.60 % --res_to_prop_solver none
% 0.34/0.60 % --res_prop_simpl_new false
% 0.34/0.60 % --res_prop_simpl_given false
% 0.34/0.60 % --res_passive_queue_type priority_queues
% 0.34/0.60 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.34/0.60 % --res_passive_queues_freq [15;5]
% 0.34/0.60 % --res_forward_subs full
% 0.34/0.60 % --res_backward_subs full
% 0.34/0.60 % --res_forward_subs_resolution true
% 0.34/0.60 % --res_backward_subs_resolution true
% 0.34/0.60 % --res_orphan_elimination false
% 0.34/0.60 % --res_time_limit 1000.
% 0.34/0.60 % --res_out_proof true
% 0.34/0.60 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_1339c8.s
% 0.34/0.60 % --modulo true
% 0.34/0.60
% 0.34/0.60 % ------ Combination Options
% 0.34/0.60
% 0.34/0.60 % --comb_res_mult 1000
% 0.34/0.60 % --comb_inst_mult 300
% 0.34/0.60 % ------
% 0.34/0.60
% 0.34/0.60
% 0.34/0.60
% 0.34/0.60 % ------ Proving...
% 0.34/0.60 %
% 0.34/0.60
% 0.34/0.60
% 0.34/0.60 % Resolution empty clause
% 0.34/0.60
% 0.34/0.60 % ------ Statistics
% 0.34/0.60
% 0.34/0.60 % ------ General
% 0.34/0.60
% 0.34/0.60 % num_of_input_clauses: 146
% 0.34/0.60 % num_of_input_neg_conjectures: 4
% 0.34/0.60 % num_of_splits: 0
% 0.34/0.60 % num_of_split_atoms: 0
% 0.34/0.60 % num_of_sem_filtered_clauses: 0
% 0.34/0.60 % num_of_subtypes: 0
% 0.34/0.60 % monotx_restored_types: 0
% 0.34/0.60 % sat_num_of_epr_types: 0
% 0.34/0.60 % sat_num_of_non_cyclic_types: 0
% 0.34/0.60 % sat_guarded_non_collapsed_types: 0
% 0.34/0.60 % is_epr: 0
% 0.34/0.60 % is_horn: 0
% 0.34/0.60 % has_eq: 1
% 0.34/0.60 % num_pure_diseq_elim: 0
% 0.34/0.60 % simp_replaced_by: 0
% 0.34/0.60 % res_preprocessed: 8
% 0.34/0.60 % prep_upred: 0
% 0.34/0.60 % prep_unflattend: 0
% 0.34/0.60 % pred_elim_cands: 0
% 0.34/0.60 % pred_elim: 0
% 0.34/0.60 % pred_elim_cl: 0
% 0.34/0.60 % pred_elim_cycles: 0
% 0.34/0.60 % forced_gc_time: 0
% 0.34/0.60 % gc_basic_clause_elim: 0
% 0.34/0.60 % parsing_time: 0.006
% 0.34/0.60 % sem_filter_time: 0.
% 0.34/0.60 % pred_elim_time: 0.
% 0.34/0.60 % out_proof_time: 0.001
% 0.34/0.60 % monotx_time: 0.
% 0.34/0.60 % subtype_inf_time: 0.
% 0.34/0.60 % unif_index_cands_time: 0.
% 0.34/0.60 % unif_index_add_time: 0.
% 0.34/0.60 % total_time: 0.086
% 0.34/0.60 % num_of_symbols: 50
% 0.34/0.60 % num_of_terms: 720
% 0.34/0.60
% 0.34/0.60 % ------ Propositional Solver
% 0.34/0.60
% 0.34/0.60 % prop_solver_calls: 1
% 0.34/0.60 % prop_fast_solver_calls: 12
% 0.34/0.60 % prop_num_of_clauses: 121
% 0.34/0.60 % prop_preprocess_simplified: 425
% 0.34/0.60 % prop_fo_subsumed: 0
% 0.34/0.60 % prop_solver_time: 0.
% 0.34/0.60 % prop_fast_solver_time: 0.
% 0.34/0.60 % prop_unsat_core_time: 0.
% 0.34/0.60
% 0.34/0.60 % ------ QBF
% 0.34/0.60
% 0.34/0.60 % qbf_q_res: 0
% 0.34/0.60 % qbf_num_tautologies: 0
% 0.34/0.60 % qbf_prep_cycles: 0
% 0.34/0.60
% 0.34/0.60 % ------ BMC1
% 0.34/0.60
% 0.34/0.60 % bmc1_current_bound: -1
% 0.34/0.60 % bmc1_last_solved_bound: -1
% 0.34/0.60 % bmc1_unsat_core_size: -1
% 0.34/0.60 % bmc1_unsat_core_parents_size: -1
% 0.34/0.60 % bmc1_merge_next_fun: 0
% 0.34/0.60 % bmc1_unsat_core_clauses_time: 0.
% 0.34/0.60
% 0.34/0.60 % ------ Instantiation
% 0.34/0.60
% 0.34/0.60 % inst_num_of_clauses: 144
% 0.34/0.60 % inst_num_in_passive: 0
% 0.34/0.60 % inst_num_in_active: 0
% 0.34/0.60 % inst_num_in_unprocessed: 146
% 0.34/0.60 % inst_num_of_loops: 0
% 0.34/0.60 % inst_num_of_learning_restarts: 0
% 0.34/0.60 % inst_num_moves_active_passive: 0
% 0.34/0.60 % inst_lit_activity: 0
% 0.34/0.60 % inst_lit_activity_moves: 0
% 0.34/0.60 % inst_num_tautologies: 0
% 0.34/0.60 % inst_num_prop_implied: 0
% 0.34/0.60 % inst_num_existing_simplified: 0
% 0.34/0.60 % inst_num_eq_res_simplified: 0
% 0.34/0.60 % inst_num_child_elim: 0
% 0.34/0.60 % inst_num_of_dismatching_blockings: 0
% 0.34/0.60 % inst_num_of_non_proper_insts: 0
% 0.34/0.60 % inst_num_of_duplicates: 0
% 0.34/0.60 % inst_inst_num_from_inst_to_res: 0
% 0.34/0.60 % inst_dismatching_checking_time: 0.
% 0.34/0.60
% 0.34/0.60 % ------ Resolution
% 0.34/0.60
% 0.34/0.60 % res_num_of_clauses: 541
% 0.34/0.60 % res_num_in_passive: 293
% 0.34/0.60 % res_num_in_active: 187
% 0.34/0.60 % res_num_of_loops: 118
% 0.34/0.60 % res_forward_subset_subsumed: 273
% 0.34/0.60 % res_backward_subset_subsumed: 25
% 0.34/0.60 % res_forward_subsumed: 21
% 0.34/0.60 % res_backward_subsumed: 0
% 0.34/0.60 % res_forward_subsumption_resolution: 1
% 0.34/0.60 % res_backward_subsumption_resolution: 0
% 0.34/0.60 % res_clause_to_clause_subsumption: 421
% 0.34/0.60 % res_orphan_elimination: 0
% 0.34/0.60 % res_tautology_del: 24
% 0.34/0.60 % res_num_eq_res_simplified: 0
% 0.34/0.60 % res_num_sel_changes: 0
% 0.34/0.60 % res_moves_from_active_to_pass: 0
% 0.34/0.60
% 0.34/0.60 % Status Unsatisfiable
% 0.34/0.60 % SZS status Theorem
% 0.34/0.60 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------