TSTP Solution File: SET148+4 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET148+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n011.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:11:02 EDT 2022
% Result : Theorem 0.20s 0.43s
% Output : CNFRefutation 0.20s
% 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(product,axiom,
! [X,A] :
( member(X,product(A))
<=> ! [Y] :
( member(Y,A)
=> member(X,Y) ) ),
input ).
fof(product_0,plain,
! [A,X] :
( member(X,product(A))
| ~ ! [Y] :
( member(Y,A)
=> member(X,Y) ) ),
inference(orientation,[status(thm)],[product]) ).
fof(product_1,plain,
! [A,X] :
( ~ member(X,product(A))
| ! [Y] :
( member(Y,A)
=> member(X,Y) ) ),
inference(orientation,[status(thm)],[product]) ).
fof(sum,axiom,
! [X,A] :
( member(X,sum(A))
<=> ? [Y] :
( member(Y,A)
& member(X,Y) ) ),
input ).
fof(sum_0,plain,
! [A,X] :
( member(X,sum(A))
| ~ ? [Y] :
( member(Y,A)
& member(X,Y) ) ),
inference(orientation,[status(thm)],[sum]) ).
fof(sum_1,plain,
! [A,X] :
( ~ member(X,sum(A))
| ? [Y] :
( member(Y,A)
& member(X,Y) ) ),
inference(orientation,[status(thm)],[sum]) ).
fof(unordered_pair,axiom,
! [X,A,B] :
( member(X,unordered_pair(A,B))
<=> ( X = A
| X = B ) ),
input ).
fof(unordered_pair_0,plain,
! [A,B,X] :
( member(X,unordered_pair(A,B))
| ~ ( X = A
| X = B ) ),
inference(orientation,[status(thm)],[unordered_pair]) ).
fof(unordered_pair_1,plain,
! [A,B,X] :
( ~ member(X,unordered_pair(A,B))
| X = A
| X = B ),
inference(orientation,[status(thm)],[unordered_pair]) ).
fof(singleton,axiom,
! [X,A] :
( member(X,singleton(A))
<=> X = A ),
input ).
fof(singleton_0,plain,
! [A,X] :
( member(X,singleton(A))
| X != A ),
inference(orientation,[status(thm)],[singleton]) ).
fof(singleton_1,plain,
! [A,X] :
( ~ member(X,singleton(A))
| X = A ),
inference(orientation,[status(thm)],[singleton]) ).
fof(difference,axiom,
! [B,A,E] :
( member(B,difference(E,A))
<=> ( member(B,E)
& ~ member(B,A) ) ),
input ).
fof(difference_0,plain,
! [A,B,E] :
( member(B,difference(E,A))
| ~ ( member(B,E)
& ~ member(B,A) ) ),
inference(orientation,[status(thm)],[difference]) ).
fof(difference_1,plain,
! [A,B,E] :
( ~ member(B,difference(E,A))
| ( member(B,E)
& ~ member(B,A) ) ),
inference(orientation,[status(thm)],[difference]) ).
fof(empty_set,axiom,
! [X] : ~ member(X,empty_set),
input ).
fof(empty_set_0,plain,
! [X] :
( ~ member(X,empty_set)
| $false ),
inference(orientation,[status(thm)],[empty_set]) ).
fof(union,axiom,
! [X,A,B] :
( member(X,union(A,B))
<=> ( member(X,A)
| member(X,B) ) ),
input ).
fof(union_0,plain,
! [A,B,X] :
( member(X,union(A,B))
| ~ ( member(X,A)
| member(X,B) ) ),
inference(orientation,[status(thm)],[union]) ).
fof(union_1,plain,
! [A,B,X] :
( ~ member(X,union(A,B))
| member(X,A)
| member(X,B) ),
inference(orientation,[status(thm)],[union]) ).
fof(intersection,axiom,
! [X,A,B] :
( member(X,intersection(A,B))
<=> ( member(X,A)
& member(X,B) ) ),
input ).
fof(intersection_0,plain,
! [A,B,X] :
( member(X,intersection(A,B))
| ~ ( member(X,A)
& member(X,B) ) ),
inference(orientation,[status(thm)],[intersection]) ).
fof(intersection_1,plain,
! [A,B,X] :
( ~ member(X,intersection(A,B))
| ( member(X,A)
& member(X,B) ) ),
inference(orientation,[status(thm)],[intersection]) ).
fof(power_set,axiom,
! [X,A] :
( member(X,power_set(A))
<=> subset(X,A) ),
input ).
fof(power_set_0,plain,
! [A,X] :
( member(X,power_set(A))
| ~ subset(X,A) ),
inference(orientation,[status(thm)],[power_set]) ).
fof(power_set_1,plain,
! [A,X] :
( ~ member(X,power_set(A))
| subset(X,A) ),
inference(orientation,[status(thm)],[power_set]) ).
fof(equal_set,axiom,
! [A,B] :
( equal_set(A,B)
<=> ( subset(A,B)
& subset(B,A) ) ),
input ).
fof(equal_set_0,plain,
! [A,B] :
( equal_set(A,B)
| ~ ( subset(A,B)
& subset(B,A) ) ),
inference(orientation,[status(thm)],[equal_set]) ).
fof(equal_set_1,plain,
! [A,B] :
( ~ equal_set(A,B)
| ( subset(A,B)
& subset(B,A) ) ),
inference(orientation,[status(thm)],[equal_set]) ).
fof(subset,axiom,
! [A,B] :
( subset(A,B)
<=> ! [X] :
( member(X,A)
=> member(X,B) ) ),
input ).
fof(subset_0,plain,
! [A,B] :
( subset(A,B)
| ~ ! [X] :
( member(X,A)
=> member(X,B) ) ),
inference(orientation,[status(thm)],[subset]) ).
fof(subset_1,plain,
! [A,B] :
( ~ subset(A,B)
| ! [X] :
( member(X,A)
=> member(X,B) ) ),
inference(orientation,[status(thm)],[subset]) ).
fof(def_lhs_atom1,axiom,
! [B,A] :
( lhs_atom1(B,A)
<=> ~ subset(A,B) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [A,B] :
( lhs_atom1(B,A)
| ! [X] :
( member(X,A)
=> member(X,B) ) ),
inference(fold_definition,[status(thm)],[subset_1,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [B,A] :
( lhs_atom2(B,A)
<=> subset(A,B) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [A,B] :
( lhs_atom2(B,A)
| ~ ! [X] :
( member(X,A)
=> member(X,B) ) ),
inference(fold_definition,[status(thm)],[subset_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [B,A] :
( lhs_atom3(B,A)
<=> ~ equal_set(A,B) ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
! [A,B] :
( lhs_atom3(B,A)
| ( subset(A,B)
& subset(B,A) ) ),
inference(fold_definition,[status(thm)],[equal_set_1,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [B,A] :
( lhs_atom4(B,A)
<=> equal_set(A,B) ),
inference(definition,[],]) ).
fof(to_be_clausified_3,plain,
! [A,B] :
( lhs_atom4(B,A)
| ~ ( subset(A,B)
& subset(B,A) ) ),
inference(fold_definition,[status(thm)],[equal_set_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
! [X,A] :
( lhs_atom5(X,A)
<=> ~ member(X,power_set(A)) ),
inference(definition,[],]) ).
fof(to_be_clausified_4,plain,
! [A,X] :
( lhs_atom5(X,A)
| subset(X,A) ),
inference(fold_definition,[status(thm)],[power_set_1,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
! [X,A] :
( lhs_atom6(X,A)
<=> member(X,power_set(A)) ),
inference(definition,[],]) ).
fof(to_be_clausified_5,plain,
! [A,X] :
( lhs_atom6(X,A)
| ~ subset(X,A) ),
inference(fold_definition,[status(thm)],[power_set_0,def_lhs_atom6]) ).
fof(def_lhs_atom7,axiom,
! [X,B,A] :
( lhs_atom7(X,B,A)
<=> ~ member(X,intersection(A,B)) ),
inference(definition,[],]) ).
fof(to_be_clausified_6,plain,
! [A,B,X] :
( lhs_atom7(X,B,A)
| ( member(X,A)
& member(X,B) ) ),
inference(fold_definition,[status(thm)],[intersection_1,def_lhs_atom7]) ).
fof(def_lhs_atom8,axiom,
! [X,B,A] :
( lhs_atom8(X,B,A)
<=> member(X,intersection(A,B)) ),
inference(definition,[],]) ).
fof(to_be_clausified_7,plain,
! [A,B,X] :
( lhs_atom8(X,B,A)
| ~ ( member(X,A)
& member(X,B) ) ),
inference(fold_definition,[status(thm)],[intersection_0,def_lhs_atom8]) ).
fof(def_lhs_atom9,axiom,
! [X,B,A] :
( lhs_atom9(X,B,A)
<=> ~ member(X,union(A,B)) ),
inference(definition,[],]) ).
fof(to_be_clausified_8,plain,
! [A,B,X] :
( lhs_atom9(X,B,A)
| member(X,A)
| member(X,B) ),
inference(fold_definition,[status(thm)],[union_1,def_lhs_atom9]) ).
fof(def_lhs_atom10,axiom,
! [X,B,A] :
( lhs_atom10(X,B,A)
<=> member(X,union(A,B)) ),
inference(definition,[],]) ).
fof(to_be_clausified_9,plain,
! [A,B,X] :
( lhs_atom10(X,B,A)
| ~ ( member(X,A)
| member(X,B) ) ),
inference(fold_definition,[status(thm)],[union_0,def_lhs_atom10]) ).
fof(def_lhs_atom11,axiom,
! [X] :
( lhs_atom11(X)
<=> ~ member(X,empty_set) ),
inference(definition,[],]) ).
fof(to_be_clausified_10,plain,
! [X] :
( lhs_atom11(X)
| $false ),
inference(fold_definition,[status(thm)],[empty_set_0,def_lhs_atom11]) ).
fof(def_lhs_atom12,axiom,
! [E,B,A] :
( lhs_atom12(E,B,A)
<=> ~ member(B,difference(E,A)) ),
inference(definition,[],]) ).
fof(to_be_clausified_11,plain,
! [A,B,E] :
( lhs_atom12(E,B,A)
| ( member(B,E)
& ~ member(B,A) ) ),
inference(fold_definition,[status(thm)],[difference_1,def_lhs_atom12]) ).
fof(def_lhs_atom13,axiom,
! [E,B,A] :
( lhs_atom13(E,B,A)
<=> member(B,difference(E,A)) ),
inference(definition,[],]) ).
fof(to_be_clausified_12,plain,
! [A,B,E] :
( lhs_atom13(E,B,A)
| ~ ( member(B,E)
& ~ member(B,A) ) ),
inference(fold_definition,[status(thm)],[difference_0,def_lhs_atom13]) ).
fof(def_lhs_atom14,axiom,
! [X,A] :
( lhs_atom14(X,A)
<=> ~ member(X,singleton(A)) ),
inference(definition,[],]) ).
fof(to_be_clausified_13,plain,
! [A,X] :
( lhs_atom14(X,A)
| X = A ),
inference(fold_definition,[status(thm)],[singleton_1,def_lhs_atom14]) ).
fof(def_lhs_atom15,axiom,
! [X,A] :
( lhs_atom15(X,A)
<=> member(X,singleton(A)) ),
inference(definition,[],]) ).
fof(to_be_clausified_14,plain,
! [A,X] :
( lhs_atom15(X,A)
| X != A ),
inference(fold_definition,[status(thm)],[singleton_0,def_lhs_atom15]) ).
fof(def_lhs_atom16,axiom,
! [X,B,A] :
( lhs_atom16(X,B,A)
<=> ~ member(X,unordered_pair(A,B)) ),
inference(definition,[],]) ).
fof(to_be_clausified_15,plain,
! [A,B,X] :
( lhs_atom16(X,B,A)
| X = A
| X = B ),
inference(fold_definition,[status(thm)],[unordered_pair_1,def_lhs_atom16]) ).
fof(def_lhs_atom17,axiom,
! [X,B,A] :
( lhs_atom17(X,B,A)
<=> member(X,unordered_pair(A,B)) ),
inference(definition,[],]) ).
fof(to_be_clausified_16,plain,
! [A,B,X] :
( lhs_atom17(X,B,A)
| ~ ( X = A
| X = B ) ),
inference(fold_definition,[status(thm)],[unordered_pair_0,def_lhs_atom17]) ).
fof(def_lhs_atom18,axiom,
! [X,A] :
( lhs_atom18(X,A)
<=> ~ member(X,sum(A)) ),
inference(definition,[],]) ).
fof(to_be_clausified_17,plain,
! [A,X] :
( lhs_atom18(X,A)
| ? [Y] :
( member(Y,A)
& member(X,Y) ) ),
inference(fold_definition,[status(thm)],[sum_1,def_lhs_atom18]) ).
fof(def_lhs_atom19,axiom,
! [X,A] :
( lhs_atom19(X,A)
<=> member(X,sum(A)) ),
inference(definition,[],]) ).
fof(to_be_clausified_18,plain,
! [A,X] :
( lhs_atom19(X,A)
| ~ ? [Y] :
( member(Y,A)
& member(X,Y) ) ),
inference(fold_definition,[status(thm)],[sum_0,def_lhs_atom19]) ).
fof(def_lhs_atom20,axiom,
! [X,A] :
( lhs_atom20(X,A)
<=> ~ member(X,product(A)) ),
inference(definition,[],]) ).
fof(to_be_clausified_19,plain,
! [A,X] :
( lhs_atom20(X,A)
| ! [Y] :
( member(Y,A)
=> member(X,Y) ) ),
inference(fold_definition,[status(thm)],[product_1,def_lhs_atom20]) ).
fof(def_lhs_atom21,axiom,
! [X,A] :
( lhs_atom21(X,A)
<=> member(X,product(A)) ),
inference(definition,[],]) ).
fof(to_be_clausified_20,plain,
! [A,X] :
( lhs_atom21(X,A)
| ~ ! [Y] :
( member(Y,A)
=> member(X,Y) ) ),
inference(fold_definition,[status(thm)],[product_0,def_lhs_atom21]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X3,X1,X2] :
( lhs_atom8(X3,X1,X2)
| ~ ( member(X3,X2)
& member(X3,X1) ) ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_1,axiom,
! [X4,X1,X2] :
( lhs_atom13(X4,X1,X2)
| ~ ( member(X1,X4)
& ~ member(X1,X2) ) ),
file('<stdin>',to_be_clausified_12) ).
fof(c_0_2,axiom,
! [X3,X1,X2] :
( lhs_atom9(X3,X1,X2)
| member(X3,X2)
| member(X3,X1) ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_3,axiom,
! [X3,X2] :
( lhs_atom21(X3,X2)
| ~ ! [X5] :
( member(X5,X2)
=> member(X3,X5) ) ),
file('<stdin>',to_be_clausified_20) ).
fof(c_0_4,axiom,
! [X1,X2] :
( lhs_atom2(X1,X2)
| ~ ! [X3] :
( member(X3,X2)
=> member(X3,X1) ) ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_5,axiom,
! [X4,X1,X2] :
( lhs_atom12(X4,X1,X2)
| ( member(X1,X4)
& ~ member(X1,X2) ) ),
file('<stdin>',to_be_clausified_11) ).
fof(c_0_6,axiom,
! [X3,X1,X2] :
( lhs_atom10(X3,X1,X2)
| ~ ( member(X3,X2)
| member(X3,X1) ) ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_7,axiom,
! [X3,X1,X2] :
( lhs_atom7(X3,X1,X2)
| ( member(X3,X2)
& member(X3,X1) ) ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_8,axiom,
! [X3,X2] :
( lhs_atom19(X3,X2)
| ~ ? [X5] :
( member(X5,X2)
& member(X3,X5) ) ),
file('<stdin>',to_be_clausified_18) ).
fof(c_0_9,axiom,
! [X1,X2] :
( lhs_atom4(X1,X2)
| ~ ( subset(X2,X1)
& subset(X1,X2) ) ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_10,axiom,
! [X3,X1,X2] :
( lhs_atom16(X3,X1,X2)
| X3 = X2
| X3 = X1 ),
file('<stdin>',to_be_clausified_15) ).
fof(c_0_11,axiom,
! [X3,X1,X2] :
( lhs_atom17(X3,X1,X2)
| ~ ( X3 = X2
| X3 = X1 ) ),
file('<stdin>',to_be_clausified_16) ).
fof(c_0_12,axiom,
! [X3,X2] :
( lhs_atom18(X3,X2)
| ? [X5] :
( member(X5,X2)
& member(X3,X5) ) ),
file('<stdin>',to_be_clausified_17) ).
fof(c_0_13,axiom,
! [X3,X2] :
( lhs_atom20(X3,X2)
| ! [X5] :
( member(X5,X2)
=> member(X3,X5) ) ),
file('<stdin>',to_be_clausified_19) ).
fof(c_0_14,axiom,
! [X1,X2] :
( lhs_atom1(X1,X2)
| ! [X3] :
( member(X3,X2)
=> member(X3,X1) ) ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_15,axiom,
! [X3,X2] :
( lhs_atom6(X3,X2)
| ~ subset(X3,X2) ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_16,axiom,
! [X3,X2] :
( lhs_atom5(X3,X2)
| subset(X3,X2) ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_17,axiom,
! [X1,X2] :
( lhs_atom3(X1,X2)
| ( subset(X2,X1)
& subset(X1,X2) ) ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_18,axiom,
! [X3,X2] :
( lhs_atom15(X3,X2)
| X3 != X2 ),
file('<stdin>',to_be_clausified_14) ).
fof(c_0_19,axiom,
! [X3,X2] :
( lhs_atom14(X3,X2)
| X3 = X2 ),
file('<stdin>',to_be_clausified_13) ).
fof(c_0_20,axiom,
! [X3] :
( lhs_atom11(X3)
| ~ $true ),
file('<stdin>',to_be_clausified_10) ).
fof(c_0_21,axiom,
! [X3,X1,X2] :
( lhs_atom8(X3,X1,X2)
| ~ ( member(X3,X2)
& member(X3,X1) ) ),
c_0_0 ).
fof(c_0_22,plain,
! [X4,X1,X2] :
( lhs_atom13(X4,X1,X2)
| ~ ( member(X1,X4)
& ~ member(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_23,axiom,
! [X3,X1,X2] :
( lhs_atom9(X3,X1,X2)
| member(X3,X2)
| member(X3,X1) ),
c_0_2 ).
fof(c_0_24,axiom,
! [X3,X2] :
( lhs_atom21(X3,X2)
| ~ ! [X5] :
( member(X5,X2)
=> member(X3,X5) ) ),
c_0_3 ).
fof(c_0_25,axiom,
! [X1,X2] :
( lhs_atom2(X1,X2)
| ~ ! [X3] :
( member(X3,X2)
=> member(X3,X1) ) ),
c_0_4 ).
fof(c_0_26,plain,
! [X4,X1,X2] :
( lhs_atom12(X4,X1,X2)
| ( member(X1,X4)
& ~ member(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_27,axiom,
! [X3,X1,X2] :
( lhs_atom10(X3,X1,X2)
| ~ ( member(X3,X2)
| member(X3,X1) ) ),
c_0_6 ).
fof(c_0_28,axiom,
! [X3,X1,X2] :
( lhs_atom7(X3,X1,X2)
| ( member(X3,X2)
& member(X3,X1) ) ),
c_0_7 ).
fof(c_0_29,axiom,
! [X3,X2] :
( lhs_atom19(X3,X2)
| ~ ? [X5] :
( member(X5,X2)
& member(X3,X5) ) ),
c_0_8 ).
fof(c_0_30,axiom,
! [X1,X2] :
( lhs_atom4(X1,X2)
| ~ ( subset(X2,X1)
& subset(X1,X2) ) ),
c_0_9 ).
fof(c_0_31,axiom,
! [X3,X1,X2] :
( lhs_atom16(X3,X1,X2)
| X3 = X2
| X3 = X1 ),
c_0_10 ).
fof(c_0_32,axiom,
! [X3,X1,X2] :
( lhs_atom17(X3,X1,X2)
| ~ ( X3 = X2
| X3 = X1 ) ),
c_0_11 ).
fof(c_0_33,axiom,
! [X3,X2] :
( lhs_atom18(X3,X2)
| ? [X5] :
( member(X5,X2)
& member(X3,X5) ) ),
c_0_12 ).
fof(c_0_34,axiom,
! [X3,X2] :
( lhs_atom20(X3,X2)
| ! [X5] :
( member(X5,X2)
=> member(X3,X5) ) ),
c_0_13 ).
fof(c_0_35,axiom,
! [X1,X2] :
( lhs_atom1(X1,X2)
| ! [X3] :
( member(X3,X2)
=> member(X3,X1) ) ),
c_0_14 ).
fof(c_0_36,plain,
! [X3,X2] :
( lhs_atom6(X3,X2)
| ~ subset(X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_37,axiom,
! [X3,X2] :
( lhs_atom5(X3,X2)
| subset(X3,X2) ),
c_0_16 ).
fof(c_0_38,axiom,
! [X1,X2] :
( lhs_atom3(X1,X2)
| ( subset(X2,X1)
& subset(X1,X2) ) ),
c_0_17 ).
fof(c_0_39,plain,
! [X3,X2] :
( lhs_atom15(X3,X2)
| X3 != X2 ),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_40,axiom,
! [X3,X2] :
( lhs_atom14(X3,X2)
| X3 = X2 ),
c_0_19 ).
fof(c_0_41,plain,
! [X3] : lhs_atom11(X3),
inference(fof_simplification,[status(thm)],[c_0_20]) ).
fof(c_0_42,plain,
! [X4,X5,X6] :
( lhs_atom8(X4,X5,X6)
| ~ member(X4,X6)
| ~ member(X4,X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])]) ).
fof(c_0_43,plain,
! [X5,X6,X7] :
( lhs_atom13(X5,X6,X7)
| ~ member(X6,X5)
| member(X6,X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])]) ).
fof(c_0_44,plain,
! [X4,X5,X6] :
( lhs_atom9(X4,X5,X6)
| member(X4,X6)
| member(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_23]) ).
fof(c_0_45,plain,
! [X6,X7] :
( ( member(esk3_2(X6,X7),X7)
| lhs_atom21(X6,X7) )
& ( ~ member(X6,esk3_2(X6,X7))
| lhs_atom21(X6,X7) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])]) ).
fof(c_0_46,plain,
! [X4,X5] :
( ( member(esk1_2(X4,X5),X5)
| lhs_atom2(X4,X5) )
& ( ~ member(esk1_2(X4,X5),X4)
| lhs_atom2(X4,X5) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
fof(c_0_47,plain,
! [X5,X6,X7] :
( ( member(X6,X5)
| lhs_atom12(X5,X6,X7) )
& ( ~ member(X6,X7)
| lhs_atom12(X5,X6,X7) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_26])]) ).
fof(c_0_48,plain,
! [X4,X5,X6] :
( ( ~ member(X4,X6)
| lhs_atom10(X4,X5,X6) )
& ( ~ member(X4,X5)
| lhs_atom10(X4,X5,X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])]) ).
fof(c_0_49,plain,
! [X4,X5,X6] :
( ( member(X4,X6)
| lhs_atom7(X4,X5,X6) )
& ( member(X4,X5)
| lhs_atom7(X4,X5,X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_28])]) ).
fof(c_0_50,plain,
! [X6,X7,X8] :
( lhs_atom19(X6,X7)
| ~ member(X8,X7)
| ~ member(X6,X8) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])]) ).
fof(c_0_51,plain,
! [X3,X4] :
( lhs_atom4(X3,X4)
| ~ subset(X4,X3)
| ~ subset(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])]) ).
fof(c_0_52,plain,
! [X4,X5,X6] :
( lhs_atom16(X4,X5,X6)
| X4 = X6
| X4 = X5 ),
inference(variable_rename,[status(thm)],[c_0_31]) ).
fof(c_0_53,plain,
! [X4,X5,X6] :
( ( X4 != X6
| lhs_atom17(X4,X5,X6) )
& ( X4 != X5
| lhs_atom17(X4,X5,X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])]) ).
fof(c_0_54,plain,
! [X6,X7] :
( ( member(esk2_2(X6,X7),X7)
| lhs_atom18(X6,X7) )
& ( member(X6,esk2_2(X6,X7))
| lhs_atom18(X6,X7) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_33])])]) ).
fof(c_0_55,plain,
! [X6,X7,X8] :
( lhs_atom20(X6,X7)
| ~ member(X8,X7)
| member(X6,X8) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])]) ).
fof(c_0_56,plain,
! [X4,X5,X6] :
( lhs_atom1(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_35])])]) ).
fof(c_0_57,plain,
! [X4,X5] :
( lhs_atom6(X4,X5)
| ~ subset(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_36]) ).
fof(c_0_58,plain,
! [X4,X5] :
( lhs_atom5(X4,X5)
| subset(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_37]) ).
fof(c_0_59,plain,
! [X3,X4] :
( ( subset(X4,X3)
| lhs_atom3(X3,X4) )
& ( subset(X3,X4)
| lhs_atom3(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_38])]) ).
fof(c_0_60,plain,
! [X4,X5] :
( lhs_atom15(X4,X5)
| X4 != X5 ),
inference(variable_rename,[status(thm)],[c_0_39]) ).
fof(c_0_61,plain,
! [X4,X5] :
( lhs_atom14(X4,X5)
| X4 = X5 ),
inference(variable_rename,[status(thm)],[c_0_40]) ).
fof(c_0_62,plain,
! [X4] : lhs_atom11(X4),
inference(variable_rename,[status(thm)],[c_0_41]) ).
cnf(c_0_63,plain,
( lhs_atom8(X1,X2,X3)
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_64,plain,
( member(X1,X2)
| lhs_atom13(X3,X1,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_65,plain,
( member(X1,X2)
| member(X1,X3)
| lhs_atom9(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_66,plain,
( lhs_atom21(X1,X2)
| ~ member(X1,esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_67,plain,
( lhs_atom2(X1,X2)
| ~ member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_68,plain,
( lhs_atom12(X1,X2,X3)
| ~ member(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_69,plain,
( lhs_atom10(X1,X2,X3)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_70,plain,
( lhs_atom10(X1,X2,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_71,plain,
( lhs_atom12(X1,X2,X3)
| member(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_72,plain,
( lhs_atom7(X1,X2,X3)
| member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_73,plain,
( lhs_atom7(X1,X2,X3)
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_74,plain,
( lhs_atom19(X1,X3)
| ~ member(X1,X2)
| ~ member(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_75,plain,
( lhs_atom4(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_76,plain,
( X1 = X2
| X1 = X3
| lhs_atom16(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_77,plain,
( lhs_atom17(X1,X2,X3)
| X1 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_78,plain,
( lhs_atom17(X1,X2,X3)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_79,plain,
( lhs_atom21(X1,X2)
| member(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_80,plain,
( lhs_atom18(X1,X2)
| member(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_81,plain,
( lhs_atom18(X1,X2)
| member(X1,esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_82,plain,
( lhs_atom2(X1,X2)
| member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_83,plain,
( member(X1,X2)
| lhs_atom20(X1,X3)
| ~ member(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_84,plain,
( member(X1,X2)
| lhs_atom1(X2,X3)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_85,plain,
( lhs_atom6(X1,X2)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_86,plain,
( subset(X1,X2)
| lhs_atom5(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_87,plain,
( lhs_atom3(X1,X2)
| subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_88,plain,
( lhs_atom3(X1,X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_89,plain,
( lhs_atom15(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_90,plain,
( X1 = X2
| lhs_atom14(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_91,plain,
lhs_atom11(X1),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_92,plain,
( lhs_atom8(X1,X2,X3)
| ~ member(X1,X2)
| ~ member(X1,X3) ),
c_0_63,
[final] ).
cnf(c_0_93,plain,
( member(X1,X2)
| lhs_atom13(X3,X1,X2)
| ~ member(X1,X3) ),
c_0_64,
[final] ).
cnf(c_0_94,plain,
( member(X1,X2)
| member(X1,X3)
| lhs_atom9(X1,X2,X3) ),
c_0_65,
[final] ).
cnf(c_0_95,plain,
( lhs_atom21(X1,X2)
| ~ member(X1,esk3_2(X1,X2)) ),
c_0_66,
[final] ).
cnf(c_0_96,plain,
( lhs_atom2(X1,X2)
| ~ member(esk1_2(X1,X2),X1) ),
c_0_67,
[final] ).
cnf(c_0_97,plain,
( lhs_atom12(X1,X2,X3)
| ~ member(X2,X3) ),
c_0_68,
[final] ).
cnf(c_0_98,plain,
( lhs_atom10(X1,X2,X3)
| ~ member(X1,X3) ),
c_0_69,
[final] ).
cnf(c_0_99,plain,
( lhs_atom10(X1,X2,X3)
| ~ member(X1,X2) ),
c_0_70,
[final] ).
cnf(c_0_100,plain,
( lhs_atom12(X1,X2,X3)
| member(X2,X1) ),
c_0_71,
[final] ).
cnf(c_0_101,plain,
( lhs_atom7(X1,X2,X3)
| member(X1,X3) ),
c_0_72,
[final] ).
cnf(c_0_102,plain,
( lhs_atom7(X1,X2,X3)
| member(X1,X2) ),
c_0_73,
[final] ).
cnf(c_0_103,plain,
( lhs_atom19(X1,X3)
| ~ member(X1,X2)
| ~ member(X2,X3) ),
c_0_74,
[final] ).
cnf(c_0_104,plain,
( lhs_atom4(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
c_0_75,
[final] ).
cnf(c_0_105,plain,
( X1 = X2
| X1 = X3
| lhs_atom16(X1,X2,X3) ),
c_0_76,
[final] ).
cnf(c_0_106,plain,
( lhs_atom17(X1,X2,X3)
| X1 != X3 ),
c_0_77,
[final] ).
cnf(c_0_107,plain,
( lhs_atom17(X1,X2,X3)
| X1 != X2 ),
c_0_78,
[final] ).
cnf(c_0_108,plain,
( lhs_atom21(X1,X2)
| member(esk3_2(X1,X2),X2) ),
c_0_79,
[final] ).
cnf(c_0_109,plain,
( lhs_atom18(X1,X2)
| member(esk2_2(X1,X2),X2) ),
c_0_80,
[final] ).
cnf(c_0_110,plain,
( lhs_atom18(X1,X2)
| member(X1,esk2_2(X1,X2)) ),
c_0_81,
[final] ).
cnf(c_0_111,plain,
( lhs_atom2(X1,X2)
| member(esk1_2(X1,X2),X2) ),
c_0_82,
[final] ).
cnf(c_0_112,plain,
( member(X1,X2)
| lhs_atom20(X1,X3)
| ~ member(X2,X3) ),
c_0_83,
[final] ).
cnf(c_0_113,plain,
( member(X1,X2)
| lhs_atom1(X2,X3)
| ~ member(X1,X3) ),
c_0_84,
[final] ).
cnf(c_0_114,plain,
( lhs_atom6(X1,X2)
| ~ subset(X1,X2) ),
c_0_85,
[final] ).
cnf(c_0_115,plain,
( subset(X1,X2)
| lhs_atom5(X1,X2) ),
c_0_86,
[final] ).
cnf(c_0_116,plain,
( lhs_atom3(X1,X2)
| subset(X2,X1) ),
c_0_87,
[final] ).
cnf(c_0_117,plain,
( lhs_atom3(X1,X2)
| subset(X1,X2) ),
c_0_88,
[final] ).
cnf(c_0_118,plain,
( lhs_atom15(X1,X2)
| X1 != X2 ),
c_0_89,
[final] ).
cnf(c_0_119,plain,
( X1 = X2
| lhs_atom14(X1,X2) ),
c_0_90,
[final] ).
cnf(c_0_120,plain,
lhs_atom11(X1),
c_0_91,
[final] ).
% End CNF derivation
cnf(c_0_92_0,axiom,
( member(X1,intersection(X3,X2))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(unfold_definition,[status(thm)],[c_0_92,def_lhs_atom8]) ).
cnf(c_0_93_0,axiom,
( member(X1,difference(X3,X2))
| member(X1,X2)
| ~ member(X1,X3) ),
inference(unfold_definition,[status(thm)],[c_0_93,def_lhs_atom13]) ).
cnf(c_0_94_0,axiom,
( ~ member(X1,union(X3,X2))
| member(X1,X2)
| member(X1,X3) ),
inference(unfold_definition,[status(thm)],[c_0_94,def_lhs_atom9]) ).
cnf(c_0_95_0,axiom,
( member(X1,product(X2))
| ~ member(X1,sk1_esk3_2(X1,X2)) ),
inference(unfold_definition,[status(thm)],[c_0_95,def_lhs_atom21]) ).
cnf(c_0_96_0,axiom,
( subset(X2,X1)
| ~ member(sk1_esk1_2(X1,X2),X1) ),
inference(unfold_definition,[status(thm)],[c_0_96,def_lhs_atom2]) ).
cnf(c_0_97_0,axiom,
( ~ member(X2,difference(X1,X3))
| ~ member(X2,X3) ),
inference(unfold_definition,[status(thm)],[c_0_97,def_lhs_atom12]) ).
cnf(c_0_98_0,axiom,
( member(X1,union(X3,X2))
| ~ member(X1,X3) ),
inference(unfold_definition,[status(thm)],[c_0_98,def_lhs_atom10]) ).
cnf(c_0_99_0,axiom,
( member(X1,union(X3,X2))
| ~ member(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_99,def_lhs_atom10]) ).
cnf(c_0_100_0,axiom,
( ~ member(X2,difference(X1,X3))
| member(X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_100,def_lhs_atom12]) ).
cnf(c_0_101_0,axiom,
( ~ member(X1,intersection(X3,X2))
| member(X1,X3) ),
inference(unfold_definition,[status(thm)],[c_0_101,def_lhs_atom7]) ).
cnf(c_0_102_0,axiom,
( ~ member(X1,intersection(X3,X2))
| member(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_102,def_lhs_atom7]) ).
cnf(c_0_103_0,axiom,
( member(X1,sum(X3))
| ~ member(X1,X2)
| ~ member(X2,X3) ),
inference(unfold_definition,[status(thm)],[c_0_103,def_lhs_atom19]) ).
cnf(c_0_104_0,axiom,
( equal_set(X2,X1)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_104,def_lhs_atom4]) ).
cnf(c_0_105_0,axiom,
( ~ member(X1,unordered_pair(X3,X2))
| X1 = X2
| X1 = X3 ),
inference(unfold_definition,[status(thm)],[c_0_105,def_lhs_atom16]) ).
cnf(c_0_106_0,axiom,
( member(X1,unordered_pair(X3,X2))
| X1 != X3 ),
inference(unfold_definition,[status(thm)],[c_0_106,def_lhs_atom17]) ).
cnf(c_0_107_0,axiom,
( member(X1,unordered_pair(X3,X2))
| X1 != X2 ),
inference(unfold_definition,[status(thm)],[c_0_107,def_lhs_atom17]) ).
cnf(c_0_108_0,axiom,
( member(X1,product(X2))
| member(sk1_esk3_2(X1,X2),X2) ),
inference(unfold_definition,[status(thm)],[c_0_108,def_lhs_atom21]) ).
cnf(c_0_109_0,axiom,
( ~ member(X1,sum(X2))
| member(sk1_esk2_2(X1,X2),X2) ),
inference(unfold_definition,[status(thm)],[c_0_109,def_lhs_atom18]) ).
cnf(c_0_110_0,axiom,
( ~ member(X1,sum(X2))
| member(X1,sk1_esk2_2(X1,X2)) ),
inference(unfold_definition,[status(thm)],[c_0_110,def_lhs_atom18]) ).
cnf(c_0_111_0,axiom,
( subset(X2,X1)
| member(sk1_esk1_2(X1,X2),X2) ),
inference(unfold_definition,[status(thm)],[c_0_111,def_lhs_atom2]) ).
cnf(c_0_112_0,axiom,
( ~ member(X1,product(X3))
| member(X1,X2)
| ~ member(X2,X3) ),
inference(unfold_definition,[status(thm)],[c_0_112,def_lhs_atom20]) ).
cnf(c_0_113_0,axiom,
( ~ subset(X3,X2)
| member(X1,X2)
| ~ member(X1,X3) ),
inference(unfold_definition,[status(thm)],[c_0_113,def_lhs_atom1]) ).
cnf(c_0_114_0,axiom,
( member(X1,power_set(X2))
| ~ subset(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_114,def_lhs_atom6]) ).
cnf(c_0_115_0,axiom,
( ~ member(X1,power_set(X2))
| subset(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_115,def_lhs_atom5]) ).
cnf(c_0_116_0,axiom,
( ~ equal_set(X2,X1)
| subset(X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_116,def_lhs_atom3]) ).
cnf(c_0_117_0,axiom,
( ~ equal_set(X2,X1)
| subset(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_117,def_lhs_atom3]) ).
cnf(c_0_118_0,axiom,
( member(X1,singleton(X2))
| X1 != X2 ),
inference(unfold_definition,[status(thm)],[c_0_118,def_lhs_atom15]) ).
cnf(c_0_119_0,axiom,
( ~ member(X1,singleton(X2))
| X1 = X2 ),
inference(unfold_definition,[status(thm)],[c_0_119,def_lhs_atom14]) ).
cnf(c_0_120_0,axiom,
~ member(X1,empty_set),
inference(unfold_definition,[status(thm)],[c_0_120,def_lhs_atom11]) ).
% 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] : equal_set(intersection(X1,X1),X1),
file('<stdin>',thI13) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1] : equal_set(intersection(X1,X1),X1),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
~ equal_set(intersection(esk1_0,esk1_0),esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
cnf(c_0_3_004,negated_conjecture,
~ equal_set(intersection(esk1_0,esk1_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
~ equal_set(intersection(esk1_0,esk1_0),esk1_0),
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_29,negated_conjecture,
~ equal_set(intersection(sk3_esk1_0,sk3_esk1_0),sk3_esk1_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_b7ee33.p',c_0_4) ).
cnf(c_52,negated_conjecture,
~ equal_set(intersection(sk3_esk1_0,sk3_esk1_0),sk3_esk1_0),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_56,negated_conjecture,
~ equal_set(intersection(sk3_esk1_0,sk3_esk1_0),sk3_esk1_0),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_57,negated_conjecture,
~ equal_set(intersection(sk3_esk1_0,sk3_esk1_0),sk3_esk1_0),
inference(copy,[status(esa)],[c_56]) ).
cnf(c_58,negated_conjecture,
~ equal_set(intersection(sk3_esk1_0,sk3_esk1_0),sk3_esk1_0),
inference(copy,[status(esa)],[c_57]) ).
cnf(c_147,negated_conjecture,
~ equal_set(intersection(sk3_esk1_0,sk3_esk1_0),sk3_esk1_0),
inference(copy,[status(esa)],[c_58]) ).
cnf(c_16,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| equal_set(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b7ee33.p',c_0_104_0) ).
cnf(c_121,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| equal_set(X0,X1) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_122,plain,
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(rewriting,[status(thm)],[c_121]) ).
cnf(c_151,plain,
( ~ subset(intersection(sk3_esk1_0,sk3_esk1_0),sk3_esk1_0)
| ~ subset(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk1_0)) ),
inference(resolution,[status(thm)],[c_147,c_122]) ).
cnf(c_152,plain,
( ~ subset(intersection(sk3_esk1_0,sk3_esk1_0),sk3_esk1_0)
| ~ subset(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk1_0)) ),
inference(rewriting,[status(thm)],[c_151]) ).
cnf(c_9,plain,
( member(sk1_esk1_2(X0,X1),X1)
| subset(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b7ee33.p',c_0_111_0) ).
cnf(c_107,plain,
( member(sk1_esk1_2(X0,X1),X1)
| subset(X1,X0) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_158,plain,
( member(sk1_esk1_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk1_0)),intersection(sk3_esk1_0,sk3_esk1_0))
| ~ subset(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk1_0)) ),
inference(resolution,[status(thm)],[c_152,c_107]) ).
cnf(c_159,plain,
( member(sk1_esk1_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk1_0)),intersection(sk3_esk1_0,sk3_esk1_0))
| ~ subset(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk1_0)) ),
inference(rewriting,[status(thm)],[c_158]) ).
cnf(c_19,plain,
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b7ee33.p',c_0_101_0) ).
cnf(c_127,plain,
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_128,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(rewriting,[status(thm)],[c_127]) ).
cnf(c_171,plain,
( member(sk1_esk1_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk1_0)),sk3_esk1_0)
| ~ subset(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk1_0)) ),
inference(resolution,[status(thm)],[c_159,c_128]) ).
cnf(c_172,plain,
( member(sk1_esk1_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk1_0)),sk3_esk1_0)
| ~ subset(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk1_0)) ),
inference(rewriting,[status(thm)],[c_171]) ).
cnf(c_24,plain,
( ~ member(sk1_esk1_2(X0,X1),X0)
| subset(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b7ee33.p',c_0_96_0) ).
cnf(c_137,plain,
( ~ member(sk1_esk1_2(X0,X1),X0)
| subset(X1,X0) ),
inference(copy,[status(esa)],[c_24]) ).
cnf(c_157,plain,
( ~ member(sk1_esk1_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk1_0)),sk3_esk1_0)
| ~ subset(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk1_0)) ),
inference(resolution,[status(thm)],[c_152,c_137]) ).
cnf(c_160,plain,
( ~ member(sk1_esk1_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk1_0)),sk3_esk1_0)
| ~ subset(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk1_0)) ),
inference(rewriting,[status(thm)],[c_157]) ).
cnf(c_175,plain,
~ subset(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk1_0)),
inference(forward_subsumption_resolution,[status(thm)],[c_172,c_160]) ).
cnf(c_176,plain,
~ subset(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk1_0)),
inference(rewriting,[status(thm)],[c_175]) ).
cnf(c_178,plain,
~ member(sk1_esk1_2(intersection(sk3_esk1_0,sk3_esk1_0),sk3_esk1_0),intersection(sk3_esk1_0,sk3_esk1_0)),
inference(resolution,[status(thm)],[c_176,c_137]) ).
cnf(c_181,plain,
~ member(sk1_esk1_2(intersection(sk3_esk1_0,sk3_esk1_0),sk3_esk1_0),intersection(sk3_esk1_0,sk3_esk1_0)),
inference(rewriting,[status(thm)],[c_178]) ).
cnf(c_28,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| member(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b7ee33.p',c_0_92_0) ).
cnf(c_145,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| member(X0,intersection(X1,X2)) ),
inference(copy,[status(esa)],[c_28]) ).
cnf(c_146,plain,
( member(X0,intersection(X1,X2))
| ~ member(X0,X1)
| ~ member(X0,X2) ),
inference(rewriting,[status(thm)],[c_145]) ).
cnf(c_186,plain,
~ member(sk1_esk1_2(intersection(sk3_esk1_0,sk3_esk1_0),sk3_esk1_0),sk3_esk1_0),
inference(resolution,[status(thm)],[c_181,c_146]) ).
cnf(c_187,plain,
~ member(sk1_esk1_2(intersection(sk3_esk1_0,sk3_esk1_0),sk3_esk1_0),sk3_esk1_0),
inference(rewriting,[status(thm)],[c_186]) ).
cnf(c_179,plain,
member(sk1_esk1_2(intersection(sk3_esk1_0,sk3_esk1_0),sk3_esk1_0),sk3_esk1_0),
inference(resolution,[status(thm)],[c_176,c_107]) ).
cnf(c_180,plain,
member(sk1_esk1_2(intersection(sk3_esk1_0,sk3_esk1_0),sk3_esk1_0),sk3_esk1_0),
inference(rewriting,[status(thm)],[c_179]) ).
cnf(c_189,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_187,c_180]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET148+4 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 04:20:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.12/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.39 % FOF problem with conjecture
% 0.12/0.39 % 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_dddb11.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_b7ee33.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_a265dc | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.42 % --inst_prop_sim_new false
% 0.20/0.42 % --inst_orphan_elimination true
% 0.20/0.42 % --inst_learning_loop_flag true
% 0.20/0.42 % --inst_learning_start 3000
% 0.20/0.42 % --inst_learning_factor 2
% 0.20/0.42 % --inst_start_prop_sim_after_learn 3
% 0.20/0.42 % --inst_sel_renew solver
% 0.20/0.42 % --inst_lit_activity_flag true
% 0.20/0.42 % --inst_out_proof true
% 0.20/0.42
% 0.20/0.42 % ------ Resolution Options
% 0.20/0.42
% 0.20/0.42 % --resolution_flag true
% 0.20/0.42 % --res_lit_sel kbo_max
% 0.20/0.42 % --res_to_prop_solver none
% 0.20/0.42 % --res_prop_simpl_new false
% 0.20/0.42 % --res_prop_simpl_given false
% 0.20/0.42 % --res_passive_queue_type priority_queues
% 0.20/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.42 % --res_passive_queues_freq [15;5]
% 0.20/0.42 % --res_forward_subs full
% 0.20/0.42 % --res_backward_subs full
% 0.20/0.42 % --res_forward_subs_resolution true
% 0.20/0.42 % --res_backward_subs_resolution true
% 0.20/0.42 % --res_orphan_elimination false
% 0.20/0.42 % --res_time_limit 1000.
% 0.20/0.42 % --res_out_proof true
% 0.20/0.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_dddb11.s
% 0.20/0.42 % --modulo true
% 0.20/0.42
% 0.20/0.42 % ------ Combination Options
% 0.20/0.42
% 0.20/0.42 % --comb_res_mult 1000
% 0.20/0.42 % --comb_inst_mult 300
% 0.20/0.42 % ------
% 0.20/0.42
% 0.20/0.42 % ------ Parsing...% successful
% 0.20/0.42
% 0.20/0.42 % ------ 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.42
% 0.20/0.42 % ------ Proving...
% 0.20/0.42 % ------ Problem Properties
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % EPR false
% 0.20/0.42 % Horn false
% 0.20/0.42 % Has equality true
% 0.20/0.42
% 0.20/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 % % ------ Current options:
% 0.20/0.42
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --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_dddb11.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
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 %
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % Resolution empty clause
% 0.20/0.43
% 0.20/0.43 % ------ Statistics
% 0.20/0.43
% 0.20/0.43 % ------ General
% 0.20/0.43
% 0.20/0.43 % num_of_input_clauses: 30
% 0.20/0.43 % num_of_input_neg_conjectures: 1
% 0.20/0.43 % num_of_splits: 0
% 0.20/0.43 % num_of_split_atoms: 0
% 0.20/0.43 % num_of_sem_filtered_clauses: 0
% 0.20/0.43 % num_of_subtypes: 0
% 0.20/0.43 % monotx_restored_types: 0
% 0.20/0.43 % sat_num_of_epr_types: 0
% 0.20/0.43 % sat_num_of_non_cyclic_types: 0
% 0.20/0.43 % sat_guarded_non_collapsed_types: 0
% 0.20/0.43 % is_epr: 0
% 0.20/0.43 % is_horn: 0
% 0.20/0.43 % has_eq: 1
% 0.20/0.43 % num_pure_diseq_elim: 0
% 0.20/0.43 % simp_replaced_by: 0
% 0.20/0.43 % res_preprocessed: 2
% 0.20/0.43 % prep_upred: 0
% 0.20/0.43 % prep_unflattend: 0
% 0.20/0.43 % pred_elim_cands: 0
% 0.20/0.43 % pred_elim: 0
% 0.20/0.43 % pred_elim_cl: 0
% 0.20/0.43 % pred_elim_cycles: 0
% 0.20/0.43 % forced_gc_time: 0
% 0.20/0.43 % gc_basic_clause_elim: 0
% 0.20/0.43 % parsing_time: 0.001
% 0.20/0.43 % sem_filter_time: 0.
% 0.20/0.43 % pred_elim_time: 0.
% 0.20/0.43 % out_proof_time: 0.001
% 0.20/0.43 % monotx_time: 0.
% 0.20/0.43 % subtype_inf_time: 0.
% 0.20/0.43 % unif_index_cands_time: 0.
% 0.20/0.43 % unif_index_add_time: 0.
% 0.20/0.43 % total_time: 0.025
% 0.20/0.43 % num_of_symbols: 41
% 0.20/0.43 % num_of_terms: 157
% 0.20/0.43
% 0.20/0.43 % ------ Propositional Solver
% 0.20/0.43
% 0.20/0.43 % prop_solver_calls: 1
% 0.20/0.43 % prop_fast_solver_calls: 3
% 0.20/0.43 % prop_num_of_clauses: 52
% 0.20/0.43 % prop_preprocess_simplified: 74
% 0.20/0.43 % prop_fo_subsumed: 0
% 0.20/0.43 % prop_solver_time: 0.
% 0.20/0.43 % prop_fast_solver_time: 0.
% 0.20/0.43 % prop_unsat_core_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ QBF
% 0.20/0.43
% 0.20/0.43 % qbf_q_res: 0
% 0.20/0.43 % qbf_num_tautologies: 0
% 0.20/0.43 % qbf_prep_cycles: 0
% 0.20/0.43
% 0.20/0.43 % ------ BMC1
% 0.20/0.43
% 0.20/0.43 % bmc1_current_bound: -1
% 0.20/0.43 % bmc1_last_solved_bound: -1
% 0.20/0.43 % bmc1_unsat_core_size: -1
% 0.20/0.43 % bmc1_unsat_core_parents_size: -1
% 0.20/0.43 % bmc1_merge_next_fun: 0
% 0.20/0.43 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation
% 0.20/0.43
% 0.20/0.43 % inst_num_of_clauses: 30
% 0.20/0.43 % inst_num_in_passive: 0
% 0.20/0.43 % inst_num_in_active: 0
% 0.20/0.43 % inst_num_in_unprocessed: 30
% 0.20/0.43 % inst_num_of_loops: 0
% 0.20/0.43 % inst_num_of_learning_restarts: 0
% 0.20/0.43 % inst_num_moves_active_passive: 0
% 0.20/0.43 % inst_lit_activity: 0
% 0.20/0.43 % inst_lit_activity_moves: 0
% 0.20/0.43 % inst_num_tautologies: 0
% 0.20/0.43 % inst_num_prop_implied: 0
% 0.20/0.43 % inst_num_existing_simplified: 0
% 0.20/0.43 % inst_num_eq_res_simplified: 0
% 0.20/0.43 % inst_num_child_elim: 0
% 0.20/0.43 % inst_num_of_dismatching_blockings: 0
% 0.20/0.43 % inst_num_of_non_proper_insts: 0
% 0.20/0.43 % inst_num_of_duplicates: 0
% 0.20/0.43 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.43 % inst_dismatching_checking_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Resolution
% 0.20/0.43
% 0.20/0.43 % res_num_of_clauses: 58
% 0.20/0.43 % res_num_in_passive: 1
% 0.20/0.43 % res_num_in_active: 33
% 0.20/0.43 % res_num_of_loops: 8
% 0.20/0.43 % res_forward_subset_subsumed: 0
% 0.20/0.43 % res_backward_subset_subsumed: 0
% 0.20/0.43 % res_forward_subsumed: 0
% 0.20/0.43 % res_backward_subsumed: 3
% 0.20/0.43 % res_forward_subsumption_resolution: 2
% 0.20/0.43 % res_backward_subsumption_resolution: 0
% 0.20/0.43 % res_clause_to_clause_subsumption: 7
% 0.20/0.43 % res_orphan_elimination: 0
% 0.20/0.43 % res_tautology_del: 0
% 0.20/0.43 % res_num_eq_res_simplified: 0
% 0.20/0.43 % res_num_sel_changes: 0
% 0.20/0.43 % res_moves_from_active_to_pass: 0
% 0.20/0.43
% 0.20/0.43 % Status Unsatisfiable
% 0.20/0.43 % SZS status Theorem
% 0.20/0.43 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------