TSTP Solution File: SET014-2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET014-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 02:08:25 EDT 2022
% Result : Unsatisfiable 0.38s 0.58s
% Output : CNFRefutation 0.38s
% 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,
~ subset(union(as,bs),cs),
file('<stdin>',prove_a_union_b_subset_of_c) ).
fof(c_0_1_017,hypothesis,
subset(bs,cs),
file('<stdin>',b_subset_of_c) ).
fof(c_0_2_018,hypothesis,
subset(as,cs),
file('<stdin>',a_subset_of_c) ).
fof(c_0_3_019,negated_conjecture,
~ subset(union(as,bs),cs),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_4_020,hypothesis,
subset(bs,cs),
c_0_1 ).
fof(c_0_5_021,hypothesis,
subset(as,cs),
c_0_2 ).
fof(c_0_6_022,negated_conjecture,
~ subset(union(as,bs),cs),
c_0_3 ).
fof(c_0_7_023,hypothesis,
subset(bs,cs),
c_0_4 ).
fof(c_0_8_024,hypothesis,
subset(as,cs),
c_0_5 ).
cnf(c_0_9_025,negated_conjecture,
~ subset(union(as,bs),cs),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10_026,hypothesis,
subset(bs,cs),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11_027,hypothesis,
subset(as,cs),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12_028,negated_conjecture,
~ subset(union(as,bs),cs),
c_0_9,
[final] ).
cnf(c_0_13_029,hypothesis,
subset(bs,cs),
c_0_10,
[final] ).
cnf(c_0_14_030,hypothesis,
subset(as,cs),
c_0_11,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_45,negated_conjecture,
~ subset(union(as,bs),cs),
file('/export/starexec/sandbox/tmp/iprover_modulo_14407d.p',c_0_12) ).
cnf(c_64,negated_conjecture,
~ subset(union(as,bs),cs),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_68,negated_conjecture,
~ subset(union(as,bs),cs),
inference(copy,[status(esa)],[c_64]) ).
cnf(c_73,negated_conjecture,
~ subset(union(as,bs),cs),
inference(copy,[status(esa)],[c_68]) ).
cnf(c_74,negated_conjecture,
~ subset(union(as,bs),cs),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_215,plain,
~ subset(union(as,bs),cs),
inference(copy,[status(esa)],[c_74]) ).
cnf(c_6,plain,
( ~ member(member_of_1_not_of_2(X0,X1),X1)
| subset(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_14407d.p',c_0_74_0) ).
cnf(c_137,plain,
( ~ member(member_of_1_not_of_2(X0,X1),X1)
| subset(X0,X1) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_224,plain,
~ member(member_of_1_not_of_2(union(as,bs),cs),cs),
inference(resolution,[status(thm)],[c_215,c_137]) ).
cnf(c_225,plain,
~ member(member_of_1_not_of_2(union(as,bs),cs),cs),
inference(rewriting,[status(thm)],[c_224]) ).
cnf(c_16,plain,
( ~ member(X0,X1)
| ~ subset(X1,X2)
| member(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_14407d.p',c_0_79_0) ).
cnf(c_157,plain,
( ~ member(X0,X1)
| ~ subset(X1,X2)
| member(X0,X2) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_158,plain,
( ~ member(X0,X1)
| member(X0,X2)
| ~ subset(X1,X2) ),
inference(rewriting,[status(thm)],[c_157]) ).
cnf(c_243,plain,
( ~ member(member_of_1_not_of_2(union(as,bs),cs),X0)
| ~ subset(X0,cs) ),
inference(resolution,[status(thm)],[c_225,c_158]) ).
cnf(c_248,plain,
( ~ member(member_of_1_not_of_2(union(as,bs),cs),X0)
| ~ subset(X0,cs) ),
inference(rewriting,[status(thm)],[c_243]) ).
cnf(c_1,plain,
( ~ member(X0,union(X1,X2))
| member(X0,X2)
| member(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_14407d.p',c_0_72_1) ).
cnf(c_127,plain,
( ~ member(X0,union(X1,X2))
| member(X0,X2)
| member(X0,X1) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_306,plain,
( ~ member(member_of_1_not_of_2(union(as,bs),cs),union(X0,X1))
| member(member_of_1_not_of_2(union(as,bs),cs),X1)
| ~ subset(X0,cs) ),
inference(resolution,[status(thm)],[c_248,c_127]) ).
cnf(c_307,plain,
( ~ member(member_of_1_not_of_2(union(as,bs),cs),union(X0,X1))
| member(member_of_1_not_of_2(union(as,bs),cs),X1)
| ~ subset(X0,cs) ),
inference(rewriting,[status(thm)],[c_306]) ).
cnf(c_30,plain,
( subset(X0,X1)
| member(member_of_1_not_of_2(X0,X1),X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_14407d.p',c_0_84_0) ).
cnf(c_185,plain,
( subset(X0,X1)
| member(member_of_1_not_of_2(X0,X1),X0) ),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_186,plain,
( member(member_of_1_not_of_2(X0,X1),X0)
| subset(X0,X1) ),
inference(rewriting,[status(thm)],[c_185]) ).
cnf(c_1181,plain,
( member(member_of_1_not_of_2(union(as,bs),cs),bs)
| subset(union(as,bs),cs)
| ~ subset(as,cs) ),
inference(resolution,[status(thm)],[c_307,c_186]) ).
cnf(c_1182,plain,
( member(member_of_1_not_of_2(union(as,bs),cs),bs)
| subset(union(as,bs),cs)
| ~ subset(as,cs) ),
inference(rewriting,[status(thm)],[c_1181]) ).
cnf(c_47,plain,
subset(as,cs),
file('/export/starexec/sandbox/tmp/iprover_modulo_14407d.p',c_0_14) ).
cnf(c_62,plain,
subset(as,cs),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_70,plain,
subset(as,cs),
inference(copy,[status(esa)],[c_62]) ).
cnf(c_71,plain,
subset(as,cs),
inference(copy,[status(esa)],[c_70]) ).
cnf(c_76,plain,
subset(as,cs),
inference(copy,[status(esa)],[c_71]) ).
cnf(c_219,plain,
subset(as,cs),
inference(copy,[status(esa)],[c_76]) ).
cnf(c_5693,plain,
member(member_of_1_not_of_2(union(as,bs),cs),bs),
inference(forward_subsumption_resolution,[status(thm)],[c_1182,c_219,c_215]) ).
cnf(c_5694,plain,
member(member_of_1_not_of_2(union(as,bs),cs),bs),
inference(rewriting,[status(thm)],[c_5693]) ).
cnf(c_5703,plain,
~ subset(bs,cs),
inference(resolution,[status(thm)],[c_5694,c_248]) ).
cnf(c_5704,plain,
~ subset(bs,cs),
inference(rewriting,[status(thm)],[c_5703]) ).
cnf(c_46,plain,
subset(bs,cs),
file('/export/starexec/sandbox/tmp/iprover_modulo_14407d.p',c_0_13) ).
cnf(c_60,plain,
subset(bs,cs),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_69,plain,
subset(bs,cs),
inference(copy,[status(esa)],[c_60]) ).
cnf(c_72,plain,
subset(bs,cs),
inference(copy,[status(esa)],[c_69]) ).
cnf(c_75,plain,
subset(bs,cs),
inference(copy,[status(esa)],[c_72]) ).
cnf(c_217,plain,
subset(bs,cs),
inference(copy,[status(esa)],[c_75]) ).
cnf(c_6070,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5704,c_217]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET014-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.04/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 09:38:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % Orientation found
% 0.20/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_d84640.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_14407d.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_555084 | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d84640.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43 % ------ Parsing...% successful
% 0.20/0.43
% 0.20/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.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % ------ Problem Properties
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % EPR false
% 0.20/0.43 % Horn false
% 0.20/0.43 % Has equality false
% 0.20/0.43
% 0.20/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % % ------ Current options:
% 0.20/0.43
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.38/0.57 % --inst_prop_sim_new false
% 0.38/0.57 % --inst_orphan_elimination true
% 0.38/0.57 % --inst_learning_loop_flag true
% 0.38/0.57 % --inst_learning_start 3000
% 0.38/0.57 % --inst_learning_factor 2
% 0.38/0.57 % --inst_start_prop_sim_after_learn 3
% 0.38/0.57 % --inst_sel_renew solver
% 0.38/0.57 % --inst_lit_activity_flag true
% 0.38/0.57 % --inst_out_proof true
% 0.38/0.57
% 0.38/0.57 % ------ Resolution Options
% 0.38/0.57
% 0.38/0.57 % --resolution_flag true
% 0.38/0.57 % --res_lit_sel kbo_max
% 0.38/0.57 % --res_to_prop_solver none
% 0.38/0.57 % --res_prop_simpl_new false
% 0.38/0.57 % --res_prop_simpl_given false
% 0.38/0.57 % --res_passive_queue_type priority_queues
% 0.38/0.57 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.38/0.57 % --res_passive_queues_freq [15;5]
% 0.38/0.57 % --res_forward_subs full
% 0.38/0.57 % --res_backward_subs full
% 0.38/0.57 % --res_forward_subs_resolution true
% 0.38/0.57 % --res_backward_subs_resolution true
% 0.38/0.57 % --res_orphan_elimination false
% 0.38/0.57 % --res_time_limit 1000.
% 0.38/0.57 % --res_out_proof true
% 0.38/0.57 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d84640.s
% 0.38/0.57 % --modulo true
% 0.38/0.57
% 0.38/0.57 % ------ Combination Options
% 0.38/0.57
% 0.38/0.57 % --comb_res_mult 1000
% 0.38/0.57 % --comb_inst_mult 300
% 0.38/0.57 % ------
% 0.38/0.57
% 0.38/0.57
% 0.38/0.57
% 0.38/0.57 % ------ Proving...
% 0.38/0.57 %
% 0.38/0.57
% 0.38/0.57
% 0.38/0.57 % Resolution empty clause
% 0.38/0.57
% 0.38/0.57 % ------ Statistics
% 0.38/0.57
% 0.38/0.57 % ------ General
% 0.38/0.57
% 0.38/0.57 % num_of_input_clauses: 48
% 0.38/0.57 % num_of_input_neg_conjectures: 1
% 0.38/0.57 % num_of_splits: 0
% 0.38/0.57 % num_of_split_atoms: 0
% 0.38/0.57 % num_of_sem_filtered_clauses: 0
% 0.38/0.57 % num_of_subtypes: 0
% 0.38/0.57 % monotx_restored_types: 0
% 0.38/0.57 % sat_num_of_epr_types: 0
% 0.38/0.57 % sat_num_of_non_cyclic_types: 0
% 0.38/0.57 % sat_guarded_non_collapsed_types: 0
% 0.38/0.57 % is_epr: 0
% 0.38/0.57 % is_horn: 0
% 0.38/0.57 % has_eq: 0
% 0.38/0.57 % num_pure_diseq_elim: 0
% 0.38/0.57 % simp_replaced_by: 0
% 0.38/0.57 % res_preprocessed: 4
% 0.38/0.57 % prep_upred: 0
% 0.38/0.57 % prep_unflattend: 0
% 0.38/0.57 % pred_elim_cands: 0
% 0.38/0.57 % pred_elim: 0
% 0.38/0.57 % pred_elim_cl: 0
% 0.38/0.57 % pred_elim_cycles: 0
% 0.38/0.57 % forced_gc_time: 0
% 0.38/0.57 % gc_basic_clause_elim: 0
% 0.38/0.57 % parsing_time: 0.001
% 0.38/0.57 % sem_filter_time: 0.
% 0.38/0.57 % pred_elim_time: 0.
% 0.38/0.57 % out_proof_time: 0.
% 0.38/0.57 % monotx_time: 0.
% 0.38/0.57 % subtype_inf_time: 0.
% 0.38/0.57 % unif_index_cands_time: 0.
% 0.38/0.57 % unif_index_add_time: 0.001
% 0.38/0.57 % total_time: 0.164
% 0.38/0.57 % num_of_symbols: 37
% 0.38/0.57 % num_of_terms: 3942
% 0.38/0.57
% 0.38/0.57 % ------ Propositional Solver
% 0.38/0.57
% 0.38/0.57 % prop_solver_calls: 1
% 0.38/0.57 % prop_fast_solver_calls: 7
% 0.38/0.57 % prop_num_of_clauses: 46
% 0.38/0.57 % prop_preprocess_simplified: 158
% 0.38/0.57 % prop_fo_subsumed: 0
% 0.38/0.57 % prop_solver_time: 0.
% 0.38/0.57 % prop_fast_solver_time: 0.
% 0.38/0.57 % prop_unsat_core_time: 0.
% 0.38/0.57
% 0.38/0.57 % ------ QBF
% 0.38/0.57
% 0.38/0.57 % qbf_q_res: 0
% 0.38/0.57 % qbf_num_tautologies: 0
% 0.38/0.57 % qbf_prep_cycles: 0
% 0.38/0.57
% 0.38/0.57 % ------ BMC1
% 0.38/0.57
% 0.38/0.57 % bmc1_current_bound: -1
% 0.38/0.57 % bmc1_last_solved_bound: -1
% 0.38/0.57 % bmc1_unsat_core_size: -1
% 0.38/0.57 % bmc1_unsat_core_parents_size: -1
% 0.38/0.57 % bmc1_merge_next_fun: 0
% 0.38/0.57 % bmc1_unsat_core_clauses_time: 0.
% 0.38/0.57
% 0.38/0.57 % ------ Instantiation
% 0.38/0.57
% 0.38/0.57 % inst_num_of_clauses: 48
% 0.38/0.57 % inst_num_in_passive: 0
% 0.38/0.57 % inst_num_in_active: 0
% 0.38/0.57 % inst_num_in_unprocessed: 48
% 0.38/0.57 % inst_num_of_loops: 0
% 0.38/0.58 % inst_num_of_learning_restarts: 0
% 0.38/0.58 % inst_num_moves_active_passive: 0
% 0.38/0.58 % inst_lit_activity: 0
% 0.38/0.58 % inst_lit_activity_moves: 0
% 0.38/0.58 % inst_num_tautologies: 0
% 0.38/0.58 % inst_num_prop_implied: 0
% 0.38/0.58 % inst_num_existing_simplified: 0
% 0.38/0.58 % inst_num_eq_res_simplified: 0
% 0.38/0.58 % inst_num_child_elim: 0
% 0.38/0.58 % inst_num_of_dismatching_blockings: 0
% 0.38/0.58 % inst_num_of_non_proper_insts: 0
% 0.38/0.58 % inst_num_of_duplicates: 0
% 0.38/0.58 % inst_inst_num_from_inst_to_res: 0
% 0.38/0.58 % inst_dismatching_checking_time: 0.
% 0.38/0.58
% 0.38/0.58 % ------ Resolution
% 0.38/0.58
% 0.38/0.58 % res_num_of_clauses: 1697
% 0.38/0.58 % res_num_in_passive: 1316
% 0.38/0.58 % res_num_in_active: 370
% 0.38/0.58 % res_num_of_loops: 373
% 0.38/0.58 % res_forward_subset_subsumed: 408
% 0.38/0.58 % res_backward_subset_subsumed: 17
% 0.38/0.58 % res_forward_subsumed: 18
% 0.38/0.58 % res_backward_subsumed: 9
% 0.38/0.58 % res_forward_subsumption_resolution: 6
% 0.38/0.58 % res_backward_subsumption_resolution: 1
% 0.38/0.58 % res_clause_to_clause_subsumption: 4090
% 0.38/0.58 % res_orphan_elimination: 0
% 0.38/0.58 % res_tautology_del: 48
% 0.38/0.58 % res_num_eq_res_simplified: 0
% 0.38/0.58 % res_num_sel_changes: 0
% 0.38/0.58 % res_moves_from_active_to_pass: 0
% 0.38/0.58
% 0.38/0.58 % Status Unsatisfiable
% 0.38/0.58 % SZS status Unsatisfiable
% 0.38/0.58 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------