%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT093+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n004.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:39 AM UTC 2026
% Result : Theorem 0.14s 0.48s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named inputERROR: Could not build tree for root to_be_clausified_0ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
fof(box_unknown,axiom,
! [V1,V2] :
( ( is_verdict(V1)
& is_verdict(V2)
& ( V1 = unknown
| V2 = unknown )
& V1 != conflict
& V2 != conflict )
=> box_verdict(V1,V2) = unknown ),
input ).
fof(box_unknown_0,plain,
! [V1,V2] :
( box_verdict(V1,V2) = unknown
| ~ ( is_verdict(V1)
& is_verdict(V2)
& ( V1 = unknown
| V2 = unknown )
& V1 != conflict
& V2 != conflict ) ),
inference(orientation,[status(thm)],[box_unknown]) ).
fof(box_compatible,axiom,
! [V1,V2] :
( ( is_verdict(V1)
& is_verdict(V2)
& V1 = compatible
& V2 = compatible )
=> box_verdict(V1,V2) = compatible ),
input ).
fof(box_compatible_0,plain,
! [V1,V2] :
( box_verdict(V1,V2) = compatible
| ~ ( is_verdict(V1)
& is_verdict(V2)
& V1 = compatible
& V2 = compatible ) ),
inference(orientation,[status(thm)],[box_compatible]) ).
fof(box_conflict,axiom,
! [V1,V2] :
( ( is_verdict(V1)
& is_verdict(V2)
& ( V1 = conflict
| V2 = conflict ) )
=> box_verdict(V1,V2) = conflict ),
input ).
fof(box_conflict_0,plain,
! [V1,V2] :
( box_verdict(V1,V2) = conflict
| ~ ( is_verdict(V1)
& is_verdict(V2)
& ( V1 = conflict
| V2 = conflict ) ) ),
inference(orientation,[status(thm)],[box_conflict]) ).
fof(verdict_enum,axiom,
! [V] :
( is_verdict(V)
=> ( V = conflict
| V = compatible
| V = unknown ) ),
input ).
fof(verdict_enum_0,plain,
! [V] :
( ~ is_verdict(V)
| V = conflict
| V = compatible
| V = unknown ),
inference(orientation,[status(thm)],[verdict_enum]) ).
fof(verdicts_distinct_cp_un,axiom,
compatible != unknown,
input ).
fof(verdicts_distinct_cp_un_0,plain,
( compatible != unknown
| $false ),
inference(orientation,[status(thm)],[verdicts_distinct_cp_un]) ).
fof(verdicts_distinct_cf_un,axiom,
conflict != unknown,
input ).
fof(verdicts_distinct_cf_un_0,plain,
( conflict != unknown
| $false ),
inference(orientation,[status(thm)],[verdicts_distinct_cf_un]) ).
fof(verdicts_distinct_cf_cp,axiom,
conflict != compatible,
input ).
fof(verdicts_distinct_cf_cp_0,plain,
( conflict != compatible
| $false ),
inference(orientation,[status(thm)],[verdicts_distinct_cf_cp]) ).
fof(unknown_is_verdict,axiom,
is_verdict(unknown),
input ).
fof(unknown_is_verdict_0,plain,
( is_verdict(unknown)
| $false ),
inference(orientation,[status(thm)],[unknown_is_verdict]) ).
fof(compatible_is_verdict,axiom,
is_verdict(compatible),
input ).
fof(compatible_is_verdict_0,plain,
( is_verdict(compatible)
| $false ),
inference(orientation,[status(thm)],[compatible_is_verdict]) ).
fof(conflict_is_verdict,axiom,
is_verdict(conflict),
input ).
fof(conflict_is_verdict_0,plain,
( is_verdict(conflict)
| $false ),
inference(orientation,[status(thm)],[conflict_is_verdict]) ).
fof(axis_subsumes_def,axiom,
! [I1lo,I1hi,I2lo,I2hi] :
( axis_subsumes(I1lo,I1hi,I2lo,I2hi)
<=> ! [X] :
( in_closed(X,I1lo,I1hi)
=> in_closed(X,I2lo,I2hi) ) ),
input ).
fof(axis_subsumes_def_0,plain,
! [I1hi,I1lo,I2hi,I2lo] :
( axis_subsumes(I1lo,I1hi,I2lo,I2hi)
| ~ ! [X] :
( in_closed(X,I1lo,I1hi)
=> in_closed(X,I2lo,I2hi) ) ),
inference(orientation,[status(thm)],[axis_subsumes_def]) ).
fof(axis_subsumes_def_1,plain,
! [I1hi,I1lo,I2hi,I2lo] :
( ~ axis_subsumes(I1lo,I1hi,I2lo,I2hi)
| ! [X] :
( in_closed(X,I1lo,I1hi)
=> in_closed(X,I2lo,I2hi) ) ),
inference(orientation,[status(thm)],[axis_subsumes_def]) ).
fof(axis_compatible_def,axiom,
! [I1lo,I1hi,I2lo,I2hi] :
( axis_compatible(I1lo,I1hi,I2lo,I2hi)
<=> ? [X] :
( in_closed(X,I1lo,I1hi)
& in_closed(X,I2lo,I2hi) ) ),
input ).
fof(axis_compatible_def_0,plain,
! [I1hi,I1lo,I2hi,I2lo] :
( axis_compatible(I1lo,I1hi,I2lo,I2hi)
| ~ ? [X] :
( in_closed(X,I1lo,I1hi)
& in_closed(X,I2lo,I2hi) ) ),
inference(orientation,[status(thm)],[axis_compatible_def]) ).
fof(axis_compatible_def_1,plain,
! [I1hi,I1lo,I2hi,I2lo] :
( ~ axis_compatible(I1lo,I1hi,I2lo,I2hi)
| ? [X] :
( in_closed(X,I1lo,I1hi)
& in_closed(X,I2lo,I2hi) ) ),
inference(orientation,[status(thm)],[axis_compatible_def]) ).
fof(axis_conflict_def,axiom,
! [I1lo,I1hi,I2lo,I2hi] :
( axis_conflict(I1lo,I1hi,I2lo,I2hi)
<=> ~ ? [X] :
( in_closed(X,I1lo,I1hi)
& in_closed(X,I2lo,I2hi) ) ),
input ).
fof(axis_conflict_def_0,plain,
! [I1hi,I1lo,I2hi,I2lo] :
( axis_conflict(I1lo,I1hi,I2lo,I2hi)
| ? [X] :
( in_closed(X,I1lo,I1hi)
& in_closed(X,I2lo,I2hi) ) ),
inference(orientation,[status(thm)],[axis_conflict_def]) ).
fof(axis_conflict_def_1,plain,
! [I1hi,I1lo,I2hi,I2lo] :
( ~ axis_conflict(I1lo,I1hi,I2lo,I2hi)
| ~ ? [X] :
( in_closed(X,I1lo,I1hi)
& in_closed(X,I2lo,I2hi) ) ),
inference(orientation,[status(thm)],[axis_conflict_def]) ).
fof(in_open,axiom,
! [X,A,B] :
( in_open(X,A,B)
<=> ( less(A,X)
& less(X,B) ) ),
input ).
fof(in_open_0,plain,
! [A,B,X] :
( in_open(X,A,B)
| ~ ( less(A,X)
& less(X,B) ) ),
inference(orientation,[status(thm)],[in_open]) ).
fof(in_open_1,plain,
! [A,B,X] :
( ~ in_open(X,A,B)
| ( less(A,X)
& less(X,B) ) ),
inference(orientation,[status(thm)],[in_open]) ).
fof(in_ropen,axiom,
! [X,A,B] :
( in_ropen(X,A,B)
<=> ( leq(A,X)
& less(X,B) ) ),
input ).
fof(in_ropen_0,plain,
! [A,B,X] :
( in_ropen(X,A,B)
| ~ ( leq(A,X)
& less(X,B) ) ),
inference(orientation,[status(thm)],[in_ropen]) ).
fof(in_ropen_1,plain,
! [A,B,X] :
( ~ in_ropen(X,A,B)
| ( leq(A,X)
& less(X,B) ) ),
inference(orientation,[status(thm)],[in_ropen]) ).
fof(in_lopen,axiom,
! [X,A,B] :
( in_lopen(X,A,B)
<=> ( less(A,X)
& leq(X,B) ) ),
input ).
fof(in_lopen_0,plain,
! [A,B,X] :
( in_lopen(X,A,B)
| ~ ( less(A,X)
& leq(X,B) ) ),
inference(orientation,[status(thm)],[in_lopen]) ).
fof(in_lopen_1,plain,
! [A,B,X] :
( ~ in_lopen(X,A,B)
| ( less(A,X)
& leq(X,B) ) ),
inference(orientation,[status(thm)],[in_lopen]) ).
fof(in_closed,axiom,
! [X,A,B] :
( in_closed(X,A,B)
<=> ( leq(A,X)
& leq(X,B) ) ),
input ).
fof(in_closed_0,plain,
! [A,B,X] :
( in_closed(X,A,B)
| ~ ( leq(A,X)
& leq(X,B) ) ),
inference(orientation,[status(thm)],[in_closed]) ).
fof(in_closed_1,plain,
! [A,B,X] :
( ~ in_closed(X,A,B)
| ( leq(A,X)
& leq(X,B) ) ),
inference(orientation,[status(thm)],[in_closed]) ).
fof(xone_unknown,axiom,
! [Vm,Vr] :
( ( is_verdict(Vm)
& is_verdict(Vr)
& ~ ( Vm = compatible
& Vr = conflict )
& ~ ( Vm = conflict
& Vr = conflict ) )
=> xone_verdict(Vm,Vr) = unknown ),
input ).
fof(xone_unknown_0,plain,
! [Vm,Vr] :
( xone_verdict(Vm,Vr) = unknown
| ~ ( is_verdict(Vm)
& is_verdict(Vr)
& ~ ( Vm = compatible
& Vr = conflict )
& ~ ( Vm = conflict
& Vr = conflict ) ) ),
inference(orientation,[status(thm)],[xone_unknown]) ).
fof(xone_conflict,axiom,
! [Vm,Vr] :
( ( is_verdict(Vm)
& is_verdict(Vr)
& Vm = conflict
& Vr = conflict )
=> xone_verdict(Vm,Vr) = conflict ),
input ).
fof(xone_conflict_0,plain,
! [Vm,Vr] :
( xone_verdict(Vm,Vr) = conflict
| ~ ( is_verdict(Vm)
& is_verdict(Vr)
& Vm = conflict
& Vr = conflict ) ),
inference(orientation,[status(thm)],[xone_conflict]) ).
fof(xone_compat,axiom,
! [Vm,Vr] :
( ( is_verdict(Vm)
& is_verdict(Vr)
& Vm = compatible
& Vr = conflict )
=> xone_verdict(Vm,Vr) = compatible ),
input ).
fof(xone_compat_0,plain,
! [Vm,Vr] :
( xone_verdict(Vm,Vr) = compatible
| ~ ( is_verdict(Vm)
& is_verdict(Vr)
& Vm = compatible
& Vr = conflict ) ),
inference(orientation,[status(thm)],[xone_compat]) ).
fof(or_unknown,axiom,
! [V1,V2] :
( ( is_verdict(V1)
& is_verdict(V2)
& V1 != compatible
& V2 != compatible
& ~ ( V1 = conflict
& V2 = conflict ) )
=> or_verdict(V1,V2) = unknown ),
input ).
fof(or_unknown_0,plain,
! [V1,V2] :
( or_verdict(V1,V2) = unknown
| ~ ( is_verdict(V1)
& is_verdict(V2)
& V1 != compatible
& V2 != compatible
& ~ ( V1 = conflict
& V2 = conflict ) ) ),
inference(orientation,[status(thm)],[or_unknown]) ).
fof(or_conflict,axiom,
! [V1,V2] :
( ( is_verdict(V1)
& is_verdict(V2)
& V1 = conflict
& V2 = conflict )
=> or_verdict(V1,V2) = conflict ),
input ).
fof(or_conflict_0,plain,
! [V1,V2] :
( or_verdict(V1,V2) = conflict
| ~ ( is_verdict(V1)
& is_verdict(V2)
& V1 = conflict
& V2 = conflict ) ),
inference(orientation,[status(thm)],[or_conflict]) ).
fof(or_compat,axiom,
! [V1,V2] :
( ( is_verdict(V1)
& is_verdict(V2)
& ( V1 = compatible
| V2 = compatible ) )
=> or_verdict(V1,V2) = compatible ),
input ).
fof(or_compat_0,plain,
! [V1,V2] :
( or_verdict(V1,V2) = compatible
| ~ ( is_verdict(V1)
& is_verdict(V2)
& ( V1 = compatible
| V2 = compatible ) ) ),
inference(orientation,[status(thm)],[or_compat]) ).
fof(leq_trans,axiom,
! [X,Y,Z] :
( ( leq(X,Y)
& leq(Y,Z) )
=> leq(X,Z) ),
input ).
fof(leq_trans_0,plain,
! [X,Y,Z] :
( leq(X,Z)
| ~ ( leq(X,Y)
& leq(Y,Z) ) ),
inference(orientation,[status(thm)],[leq_trans]) ).
fof(less_leq_trans,axiom,
! [X,Y,Z] :
( ( less(X,Y)
& leq(Y,Z) )
=> less(X,Z) ),
input ).
fof(less_leq_trans_0,plain,
! [X,Y,Z] :
( less(X,Z)
| ~ ( less(X,Y)
& leq(Y,Z) ) ),
inference(orientation,[status(thm)],[less_leq_trans]) ).
fof(leq_less_trans,axiom,
! [X,Y,Z] :
( ( leq(X,Y)
& less(Y,Z) )
=> less(X,Z) ),
input ).
fof(leq_less_trans_0,plain,
! [X,Y,Z] :
( less(X,Z)
| ~ ( leq(X,Y)
& less(Y,Z) ) ),
inference(orientation,[status(thm)],[leq_less_trans]) ).
fof(less_implies_leq,axiom,
! [X,Y] :
( less(X,Y)
=> leq(X,Y) ),
input ).
fof(less_implies_leq_0,plain,
! [X,Y] :
( ~ less(X,Y)
| leq(X,Y) ),
inference(orientation,[status(thm)],[less_implies_leq]) ).
fof(leq_antisym,axiom,
! [X,Y] :
( ( leq(X,Y)
& leq(Y,X) )
=> X = Y ),
input ).
fof(leq_antisym_0,plain,
! [X,Y] :
( X = Y
| ~ ( leq(X,Y)
& leq(Y,X) ) ),
inference(orientation,[status(thm)],[leq_antisym]) ).
fof(leq_def,axiom,
! [X,Y] :
( leq(X,Y)
<=> ( less(X,Y)
| X = Y ) ),
input ).
fof(leq_def_0,plain,
! [X,Y] :
( leq(X,Y)
| ~ ( less(X,Y)
| X = Y ) ),
inference(orientation,[status(thm)],[leq_def]) ).
fof(leq_def_1,plain,
! [X,Y] :
( ~ leq(X,Y)
| less(X,Y)
| X = Y ),
inference(orientation,[status(thm)],[leq_def]) ).
fof(transitive,axiom,
! [X,Y,Z] :
( ( less(X,Y)
& less(Y,Z) )
=> less(X,Z) ),
input ).
fof(transitive_0,plain,
! [X,Y,Z] :
( less(X,Z)
| ~ ( less(X,Y)
& less(Y,Z) ) ),
inference(orientation,[status(thm)],[transitive]) ).
fof(irreflexive,axiom,
! [X] : ~ less(X,X),
input ).
fof(irreflexive_0,plain,
! [X] :
( ~ less(X,X)
| $false ),
inference(orientation,[status(thm)],[irreflexive]) ).
fof(def_lhs_atom1,axiom,
! [X] :
( lhs_atom1(X)
<=> ~ less(X,X) ),
inference(definition,[],[]) ).
fof(to_be_clausified_0,plain,
! [X] :
( lhs_atom1(X)
| $false ),
inference(fold_definition,[status(thm)],[irreflexive_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [Z,X] :
( lhs_atom2(Z,X)
<=> less(X,Z) ),
inference(definition,[],[]) ).
fof(to_be_clausified_1,plain,
! [X,Y,Z] :
( lhs_atom2(Z,X)
| ~ ( less(X,Y)
& less(Y,Z) ) ),
inference(fold_definition,[status(thm)],[transitive_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [Y,X] :
( lhs_atom3(Y,X)
<=> ~ leq(X,Y) ),
inference(definition,[],[]) ).
fof(to_be_clausified_2,plain,
! [X,Y] :
( lhs_atom3(Y,X)
| less(X,Y)
| X = Y ),
inference(fold_definition,[status(thm)],[leq_def_1,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [Y,X] :
( lhs_atom4(Y,X)
<=> leq(X,Y) ),
inference(definition,[],[]) ).
fof(to_be_clausified_3,plain,
! [X,Y] :
( lhs_atom4(Y,X)
| ~ ( less(X,Y)
| X = Y ) ),
inference(fold_definition,[status(thm)],[leq_def_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
! [Y,X] :
( lhs_atom5(Y,X)
<=> X = Y ),
inference(definition,[],[]) ).
fof(to_be_clausified_4,plain,
! [X,Y] :
( lhs_atom5(Y,X)
| ~ ( leq(X,Y)
& leq(Y,X) ) ),
inference(fold_definition,[status(thm)],[leq_antisym_0,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
! [Y,X] :
( lhs_atom6(Y,X)
<=> ~ less(X,Y) ),
inference(definition,[],[]) ).
fof(to_be_clausified_5,plain,
! [X,Y] :
( lhs_atom6(Y,X)
| leq(X,Y) ),
inference(fold_definition,[status(thm)],[less_implies_leq_0,def_lhs_atom6]) ).
fof(to_be_clausified_6,plain,
! [X,Y,Z] :
( lhs_atom2(Z,X)
| ~ ( leq(X,Y)
& less(Y,Z) ) ),
inference(fold_definition,[status(thm)],[leq_less_trans_0,def_lhs_atom2]) ).
fof(to_be_clausified_7,plain,
! [X,Y,Z] :
( lhs_atom2(Z,X)
| ~ ( less(X,Y)
& leq(Y,Z) ) ),
inference(fold_definition,[status(thm)],[less_leq_trans_0,def_lhs_atom2]) ).
fof(def_lhs_atom7,axiom,
! [Z,X] :
( lhs_atom7(Z,X)
<=> leq(X,Z) ),
inference(definition,[],[]) ).
fof(to_be_clausified_8,plain,
! [X,Y,Z] :
( lhs_atom7(Z,X)
| ~ ( leq(X,Y)
& leq(Y,Z) ) ),
inference(fold_definition,[status(thm)],[leq_trans_0,def_lhs_atom7]) ).
fof(def_lhs_atom8,axiom,
! [V2,V1] :
( lhs_atom8(V2,V1)
<=> or_verdict(V1,V2) = compatible ),
inference(definition,[],[]) ).
fof(to_be_clausified_9,plain,
! [V1,V2] :
( lhs_atom8(V2,V1)
| ~ ( is_verdict(V1)
& is_verdict(V2)
& ( V1 = compatible
| V2 = compatible ) ) ),
inference(fold_definition,[status(thm)],[or_compat_0,def_lhs_atom8]) ).
fof(def_lhs_atom9,axiom,
! [V2,V1] :
( lhs_atom9(V2,V1)
<=> or_verdict(V1,V2) = conflict ),
inference(definition,[],[]) ).
fof(to_be_clausified_10,plain,
! [V1,V2] :
( lhs_atom9(V2,V1)
| ~ ( is_verdict(V1)
& is_verdict(V2)
& V1 = conflict
& V2 = conflict ) ),
inference(fold_definition,[status(thm)],[or_conflict_0,def_lhs_atom9]) ).
fof(def_lhs_atom10,axiom,
! [V2,V1] :
( lhs_atom10(V2,V1)
<=> or_verdict(V1,V2) = unknown ),
inference(definition,[],[]) ).
fof(to_be_clausified_11,plain,
! [V1,V2] :
( lhs_atom10(V2,V1)
| ~ ( is_verdict(V1)
& is_verdict(V2)
& V1 != compatible
& V2 != compatible
& ~ ( V1 = conflict
& V2 = conflict ) ) ),
inference(fold_definition,[status(thm)],[or_unknown_0,def_lhs_atom10]) ).
fof(def_lhs_atom11,axiom,
! [Vr,Vm] :
( lhs_atom11(Vr,Vm)
<=> xone_verdict(Vm,Vr) = compatible ),
inference(definition,[],[]) ).
fof(to_be_clausified_12,plain,
! [Vm,Vr] :
( lhs_atom11(Vr,Vm)
| ~ ( is_verdict(Vm)
& is_verdict(Vr)
& Vm = compatible
& Vr = conflict ) ),
inference(fold_definition,[status(thm)],[xone_compat_0,def_lhs_atom11]) ).
fof(def_lhs_atom12,axiom,
! [Vr,Vm] :
( lhs_atom12(Vr,Vm)
<=> xone_verdict(Vm,Vr) = conflict ),
inference(definition,[],[]) ).
fof(to_be_clausified_13,plain,
! [Vm,Vr] :
( lhs_atom12(Vr,Vm)
| ~ ( is_verdict(Vm)
& is_verdict(Vr)
& Vm = conflict
& Vr = conflict ) ),
inference(fold_definition,[status(thm)],[xone_conflict_0,def_lhs_atom12]) ).
fof(def_lhs_atom13,axiom,
! [Vr,Vm] :
( lhs_atom13(Vr,Vm)
<=> xone_verdict(Vm,Vr) = unknown ),
inference(definition,[],[]) ).
fof(to_be_clausified_14,plain,
! [Vm,Vr] :
( lhs_atom13(Vr,Vm)
| ~ ( is_verdict(Vm)
& is_verdict(Vr)
& ~ ( Vm = compatible
& Vr = conflict )
& ~ ( Vm = conflict
& Vr = conflict ) ) ),
inference(fold_definition,[status(thm)],[xone_unknown_0,def_lhs_atom13]) ).
fof(def_lhs_atom14,axiom,
! [X,B,A] :
( lhs_atom14(X,B,A)
<=> ~ in_closed(X,A,B) ),
inference(definition,[],[]) ).
fof(to_be_clausified_15,plain,
! [A,B,X] :
( lhs_atom14(X,B,A)
| ( leq(A,X)
& leq(X,B) ) ),
inference(fold_definition,[status(thm)],[in_closed_1,def_lhs_atom14]) ).
fof(def_lhs_atom15,axiom,
! [X,B,A] :
( lhs_atom15(X,B,A)
<=> in_closed(X,A,B) ),
inference(definition,[],[]) ).
fof(to_be_clausified_16,plain,
! [A,B,X] :
( lhs_atom15(X,B,A)
| ~ ( leq(A,X)
& leq(X,B) ) ),
inference(fold_definition,[status(thm)],[in_closed_0,def_lhs_atom15]) ).
fof(def_lhs_atom16,axiom,
! [X,B,A] :
( lhs_atom16(X,B,A)
<=> ~ in_lopen(X,A,B) ),
inference(definition,[],[]) ).
fof(to_be_clausified_17,plain,
! [A,B,X] :
( lhs_atom16(X,B,A)
| ( less(A,X)
& leq(X,B) ) ),
inference(fold_definition,[status(thm)],[in_lopen_1,def_lhs_atom16]) ).
fof(def_lhs_atom17,axiom,
! [X,B,A] :
( lhs_atom17(X,B,A)
<=> in_lopen(X,A,B) ),
inference(definition,[],[]) ).
fof(to_be_clausified_18,plain,
! [A,B,X] :
( lhs_atom17(X,B,A)
| ~ ( less(A,X)
& leq(X,B) ) ),
inference(fold_definition,[status(thm)],[in_lopen_0,def_lhs_atom17]) ).
fof(def_lhs_atom18,axiom,
! [X,B,A] :
( lhs_atom18(X,B,A)
<=> ~ in_ropen(X,A,B) ),
inference(definition,[],[]) ).
fof(to_be_clausified_19,plain,
! [A,B,X] :
( lhs_atom18(X,B,A)
| ( leq(A,X)
& less(X,B) ) ),
inference(fold_definition,[status(thm)],[in_ropen_1,def_lhs_atom18]) ).
fof(def_lhs_atom19,axiom,
! [X,B,A] :
( lhs_atom19(X,B,A)
<=> in_ropen(X,A,B) ),
inference(definition,[],[]) ).
fof(to_be_clausified_20,plain,
! [A,B,X] :
( lhs_atom19(X,B,A)
| ~ ( leq(A,X)
& less(X,B) ) ),
inference(fold_definition,[status(thm)],[in_ropen_0,def_lhs_atom19]) ).
fof(def_lhs_atom20,axiom,
! [X,B,A] :
( lhs_atom20(X,B,A)
<=> ~ in_open(X,A,B) ),
inference(definition,[],[]) ).
fof(to_be_clausified_21,plain,
! [A,B,X] :
( lhs_atom20(X,B,A)
| ( less(A,X)
& less(X,B) ) ),
inference(fold_definition,[status(thm)],[in_open_1,def_lhs_atom20]) ).
fof(def_lhs_atom21,axiom,
! [X,B,A] :
( lhs_atom21(X,B,A)
<=> in_open(X,A,B) ),
inference(definition,[],[]) ).
fof(to_be_clausified_22,plain,
! [A,B,X] :
( lhs_atom21(X,B,A)
| ~ ( less(A,X)
& less(X,B) ) ),
inference(fold_definition,[status(thm)],[in_open_0,def_lhs_atom21]) ).
fof(def_lhs_atom22,axiom,
! [I2lo,I2hi,I1lo,I1hi] :
( lhs_atom22(I2lo,I2hi,I1lo,I1hi)
<=> ~ axis_conflict(I1lo,I1hi,I2lo,I2hi) ),
inference(definition,[],[]) ).
fof(to_be_clausified_23,plain,
! [I1hi,I1lo,I2hi,I2lo] :
( lhs_atom22(I2lo,I2hi,I1lo,I1hi)
| ~ ? [X] :
( in_closed(X,I1lo,I1hi)
& in_closed(X,I2lo,I2hi) ) ),
inference(fold_definition,[status(thm)],[axis_conflict_def_1,def_lhs_atom22]) ).
fof(def_lhs_atom23,axiom,
! [I2lo,I2hi,I1lo,I1hi] :
( lhs_atom23(I2lo,I2hi,I1lo,I1hi)
<=> axis_conflict(I1lo,I1hi,I2lo,I2hi) ),
inference(definition,[],[]) ).
fof(to_be_clausified_24,plain,
! [I1hi,I1lo,I2hi,I2lo] :
( lhs_atom23(I2lo,I2hi,I1lo,I1hi)
| ? [X] :
( in_closed(X,I1lo,I1hi)
& in_closed(X,I2lo,I2hi) ) ),
inference(fold_definition,[status(thm)],[axis_conflict_def_0,def_lhs_atom23]) ).
fof(def_lhs_atom24,axiom,
! [I2lo,I2hi,I1lo,I1hi] :
( lhs_atom24(I2lo,I2hi,I1lo,I1hi)
<=> ~ axis_compatible(I1lo,I1hi,I2lo,I2hi) ),
inference(definition,[],[]) ).
fof(to_be_clausified_25,plain,
! [I1hi,I1lo,I2hi,I2lo] :
( lhs_atom24(I2lo,I2hi,I1lo,I1hi)
| ? [X] :
( in_closed(X,I1lo,I1hi)
& in_closed(X,I2lo,I2hi) ) ),
inference(fold_definition,[status(thm)],[axis_compatible_def_1,def_lhs_atom24]) ).
fof(def_lhs_atom25,axiom,
! [I2lo,I2hi,I1lo,I1hi] :
( lhs_atom25(I2lo,I2hi,I1lo,I1hi)
<=> axis_compatible(I1lo,I1hi,I2lo,I2hi) ),
inference(definition,[],[]) ).
fof(to_be_clausified_26,plain,
! [I1hi,I1lo,I2hi,I2lo] :
( lhs_atom25(I2lo,I2hi,I1lo,I1hi)
| ~ ? [X] :
( in_closed(X,I1lo,I1hi)
& in_closed(X,I2lo,I2hi) ) ),
inference(fold_definition,[status(thm)],[axis_compatible_def_0,def_lhs_atom25]) ).
fof(def_lhs_atom26,axiom,
! [I2lo,I2hi,I1lo,I1hi] :
( lhs_atom26(I2lo,I2hi,I1lo,I1hi)
<=> ~ axis_subsumes(I1lo,I1hi,I2lo,I2hi) ),
inference(definition,[],[]) ).
fof(to_be_clausified_27,plain,
! [I1hi,I1lo,I2hi,I2lo] :
( lhs_atom26(I2lo,I2hi,I1lo,I1hi)
| ! [X] :
( in_closed(X,I1lo,I1hi)
=> in_closed(X,I2lo,I2hi) ) ),
inference(fold_definition,[status(thm)],[axis_subsumes_def_1,def_lhs_atom26]) ).
fof(def_lhs_atom27,axiom,
! [I2lo,I2hi,I1lo,I1hi] :
( lhs_atom27(I2lo,I2hi,I1lo,I1hi)
<=> axis_subsumes(I1lo,I1hi,I2lo,I2hi) ),
inference(definition,[],[]) ).
fof(to_be_clausified_28,plain,
! [I1hi,I1lo,I2hi,I2lo] :
( lhs_atom27(I2lo,I2hi,I1lo,I1hi)
| ~ ! [X] :
( in_closed(X,I1lo,I1hi)
=> in_closed(X,I2lo,I2hi) ) ),
inference(fold_definition,[status(thm)],[axis_subsumes_def_0,def_lhs_atom27]) ).
fof(def_lhs_atom28,axiom,
( lhs_atom28
<=> is_verdict(conflict) ),
inference(definition,[],[]) ).
fof(to_be_clausified_29,plain,
( lhs_atom28
| $false ),
inference(fold_definition,[status(thm)],[conflict_is_verdict_0,def_lhs_atom28]) ).
fof(def_lhs_atom29,axiom,
( lhs_atom29
<=> is_verdict(compatible) ),
inference(definition,[],[]) ).
fof(to_be_clausified_30,plain,
( lhs_atom29
| $false ),
inference(fold_definition,[status(thm)],[compatible_is_verdict_0,def_lhs_atom29]) ).
fof(def_lhs_atom30,axiom,
( lhs_atom30
<=> is_verdict(unknown) ),
inference(definition,[],[]) ).
fof(to_be_clausified_31,plain,
( lhs_atom30
| $false ),
inference(fold_definition,[status(thm)],[unknown_is_verdict_0,def_lhs_atom30]) ).
fof(def_lhs_atom31,axiom,
( lhs_atom31
<=> conflict != compatible ),
inference(definition,[],[]) ).
fof(to_be_clausified_32,plain,
( lhs_atom31
| $false ),
inference(fold_definition,[status(thm)],[verdicts_distinct_cf_cp_0,def_lhs_atom31]) ).
fof(def_lhs_atom32,axiom,
( lhs_atom32
<=> conflict != unknown ),
inference(definition,[],[]) ).
fof(to_be_clausified_33,plain,
( lhs_atom32
| $false ),
inference(fold_definition,[status(thm)],[verdicts_distinct_cf_un_0,def_lhs_atom32]) ).
fof(def_lhs_atom33,axiom,
( lhs_atom33
<=> compatible != unknown ),
inference(definition,[],[]) ).
fof(to_be_clausified_34,plain,
( lhs_atom33
| $false ),
inference(fold_definition,[status(thm)],[verdicts_distinct_cp_un_0,def_lhs_atom33]) ).
fof(def_lhs_atom34,axiom,
! [V] :
( lhs_atom34(V)
<=> ~ is_verdict(V) ),
inference(definition,[],[]) ).
fof(to_be_clausified_35,plain,
! [V] :
( lhs_atom34(V)
| V = conflict
| V = compatible
| V = unknown ),
inference(fold_definition,[status(thm)],[verdict_enum_0,def_lhs_atom34]) ).
fof(def_lhs_atom35,axiom,
! [V2,V1] :
( lhs_atom35(V2,V1)
<=> box_verdict(V1,V2) = conflict ),
inference(definition,[],[]) ).
fof(to_be_clausified_36,plain,
! [V1,V2] :
( lhs_atom35(V2,V1)
| ~ ( is_verdict(V1)
& is_verdict(V2)
& ( V1 = conflict
| V2 = conflict ) ) ),
inference(fold_definition,[status(thm)],[box_conflict_0,def_lhs_atom35]) ).
fof(def_lhs_atom36,axiom,
! [V2,V1] :
( lhs_atom36(V2,V1)
<=> box_verdict(V1,V2) = compatible ),
inference(definition,[],[]) ).
fof(to_be_clausified_37,plain,
! [V1,V2] :
( lhs_atom36(V2,V1)
| ~ ( is_verdict(V1)
& is_verdict(V2)
& V1 = compatible
& V2 = compatible ) ),
inference(fold_definition,[status(thm)],[box_compatible_0,def_lhs_atom36]) ).
fof(def_lhs_atom37,axiom,
! [V2,V1] :
( lhs_atom37(V2,V1)
<=> box_verdict(V1,V2) = unknown ),
inference(definition,[],[]) ).
fof(to_be_clausified_38,plain,
! [V1,V2] :
( lhs_atom37(V2,V1)
| ~ ( is_verdict(V1)
& is_verdict(V2)
& ( V1 = unknown
| V2 = unknown )
& V1 != conflict
& V2 != conflict ) ),
inference(fold_definition,[status(thm)],[box_unknown_0,def_lhs_atom37]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X10,X11,X12,X13] :
( lhs_atom27(X10,X11,X12,X13)
| ~ ! [X1] :
( in_closed(X1,X12,X13)
=> in_closed(X1,X10,X11) ) ),
file('<stdin>',to_be_clausified_28) ).
fof(c_0_1,axiom,
! [X10,X11,X12,X13] :
( lhs_atom24(X10,X11,X12,X13)
| ? [X1] :
( in_closed(X1,X12,X13)
& in_closed(X1,X10,X11) ) ),
file('<stdin>',to_be_clausified_25) ).
fof(c_0_2,axiom,
! [X10,X11,X12,X13] :
( lhs_atom23(X10,X11,X12,X13)
| ? [X1] :
( in_closed(X1,X12,X13)
& in_closed(X1,X10,X11) ) ),
file('<stdin>',to_be_clausified_24) ).
fof(c_0_3,axiom,
! [X10,X11,X12,X13] :
( lhs_atom25(X10,X11,X12,X13)
| ~ ? [X1] :
( in_closed(X1,X12,X13)
& in_closed(X1,X10,X11) ) ),
file('<stdin>',to_be_clausified_26) ).
fof(c_0_4,axiom,
! [X10,X11,X12,X13] :
( lhs_atom22(X10,X11,X12,X13)
| ~ ? [X1] :
( in_closed(X1,X12,X13)
& in_closed(X1,X10,X11) ) ),
file('<stdin>',to_be_clausified_23) ).
fof(c_0_5,axiom,
! [X10,X11,X12,X13] :
( lhs_atom26(X10,X11,X12,X13)
| ! [X1] :
( in_closed(X1,X12,X13)
=> in_closed(X1,X10,X11) ) ),
file('<stdin>',to_be_clausified_27) ).
fof(c_0_6,axiom,
! [X1,X8,X9] :
( lhs_atom21(X1,X8,X9)
| ~ ( less(X9,X1)
& less(X1,X8) ) ),
file('<stdin>',to_be_clausified_22) ).
fof(c_0_7,axiom,
! [X1,X8,X9] :
( lhs_atom19(X1,X8,X9)
| ~ ( leq(X9,X1)
& less(X1,X8) ) ),
file('<stdin>',to_be_clausified_20) ).
fof(c_0_8,axiom,
! [X1,X8,X9] :
( lhs_atom17(X1,X8,X9)
| ~ ( less(X9,X1)
& leq(X1,X8) ) ),
file('<stdin>',to_be_clausified_18) ).
fof(c_0_9,axiom,
! [X1,X8,X9] :
( lhs_atom15(X1,X8,X9)
| ~ ( leq(X9,X1)
& leq(X1,X8) ) ),
file('<stdin>',to_be_clausified_16) ).
fof(c_0_10,axiom,
! [X1,X8,X9] :
( lhs_atom20(X1,X8,X9)
| ( less(X9,X1)
& less(X1,X8) ) ),
file('<stdin>',to_be_clausified_21) ).
fof(c_0_11,axiom,
! [X1,X8,X9] :
( lhs_atom18(X1,X8,X9)
| ( leq(X9,X1)
& less(X1,X8) ) ),
file('<stdin>',to_be_clausified_19) ).
fof(c_0_12,axiom,
! [X1,X8,X9] :
( lhs_atom16(X1,X8,X9)
| ( less(X9,X1)
& leq(X1,X8) ) ),
file('<stdin>',to_be_clausified_17) ).
fof(c_0_13,axiom,
! [X1,X8,X9] :
( lhs_atom14(X1,X8,X9)
| ( leq(X9,X1)
& leq(X1,X8) ) ),
file('<stdin>',to_be_clausified_15) ).
fof(c_0_14,axiom,
! [X2,X3,X1] :
( lhs_atom7(X2,X1)
| ~ ( leq(X1,X3)
& leq(X3,X2) ) ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_15,axiom,
! [X2,X3,X1] :
( lhs_atom2(X2,X1)
| ~ ( less(X1,X3)
& leq(X3,X2) ) ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_16,axiom,
! [X2,X3,X1] :
( lhs_atom2(X2,X1)
| ~ ( leq(X1,X3)
& less(X3,X2) ) ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_17,axiom,
! [X3,X1] :
( lhs_atom5(X3,X1)
| ~ ( leq(X1,X3)
& leq(X3,X1) ) ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_18,axiom,
! [X2,X3,X1] :
( lhs_atom2(X2,X1)
| ~ ( less(X1,X3)
& less(X3,X2) ) ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_19,axiom,
! [X3,X1] :
( lhs_atom4(X3,X1)
| ~ ( less(X1,X3)
| X1 = X3 ) ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_20,axiom,
! [X4,X5] :
( lhs_atom37(X4,X5)
| ~ ( is_verdict(X5)
& is_verdict(X4)
& ( X5 = unknown
| X4 = unknown )
& X5 != conflict
& X4 != conflict ) ),
file('<stdin>',to_be_clausified_38) ).
fof(c_0_21,axiom,
! [X4,X5] :
( lhs_atom36(X4,X5)
| ~ ( is_verdict(X5)
& is_verdict(X4)
& X5 = compatible
& X4 = compatible ) ),
file('<stdin>',to_be_clausified_37) ).
fof(c_0_22,axiom,
! [X6,X7] :
( lhs_atom12(X6,X7)
| ~ ( is_verdict(X7)
& is_verdict(X6)
& X7 = conflict
& X6 = conflict ) ),
file('<stdin>',to_be_clausified_13) ).
fof(c_0_23,axiom,
! [X6,X7] :
( lhs_atom11(X6,X7)
| ~ ( is_verdict(X7)
& is_verdict(X6)
& X7 = compatible
& X6 = conflict ) ),
file('<stdin>',to_be_clausified_12) ).
fof(c_0_24,axiom,
! [X4,X5] :
( lhs_atom9(X4,X5)
| ~ ( is_verdict(X5)
& is_verdict(X4)
& X5 = conflict
& X4 = conflict ) ),
file('<stdin>',to_be_clausified_10) ).
fof(c_0_25,axiom,
! [X4,X5] :
( lhs_atom10(X4,X5)
| ~ ( is_verdict(X5)
& is_verdict(X4)
& X5 != compatible
& X4 != compatible
& ~ ( X5 = conflict
& X4 = conflict ) ) ),
file('<stdin>',to_be_clausified_11) ).
fof(c_0_26,axiom,
! [X6,X7] :
( lhs_atom13(X6,X7)
| ~ ( is_verdict(X7)
& is_verdict(X6)
& ~ ( X7 = compatible
& X6 = conflict )
& ~ ( X7 = conflict
& X6 = conflict ) ) ),
file('<stdin>',to_be_clausified_14) ).
fof(c_0_27,axiom,
! [X4,X5] :
( lhs_atom35(X4,X5)
| ~ ( is_verdict(X5)
& is_verdict(X4)
& ( X5 = conflict
| X4 = conflict ) ) ),
file('<stdin>',to_be_clausified_36) ).
fof(c_0_28,axiom,
! [X4,X5] :
( lhs_atom8(X4,X5)
| ~ ( is_verdict(X5)
& is_verdict(X4)
& ( X5 = compatible
| X4 = compatible ) ) ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_29,axiom,
! [X3,X1] :
( lhs_atom3(X3,X1)
| less(X1,X3)
| X1 = X3 ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_30,axiom,
! [X3,X1] :
( lhs_atom6(X3,X1)
| leq(X1,X3) ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_31,axiom,
! [X14] :
( lhs_atom34(X14)
| X14 = conflict
| X14 = compatible
| X14 = unknown ),
file('<stdin>',to_be_clausified_35) ).
fof(c_0_32,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_33,axiom,
( lhs_atom33
| ~ $true ),
file('<stdin>',to_be_clausified_34) ).
fof(c_0_34,axiom,
( lhs_atom32
| ~ $true ),
file('<stdin>',to_be_clausified_33) ).
fof(c_0_35,axiom,
( lhs_atom31
| ~ $true ),
file('<stdin>',to_be_clausified_32) ).
fof(c_0_36,axiom,
( lhs_atom30
| ~ $true ),
file('<stdin>',to_be_clausified_31) ).
fof(c_0_37,axiom,
( lhs_atom29
| ~ $true ),
file('<stdin>',to_be_clausified_30) ).
fof(c_0_38,axiom,
( lhs_atom28
| ~ $true ),
file('<stdin>',to_be_clausified_29) ).
fof(c_0_39,axiom,
! [X10,X11,X12,X13] :
( lhs_atom27(X10,X11,X12,X13)
| ~ ! [X1] :
( in_closed(X1,X12,X13)
=> in_closed(X1,X10,X11) ) ),
c_0_0 ).
fof(c_0_40,axiom,
! [X10,X11,X12,X13] :
( lhs_atom24(X10,X11,X12,X13)
| ? [X1] :
( in_closed(X1,X12,X13)
& in_closed(X1,X10,X11) ) ),
c_0_1 ).
fof(c_0_41,axiom,
! [X10,X11,X12,X13] :
( lhs_atom23(X10,X11,X12,X13)
| ? [X1] :
( in_closed(X1,X12,X13)
& in_closed(X1,X10,X11) ) ),
c_0_2 ).
fof(c_0_42,axiom,
! [X10,X11,X12,X13] :
( lhs_atom25(X10,X11,X12,X13)
| ~ ? [X1] :
( in_closed(X1,X12,X13)
& in_closed(X1,X10,X11) ) ),
c_0_3 ).
fof(c_0_43,axiom,
! [X10,X11,X12,X13] :
( lhs_atom22(X10,X11,X12,X13)
| ~ ? [X1] :
( in_closed(X1,X12,X13)
& in_closed(X1,X10,X11) ) ),
c_0_4 ).
fof(c_0_44,axiom,
! [X10,X11,X12,X13] :
( lhs_atom26(X10,X11,X12,X13)
| ! [X1] :
( in_closed(X1,X12,X13)
=> in_closed(X1,X10,X11) ) ),
c_0_5 ).
fof(c_0_45,axiom,
! [X1,X8,X9] :
( lhs_atom21(X1,X8,X9)
| ~ ( less(X9,X1)
& less(X1,X8) ) ),
c_0_6 ).
fof(c_0_46,axiom,
! [X1,X8,X9] :
( lhs_atom19(X1,X8,X9)
| ~ ( leq(X9,X1)
& less(X1,X8) ) ),
c_0_7 ).
fof(c_0_47,axiom,
! [X1,X8,X9] :
( lhs_atom17(X1,X8,X9)
| ~ ( less(X9,X1)
& leq(X1,X8) ) ),
c_0_8 ).
fof(c_0_48,axiom,
! [X1,X8,X9] :
( lhs_atom15(X1,X8,X9)
| ~ ( leq(X9,X1)
& leq(X1,X8) ) ),
c_0_9 ).
fof(c_0_49,axiom,
! [X1,X8,X9] :
( lhs_atom20(X1,X8,X9)
| ( less(X9,X1)
& less(X1,X8) ) ),
c_0_10 ).
fof(c_0_50,axiom,
! [X1,X8,X9] :
( lhs_atom18(X1,X8,X9)
| ( leq(X9,X1)
& less(X1,X8) ) ),
c_0_11 ).
fof(c_0_51,axiom,
! [X1,X8,X9] :
( lhs_atom16(X1,X8,X9)
| ( less(X9,X1)
& leq(X1,X8) ) ),
c_0_12 ).
fof(c_0_52,axiom,
! [X1,X8,X9] :
( lhs_atom14(X1,X8,X9)
| ( leq(X9,X1)
& leq(X1,X8) ) ),
c_0_13 ).
fof(c_0_53,axiom,
! [X2,X3,X1] :
( lhs_atom7(X2,X1)
| ~ ( leq(X1,X3)
& leq(X3,X2) ) ),
c_0_14 ).
fof(c_0_54,axiom,
! [X2,X3,X1] :
( lhs_atom2(X2,X1)
| ~ ( less(X1,X3)
& leq(X3,X2) ) ),
c_0_15 ).
fof(c_0_55,axiom,
! [X2,X3,X1] :
( lhs_atom2(X2,X1)
| ~ ( leq(X1,X3)
& less(X3,X2) ) ),
c_0_16 ).
fof(c_0_56,axiom,
! [X3,X1] :
( lhs_atom5(X3,X1)
| ~ ( leq(X1,X3)
& leq(X3,X1) ) ),
c_0_17 ).
fof(c_0_57,axiom,
! [X2,X3,X1] :
( lhs_atom2(X2,X1)
| ~ ( less(X1,X3)
& less(X3,X2) ) ),
c_0_18 ).
fof(c_0_58,axiom,
! [X3,X1] :
( lhs_atom4(X3,X1)
| ~ ( less(X1,X3)
| X1 = X3 ) ),
c_0_19 ).
fof(c_0_59,axiom,
! [X4,X5] :
( lhs_atom37(X4,X5)
| ~ ( is_verdict(X5)
& is_verdict(X4)
& ( X5 = unknown
| X4 = unknown )
& X5 != conflict
& X4 != conflict ) ),
c_0_20 ).
fof(c_0_60,axiom,
! [X4,X5] :
( lhs_atom36(X4,X5)
| ~ ( is_verdict(X5)
& is_verdict(X4)
& X5 = compatible
& X4 = compatible ) ),
c_0_21 ).
fof(c_0_61,axiom,
! [X6,X7] :
( lhs_atom12(X6,X7)
| ~ ( is_verdict(X7)
& is_verdict(X6)
& X7 = conflict
& X6 = conflict ) ),
c_0_22 ).
fof(c_0_62,axiom,
! [X6,X7] :
( lhs_atom11(X6,X7)
| ~ ( is_verdict(X7)
& is_verdict(X6)
& X7 = compatible
& X6 = conflict ) ),
c_0_23 ).
fof(c_0_63,axiom,
! [X4,X5] :
( lhs_atom9(X4,X5)
| ~ ( is_verdict(X5)
& is_verdict(X4)
& X5 = conflict
& X4 = conflict ) ),
c_0_24 ).
fof(c_0_64,axiom,
! [X4,X5] :
( lhs_atom10(X4,X5)
| ~ ( is_verdict(X5)
& is_verdict(X4)
& X5 != compatible
& X4 != compatible
& ~ ( X5 = conflict
& X4 = conflict ) ) ),
c_0_25 ).
fof(c_0_65,axiom,
! [X6,X7] :
( lhs_atom13(X6,X7)
| ~ ( is_verdict(X7)
& is_verdict(X6)
& ~ ( X7 = compatible
& X6 = conflict )
& ~ ( X7 = conflict
& X6 = conflict ) ) ),
c_0_26 ).
fof(c_0_66,axiom,
! [X4,X5] :
( lhs_atom35(X4,X5)
| ~ ( is_verdict(X5)
& is_verdict(X4)
& ( X5 = conflict
| X4 = conflict ) ) ),
c_0_27 ).
fof(c_0_67,axiom,
! [X4,X5] :
( lhs_atom8(X4,X5)
| ~ ( is_verdict(X5)
& is_verdict(X4)
& ( X5 = compatible
| X4 = compatible ) ) ),
c_0_28 ).
fof(c_0_68,axiom,
! [X3,X1] :
( lhs_atom3(X3,X1)
| less(X1,X3)
| X1 = X3 ),
c_0_29 ).
fof(c_0_69,axiom,
! [X3,X1] :
( lhs_atom6(X3,X1)
| leq(X1,X3) ),
c_0_30 ).
fof(c_0_70,axiom,
! [X14] :
( lhs_atom34(X14)
| X14 = conflict
| X14 = compatible
| X14 = unknown ),
c_0_31 ).
fof(c_0_71,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_32]) ).
fof(c_0_72,plain,
lhs_atom33,
inference(fof_simplification,[status(thm)],[c_0_33]) ).
fof(c_0_73,plain,
lhs_atom32,
inference(fof_simplification,[status(thm)],[c_0_34]) ).
fof(c_0_74,plain,
lhs_atom31,
inference(fof_simplification,[status(thm)],[c_0_35]) ).
fof(c_0_75,plain,
lhs_atom30,
inference(fof_simplification,[status(thm)],[c_0_36]) ).
fof(c_0_76,plain,
lhs_atom29,
inference(fof_simplification,[status(thm)],[c_0_37]) ).
fof(c_0_77,plain,
lhs_atom28,
inference(fof_simplification,[status(thm)],[c_0_38]) ).
fof(c_0_78,plain,
! [X14,X15,X16,X17] :
( ( in_closed(esk3_4(X14,X15,X16,X17),X16,X17)
| lhs_atom27(X14,X15,X16,X17) )
& ( ~ in_closed(esk3_4(X14,X15,X16,X17),X14,X15)
| lhs_atom27(X14,X15,X16,X17) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])])])]) ).
fof(c_0_79,plain,
! [X14,X15,X16,X17] :
( ( in_closed(esk2_4(X14,X15,X16,X17),X16,X17)
| lhs_atom24(X14,X15,X16,X17) )
& ( in_closed(esk2_4(X14,X15,X16,X17),X14,X15)
| lhs_atom24(X14,X15,X16,X17) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_40])])]) ).
fof(c_0_80,plain,
! [X14,X15,X16,X17] :
( ( in_closed(esk1_4(X14,X15,X16,X17),X16,X17)
| lhs_atom23(X14,X15,X16,X17) )
& ( in_closed(esk1_4(X14,X15,X16,X17),X14,X15)
| lhs_atom23(X14,X15,X16,X17) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_41])])]) ).
fof(c_0_81,plain,
! [X14,X15,X16,X17,X18] :
( lhs_atom25(X14,X15,X16,X17)
| ~ in_closed(X18,X16,X17)
| ~ in_closed(X18,X14,X15) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])])]) ).
fof(c_0_82,plain,
! [X14,X15,X16,X17,X18] :
( lhs_atom22(X14,X15,X16,X17)
| ~ in_closed(X18,X16,X17)
| ~ in_closed(X18,X14,X15) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])])]) ).
fof(c_0_83,plain,
! [X14,X15,X16,X17,X18] :
( lhs_atom26(X14,X15,X16,X17)
| ~ in_closed(X18,X16,X17)
| in_closed(X18,X14,X15) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_44])])]) ).
fof(c_0_84,plain,
! [X10,X11,X12] :
( lhs_atom21(X10,X11,X12)
| ~ less(X12,X10)
| ~ less(X10,X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])]) ).
fof(c_0_85,plain,
! [X10,X11,X12] :
( lhs_atom19(X10,X11,X12)
| ~ leq(X12,X10)
| ~ less(X10,X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])]) ).
fof(c_0_86,plain,
! [X10,X11,X12] :
( lhs_atom17(X10,X11,X12)
| ~ less(X12,X10)
| ~ leq(X10,X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_47])]) ).
fof(c_0_87,plain,
! [X10,X11,X12] :
( lhs_atom15(X10,X11,X12)
| ~ leq(X12,X10)
| ~ leq(X10,X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_48])]) ).
fof(c_0_88,plain,
! [X10,X11,X12] :
( ( less(X12,X10)
| lhs_atom20(X10,X11,X12) )
& ( less(X10,X11)
| lhs_atom20(X10,X11,X12) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_49])]) ).
fof(c_0_89,plain,
! [X10,X11,X12] :
( ( leq(X12,X10)
| lhs_atom18(X10,X11,X12) )
& ( less(X10,X11)
| lhs_atom18(X10,X11,X12) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_50])]) ).
fof(c_0_90,plain,
! [X10,X11,X12] :
( ( less(X12,X10)
| lhs_atom16(X10,X11,X12) )
& ( leq(X10,X11)
| lhs_atom16(X10,X11,X12) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_51])]) ).
fof(c_0_91,plain,
! [X10,X11,X12] :
( ( leq(X12,X10)
| lhs_atom14(X10,X11,X12) )
& ( leq(X10,X11)
| lhs_atom14(X10,X11,X12) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_52])]) ).
fof(c_0_92,plain,
! [X4,X5,X6] :
( lhs_atom7(X4,X6)
| ~ leq(X6,X5)
| ~ leq(X5,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_53])]) ).
fof(c_0_93,plain,
! [X4,X5,X6] :
( lhs_atom2(X4,X6)
| ~ less(X6,X5)
| ~ leq(X5,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_54])]) ).
fof(c_0_94,plain,
! [X4,X5,X6] :
( lhs_atom2(X4,X6)
| ~ leq(X6,X5)
| ~ less(X5,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_55])]) ).
fof(c_0_95,plain,
! [X4,X5] :
( lhs_atom5(X4,X5)
| ~ leq(X5,X4)
| ~ leq(X4,X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_56])]) ).
fof(c_0_96,plain,
! [X4,X5,X6] :
( lhs_atom2(X4,X6)
| ~ less(X6,X5)
| ~ less(X5,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_57])]) ).
fof(c_0_97,plain,
! [X4,X5] :
( ( ~ less(X5,X4)
| lhs_atom4(X4,X5) )
& ( X5 != X4
| lhs_atom4(X4,X5) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_58])])]) ).
fof(c_0_98,plain,
! [X6,X7] :
( ( X7 != unknown
| X7 = conflict
| X6 = conflict
| ~ is_verdict(X6)
| ~ is_verdict(X7)
| lhs_atom37(X6,X7) )
& ( X6 != unknown
| X7 = conflict
| X6 = conflict
| ~ is_verdict(X6)
| ~ is_verdict(X7)
| lhs_atom37(X6,X7) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_59])])]) ).
fof(c_0_99,plain,
! [X6,X7] :
( lhs_atom36(X6,X7)
| ~ is_verdict(X7)
| ~ is_verdict(X6)
| X7 != compatible
| X6 != compatible ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_60])]) ).
fof(c_0_100,plain,
! [X8,X9] :
( lhs_atom12(X8,X9)
| ~ is_verdict(X9)
| ~ is_verdict(X8)
| X9 != conflict
| X8 != conflict ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_61])]) ).
fof(c_0_101,plain,
! [X8,X9] :
( lhs_atom11(X8,X9)
| ~ is_verdict(X9)
| ~ is_verdict(X8)
| X9 != compatible
| X8 != conflict ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_62])]) ).
fof(c_0_102,plain,
! [X6,X7] :
( lhs_atom9(X6,X7)
| ~ is_verdict(X7)
| ~ is_verdict(X6)
| X7 != conflict
| X6 != conflict ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_63])]) ).
fof(c_0_103,plain,
! [X6,X7] :
( ( X7 = conflict
| X6 = compatible
| X7 = compatible
| ~ is_verdict(X6)
| ~ is_verdict(X7)
| lhs_atom10(X6,X7) )
& ( X6 = conflict
| X6 = compatible
| X7 = compatible
| ~ is_verdict(X6)
| ~ is_verdict(X7)
| lhs_atom10(X6,X7) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_64])])]) ).
fof(c_0_104,plain,
! [X8,X9] :
( ( X9 = conflict
| X9 = compatible
| ~ is_verdict(X8)
| ~ is_verdict(X9)
| lhs_atom13(X8,X9) )
& ( X8 = conflict
| X9 = compatible
| ~ is_verdict(X8)
| ~ is_verdict(X9)
| lhs_atom13(X8,X9) )
& ( X9 = conflict
| X8 = conflict
| ~ is_verdict(X8)
| ~ is_verdict(X9)
| lhs_atom13(X8,X9) )
& ( X8 = conflict
| X8 = conflict
| ~ is_verdict(X8)
| ~ is_verdict(X9)
| lhs_atom13(X8,X9) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_65])])]) ).
fof(c_0_105,plain,
! [X6,X7] :
( ( X7 != conflict
| ~ is_verdict(X6)
| ~ is_verdict(X7)
| lhs_atom35(X6,X7) )
& ( X6 != conflict
| ~ is_verdict(X6)
| ~ is_verdict(X7)
| lhs_atom35(X6,X7) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_66])])]) ).
fof(c_0_106,plain,
! [X6,X7] :
( ( X7 != compatible
| ~ is_verdict(X6)
| ~ is_verdict(X7)
| lhs_atom8(X6,X7) )
& ( X6 != compatible
| ~ is_verdict(X6)
| ~ is_verdict(X7)
| lhs_atom8(X6,X7) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_67])])]) ).
fof(c_0_107,plain,
! [X4,X5] :
( lhs_atom3(X4,X5)
| less(X5,X4)
| X5 = X4 ),
inference(variable_rename,[status(thm)],[c_0_68]) ).
fof(c_0_108,plain,
! [X4,X5] :
( lhs_atom6(X4,X5)
| leq(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_69]) ).
fof(c_0_109,plain,
! [X15] :
( lhs_atom34(X15)
| X15 = conflict
| X15 = compatible
| X15 = unknown ),
inference(variable_rename,[status(thm)],[c_0_70]) ).
fof(c_0_110,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_71]) ).
fof(c_0_111,plain,
lhs_atom33,
c_0_72 ).
fof(c_0_112,plain,
lhs_atom32,
c_0_73 ).
fof(c_0_113,plain,
lhs_atom31,
c_0_74 ).
fof(c_0_114,plain,
lhs_atom30,
c_0_75 ).
fof(c_0_115,plain,
lhs_atom29,
c_0_76 ).
fof(c_0_116,plain,
lhs_atom28,
c_0_77 ).
cnf(c_0_117,plain,
( lhs_atom27(X1,X2,X3,X4)
| ~ in_closed(esk3_4(X1,X2,X3,X4),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_118,plain,
( lhs_atom27(X1,X2,X3,X4)
| in_closed(esk3_4(X1,X2,X3,X4),X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_119,plain,
( lhs_atom24(X1,X2,X3,X4)
| in_closed(esk2_4(X1,X2,X3,X4),X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_120,plain,
( lhs_atom24(X1,X2,X3,X4)
| in_closed(esk2_4(X1,X2,X3,X4),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_121,plain,
( lhs_atom23(X1,X2,X3,X4)
| in_closed(esk1_4(X1,X2,X3,X4),X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_122,plain,
( lhs_atom23(X1,X2,X3,X4)
| in_closed(esk1_4(X1,X2,X3,X4),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_123,plain,
( lhs_atom25(X2,X3,X4,X5)
| ~ in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_81]) ).
cnf(c_0_124,plain,
( lhs_atom22(X2,X3,X4,X5)
| ~ in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_125,plain,
( in_closed(X1,X2,X3)
| lhs_atom26(X2,X3,X4,X5)
| ~ in_closed(X1,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_126,plain,
( lhs_atom21(X1,X2,X3)
| ~ less(X1,X2)
| ~ less(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_127,plain,
( lhs_atom19(X1,X2,X3)
| ~ less(X1,X2)
| ~ leq(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_128,plain,
( lhs_atom17(X1,X2,X3)
| ~ leq(X1,X2)
| ~ less(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_129,plain,
( lhs_atom15(X1,X2,X3)
| ~ leq(X1,X2)
| ~ leq(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_130,plain,
( lhs_atom20(X1,X2,X3)
| less(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_131,plain,
( lhs_atom20(X1,X2,X3)
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_132,plain,
( lhs_atom18(X1,X2,X3)
| leq(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_133,plain,
( lhs_atom18(X1,X2,X3)
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_134,plain,
( lhs_atom16(X1,X2,X3)
| less(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_135,plain,
( lhs_atom16(X1,X2,X3)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_136,plain,
( lhs_atom14(X1,X2,X3)
| leq(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_137,plain,
( lhs_atom14(X1,X2,X3)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_138,plain,
( lhs_atom7(X2,X3)
| ~ leq(X1,X2)
| ~ leq(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_139,plain,
( lhs_atom2(X2,X3)
| ~ leq(X1,X2)
| ~ less(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_93]) ).
cnf(c_0_140,plain,
( lhs_atom2(X2,X3)
| ~ less(X1,X2)
| ~ leq(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_141,plain,
( lhs_atom5(X1,X2)
| ~ leq(X1,X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_142,plain,
( lhs_atom2(X2,X3)
| ~ less(X1,X2)
| ~ less(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_143,plain,
( lhs_atom4(X1,X2)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_144,plain,
( lhs_atom37(X1,X2)
| X1 = conflict
| X2 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X2 != unknown ),
inference(split_conjunct,[status(thm)],[c_0_98]) ).
cnf(c_0_145,plain,
( lhs_atom37(X1,X2)
| X1 = conflict
| X2 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X1 != unknown ),
inference(split_conjunct,[status(thm)],[c_0_98]) ).
cnf(c_0_146,plain,
( lhs_atom36(X1,X2)
| X1 != compatible
| X2 != compatible
| ~ is_verdict(X1)
| ~ is_verdict(X2) ),
inference(split_conjunct,[status(thm)],[c_0_99]) ).
cnf(c_0_147,plain,
( lhs_atom12(X1,X2)
| X1 != conflict
| X2 != conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2) ),
inference(split_conjunct,[status(thm)],[c_0_100]) ).
cnf(c_0_148,plain,
( lhs_atom11(X1,X2)
| X1 != conflict
| X2 != compatible
| ~ is_verdict(X1)
| ~ is_verdict(X2) ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_149,plain,
( lhs_atom9(X1,X2)
| X1 != conflict
| X2 != conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2) ),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_150,plain,
( lhs_atom10(X1,X2)
| X2 = compatible
| X1 = compatible
| X2 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_151,plain,
( lhs_atom10(X1,X2)
| X2 = compatible
| X1 = compatible
| X1 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_152,plain,
( lhs_atom13(X1,X2)
| X2 = compatible
| X2 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_153,plain,
( lhs_atom13(X1,X2)
| X2 = compatible
| X1 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_154,plain,
( lhs_atom13(X1,X2)
| X1 = conflict
| X2 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_155,plain,
( lhs_atom13(X1,X2)
| X1 = conflict
| X1 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_156,plain,
( lhs_atom35(X1,X2)
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X2 != conflict ),
inference(split_conjunct,[status(thm)],[c_0_105]) ).
cnf(c_0_157,plain,
( lhs_atom35(X1,X2)
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X1 != conflict ),
inference(split_conjunct,[status(thm)],[c_0_105]) ).
cnf(c_0_158,plain,
( lhs_atom8(X1,X2)
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X2 != compatible ),
inference(split_conjunct,[status(thm)],[c_0_106]) ).
cnf(c_0_159,plain,
( lhs_atom8(X1,X2)
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X1 != compatible ),
inference(split_conjunct,[status(thm)],[c_0_106]) ).
cnf(c_0_160,plain,
( X1 = X2
| less(X1,X2)
| lhs_atom3(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_107]) ).
cnf(c_0_161,plain,
( leq(X1,X2)
| lhs_atom6(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_108]) ).
cnf(c_0_162,plain,
( lhs_atom4(X1,X2)
| X2 != X1 ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_163,plain,
( X1 = unknown
| X1 = compatible
| X1 = conflict
| lhs_atom34(X1) ),
inference(split_conjunct,[status(thm)],[c_0_109]) ).
cnf(c_0_164,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_165,plain,
lhs_atom33,
inference(split_conjunct,[status(thm)],[c_0_111]) ).
cnf(c_0_166,plain,
lhs_atom32,
inference(split_conjunct,[status(thm)],[c_0_112]) ).
cnf(c_0_167,plain,
lhs_atom31,
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_168,plain,
lhs_atom30,
inference(split_conjunct,[status(thm)],[c_0_114]) ).
cnf(c_0_169,plain,
lhs_atom29,
inference(split_conjunct,[status(thm)],[c_0_115]) ).
cnf(c_0_170,plain,
lhs_atom28,
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_171,plain,
( lhs_atom27(X1,X2,X3,X4)
| ~ in_closed(esk3_4(X1,X2,X3,X4),X1,X2) ),
c_0_117,
[final] ).
cnf(c_0_172,plain,
( lhs_atom27(X1,X2,X3,X4)
| in_closed(esk3_4(X1,X2,X3,X4),X3,X4) ),
c_0_118,
[final] ).
cnf(c_0_173,plain,
( lhs_atom24(X1,X2,X3,X4)
| in_closed(esk2_4(X1,X2,X3,X4),X3,X4) ),
c_0_119,
[final] ).
cnf(c_0_174,plain,
( lhs_atom24(X1,X2,X3,X4)
| in_closed(esk2_4(X1,X2,X3,X4),X1,X2) ),
c_0_120,
[final] ).
cnf(c_0_175,plain,
( lhs_atom23(X1,X2,X3,X4)
| in_closed(esk1_4(X1,X2,X3,X4),X3,X4) ),
c_0_121,
[final] ).
cnf(c_0_176,plain,
( lhs_atom23(X1,X2,X3,X4)
| in_closed(esk1_4(X1,X2,X3,X4),X1,X2) ),
c_0_122,
[final] ).
cnf(c_0_177,plain,
( lhs_atom25(X2,X3,X4,X5)
| ~ in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5) ),
c_0_123,
[final] ).
cnf(c_0_178,plain,
( lhs_atom22(X2,X3,X4,X5)
| ~ in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5) ),
c_0_124,
[final] ).
cnf(c_0_179,plain,
( in_closed(X1,X2,X3)
| lhs_atom26(X2,X3,X4,X5)
| ~ in_closed(X1,X4,X5) ),
c_0_125,
[final] ).
cnf(c_0_180,plain,
( lhs_atom21(X1,X2,X3)
| ~ less(X1,X2)
| ~ less(X3,X1) ),
c_0_126,
[final] ).
cnf(c_0_181,plain,
( lhs_atom19(X1,X2,X3)
| ~ less(X1,X2)
| ~ leq(X3,X1) ),
c_0_127,
[final] ).
cnf(c_0_182,plain,
( lhs_atom17(X1,X2,X3)
| ~ leq(X1,X2)
| ~ less(X3,X1) ),
c_0_128,
[final] ).
cnf(c_0_183,plain,
( lhs_atom15(X1,X2,X3)
| ~ leq(X1,X2)
| ~ leq(X3,X1) ),
c_0_129,
[final] ).
cnf(c_0_184,plain,
( lhs_atom20(X1,X2,X3)
| less(X3,X1) ),
c_0_130,
[final] ).
cnf(c_0_185,plain,
( lhs_atom20(X1,X2,X3)
| less(X1,X2) ),
c_0_131,
[final] ).
cnf(c_0_186,plain,
( lhs_atom18(X1,X2,X3)
| leq(X3,X1) ),
c_0_132,
[final] ).
cnf(c_0_187,plain,
( lhs_atom18(X1,X2,X3)
| less(X1,X2) ),
c_0_133,
[final] ).
cnf(c_0_188,plain,
( lhs_atom16(X1,X2,X3)
| less(X3,X1) ),
c_0_134,
[final] ).
cnf(c_0_189,plain,
( lhs_atom16(X1,X2,X3)
| leq(X1,X2) ),
c_0_135,
[final] ).
cnf(c_0_190,plain,
( lhs_atom14(X1,X2,X3)
| leq(X3,X1) ),
c_0_136,
[final] ).
cnf(c_0_191,plain,
( lhs_atom14(X1,X2,X3)
| leq(X1,X2) ),
c_0_137,
[final] ).
cnf(c_0_192,plain,
( lhs_atom7(X2,X3)
| ~ leq(X1,X2)
| ~ leq(X3,X1) ),
c_0_138,
[final] ).
cnf(c_0_193,plain,
( lhs_atom2(X2,X3)
| ~ leq(X1,X2)
| ~ less(X3,X1) ),
c_0_139,
[final] ).
cnf(c_0_194,plain,
( lhs_atom2(X2,X3)
| ~ less(X1,X2)
| ~ leq(X3,X1) ),
c_0_140,
[final] ).
cnf(c_0_195,plain,
( lhs_atom5(X1,X2)
| ~ leq(X1,X2)
| ~ leq(X2,X1) ),
c_0_141,
[final] ).
cnf(c_0_196,plain,
( lhs_atom2(X2,X3)
| ~ less(X1,X2)
| ~ less(X3,X1) ),
c_0_142,
[final] ).
cnf(c_0_197,plain,
( lhs_atom4(X1,X2)
| ~ less(X2,X1) ),
c_0_143,
[final] ).
cnf(c_0_198,plain,
( lhs_atom37(X1,X2)
| X1 = conflict
| X2 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X2 != unknown ),
c_0_144,
[final] ).
cnf(c_0_199,plain,
( lhs_atom37(X1,X2)
| X1 = conflict
| X2 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X1 != unknown ),
c_0_145,
[final] ).
cnf(c_0_200,plain,
( lhs_atom36(X1,X2)
| X1 != compatible
| X2 != compatible
| ~ is_verdict(X1)
| ~ is_verdict(X2) ),
c_0_146,
[final] ).
cnf(c_0_201,plain,
( lhs_atom12(X1,X2)
| X1 != conflict
| X2 != conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2) ),
c_0_147,
[final] ).
cnf(c_0_202,plain,
( lhs_atom11(X1,X2)
| X1 != conflict
| X2 != compatible
| ~ is_verdict(X1)
| ~ is_verdict(X2) ),
c_0_148,
[final] ).
cnf(c_0_203,plain,
( lhs_atom9(X1,X2)
| X1 != conflict
| X2 != conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2) ),
c_0_149,
[final] ).
cnf(c_0_204,plain,
( lhs_atom10(X1,X2)
| X2 = compatible
| X1 = compatible
| X2 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
c_0_150,
[final] ).
cnf(c_0_205,plain,
( lhs_atom10(X1,X2)
| X2 = compatible
| X1 = compatible
| X1 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
c_0_151,
[final] ).
cnf(c_0_206,plain,
( lhs_atom13(X1,X2)
| X2 = compatible
| X2 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
c_0_152,
[final] ).
cnf(c_0_207,plain,
( lhs_atom13(X1,X2)
| X2 = compatible
| X1 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
c_0_153,
[final] ).
cnf(c_0_208,plain,
( lhs_atom13(X1,X2)
| X1 = conflict
| X2 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
c_0_154,
[final] ).
cnf(c_0_209,plain,
( lhs_atom13(X1,X2)
| X1 = conflict
| X1 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
c_0_155,
[final] ).
cnf(c_0_210,plain,
( lhs_atom35(X1,X2)
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X2 != conflict ),
c_0_156,
[final] ).
cnf(c_0_211,plain,
( lhs_atom35(X1,X2)
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X1 != conflict ),
c_0_157,
[final] ).
cnf(c_0_212,plain,
( lhs_atom8(X1,X2)
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X2 != compatible ),
c_0_158,
[final] ).
cnf(c_0_213,plain,
( lhs_atom8(X1,X2)
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X1 != compatible ),
c_0_159,
[final] ).
cnf(c_0_214,plain,
( X1 = X2
| less(X1,X2)
| lhs_atom3(X2,X1) ),
c_0_160,
[final] ).
cnf(c_0_215,plain,
( leq(X1,X2)
| lhs_atom6(X2,X1) ),
c_0_161,
[final] ).
cnf(c_0_216,plain,
( lhs_atom4(X1,X2)
| X2 != X1 ),
c_0_162,
[final] ).
cnf(c_0_217,plain,
( X1 = unknown
| X1 = compatible
| X1 = conflict
| lhs_atom34(X1) ),
c_0_163,
[final] ).
cnf(c_0_218,plain,
lhs_atom1(X1),
c_0_164,
[final] ).
cnf(c_0_219,plain,
lhs_atom33,
c_0_165,
[final] ).
cnf(c_0_220,plain,
lhs_atom32,
c_0_166,
[final] ).
cnf(c_0_221,plain,
lhs_atom31,
c_0_167,
[final] ).
cnf(c_0_222,plain,
lhs_atom30,
c_0_168,
[final] ).
cnf(c_0_223,plain,
lhs_atom29,
c_0_169,
[final] ).
cnf(c_0_224,plain,
lhs_atom28,
c_0_170,
[final] ).
% End CNF derivation
cnf(c_0_171_0,axiom,
( axis_subsumes(X3,X4,X1,X2)
| ~ in_closed(sk1_esk3_4(X1,X2,X3,X4),X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_171,def_lhs_atom27]) ).
cnf(c_0_172_0,axiom,
( axis_subsumes(X3,X4,X1,X2)
| in_closed(sk1_esk3_4(X1,X2,X3,X4),X3,X4) ),
inference(unfold_definition,[status(thm)],[c_0_172,def_lhs_atom27]) ).
cnf(c_0_173_0,axiom,
( ~ axis_compatible(X3,X4,X1,X2)
| in_closed(sk1_esk2_4(X1,X2,X3,X4),X3,X4) ),
inference(unfold_definition,[status(thm)],[c_0_173,def_lhs_atom24]) ).
cnf(c_0_174_0,axiom,
( ~ axis_compatible(X3,X4,X1,X2)
| in_closed(sk1_esk2_4(X1,X2,X3,X4),X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_174,def_lhs_atom24]) ).
cnf(c_0_175_0,axiom,
( axis_conflict(X3,X4,X1,X2)
| in_closed(sk1_esk1_4(X1,X2,X3,X4),X3,X4) ),
inference(unfold_definition,[status(thm)],[c_0_175,def_lhs_atom23]) ).
cnf(c_0_176_0,axiom,
( axis_conflict(X3,X4,X1,X2)
| in_closed(sk1_esk1_4(X1,X2,X3,X4),X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_176,def_lhs_atom23]) ).
cnf(c_0_177_0,axiom,
( axis_compatible(X4,X5,X2,X3)
| ~ in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5) ),
inference(unfold_definition,[status(thm)],[c_0_177,def_lhs_atom25]) ).
cnf(c_0_178_0,axiom,
( ~ axis_conflict(X4,X5,X2,X3)
| ~ in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5) ),
inference(unfold_definition,[status(thm)],[c_0_178,def_lhs_atom22]) ).
cnf(c_0_179_0,axiom,
( ~ axis_subsumes(X4,X5,X2,X3)
| in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5) ),
inference(unfold_definition,[status(thm)],[c_0_179,def_lhs_atom26]) ).
cnf(c_0_180_0,axiom,
( in_open(X1,X3,X2)
| ~ less(X1,X2)
| ~ less(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_180,def_lhs_atom21]) ).
cnf(c_0_181_0,axiom,
( in_ropen(X1,X3,X2)
| ~ less(X1,X2)
| ~ leq(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_181,def_lhs_atom19]) ).
cnf(c_0_182_0,axiom,
( in_lopen(X1,X3,X2)
| ~ leq(X1,X2)
| ~ less(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_182,def_lhs_atom17]) ).
cnf(c_0_183_0,axiom,
( in_closed(X1,X3,X2)
| ~ leq(X1,X2)
| ~ leq(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_183,def_lhs_atom15]) ).
cnf(c_0_184_0,axiom,
( ~ in_open(X1,X3,X2)
| less(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_184,def_lhs_atom20]) ).
cnf(c_0_185_0,axiom,
( ~ in_open(X1,X3,X2)
| less(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_185,def_lhs_atom20]) ).
cnf(c_0_186_0,axiom,
( ~ in_ropen(X1,X3,X2)
| leq(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_186,def_lhs_atom18]) ).
cnf(c_0_187_0,axiom,
( ~ in_ropen(X1,X3,X2)
| less(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_187,def_lhs_atom18]) ).
cnf(c_0_188_0,axiom,
( ~ in_lopen(X1,X3,X2)
| less(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_188,def_lhs_atom16]) ).
cnf(c_0_189_0,axiom,
( ~ in_lopen(X1,X3,X2)
| leq(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_189,def_lhs_atom16]) ).
cnf(c_0_190_0,axiom,
( ~ in_closed(X1,X3,X2)
| leq(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_190,def_lhs_atom14]) ).
cnf(c_0_191_0,axiom,
( ~ in_closed(X1,X3,X2)
| leq(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_191,def_lhs_atom14]) ).
cnf(c_0_192_0,axiom,
( leq(X3,X2)
| ~ leq(X1,X2)
| ~ leq(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_192,def_lhs_atom7]) ).
cnf(c_0_193_0,axiom,
( less(X3,X2)
| ~ leq(X1,X2)
| ~ less(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_193,def_lhs_atom2]) ).
cnf(c_0_194_0,axiom,
( less(X3,X2)
| ~ less(X1,X2)
| ~ leq(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_194,def_lhs_atom2]) ).
cnf(c_0_195_0,axiom,
( X2 = X1
| ~ leq(X1,X2)
| ~ leq(X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_195,def_lhs_atom5]) ).
cnf(c_0_196_0,axiom,
( less(X3,X2)
| ~ less(X1,X2)
| ~ less(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_196,def_lhs_atom2]) ).
cnf(c_0_197_0,axiom,
( leq(X2,X1)
| ~ less(X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_197,def_lhs_atom4]) ).
cnf(c_0_198_0,axiom,
( box_verdict(X2,X1) = unknown
| X1 = conflict
| X2 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X2 != unknown ),
inference(unfold_definition,[status(thm)],[c_0_198,def_lhs_atom37]) ).
cnf(c_0_199_0,axiom,
( box_verdict(X2,X1) = unknown
| X1 = conflict
| X2 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X1 != unknown ),
inference(unfold_definition,[status(thm)],[c_0_199,def_lhs_atom37]) ).
cnf(c_0_200_0,axiom,
( box_verdict(X2,X1) = compatible
| X1 != compatible
| X2 != compatible
| ~ is_verdict(X1)
| ~ is_verdict(X2) ),
inference(unfold_definition,[status(thm)],[c_0_200,def_lhs_atom36]) ).
cnf(c_0_201_0,axiom,
( xone_verdict(X2,X1) = conflict
| X1 != conflict
| X2 != conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2) ),
inference(unfold_definition,[status(thm)],[c_0_201,def_lhs_atom12]) ).
cnf(c_0_202_0,axiom,
( xone_verdict(X2,X1) = compatible
| X1 != conflict
| X2 != compatible
| ~ is_verdict(X1)
| ~ is_verdict(X2) ),
inference(unfold_definition,[status(thm)],[c_0_202,def_lhs_atom11]) ).
cnf(c_0_203_0,axiom,
( or_verdict(X2,X1) = conflict
| X1 != conflict
| X2 != conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2) ),
inference(unfold_definition,[status(thm)],[c_0_203,def_lhs_atom9]) ).
cnf(c_0_204_0,axiom,
( or_verdict(X2,X1) = unknown
| X2 = compatible
| X1 = compatible
| X2 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(unfold_definition,[status(thm)],[c_0_204,def_lhs_atom10]) ).
cnf(c_0_205_0,axiom,
( or_verdict(X2,X1) = unknown
| X2 = compatible
| X1 = compatible
| X1 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(unfold_definition,[status(thm)],[c_0_205,def_lhs_atom10]) ).
cnf(c_0_206_0,axiom,
( xone_verdict(X2,X1) = unknown
| X2 = compatible
| X2 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(unfold_definition,[status(thm)],[c_0_206,def_lhs_atom13]) ).
cnf(c_0_207_0,axiom,
( xone_verdict(X2,X1) = unknown
| X2 = compatible
| X1 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(unfold_definition,[status(thm)],[c_0_207,def_lhs_atom13]) ).
cnf(c_0_208_0,axiom,
( xone_verdict(X2,X1) = unknown
| X1 = conflict
| X2 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(unfold_definition,[status(thm)],[c_0_208,def_lhs_atom13]) ).
cnf(c_0_209_0,axiom,
( xone_verdict(X2,X1) = unknown
| X1 = conflict
| X1 = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(unfold_definition,[status(thm)],[c_0_209,def_lhs_atom13]) ).
cnf(c_0_210_0,axiom,
( box_verdict(X2,X1) = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X2 != conflict ),
inference(unfold_definition,[status(thm)],[c_0_210,def_lhs_atom35]) ).
cnf(c_0_211_0,axiom,
( box_verdict(X2,X1) = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X1 != conflict ),
inference(unfold_definition,[status(thm)],[c_0_211,def_lhs_atom35]) ).
cnf(c_0_212_0,axiom,
( or_verdict(X2,X1) = compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X2 != compatible ),
inference(unfold_definition,[status(thm)],[c_0_212,def_lhs_atom8]) ).
cnf(c_0_213_0,axiom,
( or_verdict(X2,X1) = compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1)
| X1 != compatible ),
inference(unfold_definition,[status(thm)],[c_0_213,def_lhs_atom8]) ).
cnf(c_0_214_0,axiom,
( ~ leq(X1,X2)
| X1 = X2
| less(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_214,def_lhs_atom3]) ).
cnf(c_0_215_0,axiom,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_215,def_lhs_atom6]) ).
cnf(c_0_216_0,axiom,
( leq(X2,X1)
| X2 != X1 ),
inference(unfold_definition,[status(thm)],[c_0_216,def_lhs_atom4]) ).
cnf(c_0_217_0,axiom,
( ~ is_verdict(X1)
| X1 = unknown
| X1 = compatible
| X1 = conflict ),
inference(unfold_definition,[status(thm)],[c_0_217,def_lhs_atom34]) ).
cnf(c_0_218_0,axiom,
~ less(X1,X1),
inference(unfold_definition,[status(thm)],[c_0_218,def_lhs_atom1]) ).
cnf(c_0_219_0,axiom,
compatible != unknown,
inference(unfold_definition,[status(thm)],[c_0_219,def_lhs_atom33]) ).
cnf(c_0_220_0,axiom,
conflict != unknown,
inference(unfold_definition,[status(thm)],[c_0_220,def_lhs_atom32]) ).
cnf(c_0_221_0,axiom,
conflict != compatible,
inference(unfold_definition,[status(thm)],[c_0_221,def_lhs_atom31]) ).
cnf(c_0_222_0,axiom,
is_verdict(unknown),
inference(unfold_definition,[status(thm)],[c_0_222,def_lhs_atom30]) ).
cnf(c_0_223_0,axiom,
is_verdict(compatible),
inference(unfold_definition,[status(thm)],[c_0_223,def_lhs_atom29]) ).
cnf(c_0_224_0,axiom,
is_verdict(conflict),
inference(unfold_definition,[status(thm)],[c_0_224,def_lhs_atom28]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X3,X4,X5,X6,X7,X8,X9,X10] :
( ( axis_conflict(X3,X4,X7,X8)
& axis_conflict(X3,X4,X9,X10)
& axis_conflict(X5,X6,X7,X8)
& axis_conflict(X5,X6,X9,X10) )
=> ~ ? [X11] :
( ( in_closed(X11,X3,X4)
| in_closed(X11,X5,X6) )
& ( in_closed(X11,X7,X8)
| in_closed(X11,X9,X10) ) ) ),
file('<stdin>',or_sound_2branch) ).
fof(c_0_1_002,axiom,
! [X1,X2] :
( ( is_verdict(X1)
& is_verdict(X2) )
=> ( or_verdict(X1,X2) = compatible
| or_verdict(X1,X2) = conflict
| or_verdict(X1,X2) = unknown ) ),
file('<stdin>',or_verdict_total) ).
fof(c_0_2_003,axiom,
! [X12,X13] :
( ( is_verdict(X12)
& is_verdict(X13) )
=> ( xone_verdict(X12,X13) = compatible
| xone_verdict(X12,X13) = conflict
| xone_verdict(X12,X13) = unknown ) ),
file('<stdin>',xone_verdict_total) ).
fof(c_0_3_004,axiom,
! [X1,X2] :
( ( is_verdict(X1)
& is_verdict(X2) )
=> ( box_verdict(X1,X2) = conflict
| box_verdict(X1,X2) = compatible
| box_verdict(X1,X2) = unknown ) ),
file('<stdin>',box_verdict_total) ).
fof(c_0_4_005,axiom,
! [X11,X14] :
( less(X11,X14)
| X11 = X14
| less(X14,X11) ),
file('<stdin>',trichotomy) ).
fof(c_0_5_006,axiom,
! [X3,X4,X5,X6,X7,X8,X9,X10] :
( ( axis_conflict(X3,X4,X7,X8)
& axis_conflict(X3,X4,X9,X10)
& axis_conflict(X5,X6,X7,X8)
& axis_conflict(X5,X6,X9,X10) )
=> ~ ? [X11] :
( ( in_closed(X11,X3,X4)
| in_closed(X11,X5,X6) )
& ( in_closed(X11,X7,X8)
| in_closed(X11,X9,X10) ) ) ),
c_0_0 ).
fof(c_0_6_007,axiom,
! [X1,X2] :
( ( is_verdict(X1)
& is_verdict(X2) )
=> ( or_verdict(X1,X2) = compatible
| or_verdict(X1,X2) = conflict
| or_verdict(X1,X2) = unknown ) ),
c_0_1 ).
fof(c_0_7_008,axiom,
! [X12,X13] :
( ( is_verdict(X12)
& is_verdict(X13) )
=> ( xone_verdict(X12,X13) = compatible
| xone_verdict(X12,X13) = conflict
| xone_verdict(X12,X13) = unknown ) ),
c_0_2 ).
fof(c_0_8_009,axiom,
! [X1,X2] :
( ( is_verdict(X1)
& is_verdict(X2) )
=> ( box_verdict(X1,X2) = conflict
| box_verdict(X1,X2) = compatible
| box_verdict(X1,X2) = unknown ) ),
c_0_3 ).
fof(c_0_9_010,axiom,
! [X11,X14] :
( less(X11,X14)
| X11 = X14
| less(X14,X11) ),
c_0_4 ).
fof(c_0_10_011,plain,
! [X12,X13,X14,X15,X16,X17,X18,X19,X20] :
( ( ~ in_closed(X20,X16,X17)
| ~ in_closed(X20,X12,X13)
| ~ axis_conflict(X12,X13,X16,X17)
| ~ axis_conflict(X12,X13,X18,X19)
| ~ axis_conflict(X14,X15,X16,X17)
| ~ axis_conflict(X14,X15,X18,X19) )
& ( ~ in_closed(X20,X18,X19)
| ~ in_closed(X20,X12,X13)
| ~ axis_conflict(X12,X13,X16,X17)
| ~ axis_conflict(X12,X13,X18,X19)
| ~ axis_conflict(X14,X15,X16,X17)
| ~ axis_conflict(X14,X15,X18,X19) )
& ( ~ in_closed(X20,X16,X17)
| ~ in_closed(X20,X14,X15)
| ~ axis_conflict(X12,X13,X16,X17)
| ~ axis_conflict(X12,X13,X18,X19)
| ~ axis_conflict(X14,X15,X16,X17)
| ~ axis_conflict(X14,X15,X18,X19) )
& ( ~ in_closed(X20,X18,X19)
| ~ in_closed(X20,X14,X15)
| ~ axis_conflict(X12,X13,X16,X17)
| ~ axis_conflict(X12,X13,X18,X19)
| ~ axis_conflict(X14,X15,X16,X17)
| ~ axis_conflict(X14,X15,X18,X19) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_11_012,plain,
! [X3,X4] :
( ~ is_verdict(X3)
| ~ is_verdict(X4)
| or_verdict(X3,X4) = compatible
| or_verdict(X3,X4) = conflict
| or_verdict(X3,X4) = unknown ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_12_013,plain,
! [X14,X15] :
( ~ is_verdict(X14)
| ~ is_verdict(X15)
| xone_verdict(X14,X15) = compatible
| xone_verdict(X14,X15) = conflict
| xone_verdict(X14,X15) = unknown ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_13_014,plain,
! [X3,X4] :
( ~ is_verdict(X3)
| ~ is_verdict(X4)
| box_verdict(X3,X4) = conflict
| box_verdict(X3,X4) = compatible
| box_verdict(X3,X4) = unknown ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
fof(c_0_14_015,plain,
! [X15,X16] :
( less(X15,X16)
| X15 = X16
| less(X16,X15) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
cnf(c_0_15_016,plain,
( ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X7,X8)
| ~ in_closed(X9,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16_017,plain,
( ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X7,X8)
| ~ in_closed(X9,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17_018,plain,
( ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X1,X2)
| ~ in_closed(X9,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18_019,plain,
( ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X1,X2)
| ~ in_closed(X9,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19_020,plain,
( or_verdict(X1,X2) = unknown
| or_verdict(X1,X2) = conflict
| or_verdict(X1,X2) = compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20_021,plain,
( xone_verdict(X1,X2) = unknown
| xone_verdict(X1,X2) = conflict
| xone_verdict(X1,X2) = compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21_022,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_13]) ).
cnf(c_0_22_023,plain,
( less(X1,X2)
| X2 = X1
| less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23_024,plain,
( ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X7,X8)
| ~ in_closed(X9,X5,X6) ),
c_0_15,
[final] ).
cnf(c_0_24_025,plain,
( ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X7,X8)
| ~ in_closed(X9,X3,X4) ),
c_0_16,
[final] ).
cnf(c_0_25_026,plain,
( ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X1,X2)
| ~ in_closed(X9,X5,X6) ),
c_0_17,
[final] ).
cnf(c_0_26_027,plain,
( ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X1,X2)
| ~ in_closed(X9,X3,X4) ),
c_0_18,
[final] ).
cnf(c_0_27_028,plain,
( or_verdict(X1,X2) = unknown
| or_verdict(X1,X2) = conflict
| or_verdict(X1,X2) = compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
c_0_19,
[final] ).
cnf(c_0_28_029,plain,
( xone_verdict(X1,X2) = unknown
| xone_verdict(X1,X2) = conflict
| xone_verdict(X1,X2) = compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
c_0_20,
[final] ).
cnf(c_0_29_030,plain,
( box_verdict(X1,X2) = unknown
| box_verdict(X1,X2) = compatible
| box_verdict(X1,X2) = conflict
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
c_0_21,
[final] ).
cnf(c_0_30_031,plain,
( less(X1,X2)
| X2 = X1
| less(X2,X1) ),
c_0_22,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_23_0,axiom,
( ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X7,X8)
| ~ in_closed(X9,X5,X6) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_23_1,axiom,
( ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X7,X8)
| ~ in_closed(X9,X5,X6) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_23_2,axiom,
( ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X7,X8)
| ~ in_closed(X9,X5,X6) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_23_3,axiom,
( ~ axis_conflict(X7,X8,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4)
| ~ in_closed(X9,X7,X8)
| ~ in_closed(X9,X5,X6) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_23_4,axiom,
( ~ in_closed(X9,X7,X8)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4)
| ~ in_closed(X9,X5,X6) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_23_5,axiom,
( ~ in_closed(X9,X5,X6)
| ~ in_closed(X9,X7,X8)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_24_0,axiom,
( ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X7,X8)
| ~ in_closed(X9,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_1,axiom,
( ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X7,X8)
| ~ in_closed(X9,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_2,axiom,
( ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X7,X8)
| ~ in_closed(X9,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_3,axiom,
( ~ axis_conflict(X7,X8,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4)
| ~ in_closed(X9,X7,X8)
| ~ in_closed(X9,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_4,axiom,
( ~ in_closed(X9,X7,X8)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4)
| ~ in_closed(X9,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_5,axiom,
( ~ in_closed(X9,X3,X4)
| ~ in_closed(X9,X7,X8)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_25_0,axiom,
( ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X1,X2)
| ~ in_closed(X9,X5,X6) ),
inference(literals_permutation,[status(thm)],[c_0_25]) ).
cnf(c_0_25_1,axiom,
( ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X1,X2)
| ~ in_closed(X9,X5,X6) ),
inference(literals_permutation,[status(thm)],[c_0_25]) ).
cnf(c_0_25_2,axiom,
( ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X1,X2)
| ~ in_closed(X9,X5,X6) ),
inference(literals_permutation,[status(thm)],[c_0_25]) ).
cnf(c_0_25_3,axiom,
( ~ axis_conflict(X7,X8,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4)
| ~ in_closed(X9,X1,X2)
| ~ in_closed(X9,X5,X6) ),
inference(literals_permutation,[status(thm)],[c_0_25]) ).
cnf(c_0_25_4,axiom,
( ~ in_closed(X9,X1,X2)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4)
| ~ in_closed(X9,X5,X6) ),
inference(literals_permutation,[status(thm)],[c_0_25]) ).
cnf(c_0_25_5,axiom,
( ~ in_closed(X9,X5,X6)
| ~ in_closed(X9,X1,X2)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_25]) ).
cnf(c_0_26_0,axiom,
( ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X1,X2)
| ~ in_closed(X9,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_1,axiom,
( ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X1,X2)
| ~ in_closed(X9,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_2,axiom,
( ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ in_closed(X9,X1,X2)
| ~ in_closed(X9,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_3,axiom,
( ~ axis_conflict(X7,X8,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4)
| ~ in_closed(X9,X1,X2)
| ~ in_closed(X9,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_4,axiom,
( ~ in_closed(X9,X1,X2)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4)
| ~ in_closed(X9,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_5,axiom,
( ~ in_closed(X9,X3,X4)
| ~ in_closed(X9,X1,X2)
| ~ axis_conflict(X7,X8,X5,X6)
| ~ axis_conflict(X7,X8,X3,X4)
| ~ axis_conflict(X1,X2,X5,X6)
| ~ axis_conflict(X1,X2,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_27_0,axiom,
( or_verdict(X1,X2) = unknown
| or_verdict(X1,X2) = conflict
| or_verdict(X1,X2) = compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_1,axiom,
( or_verdict(X1,X2) = conflict
| or_verdict(X1,X2) = unknown
| or_verdict(X1,X2) = compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_2,axiom,
( or_verdict(X1,X2) = compatible
| or_verdict(X1,X2) = conflict
| or_verdict(X1,X2) = unknown
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_3,axiom,
( ~ is_verdict(X2)
| or_verdict(X1,X2) = compatible
| or_verdict(X1,X2) = conflict
| or_verdict(X1,X2) = unknown
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_4,axiom,
( ~ is_verdict(X1)
| ~ is_verdict(X2)
| or_verdict(X1,X2) = compatible
| or_verdict(X1,X2) = conflict
| or_verdict(X1,X2) = unknown ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_28_0,axiom,
( xone_verdict(X1,X2) = unknown
| xone_verdict(X1,X2) = conflict
| xone_verdict(X1,X2) = compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_1,axiom,
( xone_verdict(X1,X2) = conflict
| xone_verdict(X1,X2) = unknown
| xone_verdict(X1,X2) = compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_2,axiom,
( xone_verdict(X1,X2) = compatible
| xone_verdict(X1,X2) = conflict
| xone_verdict(X1,X2) = unknown
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_3,axiom,
( ~ is_verdict(X2)
| xone_verdict(X1,X2) = compatible
| xone_verdict(X1,X2) = conflict
| xone_verdict(X1,X2) = unknown
| ~ is_verdict(X1) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_4,axiom,
( ~ is_verdict(X1)
| ~ is_verdict(X2)
| xone_verdict(X1,X2) = compatible
| xone_verdict(X1,X2) = conflict
| xone_verdict(X1,X2) = unknown ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_29_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_29]) ).
cnf(c_0_29_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_29]) ).
cnf(c_0_29_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_29]) ).
cnf(c_0_29_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_29]) ).
cnf(c_0_29_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_29]) ).
cnf(c_0_30_0,axiom,
( less(X1,X2)
| X2 = X1
| less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_30_1,axiom,
( X2 = X1
| less(X1,X2)
| less(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_30_2,axiom,
( less(X2,X1)
| X2 = X1
| less(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_032,conjecture,
xone_verdict(compatible,conflict) = compatible,
file('<stdin>',odrl644) ).
fof(c_0_1_033,negated_conjecture,
xone_verdict(compatible,conflict) != compatible,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[c_0_0])]) ).
fof(c_0_2_034,negated_conjecture,
xone_verdict(compatible,conflict) != compatible,
c_0_1 ).
cnf(c_0_3_035,negated_conjecture,
xone_verdict(compatible,conflict) != compatible,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_036,negated_conjecture,
xone_verdict(compatible,conflict) != compatible,
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_96,negated_conjecture,
xone_verdict(compatible,conflict) != compatible,
file('/export/starexec/sandbox/tmp/iprover_modulo_ce68cb.p',c_0_4) ).
cnf(c_132,negated_conjecture,
xone_verdict(compatible,conflict) != compatible,
inference(copy,[status(esa)],[c_96]) ).
cnf(c_136,negated_conjecture,
xone_verdict(compatible,conflict) != compatible,
inference(copy,[status(esa)],[c_132]) ).
cnf(c_137,negated_conjecture,
xone_verdict(compatible,conflict) != compatible,
inference(copy,[status(esa)],[c_136]) ).
cnf(c_138,negated_conjecture,
xone_verdict(compatible,conflict) != compatible,
inference(copy,[status(esa)],[c_137]) ).
cnf(c_428,negated_conjecture,
xone_verdict(compatible,conflict) != compatible,
inference(copy,[status(esa)],[c_138]) ).
cnf(c_64,plain,
( ~ is_verdict(X0)
| ~ is_verdict(X1)
| X0 != compatible
| X1 != conflict
| xone_verdict(X0,X1) = compatible ),
file('/export/starexec/sandbox/tmp/iprover_modulo_ce68cb.p',c_0_202_0) ).
cnf(c_364,plain,
( ~ is_verdict(X0)
| ~ is_verdict(X1)
| X0 != compatible
| X1 != conflict
| xone_verdict(X0,X1) = compatible ),
inference(copy,[status(esa)],[c_64]) ).
cnf(c_365,plain,
( ~ is_verdict(X0)
| ~ is_verdict(X1)
| xone_verdict(X0,X1) = compatible
| X1 != conflict
| X0 != compatible ),
inference(rewriting,[status(thm)],[c_364]) ).
cnf(c_432,plain,
( ~ is_verdict(conflict)
| ~ is_verdict(compatible)
| conflict != conflict
| compatible != compatible ),
inference(resolution,[status(thm)],[c_428,c_365]) ).
cnf(c_433,plain,
( ~ is_verdict(conflict)
| ~ is_verdict(compatible)
| conflict != conflict
| compatible != compatible ),
inference(rewriting,[status(thm)],[c_432]) ).
cnf(c_434,plain,
( ~ is_verdict(conflict)
| ~ is_verdict(compatible) ),
inference(equality_resolution_simp,[status(esa)],[c_433]) ).
cnf(c_43,plain,
is_verdict(compatible),
file('/export/starexec/sandbox/tmp/iprover_modulo_ce68cb.p',c_0_223_0) ).
cnf(c_322,plain,
is_verdict(compatible),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_42,plain,
is_verdict(conflict),
file('/export/starexec/sandbox/tmp/iprover_modulo_ce68cb.p',c_0_224_0) ).
cnf(c_320,plain,
is_verdict(conflict),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_439,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_434,c_322,c_320]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT093+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.03 % Command : iprover_modulo %s %d
% 0.10/0.35 % Computer : n004.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 7 14:01:15 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 % Running in mono-core mode
% 0.14/0.43 % Orienting using strategy Equiv(ClausalAll)
% 0.14/0.43 % FOF problem with conjecture
% 0.14/0.43 % 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_87ff83.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_ce68cb.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_e32ec5 | grep -v "SZS"
% 0.14/0.46
% 0.14/0.46 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.14/0.46
% 0.14/0.46 %
% 0.14/0.46 % ------ iProver source info
% 0.14/0.46
% 0.14/0.46 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.14/0.46 % git: non_committed_changes: true
% 0.14/0.46 % git: last_make_outside_of_git: true
% 0.14/0.46
% 0.14/0.46 %
% 0.14/0.46 % ------ Input Options
% 0.14/0.46
% 0.14/0.46 % --out_options all
% 0.14/0.46 % --tptp_safe_out true
% 0.14/0.46 % --problem_path ""
% 0.14/0.46 % --include_path ""
% 0.14/0.46 % --clausifier .//eprover
% 0.14/0.46 % --clausifier_options --tstp-format
% 0.14/0.46 % --stdin false
% 0.14/0.46 % --dbg_backtrace false
% 0.14/0.46 % --dbg_dump_prop_clauses false
% 0.14/0.46 % --dbg_dump_prop_clauses_file -
% 0.14/0.46 % --dbg_out_stat false
% 0.14/0.46
% 0.14/0.46 % ------ General Options
% 0.14/0.46
% 0.14/0.46 % --fof false
% 0.14/0.46 % --time_out_real 150.
% 0.14/0.46 % --time_out_prep_mult 0.2
% 0.14/0.46 % --time_out_virtual -1.
% 0.14/0.46 % --schedule none
% 0.14/0.46 % --ground_splitting input
% 0.14/0.46 % --splitting_nvd 16
% 0.14/0.46 % --non_eq_to_eq false
% 0.14/0.46 % --prep_gs_sim true
% 0.14/0.46 % --prep_unflatten false
% 0.14/0.46 % --prep_res_sim true
% 0.14/0.46 % --prep_upred true
% 0.14/0.46 % --res_sim_input true
% 0.14/0.46 % --clause_weak_htbl true
% 0.14/0.46 % --gc_record_bc_elim false
% 0.14/0.46 % --symbol_type_check false
% 0.14/0.46 % --clausify_out false
% 0.14/0.46 % --large_theory_mode false
% 0.14/0.46 % --prep_sem_filter none
% 0.14/0.46 % --prep_sem_filter_out false
% 0.14/0.46 % --preprocessed_out false
% 0.14/0.46 % --sub_typing false
% 0.14/0.46 % --brand_transform false
% 0.14/0.46 % --pure_diseq_elim true
% 0.14/0.46 % --min_unsat_core false
% 0.14/0.46 % --pred_elim true
% 0.14/0.46 % --add_important_lit false
% 0.14/0.46 % --soft_assumptions false
% 0.14/0.46 % --reset_solvers false
% 0.14/0.46 % --bc_imp_inh []
% 0.14/0.46 % --conj_cone_tolerance 1.5
% 0.14/0.46 % --prolific_symb_bound 500
% 0.14/0.46 % --lt_threshold 2000
% 0.14/0.46
% 0.14/0.46 % ------ SAT Options
% 0.14/0.46
% 0.14/0.46 % --sat_mode false
% 0.14/0.46 % --sat_fm_restart_options ""
% 0.14/0.46 % --sat_gr_def false
% 0.14/0.46 % --sat_epr_types true
% 0.14/0.46 % --sat_non_cyclic_types false
% 0.14/0.46 % --sat_finite_models false
% 0.14/0.46 % --sat_fm_lemmas false
% 0.14/0.46 % --sat_fm_prep false
% 0.14/0.46 % --sat_fm_uc_incr true
% 0.14/0.46 % --sat_out_model small
% 0.14/0.46 % --sat_out_clauses false
% 0.14/0.46
% 0.14/0.46 % ------ QBF Options
% 0.14/0.46
% 0.14/0.46 % --qbf_mode false
% 0.14/0.46 % --qbf_elim_univ true
% 0.14/0.46 % --qbf_sk_in true
% 0.14/0.46 % --qbf_pred_elim true
% 0.14/0.46 % --qbf_split 32
% 0.14/0.46
% 0.14/0.46 % ------ BMC1 Options
% 0.14/0.46
% 0.14/0.46 % --bmc1_incremental false
% 0.14/0.46 % --bmc1_axioms reachable_all
% 0.14/0.46 % --bmc1_min_bound 0
% 0.14/0.46 % --bmc1_max_bound -1
% 0.14/0.46 % --bmc1_max_bound_default -1
% 0.14/0.46 % --bmc1_symbol_reachability true
% 0.14/0.46 % --bmc1_property_lemmas false
% 0.14/0.46 % --bmc1_k_induction false
% 0.14/0.46 % --bmc1_non_equiv_states false
% 0.14/0.46 % --bmc1_deadlock false
% 0.14/0.46 % --bmc1_ucm false
% 0.14/0.46 % --bmc1_add_unsat_core none
% 0.14/0.46 % --bmc1_unsat_core_children false
% 0.14/0.46 % --bmc1_unsat_core_extrapolate_axioms false
% 0.14/0.46 % --bmc1_out_stat full
% 0.14/0.46 % --bmc1_ground_init false
% 0.14/0.46 % --bmc1_pre_inst_next_state false
% 0.14/0.46 % --bmc1_pre_inst_state false
% 0.14/0.46 % --bmc1_pre_inst_reach_state false
% 0.14/0.46 % --bmc1_out_unsat_core false
% 0.14/0.46 % --bmc1_aig_witness_out false
% 0.14/0.46 % --bmc1_verbose false
% 0.14/0.46 % --bmc1_dump_clauses_tptp false
% 0.14/0.48 % --bmc1_dump_unsat_core_tptp false
% 0.14/0.48 % --bmc1_dump_file -
% 0.14/0.48 % --bmc1_ucm_expand_uc_limit 128
% 0.14/0.48 % --bmc1_ucm_n_expand_iterations 6
% 0.14/0.48 % --bmc1_ucm_extend_mode 1
% 0.14/0.48 % --bmc1_ucm_init_mode 2
% 0.14/0.48 % --bmc1_ucm_cone_mode none
% 0.14/0.48 % --bmc1_ucm_reduced_relation_type 0
% 0.14/0.48 % --bmc1_ucm_relax_model 4
% 0.14/0.48 % --bmc1_ucm_full_tr_after_sat true
% 0.14/0.48 % --bmc1_ucm_expand_neg_assumptions false
% 0.14/0.48 % --bmc1_ucm_layered_model none
% 0.14/0.48 % --bmc1_ucm_max_lemma_size 10
% 0.14/0.48
% 0.14/0.48 % ------ AIG Options
% 0.14/0.48
% 0.14/0.48 % --aig_mode false
% 0.14/0.48
% 0.14/0.48 % ------ Instantiation Options
% 0.14/0.48
% 0.14/0.48 % --instantiation_flag true
% 0.14/0.48 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.14/0.48 % --inst_solver_per_active 750
% 0.14/0.48 % --inst_solver_calls_frac 0.5
% 0.14/0.48 % --inst_passive_queue_type priority_queues
% 0.14/0.48 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.14/0.48 % --inst_passive_queues_freq [25;2]
% 0.14/0.48 % --inst_dismatching true
% 0.14/0.48 % --inst_eager_unprocessed_to_passive true
% 0.14/0.48 % --inst_prop_sim_given true
% 0.14/0.48 % --inst_prop_sim_new false
% 0.14/0.48 % --inst_orphan_elimination true
% 0.14/0.48 % --inst_learning_loop_flag true
% 0.14/0.48 % --inst_learning_start 3000
% 0.14/0.48 % --inst_learning_factor 2
% 0.14/0.48 % --inst_start_prop_sim_after_learn 3
% 0.14/0.48 % --inst_sel_renew solver
% 0.14/0.48 % --inst_lit_activity_flag true
% 0.14/0.48 % --inst_out_proof true
% 0.14/0.48
% 0.14/0.48 % ------ Resolution Options
% 0.14/0.48
% 0.14/0.48 % --resolution_flag true
% 0.14/0.48 % --res_lit_sel kbo_max
% 0.14/0.48 % --res_to_prop_solver none
% 0.14/0.48 % --res_prop_simpl_new false
% 0.14/0.48 % --res_prop_simpl_given false
% 0.14/0.48 % --res_passive_queue_type priority_queues
% 0.14/0.48 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.14/0.48 % --res_passive_queues_freq [15;5]
% 0.14/0.48 % --res_forward_subs full
% 0.14/0.48 % --res_backward_subs full
% 0.14/0.48 % --res_forward_subs_resolution true
% 0.14/0.48 % --res_backward_subs_resolution true
% 0.14/0.48 % --res_orphan_elimination false
% 0.14/0.48 % --res_time_limit 1000.
% 0.14/0.48 % --res_out_proof true
% 0.14/0.48 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_87ff83.s
% 0.14/0.48 % --modulo true
% 0.14/0.48
% 0.14/0.48 % ------ Combination Options
% 0.14/0.48
% 0.14/0.48 % --comb_res_mult 1000
% 0.14/0.48 % --comb_inst_mult 300
% 0.14/0.48 % ------
% 0.14/0.48
% 0.14/0.48 % ------ Parsing...% successful
% 0.14/0.48
% 0.14/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.14/0.48
% 0.14/0.48 % ------ Proving...
% 0.14/0.48 % ------ Problem Properties
% 0.14/0.48
% 0.14/0.48 %
% 0.14/0.48 % EPR false
% 0.14/0.48 % Horn false
% 0.14/0.48 % Has equality true
% 0.14/0.48
% 0.14/0.48 % % ------ Input Options Time Limit: Unbounded
% 0.14/0.48
% 0.14/0.48
% 0.14/0.48 % % ------ Current options:
% 0.14/0.48
% 0.14/0.48 % ------ Input Options
% 0.14/0.48
% 0.14/0.48 % --out_options all
% 0.14/0.48 % --tptp_safe_out true
% 0.14/0.48 % --problem_path ""
% 0.14/0.48 % --include_path ""
% 0.14/0.48 % --clausifier .//eprover
% 0.14/0.48 % --clausifier_options --tstp-format
% 0.14/0.48 % --stdin false
% 0.14/0.48 % --dbg_backtrace false
% 0.14/0.48 % --dbg_dump_prop_clauses false
% 0.14/0.48 % --dbg_dump_prop_clauses_file -
% 0.14/0.48 % --dbg_out_stat false
% 0.14/0.48
% 0.14/0.48 % ------ General Options
% 0.14/0.48
% 0.14/0.48 % --fof false
% 0.14/0.48 % --time_out_real 150.
% 0.14/0.48 % --time_out_prep_mult 0.2
% 0.14/0.48 % --time_out_virtual -1.
% 0.14/0.48 % --schedule none
% 0.14/0.48 % --ground_splitting input
% 0.14/0.48 % --splitting_nvd 16
% 0.14/0.48 % --non_eq_to_eq false
% 0.14/0.48 % --prep_gs_sim true
% 0.14/0.48 % --prep_unflatten false
% 0.14/0.48 % --prep_res_sim true
% 0.14/0.48 % --prep_upred true
% 0.14/0.48 % --res_sim_input true
% 0.14/0.48 % --clause_weak_htbl true
% 0.14/0.48 % --gc_record_bc_elim false
% 0.14/0.48 % --symbol_type_check false
% 0.14/0.48 % --clausify_out false
% 0.14/0.48 % --large_theory_mode false
% 0.14/0.48 % --prep_sem_filter none
% 0.14/0.48 % --prep_sem_filter_out false
% 0.14/0.48 % --preprocessed_out false
% 0.14/0.48 % --sub_typing false
% 0.14/0.48 % --brand_transform false
% 0.14/0.48 % --pure_diseq_elim true
% 0.14/0.48 % --min_unsat_core false
% 0.14/0.48 % --pred_elim true
% 0.14/0.48 % --add_important_lit false
% 0.14/0.48 % --soft_assumptions false
% 0.14/0.48 % --reset_solvers false
% 0.14/0.48 % --bc_imp_inh []
% 0.14/0.48 % --conj_cone_tolerance 1.5
% 0.14/0.48 % --prolific_symb_bound 500
% 0.14/0.48 % --lt_threshold 2000
% 0.14/0.48
% 0.14/0.48 % ------ SAT Options
% 0.14/0.48
% 0.14/0.48 % --sat_mode false
% 0.14/0.48 % --sat_fm_restart_options ""
% 0.14/0.48 % --sat_gr_def false
% 0.14/0.48 % --sat_epr_types true
% 0.14/0.48 % --sat_non_cyclic_types false
% 0.14/0.48 % --sat_finite_models false
% 0.14/0.48 % --sat_fm_lemmas false
% 0.14/0.48 % --sat_fm_prep false
% 0.14/0.48 % --sat_fm_uc_incr true
% 0.14/0.48 % --sat_out_model small
% 0.14/0.48 % --sat_out_clauses false
% 0.14/0.48
% 0.14/0.48 % ------ QBF Options
% 0.14/0.48
% 0.14/0.48 % --qbf_mode false
% 0.14/0.48 % --qbf_elim_univ true
% 0.14/0.48 % --qbf_sk_in true
% 0.14/0.48 % --qbf_pred_elim true
% 0.14/0.48 % --qbf_split 32
% 0.14/0.48
% 0.14/0.48 % ------ BMC1 Options
% 0.14/0.48
% 0.14/0.48 % --bmc1_incremental false
% 0.14/0.48 % --bmc1_axioms reachable_all
% 0.14/0.48 % --bmc1_min_bound 0
% 0.14/0.48 % --bmc1_max_bound -1
% 0.14/0.48 % --bmc1_max_bound_default -1
% 0.14/0.48 % --bmc1_symbol_reachability true
% 0.14/0.48 % --bmc1_property_lemmas false
% 0.14/0.48 % --bmc1_k_induction false
% 0.14/0.48 % --bmc1_non_equiv_states false
% 0.14/0.48 % --bmc1_deadlock false
% 0.14/0.48 % --bmc1_ucm false
% 0.14/0.48 % --bmc1_add_unsat_core none
% 0.14/0.48 % --bmc1_unsat_core_children false
% 0.14/0.48 % --bmc1_unsat_core_extrapolate_axioms false
% 0.14/0.48 % --bmc1_out_stat full
% 0.14/0.48 % --bmc1_ground_init false
% 0.14/0.48 % --bmc1_pre_inst_next_state false
% 0.14/0.48 % --bmc1_pre_inst_state false
% 0.14/0.48 % --bmc1_pre_inst_reach_state false
% 0.14/0.48 % --bmc1_out_unsat_core false
% 0.14/0.48 % --bmc1_aig_witness_out false
% 0.14/0.48 % --bmc1_verbose false
% 0.14/0.48 % --bmc1_dump_clauses_tptp false
% 0.14/0.48 % --bmc1_dump_unsat_core_tptp false
% 0.14/0.48 % --bmc1_dump_file -
% 0.14/0.48 % --bmc1_ucm_expand_uc_limit 128
% 0.14/0.48 % --bmc1_ucm_n_expand_iterations 6
% 0.14/0.48 % --bmc1_ucm_extend_mode 1
% 0.14/0.48 % --bmc1_ucm_init_mode 2
% 0.14/0.48 % --bmc1_ucm_cone_mode none
% 0.14/0.48 % --bmc1_ucm_reduced_relation_type 0
% 0.14/0.48 % --bmc1_ucm_relax_model 4
% 0.14/0.48 % --bmc1_ucm_full_tr_after_sat true
% 0.14/0.48 % --bmc1_ucm_expand_neg_assumptions false
% 0.14/0.48 % --bmc1_ucm_layered_model none
% 0.14/0.48 % --bmc1_ucm_max_lemma_size 10
% 0.14/0.48
% 0.14/0.48 % ------ AIG Options
% 0.14/0.48
% 0.14/0.48 % --aig_mode false
% 0.14/0.48
% 0.14/0.48 % ------ Instantiation Options
% 0.14/0.48
% 0.14/0.48 % --instantiation_flag true
% 0.14/0.48 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.14/0.48 % --inst_solver_per_active 750
% 0.14/0.48 % --inst_solver_calls_frac 0.5
% 0.14/0.48 % --inst_passive_queue_type priority_queues
% 0.14/0.48 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.14/0.48 % --inst_passive_queues_freq [25;2]
% 0.14/0.48 % --inst_dismatching true
% 0.14/0.48 % --inst_eager_unprocessed_to_passive true
% 0.14/0.48 % --inst_prop_sim_given true
% 0.14/0.48 % --inst_prop_sim_new false
% 0.14/0.48 % --inst_orphan_elimination true
% 0.14/0.48 % --inst_learning_loop_flag true
% 0.14/0.48 % --inst_learning_start 3000
% 0.14/0.48 % --inst_learning_factor 2
% 0.14/0.48 % --inst_start_prop_sim_after_learn 3
% 0.14/0.48 % --inst_sel_renew solver
% 0.14/0.48 % --inst_lit_activity_flag true
% 0.14/0.48 % --inst_out_proof true
% 0.14/0.48
% 0.14/0.48 % ------ Resolution Options
% 0.14/0.48
% 0.14/0.48 % --resolution_flag true
% 0.14/0.48 % --res_lit_sel kbo_max
% 0.14/0.48 % --res_to_prop_solver none
% 0.14/0.48 % --res_prop_simpl_new false
% 0.14/0.48 % --res_prop_simpl_given false
% 0.14/0.48 % --res_passive_queue_type priority_queues
% 0.14/0.48 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.14/0.48 % --res_passive_queues_freq [15;5]
% 0.14/0.48 % --res_forward_subs full
% 0.14/0.48 % --res_backward_subs full
% 0.14/0.48 % --res_forward_subs_resolution true
% 0.14/0.48 % --res_backward_subs_resolution true
% 0.14/0.48 % --res_orphan_elimination false
% 0.14/0.48 % --res_time_limit 1000.
% 0.14/0.48 % --res_out_proof true
% 0.14/0.48 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_87ff83.s
% 0.14/0.48 % --modulo true
% 0.14/0.48
% 0.14/0.48 % ------ Combination Options
% 0.14/0.48
% 0.14/0.48 % --comb_res_mult 1000
% 0.14/0.48 % --comb_inst_mult 300
% 0.14/0.48 % ------
% 0.14/0.48
% 0.14/0.48
% 0.14/0.48
% 0.14/0.48 % ------ Proving...
% 0.14/0.48 %
% 0.14/0.48
% 0.14/0.48
% 0.14/0.48 % Resolution empty clause
% 0.14/0.48
% 0.14/0.48 % ------ Statistics
% 0.14/0.48
% 0.14/0.48 % ------ General
% 0.14/0.48
% 0.14/0.48 % num_of_input_clauses: 97
% 0.14/0.48 % num_of_input_neg_conjectures: 1
% 0.14/0.48 % num_of_splits: 0
% 0.14/0.48 % num_of_split_atoms: 0
% 0.14/0.48 % num_of_sem_filtered_clauses: 0
% 0.14/0.48 % num_of_subtypes: 0
% 0.14/0.48 % monotx_restored_types: 0
% 0.14/0.48 % sat_num_of_epr_types: 0
% 0.14/0.48 % sat_num_of_non_cyclic_types: 0
% 0.14/0.48 % sat_guarded_non_collapsed_types: 0
% 0.14/0.48 % is_epr: 0
% 0.14/0.48 % is_horn: 0
% 0.14/0.48 % has_eq: 1
% 0.14/0.48 % num_pure_diseq_elim: 0
% 0.14/0.48 % simp_replaced_by: 0
% 0.14/0.48 % res_preprocessed: 2
% 0.14/0.48 % prep_upred: 0
% 0.14/0.48 % prep_unflattend: 0
% 0.14/0.48 % pred_elim_cands: 0
% 0.14/0.48 % pred_elim: 0
% 0.14/0.48 % pred_elim_cl: 0
% 0.14/0.48 % pred_elim_cycles: 0
% 0.14/0.48 % forced_gc_time: 0
% 0.14/0.48 % gc_basic_clause_elim: 0
% 0.14/0.48 % parsing_time: 0.007
% 0.14/0.48 % sem_filter_time: 0.
% 0.14/0.48 % pred_elim_time: 0.
% 0.14/0.48 % out_proof_time: 0.
% 0.14/0.48 % monotx_time: 0.
% 0.14/0.48 % subtype_inf_time: 0.
% 0.14/0.48 % unif_index_cands_time: 0.
% 0.14/0.48 % unif_index_add_time: 0.
% 0.14/0.48 % total_time: 0.045
% 0.14/0.48 % num_of_symbols: 44
% 0.14/0.48 % num_of_terms: 231
% 0.14/0.48
% 0.14/0.48 % ------ Propositional Solver
% 0.14/0.48
% 0.14/0.48 % prop_solver_calls: 1
% 0.14/0.48 % prop_fast_solver_calls: 3
% 0.14/0.48 % prop_num_of_clauses: 101
% 0.14/0.48 % prop_preprocess_simplified: 281
% 0.14/0.48 % prop_fo_subsumed: 0
% 0.14/0.48 % prop_solver_time: 0.
% 0.14/0.48 % prop_fast_solver_time: 0.
% 0.14/0.48 % prop_unsat_core_time: 0.
% 0.14/0.48
% 0.14/0.48 % ------ QBF
% 0.14/0.48
% 0.14/0.48 % qbf_q_res: 0
% 0.14/0.48 % qbf_num_tautologies: 0
% 0.14/0.48 % qbf_prep_cycles: 0
% 0.14/0.48
% 0.14/0.48 % ------ BMC1
% 0.14/0.48
% 0.14/0.48 % bmc1_current_bound: -1
% 0.14/0.48 % bmc1_last_solved_bound: -1
% 0.14/0.48 % bmc1_unsat_core_size: -1
% 0.14/0.48 % bmc1_unsat_core_parents_size: -1
% 0.14/0.48 % bmc1_merge_next_fun: 0
% 0.14/0.48 % bmc1_unsat_core_clauses_time: 0.
% 0.14/0.48
% 0.14/0.48 % ------ Instantiation
% 0.14/0.48
% 0.14/0.48 % inst_num_of_clauses: 93
% 0.14/0.48 % inst_num_in_passive: 0
% 0.14/0.48 % inst_num_in_active: 0
% 0.14/0.48 % inst_num_in_unprocessed: 97
% 0.14/0.48 % inst_num_of_loops: 0
% 0.14/0.48 % inst_num_of_learning_restarts: 0
% 0.14/0.48 % inst_num_moves_active_passive: 0
% 0.14/0.48 % inst_lit_activity: 0
% 0.14/0.48 % inst_lit_activity_moves: 0
% 0.14/0.48 % inst_num_tautologies: 0
% 0.14/0.48 % inst_num_prop_implied: 0
% 0.14/0.48 % inst_num_existing_simplified: 0
% 0.14/0.48 % inst_num_eq_res_simplified: 0
% 0.14/0.48 % inst_num_child_elim: 0
% 0.14/0.48 % inst_num_of_dismatching_blockings: 0
% 0.14/0.48 % inst_num_of_non_proper_insts: 0
% 0.14/0.48 % inst_num_of_duplicates: 0
% 0.14/0.48 % inst_inst_num_from_inst_to_res: 0
% 0.14/0.48 % inst_dismatching_checking_time: 0.
% 0.14/0.48
% 0.14/0.48 % ------ Resolution
% 0.14/0.48
% 0.14/0.48 % res_num_of_clauses: 139
% 0.14/0.48 % res_num_in_passive: 1
% 0.14/0.48 % res_num_in_active: 77
% 0.14/0.48 % res_num_of_loops: 2
% 0.14/0.48 % res_forward_subset_subsumed: 20
% 0.14/0.48 % res_backward_subset_subsumed: 0
% 0.14/0.48 % res_forward_subsumed: 0
% 0.14/0.48 % res_backward_subsumed: 0
% 0.14/0.48 % res_forward_subsumption_resolution: 2
% 0.14/0.48 % res_backward_subsumption_resolution: 0
% 0.14/0.48 % res_clause_to_clause_subsumption: 2
% 0.14/0.48 % res_orphan_elimination: 0
% 0.14/0.48 % res_tautology_del: 0
% 0.14/0.48 % res_num_eq_res_simplified: 1
% 0.14/0.48 % res_num_sel_changes: 0
% 0.14/0.48 % res_moves_from_active_to_pass: 0
% 0.14/0.48
% 0.14/0.48 % Status Unsatisfiable
% 0.14/0.48 % SZS status Theorem
% 0.14/0.48 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------