TSTP Solution File: SET013-1 by iProverMo---2.5-0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProverMo---2.5-0.1
% Problem  : SET013-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : iprover_modulo %s %d

% Computer : n022.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Tue Jul 19 02:08:22 EDT 2022

% Result   : Unsatisfiable 1.79s 2.03s
% Output   : CNFRefutation 1.79s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named input)

% Comments : 
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
cnf(reflexivity_for_equal_elements,axiom,
    equal_elements(X,X),
    input ).

fof(reflexivity_for_equal_elements_0,plain,
    ! [X] :
      ( equal_elements(X,X)
      | $false ),
    inference(orientation,[status(thm)],[reflexivity_for_equal_elements]) ).

cnf(reflexivity_for_set_equal,axiom,
    equal_sets(Xs,Xs),
    input ).

fof(reflexivity_for_set_equal_0,plain,
    ! [Xs] :
      ( equal_sets(Xs,Xs)
      | $false ),
    inference(orientation,[status(thm)],[reflexivity_for_set_equal]) ).

cnf(empty_set,axiom,
    ~ member(X,empty_set),
    input ).

fof(empty_set_0,plain,
    ! [X] :
      ( ~ member(X,empty_set)
      | $false ),
    inference(orientation,[status(thm)],[empty_set]) ).

fof(def_lhs_atom1,axiom,
    ! [X] :
      ( lhs_atom1(X)
    <=> ~ member(X,empty_set) ),
    inference(definition,[],]) ).

fof(to_be_clausified_0,plain,
    ! [X] :
      ( lhs_atom1(X)
      | $false ),
    inference(fold_definition,[status(thm)],[empty_set_0,def_lhs_atom1]) ).

fof(def_lhs_atom2,axiom,
    ! [Xs] :
      ( lhs_atom2(Xs)
    <=> equal_sets(Xs,Xs) ),
    inference(definition,[],]) ).

fof(to_be_clausified_1,plain,
    ! [Xs] :
      ( lhs_atom2(Xs)
      | $false ),
    inference(fold_definition,[status(thm)],[reflexivity_for_set_equal_0,def_lhs_atom2]) ).

fof(def_lhs_atom3,axiom,
    ! [X] :
      ( lhs_atom3(X)
    <=> equal_elements(X,X) ),
    inference(definition,[],]) ).

fof(to_be_clausified_2,plain,
    ! [X] :
      ( lhs_atom3(X)
      | $false ),
    inference(fold_definition,[status(thm)],[reflexivity_for_equal_elements_0,def_lhs_atom3]) ).

% Start CNF derivation
fof(c_0_0,axiom,
    ! [X1] :
      ( lhs_atom3(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_2) ).

fof(c_0_1,axiom,
    ! [X2] :
      ( lhs_atom2(X2)
      | ~ $true ),
    file('<stdin>',to_be_clausified_1) ).

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

fof(c_0_3,plain,
    ! [X1] : lhs_atom3(X1),
    inference(fof_simplification,[status(thm)],[c_0_0]) ).

fof(c_0_4,plain,
    ! [X2] : lhs_atom2(X2),
    inference(fof_simplification,[status(thm)],[c_0_1]) ).

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

fof(c_0_6,plain,
    ! [X2] : lhs_atom3(X2),
    inference(variable_rename,[status(thm)],[c_0_3]) ).

fof(c_0_7,plain,
    ! [X3] : lhs_atom2(X3),
    inference(variable_rename,[status(thm)],[c_0_4]) ).

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

cnf(c_0_9,plain,
    lhs_atom3(X1),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    lhs_atom2(X1),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    lhs_atom1(X1),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,plain,
    lhs_atom3(X1),
    c_0_9,
    [final] ).

cnf(c_0_13,plain,
    lhs_atom2(X1),
    c_0_10,
    [final] ).

cnf(c_0_14,plain,
    lhs_atom1(X1),
    c_0_11,
    [final] ).

% End CNF derivation
cnf(c_0_12_0,axiom,
    equal_elements(X1,X1),
    inference(unfold_definition,[status(thm)],[c_0_12,def_lhs_atom3]) ).

cnf(c_0_13_0,axiom,
    equal_sets(X1,X1),
    inference(unfold_definition,[status(thm)],[c_0_13,def_lhs_atom2]) ).

cnf(c_0_14_0,axiom,
    ~ member(X1,empty_set),
    inference(unfold_definition,[status(thm)],[c_0_14,def_lhs_atom1]) ).

% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
    ! [X5,X6,X3] :
      ( ~ member(X3,union(X6,X5))
      | member(X3,X6)
      | member(X3,X5) ),
    file('<stdin>',member_of_union_is_member_of_one_set) ).

fof(c_0_1_002,axiom,
    ! [X5,X6,X3] :
      ( ~ member(X3,X6)
      | ~ member(X3,X5)
      | member(X3,intersection(X6,X5)) ),
    file('<stdin>',member_of_both_is_member_of_intersection) ).

fof(c_0_2_003,axiom,
    ! [X9,X10] :
      ( ~ member(member_of_1_not_of_2(X10,X9),X9)
      | subset(X10,X9) ),
    file('<stdin>',subsets_axiom2) ).

fof(c_0_3_004,axiom,
    ! [X5,X6,X3] :
      ( ~ member(X3,intersection(X6,X5))
      | member(X3,X6) ),
    file('<stdin>',member_of_intersection_is_member_of_set1) ).

fof(c_0_4_005,axiom,
    ! [X5,X6,X3] :
      ( ~ member(X3,intersection(X6,X5))
      | member(X3,X5) ),
    file('<stdin>',member_of_intersection_is_member_of_set2) ).

fof(c_0_5_006,axiom,
    ! [X5,X6,X3] :
      ( ~ member(X3,X6)
      | member(X3,union(X6,X5)) ),
    file('<stdin>',member_of_set1_is_member_of_union) ).

fof(c_0_6_007,axiom,
    ! [X5,X6,X3] :
      ( ~ member(X3,X5)
      | member(X3,union(X6,X5)) ),
    file('<stdin>',member_of_set2_is_member_of_union) ).

fof(c_0_7_008,axiom,
    ! [X9,X10,X11] :
      ( ~ member(X11,X10)
      | ~ subset(X10,X9)
      | member(X11,X9) ),
    file('<stdin>',membership_in_subsets) ).

fof(c_0_8_009,axiom,
    ! [X7,X8] :
      ( ~ subset(X8,X7)
      | ~ subset(X7,X8)
      | equal_sets(X7,X8) ),
    file('<stdin>',subsets_are_set_equal_sets) ).

fof(c_0_9_010,axiom,
    ! [X4,X5,X6] :
      ( ~ equal_sets(X6,X5)
      | ~ equal_sets(X5,X4)
      | equal_sets(X6,X4) ),
    file('<stdin>',transitivity_for_set_equal) ).

fof(c_0_10_011,axiom,
    ! [X1,X2,X3] :
      ( ~ equal_elements(X3,X2)
      | ~ equal_elements(X2,X1)
      | equal_elements(X3,X1) ),
    file('<stdin>',transitivity_for_equal_elements) ).

fof(c_0_11_012,axiom,
    ! [X6,X3] :
      ( ~ member(X3,X6)
      | ~ member(X3,complement(X6)) ),
    file('<stdin>',not_member_of_set_and_complement) ).

fof(c_0_12_013,axiom,
    ! [X9,X10] :
      ( subset(X10,X9)
      | member(member_of_1_not_of_2(X10,X9),X10) ),
    file('<stdin>',subsets_axiom1) ).

fof(c_0_13_014,axiom,
    ! [X9,X10] :
      ( ~ equal_sets(X10,X9)
      | subset(X10,X9) ),
    file('<stdin>',set_equal_sets_are_subsets1) ).

fof(c_0_14_015,axiom,
    ! [X9,X10] :
      ( ~ equal_sets(X9,X10)
      | subset(X10,X9) ),
    file('<stdin>',set_equal_sets_are_subsets2) ).

fof(c_0_15,axiom,
    ! [X5,X6] :
      ( ~ equal_sets(X6,X5)
      | equal_sets(X5,X6) ),
    file('<stdin>',symmetry_for_set_equal) ).

fof(c_0_16,axiom,
    ! [X2,X3] :
      ( ~ equal_elements(X3,X2)
      | equal_elements(X2,X3) ),
    file('<stdin>',symmetry_for_equal_elements) ).

fof(c_0_17,axiom,
    ! [X6,X3] :
      ( member(X3,X6)
      | member(X3,complement(X6)) ),
    file('<stdin>',member_of_set_or_complement) ).

