%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT075+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 8 06:12:37 AM UTC 2026
% Result : Theorem 0.30s 0.56s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 37
% Syntax : Number of formulae : 344 ( 89 unt; 0 def)
% Number of atoms : 943 ( 256 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 1027 ( 428 ~; 496 |; 63 &)
% ( 16 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-4 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-4 aty)
% Number of variables : 749 ( 34 sgn 193 !; 6 ?)
% 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(v0,v600),
file('<stdin>',ord_v0_v600) ).
fof(c_0_22,axiom,
val(v600),
file('<stdin>',val_v600) ).
fof(c_0_23,axiom,
val(v0),
file('<stdin>',val_v0) ).
fof(c_0_24,axiom,
is_verdict(unknown),
file('<stdin>',unknown_is_verdict) ).
fof(c_0_25,axiom,
is_verdict(compatible),
file('<stdin>',compatible_is_verdict) ).
fof(c_0_26,axiom,
is_verdict(conflict),
file('<stdin>',conflict_is_verdict) ).
fof(c_0_27,axiom,
v0 != v600,
file('<stdin>',distinct) ).
fof(c_0_28,axiom,
compatible != unknown,
file('<stdin>',verdicts_distinct_cp_un) ).
fof(c_0_29,axiom,
conflict != unknown,
file('<stdin>',verdicts_distinct_cf_un) ).
fof(c_0_30,axiom,
conflict != compatible,
file('<stdin>',verdicts_distinct_cf_cp) ).
fof(c_0_31,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_32,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_33,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_34,axiom,
! [X1,X4,X5] :
( in_open(X1,X4,X5)
<=> ( less(X4,X1)
& less(X1,X5) ) ),
c_0_3 ).
fof(c_0_35,axiom,
! [X1,X4,X5] :
( in_ropen(X1,X4,X5)
<=> ( leq(X4,X1)
& less(X1,X5) ) ),
c_0_4 ).
fof(c_0_36,axiom,
! [X1,X4,X5] :
( in_lopen(X1,X4,X5)
<=> ( less(X4,X1)
& leq(X1,X5) ) ),
c_0_5 ).
fof(c_0_37,axiom,
! [X1,X4,X5] :
( in_closed(X1,X4,X5)
<=> ( leq(X4,X1)
& leq(X1,X5) ) ),
c_0_6 ).
fof(c_0_38,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
c_0_7 ).
fof(c_0_39,axiom,
! [X1,X2,X3] :
( ( less(X1,X2)
& leq(X2,X3) )
=> less(X1,X3) ),
c_0_8 ).
fof(c_0_40,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& less(X2,X3) )
=> less(X1,X3) ),
c_0_9 ).
fof(c_0_41,axiom,
! [X1,X2,X3] :
( ( less(X1,X2)
& less(X2,X3) )
=> less(X1,X3) ),
c_0_10 ).
fof(c_0_42,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_43,axiom,
! [X1,X2] :
( ( leq(X1,X2)
& leq(X2,X1) )
=> X1 = X2 ),
c_0_12 ).
fof(c_0_44,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> ( less(X1,X2)
| X1 = X2 ) ),
c_0_13 ).
fof(c_0_45,axiom,
! [X1,X2] :
( less(X1,X2)
=> leq(X1,X2) ),
c_0_14 ).
fof(c_0_46,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_47,axiom,
! [X11,X12] :
( ( is_verdict(X11)
& is_verdict(X12)
& X11 = compatible
& X12 = compatible )
=> box_verdict(X11,X12) = compatible ),
c_0_16 ).
fof(c_0_48,axiom,
! [X11,X12] :
( ( is_verdict(X11)
& is_verdict(X12)
& ( X11 = conflict
| X12 = conflict ) )
=> box_verdict(X11,X12) = conflict ),
c_0_17 ).
fof(c_0_49,axiom,
! [X1,X2] :
( less(X1,X2)
| X1 = X2
| less(X2,X1) ),
c_0_18 ).
fof(c_0_50,plain,
! [X1] : ~ less(X1,X1),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
fof(c_0_51,axiom,
! [X10] :
( is_verdict(X10)
=> ( X10 = conflict
| X10 = compatible
| X10 = unknown ) ),
c_0_20 ).
fof(c_0_52,axiom,
less(v0,v600),
c_0_21 ).
fof(c_0_53,axiom,
val(v600),
c_0_22 ).
fof(c_0_54,axiom,
val(v0),
c_0_23 ).
fof(c_0_55,axiom,
is_verdict(unknown),
c_0_24 ).
fof(c_0_56,axiom,
is_verdict(compatible),
c_0_25 ).
fof(c_0_57,axiom,
is_verdict(conflict),
c_0_26 ).
fof(c_0_58,axiom,
v0 != v600,
c_0_27 ).
fof(c_0_59,axiom,
compatible != unknown,
c_0_28 ).
fof(c_0_60,axiom,
conflict != unknown,
c_0_29 ).
fof(c_0_61,axiom,
conflict != compatible,
c_0_30 ).
fof(c_0_62,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_31])])])])])]) ).
fof(c_0_63,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_32])])])])])]) ).
fof(c_0_64,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_33])])])])])]) ).
fof(c_0_65,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_34])])])])]) ).
fof(c_0_66,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_35])])])])]) ).
fof(c_0_67,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_36])])])])]) ).
fof(c_0_68,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_37])])])])]) ).
fof(c_0_69,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_38])]) ).
fof(c_0_70,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_39])]) ).
fof(c_0_71,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_40])]) ).
fof(c_0_72,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_41])]) ).
fof(c_0_73,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_42])]) ).
fof(c_0_74,plain,
! [X3,X4] :
( ~ leq(X3,X4)
| ~ leq(X4,X3)
| X3 = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])]) ).
fof(c_0_75,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_44])])])])]) ).
fof(c_0_76,plain,
! [X3,X4] :
( ~ less(X3,X4)
| leq(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])]) ).
fof(c_0_77,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_46])])]) ).
fof(c_0_78,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_47])]) ).
fof(c_0_79,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_48])])]) ).
fof(c_0_80,plain,
! [X3,X4] :
( less(X3,X4)
| X3 = X4
| less(X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_49]) ).
fof(c_0_81,plain,
! [X2] : ~ less(X2,X2),
inference(variable_rename,[status(thm)],[c_0_50]) ).
fof(c_0_82,plain,
! [X11] :
( ~ is_verdict(X11)
| X11 = conflict
| X11 = compatible
| X11 = unknown ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_51])]) ).
fof(c_0_83,axiom,
less(v0,v600),
c_0_52 ).
fof(c_0_84,axiom,
val(v600),
c_0_53 ).
fof(c_0_85,axiom,
val(v0),
c_0_54 ).
fof(c_0_86,axiom,
is_verdict(unknown),
c_0_55 ).
fof(c_0_87,axiom,
is_verdict(compatible),
c_0_56 ).
fof(c_0_88,axiom,
is_verdict(conflict),
c_0_57 ).
fof(c_0_89,axiom,
v0 != v600,
c_0_58 ).
fof(c_0_90,axiom,
compatible != unknown,
c_0_59 ).
fof(c_0_91,axiom,
conflict != unknown,
c_0_60 ).
fof(c_0_92,axiom,
conflict != compatible,
c_0_61 ).
cnf(c_0_93,plain,
( axis_subsumes(X1,X2,X3,X4)
| ~ in_closed(esk3_4(X1,X2,X3,X4),X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_94,plain,
( in_closed(esk2_4(X1,X2,X3,X4),X1,X2)
| ~ axis_compatible(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_95,plain,
( in_closed(esk2_4(X1,X2,X3,X4),X3,X4)
| ~ axis_compatible(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_96,plain,
( axis_subsumes(X1,X2,X3,X4)
| in_closed(esk3_4(X1,X2,X3,X4),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_97,plain,
( axis_conflict(X1,X2,X3,X4)
| in_closed(esk1_4(X1,X2,X3,X4),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_98,plain,
( axis_conflict(X1,X2,X3,X4)
| in_closed(esk1_4(X1,X2,X3,X4),X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_99,plain,
( ~ in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5)
| ~ axis_conflict(X4,X5,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_100,plain,
( in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5)
| ~ axis_subsumes(X4,X5,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_101,plain,
( axis_compatible(X1,X2,X3,X4)
| ~ in_closed(X5,X3,X4)
| ~ in_closed(X5,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_102,plain,
( less(X2,X1)
| ~ in_open(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_103,plain,
( less(X1,X3)
| ~ in_open(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_104,plain,
( leq(X2,X1)
| ~ in_ropen(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_105,plain,
( less(X1,X3)
| ~ in_ropen(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_106,plain,
( less(X2,X1)
| ~ in_lopen(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_107,plain,
( leq(X1,X3)
| ~ in_lopen(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_108,plain,
( leq(X2,X1)
| ~ in_closed(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_109,plain,
( leq(X1,X3)
| ~ in_closed(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_110,plain,
( in_open(X1,X2,X3)
| ~ less(X1,X3)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_111,plain,
( in_ropen(X1,X2,X3)
| ~ less(X1,X3)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_112,plain,
( in_lopen(X1,X2,X3)
| ~ leq(X1,X3)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_113,plain,
( in_closed(X1,X2,X3)
| ~ leq(X1,X3)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_114,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_115,plain,
( less(X1,X2)
| ~ leq(X3,X2)
| ~ less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_116,plain,
( less(X1,X2)
| ~ less(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_117,plain,
( less(X1,X2)
| ~ less(X3,X2)
| ~ less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_118,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_73]) ).
cnf(c_0_119,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_120,plain,
( X1 = X2
| less(X1,X2)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_121,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_122,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_123,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_77]) ).
cnf(c_0_124,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_77]) ).
cnf(c_0_125,plain,
( box_verdict(X1,X2) = compatible
| X2 != compatible
| X1 != compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_126,plain,
( box_verdict(X1,X2) = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != conflict ),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_127,plain,
( box_verdict(X1,X2) = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X2 != conflict ),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_128,plain,
( less(X1,X2)
| X2 = X1
| less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_129,plain,
~ less(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_81]) ).
cnf(c_0_130,plain,
( leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_131,plain,
( X1 = unknown
| X1 = compatible
| X1 = conflict
| ~ is_verdict(X1) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_132,plain,
less(v0,v600),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_133,plain,
val(v600),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_134,plain,
val(v0),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_135,plain,
is_verdict(unknown),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_136,plain,
is_verdict(compatible),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_137,plain,
is_verdict(conflict),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_138,plain,
v0 != v600,
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_139,plain,
compatible != unknown,
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_140,plain,
conflict != unknown,
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_141,plain,
conflict != compatible,
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_142,plain,
( axis_subsumes(X1,X2,X3,X4)
| ~ in_closed(esk3_4(X1,X2,X3,X4),X3,X4) ),
c_0_93,
[final] ).
cnf(c_0_143,plain,
( in_closed(esk2_4(X1,X2,X3,X4),X1,X2)
| ~ axis_compatible(X1,X2,X3,X4) ),
c_0_94,
[final] ).
cnf(c_0_144,plain,
( in_closed(esk2_4(X1,X2,X3,X4),X3,X4)
| ~ axis_compatible(X1,X2,X3,X4) ),
c_0_95,
[final] ).
cnf(c_0_145,plain,
( axis_subsumes(X1,X2,X3,X4)
| in_closed(esk3_4(X1,X2,X3,X4),X1,X2) ),
c_0_96,
[final] ).
cnf(c_0_146,plain,
( axis_conflict(X1,X2,X3,X4)
| in_closed(esk1_4(X1,X2,X3,X4),X1,X2) ),
c_0_97,
[final] ).
cnf(c_0_147,plain,
( axis_conflict(X1,X2,X3,X4)
| in_closed(esk1_4(X1,X2,X3,X4),X3,X4) ),
c_0_98,
[final] ).
cnf(c_0_148,plain,
( ~ in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5)
| ~ axis_conflict(X4,X5,X2,X3) ),
c_0_99,
[final] ).
cnf(c_0_149,plain,
( in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5)
| ~ axis_subsumes(X4,X5,X2,X3) ),
c_0_100,
[final] ).
cnf(c_0_150,plain,
( axis_compatible(X1,X2,X3,X4)
| ~ in_closed(X5,X3,X4)
| ~ in_closed(X5,X1,X2) ),
c_0_101,
[final] ).
cnf(c_0_151,plain,
( less(X2,X1)
| ~ in_open(X1,X2,X3) ),
c_0_102,
[final] ).
cnf(c_0_152,plain,
( less(X1,X3)
| ~ in_open(X1,X2,X3) ),
c_0_103,
[final] ).
cnf(c_0_153,plain,
( leq(X2,X1)
| ~ in_ropen(X1,X2,X3) ),
c_0_104,
[final] ).
cnf(c_0_154,plain,
( less(X1,X3)
| ~ in_ropen(X1,X2,X3) ),
c_0_105,
[final] ).
cnf(c_0_155,plain,
( less(X2,X1)
| ~ in_lopen(X1,X2,X3) ),
c_0_106,
[final] ).
cnf(c_0_156,plain,
( leq(X1,X3)
| ~ in_lopen(X1,X2,X3) ),
c_0_107,
[final] ).
cnf(c_0_157,plain,
( leq(X2,X1)
| ~ in_closed(X1,X2,X3) ),
c_0_108,
[final] ).
cnf(c_0_158,plain,
( leq(X1,X3)
| ~ in_closed(X1,X2,X3) ),
c_0_109,
[final] ).
cnf(c_0_159,plain,
( in_open(X1,X2,X3)
| ~ less(X1,X3)
| ~ less(X2,X1) ),
c_0_110,
[final] ).
cnf(c_0_160,plain,
( in_ropen(X1,X2,X3)
| ~ less(X1,X3)
| ~ leq(X2,X1) ),
c_0_111,
[final] ).
cnf(c_0_161,plain,
( in_lopen(X1,X2,X3)
| ~ leq(X1,X3)
| ~ less(X2,X1) ),
c_0_112,
[final] ).
cnf(c_0_162,plain,
( in_closed(X1,X2,X3)
| ~ leq(X1,X3)
| ~ leq(X2,X1) ),
c_0_113,
[final] ).
cnf(c_0_163,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
c_0_114,
[final] ).
cnf(c_0_164,plain,
( less(X1,X2)
| ~ leq(X3,X2)
| ~ less(X1,X3) ),
c_0_115,
[final] ).
cnf(c_0_165,plain,
( less(X1,X2)
| ~ less(X3,X2)
| ~ leq(X1,X3) ),
c_0_116,
[final] ).
cnf(c_0_166,plain,
( less(X1,X2)
| ~ less(X3,X2)
| ~ less(X1,X3) ),
c_0_117,
[final] ).
cnf(c_0_167,plain,
( box_verdict(X1,X2) = unknown
| box_verdict(X1,X2) = compatible
| box_verdict(X1,X2) = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
c_0_118,
[final] ).
cnf(c_0_168,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
c_0_119,
[final] ).
cnf(c_0_169,plain,
( X1 = X2
| less(X1,X2)
| ~ leq(X1,X2) ),
c_0_120,
[final] ).
cnf(c_0_170,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
c_0_121,
[final] ).
cnf(c_0_171,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
c_0_122,
[final] ).
cnf(c_0_172,plain,
( box_verdict(X1,X2) = unknown
| X2 = conflict
| X1 = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != unknown ),
c_0_123,
[final] ).
cnf(c_0_173,plain,
( box_verdict(X1,X2) = unknown
| X2 = conflict
| X1 = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X2 != unknown ),
c_0_124,
[final] ).
cnf(c_0_174,plain,
( box_verdict(X1,X2) = compatible
| X2 != compatible
| X1 != compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
c_0_125,
[final] ).
cnf(c_0_175,plain,
( box_verdict(X1,X2) = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != conflict ),
c_0_126,
[final] ).
cnf(c_0_176,plain,
( box_verdict(X1,X2) = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X2 != conflict ),
c_0_127,
[final] ).
cnf(c_0_177,plain,
( less(X1,X2)
| X2 = X1
| less(X2,X1) ),
c_0_128,
[final] ).
cnf(c_0_178,plain,
~ less(X1,X1),
c_0_129,
[final] ).
cnf(c_0_179,plain,
( leq(X1,X2)
| X1 != X2 ),
c_0_130,
[final] ).
cnf(c_0_180,plain,
( X1 = unknown
| X1 = compatible
| X1 = conflict
| ~ is_verdict(X1) ),
c_0_131,
[final] ).
cnf(c_0_181,plain,
less(v0,v600),
c_0_132,
[final] ).
cnf(c_0_182,plain,
val(v600),
c_0_133,
[final] ).
cnf(c_0_183,plain,
val(v0),
c_0_134,
[final] ).
cnf(c_0_184,plain,
is_verdict(unknown),
c_0_135,
[final] ).
cnf(c_0_185,plain,
is_verdict(compatible),
c_0_136,
[final] ).
cnf(c_0_186,plain,
is_verdict(conflict),
c_0_137,
[final] ).
cnf(c_0_187,plain,
v600 != v0,
c_0_138,
[final] ).
cnf(c_0_188,plain,
unknown != compatible,
c_0_139,
[final] ).
cnf(c_0_189,plain,
unknown != conflict,
c_0_140,
[final] ).
cnf(c_0_190,plain,
compatible != conflict,
c_0_141,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_142_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_142]) ).
cnf(c_0_142_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_142]) ).
cnf(c_0_143_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_143]) ).
cnf(c_0_143_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_143]) ).
cnf(c_0_144_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_144]) ).
cnf(c_0_144_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_144]) ).
cnf(c_0_145_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_145]) ).
cnf(c_0_145_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_145]) ).
cnf(c_0_146_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_146]) ).
cnf(c_0_146_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_146]) ).
cnf(c_0_147_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_147]) ).
cnf(c_0_147_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_147]) ).
cnf(c_0_148_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_148]) ).
cnf(c_0_148_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_148]) ).
cnf(c_0_148_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_148]) ).
cnf(c_0_149_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_149]) ).
cnf(c_0_149_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_149]) ).
cnf(c_0_149_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_149]) ).
cnf(c_0_150_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_150]) ).
cnf(c_0_150_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_150]) ).
cnf(c_0_150_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_150]) ).
cnf(c_0_151_0,axiom,
( less(X2,X1)
| ~ in_open(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_151]) ).
cnf(c_0_151_1,axiom,
( ~ in_open(X1,X2,X3)
| less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_151]) ).
cnf(c_0_152_0,axiom,
( less(X1,X3)
| ~ in_open(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_152]) ).
cnf(c_0_152_1,axiom,
( ~ in_open(X1,X2,X3)
| less(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_152]) ).
cnf(c_0_153_0,axiom,
( leq(X2,X1)
| ~ in_ropen(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_153]) ).
cnf(c_0_153_1,axiom,
( ~ in_ropen(X1,X2,X3)
| leq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_153]) ).
cnf(c_0_154_0,axiom,
( less(X1,X3)
| ~ in_ropen(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_154]) ).
cnf(c_0_154_1,axiom,
( ~ in_ropen(X1,X2,X3)
| less(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_154]) ).
cnf(c_0_155_0,axiom,
( less(X2,X1)
| ~ in_lopen(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_155]) ).
cnf(c_0_155_1,axiom,
( ~ in_lopen(X1,X2,X3)
| less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_155]) ).
cnf(c_0_156_0,axiom,
( leq(X1,X3)
| ~ in_lopen(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_156]) ).
cnf(c_0_156_1,axiom,
( ~ in_lopen(X1,X2,X3)
| leq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_156]) ).
cnf(c_0_157_0,axiom,
( leq(X2,X1)
| ~ in_closed(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_157]) ).
cnf(c_0_157_1,axiom,
( ~ in_closed(X1,X2,X3)
| leq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_157]) ).
cnf(c_0_158_0,axiom,
( leq(X1,X3)
| ~ in_closed(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_158]) ).
cnf(c_0_158_1,axiom,
( ~ in_closed(X1,X2,X3)
| leq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_158]) ).
cnf(c_0_159_0,axiom,
( in_open(X1,X2,X3)
| ~ less(X1,X3)
| ~ less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_159]) ).
cnf(c_0_159_1,axiom,
( ~ less(X1,X3)
| in_open(X1,X2,X3)
| ~ less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_159]) ).
cnf(c_0_159_2,axiom,
( ~ less(X2,X1)
| ~ less(X1,X3)
| in_open(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_159]) ).
cnf(c_0_160_0,axiom,
( in_ropen(X1,X2,X3)
| ~ less(X1,X3)
| ~ leq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_160]) ).
cnf(c_0_160_1,axiom,
( ~ less(X1,X3)
| in_ropen(X1,X2,X3)
| ~ leq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_160]) ).
cnf(c_0_160_2,axiom,
( ~ leq(X2,X1)
| ~ less(X1,X3)
| in_ropen(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_160]) ).
cnf(c_0_161_0,axiom,
( in_lopen(X1,X2,X3)
| ~ leq(X1,X3)
| ~ less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_161]) ).
cnf(c_0_161_1,axiom,
( ~ leq(X1,X3)
| in_lopen(X1,X2,X3)
| ~ less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_161]) ).
cnf(c_0_161_2,axiom,
( ~ less(X2,X1)
| ~ leq(X1,X3)
| in_lopen(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_161]) ).
cnf(c_0_162_0,axiom,
( in_closed(X1,X2,X3)
| ~ leq(X1,X3)
| ~ leq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_162]) ).
cnf(c_0_162_1,axiom,
( ~ leq(X1,X3)
| in_closed(X1,X2,X3)
| ~ leq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_162]) ).
cnf(c_0_162_2,axiom,
( ~ leq(X2,X1)
| ~ leq(X1,X3)
| in_closed(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_162]) ).
cnf(c_0_163_0,axiom,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_163]) ).
cnf(c_0_163_1,axiom,
( ~ leq(X3,X2)
| leq(X1,X2)
| ~ leq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_163]) ).
cnf(c_0_163_2,axiom,
( ~ leq(X1,X3)
| ~ leq(X3,X2)
| leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_163]) ).
cnf(c_0_164_0,axiom,
( less(X1,X2)
| ~ leq(X3,X2)
| ~ less(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_164]) ).
cnf(c_0_164_1,axiom,
( ~ leq(X3,X2)
| less(X1,X2)
| ~ less(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_164]) ).
cnf(c_0_164_2,axiom,
( ~ less(X1,X3)
| ~ leq(X3,X2)
| less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_164]) ).
cnf(c_0_165_0,axiom,
( less(X1,X2)
| ~ less(X3,X2)
| ~ leq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_165]) ).
cnf(c_0_165_1,axiom,
( ~ less(X3,X2)
| less(X1,X2)
| ~ leq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_165]) ).
cnf(c_0_165_2,axiom,
( ~ leq(X1,X3)
| ~ less(X3,X2)
| less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_165]) ).
cnf(c_0_166_0,axiom,
( less(X1,X2)
| ~ less(X3,X2)
| ~ less(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_166]) ).
cnf(c_0_166_1,axiom,
( ~ less(X3,X2)
| less(X1,X2)
| ~ less(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_166]) ).
cnf(c_0_166_2,axiom,
( ~ less(X1,X3)
| ~ less(X3,X2)
| less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_166]) ).
cnf(c_0_167_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_167]) ).
cnf(c_0_167_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_167]) ).
cnf(c_0_167_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_167]) ).
cnf(c_0_167_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_167]) ).
cnf(c_0_167_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_167]) ).
cnf(c_0_168_0,axiom,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_168]) ).
cnf(c_0_168_1,axiom,
( ~ leq(X2,X1)
| X1 = X2
| ~ leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_168]) ).
cnf(c_0_168_2,axiom,
( ~ leq(X1,X2)
| ~ leq(X2,X1)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_168]) ).
cnf(c_0_169_0,axiom,
( X1 = X2
| less(X1,X2)
| ~ leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_169]) ).
cnf(c_0_169_1,axiom,
( less(X1,X2)
| X1 = X2
| ~ leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_169]) ).
cnf(c_0_169_2,axiom,
( ~ leq(X1,X2)
| less(X1,X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_169]) ).
cnf(c_0_170_0,axiom,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_170]) ).
cnf(c_0_170_1,axiom,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_170]) ).
cnf(c_0_171_0,axiom,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_171]) ).
cnf(c_0_171_1,axiom,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_171]) ).
cnf(c_0_172_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_172]) ).
cnf(c_0_172_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_172]) ).
cnf(c_0_172_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_172]) ).
cnf(c_0_172_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_172]) ).
cnf(c_0_172_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_172]) ).
cnf(c_0_172_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_172]) ).
cnf(c_0_173_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_173]) ).
cnf(c_0_173_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_173]) ).
cnf(c_0_173_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_173]) ).
cnf(c_0_173_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_173]) ).
cnf(c_0_173_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_173]) ).
cnf(c_0_173_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_173]) ).
cnf(c_0_174_0,axiom,
( box_verdict(X1,X2) = compatible
| X2 != compatible
| X1 != compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_174]) ).
cnf(c_0_174_1,axiom,
( X2 != compatible
| box_verdict(X1,X2) = compatible
| X1 != compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_174]) ).
cnf(c_0_174_2,axiom,
( X1 != compatible
| X2 != compatible
| box_verdict(X1,X2) = compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_174]) ).
cnf(c_0_174_3,axiom,
( ~ is_verdict(X2)
| X1 != compatible
| X2 != compatible
| box_verdict(X1,X2) = compatible
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_174]) ).
cnf(c_0_174_4,axiom,
( ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != compatible
| X2 != compatible
| box_verdict(X1,X2) = compatible ),
inference(literals_permutation,[status(thm)],[c_0_174]) ).
cnf(c_0_175_0,axiom,
( box_verdict(X1,X2) = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X1 != conflict ),
inference(literals_permutation,[status(thm)],[c_0_175]) ).
cnf(c_0_175_1,axiom,
( ~ is_verdict(X1)
| box_verdict(X1,X2) = conflict
| ~ is_verdict(X2)
| X1 != conflict ),
inference(literals_permutation,[status(thm)],[c_0_175]) ).
cnf(c_0_175_2,axiom,
( ~ is_verdict(X2)
| ~ is_verdict(X1)
| box_verdict(X1,X2) = conflict
| X1 != conflict ),
inference(literals_permutation,[status(thm)],[c_0_175]) ).
cnf(c_0_175_3,axiom,
( X1 != conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| box_verdict(X1,X2) = conflict ),
inference(literals_permutation,[status(thm)],[c_0_175]) ).
cnf(c_0_176_0,axiom,
( box_verdict(X1,X2) = conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2)
| X2 != conflict ),
inference(literals_permutation,[status(thm)],[c_0_176]) ).
cnf(c_0_176_1,axiom,
( ~ is_verdict(X1)
| box_verdict(X1,X2) = conflict
| ~ is_verdict(X2)
| X2 != conflict ),
inference(literals_permutation,[status(thm)],[c_0_176]) ).
cnf(c_0_176_2,axiom,
( ~ is_verdict(X2)
| ~ is_verdict(X1)
| box_verdict(X1,X2) = conflict
| X2 != conflict ),
inference(literals_permutation,[status(thm)],[c_0_176]) ).
cnf(c_0_176_3,axiom,
( X2 != conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| box_verdict(X1,X2) = conflict ),
inference(literals_permutation,[status(thm)],[c_0_176]) ).
cnf(c_0_177_0,axiom,
( less(X1,X2)
| X2 = X1
| less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_177]) ).
cnf(c_0_177_1,axiom,
( X2 = X1
| less(X1,X2)
| less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_177]) ).
cnf(c_0_177_2,axiom,
( less(X2,X1)
| X2 = X1
| less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_177]) ).
cnf(c_0_179_0,axiom,
( leq(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_179]) ).
cnf(c_0_179_1,axiom,
( X1 != X2
| leq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_179]) ).
cnf(c_0_180_0,axiom,
( X1 = unknown
| X1 = compatible
| X1 = conflict
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_180]) ).
cnf(c_0_180_1,axiom,
( X1 = compatible
| X1 = unknown
| X1 = conflict
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_180]) ).
cnf(c_0_180_2,axiom,
( X1 = conflict
| X1 = compatible
| X1 = unknown
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_180]) ).
cnf(c_0_180_3,axiom,
( ~ is_verdict(X1)
| X1 = conflict
| X1 = compatible
| X1 = unknown ),
inference(literals_permutation,[status(thm)],[c_0_180]) ).
cnf(c_0_178_0,axiom,
~ less(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_178]) ).
cnf(c_0_187_0,axiom,
v600 != v0,
inference(literals_permutation,[status(thm)],[c_0_187]) ).
cnf(c_0_188_0,axiom,
unknown != compatible,
inference(literals_permutation,[status(thm)],[c_0_188]) ).
cnf(c_0_189_0,axiom,
unknown != conflict,
inference(literals_permutation,[status(thm)],[c_0_189]) ).
cnf(c_0_190_0,axiom,
compatible != conflict,
inference(literals_permutation,[status(thm)],[c_0_190]) ).
cnf(c_0_181_0,axiom,
less(v0,v600),
inference(literals_permutation,[status(thm)],[c_0_181]) ).
cnf(c_0_182_0,axiom,
val(v600),
inference(literals_permutation,[status(thm)],[c_0_182]) ).
cnf(c_0_183_0,axiom,
val(v0),
inference(literals_permutation,[status(thm)],[c_0_183]) ).
cnf(c_0_184_0,axiom,
is_verdict(unknown),
inference(literals_permutation,[status(thm)],[c_0_184]) ).
cnf(c_0_185_0,axiom,
is_verdict(compatible),
inference(literals_permutation,[status(thm)],[c_0_185]) ).
cnf(c_0_186_0,axiom,
is_verdict(conflict),
inference(literals_permutation,[status(thm)],[c_0_186]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
~ ? [X1] :
( in_open(X1,v0,v600)
& leq(v600,X1) ),
file('<stdin>',odrl302) ).
fof(c_0_1_002,negated_conjecture,
~ ~ ? [X1] :
( in_open(X1,v0,v600)
& leq(v600,X1) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
( in_open(esk1_0,v0,v600)
& leq(v600,esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
cnf(c_0_3_004,negated_conjecture,
in_open(esk1_0,v0,v600),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
leq(v600,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
in_open(esk1_0,v0,v600),
c_0_3,
[final] ).
cnf(c_0_6_007,negated_conjecture,
leq(v600,esk1_0),
c_0_4,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_122,negated_conjecture,
leq(v600,sk2_esk1_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p',c_0_6) ).
cnf(c_151,negated_conjecture,
leq(v600,sk2_esk1_0),
inference(copy,[status(esa)],[c_122]) ).
cnf(c_158,negated_conjecture,
leq(v600,sk2_esk1_0),
inference(copy,[status(esa)],[c_151]) ).
cnf(c_159,negated_conjecture,
leq(v600,sk2_esk1_0),
inference(copy,[status(esa)],[c_158]) ).
cnf(c_162,negated_conjecture,
leq(v600,sk2_esk1_0),
inference(copy,[status(esa)],[c_159]) ).
cnf(c_530,plain,
leq(v600,sk2_esk1_0),
inference(copy,[status(esa)],[c_162]) ).
cnf(c_67,plain,
( ~ less(X0,X1)
| less(X0,X2)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p',c_0_164_1) ).
cnf(c_420,plain,
( ~ less(X0,X1)
| less(X0,X2)
| ~ leq(X1,X2) ),
inference(copy,[status(esa)],[c_67]) ).
cnf(c_550,plain,
( ~ less(X0,v600)
| less(X0,sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_530,c_420]) ).
cnf(c_551,plain,
( ~ less(X0,v600)
| less(X0,sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_550]) ).
cnf(c_10,plain,
~ less(X0,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p',c_0_178_0) ).
cnf(c_306,plain,
~ less(X0,X0),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_620,plain,
~ less(sk2_esk1_0,v600),
inference(resolution,[status(thm)],[c_551,c_306]) ).
cnf(c_621,plain,
~ less(sk2_esk1_0,v600),
inference(rewriting,[status(thm)],[c_620]) ).
cnf(c_121,negated_conjecture,
in_open(sk2_esk1_0,v0,v600),
file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p',c_0_5) ).
cnf(c_149,negated_conjecture,
in_open(sk2_esk1_0,v0,v600),
inference(copy,[status(esa)],[c_121]) ).
cnf(c_157,negated_conjecture,
in_open(sk2_esk1_0,v0,v600),
inference(copy,[status(esa)],[c_149]) ).
cnf(c_160,negated_conjecture,
in_open(sk2_esk1_0,v0,v600),
inference(copy,[status(esa)],[c_157]) ).
cnf(c_161,negated_conjecture,
in_open(sk2_esk1_0,v0,v600),
inference(copy,[status(esa)],[c_160]) ).
cnf(c_528,negated_conjecture,
in_open(sk2_esk1_0,v0,v600),
inference(copy,[status(esa)],[c_161]) ).
cnf(c_96,plain,
( less(X0,X1)
| ~ in_open(X0,X2,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p',c_0_152_1) ).
cnf(c_478,plain,
( less(X0,X1)
| ~ in_open(X0,X2,X1) ),
inference(copy,[status(esa)],[c_96]) ).
cnf(c_556,plain,
less(sk2_esk1_0,v600),
inference(resolution,[status(thm)],[c_528,c_478]) ).
cnf(c_557,plain,
less(sk2_esk1_0,v600),
inference(rewriting,[status(thm)],[c_556]) ).
cnf(c_639,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_621,c_557]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT075+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : iprover_modulo %s %d
% 0.09/0.36 % Computer : n026.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 7 14:13:42 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.15/0.38 % Running in mono-core mode
% 0.15/0.44 % Orienting using strategy Equiv(ClausalAll)
% 0.15/0.44 % FOF problem with conjecture
% 0.15/0.44 % 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_0256d7.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_2414b7 | grep -v "SZS"
% 0.20/0.47
% 0.20/0.47 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.47
% 0.20/0.47 %
% 0.20/0.47 % ------ iProver source info
% 0.20/0.47
% 0.20/0.47 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.47 % git: non_committed_changes: true
% 0.20/0.47 % git: last_make_outside_of_git: true
% 0.20/0.47
% 0.20/0.47 %
% 0.20/0.47 % ------ Input Options
% 0.20/0.47
% 0.20/0.47 % --out_options all
% 0.20/0.47 % --tptp_safe_out true
% 0.20/0.47 % --problem_path ""
% 0.20/0.47 % --include_path ""
% 0.20/0.47 % --clausifier .//eprover
% 0.20/0.47 % --clausifier_options --tstp-format
% 0.20/0.47 % --stdin false
% 0.20/0.47 % --dbg_backtrace false
% 0.20/0.47 % --dbg_dump_prop_clauses false
% 0.20/0.47 % --dbg_dump_prop_clauses_file -
% 0.20/0.47 % --dbg_out_stat false
% 0.20/0.47
% 0.20/0.47 % ------ General Options
% 0.20/0.47
% 0.20/0.47 % --fof false
% 0.20/0.47 % --time_out_real 150.
% 0.20/0.47 % --time_out_prep_mult 0.2
% 0.20/0.47 % --time_out_virtual -1.
% 0.20/0.47 % --schedule none
% 0.20/0.47 % --ground_splitting input
% 0.20/0.47 % --splitting_nvd 16
% 0.20/0.47 % --non_eq_to_eq false
% 0.20/0.47 % --prep_gs_sim true
% 0.20/0.47 % --prep_unflatten false
% 0.20/0.47 % --prep_res_sim true
% 0.20/0.47 % --prep_upred true
% 0.20/0.47 % --res_sim_input true
% 0.20/0.47 % --clause_weak_htbl true
% 0.20/0.47 % --gc_record_bc_elim false
% 0.20/0.47 % --symbol_type_check false
% 0.20/0.47 % --clausify_out false
% 0.20/0.47 % --large_theory_mode false
% 0.20/0.47 % --prep_sem_filter none
% 0.20/0.47 % --prep_sem_filter_out false
% 0.20/0.47 % --preprocessed_out false
% 0.20/0.47 % --sub_typing false
% 0.20/0.47 % --brand_transform false
% 0.20/0.47 % --pure_diseq_elim true
% 0.20/0.47 % --min_unsat_core false
% 0.20/0.47 % --pred_elim true
% 0.20/0.47 % --add_important_lit false
% 0.20/0.47 % --soft_assumptions false
% 0.20/0.47 % --reset_solvers false
% 0.20/0.47 % --bc_imp_inh []
% 0.20/0.47 % --conj_cone_tolerance 1.5
% 0.20/0.47 % --prolific_symb_bound 500
% 0.20/0.47 % --lt_threshold 2000
% 0.20/0.47
% 0.20/0.47 % ------ SAT Options
% 0.20/0.47
% 0.20/0.47 % --sat_mode false
% 0.20/0.47 % --sat_fm_restart_options ""
% 0.20/0.47 % --sat_gr_def false
% 0.20/0.47 % --sat_epr_types true
% 0.20/0.47 % --sat_non_cyclic_types false
% 0.20/0.47 % --sat_finite_models false
% 0.20/0.47 % --sat_fm_lemmas false
% 0.20/0.47 % --sat_fm_prep false
% 0.20/0.47 % --sat_fm_uc_incr true
% 0.20/0.47 % --sat_out_model small
% 0.20/0.47 % --sat_out_clauses false
% 0.20/0.47
% 0.20/0.47 % ------ QBF Options
% 0.20/0.47
% 0.20/0.47 % --qbf_mode false
% 0.20/0.47 % --qbf_elim_univ true
% 0.20/0.47 % --qbf_sk_in true
% 0.20/0.47 % --qbf_pred_elim true
% 0.20/0.47 % --qbf_split 32
% 0.20/0.47
% 0.20/0.47 % ------ BMC1 Options
% 0.20/0.47
% 0.20/0.47 % --bmc1_incremental false
% 0.20/0.47 % --bmc1_axioms reachable_all
% 0.20/0.47 % --bmc1_min_bound 0
% 0.20/0.47 % --bmc1_max_bound -1
% 0.20/0.47 % --bmc1_max_bound_default -1
% 0.20/0.47 % --bmc1_symbol_reachability true
% 0.20/0.47 % --bmc1_property_lemmas false
% 0.20/0.47 % --bmc1_k_induction false
% 0.20/0.47 % --bmc1_non_equiv_states false
% 0.20/0.47 % --bmc1_deadlock false
% 0.20/0.47 % --bmc1_ucm false
% 0.20/0.47 % --bmc1_add_unsat_core none
% 0.20/0.47 % --bmc1_unsat_core_children false
% 0.20/0.47 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.47 % --bmc1_out_stat full
% 0.20/0.47 % --bmc1_ground_init false
% 0.20/0.47 % --bmc1_pre_inst_next_state false
% 0.20/0.47 % --bmc1_pre_inst_state false
% 0.20/0.47 % --bmc1_pre_inst_reach_state false
% 0.20/0.47 % --bmc1_out_unsat_core false
% 0.20/0.47 % --bmc1_aig_witness_out false
% 0.20/0.47 % --bmc1_verbose false
% 0.20/0.47 % --bmc1_dump_clauses_tptp false
% 0.20/0.48 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.48 % --bmc1_dump_file -
% 0.20/0.48 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.48 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.48 % --bmc1_ucm_extend_mode 1
% 0.20/0.48 % --bmc1_ucm_init_mode 2
% 0.20/0.48 % --bmc1_ucm_cone_mode none
% 0.20/0.48 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.48 % --bmc1_ucm_relax_model 4
% 0.20/0.48 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.48 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.48 % --bmc1_ucm_layered_model none
% 0.20/0.48 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.48
% 0.20/0.48 % ------ AIG Options
% 0.20/0.48
% 0.20/0.48 % --aig_mode false
% 0.20/0.48
% 0.20/0.48 % ------ Instantiation Options
% 0.20/0.48
% 0.20/0.48 % --instantiation_flag true
% 0.20/0.48 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.48 % --inst_solver_per_active 750
% 0.20/0.48 % --inst_solver_calls_frac 0.5
% 0.20/0.48 % --inst_passive_queue_type priority_queues
% 0.20/0.48 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.48 % --inst_passive_queues_freq [25;2]
% 0.20/0.48 % --inst_dismatching true
% 0.20/0.48 % --inst_eager_unprocessed_to_passive true
% 0.20/0.48 % --inst_prop_sim_given true
% 0.20/0.48 % --inst_prop_sim_new false
% 0.20/0.48 % --inst_orphan_elimination true
% 0.20/0.48 % --inst_learning_loop_flag true
% 0.20/0.48 % --inst_learning_start 3000
% 0.20/0.48 % --inst_learning_factor 2
% 0.20/0.48 % --inst_start_prop_sim_after_learn 3
% 0.20/0.48 % --inst_sel_renew solver
% 0.20/0.48 % --inst_lit_activity_flag true
% 0.20/0.48 % --inst_out_proof true
% 0.20/0.48
% 0.20/0.48 % ------ Resolution Options
% 0.20/0.48
% 0.20/0.48 % --resolution_flag true
% 0.20/0.48 % --res_lit_sel kbo_max
% 0.20/0.48 % --res_to_prop_solver none
% 0.20/0.48 % --res_prop_simpl_new false
% 0.20/0.48 % --res_prop_simpl_given false
% 0.20/0.48 % --res_passive_queue_type priority_queues
% 0.20/0.48 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.48 % --res_passive_queues_freq [15;5]
% 0.20/0.48 % --res_forward_subs full
% 0.20/0.48 % --res_backward_subs full
% 0.20/0.48 % --res_forward_subs_resolution true
% 0.20/0.48 % --res_backward_subs_resolution true
% 0.20/0.48 % --res_orphan_elimination false
% 0.20/0.48 % --res_time_limit 1000.
% 0.20/0.48 % --res_out_proof true
% 0.20/0.48 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_0256d7.s
% 0.20/0.48 % --modulo true
% 0.20/0.48
% 0.20/0.48 % ------ Combination Options
% 0.20/0.48
% 0.20/0.48 % --comb_res_mult 1000
% 0.20/0.48 % --comb_inst_mult 300
% 0.20/0.48 % ------
% 0.20/0.48
% 0.20/0.48 % ------ Parsing...% successful
% 0.20/0.48
% 0.20/0.48 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.48
% 0.20/0.48 % ------ Proving...
% 0.20/0.48 % ------ Problem Properties
% 0.20/0.48
% 0.20/0.48 %
% 0.20/0.48 % EPR false
% 0.20/0.48 % Horn false
% 0.20/0.48 % Has equality true
% 0.20/0.48
% 0.20/0.48 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 % % ------ Current options:
% 0.20/0.48
% 0.20/0.48 % ------ Input Options
% 0.20/0.48
% 0.20/0.48 % --out_options all
% 0.20/0.48 % --tptp_safe_out true
% 0.20/0.48 % --problem_path ""
% 0.20/0.48 % --include_path ""
% 0.20/0.48 % --clausifier .//eprover
% 0.20/0.48 % --clausifier_options --tstp-format
% 0.20/0.48 % --stdin false
% 0.20/0.48 % --dbg_backtrace false
% 0.20/0.48 % --dbg_dump_prop_clauses false
% 0.20/0.48 % --dbg_dump_prop_clauses_file -
% 0.20/0.48 % --dbg_out_stat false
% 0.20/0.48
% 0.20/0.48 % ------ General Options
% 0.20/0.48
% 0.20/0.48 % --fof false
% 0.20/0.48 % --time_out_real 150.
% 0.20/0.48 % --time_out_prep_mult 0.2
% 0.20/0.48 % --time_out_virtual -1.
% 0.20/0.48 % --schedule none
% 0.20/0.48 % --ground_splitting input
% 0.20/0.48 % --splitting_nvd 16
% 0.20/0.48 % --non_eq_to_eq false
% 0.20/0.48 % --prep_gs_sim true
% 0.20/0.48 % --prep_unflatten false
% 0.20/0.48 % --prep_res_sim true
% 0.20/0.48 % --prep_upred true
% 0.20/0.48 % --res_sim_input true
% 0.20/0.48 % --clause_weak_htbl true
% 0.20/0.48 % --gc_record_bc_elim false
% 0.20/0.48 % --symbol_type_check false
% 0.20/0.48 % --clausify_out false
% 0.20/0.48 % --large_theory_mode false
% 0.20/0.48 % --prep_sem_filter none
% 0.20/0.48 % --prep_sem_filter_out false
% 0.20/0.48 % --preprocessed_out false
% 0.20/0.48 % --sub_typing false
% 0.20/0.48 % --brand_transform false
% 0.20/0.48 % --pure_diseq_elim true
% 0.20/0.48 % --min_unsat_core false
% 0.20/0.48 % --pred_elim true
% 0.20/0.48 % --add_important_lit false
% 0.20/0.48 % --soft_assumptions false
% 0.20/0.48 % --reset_solvers false
% 0.20/0.48 % --bc_imp_inh []
% 0.20/0.48 % --conj_cone_tolerance 1.5
% 0.20/0.48 % --prolific_symb_bound 500
% 0.20/0.48 % --lt_threshold 2000
% 0.20/0.48
% 0.20/0.48 % ------ SAT Options
% 0.20/0.48
% 0.20/0.48 % --sat_mode false
% 0.20/0.48 % --sat_fm_restart_options ""
% 0.20/0.48 % --sat_gr_def false
% 0.20/0.48 % --sat_epr_types true
% 0.20/0.48 % --sat_non_cyclic_types false
% 0.20/0.48 % --sat_finite_models false
% 0.20/0.48 % --sat_fm_lemmas false
% 0.20/0.48 % --sat_fm_prep false
% 0.20/0.48 % --sat_fm_uc_incr true
% 0.20/0.48 % --sat_out_model small
% 0.20/0.48 % --sat_out_clauses false
% 0.20/0.48
% 0.20/0.48 % ------ QBF Options
% 0.20/0.48
% 0.20/0.48 % --qbf_mode false
% 0.20/0.48 % --qbf_elim_univ true
% 0.20/0.48 % --qbf_sk_in true
% 0.20/0.48 % --qbf_pred_elim true
% 0.20/0.48 % --qbf_split 32
% 0.20/0.48
% 0.20/0.48 % ------ BMC1 Options
% 0.20/0.48
% 0.20/0.48 % --bmc1_incremental false
% 0.20/0.48 % --bmc1_axioms reachable_all
% 0.20/0.48 % --bmc1_min_bound 0
% 0.20/0.48 % --bmc1_max_bound -1
% 0.20/0.48 % --bmc1_max_bound_default -1
% 0.20/0.48 % --bmc1_symbol_reachability true
% 0.20/0.48 % --bmc1_property_lemmas false
% 0.20/0.48 % --bmc1_k_induction false
% 0.20/0.48 % --bmc1_non_equiv_states false
% 0.20/0.48 % --bmc1_deadlock false
% 0.20/0.48 % --bmc1_ucm false
% 0.20/0.48 % --bmc1_add_unsat_core none
% 0.20/0.48 % --bmc1_unsat_core_children false
% 0.20/0.48 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.48 % --bmc1_out_stat full
% 0.20/0.48 % --bmc1_ground_init false
% 0.20/0.48 % --bmc1_pre_inst_next_state false
% 0.20/0.48 % --bmc1_pre_inst_state false
% 0.20/0.48 % --bmc1_pre_inst_reach_state false
% 0.20/0.48 % --bmc1_out_unsat_core false
% 0.20/0.48 % --bmc1_aig_witness_out false
% 0.20/0.48 % --bmc1_verbose false
% 0.20/0.48 % --bmc1_dump_clauses_tptp false
% 0.20/0.48 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.48 % --bmc1_dump_file -
% 0.20/0.48 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.48 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.48 % --bmc1_ucm_extend_mode 1
% 0.20/0.48 % --bmc1_ucm_init_mode 2
% 0.20/0.48 % --bmc1_ucm_cone_mode none
% 0.20/0.48 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.48 % --bmc1_ucm_relax_model 4
% 0.20/0.48 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.48 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.48 % --bmc1_ucm_layered_model none
% 0.20/0.48 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.48
% 0.20/0.48 % ------ AIG Options
% 0.20/0.48
% 0.20/0.48 % --aig_mode false
% 0.20/0.48
% 0.20/0.48 % ------ Instantiation Options
% 0.20/0.48
% 0.20/0.48 % --instantiation_flag true
% 0.20/0.48 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.48 % --inst_solver_per_active 750
% 0.20/0.48 % --inst_solver_calls_frac 0.5
% 0.20/0.48 % --inst_passive_queue_type priority_queues
% 0.20/0.48 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.48 % --inst_passive_queues_freq [25;2]
% 0.20/0.48 % --inst_dismatching true
% 0.20/0.48 % --inst_eager_unprocessed_to_passive true
% 0.20/0.48 % --inst_prop_sim_given true
% 0.20/0.48 % --inst_prop_sim_new false
% 0.20/0.48 % --inst_orphan_elimination true
% 0.20/0.48 % --inst_learning_loop_flag true
% 0.20/0.48 % --inst_learning_start 3000
% 0.20/0.48 % --inst_learning_factor 2
% 0.20/0.48 % --inst_start_prop_sim_after_learn 3
% 0.20/0.48 % --inst_sel_renew solver
% 0.20/0.48 % --inst_lit_activity_flag true
% 0.20/0.48 % --inst_out_proof true
% 0.20/0.48
% 0.20/0.48 % ------ Resolution Options
% 0.20/0.48
% 0.20/0.48 % --resolution_flag true
% 0.20/0.48 % --res_lit_sel kbo_max
% 0.20/0.48 % --res_to_prop_solver none
% 0.20/0.48 % --res_prop_simpl_new false
% 0.20/0.48 % --res_prop_simpl_given false
% 0.20/0.48 % --res_passive_queue_type priority_queues
% 0.20/0.48 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.48 % --res_passive_queues_freq [15;5]
% 0.20/0.48 % --res_forward_subs full
% 0.20/0.48 % --res_backward_subs full
% 0.20/0.48 % --res_forward_subs_resolution true
% 0.20/0.48 % --res_backward_subs_resolution true
% 0.20/0.48 % --res_orphan_elimination false
% 0.20/0.48 % --res_time_limit 1000.
% 0.20/0.48 % --res_out_proof true
% 0.20/0.48 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_0256d7.s
% 0.20/0.48 % --modulo true
% 0.20/0.48
% 0.20/0.48 % ------ Combination Options
% 0.20/0.48
% 0.20/0.48 % --comb_res_mult 1000
% 0.20/0.48 % --comb_inst_mult 300
% 0.20/0.48 % ------
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 % ------ Proving...
% 0.20/0.48 % warning: shown sat in sat incomplete mode
% 0.20/0.48 %
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 cnf(c_55,negated_conjecture,
% 0.20/0.48 ( in_open(sk3_esk1_0,v0,v600) ),
% 0.20/0.48 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_5) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_83,negated_conjecture,
% 0.20/0.48 ( in_open(sk3_esk1_0,v0,v600) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_55]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_91,negated_conjecture,
% 0.20/0.48 ( in_open(sk3_esk1_0,v0,v600) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_83]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_94,negated_conjecture,
% 0.20/0.48 ( in_open(sk3_esk1_0,v0,v600) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_91]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_95,negated_conjecture,
% 0.20/0.48 ( in_open(sk3_esk1_0,v0,v600) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_94]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_264,negated_conjecture,
% 0.20/0.48 ( in_open(sk3_esk1_0,v0,v600) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_95]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_41,plain,
% 0.20/0.48 ( less(X0,X1) | ~ in_open(X1,X0,X2) ),
% 0.20/0.48 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_171_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_236,plain,
% 0.20/0.48 ( less(X0,X1) | ~ in_open(X1,X0,X2) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_41]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_276,plain,
% 0.20/0.48 ( less(v0,sk3_esk1_0) ),
% 0.20/0.48 inference(resolution,[status(thm)],[c_264,c_236]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_277,plain,
% 0.20/0.48 ( less(v0,sk3_esk1_0) ),
% 0.20/0.48 inference(rewriting,[status(thm)],[c_276]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_21,plain,
% 0.20/0.48 ( leq(X0,X1) | ~ less(X0,X1) ),
% 0.20/0.48 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_191_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_196,plain,
% 0.20/0.48 ( leq(X0,X1) | ~ less(X0,X1) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_21]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_197,plain,
% 0.20/0.48 ( ~ less(X0,X1) | leq(X0,X1) ),
% 0.20/0.48 inference(rewriting,[status(thm)],[c_196]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_284,plain,
% 0.20/0.48 ( leq(v0,sk3_esk1_0) ),
% 0.20/0.48 inference(resolution,[status(thm)],[c_277,c_197]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_285,plain,
% 0.20/0.48 ( leq(v0,sk3_esk1_0) ),
% 0.20/0.48 inference(rewriting,[status(thm)],[c_284]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_40,plain,
% 0.20/0.48 ( less(X0,X1) | ~ in_open(X0,X2,X1) ),
% 0.20/0.48 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_172_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_234,plain,
% 0.20/0.48 ( less(X0,X1) | ~ in_open(X0,X2,X1) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_40]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_274,plain,
% 0.20/0.48 ( less(sk3_esk1_0,v600) ),
% 0.20/0.48 inference(resolution,[status(thm)],[c_264,c_234]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_275,plain,
% 0.20/0.48 ( less(sk3_esk1_0,v600) ),
% 0.20/0.48 inference(rewriting,[status(thm)],[c_274]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_280,plain,
% 0.20/0.48 ( leq(sk3_esk1_0,v600) ),
% 0.20/0.48 inference(resolution,[status(thm)],[c_275,c_197]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_281,plain,
% 0.20/0.48 ( leq(sk3_esk1_0,v600) ),
% 0.20/0.48 inference(rewriting,[status(thm)],[c_280]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_56,negated_conjecture,
% 0.20/0.48 ( leq(v600,sk3_esk1_0) ),
% 0.20/0.48 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_6) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_85,negated_conjecture,
% 0.20/0.48 ( leq(v600,sk3_esk1_0) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_56]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_92,negated_conjecture,
% 0.20/0.48 ( leq(v600,sk3_esk1_0) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_85]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_93,negated_conjecture,
% 0.20/0.48 ( leq(v600,sk3_esk1_0) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_92]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_96,negated_conjecture,
% 0.20/0.48 ( leq(v600,sk3_esk1_0) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_93]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_266,negated_conjecture,
% 0.20/0.48 ( leq(v600,sk3_esk1_0) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_96]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_22,plain,
% 0.20/0.48 ( less(X0,X1) | X0 = X1 | ~ leq(X0,X1) ),
% 0.20/0.48 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_190_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_198,plain,
% 0.20/0.48 ( less(X0,X1) | X0 = X1 | ~ leq(X0,X1) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_22]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_199,plain,
% 0.20/0.48 ( less(X0,X1) | ~ leq(X0,X1) | X0 = X1 ),
% 0.20/0.48 inference(rewriting,[status(thm)],[c_198]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_270,plain,
% 0.20/0.48 ( less(v600,sk3_esk1_0) | v600 = sk3_esk1_0 ),
% 0.20/0.48 inference(resolution,[status(thm)],[c_266,c_199]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_271,plain,
% 0.20/0.48 ( less(v600,sk3_esk1_0) | v600 = sk3_esk1_0 ),
% 0.20/0.48 inference(rewriting,[status(thm)],[c_270]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_44,plain,
% 0.20/0.48 ( ~ leq(X0,X1) | ~ less(X1,X2) | in_ropen(X1,X0,X2) ),
% 0.20/0.48 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_168_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_242,plain,
% 0.20/0.48 ( ~ leq(X0,X1) | ~ less(X1,X2) | in_ropen(X1,X0,X2) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_44]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_243,plain,
% 0.20/0.48 ( ~ less(X0,X1) | ~ leq(X2,X0) | in_ropen(X0,X2,X1) ),
% 0.20/0.48 inference(rewriting,[status(thm)],[c_242]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_32,plain,
% 0.20/0.48 ( ~ less(X0,X1) | ~ leq(X1,X2) | less(X0,X2) ),
% 0.20/0.48 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_180_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_218,plain,
% 0.20/0.48 ( ~ less(X0,X1) | ~ leq(X1,X2) | less(X0,X2) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_32]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_219,plain,
% 0.20/0.48 ( ~ less(X0,X1) | less(X0,X2) | ~ leq(X1,X2) ),
% 0.20/0.48 inference(rewriting,[status(thm)],[c_218]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_31,plain,
% 0.20/0.48 ( ~ leq(X0,X1) | ~ less(X1,X2) | less(X0,X2) ),
% 0.20/0.48 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_181_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_216,plain,
% 0.20/0.48 ( ~ leq(X0,X1) | ~ less(X1,X2) | less(X0,X2) ),
% 0.20/0.48 inference(copy,[status(esa)],[c_31]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_217,plain,
% 0.20/0.48 ( ~ less(X0,X1) | less(X2,X1) | ~ leq(X2,X0) ),
% 0.20/0.48 inference(rewriting,[status(thm)],[c_216]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_27,plain,
% 0.20/0.48 ( X0 != unknown
% 0.20/0.48 | ~ is_verdict(X1)
% 0.20/0.48 | ~ is_verdict(X0)
% 0.20/0.48 | X0 = conflict
% 0.20/0.48 | X1 = conflict
% 0.20/0.48 | box_verdict(X0,X1) = unknown ),
% 0.20/0.48 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_185_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_208,plain,
% 0.20/0.48 ( X0 != unknown
% 0.20/0.48 | ~ is_verdict(X1)
% 0.20/0.48 | ~ is_verdict(X0)
% 0.20/0.48 | X0 = conflict
% 0.20/0.48 | X1 = conflict
% 0.20/0.48 | box_verdict(X0,X1) = unknown ),
% 0.20/0.48 inference(copy,[status(esa)],[c_27]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_209,plain,
% 0.20/0.48 ( ~ is_verdict(X0)
% 0.20/0.48 | ~ is_verdict(X1)
% 0.20/0.48 | box_verdict(X1,X0) = unknown
% 0.20/0.48 | X1 != unknown
% 0.20/0.48 | X1 = conflict
% 0.20/0.48 | X0 = conflict ),
% 0.20/0.48 inference(rewriting,[status(thm)],[c_208]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_26,plain,
% 0.20/0.48 ( X0 != unknown
% 0.20/0.48 | ~ is_verdict(X0)
% 0.20/0.48 | ~ is_verdict(X1)
% 0.20/0.48 | X1 = conflict
% 0.20/0.48 | X0 = conflict
% 0.20/0.48 | box_verdict(X1,X0) = unknown ),
% 0.20/0.48 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_186_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_206,plain,
% 0.20/0.48 ( X0 != unknown
% 0.20/0.48 | ~ is_verdict(X0)
% 0.20/0.48 | ~ is_verdict(X1)
% 0.20/0.48 | X1 = conflict
% 0.20/0.48 | X0 = conflict
% 0.20/0.48 | box_verdict(X1,X0) = unknown ),
% 0.20/0.48 inference(copy,[status(esa)],[c_26]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_207,plain,
% 0.20/0.48 ( ~ is_verdict(X0)
% 0.20/0.48 | ~ is_verdict(X1)
% 0.20/0.48 | box_verdict(X1,X0) = unknown
% 0.20/0.48 | X0 != unknown
% 0.20/0.48 | X1 = conflict
% 0.20/0.48 | X0 = conflict ),
% 0.20/0.48 inference(rewriting,[status(thm)],[c_206]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_25,plain,
% 0.20/0.48 ( ~ is_verdict(X0)
% 0.20/0.48 | ~ is_verdict(X1)
% 0.20/0.48 | X0 != compatible
% 0.20/0.48 | X1 != compatible
% 0.20/0.48 | box_verdict(X0,X1) = compatible ),
% 0.20/0.48 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_187_0) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_204,plain,
% 0.20/0.48 ( ~ is_verdict(X0)
% 0.20/0.48 | ~ is_verdict(X1)
% 0.20/0.48 | X0 != compatible
% 0.20/0.48 | X1 != compatible
% 0.20/0.48 | box_verdict(X0,X1) = compatible ),
% 0.20/0.48 inference(copy,[status(esa)],[c_25]) ).
% 0.20/0.48
% 0.20/0.48 cnf(c_205,plain,
% 0.20/0.48 ( ~ is_verdict(X0)
% 0.20/0.48 | ~ is_verdict(X1)
% 0.20/0.48 | box_verdict(X0,X1) = compatible
% 0.20/0.48 | X0 != compatible
% 0.20/0.48 | X1 != compatible ),
% 0.20/0.49 inference(rewriting,[status(thm)],[c_204]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_24,plain,
% 0.20/0.49 ( X0 != conflict
% 0.20/0.49 | ~ is_verdict(X1)
% 0.20/0.49 | ~ is_verdict(X0)
% 0.20/0.49 | box_verdict(X0,X1) = conflict ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_188_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_202,plain,
% 0.20/0.49 ( X0 != conflict
% 0.20/0.49 | ~ is_verdict(X1)
% 0.20/0.49 | ~ is_verdict(X0)
% 0.20/0.49 | box_verdict(X0,X1) = conflict ),
% 0.20/0.49 inference(copy,[status(esa)],[c_24]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_203,plain,
% 0.20/0.49 ( ~ is_verdict(X0)
% 0.20/0.49 | ~ is_verdict(X1)
% 0.20/0.49 | box_verdict(X1,X0) = conflict
% 0.20/0.49 | X1 != conflict ),
% 0.20/0.49 inference(rewriting,[status(thm)],[c_202]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_23,plain,
% 0.20/0.49 ( X0 != conflict
% 0.20/0.49 | ~ is_verdict(X0)
% 0.20/0.49 | ~ is_verdict(X1)
% 0.20/0.49 | box_verdict(X1,X0) = conflict ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_189_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_200,plain,
% 0.20/0.49 ( X0 != conflict
% 0.20/0.49 | ~ is_verdict(X0)
% 0.20/0.49 | ~ is_verdict(X1)
% 0.20/0.49 | box_verdict(X1,X0) = conflict ),
% 0.20/0.49 inference(copy,[status(esa)],[c_23]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_201,plain,
% 0.20/0.49 ( ~ is_verdict(X0)
% 0.20/0.49 | ~ is_verdict(X1)
% 0.20/0.49 | box_verdict(X1,X0) = conflict
% 0.20/0.49 | X0 != conflict ),
% 0.20/0.49 inference(rewriting,[status(thm)],[c_200]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_20,plain,
% 0.20/0.49 ( X0 != X1 | leq(X0,X1) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_192_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_194,plain,
% 0.20/0.49 ( X0 != X1 | leq(X0,X1) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_20]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_195,plain,
% 0.20/0.49 ( leq(X0,X1) | X0 != X1 ),
% 0.20/0.49 inference(rewriting,[status(thm)],[c_194]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_19,plain,
% 0.20/0.49 ( X0 = conflict | X0 = compatible | X0 = unknown | ~ is_verdict(X0) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_193_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_192,plain,
% 0.20/0.49 ( X0 = conflict | X0 = compatible | X0 = unknown | ~ is_verdict(X0) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_19]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_193,plain,
% 0.20/0.49 ( ~ is_verdict(X0) | X0 = unknown | X0 = compatible | X0 = conflict ),
% 0.20/0.49 inference(rewriting,[status(thm)],[c_192]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_7,plain,
% 0.20/0.49 ( less(X0,X1) | X1 = X0 | less(X1,X0) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_9_2) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_168,plain,
% 0.20/0.49 ( less(X0,X1) | X1 = X0 | less(X1,X0) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_7]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_169,plain,
% 0.20/0.49 ( less(X0,X1) | less(X1,X0) | X1 = X0 ),
% 0.20/0.49 inference(rewriting,[status(thm)],[c_168]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_4,plain,
% 0.20/0.49 ( box_verdict(X0,X1) = unknown
% 0.20/0.49 | box_verdict(X0,X1) = compatible
% 0.20/0.49 | box_verdict(X0,X1) = conflict
% 0.20/0.49 | ~ is_verdict(X1)
% 0.20/0.49 | ~ is_verdict(X0) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_8_4) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_162,plain,
% 0.20/0.49 ( box_verdict(X0,X1) = unknown
% 0.20/0.49 | box_verdict(X0,X1) = compatible
% 0.20/0.49 | box_verdict(X0,X1) = conflict
% 0.20/0.49 | ~ is_verdict(X1)
% 0.20/0.49 | ~ is_verdict(X0) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_4]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_163,plain,
% 0.20/0.49 ( ~ is_verdict(X0)
% 0.20/0.49 | ~ is_verdict(X1)
% 0.20/0.49 | box_verdict(X1,X0) = unknown
% 0.20/0.49 | box_verdict(X1,X0) = compatible
% 0.20/0.49 | box_verdict(X1,X0) = conflict ),
% 0.20/0.49 inference(rewriting,[status(thm)],[c_162]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_54,plain,
% 0.20/0.49 ( ~ in_closed(sk1_esk3_4(X0,X1,X2,X3),X0,X1)
% 0.20/0.49 | axis_subsumes(X2,X3,X0,X1) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_158_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_262,plain,
% 0.20/0.49 ( ~ in_closed(sk1_esk3_4(X0,X1,X2,X3),X0,X1)
% 0.20/0.49 | axis_subsumes(X2,X3,X0,X1) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_54]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_53,plain,
% 0.20/0.49 ( in_closed(sk1_esk3_4(X0,X1,X2,X3),X2,X3) | axis_subsumes(X2,X3,X0,X1) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_159_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_260,plain,
% 0.20/0.49 ( in_closed(sk1_esk3_4(X0,X1,X2,X3),X2,X3) | axis_subsumes(X2,X3,X0,X1) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_53]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_52,plain,
% 0.20/0.49 ( in_closed(sk1_esk2_4(X0,X1,X2,X3),X2,X3)
% 0.20/0.49 | ~ axis_compatible(X2,X3,X0,X1) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_160_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_258,plain,
% 0.20/0.49 ( in_closed(sk1_esk2_4(X0,X1,X2,X3),X2,X3)
% 0.20/0.49 | ~ axis_compatible(X2,X3,X0,X1) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_52]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_51,plain,
% 0.20/0.49 ( in_closed(sk1_esk2_4(X0,X1,X2,X3),X0,X1)
% 0.20/0.49 | ~ axis_compatible(X2,X3,X0,X1) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_161_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_256,plain,
% 0.20/0.49 ( in_closed(sk1_esk2_4(X0,X1,X2,X3),X0,X1)
% 0.20/0.49 | ~ axis_compatible(X2,X3,X0,X1) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_51]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_50,plain,
% 0.20/0.49 ( in_closed(sk1_esk1_4(X0,X1,X2,X3),X2,X3) | axis_conflict(X2,X3,X0,X1) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_162_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_254,plain,
% 0.20/0.49 ( in_closed(sk1_esk1_4(X0,X1,X2,X3),X2,X3) | axis_conflict(X2,X3,X0,X1) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_50]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_49,plain,
% 0.20/0.49 ( in_closed(sk1_esk1_4(X0,X1,X2,X3),X0,X1) | axis_conflict(X2,X3,X0,X1) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_163_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_252,plain,
% 0.20/0.49 ( in_closed(sk1_esk1_4(X0,X1,X2,X3),X0,X1) | axis_conflict(X2,X3,X0,X1) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_49]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_48,plain,
% 0.20/0.49 ( ~ in_closed(X0,X1,X2)
% 0.20/0.49 | ~ in_closed(X0,X3,X4)
% 0.20/0.49 | axis_compatible(X1,X2,X3,X4) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_164_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_250,plain,
% 0.20/0.49 ( ~ in_closed(X0,X1,X2)
% 0.20/0.49 | ~ in_closed(X0,X3,X4)
% 0.20/0.49 | axis_compatible(X1,X2,X3,X4) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_48]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_47,plain,
% 0.20/0.49 ( ~ in_closed(X0,X1,X2)
% 0.20/0.49 | ~ in_closed(X0,X3,X4)
% 0.20/0.49 | ~ axis_conflict(X1,X2,X3,X4) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_165_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_248,plain,
% 0.20/0.49 ( ~ in_closed(X0,X1,X2)
% 0.20/0.49 | ~ in_closed(X0,X3,X4)
% 0.20/0.49 | ~ axis_conflict(X1,X2,X3,X4) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_47]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_46,plain,
% 0.20/0.49 ( ~ in_closed(X0,X1,X2)
% 0.20/0.49 | in_closed(X0,X3,X4)
% 0.20/0.49 | ~ axis_subsumes(X1,X2,X3,X4) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_166_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_246,plain,
% 0.20/0.49 ( ~ in_closed(X0,X1,X2)
% 0.20/0.49 | in_closed(X0,X3,X4)
% 0.20/0.49 | ~ axis_subsumes(X1,X2,X3,X4) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_46]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_45,plain,
% 0.20/0.49 ( ~ less(X0,X1) | ~ less(X1,X2) | in_open(X1,X0,X2) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_167_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_244,plain,
% 0.20/0.49 ( ~ less(X0,X1) | ~ less(X1,X2) | in_open(X1,X0,X2) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_45]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_43,plain,
% 0.20/0.49 ( ~ less(X0,X1) | ~ leq(X1,X2) | in_lopen(X1,X0,X2) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_169_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_240,plain,
% 0.20/0.49 ( ~ less(X0,X1) | ~ leq(X1,X2) | in_lopen(X1,X0,X2) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_43]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_42,plain,
% 0.20/0.49 ( ~ leq(X0,X1) | ~ leq(X1,X2) | in_closed(X1,X0,X2) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_170_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_238,plain,
% 0.20/0.49 ( ~ leq(X0,X1) | ~ leq(X1,X2) | in_closed(X1,X0,X2) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_42]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_39,plain,
% 0.20/0.49 ( leq(X0,X1) | ~ in_ropen(X1,X0,X2) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_173_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_232,plain,
% 0.20/0.49 ( leq(X0,X1) | ~ in_ropen(X1,X0,X2) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_39]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_38,plain,
% 0.20/0.49 ( less(X0,X1) | ~ in_ropen(X0,X2,X1) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_174_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_230,plain,
% 0.20/0.49 ( less(X0,X1) | ~ in_ropen(X0,X2,X1) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_38]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_37,plain,
% 0.20/0.49 ( less(X0,X1) | ~ in_lopen(X1,X0,X2) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_175_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_228,plain,
% 0.20/0.49 ( less(X0,X1) | ~ in_lopen(X1,X0,X2) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_37]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_36,plain,
% 0.20/0.49 ( leq(X0,X1) | ~ in_lopen(X0,X2,X1) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_176_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_226,plain,
% 0.20/0.49 ( leq(X0,X1) | ~ in_lopen(X0,X2,X1) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_36]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_35,plain,
% 0.20/0.49 ( leq(X0,X1) | ~ in_closed(X1,X0,X2) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_177_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_224,plain,
% 0.20/0.49 ( leq(X0,X1) | ~ in_closed(X1,X0,X2) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_35]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_34,plain,
% 0.20/0.49 ( leq(X0,X1) | ~ in_closed(X0,X2,X1) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_178_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_222,plain,
% 0.20/0.49 ( leq(X0,X1) | ~ in_closed(X0,X2,X1) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_34]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_33,plain,
% 0.20/0.49 ( ~ leq(X0,X1) | ~ leq(X1,X2) | leq(X0,X2) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_179_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_220,plain,
% 0.20/0.49 ( ~ leq(X0,X1) | ~ leq(X1,X2) | leq(X0,X2) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_33]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_30,plain,
% 0.20/0.49 ( ~ leq(X0,X1) | ~ leq(X1,X0) | X0 = X1 ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_182_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_214,plain,
% 0.20/0.49 ( ~ leq(X0,X1) | ~ leq(X1,X0) | X0 = X1 ),
% 0.20/0.49 inference(copy,[status(esa)],[c_30]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_29,plain,
% 0.20/0.49 ( ~ less(X0,X1) | ~ less(X1,X2) | less(X0,X2) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_183_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_212,plain,
% 0.20/0.49 ( ~ less(X0,X1) | ~ less(X1,X2) | less(X0,X2) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_29]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_18,plain,
% 0.20/0.49 ( ~ less(X0,X0) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_194_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_190,plain,( ~ less(X0,X0) ),inference(copy,[status(esa)],[c_18]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_17,plain,
% 0.20/0.49 ( v0 != v600 ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_195_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_188,plain,( v0 != v600 ),inference(copy,[status(esa)],[c_17]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_16,plain,
% 0.20/0.49 ( less(v0,v600) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_196_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_186,plain,( less(v0,v600) ),inference(copy,[status(esa)],[c_16]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_15,plain,
% 0.20/0.49 ( val(v600) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_197_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_184,plain,( val(v600) ),inference(copy,[status(esa)],[c_15]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_14,plain,
% 0.20/0.49 ( val(v0) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_198_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_182,plain,( val(v0) ),inference(copy,[status(esa)],[c_14]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_13,plain,
% 0.20/0.49 ( compatible != unknown ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_199_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_180,plain,
% 0.20/0.49 ( compatible != unknown ),
% 0.20/0.49 inference(copy,[status(esa)],[c_13]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_12,plain,
% 0.20/0.49 ( conflict != unknown ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_200_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_178,plain,
% 0.20/0.49 ( conflict != unknown ),
% 0.20/0.49 inference(copy,[status(esa)],[c_12]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_11,plain,
% 0.20/0.49 ( conflict != compatible ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_201_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_176,plain,
% 0.20/0.49 ( conflict != compatible ),
% 0.20/0.49 inference(copy,[status(esa)],[c_11]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_10,plain,
% 0.20/0.49 ( is_verdict(unknown) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_202_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_174,plain,
% 0.20/0.49 ( is_verdict(unknown) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_10]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_9,plain,
% 0.20/0.49 ( is_verdict(compatible) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_203_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_172,plain,
% 0.20/0.49 ( is_verdict(compatible) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_9]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_8,plain,
% 0.20/0.49 ( is_verdict(conflict) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_204_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_170,plain,
% 0.20/0.49 ( is_verdict(conflict) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_8]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_5,plain,
% 0.20/0.49 ( less(X0,X1) | X0 = X1 | less(X1,X0) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_9_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_164,plain,
% 0.20/0.49 ( less(X0,X1) | X0 = X1 | less(X1,X0) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_5]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_165,plain,
% 0.20/0.49 ( less(X0,X1) | less(X1,X0) | X0 = X1 ),
% 0.20/0.49 inference(rewriting,[status(thm)],[c_164]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_0,plain,
% 0.20/0.49 ( ~ is_verdict(X0)
% 0.20/0.49 | ~ is_verdict(X1)
% 0.20/0.49 | box_verdict(X0,X1) = conflict
% 0.20/0.49 | box_verdict(X0,X1) = compatible
% 0.20/0.49 | box_verdict(X0,X1) = unknown ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p', c_0_8_0) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_154,plain,
% 0.20/0.49 ( ~ is_verdict(X0)
% 0.20/0.49 | ~ is_verdict(X1)
% 0.20/0.49 | box_verdict(X0,X1) = conflict
% 0.20/0.49 | box_verdict(X0,X1) = compatible
% 0.20/0.49 | box_verdict(X0,X1) = unknown ),
% 0.20/0.49 inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_155,plain,
% 0.20/0.49 ( ~ is_verdict(X0)
% 0.20/0.49 | ~ is_verdict(X1)
% 0.20/0.49 | box_verdict(X0,X1) = unknown
% 0.20/0.49 | box_verdict(X0,X1) = compatible
% 0.20/0.49 | box_verdict(X0,X1) = conflict ),
% 0.20/0.49 inference(rewriting,[status(thm)],[c_154]) ).
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 % ------ Statistics
% 0.20/0.49
% 0.20/0.49 % ------ General
% 0.20/0.49
% 0.20/0.49 % num_of_input_clauses: 57
% 0.20/0.49 % num_of_input_neg_conjectures: 2
% 0.20/0.49 % num_of_splits: 0
% 0.20/0.49 % num_of_split_atoms: 0
% 0.20/0.49 % num_of_sem_filtered_clauses: 0
% 0.20/0.49 % num_of_subtypes: 0
% 0.20/0.49 % monotx_restored_types: 0
% 0.20/0.49 % sat_num_of_epr_types: 0
% 0.20/0.49 % sat_num_of_non_cyclic_types: 0
% 0.20/0.49 % sat_guarded_non_collapsed_types: 0
% 0.20/0.49 % is_epr: 0
% 0.20/0.49 % is_horn: 0
% 0.20/0.49 % has_eq: 1
% 0.20/0.49 % num_pure_diseq_elim: 0
% 0.20/0.49 % simp_replaced_by: 0
% 0.20/0.49 % res_preprocessed: 4
% 0.20/0.49 % prep_upred: 0
% 0.20/0.49 % prep_unflattend: 0
% 0.20/0.49 % pred_elim_cands: 0
% 0.20/0.49 % pred_elim: 0
% 0.20/0.49 % pred_elim_cl: 0
% 0.20/0.49 % pred_elim_cycles: 0
% 0.20/0.49 % forced_gc_time: 0
% 0.20/0.49 % gc_basic_clause_elim: 0
% 0.20/0.49 % parsing_time: 0.002
% 0.20/0.49 % sem_filter_time: 0.
% 0.20/0.49 % pred_elim_time: 0.
% 0.20/0.49 % out_proof_time: 0.
% 0.20/0.49 % monotx_time: 0.
% 0.20/0.49 % subtype_inf_time: 0.
% 0.20/0.49 % unif_index_cands_time: 0.
% 0.20/0.49 % unif_index_add_time: 0.
% 0.20/0.49 % total_time: 0.045
% 0.20/0.49 % num_of_symbols: 46
% 0.20/0.49 % num_of_terms: 175
% 0.20/0.49
% 0.20/0.49 % ------ Propositional Solver
% 0.20/0.49
% 0.20/0.49 % prop_solver_calls: 1
% 0.20/0.49 % prop_fast_solver_calls: 6
% 0.20/0.49 % prop_num_of_clauses: 77
% 0.20/0.49 % prop_preprocess_simplified: 143
% 0.20/0.49 % prop_fo_subsumed: 0
% 0.20/0.49 % prop_solver_time: 0.
% 0.20/0.49 % prop_fast_solver_time: 0.
% 0.20/0.49 % prop_unsat_core_time: 0.
% 0.20/0.49
% 0.20/0.49 % ------ QBF
% 0.20/0.49
% 0.20/0.49 % qbf_q_res: 0
% 0.20/0.49 % qbf_num_tautologies: 0
% 0.20/0.49 % qbf_prep_cycles: 0
% 0.20/0.49
% 0.20/0.49 % ------ BMC1
% 0.20/0.49
% 0.20/0.49 % bmc1_current_bound: -1
% 0.20/0.49 % bmc1_last_solved_bound: -1
% 0.20/0.49 % bmc1_unsat_core_size: -1
% 0.20/0.49 % bmc1_unsat_core_parents_size: -1
% 0.20/0.49 % bmc1_merge_next_fun: 0
% 0.20/0.49 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.49
% 0.20/0.49 % ------ Instantiation
% 0.20/0.49
% 0.20/0.49 % inst_num_of_clauses: 57
% 0.20/0.49 % inst_num_in_passive: 0
% 0.20/0.49 % inst_num_in_active: 0
% 0.20/0.49 % inst_num_in_unprocessed: 57
% 0.20/0.49 % inst_num_of_loops: 0
% 0.20/0.49 % inst_num_of_learning_restarts: 0
% 0.20/0.49 % inst_num_moves_active_passive: 0
% 0.20/0.49 % inst_lit_activity: 0
% 0.20/0.49 % inst_lit_activity_moves: 0
% 0.20/0.49 % inst_num_tautologies: 0
% 0.20/0.49 % inst_num_prop_implied: 0
% 0.20/0.49 % inst_num_existing_simplified: 0
% 0.20/0.49 % inst_num_eq_res_simplified: 0
% 0.20/0.49 % inst_num_child_elim: 0
% 0.20/0.49 % inst_num_of_dismatching_blockings: 0
% 0.20/0.49 % inst_num_of_non_proper_insts: 0
% 0.20/0.49 % inst_num_of_duplicates: 0
% 0.20/0.49 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.49 % inst_dismatching_checking_time: 0.
% 0.20/0.49
% 0.20/0.49 % ------ Resolution
% 0.20/0.49
% 0.20/0.49 % res_num_of_clauses: 75
% 0.20/0.49 % res_num_in_passive: 0
% 0.20/0.49 % res_num_in_active: 57
% 0.20/0.49 % res_num_of_loops: 8
% 0.20/0.49 % res_forward_subset_subsumed: 7
% 0.20/0.49 % res_backward_subset_subsumed: 0
% 0.20/0.49 % res_forward_subsumed: 0
% 0.20/0.49 % res_backward_subsumed: 0
% 0.20/0.49 % res_forward_subsumption_resolution: 0
% 0.20/0.49 % res_backward_subsumption_resolution: 0
% 0.20/0.49 % res_clause_to_clause_subsumption: 7
% 0.20/0.49 % res_orphan_elimination: 0
% 0.20/0.49 % res_tautology_del: 0
% 0.20/0.49 % res_num_eq_res_simplified: 0
% 0.20/0.49 % res_num_sel_changes: 0
% 0.20/0.49 % res_moves_from_active_to_pass: 0
% 0.20/0.49
% 0.20/0.49 % Status Unknown
% 0.20/0.53 % Orienting using strategy ClausalAll
% 0.20/0.53 % FOF problem with conjecture
% 0.20/0.53 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_0256d7.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_b2d1f8.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_c5efac | grep -v "SZS"
% 0.20/0.55
% 0.20/0.55 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.55
% 0.20/0.55 %
% 0.20/0.55 % ------ iProver source info
% 0.20/0.55
% 0.20/0.55 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.55 % git: non_committed_changes: true
% 0.20/0.55 % git: last_make_outside_of_git: true
% 0.20/0.55
% 0.20/0.55 %
% 0.20/0.55 % ------ Input Options
% 0.20/0.55
% 0.20/0.55 % --out_options all
% 0.20/0.55 % --tptp_safe_out true
% 0.20/0.55 % --problem_path ""
% 0.20/0.55 % --include_path ""
% 0.20/0.55 % --clausifier .//eprover
% 0.20/0.55 % --clausifier_options --tstp-format
% 0.20/0.55 % --stdin false
% 0.20/0.55 % --dbg_backtrace false
% 0.20/0.55 % --dbg_dump_prop_clauses false
% 0.20/0.55 % --dbg_dump_prop_clauses_file -
% 0.20/0.55 % --dbg_out_stat false
% 0.20/0.55
% 0.20/0.55 % ------ General Options
% 0.20/0.55
% 0.20/0.55 % --fof false
% 0.20/0.55 % --time_out_real 150.
% 0.20/0.55 % --time_out_prep_mult 0.2
% 0.20/0.55 % --time_out_virtual -1.
% 0.20/0.55 % --schedule none
% 0.20/0.55 % --ground_splitting input
% 0.20/0.55 % --splitting_nvd 16
% 0.20/0.55 % --non_eq_to_eq false
% 0.20/0.55 % --prep_gs_sim true
% 0.20/0.55 % --prep_unflatten false
% 0.20/0.55 % --prep_res_sim true
% 0.20/0.55 % --prep_upred true
% 0.20/0.55 % --res_sim_input true
% 0.20/0.55 % --clause_weak_htbl true
% 0.20/0.55 % --gc_record_bc_elim false
% 0.20/0.55 % --symbol_type_check false
% 0.20/0.55 % --clausify_out false
% 0.20/0.55 % --large_theory_mode false
% 0.20/0.55 % --prep_sem_filter none
% 0.20/0.55 % --prep_sem_filter_out false
% 0.20/0.55 % --preprocessed_out false
% 0.20/0.55 % --sub_typing false
% 0.20/0.55 % --brand_transform false
% 0.20/0.55 % --pure_diseq_elim true
% 0.20/0.55 % --min_unsat_core false
% 0.20/0.55 % --pred_elim true
% 0.20/0.55 % --add_important_lit false
% 0.20/0.55 % --soft_assumptions false
% 0.20/0.55 % --reset_solvers false
% 0.20/0.55 % --bc_imp_inh []
% 0.20/0.55 % --conj_cone_tolerance 1.5
% 0.20/0.55 % --prolific_symb_bound 500
% 0.20/0.55 % --lt_threshold 2000
% 0.20/0.55
% 0.20/0.55 % ------ SAT Options
% 0.20/0.55
% 0.20/0.55 % --sat_mode false
% 0.20/0.55 % --sat_fm_restart_options ""
% 0.20/0.55 % --sat_gr_def false
% 0.20/0.55 % --sat_epr_types true
% 0.20/0.55 % --sat_non_cyclic_types false
% 0.20/0.55 % --sat_finite_models false
% 0.20/0.55 % --sat_fm_lemmas false
% 0.20/0.55 % --sat_fm_prep false
% 0.20/0.55 % --sat_fm_uc_incr true
% 0.20/0.55 % --sat_out_model small
% 0.20/0.55 % --sat_out_clauses false
% 0.20/0.55
% 0.20/0.55 % ------ QBF Options
% 0.20/0.55
% 0.20/0.55 % --qbf_mode false
% 0.20/0.55 % --qbf_elim_univ true
% 0.20/0.55 % --qbf_sk_in true
% 0.20/0.55 % --qbf_pred_elim true
% 0.20/0.55 % --qbf_split 32
% 0.20/0.55
% 0.20/0.55 % ------ BMC1 Options
% 0.20/0.55
% 0.20/0.55 % --bmc1_incremental false
% 0.20/0.55 % --bmc1_axioms reachable_all
% 0.20/0.55 % --bmc1_min_bound 0
% 0.20/0.55 % --bmc1_max_bound -1
% 0.20/0.55 % --bmc1_max_bound_default -1
% 0.20/0.55 % --bmc1_symbol_reachability true
% 0.20/0.55 % --bmc1_property_lemmas false
% 0.20/0.55 % --bmc1_k_induction false
% 0.20/0.55 % --bmc1_non_equiv_states false
% 0.20/0.55 % --bmc1_deadlock false
% 0.20/0.55 % --bmc1_ucm false
% 0.20/0.55 % --bmc1_add_unsat_core none
% 0.20/0.55 % --bmc1_unsat_core_children false
% 0.20/0.55 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.55 % --bmc1_out_stat full
% 0.20/0.55 % --bmc1_ground_init false
% 0.20/0.55 % --bmc1_pre_inst_next_state false
% 0.20/0.55 % --bmc1_pre_inst_state false
% 0.20/0.55 % --bmc1_pre_inst_reach_state false
% 0.20/0.55 % --bmc1_out_unsat_core false
% 0.20/0.55 % --bmc1_aig_witness_out false
% 0.20/0.55 % --bmc1_verbose false
% 0.20/0.55 % --bmc1_dump_clauses_tptp false
% 0.30/0.56 % --bmc1_dump_unsat_core_tptp false
% 0.30/0.56 % --bmc1_dump_file -
% 0.30/0.56 % --bmc1_ucm_expand_uc_limit 128
% 0.30/0.56 % --bmc1_ucm_n_expand_iterations 6
% 0.30/0.56 % --bmc1_ucm_extend_mode 1
% 0.30/0.56 % --bmc1_ucm_init_mode 2
% 0.30/0.56 % --bmc1_ucm_cone_mode none
% 0.30/0.56 % --bmc1_ucm_reduced_relation_type 0
% 0.30/0.56 % --bmc1_ucm_relax_model 4
% 0.30/0.56 % --bmc1_ucm_full_tr_after_sat true
% 0.30/0.56 % --bmc1_ucm_expand_neg_assumptions false
% 0.30/0.56 % --bmc1_ucm_layered_model none
% 0.30/0.56 % --bmc1_ucm_max_lemma_size 10
% 0.30/0.56
% 0.30/0.56 % ------ AIG Options
% 0.30/0.56
% 0.30/0.56 % --aig_mode false
% 0.30/0.56
% 0.30/0.56 % ------ Instantiation Options
% 0.30/0.56
% 0.30/0.56 % --instantiation_flag true
% 0.30/0.56 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.30/0.56 % --inst_solver_per_active 750
% 0.30/0.56 % --inst_solver_calls_frac 0.5
% 0.30/0.56 % --inst_passive_queue_type priority_queues
% 0.30/0.56 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.30/0.56 % --inst_passive_queues_freq [25;2]
% 0.30/0.56 % --inst_dismatching true
% 0.30/0.56 % --inst_eager_unprocessed_to_passive true
% 0.30/0.56 % --inst_prop_sim_given true
% 0.30/0.56 % --inst_prop_sim_new false
% 0.30/0.56 % --inst_orphan_elimination true
% 0.30/0.56 % --inst_learning_loop_flag true
% 0.30/0.56 % --inst_learning_start 3000
% 0.30/0.56 % --inst_learning_factor 2
% 0.30/0.56 % --inst_start_prop_sim_after_learn 3
% 0.30/0.56 % --inst_sel_renew solver
% 0.30/0.56 % --inst_lit_activity_flag true
% 0.30/0.56 % --inst_out_proof true
% 0.30/0.56
% 0.30/0.56 % ------ Resolution Options
% 0.30/0.56
% 0.30/0.56 % --resolution_flag true
% 0.30/0.56 % --res_lit_sel kbo_max
% 0.30/0.56 % --res_to_prop_solver none
% 0.30/0.56 % --res_prop_simpl_new false
% 0.30/0.56 % --res_prop_simpl_given false
% 0.30/0.56 % --res_passive_queue_type priority_queues
% 0.30/0.56 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.30/0.56 % --res_passive_queues_freq [15;5]
% 0.30/0.56 % --res_forward_subs full
% 0.30/0.56 % --res_backward_subs full
% 0.30/0.56 % --res_forward_subs_resolution true
% 0.30/0.56 % --res_backward_subs_resolution true
% 0.30/0.56 % --res_orphan_elimination false
% 0.30/0.56 % --res_time_limit 1000.
% 0.30/0.56 % --res_out_proof true
% 0.30/0.56 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_0256d7.s
% 0.30/0.56 % --modulo true
% 0.30/0.56
% 0.30/0.56 % ------ Combination Options
% 0.30/0.56
% 0.30/0.56 % --comb_res_mult 1000
% 0.30/0.56 % --comb_inst_mult 300
% 0.30/0.56 % ------
% 0.30/0.56
% 0.30/0.56 % ------ Parsing...% successful
% 0.30/0.56
% 0.30/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.30/0.56
% 0.30/0.56 % ------ Proving...
% 0.30/0.56 % ------ Problem Properties
% 0.30/0.56
% 0.30/0.56 %
% 0.30/0.56 % EPR false
% 0.30/0.56 % Horn false
% 0.30/0.56 % Has equality true
% 0.30/0.56
% 0.30/0.56 % % ------ Input Options Time Limit: Unbounded
% 0.30/0.56
% 0.30/0.56
% 0.30/0.56 % % ------ Current options:
% 0.30/0.56
% 0.30/0.56 % ------ Input Options
% 0.30/0.56
% 0.30/0.56 % --out_options all
% 0.30/0.56 % --tptp_safe_out true
% 0.30/0.56 % --problem_path ""
% 0.30/0.56 % --include_path ""
% 0.30/0.56 % --clausifier .//eprover
% 0.30/0.56 % --clausifier_options --tstp-format
% 0.30/0.56 % --stdin false
% 0.30/0.56 % --dbg_backtrace false
% 0.30/0.56 % --dbg_dump_prop_clauses false
% 0.30/0.56 % --dbg_dump_prop_clauses_file -
% 0.30/0.56 % --dbg_out_stat false
% 0.30/0.56
% 0.30/0.56 % ------ General Options
% 0.30/0.56
% 0.30/0.56 % --fof false
% 0.30/0.56 % --time_out_real 150.
% 0.30/0.56 % --time_out_prep_mult 0.2
% 0.30/0.56 % --time_out_virtual -1.
% 0.30/0.56 % --schedule none
% 0.30/0.56 % --ground_splitting input
% 0.30/0.56 % --splitting_nvd 16
% 0.30/0.56 % --non_eq_to_eq false
% 0.30/0.56 % --prep_gs_sim true
% 0.30/0.56 % --prep_unflatten false
% 0.30/0.56 % --prep_res_sim true
% 0.30/0.56 % --prep_upred true
% 0.30/0.56 % --res_sim_input true
% 0.30/0.56 % --clause_weak_htbl true
% 0.30/0.56 % --gc_record_bc_elim false
% 0.30/0.56 % --symbol_type_check false
% 0.30/0.56 % --clausify_out false
% 0.30/0.56 % --large_theory_mode false
% 0.30/0.56 % --prep_sem_filter none
% 0.30/0.56 % --prep_sem_filter_out false
% 0.30/0.56 % --preprocessed_out false
% 0.30/0.56 % --sub_typing false
% 0.30/0.56 % --brand_transform false
% 0.30/0.56 % --pure_diseq_elim true
% 0.30/0.56 % --min_unsat_core false
% 0.30/0.56 % --pred_elim true
% 0.30/0.56 % --add_important_lit false
% 0.30/0.56 % --soft_assumptions false
% 0.30/0.56 % --reset_solvers false
% 0.30/0.56 % --bc_imp_inh []
% 0.30/0.56 % --conj_cone_tolerance 1.5
% 0.30/0.56 % --prolific_symb_bound 500
% 0.30/0.56 % --lt_threshold 2000
% 0.30/0.56
% 0.30/0.56 % ------ SAT Options
% 0.30/0.56
% 0.30/0.56 % --sat_mode false
% 0.30/0.56 % --sat_fm_restart_options ""
% 0.30/0.56 % --sat_gr_def false
% 0.30/0.56 % --sat_epr_types true
% 0.30/0.56 % --sat_non_cyclic_types false
% 0.30/0.56 % --sat_finite_models false
% 0.30/0.56 % --sat_fm_lemmas false
% 0.30/0.56 % --sat_fm_prep false
% 0.30/0.56 % --sat_fm_uc_incr true
% 0.30/0.56 % --sat_out_model small
% 0.30/0.56 % --sat_out_clauses false
% 0.30/0.56
% 0.30/0.56 % ------ QBF Options
% 0.30/0.56
% 0.30/0.56 % --qbf_mode false
% 0.30/0.56 % --qbf_elim_univ true
% 0.30/0.56 % --qbf_sk_in true
% 0.30/0.56 % --qbf_pred_elim true
% 0.30/0.56 % --qbf_split 32
% 0.30/0.56
% 0.30/0.56 % ------ BMC1 Options
% 0.30/0.56
% 0.30/0.56 % --bmc1_incremental false
% 0.30/0.56 % --bmc1_axioms reachable_all
% 0.30/0.56 % --bmc1_min_bound 0
% 0.30/0.56 % --bmc1_max_bound -1
% 0.30/0.56 % --bmc1_max_bound_default -1
% 0.30/0.56 % --bmc1_symbol_reachability true
% 0.30/0.56 % --bmc1_property_lemmas false
% 0.30/0.56 % --bmc1_k_induction false
% 0.30/0.56 % --bmc1_non_equiv_states false
% 0.30/0.56 % --bmc1_deadlock false
% 0.30/0.56 % --bmc1_ucm false
% 0.30/0.56 % --bmc1_add_unsat_core none
% 0.30/0.56 % --bmc1_unsat_core_children false
% 0.30/0.56 % --bmc1_unsat_core_extrapolate_axioms false
% 0.30/0.56 % --bmc1_out_stat full
% 0.30/0.56 % --bmc1_ground_init false
% 0.30/0.56 % --bmc1_pre_inst_next_state false
% 0.30/0.56 % --bmc1_pre_inst_state false
% 0.30/0.56 % --bmc1_pre_inst_reach_state false
% 0.30/0.56 % --bmc1_out_unsat_core false
% 0.30/0.56 % --bmc1_aig_witness_out false
% 0.30/0.56 % --bmc1_verbose false
% 0.30/0.56 % --bmc1_dump_clauses_tptp false
% 0.30/0.56 % --bmc1_dump_unsat_core_tptp false
% 0.30/0.56 % --bmc1_dump_file -
% 0.30/0.56 % --bmc1_ucm_expand_uc_limit 128
% 0.30/0.56 % --bmc1_ucm_n_expand_iterations 6
% 0.30/0.56 % --bmc1_ucm_extend_mode 1
% 0.30/0.56 % --bmc1_ucm_init_mode 2
% 0.30/0.56 % --bmc1_ucm_cone_mode none
% 0.30/0.56 % --bmc1_ucm_reduced_relation_type 0
% 0.30/0.56 % --bmc1_ucm_relax_model 4
% 0.30/0.56 % --bmc1_ucm_full_tr_after_sat true
% 0.30/0.56 % --bmc1_ucm_expand_neg_assumptions false
% 0.30/0.56 % --bmc1_ucm_layered_model none
% 0.30/0.56 % --bmc1_ucm_max_lemma_size 10
% 0.30/0.56
% 0.30/0.56 % ------ AIG Options
% 0.30/0.56
% 0.30/0.56 % --aig_mode false
% 0.30/0.56
% 0.30/0.56 % ------ Instantiation Options
% 0.30/0.56
% 0.30/0.56 % --instantiation_flag true
% 0.30/0.56 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.30/0.56 % --inst_solver_per_active 750
% 0.30/0.56 % --inst_solver_calls_frac 0.5
% 0.30/0.56 % --inst_passive_queue_type priority_queues
% 0.30/0.56 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.30/0.56 % --inst_passive_queues_freq [25;2]
% 0.30/0.56 % --inst_dismatching true
% 0.30/0.56 % --inst_eager_unprocessed_to_passive true
% 0.30/0.56 % --inst_prop_sim_given true
% 0.30/0.56 % --inst_prop_sim_new false
% 0.30/0.56 % --inst_orphan_elimination true
% 0.30/0.56 % --inst_learning_loop_flag true
% 0.30/0.56 % --inst_learning_start 3000
% 0.30/0.56 % --inst_learning_factor 2
% 0.30/0.56 % --inst_start_prop_sim_after_learn 3
% 0.30/0.56 % --inst_sel_renew solver
% 0.30/0.56 % --inst_lit_activity_flag true
% 0.30/0.56 % --inst_out_proof true
% 0.30/0.56
% 0.30/0.56 % ------ Resolution Options
% 0.30/0.56
% 0.30/0.56 % --resolution_flag true
% 0.30/0.56 % --res_lit_sel kbo_max
% 0.30/0.56 % --res_to_prop_solver none
% 0.30/0.56 % --res_prop_simpl_new false
% 0.30/0.56 % --res_prop_simpl_given false
% 0.30/0.56 % --res_passive_queue_type priority_queues
% 0.30/0.56 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.30/0.56 % --res_passive_queues_freq [15;5]
% 0.30/0.56 % --res_forward_subs full
% 0.30/0.56 % --res_backward_subs full
% 0.30/0.56 % --res_forward_subs_resolution true
% 0.30/0.56 % --res_backward_subs_resolution true
% 0.30/0.56 % --res_orphan_elimination false
% 0.30/0.56 % --res_time_limit 1000.
% 0.30/0.56 % --res_out_proof true
% 0.30/0.56 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_0256d7.s
% 0.30/0.56 % --modulo true
% 0.30/0.56
% 0.30/0.56 % ------ Combination Options
% 0.30/0.56
% 0.30/0.56 % --comb_res_mult 1000
% 0.30/0.56 % --comb_inst_mult 300
% 0.30/0.56 % ------
% 0.30/0.56
% 0.30/0.56
% 0.30/0.56
% 0.30/0.56 % ------ Proving...
% 0.30/0.56 %
% 0.30/0.56
% 0.30/0.56
% 0.30/0.56 % Resolution empty clause
% 0.30/0.56
% 0.30/0.56 % ------ Statistics
% 0.30/0.56
% 0.30/0.56 % ------ General
% 0.30/0.56
% 0.30/0.56 % num_of_input_clauses: 123
% 0.30/0.56 % num_of_input_neg_conjectures: 2
% 0.30/0.56 % num_of_splits: 0
% 0.30/0.56 % num_of_split_atoms: 0
% 0.30/0.56 % num_of_sem_filtered_clauses: 0
% 0.30/0.56 % num_of_subtypes: 0
% 0.30/0.56 % monotx_restored_types: 0
% 0.30/0.56 % sat_num_of_epr_types: 0
% 0.30/0.56 % sat_num_of_non_cyclic_types: 0
% 0.30/0.56 % sat_guarded_non_collapsed_types: 0
% 0.30/0.56 % is_epr: 0
% 0.30/0.56 % is_horn: 0
% 0.30/0.56 % has_eq: 1
% 0.30/0.56 % num_pure_diseq_elim: 0
% 0.30/0.56 % simp_replaced_by: 0
% 0.30/0.56 % res_preprocessed: 4
% 0.30/0.56 % prep_upred: 0
% 0.30/0.56 % prep_unflattend: 0
% 0.30/0.56 % pred_elim_cands: 0
% 0.30/0.56 % pred_elim: 0
% 0.30/0.56 % pred_elim_cl: 0
% 0.30/0.56 % pred_elim_cycles: 0
% 0.30/0.56 % forced_gc_time: 0
% 0.30/0.56 % gc_basic_clause_elim: 0
% 0.30/0.56 % parsing_time: 0.003
% 0.30/0.56 % sem_filter_time: 0.
% 0.30/0.56 % pred_elim_time: 0.
% 0.30/0.56 % out_proof_time: 0.
% 0.30/0.56 % monotx_time: 0.
% 0.30/0.56 % subtype_inf_time: 0.
% 0.30/0.56 % unif_index_cands_time: 0.
% 0.30/0.56 % unif_index_add_time: 0.
% 0.30/0.56 % total_time: 0.025
% 0.30/0.56 % num_of_symbols: 46
% 0.30/0.56 % num_of_terms: 254
% 0.30/0.56
% 0.30/0.56 % ------ Propositional Solver
% 0.30/0.56
% 0.30/0.56 % prop_solver_calls: 1
% 0.30/0.56 % prop_fast_solver_calls: 6
% 0.30/0.56 % prop_num_of_clauses: 98
% 0.30/0.56 % prop_preprocess_simplified: 386
% 0.30/0.56 % prop_fo_subsumed: 0
% 0.30/0.56 % prop_solver_time: 0.
% 0.30/0.56 % prop_fast_solver_time: 0.
% 0.30/0.56 % prop_unsat_core_time: 0.
% 0.30/0.56
% 0.30/0.56 % ------ QBF
% 0.30/0.56
% 0.30/0.56 % qbf_q_res: 0
% 0.30/0.56 % qbf_num_tautologies: 0
% 0.30/0.56 % qbf_prep_cycles: 0
% 0.30/0.56
% 0.30/0.56 % ------ BMC1
% 0.30/0.56
% 0.30/0.56 % bmc1_current_bound: -1
% 0.30/0.56 % bmc1_last_solved_bound: -1
% 0.30/0.56 % bmc1_unsat_core_size: -1
% 0.30/0.56 % bmc1_unsat_core_parents_size: -1
% 0.30/0.56 % bmc1_merge_next_fun: 0
% 0.30/0.56 % bmc1_unsat_core_clauses_time: 0.
% 0.30/0.56
% 0.30/0.56 % ------ Instantiation
% 0.30/0.56
% 0.30/0.56 % inst_num_of_clauses: 121
% 0.30/0.56 % inst_num_in_passive: 0
% 0.30/0.56 % inst_num_in_active: 0
% 0.30/0.56 % inst_num_in_unprocessed: 123
% 0.30/0.56 % inst_num_of_loops: 0
% 0.30/0.56 % inst_num_of_learning_restarts: 0
% 0.30/0.56 % inst_num_moves_active_passive: 0
% 0.30/0.56 % inst_lit_activity: 0
% 0.30/0.56 % inst_lit_activity_moves: 0
% 0.30/0.56 % inst_num_tautologies: 0
% 0.30/0.56 % inst_num_prop_implied: 0
% 0.30/0.56 % inst_num_existing_simplified: 0
% 0.30/0.56 % inst_num_eq_res_simplified: 0
% 0.30/0.56 % inst_num_child_elim: 0
% 0.30/0.56 % inst_num_of_dismatching_blockings: 0
% 0.30/0.56 % inst_num_of_non_proper_insts: 0
% 0.30/0.56 % inst_num_of_duplicates: 0
% 0.30/0.56 % inst_inst_num_from_inst_to_res: 0
% 0.30/0.56 % inst_dismatching_checking_time: 0.
% 0.30/0.56
% 0.30/0.56 % ------ Resolution
% 0.30/0.56
% 0.30/0.56 % res_num_of_clauses: 182
% 0.30/0.56 % res_num_in_passive: 31
% 0.30/0.56 % res_num_in_active: 78
% 0.30/0.56 % res_num_of_loops: 9
% 0.30/0.56 % res_forward_subset_subsumed: 54
% 0.30/0.56 % res_backward_subset_subsumed: 1
% 0.30/0.56 % res_forward_subsumed: 0
% 0.30/0.56 % res_backward_subsumed: 0
% 0.30/0.56 % res_forward_subsumption_resolution: 1
% 0.30/0.56 % res_backward_subsumption_resolution: 0
% 0.30/0.56 % res_clause_to_clause_subsumption: 14
% 0.30/0.56 % res_orphan_elimination: 0
% 0.30/0.56 % res_tautology_del: 0
% 0.30/0.56 % res_num_eq_res_simplified: 0
% 0.30/0.56 % res_num_sel_changes: 0
% 0.30/0.56 % res_moves_from_active_to_pass: 0
% 0.30/0.56
% 0.30/0.56 % Status Unsatisfiable
% 0.30/0.56 % SZS status Theorem
% 0.30/0.56 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------