↑ Up

iProverMo---2.5-0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProverMo---2.5-0.1
% Problem  : MGT076+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 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:37 AM UTC 2026

% Result   : Theorem 7.65s 8.03s
% Output   : CNFRefutation 7.79s
% 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(distinct,axiom,
    ( v0 != v400
    & v0 != v800
    & v400 != v800 ),
    input ).

fof(distinct_0,plain,
    ( v0 != v400
    | $false ),
    inference(orientation,[status(thm)],[distinct]) ).

fof(distinct_1,plain,
    ( v0 != v800
    | $false ),
    inference(orientation,[status(thm)],[distinct]) ).

fof(distinct_2,plain,
    ( v400 != v800
    | $false ),
    inference(orientation,[status(thm)],[distinct]) ).

fof(ord_v400_v800,axiom,
    less(v400,v800),
    input ).

fof(ord_v400_v800_0,plain,
    ( less(v400,v800)
    | $false ),
    inference(orientation,[status(thm)],[ord_v400_v800]) ).

fof(ord_v0_v800,axiom,
    less(v0,v800),
    input ).

fof(ord_v0_v800_0,plain,
    ( less(v0,v800)
    | $false ),
    inference(orientation,[status(thm)],[ord_v0_v800]) ).

fof(ord_v0_v400,axiom,
    less(v0,v400),
    input ).

fof(ord_v0_v400_0,plain,
    ( less(v0,v400)
    | $false ),
    inference(orientation,[status(thm)],[ord_v0_v400]) ).

fof(val_v800,axiom,
    val(v800),
    input ).

fof(val_v800_0,plain,
    ( val(v800)
    | $false ),
    inference(orientation,[status(thm)],[val_v800]) ).

fof(val_v400,axiom,
    val(v400),
    input ).

fof(val_v400_0,plain,
    ( val(v400)
    | $false ),
    inference(orientation,[status(thm)],[val_v400]) ).

fof(val_v0,axiom,
    val(v0),
    input ).