fof(c_0_18,plain,
    ! [X5,X6,X3] :
      ( ~ member(X3,union(X6,X5))
      | member(X3,X6)
      | member(X3,X5) ),
    inference(fof_simplification,[status(thm)],[c_0_0]) ).

fof(c_0_19,plain,
    ! [X5,X6,X3] :
      ( ~ member(X3,X6)
      | ~ member(X3,X5)
      | member(X3,intersection(X6,X5)) ),
    inference(fof_simplification,[status(thm)],[c_0_1]) ).

fof(c_0_20,plain,
    ! [X9,X10] :
      ( ~ member(member_of_1_not_of_2(X10,X9),X9)
      | subset(X10,X9) ),
    inference(fof_simplification,[status(thm)],[c_0_2]) ).

fof(c_0_21,plain,
    ! [X5,X6,X3] :
      ( ~ member(X3,intersection(X6,X5))
      | member(X3,X6) ),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

fof(c_0_22,plain,
    ! [X5,X6,X3] :
      ( ~ member(X3,intersection(X6,X5))
      | member(X3,X5) ),
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

fof(c_0_23,plain,
    ! [X5,X6,X3] :
      ( ~ member(X3,X6)
      | member(X3,union(X6,X5)) ),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

fof(c_0_24,plain,
    ! [X5,X6,X3] :
      ( ~ member(X3,X5)
      | member(X3,union(X6,X5)) ),
    inference(fof_simplification,[status(thm)],[c_0_6]) ).

fof(c_0_25,plain,
    ! [X9,X10,X11] :
      ( ~ member(X11,X10)
      | ~ subset(X10,X9)
      | member(X11,X9) ),
    inference(fof_simplification,[status(thm)],[c_0_7]) ).

fof(c_0_26,plain,
    ! [X7,X8] :
      ( ~ subset(X8,X7)
      | ~ subset(X7,X8)
      | equal_sets(X7,X8) ),
    inference(fof_simplification,[status(thm)],[c_0_8]) ).

fof(c_0_27,plain,
    ! [X4,X5,X6] :
      ( ~ equal_sets(X6,X5)
      | ~ equal_sets(X5,X4)
      | equal_sets(X6,X4) ),
    inference(fof_simplification,[status(thm)],[c_0_9]) ).

fof(c_0_28,plain,
    ! [X1,X2,X3] :
      ( ~ equal_elements(X3,X2)
      | ~ equal_elements(X2,X1)
      | equal_elements(X3,X1) ),
    inference(fof_simplification,[status(thm)],[c_0_10]) ).

fof(c_0_29,plain,
    ! [X6,X3] :
      ( ~ member(X3,X6)
      | ~ member(X3,complement(X6)) ),
    inference(fof_simplification,[status(thm)],[c_0_11]) ).

fof(c_0_30,axiom,
    ! [X9,X10] :
      ( subset(X10,X9)
      | member(member_of_1_not_of_2(X10,X9),X10) ),
    c_0_12 ).

fof(c_0_31,plain,
    ! [X9,X10] :
      ( ~ equal_sets(X10,X9)
      | subset(X10,X9) ),
    inference(fof_simplification,[status(thm)],[c_0_13]) ).

fof(c_0_32,plain,
    ! [X9,X10] :
      ( ~ equal_sets(X9,X10)
      | subset(X10,X9) ),
    inference(fof_simplification,[status(thm)],[c_0_14]) ).

fof(c_0_33,plain,
    ! [X5,X6] :
      ( ~ equal_sets(X6,X5)
      | equal_sets(X5,X6) ),
    inference(fof_simplification,[status(thm)],[c_0_15]) ).

fof(c_0_34,plain,
    ! [X2,X3] :
      ( ~ equal_elements(X3,X2)
      | equal_elements(X2,X3) ),
    inference(fof_simplification,[status(thm)],[c_0_16]) ).

fof(c_0_35,axiom,
    ! [X6,X3] :
      ( member(X3,X6)
      | member(X3,complement(X6)) ),
    c_0_17 ).

fof(c_0_36,plain,
    ! [X7,X8,X9] :
      ( ~ member(X9,union(X8,X7))
      | member(X9,X8)
      | member(X9,X7) ),
    inference(variable_rename,[status(thm)],[c_0_18]) ).

fof(c_0_37,plain,
    ! [X7,X8,X9] :
      ( ~ member(X9,X8)
      | ~ member(X9,X7)
      | member(X9,intersection(X8,X7)) ),
    inference(variable_rename,[status(thm)],[c_0_19]) ).

fof(c_0_38,plain,
    ! [X11,X12] :
      ( ~ member(member_of_1_not_of_2(X12,X11),X11)
      | subset(X12,X11) ),
    inference(variable_rename,[status(thm)],[c_0_20]) ).

fof(c_0_39,plain,
    ! [X7,X8,X9] :
      ( ~ member(X9,intersection(X8,X7))
      | member(X9,X8) ),
    inference(variable_rename,[status(thm)],[c_0_21]) ).

fof(c_0_40,plain,
    ! [X7,X8,X9] :
      ( ~ member(X9,intersection(X8,X7))
      | member(X9,X7) ),
    inference(variable_rename,[status(thm)],[c_0_22]) ).

fof(c_0_41,plain,
    ! [X7,X8,X9] :
      ( ~ member(X9,X8)
      | member(X9,union(X8,X7)) ),
    inference(variable_rename,[status(thm)],[c_0_23]) ).

fof(c_0_42,plain,
    ! [X7,X8,X9] :
      ( ~ member(X9,X7)
      | member(X9,union(X8,X7)) ),
    inference(variable_rename,[status(thm)],[c_0_24]) ).

fof(c_0_43,plain,
    ! [X12,X13,X14] :
      ( ~ member(X14,X13)
      | ~ subset(X13,X12)
      | member(X14,X12) ),
    inference(variable_rename,[status(thm)],[c_0_25]) ).

fof(c_0_44,plain,
    ! [X9,X10] :
      ( ~ subset(X10,X9)
      | ~ subset(X9,X10)
      | equal_sets(X9,X10) ),
    inference(variable_rename,[status(thm)],[c_0_26]) ).

fof(c_0_45,plain,
    ! [X7,X8,X9] :
      ( ~ equal_sets(X9,X8)
      | ~ equal_sets(X8,X7)
      | equal_sets(X9,X7) ),
    inference(variable_rename,[status(thm)],[c_0_27]) ).

fof(c_0_46,plain,
    ! [X4,X5,X6] :
      ( ~ equal_elements(X6,X5)
      | ~ equal_elements(X5,X4)
      | equal_elements(X6,X4) ),
    inference(variable_rename,[status(thm)],[c_0_28]) ).

fof(c_0_47,plain,
    ! [X7,X8] :
      ( ~ member(X8,X7)
      | ~ member(X8,complement(X7)) ),
    inference(variable_rename,[status(thm)],[c_0_29]) ).

fof(c_0_48,plain,
    ! [X11,X12] :
      ( subset(X12,X11)
      | member(member_of_1_not_of_2(X12,X11),X12) ),
    inference(variable_rename,[status(thm)],[c_0_30]) ).

fof(c_0_49,plain,
    ! [X11,X12] :
      ( ~ equal_sets(X12,X11)
      | subset(X12,X11) ),
    inference(variable_rename,[status(thm)],[c_0_31]) ).

fof(c_0_50,plain,
    ! [X11,X12] :
      ( ~ equal_sets(X11,X12)
      | subset(X12,X11) ),
    inference(variable_rename,[status(thm)],[c_0_32]) ).

fof(c_0_51,plain,
    ! [X7,X8] :
      ( ~ equal_sets(X8,X7)
      | equal_sets(X7,X8) ),
    inference(variable_rename,[status(thm)],[c_0_33]) ).

fof(c_0_52,plain,
    ! [X4,X5] :
      ( ~ equal_elements(X5,X4)
      | equal_elements(X4,X5) ),
    inference(variable_rename,[status(thm)],[c_0_34]) ).

fof(c_0_53,plain,
    ! [X7,X8] :
      ( member(X8,X7)
      | member(X8,complement(X7)) ),
    inference(variable_rename,[status(thm)],[c_0_35]) ).

cnf(c_0_54,plain,
    ( member(X1,X2)
    | member(X1,X3)
    | ~ member(X1,union(X3,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_55,plain,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X3)
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

cnf(c_0_56,plain,
    ( subset(X1,X2)
    | ~ member(member_of_1_not_of_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_38]) ).

cnf(c_0_57,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_58,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X3,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_40]) ).

cnf(c_0_59,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_41]) ).

cnf(c_0_60,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_42]) ).

