%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SEU257+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n028.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:33 EDT 2022
% Result : Theorem 0.21s 0.55s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
fof(t31_wellord1,axiom,
! [A,B] :
( relation(B)
=> ( well_founded_relation(B)
=> well_founded_relation(relation_restriction(B,A)) ) ),
input ).
fof(t31_wellord1_0,plain,
! [A,B] :
( ~ relation(B)
| ( well_founded_relation(B)
=> well_founded_relation(relation_restriction(B,A)) ) ),
inference(orientation,[status(thm)],[t31_wellord1]) ).
fof(t25_wellord1,axiom,
! [A,B] :
( relation(B)
=> ( antisymmetric(B)
=> antisymmetric(relation_restriction(B,A)) ) ),
input ).
fof(t25_wellord1_0,plain,
! [A,B] :
( ~ relation(B)
| ( antisymmetric(B)
=> antisymmetric(relation_restriction(B,A)) ) ),
inference(orientation,[status(thm)],[t25_wellord1]) ).
fof(t24_wellord1,axiom,
! [A,B] :
( relation(B)
=> ( transitive(B)
=> transitive(relation_restriction(B,A)) ) ),
input ).
fof(t24_wellord1_0,plain,
! [A,B] :
( ~ relation(B)
| ( transitive(B)
=> transitive(relation_restriction(B,A)) ) ),
inference(orientation,[status(thm)],[t24_wellord1]) ).
fof(t23_wellord1,axiom,
! [A,B] :
( relation(B)
=> ( connected(B)
=> connected(relation_restriction(B,A)) ) ),
input ).
fof(t23_wellord1_0,plain,
! [A,B] :
( ~ relation(B)
| ( connected(B)
=> connected(relation_restriction(B,A)) ) ),
inference(orientation,[status(thm)],[t23_wellord1]) ).
fof(t22_wellord1,axiom,
! [A,B] :
( relation(B)
=> ( reflexive(B)
=> reflexive(relation_restriction(B,A)) ) ),
input ).
fof(t22_wellord1_0,plain,
! [A,B] :
( ~ relation(B)
| ( reflexive(B)
=> reflexive(relation_restriction(B,A)) ) ),
inference(orientation,[status(thm)],[t22_wellord1]) ).
fof(idempotence_k3_xboole_0,axiom,
! [A,B] : set_intersection2(A,A) = A,
input ).
fof(idempotence_k3_xboole_0_0,plain,
! [A] :
( set_intersection2(A,A) = A
| $false ),
inference(orientation,[status(thm)],[idempotence_k3_xboole_0]) ).
fof(dt_k3_xboole_0,axiom,
$true,
input ).
fof(dt_k3_xboole_0_0,plain,
( $true
| $false ),
inference(orientation,[status(thm)],[dt_k3_xboole_0]) ).
fof(dt_k2_zfmisc_1,axiom,
$true,
input ).
fof(dt_k2_zfmisc_1_0,plain,
( $true
| $false ),
inference(orientation,[status(thm)],[dt_k2_zfmisc_1]) ).
fof(dt_k2_wellord1,axiom,
! [A,B] :
( relation(A)
=> relation(relation_restriction(A,B)) ),
input ).
fof(dt_k2_wellord1_0,plain,
! [A,B] :
( ~ relation(A)
| relation(relation_restriction(A,B)) ),
inference(orientation,[status(thm)],[dt_k2_wellord1]) ).
fof(d6_wellord1,axiom,
! [A] :
( relation(A)
=> ! [B] : relation_restriction(A,B) = set_intersection2(A,cartesian_product2(B,B)) ),
input ).
fof(d6_wellord1_0,plain,
! [A] :
( ~ relation(A)
| ! [B] : relation_restriction(A,B) = set_intersection2(A,cartesian_product2(B,B)) ),
inference(orientation,[status(thm)],[d6_wellord1]) ).
fof(d4_wellord1,axiom,
! [A] :
( relation(A)
=> ( well_ordering(A)
<=> ( reflexive(A)
& transitive(A)
& antisymmetric(A)
& connected(A)
& well_founded_relation(A) ) ) ),
input ).
fof(d4_wellord1_0,plain,
! [A] :
( ~ relation(A)
| ( well_ordering(A)
<=> ( reflexive(A)
& transitive(A)
& antisymmetric(A)
& connected(A)
& well_founded_relation(A) ) ) ),
inference(orientation,[status(thm)],[d4_wellord1]) ).
fof(commutativity_k3_xboole_0,axiom,
! [A,B] : set_intersection2(A,B) = set_intersection2(B,A),
input ).
fof(commutativity_k3_xboole_0_0,plain,
! [A,B] :
( set_intersection2(A,B) = set_intersection2(B,A)
| $false ),
inference(orientation,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(def_lhs_atom1,axiom,
! [B,A] :
( lhs_atom1(B,A)
<=> set_intersection2(A,B) = set_intersection2(B,A) ),
inference(definition,[],[]) ).
fof(to_be_clausified_0,plain,
! [A,B] :
( lhs_atom1(B,A)
| $false ),
inference(fold_definition,[status(thm)],[commutativity_k3_xboole_0_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [A] :
( lhs_atom2(A)
<=> ~ relation(A) ),
inference(definition,[],[]) ).
fof(to_be_clausified_1,plain,
! [A] :
( lhs_atom2(A)
| ( well_ordering(A)
<=> ( reflexive(A)
& transitive(A)
& antisymmetric(A)
& connected(A)
& well_founded_relation(A) ) ) ),
inference(fold_definition,[status(thm)],[d4_wellord1_0,def_lhs_atom2]) ).
fof(to_be_clausified_2,plain,
! [A] :
( lhs_atom2(A)
| ! [B] : relation_restriction(A,B) = set_intersection2(A,cartesian_product2(B,B)) ),
inference(fold_definition,[status(thm)],[d6_wellord1_0,def_lhs_atom2]) ).
fof(to_be_clausified_3,plain,
! [A,B] :
( lhs_atom2(A)
| relation(relation_restriction(A,B)) ),
inference(fold_definition,[status(thm)],[dt_k2_wellord1_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
( lhs_atom3
<=> $true ),
inference(definition,[],[]) ).
fof(to_be_clausified_4,plain,
( lhs_atom3
| $false ),
inference(fold_definition,[status(thm)],[dt_k2_zfmisc_1_0,def_lhs_atom3]) ).
fof(to_be_clausified_5,plain,
( lhs_atom3
| $false ),
inference(fold_definition,[status(thm)],[dt_k3_xboole_0_0,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [A] :
( lhs_atom4(A)
<=> set_intersection2(A,A) = A ),
inference(definition,[],[]) ).
fof(to_be_clausified_6,plain,
! [A] :
( lhs_atom4(A)
| $false ),
inference(fold_definition,[status(thm)],[idempotence_k3_xboole_0_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
! [B] :
( lhs_atom5(B)
<=> ~ relation(B) ),
inference(definition,[],[]) ).
fof(to_be_clausified_7,plain,
! [A,B] :
( lhs_atom5(B)
| ( reflexive(B)
=> reflexive(relation_restriction(B,A)) ) ),
inference(fold_definition,[status(thm)],[t22_wellord1_0,def_lhs_atom5]) ).
fof(to_be_clausified_8,plain,
! [A,B] :
( lhs_atom5(B)
| ( connected(B)
=> connected(relation_restriction(B,A)) ) ),
inference(fold_definition,[status(thm)],[t23_wellord1_0,def_lhs_atom5]) ).
fof(to_be_clausified_9,plain,
! [A,B] :
( lhs_atom5(B)
| ( transitive(B)
=> transitive(relation_restriction(B,A)) ) ),
inference(fold_definition,[status(thm)],[t24_wellord1_0,def_lhs_atom5]) ).
fof(to_be_clausified_10,plain,
! [A,B] :
( lhs_atom5(B)
| ( antisymmetric(B)
=> antisymmetric(relation_restriction(B,A)) ) ),
inference(fold_definition,[status(thm)],[t25_wellord1_0,def_lhs_atom5]) ).
fof(to_be_clausified_11,plain,
! [A,B] :
( lhs_atom5(B)
| ( well_founded_relation(B)
=> well_founded_relation(relation_restriction(B,A)) ) ),
inference(fold_definition,[status(thm)],[t31_wellord1_0,def_lhs_atom5]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X2] :
( lhs_atom2(X2)
| ! [X1] : relation_restriction(X2,X1) = set_intersection2(X2,cartesian_product2(X1,X1)) ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_1,axiom,
! [X2] :
( lhs_atom2(X2)
| ( well_ordering(X2)
<=> ( reflexive(X2)
& transitive(X2)
& antisymmetric(X2)
& connected(X2)
& well_founded_relation(X2) ) ) ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_2,axiom,
! [X1,X2] :
( lhs_atom5(X1)
| ( well_founded_relation(X1)
=> well_founded_relation(relation_restriction(X1,X2)) ) ),
file('<stdin>',to_be_clausified_11) ).
fof(c_0_3,axiom,
! [X1,X2] :
( lhs_atom5(X1)
| ( antisymmetric(X1)
=> antisymmetric(relation_restriction(X1,X2)) ) ),
file('<stdin>',to_be_clausified_10) ).
fof(c_0_4,axiom,
! [X1,X2] :
( lhs_atom5(X1)
| ( transitive(X1)
=> transitive(relation_restriction(X1,X2)) ) ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_5,axiom,
! [X1,X2] :
( lhs_atom5(X1)
| ( connected(X1)
=> connected(relation_restriction(X1,X2)) ) ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_6,axiom,
! [X1,X2] :
( lhs_atom5(X1)
| ( reflexive(X1)
=> reflexive(relation_restriction(X1,X2)) ) ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_7,axiom,
! [X1,X2] :
( lhs_atom2(X2)
| relation(relation_restriction(X2,X1)) ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_8,axiom,
! [X1,X2] :
( lhs_atom1(X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_9,axiom,
! [X2] :
( lhs_atom4(X2)
| ~ $true ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_10,axiom,
( lhs_atom3
| ~ $true ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_11,axiom,
( lhs_atom3
| ~ $true ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_12,axiom,
! [X2] :
( lhs_atom2(X2)
| ! [X1] : relation_restriction(X2,X1) = set_intersection2(X2,cartesian_product2(X1,X1)) ),
c_0_0 ).
fof(c_0_13,axiom,
! [X2] :
( lhs_atom2(X2)
| ( well_ordering(X2)
<=> ( reflexive(X2)
& transitive(X2)
& antisymmetric(X2)
& connected(X2)
& well_founded_relation(X2) ) ) ),
c_0_1 ).
fof(c_0_14,axiom,
! [X1,X2] :
( lhs_atom5(X1)
| ( well_founded_relation(X1)
=> well_founded_relation(relation_restriction(X1,X2)) ) ),
c_0_2 ).
fof(c_0_15,axiom,
! [X1,X2] :
( lhs_atom5(X1)
| ( antisymmetric(X1)
=> antisymmetric(relation_restriction(X1,X2)) ) ),
c_0_3 ).
fof(c_0_16,axiom,
! [X1,X2] :
( lhs_atom5(X1)
| ( transitive(X1)
=> transitive(relation_restriction(X1,X2)) ) ),
c_0_4 ).
fof(c_0_17,axiom,
! [X1,X2] :
( lhs_atom5(X1)
| ( connected(X1)
=> connected(relation_restriction(X1,X2)) ) ),
c_0_5 ).
fof(c_0_18,axiom,
! [X1,X2] :
( lhs_atom5(X1)
| ( reflexive(X1)
=> reflexive(relation_restriction(X1,X2)) ) ),
c_0_6 ).
fof(c_0_19,axiom,
! [X1,X2] :
( lhs_atom2(X2)
| relation(relation_restriction(X2,X1)) ),
c_0_7 ).
fof(c_0_20,plain,
! [X1,X2] : lhs_atom1(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_21,plain,
! [X2] : lhs_atom4(X2),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_22,plain,
lhs_atom3,
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_23,plain,
lhs_atom3,
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_24,plain,
! [X3,X4] :
( lhs_atom2(X3)
| relation_restriction(X3,X4) = set_intersection2(X3,cartesian_product2(X4,X4)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_12])]) ).
fof(c_0_25,plain,
! [X3] :
( ( reflexive(X3)
| ~ well_ordering(X3)
| lhs_atom2(X3) )
& ( transitive(X3)
| ~ well_ordering(X3)
| lhs_atom2(X3) )
& ( antisymmetric(X3)
| ~ well_ordering(X3)
| lhs_atom2(X3) )
& ( connected(X3)
| ~ well_ordering(X3)
| lhs_atom2(X3) )
& ( well_founded_relation(X3)
| ~ well_ordering(X3)
| lhs_atom2(X3) )
& ( ~ reflexive(X3)
| ~ transitive(X3)
| ~ antisymmetric(X3)
| ~ connected(X3)
| ~ well_founded_relation(X3)
| well_ordering(X3)
| lhs_atom2(X3) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_26,plain,
! [X3,X4] :
( lhs_atom5(X3)
| ~ well_founded_relation(X3)
| well_founded_relation(relation_restriction(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_27,plain,
! [X3,X4] :
( lhs_atom5(X3)
| ~ antisymmetric(X3)
| antisymmetric(relation_restriction(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
fof(c_0_28,plain,
! [X3,X4] :
( lhs_atom5(X3)
| ~ transitive(X3)
| transitive(relation_restriction(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
fof(c_0_29,plain,
! [X3,X4] :
( lhs_atom5(X3)
| ~ connected(X3)
| connected(relation_restriction(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
fof(c_0_30,plain,
! [X3,X4] :
( lhs_atom5(X3)
| ~ reflexive(X3)
| reflexive(relation_restriction(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])]) ).
fof(c_0_31,plain,
! [X3,X4] :
( lhs_atom2(X4)
| relation(relation_restriction(X4,X3)) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_32,plain,
! [X3,X4] : lhs_atom1(X3,X4),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_33,plain,
! [X3] : lhs_atom4(X3),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_34,plain,
lhs_atom3,
c_0_22 ).
fof(c_0_35,plain,
lhs_atom3,
c_0_23 ).
cnf(c_0_36,plain,
( relation_restriction(X1,X2) = set_intersection2(X1,cartesian_product2(X2,X2))
| lhs_atom2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_37,plain,
( lhs_atom2(X1)
| well_ordering(X1)
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_38,plain,
( well_founded_relation(relation_restriction(X1,X2))
| lhs_atom5(X1)
| ~ well_founded_relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,plain,
( antisymmetric(relation_restriction(X1,X2))
| lhs_atom5(X1)
| ~ antisymmetric(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_40,plain,
( transitive(relation_restriction(X1,X2))
| lhs_atom5(X1)
| ~ transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_41,plain,
( connected(relation_restriction(X1,X2))
| lhs_atom5(X1)
| ~ connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_42,plain,
( reflexive(relation_restriction(X1,X2))
| lhs_atom5(X1)
| ~ reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_43,plain,
( relation(relation_restriction(X1,X2))
| lhs_atom2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_44,plain,
( lhs_atom2(X1)
| reflexive(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_45,plain,
( lhs_atom2(X1)
| transitive(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_46,plain,
( lhs_atom2(X1)
| antisymmetric(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_47,plain,
( lhs_atom2(X1)
| connected(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_48,plain,
( lhs_atom2(X1)
| well_founded_relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_49,plain,
lhs_atom1(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_50,plain,
lhs_atom4(X1),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_51,plain,
lhs_atom3,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_52,plain,
lhs_atom3,
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_53,plain,
( set_intersection2(X1,cartesian_product2(X2,X2)) = relation_restriction(X1,X2)
| lhs_atom2(X1) ),
c_0_36,
[final] ).
cnf(c_0_54,plain,
( lhs_atom2(X1)
| well_ordering(X1)
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(X1) ),
c_0_37,
[final] ).
cnf(c_0_55,plain,
( well_founded_relation(relation_restriction(X1,X2))
| lhs_atom5(X1)
| ~ well_founded_relation(X1) ),
c_0_38,
[final] ).
cnf(c_0_56,plain,
( antisymmetric(relation_restriction(X1,X2))
| lhs_atom5(X1)
| ~ antisymmetric(X1) ),
c_0_39,
[final] ).
cnf(c_0_57,plain,
( transitive(relation_restriction(X1,X2))
| lhs_atom5(X1)
| ~ transitive(X1) ),
c_0_40,
[final] ).
cnf(c_0_58,plain,
( connected(relation_restriction(X1,X2))
| lhs_atom5(X1)
| ~ connected(X1) ),
c_0_41,
[final] ).
cnf(c_0_59,plain,
( reflexive(relation_restriction(X1,X2))
| lhs_atom5(X1)
| ~ reflexive(X1) ),
c_0_42,
[final] ).
cnf(c_0_60,plain,
( relation(relation_restriction(X1,X2))
| lhs_atom2(X1) ),
c_0_43,
[final] ).
cnf(c_0_61,plain,
( lhs_atom2(X1)
| reflexive(X1)
| ~ well_ordering(X1) ),
c_0_44,
[final] ).
cnf(c_0_62,plain,
( lhs_atom2(X1)
| transitive(X1)
| ~ well_ordering(X1) ),
c_0_45,
[final] ).
cnf(c_0_63,plain,
( lhs_atom2(X1)
| antisymmetric(X1)
| ~ well_ordering(X1) ),
c_0_46,
[final] ).
cnf(c_0_64,plain,
( lhs_atom2(X1)
| connected(X1)
| ~ well_ordering(X1) ),
c_0_47,
[final] ).
cnf(c_0_65,plain,
( lhs_atom2(X1)
| well_founded_relation(X1)
| ~ well_ordering(X1) ),
c_0_48,
[final] ).
cnf(c_0_66,plain,
lhs_atom1(X1,X2),
c_0_49,
[final] ).
cnf(c_0_67,plain,
lhs_atom4(X1),
c_0_50,
[final] ).
cnf(c_0_68,plain,
lhs_atom3,
c_0_51,
[final] ).
cnf(c_0_69,plain,
lhs_atom3,
c_0_52,
[final] ).
% End CNF derivation
cnf(c_0_53_0,axiom,
( ~ relation(X1)
| set_intersection2(X1,cartesian_product2(X2,X2)) = relation_restriction(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_53,def_lhs_atom2]) ).
cnf(c_0_54_0,axiom,
( ~ relation(X1)
| well_ordering(X1)
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(X1) ),
inference(unfold_definition,[status(thm)],[c_0_54,def_lhs_atom2]) ).
cnf(c_0_55_0,axiom,
( ~ relation(X1)
| well_founded_relation(relation_restriction(X1,X2))
| ~ well_founded_relation(X1) ),
inference(unfold_definition,[status(thm)],[c_0_55,def_lhs_atom5]) ).
cnf(c_0_56_0,axiom,
( ~ relation(X1)
| antisymmetric(relation_restriction(X1,X2))
| ~ antisymmetric(X1) ),
inference(unfold_definition,[status(thm)],[c_0_56,def_lhs_atom5]) ).
cnf(c_0_57_0,axiom,
( ~ relation(X1)
| transitive(relation_restriction(X1,X2))
| ~ transitive(X1) ),
inference(unfold_definition,[status(thm)],[c_0_57,def_lhs_atom5]) ).
cnf(c_0_58_0,axiom,
( ~ relation(X1)
| connected(relation_restriction(X1,X2))
| ~ connected(X1) ),
inference(unfold_definition,[status(thm)],[c_0_58,def_lhs_atom5]) ).
cnf(c_0_59_0,axiom,
( ~ relation(X1)
| reflexive(relation_restriction(X1,X2))
| ~ reflexive(X1) ),
inference(unfold_definition,[status(thm)],[c_0_59,def_lhs_atom5]) ).
cnf(c_0_60_0,axiom,
( ~ relation(X1)
| relation(relation_restriction(X1,X2)) ),
inference(unfold_definition,[status(thm)],[c_0_60,def_lhs_atom2]) ).
cnf(c_0_61_0,axiom,
( ~ relation(X1)
| reflexive(X1)
| ~ well_ordering(X1) ),
inference(unfold_definition,[status(thm)],[c_0_61,def_lhs_atom2]) ).
cnf(c_0_62_0,axiom,
( ~ relation(X1)
| transitive(X1)
| ~ well_ordering(X1) ),
inference(unfold_definition,[status(thm)],[c_0_62,def_lhs_atom2]) ).
cnf(c_0_63_0,axiom,
( ~ relation(X1)
| antisymmetric(X1)
| ~ well_ordering(X1) ),
inference(unfold_definition,[status(thm)],[c_0_63,def_lhs_atom2]) ).
cnf(c_0_64_0,axiom,
( ~ relation(X1)
| connected(X1)
| ~ well_ordering(X1) ),
inference(unfold_definition,[status(thm)],[c_0_64,def_lhs_atom2]) ).
cnf(c_0_65_0,axiom,
( ~ relation(X1)
| well_founded_relation(X1)
| ~ well_ordering(X1) ),
inference(unfold_definition,[status(thm)],[c_0_65,def_lhs_atom2]) ).
cnf(c_0_66_0,axiom,
set_intersection2(X2,X1) = set_intersection2(X1,X2),
inference(unfold_definition,[status(thm)],[c_0_66,def_lhs_atom1]) ).
cnf(c_0_67_0,axiom,
set_intersection2(X1,X1) = X1,
inference(unfold_definition,[status(thm)],[c_0_67,def_lhs_atom4]) ).
cnf(c_0_68_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_68,def_lhs_atom3]) ).
cnf(c_0_69_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_69,def_lhs_atom3]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1,X2] :
( relation(X2)
=> ( well_ordering(X2)
=> well_ordering(relation_restriction(X2,X1)) ) ),
file('<stdin>',t32_wellord1) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ( well_ordering(X2)
=> well_ordering(relation_restriction(X2,X1)) ) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
( relation(esk2_0)
& well_ordering(esk2_0)
& ~ well_ordering(relation_restriction(esk2_0,esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
cnf(c_0_3_004,negated_conjecture,
~ well_ordering(relation_restriction(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
well_ordering(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_007,negated_conjecture,
~ well_ordering(relation_restriction(esk2_0,esk1_0)),
c_0_3,
[final] ).
cnf(c_0_7_008,negated_conjecture,
relation(esk2_0),
c_0_4,
[final] ).
cnf(c_0_8_009,negated_conjecture,
well_ordering(esk2_0),
c_0_5,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_18,negated_conjecture,
relation(sk3_esk2_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_633d08.p',c_0_7) ).
cnf(c_36,negated_conjecture,
relation(sk3_esk2_0),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_47,negated_conjecture,
relation(sk3_esk2_0),
inference(copy,[status(esa)],[c_36]) ).
cnf(c_50,negated_conjecture,
relation(sk3_esk2_0),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_53,negated_conjecture,
relation(sk3_esk2_0),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_110,negated_conjecture,
relation(sk3_esk2_0),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_9,plain,
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_633d08.p',c_0_60_0) ).
cnf(c_92,plain,
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_123,plain,
relation(relation_restriction(sk3_esk2_0,X0)),
inference(resolution,[status(thm)],[c_110,c_92]) ).
cnf(c_134,plain,
relation(relation_restriction(sk3_esk2_0,X0)),
inference(rewriting,[status(thm)],[c_123]) ).
cnf(c_15,plain,
( ~ reflexive(X0)
| ~ transitive(X0)
| ~ antisymmetric(X0)
| ~ connected(X0)
| ~ well_founded_relation(X0)
| well_ordering(X0)
| ~ relation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_633d08.p',c_0_54_0) ).
cnf(c_104,plain,
( ~ reflexive(X0)
| ~ transitive(X0)
| ~ antisymmetric(X0)
| ~ connected(X0)
| ~ well_founded_relation(X0)
| well_ordering(X0)
| ~ relation(X0) ),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_105,plain,
( ~ relation(X0)
| ~ well_founded_relation(X0)
| well_ordering(X0)
| ~ connected(X0)
| ~ antisymmetric(X0)
| ~ transitive(X0)
| ~ reflexive(X0) ),
inference(rewriting,[status(thm)],[c_104]) ).
cnf(c_149,plain,
( ~ well_founded_relation(relation_restriction(sk3_esk2_0,X0))
| well_ordering(relation_restriction(sk3_esk2_0,X0))
| ~ connected(relation_restriction(sk3_esk2_0,X0))
| ~ antisymmetric(relation_restriction(sk3_esk2_0,X0))
| ~ transitive(relation_restriction(sk3_esk2_0,X0))
| ~ reflexive(relation_restriction(sk3_esk2_0,X0)) ),
inference(resolution,[status(thm)],[c_134,c_105]) ).
cnf(c_172,plain,
( ~ well_founded_relation(relation_restriction(sk3_esk2_0,X0))
| well_ordering(relation_restriction(sk3_esk2_0,X0))
| ~ connected(relation_restriction(sk3_esk2_0,X0))
| ~ antisymmetric(relation_restriction(sk3_esk2_0,X0))
| ~ transitive(relation_restriction(sk3_esk2_0,X0))
| ~ reflexive(relation_restriction(sk3_esk2_0,X0)) ),
inference(rewriting,[status(thm)],[c_149]) ).
cnf(c_10,plain,
( ~ reflexive(X0)
| reflexive(relation_restriction(X0,X1))
| ~ relation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_633d08.p',c_0_59_0) ).
cnf(c_94,plain,
( ~ reflexive(X0)
| reflexive(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_95,plain,
( ~ relation(X0)
| reflexive(relation_restriction(X0,X1))
| ~ reflexive(X0) ),
inference(rewriting,[status(thm)],[c_94]) ).
cnf(c_122,plain,
( reflexive(relation_restriction(sk3_esk2_0,X0))
| ~ reflexive(sk3_esk2_0) ),
inference(resolution,[status(thm)],[c_110,c_95]) ).
cnf(c_135,plain,
( reflexive(relation_restriction(sk3_esk2_0,X0))
| ~ reflexive(sk3_esk2_0) ),
inference(rewriting,[status(thm)],[c_122]) ).
cnf(c_8,plain,
( ~ well_ordering(X0)
| reflexive(X0)
| ~ relation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_633d08.p',c_0_61_0) ).
cnf(c_90,plain,
( ~ well_ordering(X0)
| reflexive(X0)
| ~ relation(X0) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_91,plain,
( ~ relation(X0)
| ~ well_ordering(X0)
| reflexive(X0) ),
inference(rewriting,[status(thm)],[c_90]) ).
cnf(c_124,plain,
( ~ well_ordering(sk3_esk2_0)
| reflexive(sk3_esk2_0) ),
inference(resolution,[status(thm)],[c_110,c_91]) ).
cnf(c_133,plain,
( ~ well_ordering(sk3_esk2_0)
| reflexive(sk3_esk2_0) ),
inference(rewriting,[status(thm)],[c_124]) ).
cnf(c_19,negated_conjecture,
well_ordering(sk3_esk2_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_633d08.p',c_0_8) ).
cnf(c_38,negated_conjecture,
well_ordering(sk3_esk2_0),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_48,negated_conjecture,
well_ordering(sk3_esk2_0),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_49,negated_conjecture,
well_ordering(sk3_esk2_0),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_54,negated_conjecture,
well_ordering(sk3_esk2_0),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_112,plain,
well_ordering(sk3_esk2_0),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_196,plain,
reflexive(sk3_esk2_0),
inference(forward_subsumption_resolution,[status(thm)],[c_133,c_112]) ).
cnf(c_197,plain,
reflexive(sk3_esk2_0),
inference(rewriting,[status(thm)],[c_196]) ).
cnf(c_201,plain,
reflexive(relation_restriction(sk3_esk2_0,X0)),
inference(forward_subsumption_resolution,[status(thm)],[c_135,c_197]) ).
cnf(c_202,plain,
reflexive(relation_restriction(sk3_esk2_0,X0)),
inference(rewriting,[status(thm)],[c_201]) ).
cnf(c_12,plain,
( ~ transitive(X0)
| transitive(relation_restriction(X0,X1))
| ~ relation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_633d08.p',c_0_57_0) ).
cnf(c_98,plain,
( ~ transitive(X0)
| transitive(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_99,plain,
( ~ relation(X0)
| transitive(relation_restriction(X0,X1))
| ~ transitive(X0) ),
inference(rewriting,[status(thm)],[c_98]) ).
cnf(c_120,plain,
( transitive(relation_restriction(sk3_esk2_0,X0))
| ~ transitive(sk3_esk2_0) ),
inference(resolution,[status(thm)],[c_110,c_99]) ).
cnf(c_137,plain,
( transitive(relation_restriction(sk3_esk2_0,X0))
| ~ transitive(sk3_esk2_0) ),
inference(rewriting,[status(thm)],[c_120]) ).
cnf(c_7,plain,
( ~ well_ordering(X0)
| transitive(X0)
| ~ relation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_633d08.p',c_0_62_0) ).
cnf(c_88,plain,
( ~ well_ordering(X0)
| transitive(X0)
| ~ relation(X0) ),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_89,plain,
( ~ relation(X0)
| ~ well_ordering(X0)
| transitive(X0) ),
inference(rewriting,[status(thm)],[c_88]) ).
cnf(c_125,plain,
( ~ well_ordering(sk3_esk2_0)
| transitive(sk3_esk2_0) ),
inference(resolution,[status(thm)],[c_110,c_89]) ).
cnf(c_132,plain,
( ~ well_ordering(sk3_esk2_0)
| transitive(sk3_esk2_0) ),
inference(rewriting,[status(thm)],[c_125]) ).
cnf(c_191,plain,
transitive(sk3_esk2_0),
inference(forward_subsumption_resolution,[status(thm)],[c_132,c_112]) ).
cnf(c_192,plain,
transitive(sk3_esk2_0),
inference(rewriting,[status(thm)],[c_191]) ).
cnf(c_211,plain,
transitive(relation_restriction(sk3_esk2_0,X0)),
inference(forward_subsumption_resolution,[status(thm)],[c_137,c_192]) ).
cnf(c_212,plain,
transitive(relation_restriction(sk3_esk2_0,X0)),
inference(rewriting,[status(thm)],[c_211]) ).
cnf(c_13,plain,
( ~ antisymmetric(X0)
| antisymmetric(relation_restriction(X0,X1))
| ~ relation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_633d08.p',c_0_56_0) ).
cnf(c_100,plain,
( ~ antisymmetric(X0)
| antisymmetric(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_101,plain,
( ~ relation(X0)
| antisymmetric(relation_restriction(X0,X1))
| ~ antisymmetric(X0) ),
inference(rewriting,[status(thm)],[c_100]) ).
cnf(c_119,plain,
( antisymmetric(relation_restriction(sk3_esk2_0,X0))
| ~ antisymmetric(sk3_esk2_0) ),
inference(resolution,[status(thm)],[c_110,c_101]) ).
cnf(c_138,plain,
( antisymmetric(relation_restriction(sk3_esk2_0,X0))
| ~ antisymmetric(sk3_esk2_0) ),
inference(rewriting,[status(thm)],[c_119]) ).
cnf(c_6,plain,
( ~ well_ordering(X0)
| antisymmetric(X0)
| ~ relation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_633d08.p',c_0_63_0) ).
cnf(c_86,plain,
( ~ well_ordering(X0)
| antisymmetric(X0)
| ~ relation(X0) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_87,plain,
( ~ relation(X0)
| ~ well_ordering(X0)
| antisymmetric(X0) ),
inference(rewriting,[status(thm)],[c_86]) ).
cnf(c_126,plain,
( ~ well_ordering(sk3_esk2_0)
| antisymmetric(sk3_esk2_0) ),
inference(resolution,[status(thm)],[c_110,c_87]) ).
cnf(c_131,plain,
( ~ well_ordering(sk3_esk2_0)
| antisymmetric(sk3_esk2_0) ),
inference(rewriting,[status(thm)],[c_126]) ).
cnf(c_186,plain,
antisymmetric(sk3_esk2_0),
inference(forward_subsumption_resolution,[status(thm)],[c_131,c_112]) ).
cnf(c_187,plain,
antisymmetric(sk3_esk2_0),
inference(rewriting,[status(thm)],[c_186]) ).
cnf(c_216,plain,
antisymmetric(relation_restriction(sk3_esk2_0,X0)),
inference(forward_subsumption_resolution,[status(thm)],[c_138,c_187]) ).
cnf(c_217,plain,
antisymmetric(relation_restriction(sk3_esk2_0,X0)),
inference(rewriting,[status(thm)],[c_216]) ).
cnf(c_11,plain,
( ~ connected(X0)
| connected(relation_restriction(X0,X1))
| ~ relation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_633d08.p',c_0_58_0) ).
cnf(c_96,plain,
( ~ connected(X0)
| connected(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_97,plain,
( ~ relation(X0)
| connected(relation_restriction(X0,X1))
| ~ connected(X0) ),
inference(rewriting,[status(thm)],[c_96]) ).
cnf(c_121,plain,
( connected(relation_restriction(sk3_esk2_0,X0))
| ~ connected(sk3_esk2_0) ),
inference(resolution,[status(thm)],[c_110,c_97]) ).
cnf(c_136,plain,
( connected(relation_restriction(sk3_esk2_0,X0))
| ~ connected(sk3_esk2_0) ),
inference(rewriting,[status(thm)],[c_121]) ).
cnf(c_5,plain,
( ~ well_ordering(X0)
| connected(X0)
| ~ relation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_633d08.p',c_0_64_0) ).
cnf(c_84,plain,
( ~ well_ordering(X0)
| connected(X0)
| ~ relation(X0) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_85,plain,
( ~ relation(X0)
| ~ well_ordering(X0)
| connected(X0) ),
inference(rewriting,[status(thm)],[c_84]) ).
cnf(c_127,plain,
( ~ well_ordering(sk3_esk2_0)
| connected(sk3_esk2_0) ),
inference(resolution,[status(thm)],[c_110,c_85]) ).
cnf(c_130,plain,
( ~ well_ordering(sk3_esk2_0)
| connected(sk3_esk2_0) ),
inference(rewriting,[status(thm)],[c_127]) ).
cnf(c_181,plain,
connected(sk3_esk2_0),
inference(forward_subsumption_resolution,[status(thm)],[c_130,c_112]) ).
cnf(c_182,plain,
connected(sk3_esk2_0),
inference(rewriting,[status(thm)],[c_181]) ).
cnf(c_206,plain,
connected(relation_restriction(sk3_esk2_0,X0)),
inference(forward_subsumption_resolution,[status(thm)],[c_136,c_182]) ).
cnf(c_207,plain,
connected(relation_restriction(sk3_esk2_0,X0)),
inference(rewriting,[status(thm)],[c_206]) ).
cnf(c_14,plain,
( ~ well_founded_relation(X0)
| well_founded_relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_633d08.p',c_0_55_0) ).
cnf(c_102,plain,
( ~ well_founded_relation(X0)
| well_founded_relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_103,plain,
( ~ relation(X0)
| well_founded_relation(relation_restriction(X0,X1))
| ~ well_founded_relation(X0) ),
inference(rewriting,[status(thm)],[c_102]) ).
cnf(c_118,plain,
( well_founded_relation(relation_restriction(sk3_esk2_0,X0))
| ~ well_founded_relation(sk3_esk2_0) ),
inference(resolution,[status(thm)],[c_110,c_103]) ).
cnf(c_139,plain,
( well_founded_relation(relation_restriction(sk3_esk2_0,X0))
| ~ well_founded_relation(sk3_esk2_0) ),
inference(rewriting,[status(thm)],[c_118]) ).
cnf(c_4,plain,
( ~ well_ordering(X0)
| well_founded_relation(X0)
| ~ relation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_633d08.p',c_0_65_0) ).
cnf(c_82,plain,
( ~ well_ordering(X0)
| well_founded_relation(X0)
| ~ relation(X0) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_83,plain,
( ~ relation(X0)
| well_founded_relation(X0)
| ~ well_ordering(X0) ),
inference(rewriting,[status(thm)],[c_82]) ).
cnf(c_128,plain,
( well_founded_relation(sk3_esk2_0)
| ~ well_ordering(sk3_esk2_0) ),
inference(resolution,[status(thm)],[c_110,c_83]) ).
cnf(c_129,plain,
( well_founded_relation(sk3_esk2_0)
| ~ well_ordering(sk3_esk2_0) ),
inference(rewriting,[status(thm)],[c_128]) ).
cnf(c_176,plain,
well_founded_relation(sk3_esk2_0),
inference(forward_subsumption_resolution,[status(thm)],[c_129,c_112]) ).
cnf(c_177,plain,
well_founded_relation(sk3_esk2_0),
inference(rewriting,[status(thm)],[c_176]) ).
cnf(c_221,plain,
well_founded_relation(relation_restriction(sk3_esk2_0,X0)),
inference(forward_subsumption_resolution,[status(thm)],[c_139,c_177]) ).
cnf(c_222,plain,
well_founded_relation(relation_restriction(sk3_esk2_0,X0)),
inference(rewriting,[status(thm)],[c_221]) ).
cnf(c_287,plain,
well_ordering(relation_restriction(sk3_esk2_0,X0)),
inference(forward_subsumption_resolution,[status(thm)],[c_172,c_202,c_212,c_217,c_207,c_222]) ).
cnf(c_288,plain,
well_ordering(relation_restriction(sk3_esk2_0,X0)),
inference(rewriting,[status(thm)],[c_287]) ).
cnf(c_17,negated_conjecture,
~ well_ordering(relation_restriction(sk3_esk2_0,sk3_esk1_0)),
file('/export/starexec/sandbox/tmp/iprover_modulo_633d08.p',c_0_6) ).
cnf(c_34,negated_conjecture,
~ well_ordering(relation_restriction(sk3_esk2_0,sk3_esk1_0)),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_46,negated_conjecture,
~ well_ordering(relation_restriction(sk3_esk2_0,sk3_esk1_0)),
inference(copy,[status(esa)],[c_34]) ).
cnf(c_51,negated_conjecture,
~ well_ordering(relation_restriction(sk3_esk2_0,sk3_esk1_0)),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_52,negated_conjecture,
~ well_ordering(relation_restriction(sk3_esk2_0,sk3_esk1_0)),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_108,negated_conjecture,
~ well_ordering(relation_restriction(sk3_esk2_0,sk3_esk1_0)),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_290,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_288,c_108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU257+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : iprover_modulo %s %d
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 20 04:44:01 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % Running in mono-core mode
% 0.21/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.41 % FOF problem with conjecture
% 0.21/0.41 % 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_5d99b1.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_633d08.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_389773 | grep -v "SZS"
% 0.21/0.44
% 0.21/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ iProver source info
% 0.21/0.44
% 0.21/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.44 % git: non_committed_changes: true
% 0.21/0.44 % git: last_make_outside_of_git: true
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.44
% 0.21/0.44 % --bmc1_incremental false
% 0.21/0.44 % --bmc1_axioms reachable_all
% 0.21/0.44 % --bmc1_min_bound 0
% 0.21/0.44 % --bmc1_max_bound -1
% 0.21/0.44 % --bmc1_max_bound_default -1
% 0.21/0.44 % --bmc1_symbol_reachability true
% 0.21/0.44 % --bmc1_property_lemmas false
% 0.21/0.44 % --bmc1_k_induction false
% 0.21/0.44 % --bmc1_non_equiv_states false
% 0.21/0.44 % --bmc1_deadlock false
% 0.21/0.44 % --bmc1_ucm false
% 0.21/0.44 % --bmc1_add_unsat_core none
% 0.21/0.44 % --bmc1_unsat_core_children false
% 0.21/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.44 % --bmc1_out_stat full
% 0.21/0.44 % --bmc1_ground_init false
% 0.21/0.44 % --bmc1_pre_inst_next_state false
% 0.21/0.44 % --bmc1_pre_inst_state false
% 0.21/0.44 % --bmc1_pre_inst_reach_state false
% 0.21/0.44 % --bmc1_out_unsat_core false
% 0.21/0.44 % --bmc1_aig_witness_out false
% 0.21/0.44 % --bmc1_verbose false
% 0.21/0.44 % --bmc1_dump_clauses_tptp false
% 0.21/0.55 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.55 % --bmc1_dump_file -
% 0.21/0.55 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.55 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.55 % --bmc1_ucm_extend_mode 1
% 0.21/0.55 % --bmc1_ucm_init_mode 2
% 0.21/0.55 % --bmc1_ucm_cone_mode none
% 0.21/0.55 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.55 % --bmc1_ucm_relax_model 4
% 0.21/0.55 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.55 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.55 % --bmc1_ucm_layered_model none
% 0.21/0.55 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.55
% 0.21/0.55 % ------ AIG Options
% 0.21/0.55
% 0.21/0.55 % --aig_mode false
% 0.21/0.55
% 0.21/0.55 % ------ Instantiation Options
% 0.21/0.55
% 0.21/0.55 % --instantiation_flag true
% 0.21/0.55 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.55 % --inst_solver_per_active 750
% 0.21/0.55 % --inst_solver_calls_frac 0.5
% 0.21/0.55 % --inst_passive_queue_type priority_queues
% 0.21/0.55 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.55 % --inst_passive_queues_freq [25;2]
% 0.21/0.55 % --inst_dismatching true
% 0.21/0.55 % --inst_eager_unprocessed_to_passive true
% 0.21/0.55 % --inst_prop_sim_given true
% 0.21/0.55 % --inst_prop_sim_new false
% 0.21/0.55 % --inst_orphan_elimination true
% 0.21/0.55 % --inst_learning_loop_flag true
% 0.21/0.55 % --inst_learning_start 3000
% 0.21/0.55 % --inst_learning_factor 2
% 0.21/0.55 % --inst_start_prop_sim_after_learn 3
% 0.21/0.55 % --inst_sel_renew solver
% 0.21/0.55 % --inst_lit_activity_flag true
% 0.21/0.55 % --inst_out_proof true
% 0.21/0.55
% 0.21/0.55 % ------ Resolution Options
% 0.21/0.55
% 0.21/0.55 % --resolution_flag true
% 0.21/0.55 % --res_lit_sel kbo_max
% 0.21/0.55 % --res_to_prop_solver none
% 0.21/0.55 % --res_prop_simpl_new false
% 0.21/0.55 % --res_prop_simpl_given false
% 0.21/0.55 % --res_passive_queue_type priority_queues
% 0.21/0.55 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.55 % --res_passive_queues_freq [15;5]
% 0.21/0.55 % --res_forward_subs full
% 0.21/0.55 % --res_backward_subs full
% 0.21/0.55 % --res_forward_subs_resolution true
% 0.21/0.55 % --res_backward_subs_resolution true
% 0.21/0.55 % --res_orphan_elimination false
% 0.21/0.55 % --res_time_limit 1000.
% 0.21/0.55 % --res_out_proof true
% 0.21/0.55 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5d99b1.s
% 0.21/0.55 % --modulo true
% 0.21/0.55
% 0.21/0.55 % ------ Combination Options
% 0.21/0.55
% 0.21/0.55 % --comb_res_mult 1000
% 0.21/0.55 % --comb_inst_mult 300
% 0.21/0.55 % ------
% 0.21/0.55
% 0.21/0.55 % ------ Parsing...% successful
% 0.21/0.55
% 0.21/0.55 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.21/0.55
% 0.21/0.55 % ------ Proving...
% 0.21/0.55 % ------ Problem Properties
% 0.21/0.55
% 0.21/0.55 %
% 0.21/0.55 % EPR false
% 0.21/0.55 % Horn true
% 0.21/0.55 % Has equality true
% 0.21/0.55
% 0.21/0.55 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.55
% 0.21/0.55
% 0.21/0.55 Compiling...
% 0.21/0.55 Loading plugin: done.
% 0.21/0.55 % % ------ Current options:
% 0.21/0.55
% 0.21/0.55 % ------ Input Options
% 0.21/0.55
% 0.21/0.55 % --out_options all
% 0.21/0.55 % --tptp_safe_out true
% 0.21/0.55 % --problem_path ""
% 0.21/0.55 % --include_path ""
% 0.21/0.55 % --clausifier .//eprover
% 0.21/0.55 % --clausifier_options --tstp-format
% 0.21/0.55 % --stdin false
% 0.21/0.55 % --dbg_backtrace false
% 0.21/0.55 % --dbg_dump_prop_clauses false
% 0.21/0.55 % --dbg_dump_prop_clauses_file -
% 0.21/0.55 % --dbg_out_stat false
% 0.21/0.55
% 0.21/0.55 % ------ General Options
% 0.21/0.55
% 0.21/0.55 % --fof false
% 0.21/0.55 % --time_out_real 150.
% 0.21/0.55 % --time_out_prep_mult 0.2
% 0.21/0.55 % --time_out_virtual -1.
% 0.21/0.55 % --schedule none
% 0.21/0.55 % --ground_splitting input
% 0.21/0.55 % --splitting_nvd 16
% 0.21/0.55 % --non_eq_to_eq false
% 0.21/0.55 % --prep_gs_sim true
% 0.21/0.55 % --prep_unflatten false
% 0.21/0.55 % --prep_res_sim true
% 0.21/0.55 % --prep_upred true
% 0.21/0.55 % --res_sim_input true
% 0.21/0.55 % --clause_weak_htbl true
% 0.21/0.55 % --gc_record_bc_elim false
% 0.21/0.55 % --symbol_type_check false
% 0.21/0.55 % --clausify_out false
% 0.21/0.55 % --large_theory_mode false
% 0.21/0.55 % --prep_sem_filter none
% 0.21/0.55 % --prep_sem_filter_out false
% 0.21/0.55 % --preprocessed_out false
% 0.21/0.55 % --sub_typing false
% 0.21/0.55 % --brand_transform false
% 0.21/0.55 % --pure_diseq_elim true
% 0.21/0.55 % --min_unsat_core false
% 0.21/0.55 % --pred_elim true
% 0.21/0.55 % --add_important_lit false
% 0.21/0.55 % --soft_assumptions false
% 0.21/0.55 % --reset_solvers false
% 0.21/0.55 % --bc_imp_inh []
% 0.21/0.55 % --conj_cone_tolerance 1.5
% 0.21/0.55 % --prolific_symb_bound 500
% 0.21/0.55 % --lt_threshold 2000
% 0.21/0.55
% 0.21/0.55 % ------ SAT Options
% 0.21/0.55
% 0.21/0.55 % --sat_mode false
% 0.21/0.55 % --sat_fm_restart_options ""
% 0.21/0.55 % --sat_gr_def false
% 0.21/0.55 % --sat_epr_types true
% 0.21/0.55 % --sat_non_cyclic_types false
% 0.21/0.55 % --sat_finite_models false
% 0.21/0.55 % --sat_fm_lemmas false
% 0.21/0.55 % --sat_fm_prep false
% 0.21/0.55 % --sat_fm_uc_incr true
% 0.21/0.55 % --sat_out_model small
% 0.21/0.55 % --sat_out_clauses false
% 0.21/0.55
% 0.21/0.55 % ------ QBF Options
% 0.21/0.55
% 0.21/0.55 % --qbf_mode false
% 0.21/0.55 % --qbf_elim_univ true
% 0.21/0.55 % --qbf_sk_in true
% 0.21/0.55 % --qbf_pred_elim true
% 0.21/0.55 % --qbf_split 32
% 0.21/0.55
% 0.21/0.55 % ------ BMC1 Options
% 0.21/0.55
% 0.21/0.55 % --bmc1_incremental false
% 0.21/0.55 % --bmc1_axioms reachable_all
% 0.21/0.55 % --bmc1_min_bound 0
% 0.21/0.55 % --bmc1_max_bound -1
% 0.21/0.55 % --bmc1_max_bound_default -1
% 0.21/0.55 % --bmc1_symbol_reachability true
% 0.21/0.55 % --bmc1_property_lemmas false
% 0.21/0.55 % --bmc1_k_induction false
% 0.21/0.55 % --bmc1_non_equiv_states false
% 0.21/0.55 % --bmc1_deadlock false
% 0.21/0.55 % --bmc1_ucm false
% 0.21/0.55 % --bmc1_add_unsat_core none
% 0.21/0.55 % --bmc1_unsat_core_children false
% 0.21/0.55 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.55 % --bmc1_out_stat full
% 0.21/0.55 % --bmc1_ground_init false
% 0.21/0.55 % --bmc1_pre_inst_next_state false
% 0.21/0.55 % --bmc1_pre_inst_state false
% 0.21/0.55 % --bmc1_pre_inst_reach_state false
% 0.21/0.55 % --bmc1_out_unsat_core false
% 0.21/0.55 % --bmc1_aig_witness_out false
% 0.21/0.55 % --bmc1_verbose false
% 0.21/0.55 % --bmc1_dump_clauses_tptp false
% 0.21/0.55 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.55 % --bmc1_dump_file -
% 0.21/0.55 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.55 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.55 % --bmc1_ucm_extend_mode 1
% 0.21/0.55 % --bmc1_ucm_init_mode 2
% 0.21/0.55 % --bmc1_ucm_cone_mode none
% 0.21/0.55 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.55 % --bmc1_ucm_relax_model 4
% 0.21/0.55 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.55 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.55 % --bmc1_ucm_layered_model none
% 0.21/0.55 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.55
% 0.21/0.55 % ------ AIG Options
% 0.21/0.55
% 0.21/0.55 % --aig_mode false
% 0.21/0.55
% 0.21/0.55 % ------ Instantiation Options
% 0.21/0.55
% 0.21/0.55 % --instantiation_flag true
% 0.21/0.55 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.55 % --inst_solver_per_active 750
% 0.21/0.55 % --inst_solver_calls_frac 0.5
% 0.21/0.55 % --inst_passive_queue_type priority_queues
% 0.21/0.55 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.55 % --inst_passive_queues_freq [25;2]
% 0.21/0.55 % --inst_dismatching true
% 0.21/0.55 % --inst_eager_unprocessed_to_passive true
% 0.21/0.55 % --inst_prop_sim_given true
% 0.21/0.55 % --inst_prop_sim_new false
% 0.21/0.55 % --inst_orphan_elimination true
% 0.21/0.55 % --inst_learning_loop_flag true
% 0.21/0.55 % --inst_learning_start 3000
% 0.21/0.55 % --inst_learning_factor 2
% 0.21/0.55 % --inst_start_prop_sim_after_learn 3
% 0.21/0.55 % --inst_sel_renew solver
% 0.21/0.55 % --inst_lit_activity_flag true
% 0.21/0.55 % --inst_out_proof true
% 0.21/0.55
% 0.21/0.55 % ------ Resolution Options
% 0.21/0.55
% 0.21/0.55 % --resolution_flag true
% 0.21/0.55 % --res_lit_sel kbo_max
% 0.21/0.55 % --res_to_prop_solver none
% 0.21/0.55 % --res_prop_simpl_new false
% 0.21/0.55 % --res_prop_simpl_given false
% 0.21/0.55 % --res_passive_queue_type priority_queues
% 0.21/0.55 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.55 % --res_passive_queues_freq [15;5]
% 0.21/0.55 % --res_forward_subs full
% 0.21/0.55 % --res_backward_subs full
% 0.21/0.55 % --res_forward_subs_resolution true
% 0.21/0.55 % --res_backward_subs_resolution true
% 0.21/0.55 % --res_orphan_elimination false
% 0.21/0.55 % --res_time_limit 1000.
% 0.21/0.55 % --res_out_proof true
% 0.21/0.55 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5d99b1.s
% 0.21/0.55 % --modulo true
% 0.21/0.55
% 0.21/0.55 % ------ Combination Options
% 0.21/0.55
% 0.21/0.55 % --comb_res_mult 1000
% 0.21/0.55 % --comb_inst_mult 300
% 0.21/0.55 % ------
% 0.21/0.55
% 0.21/0.55
% 0.21/0.55
% 0.21/0.55 % ------ Proving...
% 0.21/0.55 %
% 0.21/0.55
% 0.21/0.55
% 0.21/0.55 % Resolution empty clause
% 0.21/0.55
% 0.21/0.55 % ------ Statistics
% 0.21/0.55
% 0.21/0.55 % ------ General
% 0.21/0.55
% 0.21/0.55 % num_of_input_clauses: 20
% 0.21/0.55 % num_of_input_neg_conjectures: 3
% 0.21/0.55 % num_of_splits: 0
% 0.21/0.55 % num_of_split_atoms: 0
% 0.21/0.55 % num_of_sem_filtered_clauses: 0
% 0.21/0.55 % num_of_subtypes: 0
% 0.21/0.55 % monotx_restored_types: 0
% 0.21/0.55 % sat_num_of_epr_types: 0
% 0.21/0.55 % sat_num_of_non_cyclic_types: 0
% 0.21/0.55 % sat_guarded_non_collapsed_types: 0
% 0.21/0.55 % is_epr: 0
% 0.21/0.55 % is_horn: 1
% 0.21/0.55 % has_eq: 1
% 0.21/0.55 % num_pure_diseq_elim: 0
% 0.21/0.55 % simp_replaced_by: 0
% 0.21/0.55 % res_preprocessed: 6
% 0.21/0.55 % prep_upred: 0
% 0.21/0.55 % prep_unflattend: 0
% 0.21/0.55 % pred_elim_cands: 0
% 0.21/0.55 % pred_elim: 0
% 0.21/0.55 % pred_elim_cl: 0
% 0.21/0.55 % pred_elim_cycles: 0
% 0.21/0.55 % forced_gc_time: 0
% 0.21/0.55 % gc_basic_clause_elim: 0
% 0.21/0.55 % parsing_time: 0.
% 0.21/0.55 % sem_filter_time: 0.
% 0.21/0.55 % pred_elim_time: 0.
% 0.21/0.55 % out_proof_time: 0.003
% 0.21/0.55 % monotx_time: 0.
% 0.21/0.55 % subtype_inf_time: 0.
% 0.21/0.55 % unif_index_cands_time: 0.
% 0.21/0.55 % unif_index_add_time: 0.
% 0.21/0.55 % total_time: 0.132
% 0.21/0.55 % num_of_symbols: 37
% 0.21/0.55 % num_of_terms: 121
% 0.21/0.55
% 0.21/0.55 % ------ Propositional Solver
% 0.21/0.55
% 0.21/0.55 % prop_solver_calls: 1
% 0.21/0.55 % prop_fast_solver_calls: 9
% 0.21/0.55 % prop_num_of_clauses: 33
% 0.21/0.55 % prop_preprocess_simplified: 61
% 0.21/0.55 % prop_fo_subsumed: 0
% 0.21/0.55 % prop_solver_time: 0.
% 0.21/0.55 % prop_fast_solver_time: 0.
% 0.21/0.55 % prop_unsat_core_time: 0.
% 0.21/0.55
% 0.21/0.55 % ------ QBF
% 0.21/0.55
% 0.21/0.55 % qbf_q_res: 0
% 0.21/0.55 % qbf_num_tautologies: 0
% 0.21/0.55 % qbf_prep_cycles: 0
% 0.21/0.55
% 0.21/0.55 % ------ BMC1
% 0.21/0.55
% 0.21/0.55 % bmc1_current_bound: -1
% 0.21/0.55 % bmc1_last_solved_bound: -1
% 0.21/0.55 % bmc1_unsat_core_size: -1
% 0.21/0.55 % bmc1_unsat_core_parents_size: -1
% 0.21/0.55 % bmc1_merge_next_fun: 0
% 0.21/0.55 % bmc1_unsat_core_clauses_time: 0.
% 0.21/0.55
% 0.21/0.55 % ------ Instantiation
% 0.21/0.55
% 0.21/0.55 % inst_num_of_clauses: 19
% 0.21/0.55 % inst_num_in_passive: 0
% 0.21/0.55 % inst_num_in_active: 0
% 0.21/0.55 % inst_num_in_unprocessed: 20
% 0.21/0.55 % inst_num_of_loops: 0
% 0.21/0.55 % inst_num_of_learning_restarts: 0
% 0.21/0.55 % inst_num_moves_active_passive: 0
% 0.21/0.55 % inst_lit_activity: 0
% 0.21/0.55 % inst_lit_activity_moves: 0
% 0.21/0.55 % inst_num_tautologies: 0
% 0.21/0.55 % inst_num_prop_implied: 0
% 0.21/0.55 % inst_num_existing_simplified: 0
% 0.21/0.55 % inst_num_eq_res_simplified: 0
% 0.21/0.55 % inst_num_child_elim: 0
% 0.21/0.55 % inst_num_of_dismatching_blockings: 0
% 0.21/0.55 % inst_num_of_non_proper_insts: 0
% 0.21/0.55 % inst_num_of_duplicates: 0
% 0.21/0.55 % inst_inst_num_from_inst_to_res: 0
% 0.21/0.55 % inst_dismatching_checking_time: 0.
% 0.21/0.55
% 0.21/0.55 % ------ Resolution
% 0.21/0.55
% 0.21/0.55 % res_num_of_clauses: 63
% 0.21/0.55 % res_num_in_passive: 13
% 0.21/0.55 % res_num_in_active: 37
% 0.21/0.55 % res_num_of_loops: 27
% 0.21/0.55 % res_forward_subset_subsumed: 2
% 0.21/0.55 % res_backward_subset_subsumed: 2
% 0.21/0.55 % res_forward_subsumed: 4
% 0.21/0.55 % res_backward_subsumed: 0
% 0.21/0.55 % res_forward_subsumption_resolution: 20
% 0.21/0.55 % res_backward_subsumption_resolution: 1
% 0.21/0.55 % res_clause_to_clause_subsumption: 25
% 0.21/0.55 % res_orphan_elimination: 0
% 0.21/0.55 % res_tautology_del: 0
% 0.21/0.55 % res_num_eq_res_simplified: 0
% 0.21/0.55 % res_num_sel_changes: 0
% 0.21/0.55 % res_moves_from_active_to_pass: 0
% 0.21/0.55
% 0.21/0.55 % Status Unsatisfiable
% 0.21/0.55 % SZS status Theorem
% 0.21/0.55 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------