fof(val_v0_0,plain,
    ( val(v0)
    | $false ),
    inference(orientation,[status(thm)],[val_v0]) ).

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(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,
    ! [X,B,A] :
      ( lhs_atom8(X,B,A)
    <=> ~ in_closed(X,A,B) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_9,plain,
    ! [A,B,X] :
      ( lhs_atom8(X,B,A)
      | ( leq(A,X)
        & leq(X,B) ) ),
    inference(fold_definition,[status(thm)],[in_closed_1,def_lhs_atom8]) ).

fof(def_lhs_atom9,axiom,
    ! [X,B,A] :
      ( lhs_atom9(X,B,A)
    <=> in_closed(X,A,B) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_10,plain,
    ! [A,B,X] :
      ( lhs_atom9(X,B,A)
      | ~ ( leq(A,X)
          & leq(X,B) ) ),
    inference(fold_definition,[status(thm)],[in_closed_0,def_lhs_atom9]) ).

fof(def_lhs_atom10,axiom,
    ! [X,B,A] :
      ( lhs_atom10(X,B,A)
    <=> ~ in_lopen(X,A,B) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_11,plain,
    ! [A,B,X] :
      ( lhs_atom10(X,B,A)
      | ( less(A,X)
        & leq(X,B) ) ),
    inference(fold_definition,[status(thm)],[in_lopen_1,def_lhs_atom10]) ).

fof(def_lhs_atom11,axiom,
    ! [X,B,A] :
      ( lhs_atom11(X,B,A)
    <=> in_lopen(X,A,B) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_12,plain,
    ! [A,B,X] :
      ( lhs_atom11(X,B,A)
      | ~ ( less(A,X)
          & leq(X,B) ) ),
    inference(fold_definition,[status(thm)],[in_lopen_0,def_lhs_atom11]) ).

fof(def_lhs_atom12,axiom,
    ! [X,B,A] :
      ( lhs_atom12(X,B,A)
    <=> ~ in_ropen(X,A,B) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_13,plain,
    ! [A,B,X] :
      ( lhs_atom12(X,B,A)
      | ( leq(A,X)
        & less(X,B) ) ),
    inference(fold_definition,[status(thm)],[in_ropen_1,def_lhs_atom12]) ).

fof(def_lhs_atom13,axiom,
    ! [X,B,A] :
      ( lhs_atom13(X,B,A)
    <=> in_ropen(X,A,B) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_14,plain,
    ! [A,B,X] :
      ( lhs_atom13(X,B,A)
      | ~ ( leq(A,X)
          & less(X,B) ) ),
    inference(fold_definition,[status(thm)],[in_ropen_0,def_lhs_atom13]) ).

fof(def_lhs_atom14,axiom,
    ! [X,B,A] :
      ( lhs_atom14(X,B,A)
    <=> ~ in_open(X,A,B) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_15,plain,
    ! [A,B,X] :
      ( lhs_atom14(X,B,A)
      | ( less(A,X)
        & less(X,B) ) ),
    inference(fold_definition,[status(thm)],[in_open_1,def_lhs_atom14]) ).

fof(def_lhs_atom15,axiom,
    ! [X,B,A] :
      ( lhs_atom15(X,B,A)
    <=> in_open(X,A,B) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_16,plain,
    ! [A,B,X] :
      ( lhs_atom15(X,B,A)
      | ~ ( less(A,X)
          & less(X,B) ) ),
    inference(fold_definition,[status(thm)],[in_open_0,def_lhs_atom15]) ).

fof(def_lhs_atom16,axiom,
    ! [I2lo,I2hi,I1lo,I1hi] :
      ( lhs_atom16(I2lo,I2hi,I1lo,I1hi)
    <=> ~ axis_conflict(I1lo,I1hi,I2lo,I2hi) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_17,plain,
    ! [I1hi,I1lo,I2hi,I2lo] :
      ( lhs_atom16(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_atom16]) ).

fof(def_lhs_atom17,axiom,
    ! [I2lo,I2hi,I1lo,I1hi] :
      ( lhs_atom17(I2lo,I2hi,I1lo,I1hi)
    <=> axis_conflict(I1lo,I1hi,I2lo,I2hi) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_18,plain,
    ! [I1hi,I1lo,I2hi,I2lo] :
      ( lhs_atom17(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_atom17]) ).

fof(def_lhs_atom18,axiom,
    ! [I2lo,I2hi,I1lo,I1hi] :
      ( lhs_atom18(I2lo,I2hi,I1lo,I1hi)
    <=> ~ axis_compatible(I1lo,I1hi,I2lo,I2hi) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_19,plain,
    ! [I1hi,I1lo,I2hi,I2lo] :
      ( lhs_atom18(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_atom18]) ).

fof(def_lhs_atom19,axiom,
    ! [I2lo,I2hi,I1lo,I1hi] :
      ( lhs_atom19(I2lo,I2hi,I1lo,I1hi)
    <=> axis_compatible(I1lo,I1hi,I2lo,I2hi) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_20,plain,
    ! [I1hi,I1lo,I2hi,I2lo] :
      ( lhs_atom19(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_atom19]) ).

fof(def_lhs_atom20,axiom,
    ! [I2lo,I2hi,I1lo,I1hi] :
      ( lhs_atom20(I2lo,I2hi,I1lo,I1hi)
    <=> ~ axis_subsumes(I1lo,I1hi,I2lo,I2hi) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_21,plain,
    ! [I1hi,I1lo,I2hi,I2lo] :
      ( lhs_atom20(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_atom20]) ).

fof(def_lhs_atom21,axiom,
    ! [I2lo,I2hi,I1lo,I1hi] :
      ( lhs_atom21(I2lo,I2hi,I1lo,I1hi)
    <=> axis_subsumes(I1lo,I1hi,I2lo,I2hi) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_22,plain,
    ! [I1hi,I1lo,I2hi,I2lo] :
      ( lhs_atom21(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_atom21]) ).

fof(def_lhs_atom22,axiom,
    ( lhs_atom22
  <=> is_verdict(conflict) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_23,plain,
    ( lhs_atom22
    | $false ),
    inference(fold_definition,[status(thm)],[conflict_is_verdict_0,def_lhs_atom22]) ).

fof(def_lhs_atom23,axiom,
    ( lhs_atom23
  <=> is_verdict(compatible) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_24,plain,
    ( lhs_atom23
    | $false ),
    inference(fold_definition,[status(thm)],[compatible_is_verdict_0,def_lhs_atom23]) ).

fof(def_lhs_atom24,axiom,
    ( lhs_atom24
  <=> is_verdict(unknown) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_25,plain,
    ( lhs_atom24
    | $false ),
    inference(fold_definition,[status(thm)],[unknown_is_verdict_0,def_lhs_atom24]) ).

fof(def_lhs_atom25,axiom,
    ( lhs_atom25
  <=> conflict != compatible ),
    inference(definition,[],[]) ).

fof(to_be_clausified_26,plain,
    ( lhs_atom25
    | $false ),
    inference(fold_definition,[status(thm)],[verdicts_distinct_cf_cp_0,def_lhs_atom25]) ).

fof(def_lhs_atom26,axiom,
    ( lhs_atom26
  <=> conflict != unknown ),
    inference(definition,[],[]) ).

fof(to_be_clausified_27,plain,
    ( lhs_atom26
    | $false ),
    inference(fold_definition,[status(thm)],[verdicts_distinct_cf_un_0,def_lhs_atom26]) ).

fof(def_lhs_atom27,axiom,
    ( lhs_atom27
  <=> compatible != unknown ),
    inference(definition,[],[]) ).

fof(to_be_clausified_28,plain,
    ( lhs_atom27
    | $false ),
    inference(fold_definition,[status(thm)],[verdicts_distinct_cp_un_0,def_lhs_atom27]) ).

fof(def_lhs_atom28,axiom,
    ! [V] :
      ( lhs_atom28(V)
    <=> ~ is_verdict(V) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_29,plain,
    ! [V] :
      ( lhs_atom28(V)
      | V = conflict
      | V = compatible
      | V = unknown ),
    inference(fold_definition,[status(thm)],[verdict_enum_0,def_lhs_atom28]) ).

fof(def_lhs_atom29,axiom,
    ! [V2,V1] :
      ( lhs_atom29(V2,V1)
    <=> box_verdict(V1,V2) = conflict ),
    inference(definition,[],[]) ).

fof(to_be_clausified_30,plain,
    ! [V1,V2] :
      ( lhs_atom29(V2,V1)
      | ~ ( is_verdict(V1)
          & is_verdict(V2)
          & ( V1 = conflict
            | V2 = conflict ) ) ),
    inference(fold_definition,[status(thm)],[box_conflict_0,def_lhs_atom29]) ).

fof(def_lhs_atom30,axiom,
    ! [V2,V1] :
      ( lhs_atom30(V2,V1)
    <=> box_verdict(V1,V2) = compatible ),
    inference(definition,[],[]) ).

fof(to_be_clausified_31,plain,
    ! [V1,V2] :
      ( lhs_atom30(V2,V1)
      | ~ ( is_verdict(V1)
          & is_verdict(V2)
          & V1 = compatible
          & V2 = compatible ) ),
    inference(fold_definition,[status(thm)],[box_compatible_0,def_lhs_atom30]) ).

fof(def_lhs_atom31,axiom,
    ! [V2,V1] :
      ( lhs_atom31(V2,V1)
    <=> box_verdict(V1,V2) = unknown ),
    inference(definition,[],[]) ).

fof(to_be_clausified_32,plain,
    ! [V1,V2] :
      ( lhs_atom31(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_atom31]) ).

fof(def_lhs_atom32,axiom,
    ( lhs_atom32
  <=> val(v0) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_33,plain,
    ( lhs_atom32
    | $false ),
    inference(fold_definition,[status(thm)],[val_v0_0,def_lhs_atom32]) ).

fof(def_lhs_atom33,axiom,
    ( lhs_atom33
  <=> val(v400) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_34,plain,
    ( lhs_atom33
    | $false ),
    inference(fold_definition,[status(thm)],[val_v400_0,def_lhs_atom33]) ).

fof(def_lhs_atom34,axiom,
    ( lhs_atom34
  <=> val(v800) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_35,plain,
    ( lhs_atom34
    | $false ),
    inference(fold_definition,[status(thm)],[val_v800_0,def_lhs_atom34]) ).

fof(def_lhs_atom35,axiom,
    ( lhs_atom35
  <=> less(v0,v400) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_36,plain,
    ( lhs_atom35
    | $false ),
    inference(fold_definition,[status(thm)],[ord_v0_v400_0,def_lhs_atom35]) ).

fof(def_lhs_atom36,axiom,
    ( lhs_atom36
  <=> less(v0,v800) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_37,plain,
    ( lhs_atom36
    | $false ),
    inference(fold_definition,[status(thm)],[ord_v0_v800_0,def_lhs_atom36]) ).

fof(def_lhs_atom37,axiom,
    ( lhs_atom37
  <=> less(v400,v800) ),
    inference(definition,[],[]) ).

fof(to_be_clausified_38,plain,
    ( lhs_atom37
    | $false ),
    inference(fold_definition,[status(thm)],[ord_v400_v800_0,def_lhs_atom37]) ).

fof(def_lhs_atom38,axiom,
    ( lhs_atom38
  <=> v400 != v800 ),
    inference(definition,[],[]) ).

fof(to_be_clausified_39,plain,
    ( lhs_atom38
    | $false ),
    inference(fold_definition,[status(thm)],[distinct_2,def_lhs_atom38]) ).

fof(def_lhs_atom39,axiom,
    ( lhs_atom39
  <=> v0 != v800 ),
    inference(definition,[],[]) ).

fof(to_be_clausified_40,plain,
    ( lhs_atom39
    | $false ),
    inference(fold_definition,[status(thm)],[distinct_1,def_lhs_atom39]) ).

fof(def_lhs_atom40,axiom,
    ( lhs_atom40
  <=> v0 != v400 ),
    inference(definition,[],[]) ).

fof(to_be_clausified_41,plain,
    ( lhs_atom40
    | $false ),
    inference(fold_definition,[status(thm)],[distinct_0,def_lhs_atom40]) ).

% Start CNF derivation
fof(c_0_0,axiom,
    ! [X6,X7,X8,X9] :
      ( lhs_atom21(X6,X7,X8,X9)
      | ~ ! [X1] :
            ( in_closed(X1,X8,X9)
           => in_closed(X1,X6,X7) ) ),
    file('<stdin>',to_be_clausified_22) ).

fof(c_0_1,axiom,
    ! [X6,X7,X8,X9] :
      ( lhs_atom18(X6,X7,X8,X9)
      | ? [X1] :
          ( in_closed(X1,X8,X9)
          & in_closed(X1,X6,X7) ) ),
    file('<stdin>',to_be_clausified_19) ).

fof(c_0_2,axiom,
    ! [X6,X7,X8,X9] :
      ( lhs_atom17(X6,X7,X8,X9)
      | ? [X1] :
          ( in_closed(X1,X8,X9)
          & in_closed(X1,X6,X7) ) ),
    file('<stdin>',to_be_clausified_18) ).

fof(c_0_3,axiom,
    ! [X6,X7,X8,X9] :
      ( lhs_atom19(X6,X7,X8,X9)
      | ~ ? [X1] :
            ( in_closed(X1,X8,X9)
            & in_closed(X1,X6,X7) ) ),
    file('<stdin>',to_be_clausified_20) ).

fof(c_0_4,axiom,
    ! [X6,X7,X8,X9] :
      ( lhs_atom16(X6,X7,X8,X9)
      | ~ ? [X1] :
            ( in_closed(X1,X8,X9)
            & in_closed(X1,X6,X7) ) ),
    file('<stdin>',to_be_clausified_17) ).

fof(c_0_5,axiom,
    ! [X6,X7,X8,X9] :
      ( lhs_atom20(X6,X7,X8,X9)
      | ! [X1] :
          ( in_closed(X1,X8,X9)
         => in_closed(X1,X6,X7) ) ),
    file('<stdin>',to_be_clausified_21) ).

fof(c_0_6,axiom,
    ! [X1,X4,X5] :
      ( lhs_atom15(X1,X4,X5)
      | ~ ( less(X5,X1)
          & less(X1,X4) ) ),
    file('<stdin>',to_be_clausified_16) ).

fof(c_0_7,axiom,
    ! [X1,X4,X5] :
      ( lhs_atom13(X1,X4,X5)
      | ~ ( leq(X5,X1)
          & less(X1,X4) ) ),
    file('<stdin>',to_be_clausified_14) ).

fof(c_0_8,axiom,
    ! [X1,X4,X5] :
      ( lhs_atom11(X1,X4,X5)
      | ~ ( less(X5,X1)
          & leq(X1,X4) ) ),
    file('<stdin>',to_be_clausified_12) ).

fof(c_0_9,axiom,
    ! [X1,X4,X5] :
      ( lhs_atom9(X1,X4,X5)
      | ~ ( leq(X5,X1)
          & leq(X1,X4) ) ),
    file('<stdin>',to_be_clausified_10) ).

fof(c_0_10,axiom,
    ! [X1,X4,X5] :
      ( lhs_atom14(X1,X4,X5)
      | ( less(X5,X1)
        & less(X1,X4) ) ),
    file('<stdin>',to_be_clausified_15) ).

fof(c_0_11,axiom,
    ! [X1,X4,X5] :
      ( lhs_atom12(X1,X4,X5)
      | ( leq(X5,X1)
        & less(X1,X4) ) ),
    file('<stdin>',to_be_clausified_13) ).

fof(c_0_12,axiom,
    ! [X1,X4,X5] :
      ( lhs_atom10(X1,X4,X5)
      | ( less(X5,X1)
        & leq(X1,X4) ) ),
    file('<stdin>',to_be_clausified_11) ).

fof(c_0_13,axiom,
    ! [X1,X4,X5] :
      ( lhs_atom8(X1,X4,X5)
      | ( leq(X5,X1)
        & leq(X1,X4) ) ),
    file('<stdin>',to_be_clausified_9) ).

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,
    ! [X11,X12] :
      ( lhs_atom31(X11,X12)
      | ~ ( is_verdict(X12)
          & is_verdict(X11)
          & ( X12 = unknown
            | X11 = unknown )
          & X12 != conflict
          & X11 != conflict ) ),
    file('<stdin>',to_be_clausified_32) ).

fof(c_0_21,axiom,
    ! [X11,X12] :
      ( lhs_atom30(X11,X12)
      | ~ ( is_verdict(X12)
          & is_verdict(X11)
          & X12 = compatible
          & X11 = compatible ) ),
    file('<stdin>',to_be_clausified_31) ).

fof(c_0_22,axiom,
    ! [X11,X12] :
      ( lhs_atom29(X11,X12)
      | ~ ( is_verdict(X12)
          & is_verdict(X11)
          & ( X12 = conflict
            | X11 = conflict ) ) ),
    file('<stdin>',to_be_clausified_30) ).

fof(c_0_23,axiom,
    ! [X3,X1] :
      ( lhs_atom3(X3,X1)
      | less(X1,X3)
      | X1 = X3 ),
    file('<stdin>',to_be_clausified_2) ).

fof(c_0_24,axiom,
    ! [X3,X1] :
      ( lhs_atom6(X3,X1)
      | leq(X1,X3) ),
    file('<stdin>',to_be_clausified_5) ).

fof(c_0_25,axiom,
    ! [X10] :
      ( lhs_atom28(X10)
      | X10 = conflict
      | X10 = compatible
      | X10 = unknown ),
    file('<stdin>',to_be_clausified_29) ).

fof(c_0_26,axiom,
    ! [X1] :
      ( lhs_atom1(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_0) ).

fof(c_0_27,axiom,
    ( lhs_atom40
    | ~ $true ),
    file('<stdin>',to_be_clausified_41) ).

fof(c_0_28,axiom,
    ( lhs_atom39
    | ~ $true ),
    file('<stdin>',to_be_clausified_40) ).

fof(c_0_29,axiom,
    ( lhs_atom38
    | ~ $true ),
    file('<stdin>',to_be_clausified_39) ).

fof(c_0_30,axiom,
    ( lhs_atom37
    | ~ $true ),
    file('<stdin>',to_be_clausified_38) ).

fof(c_0_31,axiom,
    ( lhs_atom36
    | ~ $true ),
    file('<stdin>',to_be_clausified_37) ).

fof(c_0_32,axiom,
    ( lhs_atom35
    | ~ $true ),
    file('<stdin>',to_be_clausified_36) ).

fof(c_0_33,axiom,
    ( lhs_atom34
    | ~ $true ),
    file('<stdin>',to_be_clausified_35) ).

fof(c_0_34,axiom,
    ( lhs_atom33
    | ~ $true ),
    file('<stdin>',to_be_clausified_34) ).

fof(c_0_35,axiom,
    ( lhs_atom32
    | ~ $true ),
    file('<stdin>',to_be_clausified_33) ).

fof(c_0_36,axiom,
    ( lhs_atom27
    | ~ $true ),
    file('<stdin>',to_be_clausified_28) ).

fof(c_0_37,axiom,
    ( lhs_atom26
    | ~ $true ),
    file('<stdin>',to_be_clausified_27) ).

fof(c_0_38,axiom,
    ( lhs_atom25
    | ~ $true ),
    file('<stdin>',to_be_clausified_26) ).

fof(c_0_39,axiom,
    ( lhs_atom24
    | ~ $true ),
    file('<stdin>',to_be_clausified_25) ).

fof(c_0_40,axiom,
    ( lhs_atom23
    | ~ $true ),
    file('<stdin>',to_be_clausified_24) ).

fof(c_0_41,axiom,
    ( lhs_atom22
    | ~ $true ),
    file('<stdin>',to_be_clausified_23) ).

fof(c_0_42,axiom,
    ! [X6,X7,X8,X9] :
      ( lhs_atom21(X6,X7,X8,X9)
      | ~ ! [X1] :
            ( in_closed(X1,X8,X9)
           => in_closed(X1,X6,X7) ) ),
    c_0_0 ).

fof(c_0_43,axiom,
    ! [X6,X7,X8,X9] :
      ( lhs_atom18(X6,X7,X8,X9)
      | ? [X1] :
          ( in_closed(X1,X8,X9)
          & in_closed(X1,X6,X7) ) ),
    c_0_1 ).

fof(c_0_44,axiom,
    ! [X6,X7,X8,X9] :
      ( lhs_atom17(X6,X7,X8,X9)
      | ? [X1] :
          ( in_closed(X1,X8,X9)
          & in_closed(X1,X6,X7) ) ),
    c_0_2 ).

fof(c_0_45,axiom,
    ! [X6,X7,X8,X9] :
      ( lhs_atom19(X6,X7,X8,X9)
      | ~ ? [X1] :
            ( in_closed(X1,X8,X9)
            & in_closed(X1,X6,X7) ) ),
    c_0_3 ).

fof(c_0_46,axiom,
    ! [X6,X7,X8,X9] :
      ( lhs_atom16(X6,X7,X8,X9)
      | ~ ? [X1] :
            ( in_closed(X1,X8,X9)
            & in_closed(X1,X6,X7) ) ),
    c_0_4 ).

fof(c_0_47,axiom,
    ! [X6,X7,X8,X9] :
      ( lhs_atom20(X6,X7,X8,X9)
      | ! [X1] :
          ( in_closed(X1,X8,X9)
         => in_closed(X1,X6,X7) ) ),
    c_0_5 ).

fof(c_0_48,axiom,
    ! [X1,X4,X5] :
      ( lhs_atom15(X1,X4,X5)
      | ~ ( less(X5,X1)
          & less(X1,X4) ) ),
    c_0_6 ).

fof(c_0_49,axiom,
    ! [X1,X4,X5] :
      ( lhs_atom13(X1,X4,X5)
      | ~ ( leq(X5,X1)
          & less(X1,X4) ) ),
    c_0_7 ).

fof(c_0_50,axiom,
    ! [X1,X4,X5] :
      ( lhs_atom11(X1,X4,X5)
      | ~ ( less(X5,X1)
          & leq(X1,X4) ) ),
    c_0_8 ).

fof(c_0_51,axiom,
    ! [X1,X4,X5] :
      ( lhs_atom9(X1,X4,X5)
      | ~ ( leq(X5,X1)
          & leq(X1,X4) ) ),
    c_0_9 ).

fof(c_0_52,axiom,
    ! [X1,X4,X5] :
      ( lhs_atom14(X1,X4,X5)
      | ( less(X5,X1)
        & less(X1,X4) ) ),
    c_0_10 ).

fof(c_0_53,axiom,
    ! [X1,X4,X5] :
      ( lhs_atom12(X1,X4,X5)
      | ( leq(X5,X1)
        & less(X1,X4) ) ),
    c_0_11 ).

fof(c_0_54,axiom,
    ! [X1,X4,X5] :
      ( lhs_atom10(X1,X4,X5)
      | ( less(X5,X1)
        & leq(X1,X4) ) ),
    c_0_12 ).

fof(c_0_55,axiom,
    ! [X1,X4,X5] :
      ( lhs_atom8(X1,X4,X5)
      | ( leq(X5,X1)
        & leq(X1,X4) ) ),
    c_0_13 ).

fof(c_0_56,axiom,
    ! [X2,X3,X1] :
      ( lhs_atom7(X2,X1)
      | ~ ( leq(X1,X3)
          & leq(X3,X2) ) ),
    c_0_14 ).

fof(c_0_57,axiom,
    ! [X2,X3,X1] :
      ( lhs_atom2(X2,X1)
      | ~ ( less(X1,X3)
          & leq(X3,X2) ) ),
    c_0_15 ).

fof(c_0_58,axiom,
    ! [X2,X3,X1] :
      ( lhs_atom2(X2,X1)
      | ~ ( leq(X1,X3)
          & less(X3,X2) ) ),
    c_0_16 ).

fof(c_0_59,axiom,
    ! [X3,X1] :
      ( lhs_atom5(X3,X1)
      | ~ ( leq(X1,X3)
          & leq(X3,X1) ) ),
    c_0_17 ).

fof(c_0_60,axiom,
    ! [X2,X3,X1] :
      ( lhs_atom2(X2,X1)
      | ~ ( less(X1,X3)
          & less(X3,X2) ) ),
    c_0_18 ).

fof(c_0_61,axiom,
    ! [X3,X1] :
      ( lhs_atom4(X3,X1)
      | ~ ( less(X1,X3)
          | X1 = X3 ) ),
    c_0_19 ).

fof(c_0_62,axiom,
    ! [X11,X12] :
      ( lhs_atom31(X11,X12)
      | ~ ( is_verdict(X12)
          & is_verdict(X11)
          & ( X12 = unknown
            | X11 = unknown )
          & X12 != conflict
          & X11 != conflict ) ),
    c_0_20 ).

fof(c_0_63,axiom,
    ! [X11,X12] :
      ( lhs_atom30(X11,X12)
      | ~ ( is_verdict(X12)
          & is_verdict(X11)
          & X12 = compatible
          & X11 = compatible ) ),
    c_0_21 ).

fof(c_0_64,axiom,
    ! [X11,X12] :
      ( lhs_atom29(X11,X12)
      | ~ ( is_verdict(X12)
          & is_verdict(X11)
          & ( X12 = conflict
            | X11 = conflict ) ) ),
    c_0_22 ).

fof(c_0_65,axiom,
    ! [X3,X1] :
      ( lhs_atom3(X3,X1)
      | less(X1,X3)
      | X1 = X3 ),
    c_0_23 ).

fof(c_0_66,axiom,
    ! [X3,X1] :
      ( lhs_atom6(X3,X1)
      | leq(X1,X3) ),
    c_0_24 ).

fof(c_0_67,axiom,
    ! [X10] :
      ( lhs_atom28(X10)
      | X10 = conflict
      | X10 = compatible
      | X10 = unknown ),
    c_0_25 ).

fof(c_0_68,plain,
    ! [X1] : lhs_atom1(X1),
    inference(fof_simplification,[status(thm)],[c_0_26]) ).

fof(c_0_69,plain,
    lhs_atom40,
    inference(fof_simplification,[status(thm)],[c_0_27]) ).

fof(c_0_70,plain,
    lhs_atom39,
    inference(fof_simplification,[status(thm)],[c_0_28]) ).

fof(c_0_71,plain,
    lhs_atom38,
    inference(fof_simplification,[status(thm)],[c_0_29]) ).

fof(c_0_72,plain,
    lhs_atom37,
    inference(fof_simplification,[status(thm)],[c_0_30]) ).

fof(c_0_73,plain,
    lhs_atom36,
    inference(fof_simplification,[status(thm)],[c_0_31]) ).

fof(c_0_74,plain,
    lhs_atom35,
    inference(fof_simplification,[status(thm)],[c_0_32]) ).

fof(c_0_75,plain,
    lhs_atom34,
    inference(fof_simplification,[status(thm)],[c_0_33]) ).

fof(c_0_76,plain,
    lhs_atom33,
    inference(fof_simplification,[status(thm)],[c_0_34]) ).

fof(c_0_77,plain,
    lhs_atom32,
    inference(fof_simplification,[status(thm)],[c_0_35]) ).

fof(c_0_78,plain,
    lhs_atom27,
    inference(fof_simplification,[status(thm)],[c_0_36]) ).

fof(c_0_79,plain,
    lhs_atom26,
    inference(fof_simplification,[status(thm)],[c_0_37]) ).

fof(c_0_80,plain,
    lhs_atom25,
    inference(fof_simplification,[status(thm)],[c_0_38]) ).

fof(c_0_81,plain,
    lhs_atom24,
    inference(fof_simplification,[status(thm)],[c_0_39]) ).

fof(c_0_82,plain,
    lhs_atom23,
    inference(fof_simplification,[status(thm)],[c_0_40]) ).

fof(c_0_83,plain,
    lhs_atom22,
    inference(fof_simplification,[status(thm)],[c_0_41]) ).

fof(c_0_84,plain,
    ! [X10,X11,X12,X13] :
      ( ( in_closed(esk3_4(X10,X11,X12,X13),X12,X13)
        | lhs_atom21(X10,X11,X12,X13) )
      & ( ~ in_closed(esk3_4(X10,X11,X12,X13),X10,X11)
        | lhs_atom21(X10,X11,X12,X13) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])])])]) ).

fof(c_0_85,plain,
    ! [X10,X11,X12,X13] :
      ( ( in_closed(esk2_4(X10,X11,X12,X13),X12,X13)
        | lhs_atom18(X10,X11,X12,X13) )
      & ( in_closed(esk2_4(X10,X11,X12,X13),X10,X11)
        | lhs_atom18(X10,X11,X12,X13) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_43])])]) ).

fof(c_0_86,plain,
    ! [X10,X11,X12,X13] :
      ( ( in_closed(esk1_4(X10,X11,X12,X13),X12,X13)
        | lhs_atom17(X10,X11,X12,X13) )
      & ( in_closed(esk1_4(X10,X11,X12,X13),X10,X11)
        | lhs_atom17(X10,X11,X12,X13) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_44])])]) ).

fof(c_0_87,plain,
    ! [X10,X11,X12,X13,X14] :
      ( lhs_atom19(X10,X11,X12,X13)
      | ~ in_closed(X14,X12,X13)
      | ~ in_closed(X14,X10,X11) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])])]) ).

fof(c_0_88,plain,
    ! [X10,X11,X12,X13,X14] :
      ( lhs_atom16(X10,X11,X12,X13)
      | ~ in_closed(X14,X12,X13)
      | ~ in_closed(X14,X10,X11) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])])]) ).