cnf(c_0_61,plain,
    ( member(X1,X2)
    | ~ subset(X3,X2)
    | ~ member(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_62,plain,
    ( equal_sets(X1,X2)
    | ~ subset(X1,X2)
    | ~ subset(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_44]) ).

cnf(c_0_63,plain,
    ( equal_sets(X1,X2)
    | ~ equal_sets(X3,X2)
    | ~ equal_sets(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_45]) ).

cnf(c_0_64,plain,
    ( equal_elements(X1,X2)
    | ~ equal_elements(X3,X2)
    | ~ equal_elements(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_46]) ).

cnf(c_0_65,plain,
    ( ~ member(X1,complement(X2))
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_47]) ).

cnf(c_0_66,plain,
    ( member(member_of_1_not_of_2(X1,X2),X1)
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_48]) ).

cnf(c_0_67,plain,
    ( subset(X1,X2)
    | ~ equal_sets(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_49]) ).

cnf(c_0_68,plain,
    ( subset(X1,X2)
    | ~ equal_sets(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_50]) ).

cnf(c_0_69,plain,
    ( equal_sets(X1,X2)
    | ~ equal_sets(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_51]) ).

cnf(c_0_70,plain,
    ( equal_elements(X1,X2)
    | ~ equal_elements(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_52]) ).

cnf(c_0_71,plain,
    ( member(X1,complement(X2))
    | member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_53]) ).

cnf(c_0_72,plain,
    ( member(X1,X2)
    | member(X1,X3)
    | ~ member(X1,union(X3,X2)) ),
    c_0_54,
    [final] ).

cnf(c_0_73,plain,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X3)
    | ~ member(X1,X2) ),
    c_0_55,
    [final] ).

cnf(c_0_74,plain,
    ( subset(X1,X2)
    | ~ member(member_of_1_not_of_2(X1,X2),X2) ),
    c_0_56,
    [final] ).

cnf(c_0_75,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    c_0_57,
    [final] ).

cnf(c_0_76,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X3,X2)) ),
    c_0_58,
    [final] ).

cnf(c_0_77,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X2) ),
    c_0_59,
    [final] ).

cnf(c_0_78,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X3) ),
    c_0_60,
    [final] ).

cnf(c_0_79,plain,
    ( member(X1,X2)
    | ~ subset(X3,X2)
    | ~ member(X1,X3) ),
    c_0_61,
    [final] ).

cnf(c_0_80,plain,
    ( equal_sets(X1,X2)
    | ~ subset(X1,X2)
    | ~ subset(X2,X1) ),
    c_0_62,
    [final] ).

cnf(c_0_81,plain,
    ( equal_sets(X1,X2)
    | ~ equal_sets(X3,X2)
    | ~ equal_sets(X1,X3) ),
    c_0_63,
    [final] ).

cnf(c_0_82,plain,
    ( equal_elements(X1,X2)
    | ~ equal_elements(X3,X2)
    | ~ equal_elements(X1,X3) ),
    c_0_64,
    [final] ).

cnf(c_0_83,plain,
    ( ~ member(X1,complement(X2))
    | ~ member(X1,X2) ),
    c_0_65,
    [final] ).

cnf(c_0_84,plain,
    ( member(member_of_1_not_of_2(X1,X2),X1)
    | subset(X1,X2) ),
    c_0_66,
    [final] ).

cnf(c_0_85,plain,
    ( subset(X1,X2)
    | ~ equal_sets(X1,X2) ),
    c_0_67,
    [final] ).

cnf(c_0_86,plain,
    ( subset(X1,X2)
    | ~ equal_sets(X2,X1) ),
    c_0_68,
    [final] ).

cnf(c_0_87,plain,
    ( equal_sets(X1,X2)
    | ~ equal_sets(X2,X1) ),
    c_0_69,
    [final] ).

cnf(c_0_88,plain,
    ( equal_elements(X1,X2)
    | ~ equal_elements(X2,X1) ),
    c_0_70,
    [final] ).

cnf(c_0_89,plain,
    ( member(X1,complement(X2))
    | member(X1,X2) ),
    c_0_71,
    [final] ).

% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_72_0,axiom,
    ( member(X1,X2)
    | member(X1,X3)
    | ~ member(X1,union(X3,X2)) ),
    inference(literals_permutation,[status(thm)],[c_0_72]) ).

cnf(c_0_72_1,axiom,
    ( member(X1,X3)
    | member(X1,X2)
    | ~ member(X1,union(X3,X2)) ),
    inference(literals_permutation,[status(thm)],[c_0_72]) ).

cnf(c_0_72_2,axiom,
    ( ~ member(X1,union(X3,X2))
    | member(X1,X3)
    | member(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_72]) ).

cnf(c_0_73_0,axiom,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X3)
    | ~ member(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_73]) ).

cnf(c_0_73_1,axiom,
    ( ~ member(X1,X3)
    | member(X1,intersection(X2,X3))
    | ~ member(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_73]) ).

cnf(c_0_73_2,axiom,
    ( ~ member(X1,X2)
    | ~ member(X1,X3)
    | member(X1,intersection(X2,X3)) ),
    inference(literals_permutation,[status(thm)],[c_0_73]) ).

cnf(c_0_74_0,axiom,
    ( subset(X1,X2)
    | ~ member(member_of_1_not_of_2(X1,X2),X2) ),
    inference(literals_permutation,[status(thm)],[c_0_74]) ).

cnf(c_0_74_1,axiom,
    ( ~ member(member_of_1_not_of_2(X1,X2),X2)
    | subset(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_74]) ).

cnf(c_0_75_0,axiom,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    inference(literals_permutation,[status(thm)],[c_0_75]) ).

cnf(c_0_75_1,axiom,
    ( ~ member(X1,intersection(X2,X3))
    | member(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_75]) ).

cnf(c_0_76_0,axiom,
    ( member(X1,X2)
    | ~ member(X1,intersection(X3,X2)) ),
    inference(literals_permutation,[status(thm)],[c_0_76]) ).

cnf(c_0_76_1,axiom,
    ( ~ member(X1,intersection(X3,X2))
    | member(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_76]) ).

cnf(c_0_77_0,axiom,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_77]) ).

cnf(c_0_77_1,axiom,
    ( ~ member(X1,X2)
    | member(X1,union(X2,X3)) ),
    inference(literals_permutation,[status(thm)],[c_0_77]) ).

cnf(c_0_78_0,axiom,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_78]) ).

cnf(c_0_78_1,axiom,
    ( ~ member(X1,X3)
    | member(X1,union(X2,X3)) ),
    inference(literals_permutation,[status(thm)],[c_0_78]) ).

cnf(c_0_79_0,axiom,
    ( member(X1,X2)
    | ~ subset(X3,X2)
    | ~ member(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_79]) ).

cnf(c_0_79_1,axiom,
    ( ~ subset(X3,X2)
    | member(X1,X2)
    | ~ member(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_79]) ).

cnf(c_0_79_2,axiom,
    ( ~ member(X1,X3)
    | ~ subset(X3,X2)
    | member(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_79]) ).

cnf(c_0_80_0,axiom,
    ( equal_sets(X1,X2)
    | ~ subset(X1,X2)
    | ~ subset(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_80]) ).

cnf(c_0_80_1,axiom,
    ( ~ subset(X1,X2)
    | equal_sets(X1,X2)
    | ~ subset(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_80]) ).

cnf(c_0_80_2,axiom,
    ( ~ subset(X2,X1)
    | ~ subset(X1,X2)
    | equal_sets(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_80]) ).

cnf(c_0_81_0,axiom,
    ( equal_sets(X1,X2)
    | ~ equal_sets(X3,X2)
    | ~ equal_sets(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_81]) ).

cnf(c_0_81_1,axiom,
    ( ~ equal_sets(X3,X2)
    | equal_sets(X1,X2)
    | ~ equal_sets(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_81]) ).

cnf(c_0_81_2,axiom,
    ( ~ equal_sets(X1,X3)
    | ~ equal_sets(X3,X2)
    | equal_sets(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_81]) ).

cnf(c_0_82_0,axiom,
    ( equal_elements(X1,X2)
    | ~ equal_elements(X3,X2)
    | ~ equal_elements(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_82]) ).

cnf(c_0_82_1,axiom,
    ( ~ equal_elements(X3,X2)
    | equal_elements(X1,X2)
    | ~ equal_elements(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_82]) ).

