TSTP Solution File: SEU217+3 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SEU217+3 : TPTP v8.1.0. Released v3.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 10:26:06 EDT 2022
% Result : Theorem 150.31s 150.51s
% Output : CNFRefutation 150.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 36
% Syntax : Number of formulae : 294 ( 114 unt; 0 def)
% Number of atoms : 642 ( 114 equ)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 654 ( 306 ~; 262 |; 56 &)
% ( 4 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 28 ( 28 usr; 16 con; 0-2 aty)
% Number of variables : 350 ( 31 sgn 109 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( X2 = identity_relation(X1)
<=> ( relation_dom(X2) = X1
& ! [X3] :
( in(X3,X1)
=> apply(X2,X3) = X3 ) ) ) ),
file('<stdin>',t34_funct_1) ).
fof(c_0_1,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
file('<stdin>',t4_subset) ).
fof(c_0_2,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
file('<stdin>',t5_subset) ).
fof(c_0_3,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('<stdin>',t3_subset) ).
fof(c_0_4,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('<stdin>',antisymmetry_r2_hidden) ).
fof(c_0_5,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('<stdin>',t2_subset) ).
fof(c_0_6,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('<stdin>',t1_subset) ).
fof(c_0_7,axiom,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2) ) ),
file('<stdin>',rc1_subset_1) ).
fof(c_0_8,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('<stdin>',t7_boole) ).
fof(c_0_9,axiom,
! [X1] :
( ( ~ empty(X1)
& relation(X1) )
=> ~ empty(relation_dom(X1)) ),
file('<stdin>',fc5_relat_1) ).
fof(c_0_10,axiom,
! [X1] :
? [X2] :
( element(X2,powerset(X1))
& empty(X2) ),
file('<stdin>',rc2_subset_1) ).
fof(c_0_11,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('<stdin>',existence_m1_subset_1) ).
fof(c_0_12,axiom,
! [X1] :
( empty(X1)
=> ( empty(relation_dom(X1))
& relation(relation_dom(X1)) ) ),
file('<stdin>',fc7_relat_1) ).
fof(c_0_13,axiom,
! [X1] : ~ empty(powerset(X1)),
file('<stdin>',fc1_subset_1) ).
fof(c_0_14,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
file('<stdin>',t8_boole) ).
fof(c_0_15,axiom,
! [X1,X2] : subset(X1,X1),
file('<stdin>',reflexivity_r1_tarski) ).
fof(c_0_16,axiom,
! [X1] :
( empty(X1)
=> relation(X1) ),
file('<stdin>',cc1_relat_1) ).
fof(c_0_17,axiom,
! [X1] :
( empty(X1)
=> function(X1) ),
file('<stdin>',cc1_funct_1) ).
fof(c_0_18,axiom,
! [X1] :
( relation(identity_relation(X1))
& function(identity_relation(X1)) ),
file('<stdin>',fc2_funct_1) ).
fof(c_0_19,axiom,
! [X1] : relation(identity_relation(X1)),
file('<stdin>',dt_k6_relat_1) ).
fof(c_0_20,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('<stdin>',t6_boole) ).
fof(c_0_21,axiom,
? [X1] : ~ empty(X1),
file('<stdin>',rc2_xboole_0) ).
fof(c_0_22,axiom,
? [X1] :
( ~ empty(X1)
& relation(X1) ),
file('<stdin>',rc2_relat_1) ).
fof(c_0_23,axiom,
? [X1] : empty(X1),
file('<stdin>',rc1_xboole_0) ).
fof(c_0_24,axiom,
? [X1] :
( relation(X1)
& relation_empty_yielding(X1) ),
file('<stdin>',rc3_relat_1) ).
fof(c_0_25,axiom,
? [X1] :
( empty(X1)
& relation(X1) ),
file('<stdin>',rc1_relat_1) ).
fof(c_0_26,axiom,
? [X1] :
( relation(X1)
& function(X1) ),
file('<stdin>',rc1_funct_1) ).
fof(c_0_27,axiom,
empty(empty_set),
file('<stdin>',fc1_xboole_0) ).
fof(c_0_28,axiom,
( empty(empty_set)
& relation(empty_set)
& relation_empty_yielding(empty_set) ),
file('<stdin>',fc12_relat_1) ).
fof(c_0_29,axiom,
( empty(empty_set)
& relation(empty_set) ),
file('<stdin>',fc4_relat_1) ).
fof(c_0_30,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( X2 = identity_relation(X1)
<=> ( relation_dom(X2) = X1
& ! [X3] :
( in(X3,X1)
=> apply(X2,X3) = X3 ) ) ) ),
c_0_0 ).
fof(c_0_31,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
c_0_1 ).
fof(c_0_32,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
c_0_2 ).
fof(c_0_33,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
c_0_3 ).
fof(c_0_34,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_35,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
c_0_5 ).
fof(c_0_36,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
c_0_6 ).
fof(c_0_37,plain,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_38,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
c_0_8 ).
fof(c_0_39,plain,
! [X1] :
( ( ~ empty(X1)
& relation(X1) )
=> ~ empty(relation_dom(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_40,axiom,
! [X1] :
? [X2] :
( element(X2,powerset(X1))
& empty(X2) ),
c_0_10 ).
fof(c_0_41,axiom,
! [X1] :
? [X2] : element(X2,X1),
c_0_11 ).
fof(c_0_42,axiom,
! [X1] :
( empty(X1)
=> ( empty(relation_dom(X1))
& relation(relation_dom(X1)) ) ),
c_0_12 ).
fof(c_0_43,plain,
! [X1] : ~ empty(powerset(X1)),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_44,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
c_0_14 ).
fof(c_0_45,axiom,
! [X1,X2] : subset(X1,X1),
c_0_15 ).
fof(c_0_46,axiom,
! [X1] :
( empty(X1)
=> relation(X1) ),
c_0_16 ).
fof(c_0_47,axiom,
! [X1] :
( empty(X1)
=> function(X1) ),
c_0_17 ).
fof(c_0_48,axiom,
! [X1] :
( relation(identity_relation(X1))
& function(identity_relation(X1)) ),
c_0_18 ).
fof(c_0_49,axiom,
! [X1] : relation(identity_relation(X1)),
c_0_19 ).
fof(c_0_50,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
c_0_20 ).
fof(c_0_51,plain,
? [X1] : ~ empty(X1),
inference(fof_simplification,[status(thm)],[c_0_21]) ).
fof(c_0_52,plain,
? [X1] :
( ~ empty(X1)
& relation(X1) ),
inference(fof_simplification,[status(thm)],[c_0_22]) ).
fof(c_0_53,axiom,
? [X1] : empty(X1),
c_0_23 ).
fof(c_0_54,axiom,
? [X1] :
( relation(X1)
& relation_empty_yielding(X1) ),
c_0_24 ).
fof(c_0_55,axiom,
? [X1] :
( empty(X1)
& relation(X1) ),
c_0_25 ).
fof(c_0_56,axiom,
? [X1] :
( relation(X1)
& function(X1) ),
c_0_26 ).
fof(c_0_57,axiom,
empty(empty_set),
c_0_27 ).
fof(c_0_58,axiom,
( empty(empty_set)
& relation(empty_set)
& relation_empty_yielding(empty_set) ),
c_0_28 ).
fof(c_0_59,axiom,
( empty(empty_set)
& relation(empty_set) ),
c_0_29 ).
fof(c_0_60,plain,
! [X4,X5,X6] :
( ( relation_dom(X5) = X4
| X5 != identity_relation(X4)
| ~ relation(X5)
| ~ function(X5) )
& ( ~ in(X6,X4)
| apply(X5,X6) = X6
| X5 != identity_relation(X4)
| ~ relation(X5)
| ~ function(X5) )
& ( in(esk10_2(X4,X5),X4)
| relation_dom(X5) != X4
| X5 = identity_relation(X4)
| ~ relation(X5)
| ~ function(X5) )
& ( apply(X5,esk10_2(X4,X5)) != esk10_2(X4,X5)
| relation_dom(X5) != X4
| X5 = identity_relation(X4)
| ~ relation(X5)
| ~ function(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])])]) ).
fof(c_0_61,plain,
! [X4,X5,X6] :
( ~ in(X4,X5)
| ~ element(X5,powerset(X6))
| element(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])]) ).
fof(c_0_62,plain,
! [X4,X5,X6] :
( ~ in(X4,X5)
| ~ element(X5,powerset(X6))
| ~ empty(X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])])]) ).
fof(c_0_63,plain,
! [X3,X4,X5,X6] :
( ( ~ element(X3,powerset(X4))
| subset(X3,X4) )
& ( ~ subset(X5,X6)
| element(X5,powerset(X6)) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])])]) ).
fof(c_0_64,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ in(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])]) ).
fof(c_0_65,plain,
! [X3,X4] :
( ~ element(X3,X4)
| empty(X4)
| in(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])]) ).
fof(c_0_66,plain,
! [X3,X4] :
( ~ in(X3,X4)
| element(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])]) ).
fof(c_0_67,plain,
! [X3] :
( ( element(esk3_1(X3),powerset(X3))
| empty(X3) )
& ( ~ empty(esk3_1(X3))
| empty(X3) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])])]) ).
fof(c_0_68,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])]) ).
fof(c_0_69,plain,
! [X2] :
( empty(X2)
| ~ relation(X2)
| ~ empty(relation_dom(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])]) ).
fof(c_0_70,plain,
! [X3] :
( element(esk4_1(X3),powerset(X3))
& empty(esk4_1(X3)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_40])]) ).
fof(c_0_71,plain,
! [X3] : element(esk1_1(X3),X3),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_41])]) ).
fof(c_0_72,plain,
! [X2] :
( ( empty(relation_dom(X2))
| ~ empty(X2) )
& ( relation(relation_dom(X2))
| ~ empty(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])])]) ).
fof(c_0_73,plain,
! [X2] : ~ empty(powerset(X2)),
inference(variable_rename,[status(thm)],[c_0_43]) ).
fof(c_0_74,plain,
! [X3,X4] :
( ~ empty(X3)
| X3 = X4
| ~ empty(X4) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_44])])])]) ).
fof(c_0_75,plain,
! [X3,X4] : subset(X3,X3),
inference(variable_rename,[status(thm)],[c_0_45]) ).
fof(c_0_76,plain,
! [X2] :
( ~ empty(X2)
| relation(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])]) ).
fof(c_0_77,plain,
! [X2] :
( ~ empty(X2)
| function(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_47])]) ).
fof(c_0_78,plain,
! [X2,X3] :
( relation(identity_relation(X2))
& function(identity_relation(X3)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_48])])]) ).
fof(c_0_79,plain,
! [X2] : relation(identity_relation(X2)),
inference(variable_rename,[status(thm)],[c_0_49]) ).
fof(c_0_80,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_50])]) ).
fof(c_0_81,plain,
~ empty(esk9_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_51])]) ).
fof(c_0_82,plain,
( ~ empty(esk6_0)
& relation(esk6_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_52])]) ).
fof(c_0_83,plain,
empty(esk8_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_53])]) ).
fof(c_0_84,plain,
( relation(esk7_0)
& relation_empty_yielding(esk7_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_54])]) ).
fof(c_0_85,plain,
( empty(esk5_0)
& relation(esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_55])]) ).
fof(c_0_86,plain,
( relation(esk2_0)
& function(esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_56])]) ).
fof(c_0_87,axiom,
empty(empty_set),
c_0_57 ).
fof(c_0_88,axiom,
( empty(empty_set)
& relation(empty_set)
& relation_empty_yielding(empty_set) ),
c_0_58 ).
fof(c_0_89,axiom,
( empty(empty_set)
& relation(empty_set) ),
c_0_59 ).
cnf(c_0_90,plain,
( X1 = identity_relation(X2)
| ~ function(X1)
| ~ relation(X1)
| relation_dom(X1) != X2
| apply(X1,esk10_2(X2,X1)) != esk10_2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_91,plain,
( element(X1,X2)
| ~ element(X3,powerset(X2))
| ~ in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_92,plain,
( X1 = identity_relation(X2)
| in(esk10_2(X2,X1),X2)
| ~ function(X1)
| ~ relation(X1)
| relation_dom(X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_93,plain,
( ~ empty(X1)
| ~ element(X2,powerset(X1))
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_94,plain,
( apply(X1,X3) = X3
| ~ function(X1)
| ~ relation(X1)
| X1 != identity_relation(X2)
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_95,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_96,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_97,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_98,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_99,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_100,plain,
( empty(X1)
| element(esk3_1(X1),powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_101,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_102,plain,
( empty(X1)
| ~ empty(relation_dom(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_103,plain,
( relation_dom(X1) = X2
| ~ function(X1)
| ~ relation(X1)
| X1 != identity_relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_104,plain,
element(esk4_1(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_105,plain,
( empty(X1)
| ~ empty(esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_106,plain,
element(esk1_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_107,plain,
( empty(relation_dom(X1))
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_108,plain,
( relation(relation_dom(X1))
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_109,plain,
~ empty(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_110,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_111,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_112,plain,
( relation(X1)
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_113,plain,
( function(X1)
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_114,plain,
empty(esk4_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_115,plain,
relation(identity_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_116,plain,
function(identity_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_117,plain,
relation(identity_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_118,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_119,plain,
~ empty(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_81]) ).
cnf(c_0_120,plain,
~ empty(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_121,plain,
empty(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_122,plain,
relation(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_123,plain,
relation_empty_yielding(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_124,plain,
relation(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_125,plain,
empty(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_126,plain,
relation(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_127,plain,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_128,plain,
function(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_129,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_130,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_131,plain,
relation(empty_set),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_132,plain,
relation_empty_yielding(empty_set),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_133,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_134,plain,
relation(empty_set),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_135,plain,
( X1 = identity_relation(X2)
| ~ function(X1)
| ~ relation(X1)
| relation_dom(X1) != X2
| apply(X1,esk10_2(X2,X1)) != esk10_2(X2,X1) ),
c_0_90,
[final] ).
cnf(c_0_136,plain,
( element(X1,X2)
| ~ element(X3,powerset(X2))
| ~ in(X1,X3) ),
c_0_91,
[final] ).
cnf(c_0_137,plain,
( X1 = identity_relation(X2)
| in(esk10_2(X2,X1),X2)
| ~ function(X1)
| ~ relation(X1)
| relation_dom(X1) != X2 ),
c_0_92,
[final] ).
cnf(c_0_138,plain,
( ~ empty(X1)
| ~ element(X2,powerset(X1))
| ~ in(X3,X2) ),
c_0_93,
[final] ).
cnf(c_0_139,plain,
( apply(X1,X3) = X3
| ~ function(X1)
| ~ relation(X1)
| X1 != identity_relation(X2)
| ~ in(X3,X2) ),
c_0_94,
[final] ).
cnf(c_0_140,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
c_0_95,
[final] ).
cnf(c_0_141,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
c_0_96,
[final] ).
cnf(c_0_142,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
c_0_97,
[final] ).
cnf(c_0_143,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
c_0_98,
[final] ).
cnf(c_0_144,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
c_0_99,
[final] ).
cnf(c_0_145,plain,
( empty(X1)
| element(esk3_1(X1),powerset(X1)) ),
c_0_100,
[final] ).
cnf(c_0_146,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
c_0_101,
[final] ).
cnf(c_0_147,plain,
( empty(X1)
| ~ empty(relation_dom(X1))
| ~ relation(X1) ),
c_0_102,
[final] ).
cnf(c_0_148,plain,
( relation_dom(X1) = X2
| ~ function(X1)
| ~ relation(X1)
| X1 != identity_relation(X2) ),
c_0_103,
[final] ).
cnf(c_0_149,plain,
element(esk4_1(X1),powerset(X1)),
c_0_104,
[final] ).
cnf(c_0_150,plain,
( empty(X1)
| ~ empty(esk3_1(X1)) ),
c_0_105,
[final] ).
cnf(c_0_151,plain,
element(esk1_1(X1),X1),
c_0_106,
[final] ).
cnf(c_0_152,plain,
( empty(relation_dom(X1))
| ~ empty(X1) ),
c_0_107,
[final] ).
cnf(c_0_153,plain,
( relation(relation_dom(X1))
| ~ empty(X1) ),
c_0_108,
[final] ).
cnf(c_0_154,plain,
~ empty(powerset(X1)),
c_0_109,
[final] ).
cnf(c_0_155,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
c_0_110,
[final] ).
cnf(c_0_156,plain,
subset(X1,X1),
c_0_111,
[final] ).
cnf(c_0_157,plain,
( relation(X1)
| ~ empty(X1) ),
c_0_112,
[final] ).
cnf(c_0_158,plain,
( function(X1)
| ~ empty(X1) ),
c_0_113,
[final] ).
cnf(c_0_159,plain,
empty(esk4_1(X1)),
c_0_114,
[final] ).
cnf(c_0_160,plain,
relation(identity_relation(X1)),
c_0_115,
[final] ).
cnf(c_0_161,plain,
function(identity_relation(X1)),
c_0_116,
[final] ).
cnf(c_0_162,plain,
relation(identity_relation(X1)),
c_0_117,
[final] ).
cnf(c_0_163,plain,
( X1 = empty_set
| ~ empty(X1) ),
c_0_118,
[final] ).
cnf(c_0_164,plain,
~ empty(esk9_0),
c_0_119,
[final] ).
cnf(c_0_165,plain,
~ empty(esk6_0),
c_0_120,
[final] ).
cnf(c_0_166,plain,
empty(esk8_0),
c_0_121,
[final] ).
cnf(c_0_167,plain,
relation(esk7_0),
c_0_122,
[final] ).
cnf(c_0_168,plain,
relation_empty_yielding(esk7_0),
c_0_123,
[final] ).
cnf(c_0_169,plain,
relation(esk6_0),
c_0_124,
[final] ).
cnf(c_0_170,plain,
empty(esk5_0),
c_0_125,
[final] ).
cnf(c_0_171,plain,
relation(esk5_0),
c_0_126,
[final] ).
cnf(c_0_172,plain,
relation(esk2_0),
c_0_127,
[final] ).
cnf(c_0_173,plain,
function(esk2_0),
c_0_128,
[final] ).
cnf(c_0_174,plain,
empty(empty_set),
c_0_129,
[final] ).
cnf(c_0_175,plain,
empty(empty_set),
c_0_130,
[final] ).
cnf(c_0_176,plain,
relation(empty_set),
c_0_131,
[final] ).
cnf(c_0_177,plain,
relation_empty_yielding(empty_set),
c_0_132,
[final] ).
cnf(c_0_178,plain,
empty(empty_set),
c_0_133,
[final] ).
cnf(c_0_179,plain,
relation(empty_set),
c_0_134,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_135_0,axiom,
( X1 = identity_relation(X2)
| ~ function(X1)
| ~ relation(X1)
| relation_dom(X1) != X2
| apply(X1,sk1_esk10_2(X2,X1)) != sk1_esk10_2(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_135]) ).
cnf(c_0_135_1,axiom,
( ~ function(X1)
| X1 = identity_relation(X2)
| ~ relation(X1)
| relation_dom(X1) != X2
| apply(X1,sk1_esk10_2(X2,X1)) != sk1_esk10_2(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_135]) ).
cnf(c_0_135_2,axiom,
( ~ relation(X1)
| ~ function(X1)
| X1 = identity_relation(X2)
| relation_dom(X1) != X2
| apply(X1,sk1_esk10_2(X2,X1)) != sk1_esk10_2(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_135]) ).
cnf(c_0_135_3,axiom,
( relation_dom(X1) != X2
| ~ relation(X1)
| ~ function(X1)
| X1 = identity_relation(X2)
| apply(X1,sk1_esk10_2(X2,X1)) != sk1_esk10_2(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_135]) ).
cnf(c_0_135_4,axiom,
( apply(X1,sk1_esk10_2(X2,X1)) != sk1_esk10_2(X2,X1)
| relation_dom(X1) != X2
| ~ relation(X1)
| ~ function(X1)
| X1 = identity_relation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_135]) ).
cnf(c_0_136_0,axiom,
( element(X1,X2)
| ~ element(X3,powerset(X2))
| ~ in(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_136]) ).
cnf(c_0_136_1,axiom,
( ~ element(X3,powerset(X2))
| element(X1,X2)
| ~ in(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_136]) ).
cnf(c_0_136_2,axiom,
( ~ in(X1,X3)
| ~ element(X3,powerset(X2))
| element(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_136]) ).
cnf(c_0_137_0,axiom,
( X1 = identity_relation(X2)
| in(sk1_esk10_2(X2,X1),X2)
| ~ function(X1)
| ~ relation(X1)
| relation_dom(X1) != X2 ),
inference(literals_permutation,[status(thm)],[c_0_137]) ).
cnf(c_0_137_1,axiom,
( in(sk1_esk10_2(X2,X1),X2)
| X1 = identity_relation(X2)
| ~ function(X1)
| ~ relation(X1)
| relation_dom(X1) != X2 ),
inference(literals_permutation,[status(thm)],[c_0_137]) ).
cnf(c_0_137_2,axiom,
( ~ function(X1)
| in(sk1_esk10_2(X2,X1),X2)
| X1 = identity_relation(X2)
| ~ relation(X1)
| relation_dom(X1) != X2 ),
inference(literals_permutation,[status(thm)],[c_0_137]) ).
cnf(c_0_137_3,axiom,
( ~ relation(X1)
| ~ function(X1)
| in(sk1_esk10_2(X2,X1),X2)
| X1 = identity_relation(X2)
| relation_dom(X1) != X2 ),
inference(literals_permutation,[status(thm)],[c_0_137]) ).
cnf(c_0_137_4,axiom,
( relation_dom(X1) != X2
| ~ relation(X1)
| ~ function(X1)
| in(sk1_esk10_2(X2,X1),X2)
| X1 = identity_relation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_137]) ).
cnf(c_0_138_0,axiom,
( ~ empty(X1)
| ~ element(X2,powerset(X1))
| ~ in(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_138]) ).
cnf(c_0_138_1,axiom,
( ~ element(X2,powerset(X1))
| ~ empty(X1)
| ~ in(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_138]) ).
cnf(c_0_138_2,axiom,
( ~ in(X3,X2)
| ~ element(X2,powerset(X1))
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_138]) ).
cnf(c_0_139_0,axiom,
( apply(X1,X3) = X3
| ~ function(X1)
| ~ relation(X1)
| X1 != identity_relation(X2)
| ~ in(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_139]) ).
cnf(c_0_139_1,axiom,
( ~ function(X1)
| apply(X1,X3) = X3
| ~ relation(X1)
| X1 != identity_relation(X2)
| ~ in(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_139]) ).
cnf(c_0_139_2,axiom,
( ~ relation(X1)
| ~ function(X1)
| apply(X1,X3) = X3
| X1 != identity_relation(X2)
| ~ in(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_139]) ).
cnf(c_0_139_3,axiom,
( X1 != identity_relation(X2)
| ~ relation(X1)
| ~ function(X1)
| apply(X1,X3) = X3
| ~ in(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_139]) ).
cnf(c_0_139_4,axiom,
( ~ in(X3,X2)
| X1 != identity_relation(X2)
| ~ relation(X1)
| ~ function(X1)
| apply(X1,X3) = X3 ),
inference(literals_permutation,[status(thm)],[c_0_139]) ).
cnf(c_0_140_0,axiom,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_140]) ).
cnf(c_0_140_1,axiom,
( ~ element(X1,powerset(X2))
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_140]) ).
cnf(c_0_141_0,axiom,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_141]) ).
cnf(c_0_141_1,axiom,
( ~ in(X2,X1)
| ~ in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_141]) ).
cnf(c_0_142_0,axiom,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_142]) ).
cnf(c_0_142_1,axiom,
( ~ subset(X1,X2)
| element(X1,powerset(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_142]) ).
cnf(c_0_143_0,axiom,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_143]) ).
cnf(c_0_143_1,axiom,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_143]) ).
cnf(c_0_143_2,axiom,
( ~ element(X1,X2)
| empty(X2)
| in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_143]) ).
cnf(c_0_144_0,axiom,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_144]) ).
cnf(c_0_144_1,axiom,
( ~ in(X1,X2)
| element(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_144]) ).
cnf(c_0_145_0,axiom,
( empty(X1)
| element(sk1_esk3_1(X1),powerset(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_145]) ).
cnf(c_0_145_1,axiom,
( element(sk1_esk3_1(X1),powerset(X1))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_145]) ).
cnf(c_0_146_0,axiom,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_146]) ).
cnf(c_0_146_1,axiom,
( ~ in(X2,X1)
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_146]) ).
cnf(c_0_147_0,axiom,
( empty(X1)
| ~ empty(relation_dom(X1))
| ~ relation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_147]) ).
cnf(c_0_147_1,axiom,
( ~ empty(relation_dom(X1))
| empty(X1)
| ~ relation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_147]) ).
cnf(c_0_147_2,axiom,
( ~ relation(X1)
| ~ empty(relation_dom(X1))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_147]) ).
cnf(c_0_148_0,axiom,
( relation_dom(X1) = X2
| ~ function(X1)
| ~ relation(X1)
| X1 != identity_relation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_148]) ).
cnf(c_0_148_1,axiom,
( ~ function(X1)
| relation_dom(X1) = X2
| ~ relation(X1)
| X1 != identity_relation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_148]) ).
cnf(c_0_148_2,axiom,
( ~ relation(X1)
| ~ function(X1)
| relation_dom(X1) = X2
| X1 != identity_relation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_148]) ).
cnf(c_0_148_3,axiom,
( X1 != identity_relation(X2)
| ~ relation(X1)
| ~ function(X1)
| relation_dom(X1) = X2 ),
inference(literals_permutation,[status(thm)],[c_0_148]) ).
cnf(c_0_150_0,axiom,
( empty(X1)
| ~ empty(sk1_esk3_1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_150]) ).
cnf(c_0_150_1,axiom,
( ~ empty(sk1_esk3_1(X1))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_150]) ).
cnf(c_0_152_0,axiom,
( empty(relation_dom(X1))
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_152]) ).
cnf(c_0_152_1,axiom,
( ~ empty(X1)
| empty(relation_dom(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_152]) ).
cnf(c_0_153_0,axiom,
( relation(relation_dom(X1))
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_153]) ).
cnf(c_0_153_1,axiom,
( ~ empty(X1)
| relation(relation_dom(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_153]) ).
cnf(c_0_155_0,axiom,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_155]) ).
cnf(c_0_155_1,axiom,
( ~ empty(X1)
| X2 = X1
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_155]) ).
cnf(c_0_155_2,axiom,
( ~ empty(X2)
| ~ empty(X1)
| X2 = X1 ),
inference(literals_permutation,[status(thm)],[c_0_155]) ).
cnf(c_0_157_0,axiom,
( relation(X1)
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_157]) ).
cnf(c_0_157_1,axiom,
( ~ empty(X1)
| relation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_157]) ).
cnf(c_0_158_0,axiom,
( function(X1)
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_158]) ).
cnf(c_0_158_1,axiom,
( ~ empty(X1)
| function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_158]) ).
cnf(c_0_163_0,axiom,
( X1 = empty_set
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_163]) ).
cnf(c_0_163_1,axiom,
( ~ empty(X1)
| X1 = empty_set ),
inference(literals_permutation,[status(thm)],[c_0_163]) ).
cnf(c_0_154_0,axiom,
~ empty(powerset(X1)),
inference(literals_permutation,[status(thm)],[c_0_154]) ).
cnf(c_0_164_0,axiom,
~ empty(sk1_esk9_0),
inference(literals_permutation,[status(thm)],[c_0_164]) ).
cnf(c_0_165_0,axiom,
~ empty(sk1_esk6_0),
inference(literals_permutation,[status(thm)],[c_0_165]) ).
cnf(c_0_149_0,axiom,
element(sk1_esk4_1(X1),powerset(X1)),
inference(literals_permutation,[status(thm)],[c_0_149]) ).
cnf(c_0_151_0,axiom,
element(sk1_esk1_1(X1),X1),
inference(literals_permutation,[status(thm)],[c_0_151]) ).
cnf(c_0_156_0,axiom,
subset(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_156]) ).
cnf(c_0_159_0,axiom,
empty(sk1_esk4_1(X1)),
inference(literals_permutation,[status(thm)],[c_0_159]) ).
cnf(c_0_160_0,axiom,
relation(identity_relation(X1)),
inference(literals_permutation,[status(thm)],[c_0_160]) ).
cnf(c_0_161_0,axiom,
function(identity_relation(X1)),
inference(literals_permutation,[status(thm)],[c_0_161]) ).
cnf(c_0_162_0,axiom,
relation(identity_relation(X1)),
inference(literals_permutation,[status(thm)],[c_0_162]) ).
cnf(c_0_166_0,axiom,
empty(sk1_esk8_0),
inference(literals_permutation,[status(thm)],[c_0_166]) ).
cnf(c_0_167_0,axiom,
relation(sk1_esk7_0),
inference(literals_permutation,[status(thm)],[c_0_167]) ).
cnf(c_0_168_0,axiom,
relation_empty_yielding(sk1_esk7_0),
inference(literals_permutation,[status(thm)],[c_0_168]) ).
cnf(c_0_169_0,axiom,
relation(sk1_esk6_0),
inference(literals_permutation,[status(thm)],[c_0_169]) ).
cnf(c_0_170_0,axiom,
empty(sk1_esk5_0),
inference(literals_permutation,[status(thm)],[c_0_170]) ).
cnf(c_0_171_0,axiom,
relation(sk1_esk5_0),
inference(literals_permutation,[status(thm)],[c_0_171]) ).
cnf(c_0_172_0,axiom,
relation(sk1_esk2_0),
inference(literals_permutation,[status(thm)],[c_0_172]) ).
cnf(c_0_173_0,axiom,
function(sk1_esk2_0),
inference(literals_permutation,[status(thm)],[c_0_173]) ).
cnf(c_0_174_0,axiom,
empty(empty_set),
inference(literals_permutation,[status(thm)],[c_0_174]) ).
cnf(c_0_175_0,axiom,
empty(empty_set),
inference(literals_permutation,[status(thm)],[c_0_175]) ).
cnf(c_0_176_0,axiom,
relation(empty_set),
inference(literals_permutation,[status(thm)],[c_0_176]) ).
cnf(c_0_177_0,axiom,
relation_empty_yielding(empty_set),
inference(literals_permutation,[status(thm)],[c_0_177]) ).
cnf(c_0_178_0,axiom,
empty(empty_set),
inference(literals_permutation,[status(thm)],[c_0_178]) ).
cnf(c_0_179_0,axiom,
relation(empty_set),
inference(literals_permutation,[status(thm)],[c_0_179]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1,X2] :
( in(X2,X1)
=> apply(identity_relation(X1),X2) = X2 ),
file('<stdin>',t35_funct_1) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1,X2] :
( in(X2,X1)
=> apply(identity_relation(X1),X2) = X2 ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
( in(esk2_0,esk1_0)
& apply(identity_relation(esk1_0),esk2_0) != esk2_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,
apply(identity_relation(esk1_0),esk2_0) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
in(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
apply(identity_relation(esk1_0),esk2_0) != esk2_0,
c_0_3,
[final] ).
cnf(c_0_6_007,negated_conjecture,
in(esk2_0,esk1_0),
c_0_4,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_83,negated_conjecture,
in(sk2_esk2_0,sk2_esk1_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_aa042c.p',c_0_6) ).
cnf(c_111,negated_conjecture,
in(sk2_esk2_0,sk2_esk1_0),
inference(copy,[status(esa)],[c_83]) ).
cnf(c_118,negated_conjecture,
in(sk2_esk2_0,sk2_esk1_0),
inference(copy,[status(esa)],[c_111]) ).
cnf(c_119,negated_conjecture,
in(sk2_esk2_0,sk2_esk1_0),
inference(copy,[status(esa)],[c_118]) ).
cnf(c_122,negated_conjecture,
in(sk2_esk2_0,sk2_esk1_0),
inference(copy,[status(esa)],[c_119]) ).
cnf(c_373,negated_conjecture,
in(sk2_esk2_0,sk2_esk1_0),
inference(copy,[status(esa)],[c_122]) ).
cnf(c_61,plain,
( apply(X0,X1) = X1
| ~ function(X0)
| ~ relation(X0)
| X0 != identity_relation(X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_aa042c.p',c_0_139_4) ).
cnf(c_329,plain,
( apply(X0,X1) = X1
| ~ function(X0)
| ~ relation(X0)
| X0 != identity_relation(X2)
| ~ in(X1,X2) ),
inference(copy,[status(esa)],[c_61]) ).
cnf(c_330,plain,
( ~ relation(X0)
| ~ function(X0)
| ~ in(X1,X2)
| apply(X0,X1) = X1
| X0 != identity_relation(X2) ),
inference(rewriting,[status(thm)],[c_329]) ).
cnf(c_385,plain,
( ~ relation(X0)
| ~ function(X0)
| apply(X0,sk2_esk2_0) = sk2_esk2_0
| X0 != identity_relation(sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_373,c_330]) ).
cnf(c_386,plain,
( ~ relation(X0)
| ~ function(X0)
| apply(X0,sk2_esk2_0) = sk2_esk2_0
| X0 != identity_relation(sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_385]) ).
cnf(c_82,negated_conjecture,
apply(identity_relation(sk2_esk1_0),sk2_esk2_0) != sk2_esk2_0,
file('/export/starexec/sandbox/tmp/iprover_modulo_aa042c.p',c_0_5) ).
cnf(c_109,negated_conjecture,
apply(identity_relation(sk2_esk1_0),sk2_esk2_0) != sk2_esk2_0,
inference(copy,[status(esa)],[c_82]) ).
cnf(c_117,negated_conjecture,
apply(identity_relation(sk2_esk1_0),sk2_esk2_0) != sk2_esk2_0,
inference(copy,[status(esa)],[c_109]) ).
cnf(c_120,negated_conjecture,
apply(identity_relation(sk2_esk1_0),sk2_esk2_0) != sk2_esk2_0,
inference(copy,[status(esa)],[c_117]) ).
cnf(c_121,negated_conjecture,
apply(identity_relation(sk2_esk1_0),sk2_esk2_0) != sk2_esk2_0,
inference(copy,[status(esa)],[c_120]) ).
cnf(c_371,negated_conjecture,
apply(identity_relation(sk2_esk1_0),sk2_esk2_0) != sk2_esk2_0,
inference(copy,[status(esa)],[c_121]) ).
cnf(c_411,plain,
( ~ relation(identity_relation(sk2_esk1_0))
| ~ function(identity_relation(sk2_esk1_0))
| identity_relation(sk2_esk1_0) != identity_relation(sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_386,c_371]) ).
cnf(c_412,plain,
( ~ relation(identity_relation(sk2_esk1_0))
| ~ function(identity_relation(sk2_esk1_0))
| identity_relation(sk2_esk1_0) != identity_relation(sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_411]) ).
cnf(c_413,plain,
( ~ relation(identity_relation(sk2_esk1_0))
| ~ function(identity_relation(sk2_esk1_0)) ),
inference(equality_resolution_simp,[status(esa)],[c_412]) ).
cnf(c_15,plain,
function(identity_relation(X0)),
file('/export/starexec/sandbox/tmp/iprover_modulo_aa042c.p',c_0_161_0) ).
cnf(c_237,plain,
function(identity_relation(X0)),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_14,plain,
relation(identity_relation(X0)),
file('/export/starexec/sandbox/tmp/iprover_modulo_aa042c.p',c_0_162_0) ).
cnf(c_235,plain,
relation(identity_relation(X0)),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_416,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_413,c_237,c_235]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU217+3 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 20:38:54 EDT 2022
% 0.18/0.34 % CPUTime :
% 0.18/0.34 % Running in mono-core mode
% 0.18/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.18/0.40 % FOF problem with conjecture
% 0.18/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_141537.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_aa042c.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_7b3e0f | grep -v "SZS"
% 0.19/0.43
% 0.19/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.43
% 0.19/0.43 %
% 0.19/0.43 % ------ iProver source info
% 0.19/0.43
% 0.19/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.43 % git: non_committed_changes: true
% 0.19/0.43 % git: last_make_outside_of_git: true
% 0.19/0.43
% 0.19/0.43 %
% 0.19/0.43 % ------ Input Options
% 0.19/0.43
% 0.19/0.43 % --out_options all
% 0.19/0.43 % --tptp_safe_out true
% 0.19/0.43 % --problem_path ""
% 0.19/0.43 % --include_path ""
% 0.19/0.43 % --clausifier .//eprover
% 0.19/0.43 % --clausifier_options --tstp-format
% 0.19/0.43 % --stdin false
% 0.19/0.43 % --dbg_backtrace false
% 0.19/0.43 % --dbg_dump_prop_clauses false
% 0.19/0.43 % --dbg_dump_prop_clauses_file -
% 0.19/0.43 % --dbg_out_stat false
% 0.19/0.43
% 0.19/0.43 % ------ General Options
% 0.19/0.43
% 0.19/0.43 % --fof false
% 0.19/0.43 % --time_out_real 150.
% 0.19/0.43 % --time_out_prep_mult 0.2
% 0.19/0.43 % --time_out_virtual -1.
% 0.19/0.43 % --schedule none
% 0.19/0.43 % --ground_splitting input
% 0.19/0.43 % --splitting_nvd 16
% 0.19/0.43 % --non_eq_to_eq false
% 0.19/0.43 % --prep_gs_sim true
% 0.19/0.43 % --prep_unflatten false
% 0.19/0.43 % --prep_res_sim true
% 0.19/0.43 % --prep_upred true
% 0.19/0.43 % --res_sim_input true
% 0.19/0.43 % --clause_weak_htbl true
% 0.19/0.43 % --gc_record_bc_elim false
% 0.19/0.43 % --symbol_type_check false
% 0.19/0.43 % --clausify_out false
% 0.19/0.43 % --large_theory_mode false
% 0.19/0.43 % --prep_sem_filter none
% 0.19/0.43 % --prep_sem_filter_out false
% 0.19/0.43 % --preprocessed_out false
% 0.19/0.43 % --sub_typing false
% 0.19/0.43 % --brand_transform false
% 0.19/0.43 % --pure_diseq_elim true
% 0.19/0.43 % --min_unsat_core false
% 0.19/0.43 % --pred_elim true
% 0.19/0.43 % --add_important_lit false
% 0.19/0.43 % --soft_assumptions false
% 0.19/0.43 % --reset_solvers false
% 0.19/0.43 % --bc_imp_inh []
% 0.19/0.43 % --conj_cone_tolerance 1.5
% 0.19/0.43 % --prolific_symb_bound 500
% 0.19/0.43 % --lt_threshold 2000
% 0.19/0.43
% 0.19/0.43 % ------ SAT Options
% 0.19/0.43
% 0.19/0.43 % --sat_mode false
% 0.19/0.43 % --sat_fm_restart_options ""
% 0.19/0.43 % --sat_gr_def false
% 0.19/0.43 % --sat_epr_types true
% 0.19/0.43 % --sat_non_cyclic_types false
% 0.19/0.43 % --sat_finite_models false
% 0.19/0.43 % --sat_fm_lemmas false
% 0.19/0.43 % --sat_fm_prep false
% 0.19/0.43 % --sat_fm_uc_incr true
% 0.19/0.43 % --sat_out_model small
% 0.19/0.43 % --sat_out_clauses false
% 0.19/0.43
% 0.19/0.43 % ------ QBF Options
% 0.19/0.43
% 0.19/0.43 % --qbf_mode false
% 0.19/0.43 % --qbf_elim_univ true
% 0.19/0.43 % --qbf_sk_in true
% 0.19/0.43 % --qbf_pred_elim true
% 0.19/0.43 % --qbf_split 32
% 0.19/0.43
% 0.19/0.43 % ------ BMC1 Options
% 0.19/0.43
% 0.19/0.43 % --bmc1_incremental false
% 0.19/0.43 % --bmc1_axioms reachable_all
% 0.19/0.43 % --bmc1_min_bound 0
% 0.19/0.43 % --bmc1_max_bound -1
% 0.19/0.43 % --bmc1_max_bound_default -1
% 0.19/0.43 % --bmc1_symbol_reachability true
% 0.19/0.43 % --bmc1_property_lemmas false
% 0.19/0.43 % --bmc1_k_induction false
% 0.19/0.43 % --bmc1_non_equiv_states false
% 0.19/0.43 % --bmc1_deadlock false
% 0.19/0.43 % --bmc1_ucm false
% 0.19/0.43 % --bmc1_add_unsat_core none
% 0.19/0.43 % --bmc1_unsat_core_children false
% 0.19/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.43 % --bmc1_out_stat full
% 0.19/0.43 % --bmc1_ground_init false
% 0.19/0.43 % --bmc1_pre_inst_next_state false
% 0.19/0.43 % --bmc1_pre_inst_state false
% 0.19/0.43 % --bmc1_pre_inst_reach_state false
% 0.19/0.43 % --bmc1_out_unsat_core false
% 0.19/0.43 % --bmc1_aig_witness_out false
% 0.19/0.43 % --bmc1_verbose false
% 0.19/0.43 % --bmc1_dump_clauses_tptp false
% 0.19/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.44 % --bmc1_dump_file -
% 0.19/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.44 % --bmc1_ucm_extend_mode 1
% 0.19/0.44 % --bmc1_ucm_init_mode 2
% 0.19/0.44 % --bmc1_ucm_cone_mode none
% 0.19/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.44 % --bmc1_ucm_relax_model 4
% 0.19/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.44 % --bmc1_ucm_layered_model none
% 0.19/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.44
% 0.19/0.44 % ------ AIG Options
% 0.19/0.44
% 0.19/0.44 % --aig_mode false
% 0.19/0.44
% 0.19/0.44 % ------ Instantiation Options
% 0.19/0.44
% 0.19/0.44 % --instantiation_flag true
% 0.19/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.44 % --inst_solver_per_active 750
% 0.19/0.44 % --inst_solver_calls_frac 0.5
% 0.19/0.44 % --inst_passive_queue_type priority_queues
% 0.19/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.44 % --inst_passive_queues_freq [25;2]
% 0.19/0.44 % --inst_dismatching true
% 0.19/0.44 % --inst_eager_unprocessed_to_passive true
% 0.19/0.44 % --inst_prop_sim_given true
% 0.19/0.44 % --inst_prop_sim_new false
% 0.19/0.44 % --inst_orphan_elimination true
% 0.19/0.44 % --inst_learning_loop_flag true
% 0.19/0.44 % --inst_learning_start 3000
% 0.19/0.44 % --inst_learning_factor 2
% 0.19/0.44 % --inst_start_prop_sim_after_learn 3
% 0.19/0.44 % --inst_sel_renew solver
% 0.19/0.44 % --inst_lit_activity_flag true
% 0.19/0.44 % --inst_out_proof true
% 0.19/0.44
% 0.19/0.44 % ------ Resolution Options
% 0.19/0.44
% 0.19/0.44 % --resolution_flag true
% 0.19/0.44 % --res_lit_sel kbo_max
% 0.19/0.44 % --res_to_prop_solver none
% 0.19/0.44 % --res_prop_simpl_new false
% 0.19/0.44 % --res_prop_simpl_given false
% 0.19/0.44 % --res_passive_queue_type priority_queues
% 0.19/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.44 % --res_passive_queues_freq [15;5]
% 0.19/0.44 % --res_forward_subs full
% 0.19/0.44 % --res_backward_subs full
% 0.19/0.44 % --res_forward_subs_resolution true
% 0.19/0.44 % --res_backward_subs_resolution true
% 0.19/0.44 % --res_orphan_elimination false
% 0.19/0.44 % --res_time_limit 1000.
% 0.19/0.44 % --res_out_proof true
% 0.19/0.44 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_141537.s
% 0.19/0.44 % --modulo true
% 0.19/0.44
% 0.19/0.44 % ------ Combination Options
% 0.19/0.44
% 0.19/0.44 % --comb_res_mult 1000
% 0.19/0.44 % --comb_inst_mult 300
% 0.19/0.44 % ------
% 0.19/0.44
% 0.19/0.44 % ------ Parsing...% successful
% 0.19/0.44
% 0.19/0.44 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.19/0.44
% 0.19/0.44 % ------ Proving...
% 0.19/0.44 % ------ Problem Properties
% 0.19/0.44
% 0.19/0.44 %
% 0.19/0.44 % EPR false
% 0.19/0.44 % Horn false
% 0.19/0.44 % Has equality true
% 0.19/0.44
% 0.19/0.44 % % ------ Input Options Time Limit: Unbounded
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 % % ------ Current options:
% 0.19/0.44
% 0.19/0.44 % ------ Input Options
% 0.19/0.44
% 0.19/0.44 % --out_options all
% 0.19/0.44 % --tptp_safe_out true
% 0.19/0.44 % --problem_path ""
% 0.19/0.44 % --include_path ""
% 0.19/0.44 % --clausifier .//eprover
% 0.19/0.44 % --clausifier_options --tstp-format
% 0.19/0.44 % --stdin false
% 0.19/0.44 % --dbg_backtrace false
% 0.19/0.44 % --dbg_dump_prop_clauses false
% 0.19/0.44 % --dbg_dump_prop_clauses_file -
% 0.19/0.44 % --dbg_out_stat false
% 0.19/0.44
% 0.19/0.44 % ------ General Options
% 0.19/0.44
% 0.19/0.44 % --fof false
% 0.19/0.44 % --time_out_real 150.
% 0.19/0.44 % --time_out_prep_mult 0.2
% 0.19/0.44 % --time_out_virtual -1.
% 0.19/0.44 % --schedule none
% 0.19/0.44 % --ground_splitting input
% 0.19/0.44 % --splitting_nvd 16
% 0.19/0.44 % --non_eq_to_eq false
% 0.19/0.44 % --prep_gs_sim true
% 0.19/0.44 % --prep_unflatten false
% 0.19/0.44 % --prep_res_sim true
% 0.19/0.44 % --prep_upred true
% 0.19/0.44 % --res_sim_input true
% 0.19/0.44 % --clause_weak_htbl true
% 0.19/0.44 % --gc_record_bc_elim false
% 0.19/0.44 % --symbol_type_check false
% 0.19/0.44 % --clausify_out false
% 0.19/0.44 % --large_theory_mode false
% 0.19/0.44 % --prep_sem_filter none
% 0.19/0.44 % --prep_sem_filter_out false
% 0.19/0.44 % --preprocessed_out false
% 0.19/0.44 % --sub_typing false
% 0.19/0.44 % --brand_transform false
% 0.19/0.44 % --pure_diseq_elim true
% 0.19/0.44 % --min_unsat_core false
% 0.19/0.44 % --pred_elim true
% 0.19/0.44 % --add_important_lit false
% 0.19/0.44 % --soft_assumptions false
% 0.19/0.44 % --reset_solvers false
% 0.19/0.44 % --bc_imp_inh []
% 0.19/0.44 % --conj_cone_tolerance 1.5
% 0.19/0.44 % --prolific_symb_bound 500
% 0.19/0.44 % --lt_threshold 2000
% 0.19/0.44
% 0.19/0.44 % ------ SAT Options
% 0.19/0.44
% 0.19/0.44 % --sat_mode false
% 0.19/0.44 % --sat_fm_restart_options ""
% 0.19/0.44 % --sat_gr_def false
% 0.19/0.44 % --sat_epr_types true
% 0.19/0.44 % --sat_non_cyclic_types false
% 0.19/0.44 % --sat_finite_models false
% 0.19/0.44 % --sat_fm_lemmas false
% 0.19/0.44 % --sat_fm_prep false
% 0.19/0.44 % --sat_fm_uc_incr true
% 0.19/0.44 % --sat_out_model small
% 0.19/0.44 % --sat_out_clauses false
% 0.19/0.44
% 0.19/0.44 % ------ QBF Options
% 0.19/0.44
% 0.19/0.44 % --qbf_mode false
% 0.19/0.44 % --qbf_elim_univ true
% 0.19/0.44 % --qbf_sk_in true
% 0.19/0.44 % --qbf_pred_elim true
% 0.19/0.44 % --qbf_split 32
% 0.19/0.44
% 0.19/0.44 % ------ BMC1 Options
% 0.19/0.44
% 0.19/0.44 % --bmc1_incremental false
% 0.19/0.44 % --bmc1_axioms reachable_all
% 0.19/0.44 % --bmc1_min_bound 0
% 0.19/0.44 % --bmc1_max_bound -1
% 0.19/0.44 % --bmc1_max_bound_default -1
% 0.19/0.44 % --bmc1_symbol_reachability true
% 0.19/0.44 % --bmc1_property_lemmas false
% 0.19/0.44 % --bmc1_k_induction false
% 0.19/0.44 % --bmc1_non_equiv_states false
% 0.19/0.44 % --bmc1_deadlock false
% 0.19/0.44 % --bmc1_ucm false
% 0.19/0.44 % --bmc1_add_unsat_core none
% 0.19/0.44 % --bmc1_unsat_core_children false
% 0.19/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.44 % --bmc1_out_stat full
% 0.19/0.44 % --bmc1_ground_init false
% 0.19/0.44 % --bmc1_pre_inst_next_state false
% 0.19/0.44 % --bmc1_pre_inst_state false
% 0.19/0.44 % --bmc1_pre_inst_reach_state false
% 0.19/0.44 % --bmc1_out_unsat_core false
% 0.19/0.44 % --bmc1_aig_witness_out false
% 0.19/0.44 % --bmc1_verbose false
% 0.19/0.44 % --bmc1_dump_clauses_tptp false
% 0.19/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.44 % --bmc1_dump_file -
% 0.19/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.44 % --bmc1_ucm_extend_mode 1
% 0.19/0.44 % --bmc1_ucm_init_mode 2
% 0.19/0.44 % --bmc1_ucm_cone_mode none
% 0.19/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.44 % --bmc1_ucm_relax_model 4
% 0.19/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.44 % --bmc1_ucm_layered_model none
% 0.19/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.44
% 0.19/0.44 % ------ AIG Options
% 0.19/0.44
% 0.19/0.44 % --aig_mode false
% 0.19/0.44
% 0.19/0.44 % ------ Instantiation Options
% 0.19/0.44
% 0.19/0.44 % --instantiation_flag true
% 0.19/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.44 % --inst_solver_per_active 750
% 0.19/0.44 % --inst_solver_calls_frac 0.5
% 0.19/0.44 % --inst_passive_queue_type priority_queues
% 0.19/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.44 % --inst_passive_queues_freq [25;2]
% 0.19/0.44 % --inst_dismatching true
% 0.19/0.44 % --inst_eager_unprocessed_to_passive true
% 0.19/0.44 % --inst_prop_sim_given true
% 150.20/150.43 % --inst_prop_sim_new false
% 150.20/150.43 % --inst_orphan_elimination true
% 150.20/150.43 % --inst_learning_loop_flag true
% 150.20/150.43 % --inst_learning_start 3000
% 150.20/150.43 % --inst_learning_factor 2
% 150.20/150.43 % --inst_start_prop_sim_after_learn 3
% 150.20/150.43 % --inst_sel_renew solver
% 150.20/150.43 % --inst_lit_activity_flag true
% 150.20/150.43 % --inst_out_proof true
% 150.20/150.43
% 150.20/150.43 % ------ Resolution Options
% 150.20/150.43
% 150.20/150.43 % --resolution_flag true
% 150.20/150.43 % --res_lit_sel kbo_max
% 150.20/150.43 % --res_to_prop_solver none
% 150.20/150.43 % --res_prop_simpl_new false
% 150.20/150.43 % --res_prop_simpl_given false
% 150.20/150.43 % --res_passive_queue_type priority_queues
% 150.20/150.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.20/150.43 % --res_passive_queues_freq [15;5]
% 150.20/150.43 % --res_forward_subs full
% 150.20/150.43 % --res_backward_subs full
% 150.20/150.43 % --res_forward_subs_resolution true
% 150.20/150.43 % --res_backward_subs_resolution true
% 150.20/150.43 % --res_orphan_elimination false
% 150.20/150.43 % --res_time_limit 1000.
% 150.20/150.43 % --res_out_proof true
% 150.20/150.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_141537.s
% 150.20/150.43 % --modulo true
% 150.20/150.43
% 150.20/150.43 % ------ Combination Options
% 150.20/150.43
% 150.20/150.43 % --comb_res_mult 1000
% 150.20/150.43 % --comb_inst_mult 300
% 150.20/150.43 % ------
% 150.20/150.43
% 150.20/150.43
% 150.20/150.43
% 150.20/150.43 % ------ Proving...
% 150.20/150.43 %
% 150.20/150.43
% 150.20/150.43
% 150.20/150.43 % Time Out Real
% 150.20/150.43
% 150.20/150.43 % ------ Statistics
% 150.20/150.43
% 150.20/150.43 % ------ General
% 150.20/150.43
% 150.20/150.43 % num_of_input_clauses: 67
% 150.20/150.43 % num_of_input_neg_conjectures: 2
% 150.20/150.43 % num_of_splits: 0
% 150.20/150.43 % num_of_split_atoms: 0
% 150.20/150.43 % num_of_sem_filtered_clauses: 0
% 150.20/150.43 % num_of_subtypes: 0
% 150.20/150.43 % monotx_restored_types: 0
% 150.20/150.43 % sat_num_of_epr_types: 0
% 150.20/150.43 % sat_num_of_non_cyclic_types: 0
% 150.20/150.43 % sat_guarded_non_collapsed_types: 0
% 150.20/150.43 % is_epr: 0
% 150.20/150.43 % is_horn: 0
% 150.20/150.43 % has_eq: 1
% 150.20/150.43 % num_pure_diseq_elim: 0
% 150.20/150.43 % simp_replaced_by: 0
% 150.20/150.43 % res_preprocessed: 4
% 150.20/150.43 % prep_upred: 0
% 150.20/150.43 % prep_unflattend: 0
% 150.20/150.43 % pred_elim_cands: 0
% 150.20/150.43 % pred_elim: 0
% 150.20/150.43 % pred_elim_cl: 0
% 150.20/150.43 % pred_elim_cycles: 0
% 150.20/150.43 % forced_gc_time: 0
% 150.20/150.43 % gc_basic_clause_elim: 0
% 150.20/150.43 % parsing_time: 0.003
% 150.20/150.43 % sem_filter_time: 0.
% 150.20/150.43 % pred_elim_time: 0.
% 150.20/150.43 % out_proof_time: 0.
% 150.20/150.43 % monotx_time: 0.
% 150.20/150.43 % subtype_inf_time: 0.
% 150.20/150.43 % unif_index_cands_time: 0.004
% 150.20/150.43 % unif_index_add_time: 0.173
% 150.20/150.43 % total_time: 150.017
% 150.20/150.43 % num_of_symbols: 49
% 150.20/150.43 % num_of_terms: 11280
% 150.20/150.43
% 150.20/150.43 % ------ Propositional Solver
% 150.20/150.43
% 150.20/150.43 % prop_solver_calls: 8
% 150.20/150.43 % prop_fast_solver_calls: 6
% 150.20/150.43 % prop_num_of_clauses: 1152
% 150.20/150.43 % prop_preprocess_simplified: 1076
% 150.20/150.43 % prop_fo_subsumed: 0
% 150.20/150.43 % prop_solver_time: 0.
% 150.20/150.43 % prop_fast_solver_time: 0.
% 150.20/150.43 % prop_unsat_core_time: 0.
% 150.20/150.43
% 150.20/150.43 % ------ QBF
% 150.20/150.43
% 150.20/150.43 % qbf_q_res: 0
% 150.20/150.43 % qbf_num_tautologies: 0
% 150.20/150.43 % qbf_prep_cycles: 0
% 150.20/150.43
% 150.20/150.43 % ------ BMC1
% 150.20/150.43
% 150.20/150.43 % bmc1_current_bound: -1
% 150.20/150.43 % bmc1_last_solved_bound: -1
% 150.20/150.43 % bmc1_unsat_core_size: -1
% 150.20/150.43 % bmc1_unsat_core_parents_size: -1
% 150.20/150.43 % bmc1_merge_next_fun: 0
% 150.20/150.43 % bmc1_unsat_core_clauses_time: 0.
% 150.20/150.43
% 150.20/150.43 % ------ Instantiation
% 150.20/150.43
% 150.20/150.43 % inst_num_of_clauses: 768
% 150.20/150.43 % inst_num_in_passive: 39
% 150.20/150.43 % inst_num_in_active: 495
% 150.20/150.43 % inst_num_in_unprocessed: 234
% 150.20/150.43 % inst_num_of_loops: 600
% 150.20/150.43 % inst_num_of_learning_restarts: 0
% 150.20/150.43 % inst_num_moves_active_passive: 103
% 150.20/150.43 % inst_lit_activity: 184
% 150.20/150.43 % inst_lit_activity_moves: 0
% 150.20/150.43 % inst_num_tautologies: 0
% 150.20/150.43 % inst_num_prop_implied: 0
% 150.20/150.43 % inst_num_existing_simplified: 0
% 150.20/150.43 % inst_num_eq_res_simplified: 0
% 150.20/150.43 % inst_num_child_elim: 0
% 150.20/150.43 % inst_num_of_dismatching_blockings: 243
% 150.20/150.43 % inst_num_of_non_proper_insts: 699
% 150.20/150.43 % inst_num_of_duplicates: 651
% 150.20/150.43 % inst_inst_num_from_inst_to_res: 0
% 150.20/150.43 % inst_dismatching_checking_time: 0.001
% 150.20/150.43
% 150.20/150.43 % ------ Resolution
% 150.20/150.43
% 150.20/150.43 % res_num_of_clauses: 2279
% 150.20/150.43 % res_num_in_passive: 3
% 150.20/150.43 % res_num_in_active: 2244
% 150.20/150.43 % res_num_of_loops: 2937
% 150.20/150.43 % res_forward_subset_subsumed: 23
% 150.20/150.43 % res_backward_subset_subsumed: 0
% 150.20/150.43 % res_forward_subsumed: 734
% 150.20/150.43 % res_backward_subsumed: 0
% 150.20/150.43 % res_forward_subsumption_resolution: 0
% 150.20/150.43 % res_backward_subsumption_resolution: 0
% 150.20/150.43 % res_clause_to_clause_subsumption: 5132
% 150.20/150.43 % res_orphan_elimination: 0
% 150.20/150.43 % res_tautology_del: 0
% 150.20/150.43 % res_num_eq_res_simplified: 0
% 150.20/150.43 % res_num_sel_changes: 0
% 150.20/150.43 % res_moves_from_active_to_pass: 0
% 150.20/150.43
% 150.20/150.43 % Status Unknown
% 150.20/150.47 % Orienting using strategy ClausalAll
% 150.20/150.47 % FOF problem with conjecture
% 150.20/150.47 % 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_141537.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_aa042c.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_9194cf | grep -v "SZS"
% 150.31/150.49
% 150.31/150.49 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 150.31/150.49
% 150.31/150.49 %
% 150.31/150.49 % ------ iProver source info
% 150.31/150.49
% 150.31/150.49 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 150.31/150.49 % git: non_committed_changes: true
% 150.31/150.49 % git: last_make_outside_of_git: true
% 150.31/150.49
% 150.31/150.49 %
% 150.31/150.49 % ------ Input Options
% 150.31/150.49
% 150.31/150.49 % --out_options all
% 150.31/150.49 % --tptp_safe_out true
% 150.31/150.49 % --problem_path ""
% 150.31/150.49 % --include_path ""
% 150.31/150.49 % --clausifier .//eprover
% 150.31/150.49 % --clausifier_options --tstp-format
% 150.31/150.49 % --stdin false
% 150.31/150.49 % --dbg_backtrace false
% 150.31/150.49 % --dbg_dump_prop_clauses false
% 150.31/150.49 % --dbg_dump_prop_clauses_file -
% 150.31/150.49 % --dbg_out_stat false
% 150.31/150.49
% 150.31/150.49 % ------ General Options
% 150.31/150.49
% 150.31/150.49 % --fof false
% 150.31/150.49 % --time_out_real 150.
% 150.31/150.49 % --time_out_prep_mult 0.2
% 150.31/150.49 % --time_out_virtual -1.
% 150.31/150.49 % --schedule none
% 150.31/150.49 % --ground_splitting input
% 150.31/150.49 % --splitting_nvd 16
% 150.31/150.49 % --non_eq_to_eq false
% 150.31/150.49 % --prep_gs_sim true
% 150.31/150.49 % --prep_unflatten false
% 150.31/150.49 % --prep_res_sim true
% 150.31/150.49 % --prep_upred true
% 150.31/150.49 % --res_sim_input true
% 150.31/150.49 % --clause_weak_htbl true
% 150.31/150.49 % --gc_record_bc_elim false
% 150.31/150.49 % --symbol_type_check false
% 150.31/150.49 % --clausify_out false
% 150.31/150.49 % --large_theory_mode false
% 150.31/150.49 % --prep_sem_filter none
% 150.31/150.49 % --prep_sem_filter_out false
% 150.31/150.49 % --preprocessed_out false
% 150.31/150.49 % --sub_typing false
% 150.31/150.49 % --brand_transform false
% 150.31/150.49 % --pure_diseq_elim true
% 150.31/150.49 % --min_unsat_core false
% 150.31/150.49 % --pred_elim true
% 150.31/150.49 % --add_important_lit false
% 150.31/150.49 % --soft_assumptions false
% 150.31/150.49 % --reset_solvers false
% 150.31/150.49 % --bc_imp_inh []
% 150.31/150.49 % --conj_cone_tolerance 1.5
% 150.31/150.49 % --prolific_symb_bound 500
% 150.31/150.49 % --lt_threshold 2000
% 150.31/150.49
% 150.31/150.49 % ------ SAT Options
% 150.31/150.49
% 150.31/150.49 % --sat_mode false
% 150.31/150.49 % --sat_fm_restart_options ""
% 150.31/150.49 % --sat_gr_def false
% 150.31/150.49 % --sat_epr_types true
% 150.31/150.49 % --sat_non_cyclic_types false
% 150.31/150.49 % --sat_finite_models false
% 150.31/150.49 % --sat_fm_lemmas false
% 150.31/150.49 % --sat_fm_prep false
% 150.31/150.49 % --sat_fm_uc_incr true
% 150.31/150.49 % --sat_out_model small
% 150.31/150.49 % --sat_out_clauses false
% 150.31/150.49
% 150.31/150.49 % ------ QBF Options
% 150.31/150.49
% 150.31/150.49 % --qbf_mode false
% 150.31/150.49 % --qbf_elim_univ true
% 150.31/150.49 % --qbf_sk_in true
% 150.31/150.49 % --qbf_pred_elim true
% 150.31/150.49 % --qbf_split 32
% 150.31/150.49
% 150.31/150.49 % ------ BMC1 Options
% 150.31/150.49
% 150.31/150.49 % --bmc1_incremental false
% 150.31/150.49 % --bmc1_axioms reachable_all
% 150.31/150.49 % --bmc1_min_bound 0
% 150.31/150.49 % --bmc1_max_bound -1
% 150.31/150.49 % --bmc1_max_bound_default -1
% 150.31/150.49 % --bmc1_symbol_reachability true
% 150.31/150.49 % --bmc1_property_lemmas false
% 150.31/150.49 % --bmc1_k_induction false
% 150.31/150.49 % --bmc1_non_equiv_states false
% 150.31/150.49 % --bmc1_deadlock false
% 150.31/150.49 % --bmc1_ucm false
% 150.31/150.49 % --bmc1_add_unsat_core none
% 150.31/150.49 % --bmc1_unsat_core_children false
% 150.31/150.49 % --bmc1_unsat_core_extrapolate_axioms false
% 150.31/150.49 % --bmc1_out_stat full
% 150.31/150.49 % --bmc1_ground_init false
% 150.31/150.49 % --bmc1_pre_inst_next_state false
% 150.31/150.49 % --bmc1_pre_inst_state false
% 150.31/150.49 % --bmc1_pre_inst_reach_state false
% 150.31/150.49 % --bmc1_out_unsat_core false
% 150.31/150.49 % --bmc1_aig_witness_out false
% 150.31/150.49 % --bmc1_verbose false
% 150.31/150.49 % --bmc1_dump_clauses_tptp false
% 150.31/150.50 % --bmc1_dump_unsat_core_tptp false
% 150.31/150.50 % --bmc1_dump_file -
% 150.31/150.50 % --bmc1_ucm_expand_uc_limit 128
% 150.31/150.50 % --bmc1_ucm_n_expand_iterations 6
% 150.31/150.50 % --bmc1_ucm_extend_mode 1
% 150.31/150.50 % --bmc1_ucm_init_mode 2
% 150.31/150.50 % --bmc1_ucm_cone_mode none
% 150.31/150.50 % --bmc1_ucm_reduced_relation_type 0
% 150.31/150.50 % --bmc1_ucm_relax_model 4
% 150.31/150.50 % --bmc1_ucm_full_tr_after_sat true
% 150.31/150.50 % --bmc1_ucm_expand_neg_assumptions false
% 150.31/150.50 % --bmc1_ucm_layered_model none
% 150.31/150.50 % --bmc1_ucm_max_lemma_size 10
% 150.31/150.50
% 150.31/150.50 % ------ AIG Options
% 150.31/150.50
% 150.31/150.50 % --aig_mode false
% 150.31/150.50
% 150.31/150.50 % ------ Instantiation Options
% 150.31/150.50
% 150.31/150.50 % --instantiation_flag true
% 150.31/150.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.31/150.50 % --inst_solver_per_active 750
% 150.31/150.50 % --inst_solver_calls_frac 0.5
% 150.31/150.50 % --inst_passive_queue_type priority_queues
% 150.31/150.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.31/150.50 % --inst_passive_queues_freq [25;2]
% 150.31/150.50 % --inst_dismatching true
% 150.31/150.50 % --inst_eager_unprocessed_to_passive true
% 150.31/150.50 % --inst_prop_sim_given true
% 150.31/150.50 % --inst_prop_sim_new false
% 150.31/150.50 % --inst_orphan_elimination true
% 150.31/150.50 % --inst_learning_loop_flag true
% 150.31/150.50 % --inst_learning_start 3000
% 150.31/150.50 % --inst_learning_factor 2
% 150.31/150.50 % --inst_start_prop_sim_after_learn 3
% 150.31/150.50 % --inst_sel_renew solver
% 150.31/150.50 % --inst_lit_activity_flag true
% 150.31/150.50 % --inst_out_proof true
% 150.31/150.50
% 150.31/150.50 % ------ Resolution Options
% 150.31/150.50
% 150.31/150.50 % --resolution_flag true
% 150.31/150.50 % --res_lit_sel kbo_max
% 150.31/150.50 % --res_to_prop_solver none
% 150.31/150.50 % --res_prop_simpl_new false
% 150.31/150.50 % --res_prop_simpl_given false
% 150.31/150.50 % --res_passive_queue_type priority_queues
% 150.31/150.50 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.31/150.50 % --res_passive_queues_freq [15;5]
% 150.31/150.50 % --res_forward_subs full
% 150.31/150.50 % --res_backward_subs full
% 150.31/150.50 % --res_forward_subs_resolution true
% 150.31/150.50 % --res_backward_subs_resolution true
% 150.31/150.50 % --res_orphan_elimination false
% 150.31/150.50 % --res_time_limit 1000.
% 150.31/150.50 % --res_out_proof true
% 150.31/150.50 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_141537.s
% 150.31/150.50 % --modulo true
% 150.31/150.50
% 150.31/150.50 % ------ Combination Options
% 150.31/150.50
% 150.31/150.50 % --comb_res_mult 1000
% 150.31/150.50 % --comb_inst_mult 300
% 150.31/150.50 % ------
% 150.31/150.50
% 150.31/150.50 % ------ Parsing...% successful
% 150.31/150.50
% 150.31/150.50 % ------ 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.50
% 150.31/150.50 % ------ Proving...
% 150.31/150.50 % ------ Problem Properties
% 150.31/150.50
% 150.31/150.50 %
% 150.31/150.50 % EPR false
% 150.31/150.50 % Horn false
% 150.31/150.50 % Has equality true
% 150.31/150.50
% 150.31/150.50 % % ------ Input Options Time Limit: Unbounded
% 150.31/150.50
% 150.31/150.50
% 150.31/150.50 % % ------ Current options:
% 150.31/150.50
% 150.31/150.50 % ------ Input Options
% 150.31/150.50
% 150.31/150.50 % --out_options all
% 150.31/150.50 % --tptp_safe_out true
% 150.31/150.50 % --problem_path ""
% 150.31/150.50 % --include_path ""
% 150.31/150.50 % --clausifier .//eprover
% 150.31/150.50 % --clausifier_options --tstp-format
% 150.31/150.50 % --stdin false
% 150.31/150.50 % --dbg_backtrace false
% 150.31/150.50 % --dbg_dump_prop_clauses false
% 150.31/150.50 % --dbg_dump_prop_clauses_file -
% 150.31/150.50 % --dbg_out_stat false
% 150.31/150.50
% 150.31/150.50 % ------ General Options
% 150.31/150.50
% 150.31/150.50 % --fof false
% 150.31/150.50 % --time_out_real 150.
% 150.31/150.50 % --time_out_prep_mult 0.2
% 150.31/150.50 % --time_out_virtual -1.
% 150.31/150.50 % --schedule none
% 150.31/150.50 % --ground_splitting input
% 150.31/150.50 % --splitting_nvd 16
% 150.31/150.50 % --non_eq_to_eq false
% 150.31/150.50 % --prep_gs_sim true
% 150.31/150.50 % --prep_unflatten false
% 150.31/150.50 % --prep_res_sim true
% 150.31/150.50 % --prep_upred true
% 150.31/150.50 % --res_sim_input true
% 150.31/150.50 % --clause_weak_htbl true
% 150.31/150.50 % --gc_record_bc_elim false
% 150.31/150.50 % --symbol_type_check false
% 150.31/150.50 % --clausify_out false
% 150.31/150.50 % --large_theory_mode false
% 150.31/150.50 % --prep_sem_filter none
% 150.31/150.50 % --prep_sem_filter_out false
% 150.31/150.50 % --preprocessed_out false
% 150.31/150.50 % --sub_typing false
% 150.31/150.50 % --brand_transform false
% 150.31/150.50 % --pure_diseq_elim true
% 150.31/150.50 % --min_unsat_core false
% 150.31/150.50 % --pred_elim true
% 150.31/150.50 % --add_important_lit false
% 150.31/150.50 % --soft_assumptions false
% 150.31/150.50 % --reset_solvers false
% 150.31/150.50 % --bc_imp_inh []
% 150.31/150.50 % --conj_cone_tolerance 1.5
% 150.31/150.50 % --prolific_symb_bound 500
% 150.31/150.50 % --lt_threshold 2000
% 150.31/150.50
% 150.31/150.50 % ------ SAT Options
% 150.31/150.50
% 150.31/150.50 % --sat_mode false
% 150.31/150.50 % --sat_fm_restart_options ""
% 150.31/150.50 % --sat_gr_def false
% 150.31/150.50 % --sat_epr_types true
% 150.31/150.50 % --sat_non_cyclic_types false
% 150.31/150.50 % --sat_finite_models false
% 150.31/150.50 % --sat_fm_lemmas false
% 150.31/150.50 % --sat_fm_prep false
% 150.31/150.50 % --sat_fm_uc_incr true
% 150.31/150.50 % --sat_out_model small
% 150.31/150.50 % --sat_out_clauses false
% 150.31/150.50
% 150.31/150.50 % ------ QBF Options
% 150.31/150.50
% 150.31/150.50 % --qbf_mode false
% 150.31/150.50 % --qbf_elim_univ true
% 150.31/150.50 % --qbf_sk_in true
% 150.31/150.50 % --qbf_pred_elim true
% 150.31/150.50 % --qbf_split 32
% 150.31/150.50
% 150.31/150.50 % ------ BMC1 Options
% 150.31/150.50
% 150.31/150.50 % --bmc1_incremental false
% 150.31/150.50 % --bmc1_axioms reachable_all
% 150.31/150.50 % --bmc1_min_bound 0
% 150.31/150.50 % --bmc1_max_bound -1
% 150.31/150.50 % --bmc1_max_bound_default -1
% 150.31/150.50 % --bmc1_symbol_reachability true
% 150.31/150.50 % --bmc1_property_lemmas false
% 150.31/150.50 % --bmc1_k_induction false
% 150.31/150.50 % --bmc1_non_equiv_states false
% 150.31/150.50 % --bmc1_deadlock false
% 150.31/150.50 % --bmc1_ucm false
% 150.31/150.50 % --bmc1_add_unsat_core none
% 150.31/150.50 % --bmc1_unsat_core_children false
% 150.31/150.50 % --bmc1_unsat_core_extrapolate_axioms false
% 150.31/150.50 % --bmc1_out_stat full
% 150.31/150.50 % --bmc1_ground_init false
% 150.31/150.50 % --bmc1_pre_inst_next_state false
% 150.31/150.50 % --bmc1_pre_inst_state false
% 150.31/150.50 % --bmc1_pre_inst_reach_state false
% 150.31/150.50 % --bmc1_out_unsat_core false
% 150.31/150.50 % --bmc1_aig_witness_out false
% 150.31/150.50 % --bmc1_verbose false
% 150.31/150.50 % --bmc1_dump_clauses_tptp false
% 150.31/150.50 % --bmc1_dump_unsat_core_tptp false
% 150.31/150.50 % --bmc1_dump_file -
% 150.31/150.50 % --bmc1_ucm_expand_uc_limit 128
% 150.31/150.50 % --bmc1_ucm_n_expand_iterations 6
% 150.31/150.50 % --bmc1_ucm_extend_mode 1
% 150.31/150.50 % --bmc1_ucm_init_mode 2
% 150.31/150.50 % --bmc1_ucm_cone_mode none
% 150.31/150.50 % --bmc1_ucm_reduced_relation_type 0
% 150.31/150.50 % --bmc1_ucm_relax_model 4
% 150.31/150.50 % --bmc1_ucm_full_tr_after_sat true
% 150.31/150.50 % --bmc1_ucm_expand_neg_assumptions false
% 150.31/150.50 % --bmc1_ucm_layered_model none
% 150.31/150.50 % --bmc1_ucm_max_lemma_size 10
% 150.31/150.50
% 150.31/150.50 % ------ AIG Options
% 150.31/150.50
% 150.31/150.50 % --aig_mode false
% 150.31/150.50
% 150.31/150.50 % ------ Instantiation Options
% 150.31/150.50
% 150.31/150.50 % --instantiation_flag true
% 150.31/150.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.31/150.50 % --inst_solver_per_active 750
% 150.31/150.50 % --inst_solver_calls_frac 0.5
% 150.31/150.50 % --inst_passive_queue_type priority_queues
% 150.31/150.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.31/150.50 % --inst_passive_queues_freq [25;2]
% 150.31/150.50 % --inst_dismatching true
% 150.31/150.50 % --inst_eager_unprocessed_to_passive true
% 150.31/150.50 % --inst_prop_sim_given true
% 150.31/150.51 % --inst_prop_sim_new false
% 150.31/150.51 % --inst_orphan_elimination true
% 150.31/150.51 % --inst_learning_loop_flag true
% 150.31/150.51 % --inst_learning_start 3000
% 150.31/150.51 % --inst_learning_factor 2
% 150.31/150.51 % --inst_start_prop_sim_after_learn 3
% 150.31/150.51 % --inst_sel_renew solver
% 150.31/150.51 % --inst_lit_activity_flag true
% 150.31/150.51 % --inst_out_proof true
% 150.31/150.51
% 150.31/150.51 % ------ Resolution Options
% 150.31/150.51
% 150.31/150.51 % --resolution_flag true
% 150.31/150.51 % --res_lit_sel kbo_max
% 150.31/150.51 % --res_to_prop_solver none
% 150.31/150.51 % --res_prop_simpl_new false
% 150.31/150.51 % --res_prop_simpl_given false
% 150.31/150.51 % --res_passive_queue_type priority_queues
% 150.31/150.51 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.31/150.51 % --res_passive_queues_freq [15;5]
% 150.31/150.51 % --res_forward_subs full
% 150.31/150.51 % --res_backward_subs full
% 150.31/150.51 % --res_forward_subs_resolution true
% 150.31/150.51 % --res_backward_subs_resolution true
% 150.31/150.51 % --res_orphan_elimination false
% 150.31/150.51 % --res_time_limit 1000.
% 150.31/150.51 % --res_out_proof true
% 150.31/150.51 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_141537.s
% 150.31/150.51 % --modulo true
% 150.31/150.51
% 150.31/150.51 % ------ Combination Options
% 150.31/150.51
% 150.31/150.51 % --comb_res_mult 1000
% 150.31/150.51 % --comb_inst_mult 300
% 150.31/150.51 % ------
% 150.31/150.51
% 150.31/150.51
% 150.31/150.51
% 150.31/150.51 % ------ Proving...
% 150.31/150.51 %
% 150.31/150.51
% 150.31/150.51
% 150.31/150.51 % Resolution empty clause
% 150.31/150.51
% 150.31/150.51 % ------ Statistics
% 150.31/150.51
% 150.31/150.51 % ------ General
% 150.31/150.51
% 150.31/150.51 % num_of_input_clauses: 84
% 150.31/150.51 % num_of_input_neg_conjectures: 2
% 150.31/150.51 % num_of_splits: 0
% 150.31/150.51 % num_of_split_atoms: 0
% 150.31/150.51 % num_of_sem_filtered_clauses: 0
% 150.31/150.51 % num_of_subtypes: 0
% 150.31/150.51 % monotx_restored_types: 0
% 150.31/150.51 % sat_num_of_epr_types: 0
% 150.31/150.51 % sat_num_of_non_cyclic_types: 0
% 150.31/150.51 % sat_guarded_non_collapsed_types: 0
% 150.31/150.51 % is_epr: 0
% 150.31/150.51 % is_horn: 0
% 150.31/150.51 % has_eq: 1
% 150.31/150.51 % num_pure_diseq_elim: 0
% 150.31/150.51 % simp_replaced_by: 0
% 150.31/150.51 % res_preprocessed: 4
% 150.31/150.51 % prep_upred: 0
% 150.31/150.51 % prep_unflattend: 0
% 150.31/150.51 % pred_elim_cands: 0
% 150.31/150.51 % pred_elim: 0
% 150.31/150.51 % pred_elim_cl: 0
% 150.31/150.51 % pred_elim_cycles: 0
% 150.31/150.51 % forced_gc_time: 0
% 150.31/150.51 % gc_basic_clause_elim: 0
% 150.31/150.51 % parsing_time: 0.003
% 150.31/150.51 % sem_filter_time: 0.
% 150.31/150.51 % pred_elim_time: 0.
% 150.31/150.51 % out_proof_time: 0.
% 150.31/150.51 % monotx_time: 0.
% 150.31/150.51 % subtype_inf_time: 0.
% 150.31/150.51 % unif_index_cands_time: 0.
% 150.31/150.51 % unif_index_add_time: 0.
% 150.31/150.51 % total_time: 0.028
% 150.31/150.51 % num_of_symbols: 49
% 150.31/150.51 % num_of_terms: 197
% 150.31/150.51
% 150.31/150.51 % ------ Propositional Solver
% 150.31/150.51
% 150.31/150.51 % prop_solver_calls: 1
% 150.31/150.51 % prop_fast_solver_calls: 6
% 150.31/150.51 % prop_num_of_clauses: 72
% 150.31/150.51 % prop_preprocess_simplified: 244
% 150.31/150.51 % prop_fo_subsumed: 0
% 150.31/150.51 % prop_solver_time: 0.
% 150.31/150.51 % prop_fast_solver_time: 0.
% 150.31/150.51 % prop_unsat_core_time: 0.
% 150.31/150.51
% 150.31/150.51 % ------ QBF
% 150.31/150.51
% 150.31/150.51 % qbf_q_res: 0
% 150.31/150.51 % qbf_num_tautologies: 0
% 150.31/150.51 % qbf_prep_cycles: 0
% 150.31/150.51
% 150.31/150.51 % ------ BMC1
% 150.31/150.51
% 150.31/150.51 % bmc1_current_bound: -1
% 150.31/150.51 % bmc1_last_solved_bound: -1
% 150.31/150.51 % bmc1_unsat_core_size: -1
% 150.31/150.51 % bmc1_unsat_core_parents_size: -1
% 150.31/150.51 % bmc1_merge_next_fun: 0
% 150.31/150.51 % bmc1_unsat_core_clauses_time: 0.
% 150.31/150.51
% 150.31/150.51 % ------ Instantiation
% 150.31/150.51
% 150.31/150.51 % inst_num_of_clauses: 79
% 150.31/150.51 % inst_num_in_passive: 0
% 150.31/150.51 % inst_num_in_active: 0
% 150.31/150.51 % inst_num_in_unprocessed: 84
% 150.31/150.51 % inst_num_of_loops: 0
% 150.31/150.51 % inst_num_of_learning_restarts: 0
% 150.31/150.51 % inst_num_moves_active_passive: 0
% 150.31/150.51 % inst_lit_activity: 0
% 150.31/150.51 % inst_lit_activity_moves: 0
% 150.31/150.51 % inst_num_tautologies: 0
% 150.31/150.51 % inst_num_prop_implied: 0
% 150.31/150.51 % inst_num_existing_simplified: 0
% 150.31/150.51 % inst_num_eq_res_simplified: 0
% 150.31/150.51 % inst_num_child_elim: 0
% 150.31/150.51 % inst_num_of_dismatching_blockings: 0
% 150.31/150.51 % inst_num_of_non_proper_insts: 0
% 150.31/150.51 % inst_num_of_duplicates: 0
% 150.31/150.51 % inst_inst_num_from_inst_to_res: 0
% 150.31/150.51 % inst_dismatching_checking_time: 0.
% 150.31/150.51
% 150.31/150.51 % ------ Resolution
% 150.31/150.51
% 150.31/150.51 % res_num_of_clauses: 93
% 150.31/150.51 % res_num_in_passive: 1
% 150.31/150.51 % res_num_in_active: 49
% 150.31/150.51 % res_num_of_loops: 8
% 150.31/150.51 % res_forward_subset_subsumed: 41
% 150.31/150.51 % res_backward_subset_subsumed: 0
% 150.31/150.51 % res_forward_subsumed: 0
% 150.31/150.51 % res_backward_subsumed: 0
% 150.31/150.51 % res_forward_subsumption_resolution: 2
% 150.31/150.51 % res_backward_subsumption_resolution: 0
% 150.31/150.51 % res_clause_to_clause_subsumption: 6
% 150.31/150.51 % res_orphan_elimination: 0
% 150.31/150.51 % res_tautology_del: 0
% 150.31/150.51 % res_num_eq_res_simplified: 1
% 150.31/150.51 % res_num_sel_changes: 0
% 150.31/150.51 % res_moves_from_active_to_pass: 0
% 150.31/150.51
% 150.31/150.51 % Status Unsatisfiable
% 150.31/150.51 % SZS status Theorem
% 150.31/150.51 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------