TSTP Solution File: SET013-2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET013-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 02:08:23 EDT 2022
% Result : Unsatisfiable 174.38s 174.60s
% Output : CNFRefutation 174.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 40
% Syntax : Number of formulae : 234 ( 37 unt; 0 def)
% Number of atoms : 504 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 533 ( 263 ~; 270 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 445 ( 31 sgn 144 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X6,X5,X1] :
( ~ member(X1,union(X5,X6))
| member(X1,X5)
| member(X1,X6) ),
file('<stdin>',member_of_union_is_member_of_one_set) ).
fof(c_0_1,axiom,
! [X6,X5,X1] :
( ~ member(X1,X5)
| ~ member(X1,X6)
| member(X1,intersection(X5,X6)) ),
file('<stdin>',member_of_both_is_member_of_intersection) ).
fof(c_0_2,axiom,
! [X6,X5,X1] :
( ~ member(X1,intersection(X5,X6))
| member(X1,X6) ),
file('<stdin>',member_of_intersection_is_member_of_set2) ).
fof(c_0_3,axiom,
! [X6,X5,X1] :
( ~ member(X1,intersection(X5,X6))
| member(X1,X5) ),
file('<stdin>',member_of_intersection_is_member_of_set1) ).
fof(c_0_4,axiom,
! [X2,X3] :
( ~ member(member_of_1_not_of_2(X3,X2),X2)
| subset(X3,X2) ),
file('<stdin>',subsets_axiom2) ).
fof(c_0_5,axiom,
! [X6,X5,X1] :
( ~ member(X1,X6)
| member(X1,union(X5,X6)) ),
file('<stdin>',member_of_set2_is_member_of_union) ).
fof(c_0_6,axiom,
! [X6,X5,X1] :
( ~ member(X1,X5)
| member(X1,union(X5,X6)) ),
file('<stdin>',member_of_set1_is_member_of_union) ).
fof(c_0_7,axiom,
! [X11,X10,X1] :
( ~ equal_elements(X1,X10)
| ~ equal_elements(X10,X11)
| equal_elements(X1,X11) ),
file('<stdin>',transitivity_for_equal_elements) ).
fof(c_0_8,axiom,
! [X9,X6,X5] :
( ~ equal_sets(X5,X6)
| ~ equal_sets(X6,X9)
| equal_sets(X5,X9) ),
file('<stdin>',transitivity_for_set_equal) ).
fof(c_0_9,axiom,
! [X7,X8] :
( ~ subset(X8,X7)
| ~ subset(X7,X8)
| equal_sets(X7,X8) ),
file('<stdin>',subsets_are_set_equal_sets) ).
fof(c_0_10,axiom,
! [X2,X3,X4] :
( ~ member(X4,X3)
| ~ subset(X3,X2)
| member(X4,X2) ),
file('<stdin>',membership_in_subsets) ).
fof(c_0_11,axiom,
! [X5,X1] :
( ~ member(X1,X5)
| ~ member(X1,complement(X5)) ),
file('<stdin>',not_member_of_set_and_complement) ).
fof(c_0_12,axiom,
! [X2,X3] :
( subset(X3,X2)
| member(member_of_1_not_of_2(X3,X2),X3) ),
file('<stdin>',subsets_axiom1) ).
fof(c_0_13,axiom,
! [X10,X1] :
( ~ equal_elements(X1,X10)
| equal_elements(X10,X1) ),
file('<stdin>',symmetry_for_equal_elements) ).
fof(c_0_14,axiom,
! [X6,X5] :
( ~ equal_sets(X5,X6)
| equal_sets(X6,X5) ),
file('<stdin>',symmetry_for_set_equal) ).
fof(c_0_15,axiom,
! [X2,X3] :
( ~ equal_sets(X2,X3)
| subset(X3,X2) ),
file('<stdin>',set_equal_sets_are_subsets2) ).
fof(c_0_16,axiom,
! [X2,X3] :
( ~ equal_sets(X3,X2)
| subset(X3,X2) ),
file('<stdin>',set_equal_sets_are_subsets1) ).
fof(c_0_17,axiom,
! [X5,X1] :
( member(X1,X5)
| member(X1,complement(X5)) ),
file('<stdin>',member_of_set_or_complement) ).
fof(c_0_18,axiom,
! [X1] : ~ member(X1,empty_set),
file('<stdin>',empty_set) ).
fof(c_0_19,axiom,
! [X1] : equal_elements(X1,X1),
file('<stdin>',reflexivity_for_equal_elements) ).
fof(c_0_20,axiom,
! [X5] : equal_sets(X5,X5),
file('<stdin>',reflexivity_for_set_equal) ).
fof(c_0_21,plain,
! [X6,X5,X1] :
( ~ member(X1,union(X5,X6))
| member(X1,X5)
| member(X1,X6) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_22,plain,
! [X6,X5,X1] :
( ~ member(X1,X5)
| ~ member(X1,X6)
| member(X1,intersection(X5,X6)) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_23,plain,
! [X6,X5,X1] :
( ~ member(X1,intersection(X5,X6))
| member(X1,X6) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_24,plain,
! [X6,X5,X1] :
( ~ member(X1,intersection(X5,X6))
| member(X1,X5) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_25,plain,
! [X2,X3] :
( ~ member(member_of_1_not_of_2(X3,X2),X2)
| subset(X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_26,plain,
! [X6,X5,X1] :
( ~ member(X1,X6)
| member(X1,union(X5,X6)) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_27,plain,
! [X6,X5,X1] :
( ~ member(X1,X5)
| member(X1,union(X5,X6)) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_28,plain,
! [X11,X10,X1] :
( ~ equal_elements(X1,X10)
| ~ equal_elements(X10,X11)
| equal_elements(X1,X11) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_29,plain,
! [X9,X6,X5] :
( ~ equal_sets(X5,X6)
| ~ equal_sets(X6,X9)
| equal_sets(X5,X9) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_30,plain,
! [X7,X8] :
( ~ subset(X8,X7)
| ~ subset(X7,X8)
| equal_sets(X7,X8) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_31,plain,
! [X2,X3,X4] :
( ~ member(X4,X3)
| ~ subset(X3,X2)
| member(X4,X2) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_32,plain,
! [X5,X1] :
( ~ member(X1,X5)
| ~ member(X1,complement(X5)) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_33,axiom,
! [X2,X3] :
( subset(X3,X2)
| member(member_of_1_not_of_2(X3,X2),X3) ),
c_0_12 ).
fof(c_0_34,plain,
! [X10,X1] :
( ~ equal_elements(X1,X10)
| equal_elements(X10,X1) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_35,plain,
! [X6,X5] :
( ~ equal_sets(X5,X6)
| equal_sets(X6,X5) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_36,plain,
! [X2,X3] :
( ~ equal_sets(X2,X3)
| subset(X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_37,plain,
! [X2,X3] :
( ~ equal_sets(X3,X2)
| subset(X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_38,axiom,
! [X5,X1] :
( member(X1,X5)
| member(X1,complement(X5)) ),
c_0_17 ).
fof(c_0_39,plain,
! [X1] : ~ member(X1,empty_set),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_40,axiom,
! [X1] : equal_elements(X1,X1),
c_0_19 ).
fof(c_0_41,axiom,
! [X5] : equal_sets(X5,X5),
c_0_20 ).
fof(c_0_42,plain,
! [X7,X8,X9] :
( ~ member(X9,union(X8,X7))
| member(X9,X8)
| member(X9,X7) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_43,plain,
! [X7,X8,X9] :
( ~ member(X9,X8)
| ~ member(X9,X7)
| member(X9,intersection(X8,X7)) ),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_44,plain,
! [X7,X8,X9] :
( ~ member(X9,intersection(X8,X7))
| member(X9,X7) ),
inference(variable_rename,[status(thm)],[c_0_23]) ).
fof(c_0_45,plain,
! [X7,X8,X9] :
( ~ member(X9,intersection(X8,X7))
| member(X9,X8) ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_46,plain,
! [X4,X5] :
( ~ member(member_of_1_not_of_2(X5,X4),X4)
| subset(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_47,plain,
! [X7,X8,X9] :
( ~ member(X9,X7)
| member(X9,union(X8,X7)) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_48,plain,
! [X7,X8,X9] :
( ~ member(X9,X8)
| member(X9,union(X8,X7)) ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_49,plain,
! [X12,X13,X14] :
( ~ equal_elements(X14,X13)
| ~ equal_elements(X13,X12)
| equal_elements(X14,X12) ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_50,plain,
! [X10,X11,X12] :
( ~ equal_sets(X12,X11)
| ~ equal_sets(X11,X10)
| equal_sets(X12,X10) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_51,plain,
! [X9,X10] :
( ~ subset(X10,X9)
| ~ subset(X9,X10)
| equal_sets(X9,X10) ),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_52,plain,
! [X5,X6,X7] :
( ~ member(X7,X6)
| ~ subset(X6,X5)
| member(X7,X5) ),
inference(variable_rename,[status(thm)],[c_0_31]) ).
fof(c_0_53,plain,
! [X6,X7] :
( ~ member(X7,X6)
| ~ member(X7,complement(X6)) ),
inference(variable_rename,[status(thm)],[c_0_32]) ).
fof(c_0_54,plain,
! [X4,X5] :
( subset(X5,X4)
| member(member_of_1_not_of_2(X5,X4),X5) ),
inference(variable_rename,[status(thm)],[c_0_33]) ).
fof(c_0_55,plain,
! [X11,X12] :
( ~ equal_elements(X12,X11)
| equal_elements(X11,X12) ),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_56,plain,
! [X7,X8] :
( ~ equal_sets(X8,X7)
| equal_sets(X7,X8) ),
inference(variable_rename,[status(thm)],[c_0_35]) ).
fof(c_0_57,plain,
! [X4,X5] :
( ~ equal_sets(X4,X5)
| subset(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_36]) ).
fof(c_0_58,plain,
! [X4,X5] :
( ~ equal_sets(X5,X4)
| subset(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_37]) ).
fof(c_0_59,plain,
! [X6,X7] :
( member(X7,X6)
| member(X7,complement(X6)) ),
inference(variable_rename,[status(thm)],[c_0_38]) ).
fof(c_0_60,plain,
! [X2] : ~ member(X2,empty_set),
inference(variable_rename,[status(thm)],[c_0_39]) ).
fof(c_0_61,plain,
! [X2] : equal_elements(X2,X2),
inference(variable_rename,[status(thm)],[c_0_40]) ).
fof(c_0_62,plain,
! [X6] : equal_sets(X6,X6),
inference(variable_rename,[status(thm)],[c_0_41]) ).
cnf(c_0_63,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_64,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_65,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_66,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_67,plain,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_68,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_69,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_70,plain,
( equal_elements(X1,X2)
| ~ equal_elements(X3,X2)
| ~ equal_elements(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_71,plain,
( equal_sets(X1,X2)
| ~ equal_sets(X3,X2)
| ~ equal_sets(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_72,plain,
( equal_sets(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_73,plain,
( member(X1,X2)
| ~ subset(X3,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_74,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_75,plain,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_76,plain,
( equal_elements(X1,X2)
| ~ equal_elements(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_77,plain,
( equal_sets(X1,X2)
| ~ equal_sets(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_78,plain,
( subset(X1,X2)
| ~ equal_sets(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_79,plain,
( subset(X1,X2)
| ~ equal_sets(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_80,plain,
( member(X1,complement(X2))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_81,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_82,plain,
equal_elements(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_83,plain,
equal_sets(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_84,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
c_0_63,
[final] ).
cnf(c_0_85,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
c_0_64,
[final] ).
cnf(c_0_86,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
c_0_65,
[final] ).
cnf(c_0_87,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_66,
[final] ).
cnf(c_0_88,plain,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
c_0_67,
[final] ).
cnf(c_0_89,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
c_0_68,
[final] ).
cnf(c_0_90,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
c_0_69,
[final] ).
cnf(c_0_91,plain,
( equal_elements(X1,X2)
| ~ equal_elements(X3,X2)
| ~ equal_elements(X1,X3) ),
c_0_70,
[final] ).
cnf(c_0_92,plain,
( equal_sets(X1,X2)
| ~ equal_sets(X3,X2)
| ~ equal_sets(X1,X3) ),
c_0_71,
[final] ).
cnf(c_0_93,plain,
( equal_sets(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
c_0_72,
[final] ).
cnf(c_0_94,plain,
( member(X1,X2)
| ~ subset(X3,X2)
| ~ member(X1,X3) ),
c_0_73,
[final] ).
cnf(c_0_95,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_74,
[final] ).
cnf(c_0_96,plain,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) ),
c_0_75,
[final] ).
cnf(c_0_97,plain,
( equal_elements(X1,X2)
| ~ equal_elements(X2,X1) ),
c_0_76,
[final] ).
cnf(c_0_98,plain,
( equal_sets(X1,X2)
| ~ equal_sets(X2,X1) ),
c_0_77,
[final] ).
cnf(c_0_99,plain,
( subset(X1,X2)
| ~ equal_sets(X2,X1) ),
c_0_78,
[final] ).
cnf(c_0_100,plain,
( subset(X1,X2)
| ~ equal_sets(X1,X2) ),
c_0_79,
[final] ).
cnf(c_0_101,plain,
( member(X1,complement(X2))
| member(X1,X2) ),
c_0_80,
[final] ).
cnf(c_0_102,plain,
~ member(X1,empty_set),
c_0_81,
[final] ).
cnf(c_0_103,plain,
equal_elements(X1,X1),
c_0_82,
[final] ).
cnf(c_0_104,plain,
equal_sets(X1,X1),
c_0_83,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_84_0,axiom,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_84]) ).
cnf(c_0_84_1,axiom,
( member(X1,X3)
| member(X1,X2)
| ~ member(X1,union(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_84]) ).
cnf(c_0_84_2,axiom,
( ~ member(X1,union(X3,X2))
| member(X1,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_84]) ).
cnf(c_0_85_0,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_85]) ).
cnf(c_0_85_1,axiom,
( ~ member(X1,X3)
| member(X1,intersection(X2,X3))
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_85]) ).
cnf(c_0_85_2,axiom,
( ~ member(X1,X2)
| ~ member(X1,X3)
| member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_85]) ).
cnf(c_0_86_0,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_86]) ).
cnf(c_0_86_1,axiom,
( ~ member(X1,intersection(X3,X2))
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_86]) ).
cnf(c_0_87_0,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_87]) ).
cnf(c_0_87_1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_87]) ).
cnf(c_0_88_0,axiom,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_88]) ).
cnf(c_0_88_1,axiom,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_88]) ).
cnf(c_0_89_0,axiom,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_89]) ).
cnf(c_0_89_1,axiom,
( ~ member(X1,X3)
| member(X1,union(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_89]) ).
cnf(c_0_90_0,axiom,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_90]) ).
cnf(c_0_90_1,axiom,
( ~ member(X1,X2)
| member(X1,union(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_90]) ).
cnf(c_0_91_0,axiom,
( equal_elements(X1,X2)
| ~ equal_elements(X3,X2)
| ~ equal_elements(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_91]) ).
cnf(c_0_91_1,axiom,
( ~ equal_elements(X3,X2)
| equal_elements(X1,X2)
| ~ equal_elements(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_91]) ).
cnf(c_0_91_2,axiom,
( ~ equal_elements(X1,X3)
| ~ equal_elements(X3,X2)
| equal_elements(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_91]) ).
cnf(c_0_92_0,axiom,
( equal_sets(X1,X2)
| ~ equal_sets(X3,X2)
| ~ equal_sets(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_92]) ).
cnf(c_0_92_1,axiom,
( ~ equal_sets(X3,X2)
| equal_sets(X1,X2)
| ~ equal_sets(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_92]) ).
cnf(c_0_92_2,axiom,
( ~ equal_sets(X1,X3)
| ~ equal_sets(X3,X2)
| equal_sets(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_92]) ).
cnf(c_0_93_0,axiom,
( equal_sets(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_93]) ).
cnf(c_0_93_1,axiom,
( ~ subset(X1,X2)
| equal_sets(X1,X2)
| ~ subset(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_93]) ).
cnf(c_0_93_2,axiom,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| equal_sets(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_93]) ).
cnf(c_0_94_0,axiom,
( member(X1,X2)
| ~ subset(X3,X2)
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_94]) ).
cnf(c_0_94_1,axiom,
( ~ subset(X3,X2)
| member(X1,X2)
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_94]) ).
cnf(c_0_94_2,axiom,
( ~ member(X1,X3)
| ~ subset(X3,X2)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_94]) ).
cnf(c_0_95_0,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_95]) ).
cnf(c_0_95_1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_95]) ).
cnf(c_0_96_0,axiom,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_96]) ).
cnf(c_0_96_1,axiom,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_96]) ).
cnf(c_0_97_0,axiom,
( equal_elements(X1,X2)
| ~ equal_elements(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_97]) ).
cnf(c_0_97_1,axiom,
( ~ equal_elements(X2,X1)
| equal_elements(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_97]) ).
cnf(c_0_98_0,axiom,
( equal_sets(X1,X2)
| ~ equal_sets(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_98]) ).
cnf(c_0_98_1,axiom,
( ~ equal_sets(X2,X1)
| equal_sets(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_98]) ).
cnf(c_0_99_0,axiom,
( subset(X1,X2)
| ~ equal_sets(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_99]) ).
cnf(c_0_99_1,axiom,
( ~ equal_sets(X2,X1)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_99]) ).
cnf(c_0_100_0,axiom,
( subset(X1,X2)
| ~ equal_sets(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_100]) ).
cnf(c_0_100_1,axiom,
( ~ equal_sets(X1,X2)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_100]) ).
cnf(c_0_101_0,axiom,
( member(X1,complement(X2))
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_101]) ).
cnf(c_0_101_1,axiom,
( member(X1,X2)
| member(X1,complement(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_101]) ).
cnf(c_0_102_0,axiom,
~ member(X1,empty_set),
inference(literals_permutation,[status(thm)],[c_0_102]) ).
cnf(c_0_103_0,axiom,
equal_elements(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_103]) ).
cnf(c_0_104_0,axiom,
equal_sets(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_104]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,hypothesis,
equal_sets(intersection(bs,as),ds),
file('<stdin>',intersection_of_b_and_a_is_d) ).
fof(c_0_1_002,hypothesis,
equal_sets(intersection(as,bs),cs),
file('<stdin>',intersection_of_a_and_b_is_c) ).
fof(c_0_2_003,negated_conjecture,
~ equal_sets(cs,ds),
file('<stdin>',prove_c_equals_d) ).
fof(c_0_3_004,hypothesis,
equal_sets(intersection(bs,as),ds),
c_0_0 ).
fof(c_0_4_005,hypothesis,
equal_sets(intersection(as,bs),cs),
c_0_1 ).
fof(c_0_5_006,negated_conjecture,
~ equal_sets(cs,ds),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_6_007,hypothesis,
equal_sets(intersection(bs,as),ds),
c_0_3 ).
fof(c_0_7_008,hypothesis,
equal_sets(intersection(as,bs),cs),
c_0_4 ).
fof(c_0_8_009,negated_conjecture,
~ equal_sets(cs,ds),
c_0_5 ).
cnf(c_0_9_010,hypothesis,
equal_sets(intersection(bs,as),ds),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10_011,hypothesis,
equal_sets(intersection(as,bs),cs),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11_012,negated_conjecture,
~ equal_sets(cs,ds),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12_013,hypothesis,
equal_sets(intersection(bs,as),ds),
c_0_9,
[final] ).
cnf(c_0_13_014,hypothesis,
equal_sets(intersection(as,bs),cs),
c_0_10,
[final] ).
cnf(c_0_14_015,negated_conjecture,
~ equal_sets(cs,ds),
c_0_11,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_36,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6b47fe.p',c_0_87_0) ).
cnf(c_204827,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(copy,[status(esa)],[c_36]) ).
cnf(c_205125,plain,
( ~ member(member_of_1_not_of_2(ds,cs),intersection(X0,X1))
| member(member_of_1_not_of_2(ds,cs),X0) ),
inference(instantiation,[status(thm)],[c_204827]) ).
cnf(c_279127,plain,
( ~ member(member_of_1_not_of_2(ds,cs),intersection(bs,as))
| member(member_of_1_not_of_2(ds,cs),bs) ),
inference(instantiation,[status(thm)],[c_205125]) ).
cnf(c_38,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6b47fe.p',c_0_86_0) ).
cnf(c_204829,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_205124,plain,
( ~ member(member_of_1_not_of_2(ds,cs),intersection(X0,X1))
| member(member_of_1_not_of_2(ds,cs),X1) ),
inference(instantiation,[status(thm)],[c_204829]) ).
cnf(c_279051,plain,
( ~ member(member_of_1_not_of_2(ds,cs),intersection(bs,as))
| member(member_of_1_not_of_2(ds,cs),as) ),
inference(instantiation,[status(thm)],[c_205124]) ).
cnf(c_41,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| member(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6b47fe.p',c_0_85_0) ).
cnf(c_204832,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| member(X0,intersection(X1,X2)) ),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_205108,plain,
( member(member_of_1_not_of_2(ds,cs),intersection(X0,X1))
| ~ member(member_of_1_not_of_2(ds,cs),X0)
| ~ member(member_of_1_not_of_2(ds,cs),X1) ),
inference(instantiation,[status(thm)],[c_204832]) ).
cnf(c_233895,plain,
( member(member_of_1_not_of_2(ds,cs),intersection(as,bs))
| ~ member(member_of_1_not_of_2(ds,cs),bs)
| ~ member(member_of_1_not_of_2(ds,cs),as) ),
inference(instantiation,[status(thm)],[c_205108]) ).
cnf(c_19,plain,
( ~ member(X0,X1)
| ~ subset(X1,X2)
| member(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6b47fe.p',c_0_94_0) ).
cnf(c_204810,plain,
( ~ member(X0,X1)
| ~ subset(X1,X2)
| member(X0,X2) ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_205110,plain,
( ~ member(member_of_1_not_of_2(ds,cs),X0)
| member(member_of_1_not_of_2(ds,cs),X1)
| ~ subset(X0,X1) ),
inference(instantiation,[status(thm)],[c_204810]) ).
cnf(c_206109,plain,
( member(member_of_1_not_of_2(ds,cs),cs)
| ~ member(member_of_1_not_of_2(ds,cs),X0)
| ~ subset(X0,cs) ),
inference(instantiation,[status(thm)],[c_205110]) ).
cnf(c_230548,plain,
( ~ member(member_of_1_not_of_2(ds,cs),intersection(as,bs))
| member(member_of_1_not_of_2(ds,cs),cs)
| ~ subset(intersection(as,bs),cs) ),
inference(instantiation,[status(thm)],[c_206109]) ).
cnf(c_39,plain,
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6b47fe.p',c_0_85_2) ).
cnf(c_117,plain,
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_27294,plain,
( member(member_of_1_not_of_2(cs,ds),intersection(X0,X1))
| ~ member(member_of_1_not_of_2(cs,ds),X1)
| ~ member(member_of_1_not_of_2(cs,ds),X0) ),
inference(instantiation,[status(thm)],[c_117]) ).
cnf(c_65844,plain,
( member(member_of_1_not_of_2(cs,ds),intersection(bs,as))
| ~ member(member_of_1_not_of_2(cs,ds),bs)
| ~ member(member_of_1_not_of_2(cs,ds),as) ),
inference(instantiation,[status(thm)],[c_27294]) ).
cnf(c_17,plain,
( member(X0,X1)
| ~ subset(X2,X1)
| ~ member(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6b47fe.p',c_0_94_2) ).
cnf(c_95,plain,
( member(X0,X1)
| ~ subset(X2,X1)
| ~ member(X0,X2) ),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_15263,plain,
( member(member_of_1_not_of_2(cs,ds),ds)
| ~ member(member_of_1_not_of_2(cs,ds),X0)
| ~ subset(X0,ds) ),
inference(instantiation,[status(thm)],[c_95]) ).
cnf(c_63468,plain,
( ~ member(member_of_1_not_of_2(cs,ds),intersection(bs,as))
| member(member_of_1_not_of_2(cs,ds),ds)
| ~ subset(intersection(bs,as),ds) ),
inference(instantiation,[status(thm)],[c_15263]) ).
cnf(c_97,plain,
( ~ member(X0,X1)
| ~ subset(X1,X2)
| member(X0,X2) ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_14486,plain,
( ~ member(member_of_1_not_of_2(ds,cs),ds)
| member(member_of_1_not_of_2(ds,cs),X0)
| ~ subset(ds,X0) ),
inference(instantiation,[status(thm)],[c_97]) ).
cnf(c_63076,plain,
( member(member_of_1_not_of_2(ds,cs),intersection(bs,as))
| ~ member(member_of_1_not_of_2(ds,cs),ds)
| ~ subset(ds,intersection(bs,as)) ),
inference(instantiation,[status(thm)],[c_14486]) ).
cnf(c_37,plain,
( member(X0,X1)
| ~ member(X0,intersection(X2,X1)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6b47fe.p',c_0_86_1) ).
cnf(c_115,plain,
( member(X0,X1)
| ~ member(X0,intersection(X2,X1)) ),
inference(copy,[status(esa)],[c_37]) ).
cnf(c_15191,plain,
( ~ member(member_of_1_not_of_2(cs,ds),intersection(X0,X1))
| member(member_of_1_not_of_2(cs,ds),X1) ),
inference(instantiation,[status(thm)],[c_115]) ).
cnf(c_43039,plain,
( ~ member(member_of_1_not_of_2(cs,ds),intersection(as,bs))
| member(member_of_1_not_of_2(cs,ds),bs) ),
inference(instantiation,[status(thm)],[c_15191]) ).
cnf(c_35,plain,
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6b47fe.p',c_0_87_1) ).
cnf(c_113,plain,
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(copy,[status(esa)],[c_35]) ).
cnf(c_15100,plain,
( ~ member(member_of_1_not_of_2(cs,ds),intersection(X0,X1))
| member(member_of_1_not_of_2(cs,ds),X0) ),
inference(instantiation,[status(thm)],[c_113]) ).
cnf(c_43021,plain,
( ~ member(member_of_1_not_of_2(cs,ds),intersection(as,bs))
| member(member_of_1_not_of_2(cs,ds),as) ),
inference(instantiation,[status(thm)],[c_15100]) ).
cnf(c_7,plain,
( subset(X0,X1)
| ~ equal_sets(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6b47fe.p',c_0_99_1) ).
cnf(c_85,plain,
( subset(X0,X1)
| ~ equal_sets(X1,X0) ),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_14260,plain,
( ~ equal_sets(cs,X0)
| subset(X0,cs) ),
inference(instantiation,[status(thm)],[c_85]) ).
cnf(c_28800,plain,
( ~ equal_sets(cs,intersection(as,bs))
| subset(intersection(as,bs),cs) ),
inference(instantiation,[status(thm)],[c_14260]) ).
cnf(c_14681,plain,
( ~ equal_sets(ds,X0)
| subset(X0,ds) ),
inference(instantiation,[status(thm)],[c_85]) ).
cnf(c_28218,plain,
( ~ equal_sets(ds,intersection(bs,as))
| subset(intersection(bs,as),ds) ),
inference(instantiation,[status(thm)],[c_14681]) ).
cnf(c_14281,plain,
( ~ equal_sets(X0,ds)
| subset(ds,X0) ),
inference(instantiation,[status(thm)],[c_85]) ).
cnf(c_27464,plain,
( ~ equal_sets(intersection(bs,as),ds)
| subset(ds,intersection(bs,as)) ),
inference(instantiation,[status(thm)],[c_14281]) ).
cnf(c_14297,plain,
( ~ member(member_of_1_not_of_2(cs,ds),cs)
| member(member_of_1_not_of_2(cs,ds),X0)
| ~ subset(cs,X0) ),
inference(instantiation,[status(thm)],[c_95]) ).
cnf(c_27335,plain,
( member(member_of_1_not_of_2(cs,ds),intersection(as,bs))
| ~ member(member_of_1_not_of_2(cs,ds),cs)
| ~ subset(cs,intersection(as,bs)) ),
inference(instantiation,[status(thm)],[c_14297]) ).
cnf(c_14131,plain,
( ~ equal_sets(X0,cs)
| subset(cs,X0) ),
inference(instantiation,[status(thm)],[c_85]) ).
cnf(c_14953,plain,
( ~ equal_sets(intersection(as,bs),cs)
| subset(cs,intersection(as,bs)) ),
inference(instantiation,[status(thm)],[c_14131]) ).
cnf(c_9,plain,
( equal_sets(X0,X1)
| ~ equal_sets(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6b47fe.p',c_0_98_1) ).
cnf(c_87,plain,
( equal_sets(X0,X1)
| ~ equal_sets(X1,X0) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_14105,plain,
( equal_sets(ds,X0)
| ~ equal_sets(X0,ds) ),
inference(instantiation,[status(thm)],[c_87]) ).
cnf(c_14247,plain,
( ~ equal_sets(intersection(bs,as),ds)
| equal_sets(ds,intersection(bs,as)) ),
inference(instantiation,[status(thm)],[c_14105]) ).
cnf(c_14082,plain,
( equal_sets(cs,X0)
| ~ equal_sets(X0,cs) ),
inference(instantiation,[status(thm)],[c_87]) ).
cnf(c_14125,plain,
( ~ equal_sets(intersection(as,bs),cs)
| equal_sets(cs,intersection(as,bs)) ),
inference(instantiation,[status(thm)],[c_14082]) ).
cnf(c_34,plain,
( ~ member(member_of_1_not_of_2(X0,X1),X1)
| subset(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6b47fe.p',c_0_88_0) ).
cnf(c_112,plain,
( ~ member(member_of_1_not_of_2(X0,X1),X1)
| subset(X0,X1) ),
inference(copy,[status(esa)],[c_34]) ).
cnf(c_14092,plain,
( ~ member(member_of_1_not_of_2(ds,cs),cs)
| subset(ds,cs) ),
inference(instantiation,[status(thm)],[c_112]) ).
cnf(c_14,plain,
( subset(X0,X1)
| member(member_of_1_not_of_2(X0,X1),X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6b47fe.p',c_0_96_0) ).
cnf(c_92,plain,
( subset(X0,X1)
| member(member_of_1_not_of_2(X0,X1),X0) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_14094,plain,
( member(member_of_1_not_of_2(ds,cs),ds)
| subset(ds,cs) ),
inference(instantiation,[status(thm)],[c_92]) ).
cnf(c_14070,plain,
( ~ member(member_of_1_not_of_2(cs,ds),ds)
| subset(cs,ds) ),
inference(instantiation,[status(thm)],[c_112]) ).
cnf(c_14072,plain,
( member(member_of_1_not_of_2(cs,ds),cs)
| subset(cs,ds) ),
inference(instantiation,[status(thm)],[c_92]) ).
cnf(c_20,plain,
( equal_sets(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6b47fe.p',c_0_93_2) ).
cnf(c_98,plain,
( equal_sets(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(copy,[status(esa)],[c_20]) ).
cnf(c_14020,plain,
( equal_sets(cs,ds)
| ~ subset(cs,ds)
| ~ subset(ds,cs) ),
inference(instantiation,[status(thm)],[c_98]) ).
cnf(c_46,plain,
equal_sets(intersection(bs,as),ds),
file('/export/starexec/sandbox/tmp/iprover_modulo_6b47fe.p',c_0_12) ).
cnf(c_47,plain,
equal_sets(intersection(as,bs),cs),
file('/export/starexec/sandbox/tmp/iprover_modulo_6b47fe.p',c_0_13) ).
cnf(c_45,negated_conjecture,
~ equal_sets(cs,ds),
file('/export/starexec/sandbox/tmp/iprover_modulo_6b47fe.p',c_0_14) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_279127,c_279051,c_233895,c_230548,c_65844,c_63468,c_63076,c_43039,c_43021,c_28800,c_28218,c_27464,c_27335,c_14953,c_14247,c_14125,c_14092,c_14094,c_14070,c_14072,c_14020,c_46,c_47,c_45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET013-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.12 % Command : iprover_modulo %s %d
% 0.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jul 10 07:49:30 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 % Running in mono-core mode
% 0.19/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.19/0.39 % Orientation found
% 0.19/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_9f1969.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_6b47fe.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_7cbcb0 | grep -v "SZS"
% 0.19/0.41
% 0.19/0.41 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.41
% 0.19/0.41 %
% 0.19/0.41 % ------ iProver source info
% 0.19/0.41
% 0.19/0.41 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.41 % git: non_committed_changes: true
% 0.19/0.41 % git: last_make_outside_of_git: true
% 0.19/0.41
% 0.19/0.41 %
% 0.19/0.41 % ------ Input Options
% 0.19/0.41
% 0.19/0.41 % --out_options all
% 0.19/0.41 % --tptp_safe_out true
% 0.19/0.41 % --problem_path ""
% 0.19/0.41 % --include_path ""
% 0.19/0.41 % --clausifier .//eprover
% 0.19/0.41 % --clausifier_options --tstp-format
% 0.19/0.41 % --stdin false
% 0.19/0.41 % --dbg_backtrace false
% 0.19/0.41 % --dbg_dump_prop_clauses false
% 0.19/0.41 % --dbg_dump_prop_clauses_file -
% 0.19/0.41 % --dbg_out_stat false
% 0.19/0.41
% 0.19/0.41 % ------ General Options
% 0.19/0.41
% 0.19/0.41 % --fof false
% 0.19/0.41 % --time_out_real 150.
% 0.19/0.41 % --time_out_prep_mult 0.2
% 0.19/0.41 % --time_out_virtual -1.
% 0.19/0.41 % --schedule none
% 0.19/0.41 % --ground_splitting input
% 0.19/0.41 % --splitting_nvd 16
% 0.19/0.41 % --non_eq_to_eq false
% 0.19/0.41 % --prep_gs_sim true
% 0.19/0.41 % --prep_unflatten false
% 0.19/0.41 % --prep_res_sim true
% 0.19/0.41 % --prep_upred true
% 0.19/0.41 % --res_sim_input true
% 0.19/0.41 % --clause_weak_htbl true
% 0.19/0.41 % --gc_record_bc_elim false
% 0.19/0.41 % --symbol_type_check false
% 0.19/0.41 % --clausify_out false
% 0.19/0.41 % --large_theory_mode false
% 0.19/0.41 % --prep_sem_filter none
% 0.19/0.41 % --prep_sem_filter_out false
% 0.19/0.41 % --preprocessed_out false
% 0.19/0.41 % --sub_typing false
% 0.19/0.41 % --brand_transform false
% 0.19/0.41 % --pure_diseq_elim true
% 0.19/0.41 % --min_unsat_core false
% 0.19/0.41 % --pred_elim true
% 0.19/0.41 % --add_important_lit false
% 0.19/0.41 % --soft_assumptions false
% 0.19/0.41 % --reset_solvers false
% 0.19/0.41 % --bc_imp_inh []
% 0.19/0.41 % --conj_cone_tolerance 1.5
% 0.19/0.41 % --prolific_symb_bound 500
% 0.19/0.41 % --lt_threshold 2000
% 0.19/0.41
% 0.19/0.41 % ------ SAT Options
% 0.19/0.41
% 0.19/0.41 % --sat_mode false
% 0.19/0.41 % --sat_fm_restart_options ""
% 0.19/0.41 % --sat_gr_def false
% 0.19/0.41 % --sat_epr_types true
% 0.19/0.41 % --sat_non_cyclic_types false
% 0.19/0.41 % --sat_finite_models false
% 0.19/0.41 % --sat_fm_lemmas false
% 0.19/0.41 % --sat_fm_prep false
% 0.19/0.41 % --sat_fm_uc_incr true
% 0.19/0.41 % --sat_out_model small
% 0.19/0.41 % --sat_out_clauses false
% 0.19/0.41
% 0.19/0.41 % ------ QBF Options
% 0.19/0.41
% 0.19/0.41 % --qbf_mode false
% 0.19/0.41 % --qbf_elim_univ true
% 0.19/0.41 % --qbf_sk_in true
% 0.19/0.41 % --qbf_pred_elim true
% 0.19/0.41 % --qbf_split 32
% 0.19/0.41
% 0.19/0.41 % ------ BMC1 Options
% 0.19/0.41
% 0.19/0.41 % --bmc1_incremental false
% 0.19/0.41 % --bmc1_axioms reachable_all
% 0.19/0.41 % --bmc1_min_bound 0
% 0.19/0.41 % --bmc1_max_bound -1
% 0.19/0.41 % --bmc1_max_bound_default -1
% 0.19/0.41 % --bmc1_symbol_reachability true
% 0.19/0.41 % --bmc1_property_lemmas false
% 0.19/0.41 % --bmc1_k_induction false
% 0.19/0.41 % --bmc1_non_equiv_states false
% 0.19/0.41 % --bmc1_deadlock false
% 0.19/0.41 % --bmc1_ucm false
% 0.19/0.41 % --bmc1_add_unsat_core none
% 0.19/0.41 % --bmc1_unsat_core_children false
% 0.19/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.41 % --bmc1_out_stat full
% 0.19/0.41 % --bmc1_ground_init false
% 0.19/0.41 % --bmc1_pre_inst_next_state false
% 0.19/0.41 % --bmc1_pre_inst_state false
% 0.19/0.41 % --bmc1_pre_inst_reach_state false
% 0.19/0.41 % --bmc1_out_unsat_core false
% 0.19/0.41 % --bmc1_aig_witness_out false
% 0.19/0.41 % --bmc1_verbose false
% 0.19/0.41 % --bmc1_dump_clauses_tptp false
% 0.19/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.42 % --bmc1_dump_file -
% 0.19/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.42 % --bmc1_ucm_extend_mode 1
% 0.19/0.42 % --bmc1_ucm_init_mode 2
% 0.19/0.42 % --bmc1_ucm_cone_mode none
% 0.19/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.42 % --bmc1_ucm_relax_model 4
% 0.19/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.42 % --bmc1_ucm_layered_model none
% 0.19/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.42
% 0.19/0.42 % ------ AIG Options
% 0.19/0.42
% 0.19/0.42 % --aig_mode false
% 0.19/0.42
% 0.19/0.42 % ------ Instantiation Options
% 0.19/0.42
% 0.19/0.42 % --instantiation_flag true
% 0.19/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.42 % --inst_solver_per_active 750
% 0.19/0.42 % --inst_solver_calls_frac 0.5
% 0.19/0.42 % --inst_passive_queue_type priority_queues
% 0.19/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.42 % --inst_passive_queues_freq [25;2]
% 0.19/0.42 % --inst_dismatching true
% 0.19/0.42 % --inst_eager_unprocessed_to_passive true
% 0.19/0.42 % --inst_prop_sim_given true
% 0.19/0.42 % --inst_prop_sim_new false
% 0.19/0.42 % --inst_orphan_elimination true
% 0.19/0.42 % --inst_learning_loop_flag true
% 0.19/0.42 % --inst_learning_start 3000
% 0.19/0.42 % --inst_learning_factor 2
% 0.19/0.42 % --inst_start_prop_sim_after_learn 3
% 0.19/0.42 % --inst_sel_renew solver
% 0.19/0.42 % --inst_lit_activity_flag true
% 0.19/0.42 % --inst_out_proof true
% 0.19/0.42
% 0.19/0.42 % ------ Resolution Options
% 0.19/0.42
% 0.19/0.42 % --resolution_flag true
% 0.19/0.42 % --res_lit_sel kbo_max
% 0.19/0.42 % --res_to_prop_solver none
% 0.19/0.42 % --res_prop_simpl_new false
% 0.19/0.42 % --res_prop_simpl_given false
% 0.19/0.42 % --res_passive_queue_type priority_queues
% 0.19/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.42 % --res_passive_queues_freq [15;5]
% 0.19/0.42 % --res_forward_subs full
% 0.19/0.42 % --res_backward_subs full
% 0.19/0.42 % --res_forward_subs_resolution true
% 0.19/0.42 % --res_backward_subs_resolution true
% 0.19/0.42 % --res_orphan_elimination false
% 0.19/0.42 % --res_time_limit 1000.
% 0.19/0.42 % --res_out_proof true
% 0.19/0.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_9f1969.s
% 0.19/0.42 % --modulo true
% 0.19/0.42
% 0.19/0.42 % ------ Combination Options
% 0.19/0.42
% 0.19/0.42 % --comb_res_mult 1000
% 0.19/0.42 % --comb_inst_mult 300
% 0.19/0.42 % ------
% 0.19/0.42
% 0.19/0.42 % ------ Parsing...% successful
% 0.19/0.42
% 0.19/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.19/0.42
% 0.19/0.42 % ------ Proving...
% 0.19/0.42 % ------ Problem Properties
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % EPR false
% 0.19/0.42 % Horn false
% 0.19/0.42 % Has equality false
% 0.19/0.42
% 0.19/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 % % ------ Current options:
% 0.19/0.42
% 0.19/0.42 % ------ Input Options
% 0.19/0.42
% 0.19/0.42 % --out_options all
% 0.19/0.42 % --tptp_safe_out true
% 0.19/0.42 % --problem_path ""
% 0.19/0.42 % --include_path ""
% 0.19/0.42 % --clausifier .//eprover
% 0.19/0.42 % --clausifier_options --tstp-format
% 0.19/0.42 % --stdin false
% 0.19/0.42 % --dbg_backtrace false
% 0.19/0.42 % --dbg_dump_prop_clauses false
% 0.19/0.42 % --dbg_dump_prop_clauses_file -
% 0.19/0.42 % --dbg_out_stat false
% 0.19/0.42
% 0.19/0.42 % ------ General Options
% 0.19/0.42
% 0.19/0.42 % --fof false
% 0.19/0.42 % --time_out_real 150.
% 0.19/0.42 % --time_out_prep_mult 0.2
% 0.19/0.42 % --time_out_virtual -1.
% 0.19/0.42 % --schedule none
% 0.19/0.42 % --ground_splitting input
% 0.19/0.42 % --splitting_nvd 16
% 0.19/0.42 % --non_eq_to_eq false
% 0.19/0.42 % --prep_gs_sim true
% 0.19/0.42 % --prep_unflatten false
% 0.19/0.42 % --prep_res_sim true
% 0.19/0.42 % --prep_upred true
% 0.19/0.42 % --res_sim_input true
% 0.19/0.42 % --clause_weak_htbl true
% 0.19/0.42 % --gc_record_bc_elim false
% 0.19/0.42 % --symbol_type_check false
% 0.19/0.42 % --clausify_out false
% 0.19/0.42 % --large_theory_mode false
% 0.19/0.42 % --prep_sem_filter none
% 0.19/0.42 % --prep_sem_filter_out false
% 0.19/0.42 % --preprocessed_out false
% 0.19/0.42 % --sub_typing false
% 0.19/0.42 % --brand_transform false
% 0.19/0.42 % --pure_diseq_elim true
% 0.19/0.42 % --min_unsat_core false
% 0.19/0.42 % --pred_elim true
% 0.19/0.42 % --add_important_lit false
% 0.19/0.42 % --soft_assumptions false
% 0.19/0.42 % --reset_solvers false
% 0.19/0.42 % --bc_imp_inh []
% 0.19/0.42 % --conj_cone_tolerance 1.5
% 0.19/0.42 % --prolific_symb_bound 500
% 0.19/0.42 % --lt_threshold 2000
% 0.19/0.42
% 0.19/0.42 % ------ SAT Options
% 0.19/0.42
% 0.19/0.42 % --sat_mode false
% 0.19/0.42 % --sat_fm_restart_options ""
% 0.19/0.42 % --sat_gr_def false
% 0.19/0.42 % --sat_epr_types true
% 0.19/0.42 % --sat_non_cyclic_types false
% 0.19/0.42 % --sat_finite_models false
% 0.19/0.42 % --sat_fm_lemmas false
% 0.19/0.42 % --sat_fm_prep false
% 0.19/0.42 % --sat_fm_uc_incr true
% 0.19/0.42 % --sat_out_model small
% 0.19/0.42 % --sat_out_clauses false
% 0.19/0.42
% 0.19/0.42 % ------ QBF Options
% 0.19/0.42
% 0.19/0.42 % --qbf_mode false
% 0.19/0.42 % --qbf_elim_univ true
% 0.19/0.42 % --qbf_sk_in true
% 0.19/0.42 % --qbf_pred_elim true
% 0.19/0.42 % --qbf_split 32
% 0.19/0.42
% 0.19/0.42 % ------ BMC1 Options
% 0.19/0.42
% 0.19/0.42 % --bmc1_incremental false
% 0.19/0.42 % --bmc1_axioms reachable_all
% 0.19/0.42 % --bmc1_min_bound 0
% 0.19/0.42 % --bmc1_max_bound -1
% 0.19/0.42 % --bmc1_max_bound_default -1
% 0.19/0.42 % --bmc1_symbol_reachability true
% 0.19/0.42 % --bmc1_property_lemmas false
% 0.19/0.42 % --bmc1_k_induction false
% 0.19/0.42 % --bmc1_non_equiv_states false
% 0.19/0.42 % --bmc1_deadlock false
% 0.19/0.42 % --bmc1_ucm false
% 0.19/0.42 % --bmc1_add_unsat_core none
% 0.19/0.42 % --bmc1_unsat_core_children false
% 0.19/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.42 % --bmc1_out_stat full
% 0.19/0.42 % --bmc1_ground_init false
% 0.19/0.42 % --bmc1_pre_inst_next_state false
% 0.19/0.42 % --bmc1_pre_inst_state false
% 0.19/0.42 % --bmc1_pre_inst_reach_state false
% 0.19/0.42 % --bmc1_out_unsat_core false
% 0.19/0.42 % --bmc1_aig_witness_out false
% 0.19/0.42 % --bmc1_verbose false
% 0.19/0.42 % --bmc1_dump_clauses_tptp false
% 0.19/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.42 % --bmc1_dump_file -
% 0.19/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.42 % --bmc1_ucm_extend_mode 1
% 0.19/0.42 % --bmc1_ucm_init_mode 2
% 0.19/0.42 % --bmc1_ucm_cone_mode none
% 0.19/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.42 % --bmc1_ucm_relax_model 4
% 0.19/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.42 % --bmc1_ucm_layered_model none
% 0.19/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.42
% 0.19/0.42 % ------ AIG Options
% 0.19/0.42
% 0.19/0.42 % --aig_mode false
% 0.19/0.42
% 0.19/0.42 % ------ Instantiation Options
% 0.19/0.42
% 0.19/0.42 % --instantiation_flag true
% 0.19/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.42 % --inst_solver_per_active 750
% 0.19/0.42 % --inst_solver_calls_frac 0.5
% 0.19/0.42 % --inst_passive_queue_type priority_queues
% 0.19/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.42 % --inst_passive_queues_freq [25;2]
% 0.19/0.42 % --inst_dismatching true
% 0.19/0.42 % --inst_eager_unprocessed_to_passive true
% 0.19/0.42 % --inst_prop_sim_given true
% 150.21/150.41 % --inst_prop_sim_new false
% 150.21/150.41 % --inst_orphan_elimination true
% 150.21/150.41 % --inst_learning_loop_flag true
% 150.21/150.41 % --inst_learning_start 3000
% 150.21/150.41 % --inst_learning_factor 2
% 150.21/150.41 % --inst_start_prop_sim_after_learn 3
% 150.21/150.41 % --inst_sel_renew solver
% 150.21/150.41 % --inst_lit_activity_flag true
% 150.21/150.41 % --inst_out_proof true
% 150.21/150.41
% 150.21/150.41 % ------ Resolution Options
% 150.21/150.41
% 150.21/150.41 % --resolution_flag true
% 150.21/150.41 % --res_lit_sel kbo_max
% 150.21/150.41 % --res_to_prop_solver none
% 150.21/150.41 % --res_prop_simpl_new false
% 150.21/150.41 % --res_prop_simpl_given false
% 150.21/150.41 % --res_passive_queue_type priority_queues
% 150.21/150.41 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.21/150.41 % --res_passive_queues_freq [15;5]
% 150.21/150.41 % --res_forward_subs full
% 150.21/150.41 % --res_backward_subs full
% 150.21/150.41 % --res_forward_subs_resolution true
% 150.21/150.41 % --res_backward_subs_resolution true
% 150.21/150.41 % --res_orphan_elimination false
% 150.21/150.41 % --res_time_limit 1000.
% 150.21/150.41 % --res_out_proof true
% 150.21/150.41 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_9f1969.s
% 150.21/150.41 % --modulo true
% 150.21/150.41
% 150.21/150.41 % ------ Combination Options
% 150.21/150.41
% 150.21/150.41 % --comb_res_mult 1000
% 150.21/150.41 % --comb_inst_mult 300
% 150.21/150.41 % ------
% 150.21/150.41
% 150.21/150.41
% 150.21/150.41
% 150.21/150.41 % ------ Proving...
% 150.21/150.41 %
% 150.21/150.41
% 150.21/150.41
% 150.21/150.41 % Time Out Real
% 150.21/150.41
% 150.21/150.41 % ------ Statistics
% 150.21/150.41
% 150.21/150.41 % ------ General
% 150.21/150.41
% 150.21/150.41 % num_of_input_clauses: 48
% 150.21/150.41 % num_of_input_neg_conjectures: 1
% 150.21/150.41 % num_of_splits: 0
% 150.21/150.41 % num_of_split_atoms: 0
% 150.21/150.41 % num_of_sem_filtered_clauses: 0
% 150.21/150.41 % num_of_subtypes: 0
% 150.21/150.41 % monotx_restored_types: 0
% 150.21/150.41 % sat_num_of_epr_types: 0
% 150.21/150.41 % sat_num_of_non_cyclic_types: 0
% 150.21/150.41 % sat_guarded_non_collapsed_types: 0
% 150.21/150.41 % is_epr: 0
% 150.21/150.41 % is_horn: 0
% 150.21/150.41 % has_eq: 0
% 150.21/150.41 % num_pure_diseq_elim: 0
% 150.21/150.41 % simp_replaced_by: 0
% 150.21/150.41 % res_preprocessed: 4
% 150.21/150.41 % prep_upred: 0
% 150.21/150.41 % prep_unflattend: 0
% 150.21/150.41 % pred_elim_cands: 0
% 150.21/150.41 % pred_elim: 0
% 150.21/150.41 % pred_elim_cl: 0
% 150.21/150.41 % pred_elim_cycles: 0
% 150.21/150.41 % forced_gc_time: 0
% 150.21/150.41 % gc_basic_clause_elim: 0
% 150.21/150.41 % parsing_time: 0.
% 150.21/150.41 % sem_filter_time: 0.
% 150.21/150.41 % pred_elim_time: 0.
% 150.21/150.41 % out_proof_time: 0.
% 150.21/150.41 % monotx_time: 0.
% 150.21/150.41 % subtype_inf_time: 0.
% 150.21/150.41 % unif_index_cands_time: 0.353
% 150.21/150.41 % unif_index_add_time: 0.244
% 150.21/150.41 % total_time: 150.011
% 150.21/150.41 % num_of_symbols: 38
% 150.21/150.41 % num_of_terms: 2853314
% 150.21/150.41
% 150.21/150.41 % ------ Propositional Solver
% 150.21/150.41
% 150.21/150.41 % prop_solver_calls: 59
% 150.21/150.41 % prop_fast_solver_calls: 7
% 150.21/150.41 % prop_num_of_clauses: 103033
% 150.21/150.41 % prop_preprocess_simplified: 119664
% 150.21/150.41 % prop_fo_subsumed: 0
% 150.21/150.41 % prop_solver_time: 0.187
% 150.21/150.41 % prop_fast_solver_time: 0.
% 150.21/150.41 % prop_unsat_core_time: 0.
% 150.21/150.41
% 150.21/150.41 % ------ QBF
% 150.21/150.41
% 150.21/150.41 % qbf_q_res: 0
% 150.21/150.41 % qbf_num_tautologies: 0
% 150.21/150.41 % qbf_prep_cycles: 0
% 150.21/150.41
% 150.21/150.41 % ------ BMC1
% 150.21/150.41
% 150.21/150.41 % bmc1_current_bound: -1
% 150.21/150.41 % bmc1_last_solved_bound: -1
% 150.21/150.41 % bmc1_unsat_core_size: -1
% 150.21/150.41 % bmc1_unsat_core_parents_size: -1
% 150.21/150.41 % bmc1_merge_next_fun: 0
% 150.21/150.41 % bmc1_unsat_core_clauses_time: 0.
% 150.21/150.41
% 150.21/150.41 % ------ Instantiation
% 150.21/150.41
% 150.21/150.41 % inst_num_of_clauses: 22705
% 150.21/150.41 % inst_num_in_passive: 14985
% 150.21/150.41 % inst_num_in_active: 4699
% 150.21/150.41 % inst_num_in_unprocessed: 2871
% 150.21/150.41 % inst_num_of_loops: 5698
% 150.21/150.42 % inst_num_of_learning_restarts: 2
% 150.21/150.42 % inst_num_moves_active_passive: 847
% 150.21/150.42 % inst_lit_activity: 2111
% 150.21/150.42 % inst_lit_activity_moves: 2
% 150.21/150.42 % inst_num_tautologies: 150
% 150.21/150.42 % inst_num_prop_implied: 0
% 150.21/150.42 % inst_num_existing_simplified: 0
% 150.21/150.42 % inst_num_eq_res_simplified: 0
% 150.21/150.42 % inst_num_child_elim: 0
% 150.21/150.42 % inst_num_of_dismatching_blockings: 55139
% 150.21/150.42 % inst_num_of_non_proper_insts: 32647
% 150.21/150.42 % inst_num_of_duplicates: 17897
% 150.21/150.42 % inst_inst_num_from_inst_to_res: 0
% 150.21/150.42 % inst_dismatching_checking_time: 1.281
% 150.21/150.42
% 150.21/150.42 % ------ Resolution
% 150.21/150.42
% 150.21/150.42 % res_num_of_clauses: 451250
% 150.21/150.42 % res_num_in_passive: 421402
% 150.21/150.42 % res_num_in_active: 31254
% 150.21/150.42 % res_num_of_loops: 49807
% 150.21/150.42 % res_forward_subset_subsumed: 84631
% 150.21/150.42 % res_backward_subset_subsumed: 1496
% 150.21/150.42 % res_forward_subsumed: 13373
% 150.21/150.42 % res_backward_subsumed: 5158
% 150.21/150.42 % res_forward_subsumption_resolution: 3571
% 150.21/150.42 % res_backward_subsumption_resolution: 2
% 150.21/150.42 % res_clause_to_clause_subsumption: 45519002
% 150.21/150.42 % res_orphan_elimination: 0
% 150.21/150.42 % res_tautology_del: 4828
% 150.21/150.42 % res_num_eq_res_simplified: 0
% 150.21/150.42 % res_num_sel_changes: 0
% 150.21/150.42 % res_moves_from_active_to_pass: 0
% 150.21/150.42
% 150.21/150.42 % Status Unknown
% 150.27/150.46 % Orienting using strategy ClausalAll
% 150.27/150.46 % Orientation found
% 150.27/150.46 % 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_9f1969.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_6b47fe.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_24b183 | grep -v "SZS"
% 150.31/150.48
% 150.31/150.48 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 150.31/150.48
% 150.31/150.48 %
% 150.31/150.48 % ------ iProver source info
% 150.31/150.48
% 150.31/150.48 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 150.31/150.48 % git: non_committed_changes: true
% 150.31/150.48 % git: last_make_outside_of_git: true
% 150.31/150.48
% 150.31/150.48 %
% 150.31/150.48 % ------ Input Options
% 150.31/150.48
% 150.31/150.48 % --out_options all
% 150.31/150.48 % --tptp_safe_out true
% 150.31/150.48 % --problem_path ""
% 150.31/150.48 % --include_path ""
% 150.31/150.48 % --clausifier .//eprover
% 150.31/150.48 % --clausifier_options --tstp-format
% 150.31/150.48 % --stdin false
% 150.31/150.48 % --dbg_backtrace false
% 150.31/150.48 % --dbg_dump_prop_clauses false
% 150.31/150.48 % --dbg_dump_prop_clauses_file -
% 150.31/150.48 % --dbg_out_stat false
% 150.31/150.48
% 150.31/150.48 % ------ General Options
% 150.31/150.48
% 150.31/150.48 % --fof false
% 150.31/150.48 % --time_out_real 150.
% 150.31/150.48 % --time_out_prep_mult 0.2
% 150.31/150.48 % --time_out_virtual -1.
% 150.31/150.48 % --schedule none
% 150.31/150.48 % --ground_splitting input
% 150.31/150.48 % --splitting_nvd 16
% 150.31/150.48 % --non_eq_to_eq false
% 150.31/150.48 % --prep_gs_sim true
% 150.31/150.48 % --prep_unflatten false
% 150.31/150.48 % --prep_res_sim true
% 150.31/150.48 % --prep_upred true
% 150.31/150.48 % --res_sim_input true
% 150.31/150.48 % --clause_weak_htbl true
% 150.31/150.48 % --gc_record_bc_elim false
% 150.31/150.48 % --symbol_type_check false
% 150.31/150.48 % --clausify_out false
% 150.31/150.48 % --large_theory_mode false
% 150.31/150.48 % --prep_sem_filter none
% 150.31/150.48 % --prep_sem_filter_out false
% 150.31/150.48 % --preprocessed_out false
% 150.31/150.48 % --sub_typing false
% 150.31/150.48 % --brand_transform false
% 150.31/150.48 % --pure_diseq_elim true
% 150.31/150.48 % --min_unsat_core false
% 150.31/150.48 % --pred_elim true
% 150.31/150.48 % --add_important_lit false
% 150.31/150.48 % --soft_assumptions false
% 150.31/150.48 % --reset_solvers false
% 150.31/150.48 % --bc_imp_inh []
% 150.31/150.48 % --conj_cone_tolerance 1.5
% 150.31/150.48 % --prolific_symb_bound 500
% 150.31/150.48 % --lt_threshold 2000
% 150.31/150.48
% 150.31/150.48 % ------ SAT Options
% 150.31/150.48
% 150.31/150.48 % --sat_mode false
% 150.31/150.48 % --sat_fm_restart_options ""
% 150.31/150.48 % --sat_gr_def false
% 150.31/150.48 % --sat_epr_types true
% 150.31/150.48 % --sat_non_cyclic_types false
% 150.31/150.48 % --sat_finite_models false
% 150.31/150.48 % --sat_fm_lemmas false
% 150.31/150.48 % --sat_fm_prep false
% 150.31/150.48 % --sat_fm_uc_incr true
% 150.31/150.48 % --sat_out_model small
% 150.31/150.48 % --sat_out_clauses false
% 150.31/150.48
% 150.31/150.48 % ------ QBF Options
% 150.31/150.48
% 150.31/150.48 % --qbf_mode false
% 150.31/150.48 % --qbf_elim_univ true
% 150.31/150.48 % --qbf_sk_in true
% 150.31/150.48 % --qbf_pred_elim true
% 150.31/150.48 % --qbf_split 32
% 150.31/150.48
% 150.31/150.48 % ------ BMC1 Options
% 150.31/150.48
% 150.31/150.48 % --bmc1_incremental false
% 150.31/150.48 % --bmc1_axioms reachable_all
% 150.31/150.48 % --bmc1_min_bound 0
% 150.31/150.48 % --bmc1_max_bound -1
% 150.31/150.48 % --bmc1_max_bound_default -1
% 150.31/150.48 % --bmc1_symbol_reachability true
% 150.31/150.48 % --bmc1_property_lemmas false
% 150.31/150.48 % --bmc1_k_induction false
% 150.31/150.48 % --bmc1_non_equiv_states false
% 150.31/150.48 % --bmc1_deadlock false
% 150.31/150.48 % --bmc1_ucm false
% 150.31/150.48 % --bmc1_add_unsat_core none
% 150.31/150.48 % --bmc1_unsat_core_children false
% 150.31/150.48 % --bmc1_unsat_core_extrapolate_axioms false
% 150.31/150.48 % --bmc1_out_stat full
% 150.31/150.48 % --bmc1_ground_init false
% 150.31/150.48 % --bmc1_pre_inst_next_state false
% 150.31/150.48 % --bmc1_pre_inst_state false
% 150.31/150.48 % --bmc1_pre_inst_reach_state false
% 150.31/150.48 % --bmc1_out_unsat_core false
% 150.31/150.48 % --bmc1_aig_witness_out false
% 150.31/150.48 % --bmc1_verbose false
% 150.31/150.48 % --bmc1_dump_clauses_tptp false
% 150.31/150.48 % --bmc1_dump_unsat_core_tptp false
% 150.31/150.48 % --bmc1_dump_file -
% 150.31/150.48 % --bmc1_ucm_expand_uc_limit 128
% 150.31/150.48 % --bmc1_ucm_n_expand_iterations 6
% 150.31/150.48 % --bmc1_ucm_extend_mode 1
% 150.31/150.48 % --bmc1_ucm_init_mode 2
% 150.31/150.48 % --bmc1_ucm_cone_mode none
% 150.31/150.48 % --bmc1_ucm_reduced_relation_type 0
% 150.31/150.48 % --bmc1_ucm_relax_model 4
% 150.31/150.48 % --bmc1_ucm_full_tr_after_sat true
% 150.31/150.48 % --bmc1_ucm_expand_neg_assumptions false
% 150.31/150.48 % --bmc1_ucm_layered_model none
% 150.31/150.48 % --bmc1_ucm_max_lemma_size 10
% 150.31/150.48
% 150.31/150.48 % ------ AIG Options
% 150.31/150.48
% 150.31/150.48 % --aig_mode false
% 150.31/150.48
% 150.31/150.48 % ------ Instantiation Options
% 150.31/150.48
% 150.31/150.48 % --instantiation_flag true
% 150.31/150.48 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.31/150.48 % --inst_solver_per_active 750
% 150.31/150.48 % --inst_solver_calls_frac 0.5
% 150.31/150.48 % --inst_passive_queue_type priority_queues
% 150.31/150.48 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.31/150.48 % --inst_passive_queues_freq [25;2]
% 150.31/150.48 % --inst_dismatching true
% 150.31/150.48 % --inst_eager_unprocessed_to_passive true
% 150.31/150.48 % --inst_prop_sim_given true
% 150.31/150.48 % --inst_prop_sim_new false
% 150.31/150.48 % --inst_orphan_elimination true
% 150.31/150.48 % --inst_learning_loop_flag true
% 150.31/150.48 % --inst_learning_start 3000
% 150.31/150.48 % --inst_learning_factor 2
% 150.31/150.48 % --inst_start_prop_sim_after_learn 3
% 150.31/150.48 % --inst_sel_renew solver
% 150.31/150.48 % --inst_lit_activity_flag true
% 150.31/150.48 % --inst_out_proof true
% 150.31/150.48
% 150.31/150.48 % ------ Resolution Options
% 150.31/150.48
% 150.31/150.48 % --resolution_flag true
% 150.31/150.48 % --res_lit_sel kbo_max
% 150.31/150.48 % --res_to_prop_solver none
% 150.31/150.48 % --res_prop_simpl_new false
% 150.31/150.48 % --res_prop_simpl_given false
% 150.31/150.48 % --res_passive_queue_type priority_queues
% 150.31/150.48 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.31/150.48 % --res_passive_queues_freq [15;5]
% 150.31/150.48 % --res_forward_subs full
% 150.31/150.48 % --res_backward_subs full
% 150.31/150.48 % --res_forward_subs_resolution true
% 150.31/150.48 % --res_backward_subs_resolution true
% 150.31/150.48 % --res_orphan_elimination false
% 150.31/150.48 % --res_time_limit 1000.
% 150.31/150.48 % --res_out_proof true
% 150.31/150.48 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_9f1969.s
% 150.31/150.48 % --modulo true
% 150.31/150.48
% 150.31/150.48 % ------ Combination Options
% 150.31/150.48
% 150.31/150.48 % --comb_res_mult 1000
% 150.31/150.48 % --comb_inst_mult 300
% 150.31/150.48 % ------
% 150.31/150.48
% 150.31/150.48 % ------ Parsing...% successful
% 150.31/150.48
% 150.31/150.48 % ------ 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 %
% 150.31/150.48
% 150.31/150.48 % ------ Proving...
% 150.31/150.48 % ------ Problem Properties
% 150.31/150.48
% 150.31/150.48 %
% 150.31/150.48 % EPR false
% 150.31/150.48 % Horn false
% 150.31/150.48 % Has equality false
% 150.31/150.48
% 150.31/150.48 % % ------ Input Options Time Limit: Unbounded
% 150.31/150.48
% 150.31/150.48
% 150.31/150.48 % % ------ Current options:
% 150.31/150.48
% 150.31/150.48 % ------ Input Options
% 150.31/150.48
% 150.31/150.48 % --out_options all
% 150.31/150.48 % --tptp_safe_out true
% 150.31/150.48 % --problem_path ""
% 150.31/150.48 % --include_path ""
% 150.31/150.48 % --clausifier .//eprover
% 150.31/150.48 % --clausifier_options --tstp-format
% 150.31/150.48 % --stdin false
% 150.31/150.48 % --dbg_backtrace false
% 150.31/150.48 % --dbg_dump_prop_clauses false
% 150.31/150.48 % --dbg_dump_prop_clauses_file -
% 150.31/150.48 % --dbg_out_stat false
% 150.31/150.48
% 150.31/150.48 % ------ General Options
% 150.31/150.48
% 150.31/150.48 % --fof false
% 150.31/150.48 % --time_out_real 150.
% 150.31/150.48 % --time_out_prep_mult 0.2
% 150.31/150.48 % --time_out_virtual -1.
% 150.31/150.48 % --schedule none
% 150.31/150.48 % --ground_splitting input
% 150.31/150.48 % --splitting_nvd 16
% 150.31/150.48 % --non_eq_to_eq false
% 150.31/150.48 % --prep_gs_sim true
% 150.31/150.48 % --prep_unflatten false
% 150.31/150.48 % --prep_res_sim true
% 150.31/150.48 % --prep_upred true
% 150.31/150.48 % --res_sim_input true
% 150.31/150.48 % --clause_weak_htbl true
% 150.31/150.48 % --gc_record_bc_elim false
% 150.31/150.48 % --symbol_type_check false
% 150.31/150.48 % --clausify_out false
% 150.31/150.48 % --large_theory_mode false
% 150.31/150.48 % --prep_sem_filter none
% 150.31/150.48 % --prep_sem_filter_out false
% 150.31/150.48 % --preprocessed_out false
% 150.31/150.48 % --sub_typing false
% 150.31/150.48 % --brand_transform false
% 150.31/150.48 % --pure_diseq_elim true
% 150.31/150.48 % --min_unsat_core false
% 150.31/150.48 % --pred_elim true
% 150.31/150.48 % --add_important_lit false
% 150.31/150.48 % --soft_assumptions false
% 150.31/150.48 % --reset_solvers false
% 150.31/150.48 % --bc_imp_inh []
% 150.31/150.48 % --conj_cone_tolerance 1.5
% 150.31/150.48 % --prolific_symb_bound 500
% 150.31/150.48 % --lt_threshold 2000
% 150.31/150.48
% 150.31/150.48 % ------ SAT Options
% 150.31/150.48
% 150.31/150.48 % --sat_mode false
% 150.31/150.48 % --sat_fm_restart_options ""
% 150.31/150.48 % --sat_gr_def false
% 150.31/150.48 % --sat_epr_types true
% 150.31/150.48 % --sat_non_cyclic_types false
% 150.31/150.48 % --sat_finite_models false
% 150.31/150.48 % --sat_fm_lemmas false
% 150.31/150.48 % --sat_fm_prep false
% 150.31/150.48 % --sat_fm_uc_incr true
% 150.31/150.48 % --sat_out_model small
% 150.31/150.48 % --sat_out_clauses false
% 150.31/150.48
% 150.31/150.48 % ------ QBF Options
% 150.31/150.48
% 150.31/150.48 % --qbf_mode false
% 150.31/150.48 % --qbf_elim_univ true
% 150.31/150.48 % --qbf_sk_in true
% 150.31/150.48 % --qbf_pred_elim true
% 150.31/150.48 % --qbf_split 32
% 150.31/150.48
% 150.31/150.48 % ------ BMC1 Options
% 150.31/150.48
% 150.31/150.48 % --bmc1_incremental false
% 150.31/150.48 % --bmc1_axioms reachable_all
% 150.31/150.48 % --bmc1_min_bound 0
% 150.31/150.48 % --bmc1_max_bound -1
% 150.31/150.48 % --bmc1_max_bound_default -1
% 150.31/150.48 % --bmc1_symbol_reachability true
% 150.31/150.48 % --bmc1_property_lemmas false
% 150.31/150.48 % --bmc1_k_induction false
% 150.31/150.48 % --bmc1_non_equiv_states false
% 150.31/150.48 % --bmc1_deadlock false
% 150.31/150.48 % --bmc1_ucm false
% 150.31/150.48 % --bmc1_add_unsat_core none
% 150.31/150.48 % --bmc1_unsat_core_children false
% 150.31/150.48 % --bmc1_unsat_core_extrapolate_axioms false
% 150.31/150.48 % --bmc1_out_stat full
% 150.31/150.48 % --bmc1_ground_init false
% 150.31/150.48 % --bmc1_pre_inst_next_state false
% 150.31/150.48 % --bmc1_pre_inst_state false
% 150.31/150.48 % --bmc1_pre_inst_reach_state false
% 150.31/150.48 % --bmc1_out_unsat_core false
% 150.31/150.48 % --bmc1_aig_witness_out false
% 150.31/150.48 % --bmc1_verbose false
% 150.31/150.48 % --bmc1_dump_clauses_tptp false
% 150.31/150.48 % --bmc1_dump_unsat_core_tptp false
% 150.31/150.48 % --bmc1_dump_file -
% 150.31/150.48 % --bmc1_ucm_expand_uc_limit 128
% 150.31/150.48 % --bmc1_ucm_n_expand_iterations 6
% 150.31/150.48 % --bmc1_ucm_extend_mode 1
% 150.31/150.48 % --bmc1_ucm_init_mode 2
% 150.31/150.48 % --bmc1_ucm_cone_mode none
% 150.31/150.48 % --bmc1_ucm_reduced_relation_type 0
% 150.31/150.48 % --bmc1_ucm_relax_model 4
% 150.31/150.48 % --bmc1_ucm_full_tr_after_sat true
% 150.31/150.48 % --bmc1_ucm_expand_neg_assumptions false
% 150.31/150.48 % --bmc1_ucm_layered_model none
% 150.31/150.48 % --bmc1_ucm_max_lemma_size 10
% 150.31/150.48
% 150.31/150.48 % ------ AIG Options
% 150.31/150.48
% 150.31/150.48 % --aig_mode false
% 150.31/150.48
% 150.31/150.48 % ------ Instantiation Options
% 150.31/150.48
% 150.31/150.48 % --instantiation_flag true
% 150.31/150.48 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.31/150.48 % --inst_solver_per_active 750
% 150.31/150.48 % --inst_solver_calls_frac 0.5
% 150.31/150.48 % --inst_passive_queue_type priority_queues
% 150.31/150.48 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.31/150.48 % --inst_passive_queues_freq [25;2]
% 150.31/150.48 % --inst_dismatching true
% 150.31/150.48 % --inst_eager_unprocessed_to_passive true
% 150.31/150.48 % --inst_prop_sim_given true
% 174.38/174.60 % --inst_prop_sim_new false
% 174.38/174.60 % --inst_orphan_elimination true
% 174.38/174.60 % --inst_learning_loop_flag true
% 174.38/174.60 % --inst_learning_start 3000
% 174.38/174.60 % --inst_learning_factor 2
% 174.38/174.60 % --inst_start_prop_sim_after_learn 3
% 174.38/174.60 % --inst_sel_renew solver
% 174.38/174.60 % --inst_lit_activity_flag true
% 174.38/174.60 % --inst_out_proof true
% 174.38/174.60
% 174.38/174.60 % ------ Resolution Options
% 174.38/174.60
% 174.38/174.60 % --resolution_flag true
% 174.38/174.60 % --res_lit_sel kbo_max
% 174.38/174.60 % --res_to_prop_solver none
% 174.38/174.60 % --res_prop_simpl_new false
% 174.38/174.60 % --res_prop_simpl_given false
% 174.38/174.60 % --res_passive_queue_type priority_queues
% 174.38/174.60 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 174.38/174.60 % --res_passive_queues_freq [15;5]
% 174.38/174.60 % --res_forward_subs full
% 174.38/174.60 % --res_backward_subs full
% 174.38/174.60 % --res_forward_subs_resolution true
% 174.38/174.60 % --res_backward_subs_resolution true
% 174.38/174.60 % --res_orphan_elimination false
% 174.38/174.60 % --res_time_limit 1000.
% 174.38/174.60 % --res_out_proof true
% 174.38/174.60 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_9f1969.s
% 174.38/174.60 % --modulo true
% 174.38/174.60
% 174.38/174.60 % ------ Combination Options
% 174.38/174.60
% 174.38/174.60 % --comb_res_mult 1000
% 174.38/174.60 % --comb_inst_mult 300
% 174.38/174.60 % ------
% 174.38/174.60
% 174.38/174.60
% 174.38/174.60
% 174.38/174.60 % ------ Proving...
% 174.38/174.60 %
% 174.38/174.60
% 174.38/174.60
% 174.38/174.60 % ------ Statistics
% 174.38/174.60
% 174.38/174.60 % ------ General
% 174.38/174.60
% 174.38/174.60 % num_of_input_clauses: 48
% 174.38/174.60 % num_of_input_neg_conjectures: 1
% 174.38/174.60 % num_of_splits: 0
% 174.38/174.60 % num_of_split_atoms: 0
% 174.38/174.60 % num_of_sem_filtered_clauses: 0
% 174.38/174.60 % num_of_subtypes: 0
% 174.38/174.60 % monotx_restored_types: 0
% 174.38/174.60 % sat_num_of_epr_types: 0
% 174.38/174.60 % sat_num_of_non_cyclic_types: 0
% 174.38/174.60 % sat_guarded_non_collapsed_types: 0
% 174.38/174.60 % is_epr: 0
% 174.38/174.60 % is_horn: 0
% 174.38/174.60 % has_eq: 0
% 174.38/174.60 % num_pure_diseq_elim: 0
% 174.38/174.60 % simp_replaced_by: 0
% 174.38/174.60 % res_preprocessed: 4
% 174.38/174.60 % prep_upred: 0
% 174.38/174.60 % prep_unflattend: 0
% 174.38/174.60 % pred_elim_cands: 0
% 174.38/174.60 % pred_elim: 0
% 174.38/174.60 % pred_elim_cl: 0
% 174.38/174.60 % pred_elim_cycles: 0
% 174.38/174.60 % forced_gc_time: 0
% 174.38/174.60 % gc_basic_clause_elim: 0
% 174.38/174.60 % parsing_time: 0.
% 174.38/174.60 % sem_filter_time: 0.
% 174.38/174.60 % pred_elim_time: 0.
% 174.38/174.60 % out_proof_time: 0.003
% 174.38/174.60 % monotx_time: 0.
% 174.38/174.60 % subtype_inf_time: 0.
% 174.38/174.60 % unif_index_cands_time: 0.032
% 174.38/174.60 % unif_index_add_time: 0.016
% 174.38/174.60 % total_time: 24.13
% 174.38/174.60 % num_of_symbols: 38
% 174.38/174.60 % num_of_terms: 85854
% 174.38/174.60
% 174.38/174.60 % ------ Propositional Solver
% 174.38/174.60
% 174.38/174.60 % prop_solver_calls: 26
% 174.38/174.60 % prop_fast_solver_calls: 7
% 174.38/174.60 % prop_num_of_clauses: 16289
% 174.38/174.60 % prop_preprocess_simplified: 20384
% 174.38/174.60 % prop_fo_subsumed: 0
% 174.38/174.60 % prop_solver_time: 0.013
% 174.38/174.60 % prop_fast_solver_time: 0.
% 174.38/174.60 % prop_unsat_core_time: 0.002
% 174.38/174.60
% 174.38/174.60 % ------ QBF
% 174.38/174.60
% 174.38/174.60 % qbf_q_res: 0
% 174.38/174.60 % qbf_num_tautologies: 0
% 174.38/174.60 % qbf_prep_cycles: 0
% 174.38/174.60
% 174.38/174.60 % ------ BMC1
% 174.38/174.60
% 174.38/174.60 % bmc1_current_bound: -1
% 174.38/174.60 % bmc1_last_solved_bound: -1
% 174.38/174.60 % bmc1_unsat_core_size: -1
% 174.38/174.60 % bmc1_unsat_core_parents_size: -1
% 174.38/174.60 % bmc1_merge_next_fun: 0
% 174.38/174.60 % bmc1_unsat_core_clauses_time: 0.
% 174.38/174.60
% 174.38/174.60 % ------ Instantiation
% 174.38/174.60
% 174.38/174.60 % inst_num_of_clauses: 3570
% 174.38/174.60 % inst_num_in_passive: 1418
% 174.38/174.60 % inst_num_in_active: 946
% 174.38/174.60 % inst_num_in_unprocessed: 1191
% 174.38/174.60 % inst_num_of_loops: 1236
% 174.38/174.60 % inst_num_of_learning_restarts: 1
% 174.38/174.60 % inst_num_moves_active_passive: 273
% 174.38/174.60 % inst_lit_activity: 323
% 174.38/174.60 % inst_lit_activity_moves: 0
% 174.38/174.60 % inst_num_tautologies: 14
% 174.38/174.60 % inst_num_prop_implied: 0
% 174.38/174.60 % inst_num_existing_simplified: 0
% 174.38/174.60 % inst_num_eq_res_simplified: 0
% 174.38/174.60 % inst_num_child_elim: 0
% 174.38/174.60 % inst_num_of_dismatching_blockings: 13759
% 174.38/174.60 % inst_num_of_non_proper_insts: 6566
% 174.38/174.60 % inst_num_of_duplicates: 5364
% 174.38/174.60 % inst_inst_num_from_inst_to_res: 0
% 174.38/174.60 % inst_dismatching_checking_time: 0.092
% 174.38/174.60
% 174.38/174.60 % ------ Resolution
% 174.38/174.60
% 174.38/174.60 % res_num_of_clauses: 18933
% 174.38/174.60 % res_num_in_passive: 14826
% 174.38/174.60 % res_num_in_active: 4508
% 174.38/174.60 % res_num_of_loops: 15000
% 174.38/174.60 % res_forward_subset_subsumed: 37269
% 174.38/174.60 % res_backward_subset_subsumed: 839
% 174.38/174.60 % res_forward_subsumed: 9634
% 174.38/174.60 % res_backward_subsumed: 16
% 174.38/174.60 % res_forward_subsumption_resolution: 1283
% 174.38/174.60 % res_backward_subsumption_resolution: 1
% 174.38/174.60 % res_clause_to_clause_subsumption: 6835726
% 174.38/174.60 % res_orphan_elimination: 0
% 174.38/174.60 % res_tautology_del: 215
% 174.38/174.60 % res_num_eq_res_simplified: 0
% 174.38/174.60 % res_num_sel_changes: 0
% 174.38/174.60 % res_moves_from_active_to_pass: 0
% 174.38/174.60
% 174.38/174.60 % Status Unsatisfiable
% 174.38/174.60 % SZS status Unsatisfiable
% 174.38/174.60 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------