fof(c_0_89,plain,
    ! [X10,X11,X12,X13,X14] :
      ( lhs_atom20(X10,X11,X12,X13)
      | ~ in_closed(X14,X12,X13)
      | in_closed(X14,X10,X11) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_47])])]) ).

fof(c_0_90,plain,
    ! [X6,X7,X8] :
      ( lhs_atom15(X6,X7,X8)
      | ~ less(X8,X6)
      | ~ less(X6,X7) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_48])]) ).

fof(c_0_91,plain,
    ! [X6,X7,X8] :
      ( lhs_atom13(X6,X7,X8)
      | ~ leq(X8,X6)
      | ~ less(X6,X7) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_49])]) ).

fof(c_0_92,plain,
    ! [X6,X7,X8] :
      ( lhs_atom11(X6,X7,X8)
      | ~ less(X8,X6)
      | ~ leq(X6,X7) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_50])]) ).

fof(c_0_93,plain,
    ! [X6,X7,X8] :
      ( lhs_atom9(X6,X7,X8)
      | ~ leq(X8,X6)
      | ~ leq(X6,X7) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_51])]) ).

fof(c_0_94,plain,
    ! [X6,X7,X8] :
      ( ( less(X8,X6)
        | lhs_atom14(X6,X7,X8) )
      & ( less(X6,X7)
        | lhs_atom14(X6,X7,X8) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_52])]) ).

fof(c_0_95,plain,
    ! [X6,X7,X8] :
      ( ( leq(X8,X6)
        | lhs_atom12(X6,X7,X8) )
      & ( less(X6,X7)
        | lhs_atom12(X6,X7,X8) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_53])]) ).

fof(c_0_96,plain,
    ! [X6,X7,X8] :
      ( ( less(X8,X6)
        | lhs_atom10(X6,X7,X8) )
      & ( leq(X6,X7)
        | lhs_atom10(X6,X7,X8) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_54])]) ).

fof(c_0_97,plain,
    ! [X6,X7,X8] :
      ( ( leq(X8,X6)
        | lhs_atom8(X6,X7,X8) )
      & ( leq(X6,X7)
        | lhs_atom8(X6,X7,X8) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_55])]) ).

fof(c_0_98,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_56])]) ).

fof(c_0_99,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_57])]) ).

fof(c_0_100,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_58])]) ).

fof(c_0_101,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_59])]) ).

fof(c_0_102,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_60])]) ).

fof(c_0_103,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_61])])]) ).

fof(c_0_104,plain,
    ! [X13,X14] :
      ( ( X14 != unknown
        | X14 = conflict
        | X13 = conflict
        | ~ is_verdict(X13)
        | ~ is_verdict(X14)
        | lhs_atom31(X13,X14) )
      & ( X13 != unknown
        | X14 = conflict
        | X13 = conflict
        | ~ is_verdict(X13)
        | ~ is_verdict(X14)
        | lhs_atom31(X13,X14) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_62])])]) ).

fof(c_0_105,plain,
    ! [X13,X14] :
      ( lhs_atom30(X13,X14)
      | ~ is_verdict(X14)
      | ~ is_verdict(X13)
      | X14 != compatible
      | X13 != compatible ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_63])]) ).

fof(c_0_106,plain,
    ! [X13,X14] :
      ( ( X14 != conflict
        | ~ is_verdict(X13)
        | ~ is_verdict(X14)
        | lhs_atom29(X13,X14) )
      & ( X13 != conflict
        | ~ is_verdict(X13)
        | ~ is_verdict(X14)
        | lhs_atom29(X13,X14) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_64])])]) ).

fof(c_0_107,plain,
    ! [X4,X5] :
      ( lhs_atom3(X4,X5)
      | less(X5,X4)
      | X5 = X4 ),
    inference(variable_rename,[status(thm)],[c_0_65]) ).

fof(c_0_108,plain,
    ! [X4,X5] :
      ( lhs_atom6(X4,X5)
      | leq(X5,X4) ),
    inference(variable_rename,[status(thm)],[c_0_66]) ).

