%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SEU261+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n005.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:35 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 24
% Syntax : Number of formulae : 224 ( 85 unt; 0 def)
% Number of atoms : 657 ( 0 equ)
% Maximal formula atoms : 22 ( 2 avg)
% Number of connectives : 795 ( 362 ~; 352 |; 44 &)
% ( 3 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 185 ( 0 sgn 24 !; 2 ?)
% 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] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( relation_isomorphism(X1,X2,X3)
=> ( ( reflexive(X1)
=> reflexive(X2) )
& ( transitive(X1)
=> transitive(X2) )
& ( connected(X1)
=> connected(X2) )
& ( antisymmetric(X1)
=> antisymmetric(X2) )
& ( well_founded_relation(X1)
=> well_founded_relation(X2) ) ) ) ) ) ),
file('<stdin>',t53_wellord1) ).
fof(c_0_1,axiom,
! [X1] :
( relation(X1)
=> ( well_ordering(X1)
<=> ( reflexive(X1)
& transitive(X1)
& antisymmetric(X1)
& connected(X1)
& well_founded_relation(X1) ) ) ),
file('<stdin>',d4_wellord1) ).
fof(c_0_2,axiom,
? [X1] :
( relation(X1)
& function(X1) ),
file('<stdin>',rc1_funct_1) ).
fof(c_0_3,plain,
! [X1,X2] :
( epred1_2(X2,X1)
<=> ( ( reflexive(X1)
=> reflexive(X2) )
& ( transitive(X1)
=> transitive(X2) )
& ( connected(X1)
=> connected(X2) )
& ( antisymmetric(X1)
=> antisymmetric(X2) )
& ( well_founded_relation(X1)
=> well_founded_relation(X2) ) ) ),
introduced(definition) ).
fof(c_0_4,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( relation_isomorphism(X1,X2,X3)
=> epred1_2(X2,X1) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_0,c_0_3,theory(equality,[symmetry])]) ).
fof(c_0_5,axiom,
! [X1] :
( relation(X1)
=> ( well_ordering(X1)
<=> ( reflexive(X1)
& transitive(X1)
& antisymmetric(X1)
& connected(X1)
& well_founded_relation(X1) ) ) ),
c_0_1 ).
fof(c_0_6,plain,
! [X1,X2] :
( epred1_2(X2,X1)
=> ( ( reflexive(X1)
=> reflexive(X2) )
& ( transitive(X1)
=> transitive(X2) )
& ( connected(X1)
=> connected(X2) )
& ( antisymmetric(X1)
=> antisymmetric(X2) )
& ( well_founded_relation(X1)
=> well_founded_relation(X2) ) ) ),
inference(split_equiv,[status(thm)],[c_0_3]) ).
fof(c_0_7,axiom,
? [X1] :
( relation(X1)
& function(X1) ),
c_0_2 ).
fof(c_0_8,plain,
! [X4,X5,X6] :
( ~ relation(X4)
| ~ relation(X5)
| ~ relation(X6)
| ~ function(X6)
| ~ relation_isomorphism(X4,X5,X6)
| epred1_2(X5,X4) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_9,plain,
! [X2] :
( ( reflexive(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( transitive(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( antisymmetric(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( connected(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( well_founded_relation(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( ~ reflexive(X2)
| ~ transitive(X2)
| ~ antisymmetric(X2)
| ~ connected(X2)
| ~ well_founded_relation(X2)
| well_ordering(X2)
| ~ relation(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_10,plain,
! [X3,X4] :
( ( ~ reflexive(X3)
| reflexive(X4)
| ~ epred1_2(X4,X3) )
& ( ~ transitive(X3)
| transitive(X4)
| ~ epred1_2(X4,X3) )
& ( ~ connected(X3)
| connected(X4)
| ~ epred1_2(X4,X3) )
& ( ~ antisymmetric(X3)
| antisymmetric(X4)
| ~ epred1_2(X4,X3) )
& ( ~ well_founded_relation(X3)
| well_founded_relation(X4)
| ~ epred1_2(X4,X3) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_11,plain,
( relation(esk1_0)
& function(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_7])]) ).
cnf(c_0_12,plain,
( epred1_2(X1,X2)
| ~ relation_isomorphism(X2,X1,X3)
| ~ function(X3)
| ~ relation(X3)
| ~ relation(X1)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( well_ordering(X1)
| ~ relation(X1)
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( reflexive(X1)
| ~ epred1_2(X1,X2)
| ~ reflexive(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( transitive(X1)
| ~ epred1_2(X1,X2)
| ~ transitive(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( connected(X1)
| ~ epred1_2(X1,X2)
| ~ connected(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( antisymmetric(X1)
| ~ epred1_2(X1,X2)
| ~ antisymmetric(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( well_founded_relation(X1)
| ~ epred1_2(X1,X2)
| ~ well_founded_relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
( transitive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
( connected(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,plain,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,plain,
function(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_26,plain,
( epred1_2(X1,X2)
| ~ relation_isomorphism(X2,X1,X3)
| ~ function(X3)
| ~ relation(X3)
| ~ relation(X1)
| ~ relation(X2) ),
c_0_12,
[final] ).
cnf(c_0_27,plain,
( well_ordering(X1)
| ~ relation(X1)
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(X1) ),
c_0_13,
[final] ).
cnf(c_0_28,plain,
( reflexive(X1)
| ~ epred1_2(X1,X2)
| ~ reflexive(X2) ),
c_0_14,
[final] ).
cnf(c_0_29,plain,
( transitive(X1)
| ~ epred1_2(X1,X2)
| ~ transitive(X2) ),
c_0_15,
[final] ).
cnf(c_0_30,plain,
( connected(X1)
| ~ epred1_2(X1,X2)
| ~ connected(X2) ),
c_0_16,
[final] ).
cnf(c_0_31,plain,
( antisymmetric(X1)
| ~ epred1_2(X1,X2)
| ~ antisymmetric(X2) ),
c_0_17,
[final] ).
cnf(c_0_32,plain,
( well_founded_relation(X1)
| ~ epred1_2(X1,X2)
| ~ well_founded_relation(X2) ),
c_0_18,
[final] ).
cnf(c_0_33,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
c_0_19,
[final] ).
cnf(c_0_34,plain,
( transitive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
c_0_20,
[final] ).
cnf(c_0_35,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
c_0_21,
[final] ).
cnf(c_0_36,plain,
( connected(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
c_0_22,
[final] ).
cnf(c_0_37,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
c_0_23,
[final] ).
cnf(c_0_38,plain,
relation(esk1_0),
c_0_24,
[final] ).
cnf(c_0_39,plain,
function(esk1_0),
c_0_25,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_26_0,axiom,
( epred1_2(X1,X2)
| ~ relation_isomorphism(X2,X1,X3)
| ~ function(X3)
| ~ relation(X3)
| ~ relation(X1)
| ~ relation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_1,axiom,
( ~ relation_isomorphism(X2,X1,X3)
| epred1_2(X1,X2)
| ~ function(X3)
| ~ relation(X3)
| ~ relation(X1)
| ~ relation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_2,axiom,
( ~ function(X3)
| ~ relation_isomorphism(X2,X1,X3)
| epred1_2(X1,X2)
| ~ relation(X3)
| ~ relation(X1)
| ~ relation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_3,axiom,
( ~ relation(X3)
| ~ function(X3)
| ~ relation_isomorphism(X2,X1,X3)
| epred1_2(X1,X2)
| ~ relation(X1)
| ~ relation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_4,axiom,
( ~ relation(X1)
| ~ relation(X3)
| ~ function(X3)
| ~ relation_isomorphism(X2,X1,X3)
| epred1_2(X1,X2)
| ~ relation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_5,axiom,
( ~ relation(X2)
| ~ relation(X1)
| ~ relation(X3)
| ~ function(X3)
| ~ relation_isomorphism(X2,X1,X3)
| epred1_2(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_27_0,axiom,
( well_ordering(X1)
| ~ relation(X1)
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_1,axiom,
( ~ relation(X1)
| well_ordering(X1)
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_2,axiom,
( ~ well_founded_relation(X1)
| ~ relation(X1)
| well_ordering(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_3,axiom,
( ~ connected(X1)
| ~ well_founded_relation(X1)
| ~ relation(X1)
| well_ordering(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_4,axiom,
( ~ antisymmetric(X1)
| ~ connected(X1)
| ~ well_founded_relation(X1)
| ~ relation(X1)
| well_ordering(X1)
| ~ transitive(X1)
| ~ reflexive(X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_5,axiom,
( ~ transitive(X1)
| ~ antisymmetric(X1)
| ~ connected(X1)
| ~ well_founded_relation(X1)
| ~ relation(X1)
| well_ordering(X1)
| ~ reflexive(X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_6,axiom,
( ~ reflexive(X1)
| ~ transitive(X1)
| ~ antisymmetric(X1)
| ~ connected(X1)
| ~ well_founded_relation(X1)
| ~ relation(X1)
| well_ordering(X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_28_0,axiom,
( reflexive(X1)
| ~ epred1_2(X1,X2)
| ~ reflexive(X2) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_1,axiom,
( ~ epred1_2(X1,X2)
| reflexive(X1)
| ~ reflexive(X2) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_2,axiom,
( ~ reflexive(X2)
| ~ epred1_2(X1,X2)
| reflexive(X1) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_29_0,axiom,
( transitive(X1)
| ~ epred1_2(X1,X2)
| ~ transitive(X2) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_29_1,axiom,
( ~ epred1_2(X1,X2)
| transitive(X1)
| ~ transitive(X2) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_29_2,axiom,
( ~ transitive(X2)
| ~ epred1_2(X1,X2)
| transitive(X1) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_30_0,axiom,
( connected(X1)
| ~ epred1_2(X1,X2)
| ~ connected(X2) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_30_1,axiom,
( ~ epred1_2(X1,X2)
| connected(X1)
| ~ connected(X2) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_30_2,axiom,
( ~ connected(X2)
| ~ epred1_2(X1,X2)
| connected(X1) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_31_0,axiom,
( antisymmetric(X1)
| ~ epred1_2(X1,X2)
| ~ antisymmetric(X2) ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_31_1,axiom,
( ~ epred1_2(X1,X2)
| antisymmetric(X1)
| ~ antisymmetric(X2) ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_31_2,axiom,
( ~ antisymmetric(X2)
| ~ epred1_2(X1,X2)
| antisymmetric(X1) ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_32_0,axiom,
( well_founded_relation(X1)
| ~ epred1_2(X1,X2)
| ~ well_founded_relation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_32_1,axiom,
( ~ epred1_2(X1,X2)
| well_founded_relation(X1)
| ~ well_founded_relation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_32_2,axiom,
( ~ well_founded_relation(X2)
| ~ epred1_2(X1,X2)
| well_founded_relation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_33_0,axiom,
( reflexive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_33_1,axiom,
( ~ relation(X1)
| reflexive(X1)
| ~ well_ordering(X1) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_33_2,axiom,
( ~ well_ordering(X1)
| ~ relation(X1)
| reflexive(X1) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_34_0,axiom,
( transitive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_34_1,axiom,
( ~ relation(X1)
| transitive(X1)
| ~ well_ordering(X1) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_34_2,axiom,
( ~ well_ordering(X1)
| ~ relation(X1)
| transitive(X1) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_35_0,axiom,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_35_1,axiom,
( ~ relation(X1)
| antisymmetric(X1)
| ~ well_ordering(X1) ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_35_2,axiom,
( ~ well_ordering(X1)
| ~ relation(X1)
| antisymmetric(X1) ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_36_0,axiom,
( connected(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_36_1,axiom,
( ~ relation(X1)
| connected(X1)
| ~ well_ordering(X1) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_36_2,axiom,
( ~ well_ordering(X1)
| ~ relation(X1)
| connected(X1) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_37_0,axiom,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_37_1,axiom,
( ~ relation(X1)
| well_founded_relation(X1)
| ~ well_ordering(X1) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_37_2,axiom,
( ~ well_ordering(X1)
| ~ relation(X1)
| well_founded_relation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_38_0,axiom,
relation(sk1_esk1_0),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_39_0,axiom,
function(sk1_esk1_0),
inference(literals_permutation,[status(thm)],[c_0_39]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( ( well_ordering(X1)
& relation_isomorphism(X1,X2,X3) )
=> well_ordering(X2) ) ) ) ),
file('<stdin>',t54_wellord1) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( ( well_ordering(X1)
& relation_isomorphism(X1,X2,X3) )
=> well_ordering(X2) ) ) ) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
( relation(esk1_0)
& relation(esk2_0)
& relation(esk3_0)
& function(esk3_0)
& well_ordering(esk1_0)
& relation_isomorphism(esk1_0,esk2_0,esk3_0)
& ~ well_ordering(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,
relation_isomorphism(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
~ well_ordering(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_007,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7_008,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8_009,negated_conjecture,
function(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9_010,negated_conjecture,
well_ordering(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10_011,negated_conjecture,
relation_isomorphism(esk1_0,esk2_0,esk3_0),
c_0_3,
[final] ).
cnf(c_0_11_012,negated_conjecture,
~ well_ordering(esk2_0),
c_0_4,
[final] ).
cnf(c_0_12_013,negated_conjecture,
relation(esk1_0),
c_0_5,
[final] ).
cnf(c_0_13_014,negated_conjecture,
relation(esk2_0),
c_0_6,
[final] ).
cnf(c_0_14_015,negated_conjecture,
relation(esk3_0),
c_0_7,
[final] ).
cnf(c_0_15_016,negated_conjecture,
function(esk3_0),
c_0_8,
[final] ).
cnf(c_0_16_017,negated_conjecture,
well_ordering(esk1_0),
c_0_9,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_48,negated_conjecture,
relation(sk2_esk2_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_13) ).
cnf(c_64,negated_conjecture,
relation(sk2_esk2_0),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_89,negated_conjecture,
relation(sk2_esk2_0),
inference(copy,[status(esa)],[c_64]) ).
cnf(c_96,negated_conjecture,
relation(sk2_esk2_0),
inference(copy,[status(esa)],[c_89]) ).
cnf(c_100,negated_conjecture,
relation(sk2_esk2_0),
inference(copy,[status(esa)],[c_96]) ).
cnf(c_249,negated_conjecture,
relation(sk2_esk2_0),
inference(copy,[status(esa)],[c_100]) ).
cnf(c_39,plain,
( epred1_2(X0,X1)
| ~ relation_isomorphism(X1,X0,X2)
| ~ function(X2)
| ~ relation(X2)
| ~ relation(X0)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_26_5) ).
cnf(c_237,plain,
( epred1_2(X0,X1)
| ~ relation_isomorphism(X1,X0,X2)
| ~ function(X2)
| ~ relation(X2)
| ~ relation(X0)
| ~ relation(X1) ),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_238,plain,
( ~ function(X0)
| ~ relation(X0)
| ~ relation(X1)
| ~ relation(X2)
| epred1_2(X1,X2)
| ~ relation_isomorphism(X2,X1,X0) ),
inference(rewriting,[status(thm)],[c_237]) ).
cnf(c_266,plain,
( ~ function(X0)
| ~ relation(X0)
| ~ relation(X1)
| epred1_2(sk2_esk2_0,X1)
| ~ relation_isomorphism(X1,sk2_esk2_0,X0) ),
inference(resolution,[status(thm)],[c_249,c_238]) ).
cnf(c_267,plain,
( ~ function(X0)
| ~ relation(X0)
| ~ relation(X1)
| epred1_2(sk2_esk2_0,X1)
| ~ relation_isomorphism(X1,sk2_esk2_0,X0) ),
inference(rewriting,[status(thm)],[c_266]) ).
cnf(c_46,negated_conjecture,
relation_isomorphism(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_10) ).
cnf(c_60,negated_conjecture,
relation_isomorphism(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_87,negated_conjecture,
relation_isomorphism(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_60]) ).
cnf(c_98,negated_conjecture,
relation_isomorphism(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_87]) ).
cnf(c_105,negated_conjecture,
relation_isomorphism(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_98]) ).
cnf(c_259,negated_conjecture,
relation_isomorphism(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_105]) ).
cnf(c_352,plain,
( ~ function(sk2_esk3_0)
| ~ relation(sk2_esk1_0)
| ~ relation(sk2_esk3_0)
| epred1_2(sk2_esk2_0,sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_267,c_259]) ).
cnf(c_353,plain,
( ~ function(sk2_esk3_0)
| ~ relation(sk2_esk1_0)
| ~ relation(sk2_esk3_0)
| epred1_2(sk2_esk2_0,sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_352]) ).
cnf(c_49,negated_conjecture,
relation(sk2_esk3_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_14) ).
cnf(c_66,negated_conjecture,
relation(sk2_esk3_0),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_90,negated_conjecture,
relation(sk2_esk3_0),
inference(copy,[status(esa)],[c_66]) ).
cnf(c_95,negated_conjecture,
relation(sk2_esk3_0),
inference(copy,[status(esa)],[c_90]) ).
cnf(c_101,negated_conjecture,
relation(sk2_esk3_0),
inference(copy,[status(esa)],[c_95]) ).
cnf(c_251,negated_conjecture,
relation(sk2_esk3_0),
inference(copy,[status(esa)],[c_101]) ).
cnf(c_47,negated_conjecture,
relation(sk2_esk1_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_12) ).
cnf(c_62,negated_conjecture,
relation(sk2_esk1_0),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_88,negated_conjecture,
relation(sk2_esk1_0),
inference(copy,[status(esa)],[c_62]) ).
cnf(c_97,negated_conjecture,
relation(sk2_esk1_0),
inference(copy,[status(esa)],[c_88]) ).
cnf(c_106,negated_conjecture,
relation(sk2_esk1_0),
inference(copy,[status(esa)],[c_97]) ).
cnf(c_261,negated_conjecture,
relation(sk2_esk1_0),
inference(copy,[status(esa)],[c_106]) ).
cnf(c_50,negated_conjecture,
function(sk2_esk3_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_15) ).
cnf(c_68,negated_conjecture,
function(sk2_esk3_0),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_91,negated_conjecture,
function(sk2_esk3_0),
inference(copy,[status(esa)],[c_68]) ).
cnf(c_94,negated_conjecture,
function(sk2_esk3_0),
inference(copy,[status(esa)],[c_91]) ).
cnf(c_102,negated_conjecture,
function(sk2_esk3_0),
inference(copy,[status(esa)],[c_94]) ).
cnf(c_253,negated_conjecture,
function(sk2_esk3_0),
inference(copy,[status(esa)],[c_102]) ).
cnf(c_358,plain,
epred1_2(sk2_esk2_0,sk2_esk1_0),
inference(forward_subsumption_resolution,[status(thm)],[c_353,c_251,c_261,c_253]) ).
cnf(c_359,plain,
epred1_2(sk2_esk2_0,sk2_esk1_0),
inference(rewriting,[status(thm)],[c_358]) ).
cnf(c_30,plain,
( ~ reflexive(X0)
| reflexive(X1)
| ~ epred1_2(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_28_1) ).
cnf(c_219,plain,
( ~ reflexive(X0)
| reflexive(X1)
| ~ epred1_2(X1,X0) ),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_361,plain,
( reflexive(sk2_esk2_0)
| ~ reflexive(sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_359,c_219]) ).
cnf(c_370,plain,
( reflexive(sk2_esk2_0)
| ~ reflexive(sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_361]) ).
cnf(c_51,negated_conjecture,
well_ordering(sk2_esk1_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_16) ).
cnf(c_70,negated_conjecture,
well_ordering(sk2_esk1_0),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_92,negated_conjecture,
well_ordering(sk2_esk1_0),
inference(copy,[status(esa)],[c_70]) ).
cnf(c_93,negated_conjecture,
well_ordering(sk2_esk1_0),
inference(copy,[status(esa)],[c_92]) ).
cnf(c_103,negated_conjecture,
well_ordering(sk2_esk1_0),
inference(copy,[status(esa)],[c_93]) ).
cnf(c_255,plain,
well_ordering(sk2_esk1_0),
inference(copy,[status(esa)],[c_103]) ).
cnf(c_14,plain,
( reflexive(X0)
| ~ relation(X0)
| ~ well_ordering(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_33_2) ).
cnf(c_187,plain,
( reflexive(X0)
| ~ relation(X0)
| ~ well_ordering(X0) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_188,plain,
( ~ relation(X0)
| ~ well_ordering(X0)
| reflexive(X0) ),
inference(rewriting,[status(thm)],[c_187]) ).
cnf(c_283,plain,
( ~ relation(sk2_esk1_0)
| reflexive(sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_255,c_188]) ).
cnf(c_292,plain,
( ~ relation(sk2_esk1_0)
| reflexive(sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_283]) ).
cnf(c_335,plain,
reflexive(sk2_esk1_0),
inference(forward_subsumption_resolution,[status(thm)],[c_292,c_261]) ).
cnf(c_336,plain,
reflexive(sk2_esk1_0),
inference(rewriting,[status(thm)],[c_335]) ).
cnf(c_453,plain,
reflexive(sk2_esk2_0),
inference(forward_subsumption_resolution,[status(thm)],[c_370,c_336]) ).
cnf(c_454,plain,
reflexive(sk2_esk2_0),
inference(rewriting,[status(thm)],[c_453]) ).
cnf(c_32,plain,
( well_ordering(X0)
| ~ relation(X0)
| ~ well_founded_relation(X0)
| ~ connected(X0)
| ~ antisymmetric(X0)
| ~ transitive(X0)
| ~ reflexive(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_27_6) ).
cnf(c_223,plain,
( well_ordering(X0)
| ~ relation(X0)
| ~ well_founded_relation(X0)
| ~ connected(X0)
| ~ antisymmetric(X0)
| ~ transitive(X0)
| ~ reflexive(X0) ),
inference(copy,[status(esa)],[c_32]) ).
cnf(c_224,plain,
( ~ relation(X0)
| well_ordering(X0)
| ~ well_founded_relation(X0)
| ~ connected(X0)
| ~ antisymmetric(X0)
| ~ transitive(X0)
| ~ reflexive(X0) ),
inference(rewriting,[status(thm)],[c_223]) ).
cnf(c_458,plain,
( ~ relation(sk2_esk2_0)
| well_ordering(sk2_esk2_0)
| ~ well_founded_relation(sk2_esk2_0)
| ~ connected(sk2_esk2_0)
| ~ antisymmetric(sk2_esk2_0)
| ~ transitive(sk2_esk2_0) ),
inference(resolution,[status(thm)],[c_454,c_224]) ).
cnf(c_459,plain,
( ~ relation(sk2_esk2_0)
| well_ordering(sk2_esk2_0)
| ~ well_founded_relation(sk2_esk2_0)
| ~ connected(sk2_esk2_0)
| ~ antisymmetric(sk2_esk2_0)
| ~ transitive(sk2_esk2_0) ),
inference(rewriting,[status(thm)],[c_458]) ).
cnf(c_27,plain,
( ~ transitive(X0)
| transitive(X1)
| ~ epred1_2(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_29_1) ).
cnf(c_213,plain,
( ~ transitive(X0)
| transitive(X1)
| ~ epred1_2(X1,X0) ),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_362,plain,
( transitive(sk2_esk2_0)
| ~ transitive(sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_359,c_213]) ).
cnf(c_369,plain,
( transitive(sk2_esk2_0)
| ~ transitive(sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_362]) ).
cnf(c_11,plain,
( transitive(X0)
| ~ relation(X0)
| ~ well_ordering(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_34_2) ).
cnf(c_181,plain,
( transitive(X0)
| ~ relation(X0)
| ~ well_ordering(X0) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_182,plain,
( ~ relation(X0)
| ~ well_ordering(X0)
| transitive(X0) ),
inference(rewriting,[status(thm)],[c_181]) ).
cnf(c_284,plain,
( ~ relation(sk2_esk1_0)
| transitive(sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_255,c_182]) ).
cnf(c_291,plain,
( ~ relation(sk2_esk1_0)
| transitive(sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_284]) ).
cnf(c_328,plain,
transitive(sk2_esk1_0),
inference(forward_subsumption_resolution,[status(thm)],[c_291,c_261]) ).
cnf(c_329,plain,
transitive(sk2_esk1_0),
inference(rewriting,[status(thm)],[c_328]) ).
cnf(c_446,plain,
transitive(sk2_esk2_0),
inference(forward_subsumption_resolution,[status(thm)],[c_369,c_329]) ).
cnf(c_447,plain,
transitive(sk2_esk2_0),
inference(rewriting,[status(thm)],[c_446]) ).
cnf(c_21,plain,
( ~ antisymmetric(X0)
| antisymmetric(X1)
| ~ epred1_2(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_31_1) ).
cnf(c_201,plain,
( ~ antisymmetric(X0)
| antisymmetric(X1)
| ~ epred1_2(X1,X0) ),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_364,plain,
( antisymmetric(sk2_esk2_0)
| ~ antisymmetric(sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_359,c_201]) ).
cnf(c_367,plain,
( antisymmetric(sk2_esk2_0)
| ~ antisymmetric(sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_364]) ).
cnf(c_8,plain,
( antisymmetric(X0)
| ~ relation(X0)
| ~ well_ordering(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_35_2) ).
cnf(c_175,plain,
( antisymmetric(X0)
| ~ relation(X0)
| ~ well_ordering(X0) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_176,plain,
( ~ relation(X0)
| ~ well_ordering(X0)
| antisymmetric(X0) ),
inference(rewriting,[status(thm)],[c_175]) ).
cnf(c_285,plain,
( ~ relation(sk2_esk1_0)
| antisymmetric(sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_255,c_176]) ).
cnf(c_290,plain,
( ~ relation(sk2_esk1_0)
| antisymmetric(sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_285]) ).
cnf(c_321,plain,
antisymmetric(sk2_esk1_0),
inference(forward_subsumption_resolution,[status(thm)],[c_290,c_261]) ).
cnf(c_322,plain,
antisymmetric(sk2_esk1_0),
inference(rewriting,[status(thm)],[c_321]) ).
cnf(c_432,plain,
antisymmetric(sk2_esk2_0),
inference(forward_subsumption_resolution,[status(thm)],[c_367,c_322]) ).
cnf(c_433,plain,
antisymmetric(sk2_esk2_0),
inference(rewriting,[status(thm)],[c_432]) ).
cnf(c_24,plain,
( ~ connected(X0)
| connected(X1)
| ~ epred1_2(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_30_1) ).
cnf(c_207,plain,
( ~ connected(X0)
| connected(X1)
| ~ epred1_2(X1,X0) ),
inference(copy,[status(esa)],[c_24]) ).
cnf(c_363,plain,
( connected(sk2_esk2_0)
| ~ connected(sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_359,c_207]) ).
cnf(c_368,plain,
( connected(sk2_esk2_0)
| ~ connected(sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_363]) ).
cnf(c_5,plain,
( connected(X0)
| ~ relation(X0)
| ~ well_ordering(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_36_2) ).
cnf(c_169,plain,
( connected(X0)
| ~ relation(X0)
| ~ well_ordering(X0) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_170,plain,
( ~ relation(X0)
| ~ well_ordering(X0)
| connected(X0) ),
inference(rewriting,[status(thm)],[c_169]) ).
cnf(c_286,plain,
( ~ relation(sk2_esk1_0)
| connected(sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_255,c_170]) ).
cnf(c_289,plain,
( ~ relation(sk2_esk1_0)
| connected(sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_286]) ).
cnf(c_314,plain,
connected(sk2_esk1_0),
inference(forward_subsumption_resolution,[status(thm)],[c_289,c_261]) ).
cnf(c_315,plain,
connected(sk2_esk1_0),
inference(rewriting,[status(thm)],[c_314]) ).
cnf(c_439,plain,
connected(sk2_esk2_0),
inference(forward_subsumption_resolution,[status(thm)],[c_368,c_315]) ).
cnf(c_440,plain,
connected(sk2_esk2_0),
inference(rewriting,[status(thm)],[c_439]) ).
cnf(c_18,plain,
( ~ well_founded_relation(X0)
| well_founded_relation(X1)
| ~ epred1_2(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_32_1) ).
cnf(c_195,plain,
( ~ well_founded_relation(X0)
| well_founded_relation(X1)
| ~ epred1_2(X1,X0) ),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_365,plain,
( well_founded_relation(sk2_esk2_0)
| ~ well_founded_relation(sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_359,c_195]) ).
cnf(c_366,plain,
( well_founded_relation(sk2_esk2_0)
| ~ well_founded_relation(sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_365]) ).
cnf(c_2,plain,
( well_founded_relation(X0)
| ~ relation(X0)
| ~ well_ordering(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_37_2) ).
cnf(c_163,plain,
( well_founded_relation(X0)
| ~ relation(X0)
| ~ well_ordering(X0) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_164,plain,
( ~ relation(X0)
| ~ well_ordering(X0)
| well_founded_relation(X0) ),
inference(rewriting,[status(thm)],[c_163]) ).
cnf(c_287,plain,
( ~ relation(sk2_esk1_0)
| well_founded_relation(sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_255,c_164]) ).
cnf(c_288,plain,
( ~ relation(sk2_esk1_0)
| well_founded_relation(sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_287]) ).
cnf(c_307,plain,
well_founded_relation(sk2_esk1_0),
inference(forward_subsumption_resolution,[status(thm)],[c_288,c_261]) ).
cnf(c_308,plain,
well_founded_relation(sk2_esk1_0),
inference(rewriting,[status(thm)],[c_307]) ).
cnf(c_425,plain,
well_founded_relation(sk2_esk2_0),
inference(forward_subsumption_resolution,[status(thm)],[c_366,c_308]) ).
cnf(c_426,plain,
well_founded_relation(sk2_esk2_0),
inference(rewriting,[status(thm)],[c_425]) ).
cnf(c_45,negated_conjecture,
~ well_ordering(sk2_esk2_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p',c_0_11) ).
cnf(c_58,negated_conjecture,
~ well_ordering(sk2_esk2_0),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_86,negated_conjecture,
~ well_ordering(sk2_esk2_0),
inference(copy,[status(esa)],[c_58]) ).
cnf(c_99,negated_conjecture,
~ well_ordering(sk2_esk2_0),
inference(copy,[status(esa)],[c_86]) ).
cnf(c_104,negated_conjecture,
~ well_ordering(sk2_esk2_0),
inference(copy,[status(esa)],[c_99]) ).
cnf(c_257,negated_conjecture,
~ well_ordering(sk2_esk2_0),
inference(copy,[status(esa)],[c_104]) ).
cnf(c_516,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_459,c_447,c_433,c_440,c_426,c_257,c_249]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU261+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n005.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 16:10:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % FOF problem with conjecture
% 0.20/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_49d096.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_a25b47.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_65fb95 | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_49d096.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43 % ------ Parsing...% successful
% 0.20/0.43
% 0.20/0.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % ------ Problem Properties
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % EPR true
% 0.20/0.43 % Horn false
% 0.20/0.43 % Has equality false
% 0.20/0.43
% 0.20/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % % ------ Current options:
% 0.20/0.43
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_49d096.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % warning: shown sat in sat incomplete mode
% 0.20/0.43 %
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 cnf(c_17,negated_conjecture,
% 0.20/0.43 ( relation(sk3_esk2_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_13) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_33,negated_conjecture,
% 0.20/0.43 ( relation(sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_17]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_58,negated_conjecture,
% 0.20/0.43 ( relation(sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_33]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_65,negated_conjecture,
% 0.20/0.43 ( relation(sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_58]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_70,negated_conjecture,
% 0.20/0.43 ( relation(sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_65]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_127,negated_conjecture,
% 0.20/0.43 ( relation(sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_70]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_12,plain,
% 0.20/0.43 ( ~ reflexive(X0)
% 0.20/0.43 | ~ transitive(X0)
% 0.20/0.43 | ~ antisymmetric(X0)
% 0.20/0.43 | ~ connected(X0)
% 0.20/0.43 | ~ well_founded_relation(X0)
% 0.20/0.43 | well_ordering(X0)
% 0.20/0.43 | ~ relation(X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_22_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_121,plain,
% 0.20/0.43 ( ~ reflexive(X0)
% 0.20/0.43 | ~ transitive(X0)
% 0.20/0.43 | ~ antisymmetric(X0)
% 0.20/0.43 | ~ connected(X0)
% 0.20/0.43 | ~ well_founded_relation(X0)
% 0.20/0.43 | well_ordering(X0)
% 0.20/0.43 | ~ relation(X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_12]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_122,plain,
% 0.20/0.43 ( ~ relation(X0)
% 0.20/0.43 | ~ well_founded_relation(X0)
% 0.20/0.43 | well_ordering(X0)
% 0.20/0.43 | ~ connected(X0)
% 0.20/0.43 | ~ antisymmetric(X0)
% 0.20/0.43 | ~ transitive(X0)
% 0.20/0.43 | ~ reflexive(X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_121]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_155,plain,
% 0.20/0.43 ( ~ well_founded_relation(sk3_esk2_0)
% 0.20/0.43 | well_ordering(sk3_esk2_0)
% 0.20/0.43 | ~ connected(sk3_esk2_0)
% 0.20/0.43 | ~ antisymmetric(sk3_esk2_0)
% 0.20/0.43 | ~ transitive(sk3_esk2_0)
% 0.20/0.43 | ~ reflexive(sk3_esk2_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_127,c_122]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_166,plain,
% 0.20/0.43 ( ~ well_founded_relation(sk3_esk2_0)
% 0.20/0.43 | well_ordering(sk3_esk2_0)
% 0.20/0.43 | ~ connected(sk3_esk2_0)
% 0.20/0.43 | ~ antisymmetric(sk3_esk2_0)
% 0.20/0.43 | ~ transitive(sk3_esk2_0)
% 0.20/0.43 | ~ reflexive(sk3_esk2_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_155]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_14,negated_conjecture,
% 0.20/0.43 ( ~ well_ordering(sk3_esk2_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_11) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_27,negated_conjecture,
% 0.20/0.43 ( ~ well_ordering(sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_14]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_55,negated_conjecture,
% 0.20/0.43 ( ~ well_ordering(sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_27]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_68,negated_conjecture,
% 0.20/0.43 ( ~ well_ordering(sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_55]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_74,negated_conjecture,
% 0.20/0.43 ( ~ well_ordering(sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_68]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_135,plain,
% 0.20/0.43 ( ~ well_ordering(sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_74]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_240,plain,
% 0.20/0.43 ( ~ well_founded_relation(sk3_esk2_0)
% 0.20/0.43 | ~ connected(sk3_esk2_0)
% 0.20/0.43 | ~ antisymmetric(sk3_esk2_0)
% 0.20/0.43 | ~ transitive(sk3_esk2_0)
% 0.20/0.43 | ~ reflexive(sk3_esk2_0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_166,c_135]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_241,plain,
% 0.20/0.43 ( ~ well_founded_relation(sk3_esk2_0)
% 0.20/0.43 | ~ connected(sk3_esk2_0)
% 0.20/0.43 | ~ antisymmetric(sk3_esk2_0)
% 0.20/0.43 | ~ transitive(sk3_esk2_0)
% 0.20/0.43 | ~ reflexive(sk3_esk2_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_240]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_16,negated_conjecture,
% 0.20/0.43 ( relation(sk3_esk1_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_12) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_31,negated_conjecture,
% 0.20/0.43 ( relation(sk3_esk1_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_16]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_57,negated_conjecture,
% 0.20/0.43 ( relation(sk3_esk1_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_31]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_66,negated_conjecture,
% 0.20/0.43 ( relation(sk3_esk1_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_57]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_69,negated_conjecture,
% 0.20/0.43 ( relation(sk3_esk1_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_66]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_125,negated_conjecture,
% 0.20/0.43 ( relation(sk3_esk1_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_69]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_6,plain,
% 0.20/0.43 ( ~ well_ordering(X0) | reflexive(X0) | ~ relation(X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_28_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_109,plain,
% 0.20/0.43 ( ~ well_ordering(X0) | reflexive(X0) | ~ relation(X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_6]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_110,plain,
% 0.20/0.43 ( ~ relation(X0) | ~ well_ordering(X0) | reflexive(X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_109]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_142,plain,
% 0.20/0.43 ( ~ well_ordering(sk3_esk1_0) | reflexive(sk3_esk1_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_125,c_110]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_151,plain,
% 0.20/0.43 ( ~ well_ordering(sk3_esk1_0) | reflexive(sk3_esk1_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_142]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_20,negated_conjecture,
% 0.20/0.43 ( well_ordering(sk3_esk1_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_16) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_39,negated_conjecture,
% 0.20/0.43 ( well_ordering(sk3_esk1_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_20]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_61,negated_conjecture,
% 0.20/0.43 ( well_ordering(sk3_esk1_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_39]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_62,negated_conjecture,
% 0.20/0.43 ( well_ordering(sk3_esk1_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_61]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_73,negated_conjecture,
% 0.20/0.43 ( well_ordering(sk3_esk1_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_62]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_133,plain,
% 0.20/0.43 ( well_ordering(sk3_esk1_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_73]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_211,plain,
% 0.20/0.43 ( reflexive(sk3_esk1_0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_151,c_133]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_212,plain,
% 0.20/0.43 ( reflexive(sk3_esk1_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_211]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_5,plain,
% 0.20/0.43 ( ~ well_ordering(X0) | transitive(X0) | ~ relation(X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_29_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_107,plain,
% 0.20/0.43 ( ~ well_ordering(X0) | transitive(X0) | ~ relation(X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_5]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_108,plain,
% 0.20/0.43 ( ~ relation(X0) | ~ well_ordering(X0) | transitive(X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_107]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_143,plain,
% 0.20/0.43 ( ~ well_ordering(sk3_esk1_0) | transitive(sk3_esk1_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_125,c_108]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_150,plain,
% 0.20/0.43 ( ~ well_ordering(sk3_esk1_0) | transitive(sk3_esk1_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_143]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_206,plain,
% 0.20/0.43 ( transitive(sk3_esk1_0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_150,c_133]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_207,plain,
% 0.20/0.43 ( transitive(sk3_esk1_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_206]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_4,plain,
% 0.20/0.43 ( ~ well_ordering(X0) | antisymmetric(X0) | ~ relation(X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_30_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_105,plain,
% 0.20/0.43 ( ~ well_ordering(X0) | antisymmetric(X0) | ~ relation(X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_4]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_106,plain,
% 0.20/0.43 ( ~ relation(X0) | ~ well_ordering(X0) | antisymmetric(X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_105]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_144,plain,
% 0.20/0.43 ( ~ well_ordering(sk3_esk1_0) | antisymmetric(sk3_esk1_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_125,c_106]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_149,plain,
% 0.20/0.43 ( ~ well_ordering(sk3_esk1_0) | antisymmetric(sk3_esk1_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_144]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_201,plain,
% 0.20/0.43 ( antisymmetric(sk3_esk1_0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_149,c_133]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_202,plain,
% 0.20/0.43 ( antisymmetric(sk3_esk1_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_201]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_3,plain,
% 0.20/0.43 ( ~ well_ordering(X0) | connected(X0) | ~ relation(X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_31_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_103,plain,
% 0.20/0.43 ( ~ well_ordering(X0) | connected(X0) | ~ relation(X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_3]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_104,plain,
% 0.20/0.43 ( ~ relation(X0) | ~ well_ordering(X0) | connected(X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_103]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_145,plain,
% 0.20/0.43 ( ~ well_ordering(sk3_esk1_0) | connected(sk3_esk1_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_125,c_104]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_148,plain,
% 0.20/0.43 ( ~ well_ordering(sk3_esk1_0) | connected(sk3_esk1_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_145]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_196,plain,
% 0.20/0.43 ( connected(sk3_esk1_0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_148,c_133]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_197,plain,
% 0.20/0.43 ( connected(sk3_esk1_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_196]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_2,plain,
% 0.20/0.43 ( ~ well_ordering(X0) | well_founded_relation(X0) | ~ relation(X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_32_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_101,plain,
% 0.20/0.43 ( ~ well_ordering(X0) | well_founded_relation(X0) | ~ relation(X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_2]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_102,plain,
% 0.20/0.43 ( ~ relation(X0) | well_founded_relation(X0) | ~ well_ordering(X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_101]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_146,plain,
% 0.20/0.43 ( well_founded_relation(sk3_esk1_0) | ~ well_ordering(sk3_esk1_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_125,c_102]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_147,plain,
% 0.20/0.43 ( well_founded_relation(sk3_esk1_0) | ~ well_ordering(sk3_esk1_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_146]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_191,plain,
% 0.20/0.43 ( well_founded_relation(sk3_esk1_0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_147,c_133]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_192,plain,
% 0.20/0.43 ( well_founded_relation(sk3_esk1_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_191]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_18,negated_conjecture,
% 0.20/0.43 ( relation(sk3_esk3_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_14) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_35,negated_conjecture,
% 0.20/0.43 ( relation(sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_18]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_59,negated_conjecture,
% 0.20/0.43 ( relation(sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_35]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_64,negated_conjecture,
% 0.20/0.43 ( relation(sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_59]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_71,negated_conjecture,
% 0.20/0.43 ( relation(sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_64]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_129,negated_conjecture,
% 0.20/0.43 ( relation(sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_71]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_174,plain,
% 0.20/0.43 ( well_founded_relation(sk3_esk3_0) | ~ well_ordering(sk3_esk3_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_129,c_102]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_175,plain,
% 0.20/0.43 ( well_founded_relation(sk3_esk3_0) | ~ well_ordering(sk3_esk3_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_174]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_173,plain,
% 0.20/0.43 ( ~ well_ordering(sk3_esk3_0) | connected(sk3_esk3_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_129,c_104]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_176,plain,
% 0.20/0.43 ( ~ well_ordering(sk3_esk3_0) | connected(sk3_esk3_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_173]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_172,plain,
% 0.20/0.43 ( ~ well_ordering(sk3_esk3_0) | antisymmetric(sk3_esk3_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_129,c_106]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_177,plain,
% 0.20/0.43 ( ~ well_ordering(sk3_esk3_0) | antisymmetric(sk3_esk3_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_172]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_171,plain,
% 0.20/0.43 ( ~ well_ordering(sk3_esk3_0) | transitive(sk3_esk3_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_129,c_108]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_178,plain,
% 0.20/0.43 ( ~ well_ordering(sk3_esk3_0) | transitive(sk3_esk3_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_171]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_170,plain,
% 0.20/0.43 ( ~ well_ordering(sk3_esk3_0) | reflexive(sk3_esk3_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_129,c_110]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_179,plain,
% 0.20/0.43 ( ~ well_ordering(sk3_esk3_0) | reflexive(sk3_esk3_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_170]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_169,plain,
% 0.20/0.43 ( ~ well_founded_relation(sk3_esk3_0)
% 0.20/0.43 | well_ordering(sk3_esk3_0)
% 0.20/0.43 | ~ connected(sk3_esk3_0)
% 0.20/0.43 | ~ antisymmetric(sk3_esk3_0)
% 0.20/0.43 | ~ transitive(sk3_esk3_0)
% 0.20/0.43 | ~ reflexive(sk3_esk3_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_129,c_122]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_180,plain,
% 0.20/0.43 ( ~ well_founded_relation(sk3_esk3_0)
% 0.20/0.43 | well_ordering(sk3_esk3_0)
% 0.20/0.43 | ~ connected(sk3_esk3_0)
% 0.20/0.43 | ~ antisymmetric(sk3_esk3_0)
% 0.20/0.43 | ~ transitive(sk3_esk3_0)
% 0.20/0.43 | ~ reflexive(sk3_esk3_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_169]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_13,plain,
% 0.20/0.43 ( ~ relation(X0)
% 0.20/0.43 | ~ relation(X1)
% 0.20/0.43 | ~ function(X1)
% 0.20/0.43 | ~ relation_isomorphism(X2,X0,X1)
% 0.20/0.43 | lhs_atom1(X2)
% 0.20/0.43 | epred1_2(X0,X2) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_21_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_123,plain,
% 0.20/0.43 ( ~ relation(X0)
% 0.20/0.43 | ~ relation(X1)
% 0.20/0.43 | ~ function(X1)
% 0.20/0.43 | ~ relation_isomorphism(X2,X0,X1)
% 0.20/0.43 | lhs_atom1(X2)
% 0.20/0.43 | epred1_2(X0,X2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_13]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_124,plain,
% 0.20/0.43 ( ~ relation(X0)
% 0.20/0.43 | ~ relation(X1)
% 0.20/0.43 | ~ function(X1)
% 0.20/0.43 | epred1_2(X0,X2)
% 0.20/0.43 | lhs_atom1(X2)
% 0.20/0.43 | ~ relation_isomorphism(X2,X0,X1) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_123]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_19,negated_conjecture,
% 0.20/0.43 ( function(sk3_esk3_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_15) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_37,negated_conjecture,
% 0.20/0.43 ( function(sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_19]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_60,negated_conjecture,
% 0.20/0.43 ( function(sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_37]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_63,negated_conjecture,
% 0.20/0.43 ( function(sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_60]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_72,negated_conjecture,
% 0.20/0.43 ( function(sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_63]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_131,negated_conjecture,
% 0.20/0.43 ( function(sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_72]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_15,negated_conjecture,
% 0.20/0.43 ( relation_isomorphism(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_10) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_29,negated_conjecture,
% 0.20/0.43 ( relation_isomorphism(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_15]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_56,negated_conjecture,
% 0.20/0.43 ( relation_isomorphism(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_29]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_67,negated_conjecture,
% 0.20/0.43 ( relation_isomorphism(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_56]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_75,negated_conjecture,
% 0.20/0.43 ( relation_isomorphism(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_67]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_137,negated_conjecture,
% 0.20/0.43 ( relation_isomorphism(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_75]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_11,plain,
% 0.20/0.43 ( ~ reflexive(X0) | reflexive(X1) | ~ epred1_2(X1,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_23_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_119,plain,
% 0.20/0.43 ( ~ reflexive(X0) | reflexive(X1) | ~ epred1_2(X1,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_11]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_10,plain,
% 0.20/0.43 ( ~ transitive(X0) | transitive(X1) | ~ epred1_2(X1,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_24_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_117,plain,
% 0.20/0.43 ( ~ transitive(X0) | transitive(X1) | ~ epred1_2(X1,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_10]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_9,plain,
% 0.20/0.43 ( ~ connected(X0) | connected(X1) | ~ epred1_2(X1,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_25_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_115,plain,
% 0.20/0.43 ( ~ connected(X0) | connected(X1) | ~ epred1_2(X1,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_9]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_8,plain,
% 0.20/0.43 ( ~ antisymmetric(X0) | antisymmetric(X1) | ~ epred1_2(X1,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_26_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_113,plain,
% 0.20/0.43 ( ~ antisymmetric(X0) | antisymmetric(X1) | ~ epred1_2(X1,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_8]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_7,plain,
% 0.20/0.43 ( ~ well_founded_relation(X0)
% 0.20/0.43 | well_founded_relation(X1)
% 0.20/0.43 | ~ epred1_2(X1,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_27_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_111,plain,
% 0.20/0.43 ( ~ well_founded_relation(X0)
% 0.20/0.43 | well_founded_relation(X1)
% 0.20/0.43 | ~ epred1_2(X1,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_7]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_1,plain,
% 0.20/0.43 ( function(sk2_esk1_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_6_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_99,plain,
% 0.20/0.43 ( function(sk2_esk1_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_1]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_0,plain,
% 0.20/0.43 ( relation(sk2_esk1_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a25b47.p', c_0_5_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_97,plain,
% 0.20/0.43 ( relation(sk2_esk1_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Statistics
% 0.20/0.43
% 0.20/0.43 % ------ General
% 0.20/0.43
% 0.20/0.43 % num_of_input_clauses: 21
% 0.20/0.43 % num_of_input_neg_conjectures: 7
% 0.20/0.43 % num_of_splits: 0
% 0.20/0.43 % num_of_split_atoms: 0
% 0.20/0.43 % num_of_sem_filtered_clauses: 0
% 0.20/0.43 % num_of_subtypes: 0
% 0.20/0.43 % monotx_restored_types: 0
% 0.20/0.43 % sat_num_of_epr_types: 0
% 0.20/0.43 % sat_num_of_non_cyclic_types: 0
% 0.20/0.43 % sat_guarded_non_collapsed_types: 0
% 0.20/0.43 % is_epr: 1
% 0.20/0.43 % is_horn: 0
% 0.20/0.43 % has_eq: 0
% 0.20/0.43 % num_pure_diseq_elim: 0
% 0.20/0.43 % simp_replaced_by: 0
% 0.20/0.43 % res_preprocessed: 14
% 0.20/0.43 % prep_upred: 0
% 0.20/0.43 % prep_unflattend: 0
% 0.20/0.43 % pred_elim_cands: 0
% 0.20/0.43 % pred_elim: 0
% 0.20/0.43 % pred_elim_cl: 0
% 0.20/0.43 % pred_elim_cycles: 0
% 0.20/0.43 % forced_gc_time: 0
% 0.20/0.43 % gc_basic_clause_elim: 0
% 0.20/0.43 % parsing_time: 0.
% 0.20/0.43 % sem_filter_time: 0.
% 0.20/0.43 % pred_elim_time: 0.
% 0.20/0.43 % out_proof_time: 0.
% 0.20/0.43 % monotx_time: 0.
% 0.20/0.43 % subtype_inf_time: 0.
% 0.20/0.43 % unif_index_cands_time: 0.
% 0.20/0.43 % unif_index_add_time: 0.
% 0.20/0.43 % total_time: 0.026
% 0.20/0.43 % num_of_symbols: 40
% 0.20/0.43 % num_of_terms: 113
% 0.20/0.43
% 0.20/0.43 % ------ Propositional Solver
% 0.20/0.43
% 0.20/0.43 % prop_solver_calls: 1
% 0.20/0.43 % prop_fast_solver_calls: 21
% 0.20/0.43 % prop_num_of_clauses: 27
% 0.20/0.43 % prop_preprocess_simplified: 95
% 0.20/0.43 % prop_fo_subsumed: 0
% 0.20/0.43 % prop_solver_time: 0.
% 0.20/0.43 % prop_fast_solver_time: 0.
% 0.20/0.43 % prop_unsat_core_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ QBF
% 0.20/0.43
% 0.20/0.43 % qbf_q_res: 0
% 0.20/0.43 % qbf_num_tautologies: 0
% 0.20/0.43 % qbf_prep_cycles: 0
% 0.20/0.43
% 0.20/0.43 % ------ BMC1
% 0.20/0.43
% 0.20/0.43 % bmc1_current_bound: -1
% 0.20/0.43 % bmc1_last_solved_bound: -1
% 0.20/0.43 % bmc1_unsat_core_size: -1
% 0.20/0.43 % bmc1_unsat_core_parents_size: -1
% 0.20/0.43 % bmc1_merge_next_fun: 0
% 0.20/0.43 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation
% 0.20/0.43
% 0.20/0.43 % inst_num_of_clauses: 21
% 0.20/0.43 % inst_num_in_passive: 0
% 0.20/0.43 % inst_num_in_active: 0
% 0.20/0.43 % inst_num_in_unprocessed: 21
% 0.20/0.43 % inst_num_of_loops: 0
% 0.20/0.43 % inst_num_of_learning_restarts: 0
% 0.20/0.43 % inst_num_moves_active_passive: 0
% 0.20/0.43 % inst_lit_activity: 0
% 0.20/0.43 % inst_lit_activity_moves: 0
% 0.20/0.43 % inst_num_tautologies: 0
% 0.20/0.43 % inst_num_prop_implied: 0
% 0.20/0.43 % inst_num_existing_simplified: 0
% 0.20/0.43 % inst_num_eq_res_simplified: 0
% 0.20/0.43 % inst_num_child_elim: 0
% 0.20/0.43 % inst_num_of_dismatching_blockings: 0
% 0.20/0.43 % inst_num_of_non_proper_insts: 0
% 0.20/0.43 % inst_num_of_duplicates: 0
% 0.20/0.43 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.43 % inst_dismatching_checking_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Resolution
% 0.20/0.43
% 0.20/0.43 % res_num_of_clauses: 40
% 0.20/0.44 % res_num_in_passive: 0
% 0.20/0.44 % res_num_in_active: 33
% 0.20/0.44 % res_num_of_loops: 20
% 0.20/0.44 % res_forward_subset_subsumed: 6
% 0.20/0.44 % res_backward_subset_subsumed: 0
% 0.20/0.44 % res_forward_subsumed: 0
% 0.20/0.44 % res_backward_subsumed: 0
% 0.20/0.44 % res_forward_subsumption_resolution: 6
% 0.20/0.44 % res_backward_subsumption_resolution: 0
% 0.20/0.44 % res_clause_to_clause_subsumption: 6
% 0.20/0.44 % res_orphan_elimination: 0
% 0.20/0.44 % res_tautology_del: 1
% 0.20/0.44 % res_num_eq_res_simplified: 0
% 0.20/0.44 % res_num_sel_changes: 0
% 0.20/0.44 % res_moves_from_active_to_pass: 0
% 0.20/0.44
% 0.20/0.44 % Status Unknown
% 0.20/0.47 % Orienting using strategy ClausalAll
% 0.20/0.47 % FOF problem with conjecture
% 0.20/0.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_49d096.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_a25b47.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_f7a3a2 | grep -v "SZS"
% 0.20/0.50
% 0.20/0.50 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % ------ iProver source info
% 0.20/0.50
% 0.20/0.50 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.50 % git: non_committed_changes: true
% 0.20/0.50 % git: last_make_outside_of_git: true
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % ------ Input Options
% 0.20/0.50
% 0.20/0.50 % --out_options all
% 0.20/0.50 % --tptp_safe_out true
% 0.20/0.50 % --problem_path ""
% 0.20/0.50 % --include_path ""
% 0.20/0.50 % --clausifier .//eprover
% 0.20/0.50 % --clausifier_options --tstp-format
% 0.20/0.50 % --stdin false
% 0.20/0.50 % --dbg_backtrace false
% 0.20/0.50 % --dbg_dump_prop_clauses false
% 0.20/0.50 % --dbg_dump_prop_clauses_file -
% 0.20/0.50 % --dbg_out_stat false
% 0.20/0.50
% 0.20/0.50 % ------ General Options
% 0.20/0.50
% 0.20/0.50 % --fof false
% 0.20/0.50 % --time_out_real 150.
% 0.20/0.50 % --time_out_prep_mult 0.2
% 0.20/0.50 % --time_out_virtual -1.
% 0.20/0.50 % --schedule none
% 0.20/0.50 % --ground_splitting input
% 0.20/0.50 % --splitting_nvd 16
% 0.20/0.50 % --non_eq_to_eq false
% 0.20/0.50 % --prep_gs_sim true
% 0.20/0.50 % --prep_unflatten false
% 0.20/0.50 % --prep_res_sim true
% 0.20/0.50 % --prep_upred true
% 0.20/0.50 % --res_sim_input true
% 0.20/0.50 % --clause_weak_htbl true
% 0.20/0.50 % --gc_record_bc_elim false
% 0.20/0.50 % --symbol_type_check false
% 0.20/0.50 % --clausify_out false
% 0.20/0.50 % --large_theory_mode false
% 0.20/0.50 % --prep_sem_filter none
% 0.20/0.50 % --prep_sem_filter_out false
% 0.20/0.50 % --preprocessed_out false
% 0.20/0.50 % --sub_typing false
% 0.20/0.50 % --brand_transform false
% 0.20/0.50 % --pure_diseq_elim true
% 0.20/0.50 % --min_unsat_core false
% 0.20/0.50 % --pred_elim true
% 0.20/0.50 % --add_important_lit false
% 0.20/0.50 % --soft_assumptions false
% 0.20/0.50 % --reset_solvers false
% 0.20/0.50 % --bc_imp_inh []
% 0.20/0.50 % --conj_cone_tolerance 1.5
% 0.20/0.50 % --prolific_symb_bound 500
% 0.20/0.50 % --lt_threshold 2000
% 0.20/0.50
% 0.20/0.50 % ------ SAT Options
% 0.20/0.50
% 0.20/0.50 % --sat_mode false
% 0.20/0.50 % --sat_fm_restart_options ""
% 0.20/0.50 % --sat_gr_def false
% 0.20/0.50 % --sat_epr_types true
% 0.20/0.50 % --sat_non_cyclic_types false
% 0.20/0.50 % --sat_finite_models false
% 0.20/0.50 % --sat_fm_lemmas false
% 0.20/0.50 % --sat_fm_prep false
% 0.20/0.50 % --sat_fm_uc_incr true
% 0.20/0.50 % --sat_out_model small
% 0.20/0.50 % --sat_out_clauses false
% 0.20/0.50
% 0.20/0.50 % ------ QBF Options
% 0.20/0.50
% 0.20/0.50 % --qbf_mode false
% 0.20/0.50 % --qbf_elim_univ true
% 0.20/0.50 % --qbf_sk_in true
% 0.20/0.50 % --qbf_pred_elim true
% 0.20/0.50 % --qbf_split 32
% 0.20/0.50
% 0.20/0.50 % ------ BMC1 Options
% 0.20/0.50
% 0.20/0.50 % --bmc1_incremental false
% 0.20/0.50 % --bmc1_axioms reachable_all
% 0.20/0.50 % --bmc1_min_bound 0
% 0.20/0.50 % --bmc1_max_bound -1
% 0.20/0.50 % --bmc1_max_bound_default -1
% 0.20/0.50 % --bmc1_symbol_reachability true
% 0.20/0.50 % --bmc1_property_lemmas false
% 0.20/0.50 % --bmc1_k_induction false
% 0.20/0.50 % --bmc1_non_equiv_states false
% 0.20/0.50 % --bmc1_deadlock false
% 0.20/0.50 % --bmc1_ucm false
% 0.20/0.50 % --bmc1_add_unsat_core none
% 0.20/0.50 % --bmc1_unsat_core_children false
% 0.20/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.50 % --bmc1_out_stat full
% 0.20/0.50 % --bmc1_ground_init false
% 0.20/0.50 % --bmc1_pre_inst_next_state false
% 0.20/0.50 % --bmc1_pre_inst_state false
% 0.20/0.50 % --bmc1_pre_inst_reach_state false
% 0.20/0.50 % --bmc1_out_unsat_core false
% 0.20/0.50 % --bmc1_aig_witness_out false
% 0.20/0.50 % --bmc1_verbose false
% 0.20/0.50 % --bmc1_dump_clauses_tptp false
% 0.20/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.51 % --bmc1_dump_file -
% 0.20/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.51 % --bmc1_ucm_extend_mode 1
% 0.20/0.51 % --bmc1_ucm_init_mode 2
% 0.20/0.51 % --bmc1_ucm_cone_mode none
% 0.20/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.51 % --bmc1_ucm_relax_model 4
% 0.20/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.51 % --bmc1_ucm_layered_model none
% 0.20/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.51
% 0.20/0.51 % ------ AIG Options
% 0.20/0.51
% 0.20/0.51 % --aig_mode false
% 0.20/0.51
% 0.20/0.51 % ------ Instantiation Options
% 0.20/0.51
% 0.20/0.51 % --instantiation_flag true
% 0.20/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.51 % --inst_solver_per_active 750
% 0.20/0.51 % --inst_solver_calls_frac 0.5
% 0.20/0.51 % --inst_passive_queue_type priority_queues
% 0.20/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.51 % --inst_passive_queues_freq [25;2]
% 0.20/0.51 % --inst_dismatching true
% 0.20/0.51 % --inst_eager_unprocessed_to_passive true
% 0.20/0.51 % --inst_prop_sim_given true
% 0.20/0.51 % --inst_prop_sim_new false
% 0.20/0.51 % --inst_orphan_elimination true
% 0.20/0.51 % --inst_learning_loop_flag true
% 0.20/0.51 % --inst_learning_start 3000
% 0.20/0.51 % --inst_learning_factor 2
% 0.20/0.51 % --inst_start_prop_sim_after_learn 3
% 0.20/0.51 % --inst_sel_renew solver
% 0.20/0.51 % --inst_lit_activity_flag true
% 0.20/0.51 % --inst_out_proof true
% 0.20/0.51
% 0.20/0.51 % ------ Resolution Options
% 0.20/0.51
% 0.20/0.51 % --resolution_flag true
% 0.20/0.51 % --res_lit_sel kbo_max
% 0.20/0.51 % --res_to_prop_solver none
% 0.20/0.51 % --res_prop_simpl_new false
% 0.20/0.51 % --res_prop_simpl_given false
% 0.20/0.51 % --res_passive_queue_type priority_queues
% 0.20/0.51 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.51 % --res_passive_queues_freq [15;5]
% 0.20/0.51 % --res_forward_subs full
% 0.20/0.51 % --res_backward_subs full
% 0.20/0.51 % --res_forward_subs_resolution true
% 0.20/0.51 % --res_backward_subs_resolution true
% 0.20/0.51 % --res_orphan_elimination false
% 0.20/0.51 % --res_time_limit 1000.
% 0.20/0.51 % --res_out_proof true
% 0.20/0.51 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_49d096.s
% 0.20/0.51 % --modulo true
% 0.20/0.51
% 0.20/0.51 % ------ Combination Options
% 0.20/0.51
% 0.20/0.51 % --comb_res_mult 1000
% 0.20/0.51 % --comb_inst_mult 300
% 0.20/0.51 % ------
% 0.20/0.51
% 0.20/0.51 % ------ Parsing...% successful
% 0.20/0.51
% 0.20/0.51 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.51
% 0.20/0.51 % ------ Proving...
% 0.20/0.51 % ------ Problem Properties
% 0.20/0.51
% 0.20/0.51 %
% 0.20/0.51 % EPR true
% 0.20/0.51 % Horn true
% 0.20/0.51 % Has equality false
% 0.20/0.51
% 0.20/0.51 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 % % ------ Current options:
% 0.20/0.51
% 0.20/0.51 % ------ Input Options
% 0.20/0.51
% 0.20/0.51 % --out_options all
% 0.20/0.51 % --tptp_safe_out true
% 0.20/0.51 % --problem_path ""
% 0.20/0.51 % --include_path ""
% 0.20/0.51 % --clausifier .//eprover
% 0.20/0.51 % --clausifier_options --tstp-format
% 0.20/0.51 % --stdin false
% 0.20/0.51 % --dbg_backtrace false
% 0.20/0.51 % --dbg_dump_prop_clauses false
% 0.20/0.51 % --dbg_dump_prop_clauses_file -
% 0.20/0.51 % --dbg_out_stat false
% 0.20/0.51
% 0.20/0.51 % ------ General Options
% 0.20/0.51
% 0.20/0.51 % --fof false
% 0.20/0.51 % --time_out_real 150.
% 0.20/0.51 % --time_out_prep_mult 0.2
% 0.20/0.51 % --time_out_virtual -1.
% 0.20/0.51 % --schedule none
% 0.20/0.51 % --ground_splitting input
% 0.20/0.51 % --splitting_nvd 16
% 0.20/0.51 % --non_eq_to_eq false
% 0.20/0.51 % --prep_gs_sim true
% 0.20/0.51 % --prep_unflatten false
% 0.20/0.51 % --prep_res_sim true
% 0.20/0.51 % --prep_upred true
% 0.20/0.51 % --res_sim_input true
% 0.20/0.51 % --clause_weak_htbl true
% 0.20/0.51 % --gc_record_bc_elim false
% 0.20/0.51 % --symbol_type_check false
% 0.20/0.51 % --clausify_out false
% 0.20/0.51 % --large_theory_mode false
% 0.20/0.51 % --prep_sem_filter none
% 0.20/0.51 % --prep_sem_filter_out false
% 0.20/0.51 % --preprocessed_out false
% 0.20/0.51 % --sub_typing false
% 0.20/0.51 % --brand_transform false
% 0.20/0.51 % --pure_diseq_elim true
% 0.20/0.51 % --min_unsat_core false
% 0.20/0.51 % --pred_elim true
% 0.20/0.51 % --add_important_lit false
% 0.20/0.51 % --soft_assumptions false
% 0.20/0.51 % --reset_solvers false
% 0.20/0.51 % --bc_imp_inh []
% 0.20/0.51 % --conj_cone_tolerance 1.5
% 0.20/0.51 % --prolific_symb_bound 500
% 0.20/0.51 % --lt_threshold 2000
% 0.20/0.51
% 0.20/0.51 % ------ SAT Options
% 0.20/0.51
% 0.20/0.51 % --sat_mode false
% 0.20/0.51 % --sat_fm_restart_options ""
% 0.20/0.51 % --sat_gr_def false
% 0.20/0.51 % --sat_epr_types true
% 0.20/0.51 % --sat_non_cyclic_types false
% 0.20/0.51 % --sat_finite_models false
% 0.20/0.51 % --sat_fm_lemmas false
% 0.20/0.51 % --sat_fm_prep false
% 0.20/0.51 % --sat_fm_uc_incr true
% 0.20/0.51 % --sat_out_model small
% 0.20/0.51 % --sat_out_clauses false
% 0.20/0.51
% 0.20/0.51 % ------ QBF Options
% 0.20/0.51
% 0.20/0.51 % --qbf_mode false
% 0.20/0.51 % --qbf_elim_univ true
% 0.20/0.51 % --qbf_sk_in true
% 0.20/0.51 % --qbf_pred_elim true
% 0.20/0.51 % --qbf_split 32
% 0.20/0.51
% 0.20/0.51 % ------ BMC1 Options
% 0.20/0.51
% 0.20/0.51 % --bmc1_incremental false
% 0.20/0.51 % --bmc1_axioms reachable_all
% 0.20/0.51 % --bmc1_min_bound 0
% 0.20/0.51 % --bmc1_max_bound -1
% 0.20/0.51 % --bmc1_max_bound_default -1
% 0.20/0.51 % --bmc1_symbol_reachability true
% 0.20/0.51 % --bmc1_property_lemmas false
% 0.20/0.51 % --bmc1_k_induction false
% 0.20/0.51 % --bmc1_non_equiv_states false
% 0.20/0.51 % --bmc1_deadlock false
% 0.20/0.51 % --bmc1_ucm false
% 0.20/0.51 % --bmc1_add_unsat_core none
% 0.20/0.51 % --bmc1_unsat_core_children false
% 0.20/0.51 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.51 % --bmc1_out_stat full
% 0.20/0.51 % --bmc1_ground_init false
% 0.20/0.51 % --bmc1_pre_inst_next_state false
% 0.20/0.51 % --bmc1_pre_inst_state false
% 0.20/0.51 % --bmc1_pre_inst_reach_state false
% 0.20/0.51 % --bmc1_out_unsat_core false
% 0.20/0.51 % --bmc1_aig_witness_out false
% 0.20/0.51 % --bmc1_verbose false
% 0.20/0.51 % --bmc1_dump_clauses_tptp false
% 0.20/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.51 % --bmc1_dump_file -
% 0.20/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.51 % --bmc1_ucm_extend_mode 1
% 0.20/0.51 % --bmc1_ucm_init_mode 2
% 0.20/0.51 % --bmc1_ucm_cone_mode none
% 0.20/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.51 % --bmc1_ucm_relax_model 4
% 0.20/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.51 % --bmc1_ucm_layered_model none
% 0.20/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.51
% 0.20/0.51 % ------ AIG Options
% 0.20/0.51
% 0.20/0.51 % --aig_mode false
% 0.20/0.51
% 0.20/0.51 % ------ Instantiation Options
% 0.20/0.51
% 0.20/0.51 % --instantiation_flag true
% 0.20/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.51 % --inst_solver_per_active 750
% 0.20/0.51 % --inst_solver_calls_frac 0.5
% 0.20/0.51 % --inst_passive_queue_type priority_queues
% 0.20/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.51 % --inst_passive_queues_freq [25;2]
% 0.20/0.51 % --inst_dismatching true
% 0.20/0.51 % --inst_eager_unprocessed_to_passive true
% 0.20/0.51 % --inst_prop_sim_given true
% 0.20/0.51 % --inst_prop_sim_new false
% 0.20/0.51 % --inst_orphan_elimination true
% 0.20/0.51 % --inst_learning_loop_flag true
% 0.20/0.51 % --inst_learning_start 3000
% 0.20/0.51 % --inst_learning_factor 2
% 0.20/0.51 % --inst_start_prop_sim_after_learn 3
% 0.20/0.51 % --inst_sel_renew solver
% 0.20/0.51 % --inst_lit_activity_flag true
% 0.20/0.51 % --inst_out_proof true
% 0.20/0.51
% 0.20/0.51 % ------ Resolution Options
% 0.20/0.51
% 0.20/0.51 % --resolution_flag true
% 0.20/0.51 % --res_lit_sel kbo_max
% 0.20/0.51 % --res_to_prop_solver none
% 0.20/0.51 % --res_prop_simpl_new false
% 0.20/0.51 % --res_prop_simpl_given false
% 0.20/0.51 % --res_passive_queue_type priority_queues
% 0.20/0.51 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.51 % --res_passive_queues_freq [15;5]
% 0.20/0.51 % --res_forward_subs full
% 0.20/0.51 % --res_backward_subs full
% 0.20/0.51 % --res_forward_subs_resolution true
% 0.20/0.51 % --res_backward_subs_resolution true
% 0.20/0.51 % --res_orphan_elimination false
% 0.20/0.51 % --res_time_limit 1000.
% 0.20/0.51 % --res_out_proof true
% 0.20/0.51 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_49d096.s
% 0.20/0.51 % --modulo true
% 0.20/0.51
% 0.20/0.51 % ------ Combination Options
% 0.20/0.51
% 0.20/0.51 % --comb_res_mult 1000
% 0.20/0.51 % --comb_inst_mult 300
% 0.20/0.51 % ------
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 % ------ Proving...
% 0.20/0.51 %
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 % Resolution empty clause
% 0.20/0.51
% 0.20/0.51 % ------ Statistics
% 0.20/0.51
% 0.20/0.51 % ------ General
% 0.20/0.51
% 0.20/0.51 % num_of_input_clauses: 52
% 0.20/0.51 % num_of_input_neg_conjectures: 7
% 0.20/0.51 % num_of_splits: 0
% 0.20/0.51 % num_of_split_atoms: 0
% 0.20/0.51 % num_of_sem_filtered_clauses: 0
% 0.20/0.51 % num_of_subtypes: 0
% 0.20/0.51 % monotx_restored_types: 0
% 0.20/0.51 % sat_num_of_epr_types: 0
% 0.20/0.51 % sat_num_of_non_cyclic_types: 0
% 0.20/0.51 % sat_guarded_non_collapsed_types: 0
% 0.20/0.51 % is_epr: 1
% 0.20/0.52 % is_horn: 1
% 0.20/0.52 % has_eq: 0
% 0.20/0.52 % num_pure_diseq_elim: 0
% 0.20/0.52 % simp_replaced_by: 0
% 0.20/0.52 % res_preprocessed: 14
% 0.20/0.52 % prep_upred: 0
% 0.20/0.52 % prep_unflattend: 0
% 0.20/0.52 % pred_elim_cands: 0
% 0.20/0.52 % pred_elim: 0
% 0.20/0.52 % pred_elim_cl: 0
% 0.20/0.52 % pred_elim_cycles: 0
% 0.20/0.52 % forced_gc_time: 0
% 0.20/0.52 % gc_basic_clause_elim: 0
% 0.20/0.52 % parsing_time: 0.002
% 0.20/0.52 % sem_filter_time: 0.
% 0.20/0.52 % pred_elim_time: 0.
% 0.20/0.52 % out_proof_time: 0.003
% 0.20/0.52 % monotx_time: 0.
% 0.20/0.52 % subtype_inf_time: 0.
% 0.20/0.52 % unif_index_cands_time: 0.
% 0.20/0.52 % unif_index_add_time: 0.
% 0.20/0.52 % total_time: 0.033
% 0.20/0.52 % num_of_symbols: 39
% 0.20/0.52 % num_of_terms: 134
% 0.20/0.52
% 0.20/0.52 % ------ Propositional Solver
% 0.20/0.52
% 0.20/0.52 % prop_solver_calls: 1
% 0.20/0.52 % prop_fast_solver_calls: 21
% 0.20/0.52 % prop_num_of_clauses: 33
% 0.20/0.52 % prop_preprocess_simplified: 213
% 0.20/0.52 % prop_fo_subsumed: 0
% 0.20/0.52 % prop_solver_time: 0.
% 0.20/0.52 % prop_fast_solver_time: 0.
% 0.20/0.52 % prop_unsat_core_time: 0.
% 0.20/0.52
% 0.20/0.52 % ------ QBF
% 0.20/0.52
% 0.20/0.52 % qbf_q_res: 0
% 0.20/0.52 % qbf_num_tautologies: 0
% 0.20/0.52 % qbf_prep_cycles: 0
% 0.20/0.52
% 0.20/0.52 % ------ BMC1
% 0.20/0.52
% 0.20/0.52 % bmc1_current_bound: -1
% 0.20/0.52 % bmc1_last_solved_bound: -1
% 0.20/0.52 % bmc1_unsat_core_size: -1
% 0.20/0.52 % bmc1_unsat_core_parents_size: -1
% 0.20/0.52 % bmc1_merge_next_fun: 0
% 0.20/0.52 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.52
% 0.20/0.52 % ------ Instantiation
% 0.20/0.52
% 0.20/0.52 % inst_num_of_clauses: 52
% 0.20/0.52 % inst_num_in_passive: 0
% 0.20/0.52 % inst_num_in_active: 0
% 0.20/0.52 % inst_num_in_unprocessed: 52
% 0.20/0.52 % inst_num_of_loops: 0
% 0.20/0.52 % inst_num_of_learning_restarts: 0
% 0.20/0.52 % inst_num_moves_active_passive: 0
% 0.20/0.52 % inst_lit_activity: 0
% 0.20/0.52 % inst_lit_activity_moves: 0
% 0.20/0.52 % inst_num_tautologies: 0
% 0.20/0.52 % inst_num_prop_implied: 0
% 0.20/0.52 % inst_num_existing_simplified: 0
% 0.20/0.52 % inst_num_eq_res_simplified: 0
% 0.20/0.52 % inst_num_child_elim: 0
% 0.20/0.52 % inst_num_of_dismatching_blockings: 0
% 0.20/0.52 % inst_num_of_non_proper_insts: 0
% 0.20/0.52 % inst_num_of_duplicates: 0
% 0.20/0.52 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.52 % inst_dismatching_checking_time: 0.
% 0.20/0.52
% 0.20/0.52 % ------ Resolution
% 0.20/0.52
% 0.20/0.52 % res_num_of_clauses: 94
% 0.20/0.52 % res_num_in_passive: 0
% 0.20/0.52 % res_num_in_active: 55
% 0.20/0.52 % res_num_of_loops: 38
% 0.20/0.52 % res_forward_subset_subsumed: 31
% 0.20/0.52 % res_backward_subset_subsumed: 0
% 0.20/0.52 % res_forward_subsumed: 3
% 0.20/0.52 % res_backward_subsumed: 0
% 0.20/0.52 % res_forward_subsumption_resolution: 19
% 0.20/0.52 % res_backward_subsumption_resolution: 0
% 0.20/0.52 % res_clause_to_clause_subsumption: 53
% 0.20/0.52 % res_orphan_elimination: 0
% 0.20/0.52 % res_tautology_del: 0
% 0.20/0.52 % res_num_eq_res_simplified: 0
% 0.20/0.52 % res_num_sel_changes: 0
% 0.20/0.52 % res_moves_from_active_to_pass: 0
% 0.20/0.52
% 0.20/0.52 % Status Unsatisfiable
% 0.20/0.52 % SZS status Theorem
% 0.20/0.52 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------