cnf(c_0_82_2,axiom,
    ( ~ equal_elements(X1,X3)
    | ~ equal_elements(X3,X2)
    | equal_elements(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_82]) ).

cnf(c_0_83_0,axiom,
    ( ~ member(X1,complement(X2))
    | ~ member(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_83]) ).

cnf(c_0_83_1,axiom,
    ( ~ member(X1,X2)
    | ~ member(X1,complement(X2)) ),
    inference(literals_permutation,[status(thm)],[c_0_83]) ).

cnf(c_0_84_0,axiom,
    ( member(member_of_1_not_of_2(X1,X2),X1)
    | subset(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_84]) ).

cnf(c_0_84_1,axiom,
    ( subset(X1,X2)
    | member(member_of_1_not_of_2(X1,X2),X1) ),
    inference(literals_permutation,[status(thm)],[c_0_84]) ).

cnf(c_0_85_0,axiom,
    ( subset(X1,X2)
    | ~ equal_sets(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_85]) ).

cnf(c_0_85_1,axiom,
    ( ~ equal_sets(X1,X2)
    | subset(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_85]) ).

cnf(c_0_86_0,axiom,
    ( subset(X1,X2)
    | ~ equal_sets(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_86]) ).

cnf(c_0_86_1,axiom,
    ( ~ equal_sets(X2,X1)
    | subset(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_86]) ).

cnf(c_0_87_0,axiom,
    ( equal_sets(X1,X2)
    | ~ equal_sets(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_87]) ).

cnf(c_0_87_1,axiom,
    ( ~ equal_sets(X2,X1)
    | equal_sets(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_87]) ).

cnf(c_0_88_0,axiom,
    ( equal_elements(X1,X2)
    | ~ equal_elements(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_88]) ).

cnf(c_0_88_1,axiom,
    ( ~ equal_elements(X2,X1)
    | equal_elements(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_88]) ).

cnf(c_0_89_0,axiom,
    ( member(X1,complement(X2))
    | member(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_89]) ).

cnf(c_0_89_1,axiom,
    ( member(X1,X2)
    | member(X1,complement(X2)) ),
    inference(literals_permutation,[status(thm)],[c_0_89]) ).

% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_016,negated_conjecture,
    ~ equal_sets(intersection(as,bs),intersection(bs,as)),
    file('<stdin>',prove_commutativity) ).

fof(c_0_1_017,negated_conjecture,
    ~ equal_sets(intersection(as,bs),intersection(bs,as)),
    inference(fof_simplification,[status(thm)],[c_0_0]) ).

fof(c_0_2_018,negated_conjecture,
    ~ equal_sets(intersection(as,bs),intersection(bs,as)),
    c_0_1 ).

cnf(c_0_3_019,negated_conjecture,
    ~ equal_sets(intersection(as,bs),intersection(bs,as)),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4_020,negated_conjecture,
    ~ equal_sets(intersection(as,bs),intersection(bs,as)),
    c_0_3,
    [final] ).

% End CNF derivation

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

cnf(c_45,negated_conjecture,
    ~ equal_sets(intersection(as,bs),intersection(bs,as)),
    file('/export/starexec/sandbox/tmp/iprover_modulo_5f206c.p',c_0_4) ).

cnf(c_58,negated_conjecture,
    ~ equal_sets(intersection(as,bs),intersection(bs,as)),
    inference(copy,[status(esa)],[c_45]) ).

cnf(c_62,negated_conjecture,
    ~ equal_sets(intersection(as,bs),intersection(bs,as)),
    inference(copy,[status(esa)],[c_58]) ).

cnf(c_63,negated_conjecture,
    ~ equal_sets(intersection(as,bs),intersection(bs,as)),
    inference(copy,[status(esa)],[c_62]) ).

cnf(c_64,negated_conjecture,
    ~ equal_sets(intersection(as,bs),intersection(bs,as)),
    inference(copy,[status(esa)],[c_63]) ).

cnf(c_201,plain,
    ~ equal_sets(intersection(as,bs),intersection(bs,as)),
    inference(copy,[status(esa)],[c_64]) ).

cnf(c_19,plain,
    ( ~ subset(X0,X1)
    | ~ subset(X1,X0)
    | equal_sets(X1,X0) ),
    file('/export/starexec/sandbox/tmp/iprover_modulo_5f206c.p',c_0_80_0) ).

cnf(c_149,plain,
    ( ~ subset(X0,X1)
    | ~ subset(X1,X0)
    | equal_sets(X1,X0) ),
    inference(copy,[status(esa)],[c_19]) ).

cnf(c_206,plain,
    ( ~ subset(intersection(as,bs),intersection(bs,as))
    | ~ subset(intersection(bs,as),intersection(as,bs)) ),
    inference(resolution,[status(thm)],[c_201,c_149]) ).

cnf(c_207,plain,
    ( ~ subset(intersection(as,bs),intersection(bs,as))
    | ~ subset(intersection(bs,as),intersection(as,bs)) ),
    inference(rewriting,[status(thm)],[c_206]) ).

cnf(c_6,plain,
    ( ~ member(member_of_1_not_of_2(X0,X1),X1)
    | subset(X0,X1) ),
    file('/export/starexec/sandbox/tmp/iprover_modulo_5f206c.p',c_0_74_0) ).

cnf(c_123,plain,
    ( ~ member(member_of_1_not_of_2(X0,X1),X1)
    | subset(X0,X1) ),
    inference(copy,[status(esa)],[c_6]) ).

cnf(c_236,plain,
    ( ~ member(member_of_1_not_of_2(intersection(bs,as),intersection(as,bs)),intersection(as,bs))
    | ~ subset(intersection(as,bs),intersection(bs,as)) ),
    inference(resolution,[status(thm)],[c_207,c_123]) ).

cnf(c_237,plain,
    ( ~ member(member_of_1_not_of_2(intersection(bs,as),intersection(as,bs)),intersection(as,bs))
    | ~ subset(intersection(as,bs),intersection(bs,as)) ),
    inference(rewriting,[status(thm)],[c_236]) ).