fof(c_0_109,plain,
    ! [X11] :
      ( lhs_atom28(X11)
      | X11 = conflict
      | X11 = compatible
      | X11 = unknown ),
    inference(variable_rename,[status(thm)],[c_0_67]) ).

fof(c_0_110,plain,
    ! [X2] : lhs_atom1(X2),
    inference(variable_rename,[status(thm)],[c_0_68]) ).

fof(c_0_111,plain,
    lhs_atom40,
    c_0_69 ).

fof(c_0_112,plain,
    lhs_atom39,
    c_0_70 ).

fof(c_0_113,plain,
    lhs_atom38,
    c_0_71 ).

fof(c_0_114,plain,
    lhs_atom37,
    c_0_72 ).

fof(c_0_115,plain,
    lhs_atom36,
    c_0_73 ).

fof(c_0_116,plain,
    lhs_atom35,
    c_0_74 ).

fof(c_0_117,plain,
    lhs_atom34,
    c_0_75 ).

fof(c_0_118,plain,
    lhs_atom33,
    c_0_76 ).

fof(c_0_119,plain,
    lhs_atom32,
    c_0_77 ).

fof(c_0_120,plain,
    lhs_atom27,
    c_0_78 ).

fof(c_0_121,plain,
    lhs_atom26,
    c_0_79 ).

fof(c_0_122,plain,
    lhs_atom25,
    c_0_80 ).

fof(c_0_123,plain,
    lhs_atom24,
    c_0_81 ).

fof(c_0_124,plain,
    lhs_atom23,
    c_0_82 ).

fof(c_0_125,plain,
    lhs_atom22,
    c_0_83 ).

cnf(c_0_126,plain,
    ( lhs_atom21(X1,X2,X3,X4)
    | ~ in_closed(esk3_4(X1,X2,X3,X4),X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_84]) ).

cnf(c_0_127,plain,
    ( lhs_atom21(X1,X2,X3,X4)
    | in_closed(esk3_4(X1,X2,X3,X4),X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_84]) ).

cnf(c_0_128,plain,
    ( lhs_atom18(X1,X2,X3,X4)
    | in_closed(esk2_4(X1,X2,X3,X4),X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_85]) ).

cnf(c_0_129,plain,
    ( lhs_atom18(X1,X2,X3,X4)
    | in_closed(esk2_4(X1,X2,X3,X4),X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_85]) ).

cnf(c_0_130,plain,
    ( lhs_atom17(X1,X2,X3,X4)
    | in_closed(esk1_4(X1,X2,X3,X4),X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_86]) ).

cnf(c_0_131,plain,
    ( lhs_atom17(X1,X2,X3,X4)
    | in_closed(esk1_4(X1,X2,X3,X4),X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_86]) ).

cnf(c_0_132,plain,
    ( lhs_atom19(X2,X3,X4,X5)
    | ~ in_closed(X1,X2,X3)
    | ~ in_closed(X1,X4,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_87]) ).

cnf(c_0_133,plain,
    ( lhs_atom16(X2,X3,X4,X5)
    | ~ in_closed(X1,X2,X3)
    | ~ in_closed(X1,X4,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_88]) ).

cnf(c_0_134,plain,
    ( in_closed(X1,X2,X3)
    | lhs_atom20(X2,X3,X4,X5)
    | ~ in_closed(X1,X4,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_89]) ).

cnf(c_0_135,plain,
    ( lhs_atom15(X1,X2,X3)
    | ~ less(X1,X2)
    | ~ less(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_90]) ).

cnf(c_0_136,plain,
    ( lhs_atom13(X1,X2,X3)
    | ~ less(X1,X2)
    | ~ leq(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_91]) ).

cnf(c_0_137,plain,
    ( lhs_atom11(X1,X2,X3)
    | ~ leq(X1,X2)
    | ~ less(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_92]) ).

cnf(c_0_138,plain,
    ( lhs_atom9(X1,X2,X3)
    | ~ leq(X1,X2)
    | ~ leq(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_93]) ).

cnf(c_0_139,plain,
    ( lhs_atom14(X1,X2,X3)
    | less(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_94]) ).

cnf(c_0_140,plain,
    ( lhs_atom14(X1,X2,X3)
    | less(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_94]) ).

cnf(c_0_141,plain,
    ( lhs_atom12(X1,X2,X3)
    | leq(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_95]) ).

cnf(c_0_142,plain,
    ( lhs_atom12(X1,X2,X3)
    | less(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_95]) ).

cnf(c_0_143,plain,
    ( lhs_atom10(X1,X2,X3)
    | less(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_96]) ).

cnf(c_0_144,plain,
    ( lhs_atom10(X1,X2,X3)
    | leq(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_96]) ).

cnf(c_0_145,plain,
    ( lhs_atom8(X1,X2,X3)
    | leq(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_97]) ).

cnf(c_0_146,plain,
    ( lhs_atom8(X1,X2,X3)
    | leq(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_97]) ).

cnf(c_0_147,plain,
    ( lhs_atom7(X2,X3)
    | ~ leq(X1,X2)
    | ~ leq(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_98]) ).

cnf(c_0_148,plain,
    ( lhs_atom2(X2,X3)
    | ~ leq(X1,X2)
    | ~ less(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_99]) ).

cnf(c_0_149,plain,
    ( lhs_atom2(X2,X3)
    | ~ less(X1,X2)
    | ~ leq(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_100]) ).

cnf(c_0_150,plain,
    ( lhs_atom5(X1,X2)
    | ~ leq(X1,X2)
    | ~ leq(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_101]) ).

cnf(c_0_151,plain,
    ( lhs_atom2(X2,X3)
    | ~ less(X1,X2)
    | ~ less(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_102]) ).

cnf(c_0_152,plain,
    ( lhs_atom4(X1,X2)
    | ~ less(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_103]) ).

cnf(c_0_153,plain,
    ( lhs_atom31(X1,X2)
    | X1 = conflict
    | X2 = conflict
    | ~ is_verdict(X2)
    | ~ is_verdict(X1)
    | X2 != unknown ),
    inference(split_conjunct,[status(thm)],[c_0_104]) ).

cnf(c_0_154,plain,
    ( lhs_atom31(X1,X2)
    | X1 = conflict
    | X2 = conflict
    | ~ is_verdict(X2)
    | ~ is_verdict(X1)
    | X1 != unknown ),
    inference(split_conjunct,[status(thm)],[c_0_104]) ).

cnf(c_0_155,plain,
    ( lhs_atom30(X1,X2)
    | X1 != compatible
    | X2 != compatible
    | ~ is_verdict(X1)
    | ~ is_verdict(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_105]) ).

cnf(c_0_156,plain,
    ( lhs_atom29(X1,X2)
    | ~ is_verdict(X2)
    | ~ is_verdict(X1)
    | X2 != conflict ),
    inference(split_conjunct,[status(thm)],[c_0_106]) ).

cnf(c_0_157,plain,
    ( lhs_atom29(X1,X2)
    | ~ is_verdict(X2)
    | ~ is_verdict(X1)
    | X1 != conflict ),
    inference(split_conjunct,[status(thm)],[c_0_106]) ).

cnf(c_0_158,plain,
    ( X1 = X2
    | less(X1,X2)
    | lhs_atom3(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_107]) ).

cnf(c_0_159,plain,
    ( leq(X1,X2)
    | lhs_atom6(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_108]) ).

cnf(c_0_160,plain,
    ( lhs_atom4(X1,X2)
    | X2 != X1 ),
    inference(split_conjunct,[status(thm)],[c_0_103]) ).

cnf(c_0_161,plain,
    ( X1 = unknown
    | X1 = compatible
    | X1 = conflict
    | lhs_atom28(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_109]) ).

cnf(c_0_162,plain,
    lhs_atom1(X1),
    inference(split_conjunct,[status(thm)],[c_0_110]) ).

cnf(c_0_163,plain,
    lhs_atom40,
    inference(split_conjunct,[status(thm)],[c_0_111]) ).

cnf(c_0_164,plain,
    lhs_atom39,
    inference(split_conjunct,[status(thm)],[c_0_112]) ).

cnf(c_0_165,plain,
    lhs_atom38,
    inference(split_conjunct,[status(thm)],[c_0_113]) ).

cnf(c_0_166,plain,
    lhs_atom37,
    inference(split_conjunct,[status(thm)],[c_0_114]) ).

cnf(c_0_167,plain,
    lhs_atom36,
    inference(split_conjunct,[status(thm)],[c_0_115]) ).

cnf(c_0_168,plain,
    lhs_atom35,
    inference(split_conjunct,[status(thm)],[c_0_116]) ).

cnf(c_0_169,plain,
    lhs_atom34,
    inference(split_conjunct,[status(thm)],[c_0_117]) ).

cnf(c_0_170,plain,
    lhs_atom33,
    inference(split_conjunct,[status(thm)],[c_0_118]) ).

cnf(c_0_171,plain,
    lhs_atom32,
    inference(split_conjunct,[status(thm)],[c_0_119]) ).

cnf(c_0_172,plain,
    lhs_atom27,
    inference(split_conjunct,[status(thm)],[c_0_120]) ).

cnf(c_0_173,plain,
    lhs_atom26,
    inference(split_conjunct,[status(thm)],[c_0_121]) ).

cnf(c_0_174,plain,
    lhs_atom25,
    inference(split_conjunct,[status(thm)],[c_0_122]) ).

cnf(c_0_175,plain,
    lhs_atom24,
    inference(split_conjunct,[status(thm)],[c_0_123]) ).

cnf(c_0_176,plain,
    lhs_atom23,
    inference(split_conjunct,[status(thm)],[c_0_124]) ).

cnf(c_0_177,plain,
    lhs_atom22,
    inference(split_conjunct,[status(thm)],[c_0_125]) ).

cnf(c_0_178,plain,
    ( lhs_atom21(X1,X2,X3,X4)
    | ~ in_closed(esk3_4(X1,X2,X3,X4),X1,X2) ),
    c_0_126,
    [final] ).

cnf(c_0_179,plain,
    ( lhs_atom21(X1,X2,X3,X4)
    | in_closed(esk3_4(X1,X2,X3,X4),X3,X4) ),
    c_0_127,
    [final] ).

cnf(c_0_180,plain,
    ( lhs_atom18(X1,X2,X3,X4)
    | in_closed(esk2_4(X1,X2,X3,X4),X3,X4) ),
    c_0_128,
    [final] ).

cnf(c_0_181,plain,
    ( lhs_atom18(X1,X2,X3,X4)
    | in_closed(esk2_4(X1,X2,X3,X4),X1,X2) ),
    c_0_129,
    [final] ).

cnf(c_0_182,plain,
    ( lhs_atom17(X1,X2,X3,X4)
    | in_closed(esk1_4(X1,X2,X3,X4),X3,X4) ),
    c_0_130,
    [final] ).

cnf(c_0_183,plain,
    ( lhs_atom17(X1,X2,X3,X4)
    | in_closed(esk1_4(X1,X2,X3,X4),X1,X2) ),
    c_0_131,
    [final] ).

cnf(c_0_184,plain,
    ( lhs_atom19(X2,X3,X4,X5)
    | ~ in_closed(X1,X2,X3)
    | ~ in_closed(X1,X4,X5) ),
    c_0_132,
    [final] ).

cnf(c_0_185,plain,
    ( lhs_atom16(X2,X3,X4,X5)
    | ~ in_closed(X1,X2,X3)
    | ~ in_closed(X1,X4,X5) ),
    c_0_133,
    [final] ).

cnf(c_0_186,plain,
    ( in_closed(X1,X2,X3)
    | lhs_atom20(X2,X3,X4,X5)
    | ~ in_closed(X1,X4,X5) ),
    c_0_134,
    [final] ).

