TSTP Solution File: SET604+3 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET604+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 02:14:33 EDT 2022
% Result : Theorem 0.21s 0.45s
% Output : CNFRefutation 0.21s
% 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
fof(empty_defn,axiom,
! [B] :
( empty(B)
<=> ! [C] : ~ member(C,B) ),
input ).
fof(empty_defn_0,plain,
! [B] :
( empty(B)
| ~ ! [C] : ~ member(C,B) ),
inference(orientation,[status(thm)],[empty_defn]) ).
fof(empty_defn_1,plain,
! [B] :
( ~ empty(B)
| ! [C] : ~ member(C,B) ),
inference(orientation,[status(thm)],[empty_defn]) ).
fof(reflexivity_of_subset,axiom,
! [B] : subset(B,B),
input ).
fof(reflexivity_of_subset_0,plain,
! [B] :
( subset(B,B)
| $false ),
inference(orientation,[status(thm)],[reflexivity_of_subset]) ).
fof(subset_defn,axiom,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,B)
=> member(D,C) ) ),
input ).
fof(subset_defn_0,plain,
! [B,C] :
( subset(B,C)
| ~ ! [D] :
( member(D,B)
=> member(D,C) ) ),
inference(orientation,[status(thm)],[subset_defn]) ).
fof(subset_defn_1,plain,
! [B,C] :
( ~ subset(B,C)
| ! [D] :
( member(D,B)
=> member(D,C) ) ),
inference(orientation,[status(thm)],[subset_defn]) ).
fof(equal_defn,axiom,
! [B,C] :
( B = C
<=> ( subset(B,C)
& subset(C,B) ) ),
input ).
fof(equal_defn_0,plain,
! [B,C] :
( B = C
| ~ ( subset(B,C)
& subset(C,B) ) ),
inference(orientation,[status(thm)],[equal_defn]) ).
fof(equal_defn_1,plain,
! [B,C] :
( B != C
| ( subset(B,C)
& subset(C,B) ) ),
inference(orientation,[status(thm)],[equal_defn]) ).
fof(difference_defn,axiom,
! [B,C,D] :
( member(D,difference(B,C))
<=> ( member(D,B)
& ~ member(D,C) ) ),
input ).
fof(difference_defn_0,plain,
! [B,C,D] :
( member(D,difference(B,C))
| ~ ( member(D,B)
& ~ member(D,C) ) ),
inference(orientation,[status(thm)],[difference_defn]) ).
fof(difference_defn_1,plain,
! [B,C,D] :
( ~ member(D,difference(B,C))
| ( member(D,B)
& ~ member(D,C) ) ),
inference(orientation,[status(thm)],[difference_defn]) ).
fof(empty_set_defn,axiom,
! [B] : ~ member(B,empty_set),
input ).
fof(empty_set_defn_0,plain,
! [B] :
( ~ member(B,empty_set)
| $false ),
inference(orientation,[status(thm)],[empty_set_defn]) ).
fof(difference_empty_set,axiom,
! [B,C] :
( difference(B,C) = empty_set
<=> subset(B,C) ),
input ).
fof(difference_empty_set_0,plain,
! [B,C] :
( difference(B,C) = empty_set
| ~ subset(B,C) ),
inference(orientation,[status(thm)],[difference_empty_set]) ).
fof(difference_empty_set_1,plain,
! [B,C] :
( difference(B,C) != empty_set
| subset(B,C) ),
inference(orientation,[status(thm)],[difference_empty_set]) ).
fof(empty_set_subset,axiom,
! [B] : subset(empty_set,B),
input ).
fof(empty_set_subset_0,plain,
! [B] :
( subset(empty_set,B)
| $false ),
inference(orientation,[status(thm)],[empty_set_subset]) ).
fof(def_lhs_atom1,axiom,
! [B] :
( lhs_atom1(B)
<=> subset(empty_set,B) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [B] :
( lhs_atom1(B)
| $false ),
inference(fold_definition,[status(thm)],[empty_set_subset_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [C,B] :
( lhs_atom2(C,B)
<=> difference(B,C) != empty_set ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [B,C] :
( lhs_atom2(C,B)
| subset(B,C) ),
inference(fold_definition,[status(thm)],[difference_empty_set_1,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [C,B] :
( lhs_atom3(C,B)
<=> difference(B,C) = empty_set ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
! [B,C] :
( lhs_atom3(C,B)
| ~ subset(B,C) ),
inference(fold_definition,[status(thm)],[difference_empty_set_0,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [B] :
( lhs_atom4(B)
<=> ~ member(B,empty_set) ),
inference(definition,[],]) ).
fof(to_be_clausified_3,plain,
! [B] :
( lhs_atom4(B)
| $false ),
inference(fold_definition,[status(thm)],[empty_set_defn_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
! [D,C,B] :
( lhs_atom5(D,C,B)
<=> ~ member(D,difference(B,C)) ),
inference(definition,[],]) ).
fof(to_be_clausified_4,plain,
! [B,C,D] :
( lhs_atom5(D,C,B)
| ( member(D,B)
& ~ member(D,C) ) ),
inference(fold_definition,[status(thm)],[difference_defn_1,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
! [D,C,B] :
( lhs_atom6(D,C,B)
<=> member(D,difference(B,C)) ),
inference(definition,[],]) ).
fof(to_be_clausified_5,plain,
! [B,C,D] :
( lhs_atom6(D,C,B)
| ~ ( member(D,B)
& ~ member(D,C) ) ),
inference(fold_definition,[status(thm)],[difference_defn_0,def_lhs_atom6]) ).
fof(def_lhs_atom7,axiom,
! [C,B] :
( lhs_atom7(C,B)
<=> B != C ),
inference(definition,[],]) ).
fof(to_be_clausified_6,plain,
! [B,C] :
( lhs_atom7(C,B)
| ( subset(B,C)
& subset(C,B) ) ),
inference(fold_definition,[status(thm)],[equal_defn_1,def_lhs_atom7]) ).
fof(def_lhs_atom8,axiom,
! [C,B] :
( lhs_atom8(C,B)
<=> B = C ),
inference(definition,[],]) ).
fof(to_be_clausified_7,plain,
! [B,C] :
( lhs_atom8(C,B)
| ~ ( subset(B,C)
& subset(C,B) ) ),
inference(fold_definition,[status(thm)],[equal_defn_0,def_lhs_atom8]) ).
fof(def_lhs_atom9,axiom,
! [C,B] :
( lhs_atom9(C,B)
<=> ~ subset(B,C) ),
inference(definition,[],]) ).
fof(to_be_clausified_8,plain,
! [B,C] :
( lhs_atom9(C,B)
| ! [D] :
( member(D,B)
=> member(D,C) ) ),
inference(fold_definition,[status(thm)],[subset_defn_1,def_lhs_atom9]) ).
fof(def_lhs_atom10,axiom,
! [C,B] :
( lhs_atom10(C,B)
<=> subset(B,C) ),
inference(definition,[],]) ).
fof(to_be_clausified_9,plain,
! [B,C] :
( lhs_atom10(C,B)
| ~ ! [D] :
( member(D,B)
=> member(D,C) ) ),
inference(fold_definition,[status(thm)],[subset_defn_0,def_lhs_atom10]) ).
fof(def_lhs_atom11,axiom,
! [B] :
( lhs_atom11(B)
<=> subset(B,B) ),
inference(definition,[],]) ).
fof(to_be_clausified_10,plain,
! [B] :
( lhs_atom11(B)
| $false ),
inference(fold_definition,[status(thm)],[reflexivity_of_subset_0,def_lhs_atom11]) ).
fof(def_lhs_atom12,axiom,
! [B] :
( lhs_atom12(B)
<=> ~ empty(B) ),
inference(definition,[],]) ).
fof(to_be_clausified_11,plain,
! [B] :
( lhs_atom12(B)
| ! [C] : ~ member(C,B) ),
inference(fold_definition,[status(thm)],[empty_defn_1,def_lhs_atom12]) ).
fof(def_lhs_atom13,axiom,
! [B] :
( lhs_atom13(B)
<=> empty(B) ),
inference(definition,[],]) ).
fof(to_be_clausified_12,plain,
! [B] :
( lhs_atom13(B)
| ~ ! [C] : ~ member(C,B) ),
inference(fold_definition,[status(thm)],[empty_defn_0,def_lhs_atom13]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X3,X2,X1] :
( lhs_atom6(X3,X2,X1)
| ~ ( member(X3,X1)
& ~ member(X3,X2) ) ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_1,axiom,
! [X2,X1] :
( lhs_atom10(X2,X1)
| ~ ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_2,axiom,
! [X3,X2,X1] :
( lhs_atom5(X3,X2,X1)
| ( member(X3,X1)
& ~ member(X3,X2) ) ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_3,axiom,
! [X2,X1] :
( lhs_atom8(X2,X1)
| ~ ( subset(X1,X2)
& subset(X2,X1) ) ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_4,axiom,
! [X2,X1] :
( lhs_atom9(X2,X1)
| ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_5,axiom,
! [X2,X1] :
( lhs_atom3(X2,X1)
| ~ subset(X1,X2) ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_6,axiom,
! [X2,X1] :
( lhs_atom7(X2,X1)
| ( subset(X1,X2)
& subset(X2,X1) ) ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_7,axiom,
! [X2,X1] :
( lhs_atom2(X2,X1)
| subset(X1,X2) ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_8,axiom,
! [X1] :
( lhs_atom12(X1)
| ! [X2] : ~ member(X2,X1) ),
file('<stdin>',to_be_clausified_11) ).
fof(c_0_9,axiom,
! [X1] :
( lhs_atom13(X1)
| ~ ! [X2] : ~ member(X2,X1) ),
file('<stdin>',to_be_clausified_12) ).
fof(c_0_10,axiom,
! [X1] :
( lhs_atom11(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_10) ).
fof(c_0_11,axiom,
! [X1] :
( lhs_atom4(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_12,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_13,plain,
! [X3,X2,X1] :
( lhs_atom6(X3,X2,X1)
| ~ ( member(X3,X1)
& ~ member(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_14,axiom,
! [X2,X1] :
( lhs_atom10(X2,X1)
| ~ ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
c_0_1 ).
fof(c_0_15,plain,
! [X3,X2,X1] :
( lhs_atom5(X3,X2,X1)
| ( member(X3,X1)
& ~ member(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_16,axiom,
! [X2,X1] :
( lhs_atom8(X2,X1)
| ~ ( subset(X1,X2)
& subset(X2,X1) ) ),
c_0_3 ).
fof(c_0_17,axiom,
! [X2,X1] :
( lhs_atom9(X2,X1)
| ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
c_0_4 ).
fof(c_0_18,plain,
! [X2,X1] :
( lhs_atom3(X2,X1)
| ~ subset(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_19,axiom,
! [X2,X1] :
( lhs_atom7(X2,X1)
| ( subset(X1,X2)
& subset(X2,X1) ) ),
c_0_6 ).
fof(c_0_20,axiom,
! [X2,X1] :
( lhs_atom2(X2,X1)
| subset(X1,X2) ),
c_0_7 ).
fof(c_0_21,plain,
! [X1] :
( lhs_atom12(X1)
| ! [X2] : ~ member(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_22,plain,
! [X1] :
( lhs_atom13(X1)
| ~ ! [X2] : ~ member(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_23,plain,
! [X1] : lhs_atom11(X1),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_24,plain,
! [X1] : lhs_atom4(X1),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_25,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_26,plain,
! [X4,X5,X6] :
( lhs_atom6(X4,X5,X6)
| ~ member(X4,X6)
| member(X4,X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
fof(c_0_27,plain,
! [X4,X5] :
( ( member(esk1_2(X4,X5),X5)
| lhs_atom10(X4,X5) )
& ( ~ member(esk1_2(X4,X5),X4)
| lhs_atom10(X4,X5) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_28,plain,
! [X4,X5,X6] :
( ( member(X4,X6)
| lhs_atom5(X4,X5,X6) )
& ( ~ member(X4,X5)
| lhs_atom5(X4,X5,X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])]) ).
fof(c_0_29,plain,
! [X3,X4] :
( lhs_atom8(X3,X4)
| ~ subset(X4,X3)
| ~ subset(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])]) ).
fof(c_0_30,plain,
! [X4,X5,X6] :
( lhs_atom9(X4,X5)
| ~ member(X6,X5)
| member(X6,X4) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
fof(c_0_31,plain,
! [X3,X4] :
( lhs_atom3(X3,X4)
| ~ subset(X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_32,plain,
! [X3,X4] :
( ( subset(X4,X3)
| lhs_atom7(X3,X4) )
& ( subset(X3,X4)
| lhs_atom7(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_19])]) ).
fof(c_0_33,plain,
! [X3,X4] :
( lhs_atom2(X3,X4)
| subset(X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_34,plain,
! [X3,X4] :
( lhs_atom12(X3)
| ~ member(X4,X3) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_21])]) ).
fof(c_0_35,plain,
! [X3] :
( lhs_atom13(X3)
| member(esk2_1(X3),X3) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])]) ).
fof(c_0_36,plain,
! [X2] : lhs_atom11(X2),
inference(variable_rename,[status(thm)],[c_0_23]) ).
fof(c_0_37,plain,
! [X2] : lhs_atom4(X2),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_38,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_25]) ).
cnf(c_0_39,plain,
( member(X1,X2)
| lhs_atom6(X1,X2,X3)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_40,plain,
( lhs_atom10(X1,X2)
| ~ member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_41,plain,
( lhs_atom5(X1,X2,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_42,plain,
( lhs_atom5(X1,X2,X3)
| member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_43,plain,
( lhs_atom8(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_44,plain,
( lhs_atom10(X1,X2)
| member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_45,plain,
( member(X1,X2)
| lhs_atom9(X2,X3)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_46,plain,
( lhs_atom3(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_47,plain,
( lhs_atom7(X1,X2)
| subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_48,plain,
( lhs_atom7(X1,X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_49,plain,
( subset(X1,X2)
| lhs_atom2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_50,plain,
( lhs_atom12(X2)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_51,plain,
( member(esk2_1(X1),X1)
| lhs_atom13(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_52,plain,
lhs_atom11(X1),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_53,plain,
lhs_atom4(X1),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_54,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_55,plain,
( member(X1,X2)
| lhs_atom6(X1,X2,X3)
| ~ member(X1,X3) ),
c_0_39,
[final] ).
cnf(c_0_56,plain,
( lhs_atom10(X1,X2)
| ~ member(esk1_2(X1,X2),X1) ),
c_0_40,
[final] ).
cnf(c_0_57,plain,
( lhs_atom5(X1,X2,X3)
| ~ member(X1,X2) ),
c_0_41,
[final] ).
cnf(c_0_58,plain,
( lhs_atom5(X1,X2,X3)
| member(X1,X3) ),
c_0_42,
[final] ).
cnf(c_0_59,plain,
( lhs_atom8(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
c_0_43,
[final] ).
cnf(c_0_60,plain,
( lhs_atom10(X1,X2)
| member(esk1_2(X1,X2),X2) ),
c_0_44,
[final] ).
cnf(c_0_61,plain,
( member(X1,X2)
| lhs_atom9(X2,X3)
| ~ member(X1,X3) ),
c_0_45,
[final] ).
cnf(c_0_62,plain,
( lhs_atom3(X2,X1)
| ~ subset(X1,X2) ),
c_0_46,
[final] ).
cnf(c_0_63,plain,
( lhs_atom7(X1,X2)
| subset(X2,X1) ),
c_0_47,
[final] ).
cnf(c_0_64,plain,
( lhs_atom7(X1,X2)
| subset(X1,X2) ),
c_0_48,
[final] ).
cnf(c_0_65,plain,
( subset(X1,X2)
| lhs_atom2(X2,X1) ),
c_0_49,
[final] ).
cnf(c_0_66,plain,
( lhs_atom12(X2)
| ~ member(X1,X2) ),
c_0_50,
[final] ).
cnf(c_0_67,plain,
( member(esk2_1(X1),X1)
| lhs_atom13(X1) ),
c_0_51,
[final] ).
cnf(c_0_68,plain,
lhs_atom11(X1),
c_0_52,
[final] ).
cnf(c_0_69,plain,
lhs_atom4(X1),
c_0_53,
[final] ).
cnf(c_0_70,plain,
lhs_atom1(X1),
c_0_54,
[final] ).
% End CNF derivation
cnf(c_0_55_0,axiom,
( member(X1,difference(X3,X2))
| member(X1,X2)
| ~ member(X1,X3) ),
inference(unfold_definition,[status(thm)],[c_0_55,def_lhs_atom6]) ).
cnf(c_0_56_0,axiom,
( subset(X2,X1)
| ~ member(sk1_esk1_2(X1,X2),X1) ),
inference(unfold_definition,[status(thm)],[c_0_56,def_lhs_atom10]) ).
cnf(c_0_57_0,axiom,
( ~ member(X1,difference(X3,X2))
| ~ member(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_57,def_lhs_atom5]) ).
cnf(c_0_58_0,axiom,
( ~ member(X1,difference(X3,X2))
| member(X1,X3) ),
inference(unfold_definition,[status(thm)],[c_0_58,def_lhs_atom5]) ).
cnf(c_0_59_0,axiom,
( X2 = X1
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_59,def_lhs_atom8]) ).
cnf(c_0_60_0,axiom,
( subset(X2,X1)
| member(sk1_esk1_2(X1,X2),X2) ),
inference(unfold_definition,[status(thm)],[c_0_60,def_lhs_atom10]) ).
cnf(c_0_61_0,axiom,
( ~ subset(X3,X2)
| member(X1,X2)
| ~ member(X1,X3) ),
inference(unfold_definition,[status(thm)],[c_0_61,def_lhs_atom9]) ).
cnf(c_0_62_0,axiom,
( difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_62,def_lhs_atom3]) ).
cnf(c_0_63_0,axiom,
( X2 != X1
| subset(X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_63,def_lhs_atom7]) ).
cnf(c_0_64_0,axiom,
( X2 != X1
| subset(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_64,def_lhs_atom7]) ).
cnf(c_0_65_0,axiom,
( difference(X1,X2) != empty_set
| subset(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_65,def_lhs_atom2]) ).
cnf(c_0_66_0,axiom,
( ~ empty(X2)
| ~ member(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_66,def_lhs_atom12]) ).
cnf(c_0_67_0,axiom,
( empty(X1)
| member(sk1_esk2_1(X1),X1) ),
inference(unfold_definition,[status(thm)],[c_0_67,def_lhs_atom13]) ).
cnf(c_0_68_0,axiom,
subset(X1,X1),
inference(unfold_definition,[status(thm)],[c_0_68,def_lhs_atom11]) ).
cnf(c_0_69_0,axiom,
~ member(X1,empty_set),
inference(unfold_definition,[status(thm)],[c_0_69,def_lhs_atom4]) ).
cnf(c_0_70_0,axiom,
subset(empty_set,X1),
inference(unfold_definition,[status(thm)],[c_0_70,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1] : difference(empty_set,X1) = empty_set,
file('<stdin>',prove_no_difference_with_empty_set) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1] : difference(empty_set,X1) = empty_set,
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
difference(empty_set,esk1_0) != empty_set,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
cnf(c_0_3_004,negated_conjecture,
difference(empty_set,esk1_0) != empty_set,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
difference(empty_set,esk1_0) != empty_set,
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_16,negated_conjecture,
difference(empty_set,sk3_esk1_0) != empty_set,
file('/export/starexec/sandbox2/tmp/iprover_modulo_0cc62c.p',c_0_4) ).
cnf(c_29,negated_conjecture,
difference(empty_set,sk3_esk1_0) != empty_set,
inference(copy,[status(esa)],[c_16]) ).
cnf(c_33,negated_conjecture,
difference(empty_set,sk3_esk1_0) != empty_set,
inference(copy,[status(esa)],[c_29]) ).
cnf(c_34,negated_conjecture,
difference(empty_set,sk3_esk1_0) != empty_set,
inference(copy,[status(esa)],[c_33]) ).
cnf(c_35,negated_conjecture,
difference(empty_set,sk3_esk1_0) != empty_set,
inference(copy,[status(esa)],[c_34]) ).
cnf(c_85,negated_conjecture,
difference(empty_set,sk3_esk1_0) != empty_set,
inference(copy,[status(esa)],[c_35]) ).
cnf(c_8,plain,
( ~ subset(X0,X1)
| difference(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_0cc62c.p',c_0_62_0) ).
cnf(c_69,plain,
( ~ subset(X0,X1)
| difference(X0,X1) = empty_set ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_89,plain,
~ subset(empty_set,sk3_esk1_0),
inference(resolution,[status(thm)],[c_85,c_69]) ).
cnf(c_90,plain,
~ subset(empty_set,sk3_esk1_0),
inference(rewriting,[status(thm)],[c_89]) ).
cnf(c_0,plain,
subset(empty_set,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_0cc62c.p',c_0_70_0) ).
cnf(c_53,plain,
subset(empty_set,X0),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_94,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_90,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET604+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 10 14:03:52 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % Running in mono-core mode
% 0.21/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.42 % FOF problem with conjecture
% 0.21/0.42 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_68dc41.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_0cc62c.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_d51cc8 | grep -v "SZS"
% 0.21/0.44
% 0.21/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ iProver source info
% 0.21/0.44
% 0.21/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.44 % git: non_committed_changes: true
% 0.21/0.44 % git: last_make_outside_of_git: true
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.44
% 0.21/0.44 % --bmc1_incremental false
% 0.21/0.44 % --bmc1_axioms reachable_all
% 0.21/0.44 % --bmc1_min_bound 0
% 0.21/0.44 % --bmc1_max_bound -1
% 0.21/0.44 % --bmc1_max_bound_default -1
% 0.21/0.44 % --bmc1_symbol_reachability true
% 0.21/0.44 % --bmc1_property_lemmas false
% 0.21/0.44 % --bmc1_k_induction false
% 0.21/0.44 % --bmc1_non_equiv_states false
% 0.21/0.44 % --bmc1_deadlock false
% 0.21/0.44 % --bmc1_ucm false
% 0.21/0.44 % --bmc1_add_unsat_core none
% 0.21/0.44 % --bmc1_unsat_core_children false
% 0.21/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.44 % --bmc1_out_stat full
% 0.21/0.44 % --bmc1_ground_init false
% 0.21/0.44 % --bmc1_pre_inst_next_state false
% 0.21/0.44 % --bmc1_pre_inst_state false
% 0.21/0.44 % --bmc1_pre_inst_reach_state false
% 0.21/0.44 % --bmc1_out_unsat_core false
% 0.21/0.44 % --bmc1_aig_witness_out false
% 0.21/0.44 % --bmc1_verbose false
% 0.21/0.44 % --bmc1_dump_clauses_tptp false
% 0.21/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.44 % --bmc1_dump_file -
% 0.21/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.44 % --bmc1_ucm_extend_mode 1
% 0.21/0.44 % --bmc1_ucm_init_mode 2
% 0.21/0.44 % --bmc1_ucm_cone_mode none
% 0.21/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.44 % --bmc1_ucm_relax_model 4
% 0.21/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.44 % --bmc1_ucm_layered_model none
% 0.21/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.44
% 0.21/0.44 % ------ AIG Options
% 0.21/0.44
% 0.21/0.44 % --aig_mode false
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation Options
% 0.21/0.44
% 0.21/0.44 % --instantiation_flag true
% 0.21/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.44 % --inst_solver_per_active 750
% 0.21/0.44 % --inst_solver_calls_frac 0.5
% 0.21/0.44 % --inst_passive_queue_type priority_queues
% 0.21/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.44 % --inst_passive_queues_freq [25;2]
% 0.21/0.44 % --inst_dismatching true
% 0.21/0.44 % --inst_eager_unprocessed_to_passive true
% 0.21/0.44 % --inst_prop_sim_given true
% 0.21/0.44 % --inst_prop_sim_new false
% 0.21/0.44 % --inst_orphan_elimination true
% 0.21/0.44 % --inst_learning_loop_flag true
% 0.21/0.44 % --inst_learning_start 3000
% 0.21/0.44 % --inst_learning_factor 2
% 0.21/0.44 % --inst_start_prop_sim_after_learn 3
% 0.21/0.44 % --inst_sel_renew solver
% 0.21/0.44 % --inst_lit_activity_flag true
% 0.21/0.44 % --inst_out_proof true
% 0.21/0.44
% 0.21/0.44 % ------ Resolution Options
% 0.21/0.44
% 0.21/0.44 % --resolution_flag true
% 0.21/0.44 % --res_lit_sel kbo_max
% 0.21/0.44 % --res_to_prop_solver none
% 0.21/0.44 % --res_prop_simpl_new false
% 0.21/0.44 % --res_prop_simpl_given false
% 0.21/0.44 % --res_passive_queue_type priority_queues
% 0.21/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.44 % --res_passive_queues_freq [15;5]
% 0.21/0.44 % --res_forward_subs full
% 0.21/0.44 % --res_backward_subs full
% 0.21/0.44 % --res_forward_subs_resolution true
% 0.21/0.44 % --res_backward_subs_resolution true
% 0.21/0.44 % --res_orphan_elimination false
% 0.21/0.44 % --res_time_limit 1000.
% 0.21/0.44 % --res_out_proof true
% 0.21/0.44 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_68dc41.s
% 0.21/0.44 % --modulo true
% 0.21/0.44
% 0.21/0.44 % ------ Combination Options
% 0.21/0.44
% 0.21/0.44 % --comb_res_mult 1000
% 0.21/0.44 % --comb_inst_mult 300
% 0.21/0.44 % ------
% 0.21/0.44
% 0.21/0.44 % ------ Parsing...% successful
% 0.21/0.44
% 0.21/0.44 % ------ 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.21/0.44
% 0.21/0.44 % ------ Proving...
% 0.21/0.44 % ------ Problem Properties
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % EPR false
% 0.21/0.44 % Horn false
% 0.21/0.44 % Has equality true
% 0.21/0.44
% 0.21/0.44 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 % % ------ Current options:
% 0.21/0.44
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.44
% 0.21/0.44 % --bmc1_incremental false
% 0.21/0.44 % --bmc1_axioms reachable_all
% 0.21/0.44 % --bmc1_min_bound 0
% 0.21/0.44 % --bmc1_max_bound -1
% 0.21/0.44 % --bmc1_max_bound_default -1
% 0.21/0.45 % --bmc1_symbol_reachability true
% 0.21/0.45 % --bmc1_property_lemmas false
% 0.21/0.45 % --bmc1_k_induction false
% 0.21/0.45 % --bmc1_non_equiv_states false
% 0.21/0.45 % --bmc1_deadlock false
% 0.21/0.45 % --bmc1_ucm false
% 0.21/0.45 % --bmc1_add_unsat_core none
% 0.21/0.45 % --bmc1_unsat_core_children false
% 0.21/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.45 % --bmc1_out_stat full
% 0.21/0.45 % --bmc1_ground_init false
% 0.21/0.45 % --bmc1_pre_inst_next_state false
% 0.21/0.45 % --bmc1_pre_inst_state false
% 0.21/0.45 % --bmc1_pre_inst_reach_state false
% 0.21/0.45 % --bmc1_out_unsat_core false
% 0.21/0.45 % --bmc1_aig_witness_out false
% 0.21/0.45 % --bmc1_verbose false
% 0.21/0.45 % --bmc1_dump_clauses_tptp false
% 0.21/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.45 % --bmc1_dump_file -
% 0.21/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.45 % --bmc1_ucm_extend_mode 1
% 0.21/0.45 % --bmc1_ucm_init_mode 2
% 0.21/0.45 % --bmc1_ucm_cone_mode none
% 0.21/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.45 % --bmc1_ucm_relax_model 4
% 0.21/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.45 % --bmc1_ucm_layered_model none
% 0.21/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.45
% 0.21/0.45 % ------ AIG Options
% 0.21/0.45
% 0.21/0.45 % --aig_mode false
% 0.21/0.45
% 0.21/0.45 % ------ Instantiation Options
% 0.21/0.45
% 0.21/0.45 % --instantiation_flag true
% 0.21/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.45 % --inst_solver_per_active 750
% 0.21/0.45 % --inst_solver_calls_frac 0.5
% 0.21/0.45 % --inst_passive_queue_type priority_queues
% 0.21/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.45 % --inst_passive_queues_freq [25;2]
% 0.21/0.45 % --inst_dismatching true
% 0.21/0.45 % --inst_eager_unprocessed_to_passive true
% 0.21/0.45 % --inst_prop_sim_given true
% 0.21/0.45 % --inst_prop_sim_new false
% 0.21/0.45 % --inst_orphan_elimination true
% 0.21/0.45 % --inst_learning_loop_flag true
% 0.21/0.45 % --inst_learning_start 3000
% 0.21/0.45 % --inst_learning_factor 2
% 0.21/0.45 % --inst_start_prop_sim_after_learn 3
% 0.21/0.45 % --inst_sel_renew solver
% 0.21/0.45 % --inst_lit_activity_flag true
% 0.21/0.45 % --inst_out_proof true
% 0.21/0.45
% 0.21/0.45 % ------ Resolution Options
% 0.21/0.45
% 0.21/0.45 % --resolution_flag true
% 0.21/0.45 % --res_lit_sel kbo_max
% 0.21/0.45 % --res_to_prop_solver none
% 0.21/0.45 % --res_prop_simpl_new false
% 0.21/0.45 % --res_prop_simpl_given false
% 0.21/0.45 % --res_passive_queue_type priority_queues
% 0.21/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.45 % --res_passive_queues_freq [15;5]
% 0.21/0.45 % --res_forward_subs full
% 0.21/0.45 % --res_backward_subs full
% 0.21/0.45 % --res_forward_subs_resolution true
% 0.21/0.45 % --res_backward_subs_resolution true
% 0.21/0.45 % --res_orphan_elimination false
% 0.21/0.45 % --res_time_limit 1000.
% 0.21/0.45 % --res_out_proof true
% 0.21/0.45 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_68dc41.s
% 0.21/0.45 % --modulo true
% 0.21/0.45
% 0.21/0.45 % ------ Combination Options
% 0.21/0.45
% 0.21/0.45 % --comb_res_mult 1000
% 0.21/0.45 % --comb_inst_mult 300
% 0.21/0.45 % ------
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 % ------ Proving...
% 0.21/0.45 %
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 % Resolution empty clause
% 0.21/0.45
% 0.21/0.45 % ------ Statistics
% 0.21/0.45
% 0.21/0.45 % ------ General
% 0.21/0.45
% 0.21/0.45 % num_of_input_clauses: 17
% 0.21/0.45 % num_of_input_neg_conjectures: 1
% 0.21/0.45 % num_of_splits: 0
% 0.21/0.45 % num_of_split_atoms: 0
% 0.21/0.45 % num_of_sem_filtered_clauses: 0
% 0.21/0.45 % num_of_subtypes: 0
% 0.21/0.45 % monotx_restored_types: 0
% 0.21/0.45 % sat_num_of_epr_types: 0
% 0.21/0.45 % sat_num_of_non_cyclic_types: 0
% 0.21/0.45 % sat_guarded_non_collapsed_types: 0
% 0.21/0.45 % is_epr: 0
% 0.21/0.45 % is_horn: 0
% 0.21/0.45 % has_eq: 1
% 0.21/0.45 % num_pure_diseq_elim: 0
% 0.21/0.45 % simp_replaced_by: 0
% 0.21/0.45 % res_preprocessed: 2
% 0.21/0.45 % prep_upred: 0
% 0.21/0.45 % prep_unflattend: 0
% 0.21/0.45 % pred_elim_cands: 0
% 0.21/0.45 % pred_elim: 0
% 0.21/0.45 % pred_elim_cl: 0
% 0.21/0.45 % pred_elim_cycles: 0
% 0.21/0.45 % forced_gc_time: 0
% 0.21/0.45 % gc_basic_clause_elim: 0
% 0.21/0.45 % parsing_time: 0.001
% 0.21/0.45 % sem_filter_time: 0.
% 0.21/0.45 % pred_elim_time: 0.
% 0.21/0.45 % out_proof_time: 0.
% 0.21/0.45 % monotx_time: 0.
% 0.21/0.45 % subtype_inf_time: 0.
% 0.21/0.45 % unif_index_cands_time: 0.
% 0.21/0.45 % unif_index_add_time: 0.
% 0.21/0.45 % total_time: 0.021
% 0.21/0.45 % num_of_symbols: 33
% 0.21/0.45 % num_of_terms: 85
% 0.21/0.45
% 0.21/0.45 % ------ Propositional Solver
% 0.21/0.45
% 0.21/0.45 % prop_solver_calls: 1
% 0.21/0.45 % prop_fast_solver_calls: 3
% 0.21/0.45 % prop_num_of_clauses: 29
% 0.21/0.45 % prop_preprocess_simplified: 45
% 0.21/0.45 % prop_fo_subsumed: 0
% 0.21/0.45 % prop_solver_time: 0.
% 0.21/0.45 % prop_fast_solver_time: 0.
% 0.21/0.45 % prop_unsat_core_time: 0.
% 0.21/0.45
% 0.21/0.45 % ------ QBF
% 0.21/0.45
% 0.21/0.45 % qbf_q_res: 0
% 0.21/0.45 % qbf_num_tautologies: 0
% 0.21/0.45 % qbf_prep_cycles: 0
% 0.21/0.45
% 0.21/0.45 % ------ BMC1
% 0.21/0.45
% 0.21/0.45 % bmc1_current_bound: -1
% 0.21/0.45 % bmc1_last_solved_bound: -1
% 0.21/0.45 % bmc1_unsat_core_size: -1
% 0.21/0.45 % bmc1_unsat_core_parents_size: -1
% 0.21/0.45 % bmc1_merge_next_fun: 0
% 0.21/0.45 % bmc1_unsat_core_clauses_time: 0.
% 0.21/0.45
% 0.21/0.45 % ------ Instantiation
% 0.21/0.45
% 0.21/0.45 % inst_num_of_clauses: 17
% 0.21/0.45 % inst_num_in_passive: 0
% 0.21/0.45 % inst_num_in_active: 0
% 0.21/0.45 % inst_num_in_unprocessed: 17
% 0.21/0.45 % inst_num_of_loops: 0
% 0.21/0.45 % inst_num_of_learning_restarts: 0
% 0.21/0.45 % inst_num_moves_active_passive: 0
% 0.21/0.45 % inst_lit_activity: 0
% 0.21/0.45 % inst_lit_activity_moves: 0
% 0.21/0.45 % inst_num_tautologies: 0
% 0.21/0.45 % inst_num_prop_implied: 0
% 0.21/0.45 % inst_num_existing_simplified: 0
% 0.21/0.45 % inst_num_eq_res_simplified: 0
% 0.21/0.45 % inst_num_child_elim: 0
% 0.21/0.45 % inst_num_of_dismatching_blockings: 0
% 0.21/0.45 % inst_num_of_non_proper_insts: 0
% 0.21/0.45 % inst_num_of_duplicates: 0
% 0.21/0.45 % inst_inst_num_from_inst_to_res: 0
% 0.21/0.45 % inst_dismatching_checking_time: 0.
% 0.21/0.45
% 0.21/0.45 % ------ Resolution
% 0.21/0.45
% 0.21/0.45 % res_num_of_clauses: 25
% 0.21/0.45 % res_num_in_passive: 1
% 0.21/0.45 % res_num_in_active: 17
% 0.21/0.45 % res_num_of_loops: 2
% 0.21/0.45 % res_forward_subset_subsumed: 0
% 0.21/0.45 % res_backward_subset_subsumed: 0
% 0.21/0.45 % res_forward_subsumed: 0
% 0.21/0.45 % res_backward_subsumed: 0
% 0.21/0.45 % res_forward_subsumption_resolution: 1
% 0.21/0.45 % res_backward_subsumption_resolution: 0
% 0.21/0.45 % res_clause_to_clause_subsumption: 2
% 0.21/0.45 % res_orphan_elimination: 0
% 0.21/0.45 % res_tautology_del: 0
% 0.21/0.45 % res_num_eq_res_simplified: 0
% 0.21/0.45 % res_num_sel_changes: 0
% 0.21/0.45 % res_moves_from_active_to_pass: 0
% 0.21/0.45
% 0.21/0.45 % Status Unsatisfiable
% 0.21/0.45 % SZS status Theorem
% 0.21/0.45 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------