cnf(c_3,plain,
    ( ~ member(X0,X1)
    | ~ member(X0,X2)
    | member(X0,intersection(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/iprover_modulo_5f206c.p',c_0_73_0) ).

cnf(c_117,plain,
    ( ~ member(X0,X1)
    | ~ member(X0,X2)
    | member(X0,intersection(X1,X2)) ),
    inference(copy,[status(esa)],[c_3]) ).

cnf(c_118,plain,
    ( member(X0,intersection(X1,X2))
    | ~ member(X0,X1)
    | ~ member(X0,X2) ),
    inference(rewriting,[status(thm)],[c_117]) ).

cnf(c_307,plain,
    ( ~ member(member_of_1_not_of_2(intersection(bs,as),intersection(as,bs)),as)
    | ~ member(member_of_1_not_of_2(intersection(bs,as),intersection(as,bs)),bs)
    | ~ subset(intersection(as,bs),intersection(bs,as)) ),
    inference(resolution,[status(thm)],[c_237,c_118]) ).

cnf(c_308,plain,
    ( ~ member(member_of_1_not_of_2(intersection(bs,as),intersection(as,bs)),as)
    | ~ member(member_of_1_not_of_2(intersection(bs,as),intersection(as,bs)),bs)
    | ~ subset(intersection(as,bs),intersection(bs,as)) ),
    inference(rewriting,[status(thm)],[c_307]) ).

cnf(c_8,plain,
    ( ~ member(X0,intersection(X1,X2))
    | member(X0,X1) ),
    file('/export/starexec/sandbox/tmp/iprover_modulo_5f206c.p',c_0_75_0) ).

cnf(c_127,plain,
    ( ~ member(X0,intersection(X1,X2))
    | member(X0,X1) ),
    inference(copy,[status(esa)],[c_8]) ).

cnf(c_505,plain,
    ( ~ member(member_of_1_not_of_2(intersection(bs,as),intersection(as,bs)),intersection(bs,X0))
    | ~ member(member_of_1_not_of_2(intersection(bs,as),intersection(as,bs)),as)
    | ~ subset(intersection(as,bs),intersection(bs,as)) ),
    inference(resolution,[status(thm)],[c_308,c_127]) ).

cnf(c_508,plain,
    ( ~ member(member_of_1_not_of_2(intersection(bs,as),intersection(as,bs)),intersection(bs,X0))
    | ~ member(member_of_1_not_of_2(intersection(bs,as),intersection(as,bs)),as)
    | ~ subset(intersection(as,bs),intersection(bs,as)) ),
    inference(rewriting,[status(thm)],[c_505]) ).

cnf(c_30,plain,
    ( subset(X0,X1)
    | member(member_of_1_not_of_2(X0,X1),X0) ),
    file('/export/starexec/sandbox/tmp/iprover_modulo_5f206c.p',c_0_84_0) ).

cnf(c_171,plain,
    ( subset(X0,X1)
    | member(member_of_1_not_of_2(X0,X1),X0) ),
    inference(copy,[status(esa)],[c_30]) ).

cnf(c_172,plain,
    ( member(member_of_1_not_of_2(X0,X1),X0)
    | subset(X0,X1) ),
    inference(rewriting,[status(thm)],[c_171]) ).

cnf(c_1175,plain,
    ( ~ member(member_of_1_not_of_2(intersection(bs,as),intersection(as,bs)),as)
    | ~ subset(intersection(as,bs),intersection(bs,as))
    | subset(intersection(bs,as),intersection(as,bs)) ),
    inference(resolution,[status(thm)],[c_508,c_172]) ).

cnf(c_1176,plain,
    ( ~ member(member_of_1_not_of_2(intersection(bs,as),intersection(as,bs)),as)
    | ~ subset(intersection(as,bs),intersection(bs,as))
    | subset(intersection(bs,as),intersection(as,bs)) ),
    inference(rewriting,[status(thm)],[c_1175]) ).

cnf(c_2382,plain,
    ( ~ member(member_of_1_not_of_2(intersection(bs,as),intersection(as,bs)),as)
    | ~ subset(intersection(as,bs),intersection(bs,as)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_1176,c_207]) ).

cnf(c_2383,plain,
    ( ~ member(member_of_1_not_of_2(intersection(bs,as),intersection(as,bs)),as)
    | ~ subset(intersection(as,bs),intersection(bs,as)) ),
    inference(rewriting,[status(thm)],[c_2382]) ).

cnf(c_10,plain,
    ( ~ member(X0,intersection(X1,X2))
    | member(X0,X2) ),
    file('/export/starexec/sandbox/tmp/iprover_modulo_5f206c.p',c_0_76_0) ).

cnf(c_131,plain,
    ( ~ member(X0,intersection(X1,X2))
    | member(X0,X2) ),
    inference(copy,[status(esa)],[c_10]) ).

cnf(c_2391,plain,
    ( ~ member(member_of_1_not_of_2(intersection(bs,as),intersection(as,bs)),intersection(X0,as))
    | ~ subset(intersection(as,bs),intersection(bs,as)) ),
    inference(resolution,[status(thm)],[c_2383,c_131]) ).

cnf(c_2394,plain,
    ( ~ member(member_of_1_not_of_2(intersection(bs,as),intersection(as,bs)),intersection(X0,as))
    | ~ subset(intersection(as,bs),intersection(bs,as)) ),
    inference(rewriting,[status(thm)],[c_2391]) ).

cnf(c_2488,plain,
    ( ~ subset(intersection(as,bs),intersection(bs,as))
    | subset(intersection(bs,as),intersection(as,bs)) ),
    inference(resolution,[status(thm)],[c_2394,c_172]) ).

cnf(c_2489,plain,
    ( ~ subset(intersection(as,bs),intersection(bs,as))
    | subset(intersection(bs,as),intersection(as,bs)) ),
    inference(rewriting,[status(thm)],[c_2488]) ).

cnf(c_2590,plain,
    ~ subset(intersection(as,bs),intersection(bs,as)),
    inference(forward_subsumption_resolution,[status(thm)],[c_2489,c_207]) ).

cnf(c_2591,plain,
    ~ subset(intersection(as,bs),intersection(bs,as)),
    inference(rewriting,[status(thm)],[c_2590]) ).

cnf(c_2594,plain,
    ~ member(member_of_1_not_of_2(intersection(as,bs),intersection(bs,as)),intersection(bs,as)),
    inference(resolution,[status(thm)],[c_2591,c_123]) ).

cnf(c_2595,plain,
    ~ member(member_of_1_not_of_2(intersection(as,bs),intersection(bs,as)),intersection(bs,as)),
    inference(rewriting,[status(thm)],[c_2594]) ).

cnf(c_2611,plain,
    ( ~ member(member_of_1_not_of_2(intersection(as,bs),intersection(bs,as)),as)
    | ~ member(member_of_1_not_of_2(intersection(as,bs),intersection(bs,as)),bs) ),
    inference(resolution,[status(thm)],[c_2595,c_118]) ).

cnf(c_2612,plain,
    ( ~ member(member_of_1_not_of_2(intersection(as,bs),intersection(bs,as)),as)
    | ~ member(member_of_1_not_of_2(intersection(as,bs),intersection(bs,as)),bs) ),
    inference(rewriting,[status(thm)],[c_2611]) ).

cnf(c_2764,plain,
    ( ~ member(member_of_1_not_of_2(intersection(as,bs),intersection(bs,as)),intersection(X0,bs))
    | ~ member(member_of_1_not_of_2(intersection(as,bs),intersection(bs,as)),as) ),
    inference(resolution,[status(thm)],[c_2612,c_131]) ).

cnf(c_2767,plain,
    ( ~ member(member_of_1_not_of_2(intersection(as,bs),intersection(bs,as)),intersection(X0,bs))
    | ~ member(member_of_1_not_of_2(intersection(as,bs),intersection(bs,as)),as) ),
    inference(rewriting,[status(thm)],[c_2764]) ).

cnf(c_3341,plain,
    ( ~ member(member_of_1_not_of_2(intersection(as,bs),intersection(bs,as)),as)
    | subset(intersection(as,bs),intersection(bs,as)) ),
    inference(resolution,[status(thm)],[c_2767,c_172]) ).

cnf(c_3342,plain,
    ( ~ member(member_of_1_not_of_2(intersection(as,bs),intersection(bs,as)),as)
    | subset(intersection(as,bs),intersection(bs,as)) ),
    inference(rewriting,[status(thm)],[c_3341]) ).

cnf(c_27925,plain,
    ~ member(member_of_1_not_of_2(intersection(as,bs),intersection(bs,as)),as),
    inference(forward_subsumption_resolution,[status(thm)],[c_3342,c_2591]) ).

cnf(c_27926,plain,
    ~ member(member_of_1_not_of_2(intersection(as,bs),intersection(bs,as)),as),
    inference(rewriting,[status(thm)],[c_27925]) ).

cnf(c_27928,plain,
    ~ member(member_of_1_not_of_2(intersection(as,bs),intersection(bs,as)),intersection(as,X0)),
    inference(resolution,[status(thm)],[c_27926,c_127]) ).

cnf(c_27931,plain,
    ~ member(member_of_1_not_of_2(intersection(as,bs),intersection(bs,as)),intersection(as,X0)),
    inference(rewriting,[status(thm)],[c_27928]) ).

cnf(c_27956,plain,
    subset(intersection(as,bs),intersection(bs,as)),
    inference(resolution,[status(thm)],[c_27931,c_172]) ).

cnf(c_27957,plain,
    subset(intersection(as,bs),intersection(bs,as)),
    inference(rewriting,[status(thm)],[c_27956]) ).

cnf(c_28543,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_27957,c_2591]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET013-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.12  % Command  : iprover_modulo %s %d
% 0.13/0.33  % Computer : n022.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sun Jul 10 09:37:10 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.34  % Running in mono-core mode
% 0.13/0.40  % Orienting using strategy Equiv(ClausalAll)
% 0.13/0.40  % Orientation found
% 0.13/0.40  % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format  " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d57d80.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_5f206c.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_863321 | grep -v "SZS"
% 0.19/0.42  
% 0.19/0.42  %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.42  
% 0.19/0.42  % 
% 0.19/0.42  % ------  iProver source info 
% 0.19/0.42  
% 0.19/0.42  % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.42  % git: non_committed_changes: true
% 0.19/0.42  % git: last_make_outside_of_git: true
% 0.19/0.42  
% 0.19/0.42  % 
% 0.19/0.42  % ------ Input Options
% 0.19/0.42  
% 0.19/0.42  % --out_options                         all
% 0.19/0.42  % --tptp_safe_out                       true
% 0.19/0.42  % --problem_path                        ""
% 0.19/0.42  % --include_path                        ""
% 0.19/0.42  % --clausifier                          .//eprover
% 0.19/0.42  % --clausifier_options                  --tstp-format  
% 0.19/0.42  % --stdin                               false
% 0.19/0.42  % --dbg_backtrace                       false
% 0.19/0.42  % --dbg_dump_prop_clauses               false
% 0.19/0.42  % --dbg_dump_prop_clauses_file          -
% 0.19/0.42  % --dbg_out_stat                        false
% 0.19/0.42  
% 0.19/0.42  % ------ General Options
% 0.19/0.42  
% 0.19/0.42  % --fof                                 false
% 0.19/0.42  % --time_out_real                       150.
% 0.19/0.42  % --time_out_prep_mult                  0.2
% 0.19/0.42  % --time_out_virtual                    -1.
% 0.19/0.42  % --schedule                            none
% 0.19/0.42  % --ground_splitting                    input
% 0.19/0.42  % --splitting_nvd                       16
% 0.19/0.42  % --non_eq_to_eq                        false
% 0.19/0.42  % --prep_gs_sim                         true
% 0.19/0.42  % --prep_unflatten                      false
% 0.19/0.42  % --prep_res_sim                        true
% 0.19/0.42  % --prep_upred                          true
% 0.19/0.42  % --res_sim_input                       true
% 0.19/0.42  % --clause_weak_htbl                    true
% 0.19/0.42  % --gc_record_bc_elim                   false
% 0.19/0.42  % --symbol_type_check                   false
% 0.19/0.42  % --clausify_out                        false
% 0.19/0.42  % --large_theory_mode                   false
% 0.19/0.42  % --prep_sem_filter                     none
% 0.19/0.42  % --prep_sem_filter_out                 false
% 0.19/0.42  % --preprocessed_out                    false
% 0.19/0.42  % --sub_typing                          false
% 0.19/0.42  % --brand_transform                     false
% 0.19/0.42  % --pure_diseq_elim                     true
% 0.19/0.42  % --min_unsat_core                      false
% 0.19/0.42  % --pred_elim                           true
% 0.19/0.42  % --add_important_lit                   false
% 0.19/0.42  % --soft_assumptions                    false
% 0.19/0.42  % --reset_solvers                       false
% 0.19/0.42  % --bc_imp_inh                          []
% 0.19/0.42  % --conj_cone_tolerance                 1.5
% 0.19/0.42  % --prolific_symb_bound                 500
% 0.19/0.42  % --lt_threshold                        2000
% 0.19/0.42  
% 0.19/0.42  % ------ SAT Options
% 0.19/0.42  
% 0.19/0.42  % --sat_mode                            false
% 0.19/0.42  % --sat_fm_restart_options              ""
% 0.19/0.42  % --sat_gr_def                          false
% 0.19/0.42  % --sat_epr_types                       true
% 0.19/0.42  % --sat_non_cyclic_types                false
% 0.19/0.42  % --sat_finite_models                   false
% 0.19/0.42  % --sat_fm_lemmas                       false
% 0.19/0.42  % --sat_fm_prep                         false
% 0.19/0.42  % --sat_fm_uc_incr                      true
% 0.19/0.42  % --sat_out_model                       small
% 0.19/0.42  % --sat_out_clauses                     false
% 0.19/0.42  
% 0.19/0.42  % ------ QBF Options
% 0.19/0.42  
% 0.19/0.42  % --qbf_mode                            false
% 0.19/0.42  % --qbf_elim_univ                       true
% 0.19/0.42  % --qbf_sk_in                           true
% 0.19/0.42  % --qbf_pred_elim                       true
% 0.19/0.42  % --qbf_split                           32
% 0.19/0.42  
% 0.19/0.42  % ------ BMC1 Options
% 0.19/0.42  
% 0.19/0.42  % --bmc1_incremental                    false
% 0.19/0.42  % --bmc1_axioms                         reachable_all
% 0.19/0.42  % --bmc1_min_bound                      0
% 0.19/0.42  % --bmc1_max_bound                      -1
% 0.19/0.42  % --bmc1_max_bound_default              -1
% 0.19/0.42  % --bmc1_symbol_reachability            true
% 0.19/0.42  % --bmc1_property_lemmas                false
% 0.19/0.42  % --bmc1_k_induction                    false
% 0.19/0.42  % --bmc1_non_equiv_states               false
% 0.19/0.42  % --bmc1_deadlock                       false
% 0.19/0.42  % --bmc1_ucm                            false
% 0.19/0.42  % --bmc1_add_unsat_core                 none
% 0.19/0.42  % --bmc1_unsat_core_children            false
% 0.19/0.42  % --bmc1_unsat_core_extrapolate_axioms  false
% 0.19/0.42  % --bmc1_out_stat                       full
% 0.19/0.42  % --bmc1_ground_init                    false
% 0.19/0.42  % --bmc1_pre_inst_next_state            false
% 0.19/0.42  % --bmc1_pre_inst_state                 false
% 0.19/0.42  % --bmc1_pre_inst_reach_state           false
% 0.19/0.42  % --bmc1_out_unsat_core                 false
% 0.19/0.42  % --bmc1_aig_witness_out                false
% 0.19/0.42  % --bmc1_verbose                        false
% 0.19/0.42  % --bmc1_dump_clauses_tptp              false
% 0.19/0.43  % --bmc1_dump_unsat_core_tptp           false
% 0.19/0.43  % --bmc1_dump_file                      -
% 0.19/0.43  % --bmc1_ucm_expand_uc_limit            128
% 0.19/0.43  % --bmc1_ucm_n_expand_iterations        6
% 0.19/0.43  % --bmc1_ucm_extend_mode                1
% 0.19/0.43  % --bmc1_ucm_init_mode                  2
% 0.19/0.43  % --bmc1_ucm_cone_mode                  none
% 0.19/0.43  % --bmc1_ucm_reduced_relation_type      0
% 0.19/0.43  % --bmc1_ucm_relax_model                4
% 0.19/0.43  % --bmc1_ucm_full_tr_after_sat          true
% 0.19/0.43  % --bmc1_ucm_expand_neg_assumptions     false
% 0.19/0.43  % --bmc1_ucm_layered_model              none
% 0.19/0.43  % --bmc1_ucm_max_lemma_size             10
% 0.19/0.43  
% 0.19/0.43  % ------ AIG Options
% 0.19/0.43  
% 0.19/0.43  % --aig_mode                            false
% 0.19/0.43  
% 0.19/0.43  % ------ Instantiation Options
% 0.19/0.43  
% 0.19/0.43  % --instantiation_flag                  true
% 0.19/0.43  % --inst_lit_sel                        [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.43  % --inst_solver_per_active              750
% 0.19/0.43  % --inst_solver_calls_frac              0.5
% 0.19/0.43  % --inst_passive_queue_type             priority_queues
% 0.19/0.43  % --inst_passive_queues                 [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.43  % --inst_passive_queues_freq            [25;2]
% 0.19/0.43  % --inst_dismatching                    true
% 0.19/0.43  % --inst_eager_unprocessed_to_passive   true
% 0.19/0.43  % --inst_prop_sim_given                 true
% 0.19/0.43  % --inst_prop_sim_new                   false
% 0.19/0.43  % --inst_orphan_elimination             true
% 0.19/0.43  % --inst_learning_loop_flag             true
% 0.19/0.43  % --inst_learning_start                 3000
% 0.19/0.43  % --inst_learning_factor                2
% 0.19/0.43  % --inst_start_prop_sim_after_learn     3
% 0.19/0.43  % --inst_sel_renew                      solver
% 0.19/0.43  % --inst_lit_activity_flag              true
% 0.19/0.43  % --inst_out_proof                      true
% 0.19/0.43  
% 0.19/0.43  % ------ Resolution Options
% 0.19/0.43  
% 0.19/0.43  % --resolution_flag                     true
% 0.19/0.43  % --res_lit_sel                         kbo_max
% 0.19/0.43  % --res_to_prop_solver                  none
% 0.19/0.43  % --res_prop_simpl_new                  false
% 0.19/0.43  % --res_prop_simpl_given                false
% 0.19/0.43  % --res_passive_queue_type              priority_queues
% 0.19/0.43  % --res_passive_queues                  [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.43  % --res_passive_queues_freq             [15;5]
% 0.19/0.43  % --res_forward_subs                    full
% 0.19/0.43  % --res_backward_subs                   full
% 0.19/0.43  % --res_forward_subs_resolution         true
% 0.19/0.43  % --res_backward_subs_resolution        true
% 0.19/0.43  % --res_orphan_elimination              false
% 0.19/0.43  % --res_time_limit                      1000.
% 0.19/0.43  % --res_out_proof                       true
% 0.19/0.43  % --proof_out_file                      /export/starexec/sandbox/tmp/iprover_proof_d57d80.s
% 0.19/0.43  % --modulo                              true
% 0.19/0.43  
% 0.19/0.43  % ------ Combination Options
% 0.19/0.43  
% 0.19/0.43  % --comb_res_mult                       1000
% 0.19/0.43  % --comb_inst_mult                      300
% 0.19/0.43  % ------ 
% 0.19/0.43  
% 0.19/0.43  % ------ Parsing...% successful
% 0.19/0.43  
% 0.19/0.43  % ------ 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.43  
% 0.19/0.43  % ------ Proving...
% 0.19/0.43  % ------ Problem Properties 
% 0.19/0.43  
% 0.19/0.43  % 
% 0.19/0.43  % EPR                                   false
% 0.19/0.43  % Horn                                  false
% 0.19/0.43  % Has equality                          false
% 0.19/0.43  
% 0.19/0.43  % % ------ Input Options Time Limit: Unbounded
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  % % ------ Current options:
% 0.19/0.43  
% 0.19/0.43  % ------ Input Options
% 0.19/0.43  
% 0.19/0.43  % --out_options                         all
% 0.19/0.43  % --tptp_safe_out                       true
% 0.19/0.43  % --problem_path                        ""
% 0.19/0.43  % --include_path                        ""
% 0.19/0.43  % --clausifier                          .//eprover
% 0.19/0.43  % --clausifier_options                  --tstp-format  
% 0.19/0.43  % --stdin                               false
% 0.19/0.43  % --dbg_backtrace                       false
% 0.19/0.43  % --dbg_dump_prop_clauses               false
% 0.19/0.43  % --dbg_dump_prop_clauses_file          -
% 0.19/0.43  % --dbg_out_stat                        false
% 0.19/0.43  
% 0.19/0.43  % ------ General Options
% 0.19/0.43  
% 0.19/0.43  % --fof                                 false
% 0.19/0.43  % --time_out_real                       150.
% 0.19/0.43  % --time_out_prep_mult                  0.2
% 0.19/0.43  % --time_out_virtual                    -1.
% 0.19/0.43  % --schedule                            none
% 0.19/0.43  % --ground_splitting                    input
% 0.19/0.43  % --splitting_nvd                       16
% 0.19/0.43  % --non_eq_to_eq                        false
% 0.19/0.43  % --prep_gs_sim                         true
% 0.19/0.43  % --prep_unflatten                      false
% 0.19/0.43  % --prep_res_sim                        true
% 0.19/0.43  % --prep_upred                          true
% 0.19/0.43  % --res_sim_input                       true
% 0.19/0.43  % --clause_weak_htbl                    true
% 0.19/0.43  % --gc_record_bc_elim                   false
% 0.19/0.43  % --symbol_type_check                   false
% 0.19/0.43  % --clausify_out                        false
% 0.19/0.43  % --large_theory_mode                   false
% 0.19/0.43  % --prep_sem_filter                     none
% 0.19/0.43  % --prep_sem_filter_out                 false
% 0.19/0.43  % --preprocessed_out                    false
% 0.19/0.43  % --sub_typing                          false
% 0.19/0.43  % --brand_transform                     false
% 0.19/0.43  % --pure_diseq_elim                     true
% 0.19/0.43  % --min_unsat_core                      false
% 0.19/0.43  % --pred_elim                           true
% 0.19/0.43  % --add_important_lit                   false
% 0.19/0.43  % --soft_assumptions                    false
% 0.19/0.43  % --reset_solvers                       false
% 0.19/0.43  % --bc_imp_inh                          []
% 0.19/0.43  % --conj_cone_tolerance                 1.5
% 0.19/0.43  % --prolific_symb_bound                 500
% 0.19/0.43  % --lt_threshold                        2000
% 0.19/0.43  
% 0.19/0.43  % ------ SAT Options
% 0.19/0.43  
% 0.19/0.43  % --sat_mode                            false
% 0.19/0.43  % --sat_fm_restart_options              ""
% 0.19/0.43  % --sat_gr_def                          false
% 0.19/0.43  % --sat_epr_types                       true
% 0.19/0.43  % --sat_non_cyclic_types                false
% 0.19/0.43  % --sat_finite_models                   false
% 0.19/0.43  % --sat_fm_lemmas                       false
% 0.19/0.43  % --sat_fm_prep                         false
% 0.19/0.43  % --sat_fm_uc_incr                      true
% 0.19/0.43  % --sat_out_model                       small
% 0.19/0.43  % --sat_out_clauses                     false
% 0.19/0.43  
% 0.19/0.43  % ------ QBF Options
% 0.19/0.43  
% 0.19/0.43  % --qbf_mode                            false
% 0.19/0.43  % --qbf_elim_univ                       true
% 0.19/0.43  % --qbf_sk_in                           true
% 0.19/0.43  % --qbf_pred_elim                       true
% 0.19/0.43  % --qbf_split                           32
% 0.19/0.43  
% 0.19/0.43  % ------ BMC1 Options
% 0.19/0.43  
% 0.19/0.43  % --bmc1_incremental                    false
% 0.19/0.43  % --bmc1_axioms                         reachable_all
% 0.19/0.43  % --bmc1_min_bound                      0
% 0.19/0.43  % --bmc1_max_bound                      -1
% 0.19/0.43  % --bmc1_max_bound_default              -1
% 0.19/0.43  % --bmc1_symbol_reachability            true
% 0.19/0.43  % --bmc1_property_lemmas                false
% 0.19/0.43  % --bmc1_k_induction                    false
% 0.19/0.43  % --bmc1_non_equiv_states               false
% 0.19/0.43  % --bmc1_deadlock                       false
% 0.19/0.43  % --bmc1_ucm                            false
% 0.19/0.43  % --bmc1_add_unsat_core                 none
% 0.19/0.43  % --bmc1_unsat_core_children            false
% 0.19/0.43  % --bmc1_unsat_core_extrapolate_axioms  false
% 0.19/0.43  % --bmc1_out_stat                       full
% 0.19/0.43  % --bmc1_ground_init                    false
% 0.19/0.43  % --bmc1_pre_inst_next_state            false
% 0.19/0.43  % --bmc1_pre_inst_state                 false
% 0.19/0.43  % --bmc1_pre_inst_reach_state           false
% 0.19/0.43  % --bmc1_out_unsat_core                 false
% 0.19/0.43  % --bmc1_aig_witness_out                false
% 0.19/0.43  % --bmc1_verbose                        false
% 0.19/0.43  % --bmc1_dump_clauses_tptp              false
% 0.19/0.43  % --bmc1_dump_unsat_core_tptp           false
% 0.19/0.43  % --bmc1_dump_file                      -
% 0.19/0.43  % --bmc1_ucm_expand_uc_limit            128
% 0.19/0.43  % --bmc1_ucm_n_expand_iterations        6
% 0.19/0.43  % --bmc1_ucm_extend_mode                1
% 0.19/0.43  % --bmc1_ucm_init_mode                  2
% 0.19/0.43  % --bmc1_ucm_cone_mode                  none
% 0.19/0.43  % --bmc1_ucm_reduced_relation_type      0
% 0.19/0.43  % --bmc1_ucm_relax_model                4
% 0.19/0.43  % --bmc1_ucm_full_tr_after_sat          true
% 0.19/0.43  % --bmc1_ucm_expand_neg_assumptions     false
% 0.19/0.43  % --bmc1_ucm_layered_model              none
% 0.19/0.43  % --bmc1_ucm_max_lemma_size             10
% 0.19/0.43  
% 0.19/0.43  % ------ AIG Options
% 0.19/0.43  
% 0.19/0.43  % --aig_mode                            false
% 0.19/0.43  
% 0.19/0.43  % ------ Instantiation Options
% 0.19/0.43  
% 0.19/0.43  % --instantiation_flag                  true
% 0.19/0.43  % --inst_lit_sel                        [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.43  % --inst_solver_per_active              750
% 0.19/0.43  % --inst_solver_calls_frac              0.5
% 0.19/0.43  % --inst_passive_queue_type             priority_queues
% 0.19/0.43  % --inst_passive_queues                 [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.43  % --inst_passive_queues_freq            [25;2]
% 0.19/0.43  % --inst_dismatching                    true
% 0.19/0.43  % --inst_eager_unprocessed_to_passive   true
% 0.19/0.43  % --inst_prop_sim_given                 true
% 1.79/2.03  % --inst_prop_sim_new                   false
% 1.79/2.03  % --inst_orphan_elimination             true
% 1.79/2.03  % --inst_learning_loop_flag             true
% 1.79/2.03  % --inst_learning_start                 3000
% 1.79/2.03  % --inst_learning_factor                2
% 1.79/2.03  % --inst_start_prop_sim_after_learn     3
% 1.79/2.03  % --inst_sel_renew                      solver
% 1.79/2.03  % --inst_lit_activity_flag              true
% 1.79/2.03  % --inst_out_proof                      true
% 1.79/2.03  
% 1.79/2.03  % ------ Resolution Options
% 1.79/2.03  
% 1.79/2.03  % --resolution_flag                     true
% 1.79/2.03  % --res_lit_sel                         kbo_max
% 1.79/2.03  % --res_to_prop_solver                  none
% 1.79/2.03  % --res_prop_simpl_new                  false
% 1.79/2.03  % --res_prop_simpl_given                false
% 1.79/2.03  % --res_passive_queue_type              priority_queues
% 1.79/2.03  % --res_passive_queues                  [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.79/2.03  % --res_passive_queues_freq             [15;5]
% 1.79/2.03  % --res_forward_subs                    full
% 1.79/2.03  % --res_backward_subs                   full
% 1.79/2.03  % --res_forward_subs_resolution         true
% 1.79/2.03  % --res_backward_subs_resolution        true
% 1.79/2.03  % --res_orphan_elimination              false
% 1.79/2.03  % --res_time_limit                      1000.
% 1.79/2.03  % --res_out_proof                       true
% 1.79/2.03  % --proof_out_file                      /export/starexec/sandbox/tmp/iprover_proof_d57d80.s
% 1.79/2.03  % --modulo                              true
% 1.79/2.03  
% 1.79/2.03  % ------ Combination Options
% 1.79/2.03  
% 1.79/2.03  % --comb_res_mult                       1000
% 1.79/2.03  % --comb_inst_mult                      300
% 1.79/2.03  % ------ 
% 1.79/2.03  
% 1.79/2.03  
% 1.79/2.03  
% 1.79/2.03  % ------ Proving...
% 1.79/2.03  % 
% 1.79/2.03  
% 1.79/2.03  
% 1.79/2.03  %  Resolution empty clause
% 1.79/2.03  
% 1.79/2.03  % ------                             Statistics
% 1.79/2.03  
% 1.79/2.03  % ------ General
% 1.79/2.03  
% 1.79/2.03  % num_of_input_clauses:                 46
% 1.79/2.03  % num_of_input_neg_conjectures:         1
% 1.79/2.03  % num_of_splits:                        0
% 1.79/2.03  % num_of_split_atoms:                   0
% 1.79/2.03  % num_of_sem_filtered_clauses:          0
% 1.79/2.03  % num_of_subtypes:                      0
% 1.79/2.03  % monotx_restored_types:                0
% 1.79/2.03  % sat_num_of_epr_types:                 0
% 1.79/2.03  % sat_num_of_non_cyclic_types:          0
% 1.79/2.03  % sat_guarded_non_collapsed_types:      0
% 1.79/2.03  % is_epr:                               0
% 1.79/2.03  % is_horn:                              0
% 1.79/2.03  % has_eq:                               0
% 1.79/2.03  % num_pure_diseq_elim:                  0
% 1.79/2.03  % simp_replaced_by:                     0
% 1.79/2.03  % res_preprocessed:                     2
% 1.79/2.03  % prep_upred:                           0
% 1.79/2.03  % prep_unflattend:                      0
% 1.79/2.03  % pred_elim_cands:                      0
% 1.79/2.03  % pred_elim:                            0
% 1.79/2.03  % pred_elim_cl:                         0
% 1.79/2.03  % pred_elim_cycles:                     0
% 1.79/2.03  % forced_gc_time:                       0
% 1.79/2.03  % gc_basic_clause_elim:                 0
% 1.79/2.03  % parsing_time:                         0.001
% 1.79/2.03  % sem_filter_time:                      0.
% 1.79/2.03  % pred_elim_time:                       0.
% 1.79/2.03  % out_proof_time:                       0.001
% 1.79/2.03  % monotx_time:                          0.
% 1.79/2.03  % subtype_inf_time:                     0.
% 1.79/2.03  % unif_index_cands_time:                0.004
% 1.79/2.03  % unif_index_add_time:                  0.003
% 1.79/2.03  % total_time:                           1.627
% 1.79/2.03  % num_of_symbols:                       36
% 1.79/2.03  % num_of_terms:                         40102
% 1.79/2.03  
% 1.79/2.03  % ------ Propositional Solver
% 1.79/2.03  
% 1.79/2.03  % prop_solver_calls:                    6
% 1.79/2.03  % prop_fast_solver_calls:               3
% 1.79/2.03  % prop_num_of_clauses:                  524
% 1.79/2.03  % prop_preprocess_simplified:           690
% 1.79/2.03  % prop_fo_subsumed:                     0
% 1.79/2.03  % prop_solver_time:                     0.
% 1.79/2.03  % prop_fast_solver_time:                0.
% 1.79/2.03  % prop_unsat_core_time:                 0.
% 1.79/2.03  
% 1.79/2.03  % ------ QBF 
% 1.79/2.03  
% 1.79/2.03  % qbf_q_res:                            0
% 1.79/2.03  % qbf_num_tautologies:                  0
% 1.79/2.03  % qbf_prep_cycles:                      0
% 1.79/2.03  
% 1.79/2.03  % ------ BMC1
% 1.79/2.03  
% 1.79/2.03  % bmc1_current_bound:                   -1
% 1.79/2.03  % bmc1_last_solved_bound:               -1
% 1.79/2.03  % bmc1_unsat_core_size:                 -1
% 1.79/2.03  % bmc1_unsat_core_parents_size:         -1
% 1.79/2.03  % bmc1_merge_next_fun:                  0
% 1.79/2.03  % bmc1_unsat_core_clauses_time:         0.
% 1.79/2.03  
% 1.79/2.03  % ------ Instantiation
% 1.79/2.03  
% 1.79/2.03  % inst_num_of_clauses:                  355
% 1.79/2.03  % inst_num_in_passive:                  94
% 1.79/2.03  % inst_num_in_active:                   154
% 1.79/2.03  % inst_num_in_unprocessed:              96
% 1.79/2.03  % inst_num_of_loops:                    300
% 1.79/2.03  % inst_num_of_learning_restarts:        0
% 1.79/2.03  % inst_num_moves_active_passive:        133
% 1.79/2.03  % inst_lit_activity:                    80
% 1.79/2.03  % inst_lit_activity_moves:              0
% 1.79/2.03  % inst_num_tautologies:                 11
% 1.79/2.03  % inst_num_prop_implied:                0
% 1.79/2.03  % inst_num_existing_simplified:         0
% 1.79/2.03  % inst_num_eq_res_simplified:           0
% 1.79/2.03  % inst_num_child_elim:                  0
% 1.79/2.03  % inst_num_of_dismatching_blockings:    142
% 1.79/2.03  % inst_num_of_non_proper_insts:         526
% 1.79/2.03  % inst_num_of_duplicates:               528
% 1.79/2.03  % inst_inst_num_from_inst_to_res:       0
% 1.79/2.03  % inst_dismatching_checking_time:       0.
% 1.79/2.03  
% 1.79/2.03  % ------ Resolution
% 1.79/2.03  
% 1.79/2.03  % res_num_of_clauses:                   7902
% 1.79/2.03  % res_num_in_passive:                   6945
% 1.79/2.03  % res_num_in_active:                    993
% 1.79/2.03  % res_num_of_loops:                     1447
% 1.79/2.03  % res_forward_subset_subsumed:          668
% 1.79/2.03  % res_backward_subset_subsumed:         187
% 1.79/2.03  % res_forward_subsumed:                 364
% 1.79/2.03  % res_backward_subsumed:                78
% 1.79/2.03  % res_forward_subsumption_resolution:   18
% 1.79/2.03  % res_backward_subsumption_resolution:  0
% 1.79/2.03  % res_clause_to_clause_subsumption:     90345
% 1.79/2.03  % res_orphan_elimination:               0
% 1.79/2.03  % res_tautology_del:                    434
% 1.79/2.03  % res_num_eq_res_simplified:            0
% 1.79/2.03  % res_num_sel_changes:                  0
% 1.79/2.03  % res_moves_from_active_to_pass:        0
% 1.79/2.03  
% 1.79/2.03  % Status Unsatisfiable
% 1.79/2.03  % SZS status Unsatisfiable
% 1.79/2.03  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------