cnf(c_0_187,plain,
    ( lhs_atom15(X1,X2,X3)
    | ~ less(X1,X2)
    | ~ less(X3,X1) ),
    c_0_135,
    [final] ).

cnf(c_0_188,plain,
    ( lhs_atom13(X1,X2,X3)
    | ~ less(X1,X2)
    | ~ leq(X3,X1) ),
    c_0_136,
    [final] ).

cnf(c_0_189,plain,
    ( lhs_atom11(X1,X2,X3)
    | ~ leq(X1,X2)
    | ~ less(X3,X1) ),
    c_0_137,
    [final] ).

cnf(c_0_190,plain,
    ( lhs_atom9(X1,X2,X3)
    | ~ leq(X1,X2)
    | ~ leq(X3,X1) ),
    c_0_138,
    [final] ).

cnf(c_0_191,plain,
    ( lhs_atom14(X1,X2,X3)
    | less(X3,X1) ),
    c_0_139,
    [final] ).

cnf(c_0_192,plain,
    ( lhs_atom14(X1,X2,X3)
    | less(X1,X2) ),
    c_0_140,
    [final] ).

cnf(c_0_193,plain,
    ( lhs_atom12(X1,X2,X3)
    | leq(X3,X1) ),
    c_0_141,
    [final] ).

cnf(c_0_194,plain,
    ( lhs_atom12(X1,X2,X3)
    | less(X1,X2) ),
    c_0_142,
    [final] ).

cnf(c_0_195,plain,
    ( lhs_atom10(X1,X2,X3)
    | less(X3,X1) ),
    c_0_143,
    [final] ).

cnf(c_0_196,plain,
    ( lhs_atom10(X1,X2,X3)
    | leq(X1,X2) ),
    c_0_144,
    [final] ).

cnf(c_0_197,plain,
    ( lhs_atom8(X1,X2,X3)
    | leq(X3,X1) ),
    c_0_145,
    [final] ).

cnf(c_0_198,plain,
    ( lhs_atom8(X1,X2,X3)
    | leq(X1,X2) ),
    c_0_146,
    [final] ).

cnf(c_0_199,plain,
    ( lhs_atom7(X2,X3)
    | ~ leq(X1,X2)
    | ~ leq(X3,X1) ),
    c_0_147,
    [final] ).

cnf(c_0_200,plain,
    ( lhs_atom2(X2,X3)
    | ~ leq(X1,X2)
    | ~ less(X3,X1) ),
    c_0_148,
    [final] ).

cnf(c_0_201,plain,
    ( lhs_atom2(X2,X3)
    | ~ less(X1,X2)
    | ~ leq(X3,X1) ),
    c_0_149,
    [final] ).

cnf(c_0_202,plain,
    ( lhs_atom5(X1,X2)
    | ~ leq(X1,X2)
    | ~ leq(X2,X1) ),
    c_0_150,
    [final] ).

cnf(c_0_203,plain,
    ( lhs_atom2(X2,X3)
    | ~ less(X1,X2)
    | ~ less(X3,X1) ),
    c_0_151,
    [final] ).

cnf(c_0_204,plain,
    ( lhs_atom4(X1,X2)
    | ~ less(X2,X1) ),
    c_0_152,
    [final] ).

cnf(c_0_205,plain,
    ( lhs_atom31(X1,X2)
    | X1 = conflict
    | X2 = conflict
    | ~ is_verdict(X2)
    | ~ is_verdict(X1)
    | X2 != unknown ),
    c_0_153,
    [final] ).

cnf(c_0_206,plain,
    ( lhs_atom31(X1,X2)
    | X1 = conflict
    | X2 = conflict
    | ~ is_verdict(X2)
    | ~ is_verdict(X1)
    | X1 != unknown ),
    c_0_154,
    [final] ).

cnf(c_0_207,plain,
    ( lhs_atom30(X1,X2)
    | X1 != compatible
    | X2 != compatible
    | ~ is_verdict(X1)
    | ~ is_verdict(X2) ),
    c_0_155,
    [final] ).

cnf(c_0_208,plain,
    ( lhs_atom29(X1,X2)
    | ~ is_verdict(X2)
    | ~ is_verdict(X1)
    | X2 != conflict ),
    c_0_156,
    [final] ).

cnf(c_0_209,plain,
    ( lhs_atom29(X1,X2)
    | ~ is_verdict(X2)
    | ~ is_verdict(X1)
    | X1 != conflict ),
    c_0_157,
    [final] ).

cnf(c_0_210,plain,
    ( X1 = X2
    | less(X1,X2)
    | lhs_atom3(X2,X1) ),
    c_0_158,
    [final] ).

cnf(c_0_211,plain,
    ( leq(X1,X2)
    | lhs_atom6(X2,X1) ),
    c_0_159,
    [final] ).

cnf(c_0_212,plain,
    ( lhs_atom4(X1,X2)
    | X2 != X1 ),
    c_0_160,
    [final] ).

cnf(c_0_213,plain,
    ( X1 = unknown
    | X1 = compatible
    | X1 = conflict
    | lhs_atom28(X1) ),
    c_0_161,
    [final] ).

cnf(c_0_214,plain,
    lhs_atom1(X1),
    c_0_162,
    [final] ).

cnf(c_0_215,plain,
    lhs_atom40,
    c_0_163,
    [final] ).

cnf(c_0_216,plain,
    lhs_atom39,
    c_0_164,
    [final] ).

cnf(c_0_217,plain,
    lhs_atom38,
    c_0_165,
    [final] ).

cnf(c_0_218,plain,
    lhs_atom37,
    c_0_166,
    [final] ).

cnf(c_0_219,plain,
    lhs_atom36,
    c_0_167,
    [final] ).

cnf(c_0_220,plain,
    lhs_atom35,
    c_0_168,
    [final] ).

cnf(c_0_221,plain,
    lhs_atom34,
    c_0_169,
    [final] ).

cnf(c_0_222,plain,
    lhs_atom33,
    c_0_170,
    [final] ).

cnf(c_0_223,plain,
    lhs_atom32,
    c_0_171,
    [final] ).

cnf(c_0_224,plain,
    lhs_atom27,
    c_0_172,
    [final] ).

cnf(c_0_225,plain,
    lhs_atom26,
    c_0_173,
    [final] ).

cnf(c_0_226,plain,
    lhs_atom25,
    c_0_174,
    [final] ).

cnf(c_0_227,plain,
    lhs_atom24,
    c_0_175,
    [final] ).

cnf(c_0_228,plain,
    lhs_atom23,
    c_0_176,
    [final] ).

cnf(c_0_229,plain,
    lhs_atom22,
    c_0_177,
    [final] ).

% End CNF derivation
cnf(c_0_178_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_178,def_lhs_atom21]) ).

cnf(c_0_179_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_179,def_lhs_atom21]) ).

cnf(c_0_180_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_180,def_lhs_atom18]) ).

cnf(c_0_181_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_181,def_lhs_atom18]) ).

cnf(c_0_182_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_182,def_lhs_atom17]) ).

cnf(c_0_183_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_183,def_lhs_atom17]) ).

cnf(c_0_184_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_184,def_lhs_atom19]) ).

cnf(c_0_185_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_185,def_lhs_atom16]) ).

cnf(c_0_186_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_186,def_lhs_atom20]) ).

cnf(c_0_187_0,axiom,
    ( in_open(X1,X3,X2)
    | ~ less(X1,X2)
    | ~ less(X3,X1) ),
    inference(unfold_definition,[status(thm)],[c_0_187,def_lhs_atom15]) ).

cnf(c_0_188_0,axiom,
    ( in_ropen(X1,X3,X2)
    | ~ less(X1,X2)
    | ~ leq(X3,X1) ),
    inference(unfold_definition,[status(thm)],[c_0_188,def_lhs_atom13]) ).

cnf(c_0_189_0,axiom,
    ( in_lopen(X1,X3,X2)
    | ~ leq(X1,X2)
    | ~ less(X3,X1) ),
    inference(unfold_definition,[status(thm)],[c_0_189,def_lhs_atom11]) ).

cnf(c_0_190_0,axiom,
    ( in_closed(X1,X3,X2)
    | ~ leq(X1,X2)
    | ~ leq(X3,X1) ),
    inference(unfold_definition,[status(thm)],[c_0_190,def_lhs_atom9]) ).

cnf(c_0_191_0,axiom,
    ( ~ in_open(X1,X3,X2)
    | less(X3,X1) ),
    inference(unfold_definition,[status(thm)],[c_0_191,def_lhs_atom14]) ).

cnf(c_0_192_0,axiom,
    ( ~ in_open(X1,X3,X2)
    | less(X1,X2) ),
    inference(unfold_definition,[status(thm)],[c_0_192,def_lhs_atom14]) ).

cnf(c_0_193_0,axiom,
    ( ~ in_ropen(X1,X3,X2)
    | leq(X3,X1) ),
    inference(unfold_definition,[status(thm)],[c_0_193,def_lhs_atom12]) ).

cnf(c_0_194_0,axiom,
    ( ~ in_ropen(X1,X3,X2)
    | less(X1,X2) ),
    inference(unfold_definition,[status(thm)],[c_0_194,def_lhs_atom12]) ).

cnf(c_0_195_0,axiom,
    ( ~ in_lopen(X1,X3,X2)
    | less(X3,X1) ),
    inference(unfold_definition,[status(thm)],[c_0_195,def_lhs_atom10]) ).

cnf(c_0_196_0,axiom,
    ( ~ in_lopen(X1,X3,X2)
    | leq(X1,X2) ),
    inference(unfold_definition,[status(thm)],[c_0_196,def_lhs_atom10]) ).

cnf(c_0_197_0,axiom,
    ( ~ in_closed(X1,X3,X2)
    | leq(X3,X1) ),
    inference(unfold_definition,[status(thm)],[c_0_197,def_lhs_atom8]) ).

cnf(c_0_198_0,axiom,
    ( ~ in_closed(X1,X3,X2)
    | leq(X1,X2) ),
    inference(unfold_definition,[status(thm)],[c_0_198,def_lhs_atom8]) ).

cnf(c_0_199_0,axiom,
    ( leq(X3,X2)
    | ~ leq(X1,X2)
    | ~ leq(X3,X1) ),
    inference(unfold_definition,[status(thm)],[c_0_199,def_lhs_atom7]) ).

cnf(c_0_200_0,axiom,
    ( less(X3,X2)
    | ~ leq(X1,X2)
    | ~ less(X3,X1) ),
    inference(unfold_definition,[status(thm)],[c_0_200,def_lhs_atom2]) ).

cnf(c_0_201_0,axiom,
    ( less(X3,X2)
    | ~ less(X1,X2)
    | ~ leq(X3,X1) ),
    inference(unfold_definition,[status(thm)],[c_0_201,def_lhs_atom2]) ).

cnf(c_0_202_0,axiom,
    ( X2 = X1
    | ~ leq(X1,X2)
    | ~ leq(X2,X1) ),
    inference(unfold_definition,[status(thm)],[c_0_202,def_lhs_atom5]) ).

cnf(c_0_203_0,axiom,
    ( less(X3,X2)
    | ~ less(X1,X2)
    | ~ less(X3,X1) ),
    inference(unfold_definition,[status(thm)],[c_0_203,def_lhs_atom2]) ).

cnf(c_0_204_0,axiom,
    ( leq(X2,X1)
    | ~ less(X2,X1) ),
    inference(unfold_definition,[status(thm)],[c_0_204,def_lhs_atom4]) ).

cnf(c_0_205_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_205,def_lhs_atom31]) ).

cnf(c_0_206_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_206,def_lhs_atom31]) ).

cnf(c_0_207_0,axiom,
    ( box_verdict(X2,X1) = compatible
    | X1 != compatible
    | X2 != compatible
    | ~ is_verdict(X1)
    | ~ is_verdict(X2) ),
    inference(unfold_definition,[status(thm)],[c_0_207,def_lhs_atom30]) ).

cnf(c_0_208_0,axiom,
    ( box_verdict(X2,X1) = conflict
    | ~ is_verdict(X2)
    | ~ is_verdict(X1)
    | X2 != conflict ),
    inference(unfold_definition,[status(thm)],[c_0_208,def_lhs_atom29]) ).

cnf(c_0_209_0,axiom,
    ( box_verdict(X2,X1) = conflict
    | ~ is_verdict(X2)
    | ~ is_verdict(X1)
    | X1 != conflict ),
    inference(unfold_definition,[status(thm)],[c_0_209,def_lhs_atom29]) ).

cnf(c_0_210_0,axiom,
    ( ~ leq(X1,X2)
    | X1 = X2
    | less(X1,X2) ),
    inference(unfold_definition,[status(thm)],[c_0_210,def_lhs_atom3]) ).

cnf(c_0_211_0,axiom,
    ( ~ less(X1,X2)
    | leq(X1,X2) ),
    inference(unfold_definition,[status(thm)],[c_0_211,def_lhs_atom6]) ).

cnf(c_0_212_0,axiom,
    ( leq(X2,X1)
    | X2 != X1 ),
    inference(unfold_definition,[status(thm)],[c_0_212,def_lhs_atom4]) ).

cnf(c_0_213_0,axiom,
    ( ~ is_verdict(X1)
    | X1 = unknown
    | X1 = compatible
    | X1 = conflict ),
    inference(unfold_definition,[status(thm)],[c_0_213,def_lhs_atom28]) ).

cnf(c_0_214_0,axiom,
    ~ less(X1,X1),
    inference(unfold_definition,[status(thm)],[c_0_214,def_lhs_atom1]) ).

cnf(c_0_215_0,axiom,
    v0 != v400,
    inference(unfold_definition,[status(thm)],[c_0_215,def_lhs_atom40]) ).

cnf(c_0_216_0,axiom,
    v0 != v800,
    inference(unfold_definition,[status(thm)],[c_0_216,def_lhs_atom39]) ).

cnf(c_0_217_0,axiom,
    v400 != v800,
    inference(unfold_definition,[status(thm)],[c_0_217,def_lhs_atom38]) ).

cnf(c_0_218_0,axiom,
    less(v400,v800),
    inference(unfold_definition,[status(thm)],[c_0_218,def_lhs_atom37]) ).

cnf(c_0_219_0,axiom,
    less(v0,v800),
    inference(unfold_definition,[status(thm)],[c_0_219,def_lhs_atom36]) ).

cnf(c_0_220_0,axiom,
    less(v0,v400),
    inference(unfold_definition,[status(thm)],[c_0_220,def_lhs_atom35]) ).

cnf(c_0_221_0,axiom,
    val(v800),
    inference(unfold_definition,[status(thm)],[c_0_221,def_lhs_atom34]) ).

cnf(c_0_222_0,axiom,
    val(v400),
    inference(unfold_definition,[status(thm)],[c_0_222,def_lhs_atom33]) ).

cnf(c_0_223_0,axiom,
    val(v0),
    inference(unfold_definition,[status(thm)],[c_0_223,def_lhs_atom32]) ).

cnf(c_0_224_0,axiom,
    compatible != unknown,
    inference(unfold_definition,[status(thm)],[c_0_224,def_lhs_atom27]) ).

cnf(c_0_225_0,axiom,
    conflict != unknown,
    inference(unfold_definition,[status(thm)],[c_0_225,def_lhs_atom26]) ).

cnf(c_0_226_0,axiom,
    conflict != compatible,
    inference(unfold_definition,[status(thm)],[c_0_226,def_lhs_atom25]) ).

cnf(c_0_227_0,axiom,
    is_verdict(unknown),
    inference(unfold_definition,[status(thm)],[c_0_227,def_lhs_atom24]) ).

cnf(c_0_228_0,axiom,
    is_verdict(compatible),
    inference(unfold_definition,[status(thm)],[c_0_228,def_lhs_atom23]) ).

cnf(c_0_229_0,axiom,
    is_verdict(conflict),
    inference(unfold_definition,[status(thm)],[c_0_229,def_lhs_atom22]) ).

% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,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_1_002,axiom,
    ! [X3,X4] :
      ( less(X3,X4)
      | X3 = X4
      | less(X4,X3) ),
    file('<stdin>',trichotomy) ).

fof(c_0_2_003,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_0 ).

fof(c_0_3_004,axiom,
    ! [X3,X4] :
      ( less(X3,X4)
      | X3 = X4
      | less(X4,X3) ),
    c_0_1 ).

fof(c_0_4_005,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_2])]) ).

fof(c_0_5_006,plain,
    ! [X5,X6] :
      ( less(X5,X6)
      | X5 = X6
      | less(X6,X5) ),
    inference(variable_rename,[status(thm)],[c_0_3]) ).

cnf(c_0_6_007,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_4]) ).

cnf(c_0_7_008,plain,
    ( less(X1,X2)
    | X2 = X1
    | less(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8_009,plain,
    ( box_verdict(X1,X2) = unknown
    | box_verdict(X1,X2) = compatible
    | box_verdict(X1,X2) = conflict
    | ~ is_verdict(X2)
    | ~ is_verdict(X1) ),
    c_0_6,
    [final] ).

cnf(c_0_9_010,plain,
    ( less(X1,X2)
    | X2 = X1
    | less(X2,X1) ),
    c_0_7,
    [final] ).

% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_8_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_8]) ).

cnf(c_0_8_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_8]) ).

cnf(c_0_8_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_8]) ).

cnf(c_0_8_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_8]) ).

cnf(c_0_8_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_8]) ).

cnf(c_0_9_0,axiom,
    ( less(X1,X2)
    | X2 = X1
    | less(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_9]) ).

cnf(c_0_9_1,axiom,
    ( X2 = X1
    | less(X1,X2)
    | less(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_9]) ).

cnf(c_0_9_2,axiom,
    ( less(X2,X1)
    | X2 = X1
    | less(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_9]) ).

% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_011,conjecture,
    ! [X1] :
      ( leq(v800,X1)
     => leq(v400,X1) ),
    file('<stdin>',odrl311) ).

fof(c_0_1_012,negated_conjecture,
    ~ ! [X1] :
        ( leq(v800,X1)
       => leq(v400,X1) ),
    inference(assume_negation,[status(cth)],[c_0_0]) ).

fof(c_0_2_013,negated_conjecture,
    ( leq(v800,esk1_0)
    & ~ leq(v400,esk1_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).

cnf(c_0_3_014,negated_conjecture,
    ~ leq(v400,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4_015,negated_conjecture,
    leq(v800,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5_016,negated_conjecture,
    ~ leq(v400,esk1_0),
    c_0_3,
    [final] ).

cnf(c_0_6_017,negated_conjecture,
    leq(v800,esk1_0),
    c_0_4,
    [final] ).

% End CNF derivation

%-------------------------------------------------------------
% Proof by iprover

cnf(c_37,plain,
    ( ~ less(X0,X1)
    | ~ leq(X1,X2)
    | less(X0,X2) ),
    file('/export/starexec/sandbox2/tmp/iprover_modulo_432f29.p',c_0_200_0) ).

cnf(c_139,plain,
    ( ~ less(X0,X1)
    | ~ leq(X1,X2)
    | less(X0,X2) ),
    inference(copy,[status(esa)],[c_37]) ).

cnf(c_28771,plain,
    ( ~ less(v400,v800)
    | less(v400,X0)
    | ~ leq(v800,X0) ),
    inference(instantiation,[status(thm)],[c_139]) ).

cnf(c_29073,plain,
    ( ~ less(v400,v800)
    | less(v400,sk3_esk1_0)
    | ~ leq(v800,sk3_esk1_0) ),
    inference(instantiation,[status(thm)],[c_28771]) ).

cnf(c_26,plain,
    ( leq(X0,X1)
    | ~ less(X0,X1) ),
    file('/export/starexec/sandbox2/tmp/iprover_modulo_432f29.p',c_0_211_0) ).

cnf(c_128,plain,
    ( leq(X0,X1)
    | ~ less(X0,X1) ),
    inference(copy,[status(esa)],[c_26]) ).

cnf(c_28745,plain,
    ( ~ less(v400,sk3_esk1_0)
    | leq(v400,sk3_esk1_0) ),
    inference(instantiation,[status(thm)],[c_128]) ).

cnf(c_19,plain,
    less(v400,v800),
    file('/export/starexec/sandbox2/tmp/iprover_modulo_432f29.p',c_0_218_0) ).

cnf(c_60,negated_conjecture,
    ~ leq(v400,sk3_esk1_0),
    file('/export/starexec/sandbox2/tmp/iprover_modulo_432f29.p',c_0_5) ).

cnf(c_61,negated_conjecture,
    leq(v800,sk3_esk1_0),
    file('/export/starexec/sandbox2/tmp/iprover_modulo_432f29.p',c_0_6) ).

cnf(contradiction,plain,
    $false,
    inference(minisat,[status(thm)],[c_29073,c_28745,c_19,c_60,c_61]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT076+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04  % Command  : iprover_modulo %s %d
% 0.11/0.37  % Computer : n004.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep  7 14:12:15 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.38  % Running in mono-core mode
% 0.15/0.43  % Orienting using strategy Equiv(ClausalAll)
% 0.15/0.43  % FOF problem with conjecture
% 0.15/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/sandbox2/tmp/iprover_proof_e2a13f.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_432f29.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_f155fd | grep -v "SZS"
% 0.19/0.46  
% 0.19/0.46  %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.46  
% 0.19/0.46  % 
% 0.19/0.46  % ------  iProver source info 
% 0.19/0.46  
% 0.19/0.46  % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.46  % git: non_committed_changes: true
% 0.19/0.46  % git: last_make_outside_of_git: true
% 0.19/0.46  
% 0.19/0.46  % 
% 0.19/0.46  % ------ Input Options
% 0.19/0.46  
% 0.19/0.46  % --out_options                         all
% 0.19/0.46  % --tptp_safe_out                       true
% 0.19/0.46  % --problem_path                        ""
% 0.19/0.46  % --include_path                        ""
% 0.19/0.46  % --clausifier                          .//eprover
% 0.19/0.46  % --clausifier_options                  --tstp-format  
% 0.19/0.46  % --stdin                               false
% 0.19/0.46  % --dbg_backtrace                       false
% 0.19/0.46  % --dbg_dump_prop_clauses               false
% 0.19/0.46  % --dbg_dump_prop_clauses_file          -
% 0.19/0.46  % --dbg_out_stat                        false
% 0.19/0.46  
% 0.19/0.46  % ------ General Options
% 0.19/0.46  
% 0.19/0.46  % --fof                                 false
% 0.19/0.46  % --time_out_real                       150.
% 0.19/0.46  % --time_out_prep_mult                  0.2
% 0.19/0.46  % --time_out_virtual                    -1.
% 0.19/0.46  % --schedule                            none
% 0.19/0.46  % --ground_splitting                    input
% 0.19/0.46  % --splitting_nvd                       16
% 0.19/0.46  % --non_eq_to_eq                        false
% 0.19/0.46  % --prep_gs_sim                         true
% 0.19/0.46  % --prep_unflatten                      false
% 0.19/0.46  % --prep_res_sim                        true
% 0.19/0.46  % --prep_upred                          true
% 0.19/0.46  % --res_sim_input                       true
% 0.19/0.46  % --clause_weak_htbl                    true
% 0.19/0.46  % --gc_record_bc_elim                   false
% 0.19/0.46  % --symbol_type_check                   false
% 0.19/0.46  % --clausify_out                        false
% 0.19/0.46  % --large_theory_mode                   false
% 0.19/0.46  % --prep_sem_filter                     none
% 0.19/0.46  % --prep_sem_filter_out                 false
% 0.19/0.46  % --preprocessed_out                    false
% 0.19/0.46  % --sub_typing                          false
% 0.19/0.46  % --brand_transform                     false
% 0.19/0.46  % --pure_diseq_elim                     true
% 0.19/0.46  % --min_unsat_core                      false
% 0.19/0.46  % --pred_elim                           true
% 0.19/0.46  % --add_important_lit                   false
% 0.19/0.46  % --soft_assumptions                    false
% 0.19/0.46  % --reset_solvers                       false
% 0.19/0.46  % --bc_imp_inh                          []
% 0.19/0.46  % --conj_cone_tolerance                 1.5
% 0.19/0.46  % --prolific_symb_bound                 500
% 0.19/0.46  % --lt_threshold                        2000
% 0.19/0.46  
% 0.19/0.46  % ------ SAT Options
% 0.19/0.46  
% 0.19/0.46  % --sat_mode                            false
% 0.19/0.46  % --sat_fm_restart_options              ""
% 0.19/0.46  % --sat_gr_def                          false
% 0.19/0.46  % --sat_epr_types                       true
% 0.19/0.46  % --sat_non_cyclic_types                false
% 0.19/0.46  % --sat_finite_models                   false
% 0.19/0.46  % --sat_fm_lemmas                       false
% 0.19/0.46  % --sat_fm_prep                         false
% 0.19/0.46  % --sat_fm_uc_incr                      true
% 0.19/0.46  % --sat_out_model                       small
% 0.19/0.46  % --sat_out_clauses                     false
% 0.19/0.46  
% 0.19/0.46  % ------ QBF Options
% 0.19/0.46  
% 0.19/0.46  % --qbf_mode                            false
% 0.19/0.46  % --qbf_elim_univ                       true
% 0.19/0.46  % --qbf_sk_in                           true
% 0.19/0.46  % --qbf_pred_elim                       true
% 0.19/0.46  % --qbf_split                           32
% 0.19/0.46  
% 0.19/0.46  % ------ BMC1 Options
% 0.19/0.46  
% 0.19/0.46  % --bmc1_incremental                    false
% 0.19/0.46  % --bmc1_axioms                         reachable_all
% 0.19/0.46  % --bmc1_min_bound                      0
% 0.19/0.46  % --bmc1_max_bound                      -1
% 0.19/0.46  % --bmc1_max_bound_default              -1
% 0.19/0.46  % --bmc1_symbol_reachability            true
% 0.19/0.46  % --bmc1_property_lemmas                false
% 0.19/0.46  % --bmc1_k_induction                    false
% 0.19/0.46  % --bmc1_non_equiv_states               false
% 0.19/0.46  % --bmc1_deadlock                       false
% 0.19/0.46  % --bmc1_ucm                            false
% 0.19/0.46  % --bmc1_add_unsat_core                 none
% 0.19/0.46  % --bmc1_unsat_core_children            false
% 0.19/0.46  % --bmc1_unsat_core_extrapolate_axioms  false
% 0.19/0.46  % --bmc1_out_stat                       full
% 0.19/0.46  % --bmc1_ground_init                    false
% 0.19/0.46  % --bmc1_pre_inst_next_state            false
% 0.19/0.46  % --bmc1_pre_inst_state                 false
% 0.19/0.46  % --bmc1_pre_inst_reach_state           false
% 0.19/0.46  % --bmc1_out_unsat_core                 false
% 0.19/0.46  % --bmc1_aig_witness_out                false
% 0.19/0.46  % --bmc1_verbose                        false
% 0.19/0.46  % --bmc1_dump_clauses_tptp              false
% 0.19/0.47  % --bmc1_dump_unsat_core_tptp           false
% 0.19/0.47  % --bmc1_dump_file                      -
% 0.19/0.47  % --bmc1_ucm_expand_uc_limit            128
% 0.19/0.47  % --bmc1_ucm_n_expand_iterations        6
% 0.19/0.47  % --bmc1_ucm_extend_mode                1
% 0.19/0.47  % --bmc1_ucm_init_mode                  2
% 0.19/0.47  % --bmc1_ucm_cone_mode                  none
% 0.19/0.47  % --bmc1_ucm_reduced_relation_type      0
% 0.19/0.47  % --bmc1_ucm_relax_model                4
% 0.19/0.47  % --bmc1_ucm_full_tr_after_sat          true
% 0.19/0.47  % --bmc1_ucm_expand_neg_assumptions     false
% 0.19/0.47  % --bmc1_ucm_layered_model              none
% 0.19/0.47  % --bmc1_ucm_max_lemma_size             10
% 0.19/0.47  
% 0.19/0.47  % ------ AIG Options
% 0.19/0.47  
% 0.19/0.47  % --aig_mode                            false
% 0.19/0.47  
% 0.19/0.47  % ------ Instantiation Options
% 0.19/0.47  
% 0.19/0.47  % --instantiation_flag                  true
% 0.19/0.47  % --inst_lit_sel                        [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.47  % --inst_solver_per_active              750
% 0.19/0.47  % --inst_solver_calls_frac              0.5
% 0.19/0.47  % --inst_passive_queue_type             priority_queues
% 0.19/0.47  % --inst_passive_queues                 [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.47  % --inst_passive_queues_freq            [25;2]
% 0.19/0.47  % --inst_dismatching                    true
% 0.19/0.47  % --inst_eager_unprocessed_to_passive   true
% 0.19/0.47  % --inst_prop_sim_given                 true
% 0.19/0.47  % --inst_prop_sim_new                   false
% 0.19/0.47  % --inst_orphan_elimination             true
% 0.19/0.47  % --inst_learning_loop_flag             true
% 0.19/0.47  % --inst_learning_start                 3000
% 0.19/0.47  % --inst_learning_factor                2
% 0.19/0.47  % --inst_start_prop_sim_after_learn     3
% 0.19/0.47  % --inst_sel_renew                      solver
% 0.19/0.47  % --inst_lit_activity_flag              true
% 0.19/0.47  % --inst_out_proof                      true
% 0.19/0.47  
% 0.19/0.47  % ------ Resolution Options
% 0.19/0.47  
% 0.19/0.47  % --resolution_flag                     true
% 0.19/0.47  % --res_lit_sel                         kbo_max
% 0.19/0.47  % --res_to_prop_solver                  none
% 0.19/0.47  % --res_prop_simpl_new                  false
% 0.19/0.47  % --res_prop_simpl_given                false
% 0.19/0.47  % --res_passive_queue_type              priority_queues
% 0.19/0.47  % --res_passive_queues                  [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.47  % --res_passive_queues_freq             [15;5]
% 0.19/0.47  % --res_forward_subs                    full
% 0.19/0.47  % --res_backward_subs                   full
% 0.19/0.47  % --res_forward_subs_resolution         true
% 0.19/0.47  % --res_backward_subs_resolution        true
% 0.19/0.47  % --res_orphan_elimination              false
% 0.19/0.47  % --res_time_limit                      1000.
% 0.19/0.47  % --res_out_proof                       true
% 0.19/0.47  % --proof_out_file                      /export/starexec/sandbox2/tmp/iprover_proof_e2a13f.s
% 0.19/0.47  % --modulo                              true
% 0.19/0.47  
% 0.19/0.47  % ------ Combination Options
% 0.19/0.47  
% 0.19/0.47  % --comb_res_mult                       1000
% 0.19/0.47  % --comb_inst_mult                      300
% 0.19/0.47  % ------ 
% 0.19/0.47  
% 0.19/0.47  % ------ Parsing...% successful
% 0.19/0.47  
% 0.19/0.47  % ------ 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.19/0.47  
% 0.19/0.47  % ------ Proving...
% 0.19/0.47  % ------ Problem Properties 
% 0.19/0.47  
% 0.19/0.47  % 
% 0.19/0.47  % EPR                                   false
% 0.19/0.47  % Horn                                  false
% 0.19/0.47  % Has equality                          true
% 0.19/0.47  
% 0.19/0.47  % % ------ Input Options Time Limit: Unbounded
% 0.19/0.47  
% 0.19/0.47  
% 0.19/0.47  % % ------ Current options:
% 0.19/0.47  
% 0.19/0.47  % ------ Input Options
% 0.19/0.47  
% 0.19/0.47  % --out_options                         all
% 0.19/0.47  % --tptp_safe_out                       true
% 0.19/0.47  % --problem_path                        ""
% 0.19/0.47  % --include_path                        ""
% 0.19/0.47  % --clausifier                          .//eprover
% 0.19/0.47  % --clausifier_options                  --tstp-format  
% 0.19/0.47  % --stdin                               false
% 0.19/0.47  % --dbg_backtrace                       false
% 0.19/0.47  % --dbg_dump_prop_clauses               false
% 0.19/0.47  % --dbg_dump_prop_clauses_file          -
% 0.19/0.47  % --dbg_out_stat                        false
% 0.19/0.47  
% 0.19/0.47  % ------ General Options
% 0.19/0.47  
% 0.19/0.47  % --fof                                 false
% 0.19/0.47  % --time_out_real                       150.
% 0.19/0.47  % --time_out_prep_mult                  0.2
% 0.19/0.47  % --time_out_virtual                    -1.
% 0.19/0.47  % --schedule                            none
% 0.19/0.47  % --ground_splitting                    input
% 0.19/0.47  % --splitting_nvd                       16
% 0.19/0.47  % --non_eq_to_eq                        false
% 0.19/0.47  % --prep_gs_sim                         true
% 0.19/0.47  % --prep_unflatten                      false
% 0.19/0.47  % --prep_res_sim                        true
% 0.19/0.47  % --prep_upred                          true
% 0.19/0.47  % --res_sim_input                       true
% 0.19/0.47  % --clause_weak_htbl                    true
% 0.19/0.47  % --gc_record_bc_elim                   false
% 0.19/0.47  % --symbol_type_check                   false
% 0.19/0.47  % --clausify_out                        false
% 0.19/0.47  % --large_theory_mode                   false
% 0.19/0.47  % --prep_sem_filter                     none
% 0.19/0.47  % --prep_sem_filter_out                 false
% 0.19/0.47  % --preprocessed_out                    false
% 0.19/0.47  % --sub_typing                          false
% 0.19/0.47  % --brand_transform                     false
% 0.19/0.47  % --pure_diseq_elim                     true
% 0.19/0.47  % --min_unsat_core                      false
% 0.19/0.47  % --pred_elim                           true
% 0.19/0.47  % --add_important_lit                   false
% 0.19/0.47  % --soft_assumptions                    false
% 0.19/0.47  % --reset_solvers                       false
% 0.19/0.47  % --bc_imp_inh                          []
% 0.19/0.47  % --conj_cone_tolerance                 1.5
% 0.19/0.47  % --prolific_symb_bound                 500
% 0.19/0.47  % --lt_threshold                        2000
% 0.19/0.47  
% 0.19/0.47  % ------ SAT Options
% 0.19/0.47  
% 0.19/0.47  % --sat_mode                            false
% 0.19/0.47  % --sat_fm_restart_options              ""
% 0.19/0.47  % --sat_gr_def                          false
% 0.19/0.47  % --sat_epr_types                       true
% 0.19/0.47  % --sat_non_cyclic_types                false
% 0.19/0.47  % --sat_finite_models                   false
% 0.19/0.47  % --sat_fm_lemmas                       false
% 0.19/0.47  % --sat_fm_prep                         false
% 0.19/0.47  % --sat_fm_uc_incr                      true
% 0.19/0.47  % --sat_out_model                       small
% 0.19/0.47  % --sat_out_clauses                     false
% 0.19/0.47  
% 0.19/0.47  % ------ QBF Options
% 0.19/0.47  
% 0.19/0.47  % --qbf_mode                            false
% 0.19/0.47  % --qbf_elim_univ                       true
% 0.19/0.47  % --qbf_sk_in                           true
% 0.19/0.47  % --qbf_pred_elim                       true
% 0.19/0.47  % --qbf_split                           32
% 0.19/0.47  
% 0.19/0.47  % ------ BMC1 Options
% 0.19/0.47  
% 0.19/0.47  % --bmc1_incremental                    false
% 0.19/0.47  % --bmc1_axioms                         reachable_all
% 0.19/0.47  % --bmc1_min_bound                      0
% 0.19/0.47  % --bmc1_max_bound                      -1
% 0.19/0.47  % --bmc1_max_bound_default              -1
% 0.19/0.47  % --bmc1_symbol_reachability            true
% 0.19/0.47  % --bmc1_property_lemmas                false
% 0.19/0.47  % --bmc1_k_induction                    false
% 0.19/0.47  % --bmc1_non_equiv_states               false
% 0.19/0.47  % --bmc1_deadlock                       false
% 0.19/0.47  % --bmc1_ucm                            false
% 0.19/0.47  % --bmc1_add_unsat_core                 none
% 0.19/0.47  % --bmc1_unsat_core_children            false
% 0.19/0.47  % --bmc1_unsat_core_extrapolate_axioms  false
% 0.19/0.47  % --bmc1_out_stat                       full
% 0.19/0.47  % --bmc1_ground_init                    false
% 0.19/0.47  % --bmc1_pre_inst_next_state            false
% 0.19/0.47  % --bmc1_pre_inst_state                 false
% 0.19/0.47  % --bmc1_pre_inst_reach_state           false
% 0.19/0.47  % --bmc1_out_unsat_core                 false
% 0.19/0.47  % --bmc1_aig_witness_out                false
% 0.19/0.47  % --bmc1_verbose                        false
% 0.19/0.47  % --bmc1_dump_clauses_tptp              false
% 0.19/0.47  % --bmc1_dump_unsat_core_tptp           false
% 0.19/0.47  % --bmc1_dump_file                      -
% 0.19/0.47  % --bmc1_ucm_expand_uc_limit            128
% 0.19/0.47  % --bmc1_ucm_n_expand_iterations        6
% 0.19/0.47  % --bmc1_ucm_extend_mode                1
% 0.19/0.47  % --bmc1_ucm_init_mode                  2
% 0.19/0.47  % --bmc1_ucm_cone_mode                  none
% 0.19/0.47  % --bmc1_ucm_reduced_relation_type      0
% 0.19/0.47  % --bmc1_ucm_relax_model                4
% 0.19/0.47  % --bmc1_ucm_full_tr_after_sat          true
% 0.19/0.47  % --bmc1_ucm_expand_neg_assumptions     false
% 0.19/0.47  % --bmc1_ucm_layered_model              none
% 0.19/0.47  % --bmc1_ucm_max_lemma_size             10
% 0.19/0.47  
% 0.19/0.47  % ------ AIG Options
% 0.19/0.47  
% 0.19/0.47  % --aig_mode                            false
% 0.19/0.47  
% 0.19/0.47  % ------ Instantiation Options
% 0.19/0.47  
% 0.19/0.47  % --instantiation_flag                  true
% 0.19/0.47  % --inst_lit_sel                        [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.47  % --inst_solver_per_active              750
% 0.19/0.47  % --inst_solver_calls_frac              0.5
% 0.19/0.47  % --inst_passive_queue_type             priority_queues
% 0.19/0.47  % --inst_passive_queues                 [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.47  % --inst_passive_queues_freq            [25;2]
% 0.19/0.47  % --inst_dismatching                    true
% 0.19/0.47  % --inst_eager_unprocessed_to_passive   true
% 0.19/0.47  % --inst_prop_sim_given                 true
% 7.65/8.02  % --inst_prop_sim_new                   false
% 7.65/8.02  % --inst_orphan_elimination             true
% 7.65/8.02  % --inst_learning_loop_flag             true
% 7.65/8.02  % --inst_learning_start                 3000
% 7.65/8.02  % --inst_learning_factor                2
% 7.65/8.02  % --inst_start_prop_sim_after_learn     3
% 7.65/8.02  % --inst_sel_renew                      solver
% 7.65/8.02  % --inst_lit_activity_flag              true
% 7.65/8.02  % --inst_out_proof                      true
% 7.65/8.02  
% 7.65/8.02  % ------ Resolution Options
% 7.65/8.02  
% 7.65/8.02  % --resolution_flag                     true
% 7.65/8.02  % --res_lit_sel                         kbo_max
% 7.65/8.02  % --res_to_prop_solver                  none
% 7.65/8.02  % --res_prop_simpl_new                  false
% 7.65/8.02  % --res_prop_simpl_given                false
% 7.65/8.02  % --res_passive_queue_type              priority_queues
% 7.65/8.02  % --res_passive_queues                  [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 7.65/8.02  % --res_passive_queues_freq             [15;5]
% 7.65/8.02  % --res_forward_subs                    full
% 7.65/8.02  % --res_backward_subs                   full
% 7.65/8.02  % --res_forward_subs_resolution         true
% 7.65/8.02  % --res_backward_subs_resolution        true
% 7.65/8.02  % --res_orphan_elimination              false
% 7.65/8.02  % --res_time_limit                      1000.
% 7.65/8.02  % --res_out_proof                       true
% 7.65/8.02  % --proof_out_file                      /export/starexec/sandbox2/tmp/iprover_proof_e2a13f.s
% 7.65/8.02  % --modulo                              true
% 7.65/8.02  
% 7.65/8.02  % ------ Combination Options
% 7.65/8.02  
% 7.65/8.02  % --comb_res_mult                       1000
% 7.65/8.02  % --comb_inst_mult                      300
% 7.65/8.02  % ------ 
% 7.65/8.02  
% 7.65/8.02  
% 7.65/8.02  
% 7.65/8.02  % ------ Proving...
% 7.65/8.02  % 
% 7.65/8.02  
% 7.65/8.02  
% 7.65/8.02  % ------                             Statistics
% 7.65/8.02  
% 7.65/8.02  % ------ General
% 7.65/8.02  
% 7.65/8.02  % num_of_input_clauses:                 62
% 7.65/8.02  % num_of_input_neg_conjectures:         2
% 7.65/8.02  % num_of_splits:                        0
% 7.65/8.02  % num_of_split_atoms:                   0
% 7.65/8.02  % num_of_sem_filtered_clauses:          0
% 7.65/8.02  % num_of_subtypes:                      0
% 7.65/8.02  % monotx_restored_types:                0
% 7.65/8.02  % sat_num_of_epr_types:                 0
% 7.65/8.02  % sat_num_of_non_cyclic_types:          0
% 7.65/8.02  % sat_guarded_non_collapsed_types:      0
% 7.65/8.02  % is_epr:                               0
% 7.65/8.02  % is_horn:                              0
% 7.65/8.02  % has_eq:                               1
% 7.65/8.02  % num_pure_diseq_elim:                  0
% 7.65/8.02  % simp_replaced_by:                     0
% 7.65/8.02  % res_preprocessed:                     4
% 7.65/8.02  % prep_upred:                           0
% 7.65/8.02  % prep_unflattend:                      0
% 7.65/8.02  % pred_elim_cands:                      0
% 7.65/8.02  % pred_elim:                            0
% 7.65/8.02  % pred_elim_cl:                         0
% 7.65/8.02  % pred_elim_cycles:                     0
% 7.65/8.02  % forced_gc_time:                       0
% 7.65/8.02  % gc_basic_clause_elim:                 0
% 7.65/8.02  % parsing_time:                         0.002
% 7.65/8.02  % sem_filter_time:                      0.
% 7.65/8.02  % pred_elim_time:                       0.
% 7.65/8.02  % out_proof_time:                       0.
% 7.65/8.02  % monotx_time:                          0.
% 7.65/8.02  % subtype_inf_time:                     0.
% 7.65/8.02  % unif_index_cands_time:                0.002
% 7.65/8.02  % unif_index_add_time:                  0.002
% 7.65/8.02  % total_time:                           7.58
% 7.65/8.02  % num_of_symbols:                       47
% 7.65/8.02  % num_of_terms:                         1338
% 7.65/8.02  
% 7.65/8.02  % ------ Propositional Solver
% 7.65/8.02  
% 7.65/8.02  % prop_solver_calls:                    5
% 7.65/8.02  % prop_fast_solver_calls:               6
% 7.65/8.02  % prop_num_of_clauses:                  350
% 7.65/8.02  % prop_preprocess_simplified:           579
% 7.65/8.02  % prop_fo_subsumed:                     0
% 7.65/8.02  % prop_solver_time:                     0.
% 7.65/8.02  % prop_fast_solver_time:                0.
% 7.65/8.02  % prop_unsat_core_time:                 0.
% 7.65/8.02  
% 7.65/8.02  % ------ QBF 
% 7.65/8.02  
% 7.65/8.02  % qbf_q_res:                            0
% 7.65/8.02  % qbf_num_tautologies:                  0
% 7.65/8.02  % qbf_prep_cycles:                      0
% 7.65/8.02  
% 7.65/8.02  % ------ BMC1
% 7.65/8.02  
% 7.65/8.02  % bmc1_current_bound:                   -1
% 7.65/8.02  % bmc1_last_solved_bound:               -1
% 7.65/8.02  % bmc1_unsat_core_size:                 -1
% 7.65/8.02  % bmc1_unsat_core_parents_size:         -1
% 7.65/8.02  % bmc1_merge_next_fun:                  0
% 7.65/8.02  % bmc1_unsat_core_clauses_time:         0.
% 7.65/8.02  
% 7.65/8.02  % ------ Instantiation
% 7.65/8.02  
% 7.65/8.02  % inst_num_of_clauses:                  233
% 7.65/8.02  % inst_num_in_passive:                  120
% 7.65/8.02  % inst_num_in_active:                   111
% 7.65/8.02  % inst_num_in_unprocessed:              0
% 7.65/8.02  % inst_num_of_loops:                    117
% 7.65/8.02  % inst_num_of_learning_restarts:        0
% 7.65/8.02  % inst_num_moves_active_passive:        4
% 7.65/8.02  % inst_lit_activity:                    92
% 7.65/8.02  % inst_lit_activity_moves:              0
% 7.65/8.02  % inst_num_tautologies:                 0
% 7.65/8.02  % inst_num_prop_implied:                0
% 7.65/8.02  % inst_num_existing_simplified:         0
% 7.65/8.02  % inst_num_eq_res_simplified:           0
% 7.65/8.02  % inst_num_child_elim:                  0
% 7.65/8.02  % inst_num_of_dismatching_blockings:    16
% 7.65/8.02  % inst_num_of_non_proper_insts:         149
% 7.65/8.02  % inst_num_of_duplicates:               29
% 7.65/8.02  % inst_inst_num_from_inst_to_res:       0
% 7.65/8.02  % inst_dismatching_checking_time:       0.
% 7.65/8.02  
% 7.65/8.02  % ------ Resolution
% 7.65/8.02  
% 7.65/8.02  % res_num_of_clauses:                   1860
% 7.65/8.02  % res_num_in_passive:                   1144
% 7.65/8.02  % res_num_in_active:                    709
% 7.65/8.02  % res_num_of_loops:                     1000
% 7.65/8.02  % res_forward_subset_subsumed:          375
% 7.65/8.02  % res_backward_subset_subsumed:         13
% 7.65/8.02  % res_forward_subsumed:                 267
% 7.65/8.02  % res_backward_subsumed:                0
% 7.65/8.02  % res_forward_subsumption_resolution:   323
% 7.65/8.02  % res_backward_subsumption_resolution:  0
% 7.65/8.02  % res_clause_to_clause_subsumption:     300124
% 7.65/8.02  % res_orphan_elimination:               0
% 7.65/8.02  % res_tautology_del:                    0
% 7.65/8.02  % res_num_eq_res_simplified:            0
% 7.65/8.02  % res_num_sel_changes:                  0
% 7.65/8.02  % res_moves_from_active_to_pass:        0
% 7.65/8.02  
% 7.65/8.03  % Status Unsatisfiable
% 7.65/8.03  % SZS status Theorem
% 7.65/8.03  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------