TSTP Solution File: NUM533+2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NUM533+2 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 10:58:34 EDT 2022
% Result : Theorem 0.19s 0.42s
% Output : CNFRefutation 0.19s
% 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(mSubRefl,axiom,
! [W0] :
( aSet0(W0)
=> aSubsetOf0(W0,W0) ),
input ).
fof(mSubRefl_0,plain,
! [W0] :
( ~ aSet0(W0)
| aSubsetOf0(W0,W0) ),
inference(orientation,[status(thm)],[mSubRefl]) ).
fof(mDefSub,axiom,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aSubsetOf0(W1,W0)
<=> ( aSet0(W1)
& ! [W2] :
( aElementOf0(W2,W1)
=> aElementOf0(W2,W0) ) ) ) ),
input ).
fof(mDefSub_0,plain,
! [W0] :
( ~ aSet0(W0)
| ! [W1] :
( aSubsetOf0(W1,W0)
<=> ( aSet0(W1)
& ! [W2] :
( aElementOf0(W2,W1)
=> aElementOf0(W2,W0) ) ) ) ),
inference(orientation,[status(thm)],[mDefSub]) ).
fof(mCountNFin_01,axiom,
! [W0] :
( ( aSet0(W0)
& isCountable0(W0) )
=> W0 != slcrc0 ),
input ).
fof(mCountNFin_01_0,plain,
! [W0] :
( W0 != slcrc0
| ~ ( aSet0(W0)
& isCountable0(W0) ) ),
inference(orientation,[status(thm)],[mCountNFin_01]) ).
fof(mCountNFin,axiom,
! [W0] :
( ( aSet0(W0)
& isCountable0(W0) )
=> ~ isFinite0(W0) ),
input ).
fof(mCountNFin_0,plain,
! [W0] :
( ~ isFinite0(W0)
| ~ ( aSet0(W0)
& isCountable0(W0) ) ),
inference(orientation,[status(thm)],[mCountNFin]) ).
fof(mCntRel,axiom,
! [W0] :
( aSet0(W0)
=> ( isCountable0(W0)
=> $true ) ),
input ).
fof(mCntRel_0,plain,
! [W0] :
( ~ aSet0(W0)
| ( isCountable0(W0)
=> $true ) ),
inference(orientation,[status(thm)],[mCntRel]) ).
fof(mEmpFin,axiom,
isFinite0(slcrc0),
input ).
fof(mEmpFin_0,plain,
( isFinite0(slcrc0)
| $false ),
inference(orientation,[status(thm)],[mEmpFin]) ).
fof(mDefEmp,axiom,
! [W0] :
( W0 = slcrc0
<=> ( aSet0(W0)
& ~ ? [W1] : aElementOf0(W1,W0) ) ),
input ).
fof(mDefEmp_0,plain,
! [W0] :
( W0 = slcrc0
| ~ ( aSet0(W0)
& ~ ? [W1] : aElementOf0(W1,W0) ) ),
inference(orientation,[status(thm)],[mDefEmp]) ).
fof(mDefEmp_1,plain,
! [W0] :
( W0 != slcrc0
| ( aSet0(W0)
& ~ ? [W1] : aElementOf0(W1,W0) ) ),
inference(orientation,[status(thm)],[mDefEmp]) ).
fof(mFinRel,axiom,
! [W0] :
( aSet0(W0)
=> ( isFinite0(W0)
=> $true ) ),
input ).
fof(mFinRel_0,plain,
! [W0] :
( ~ aSet0(W0)
| ( isFinite0(W0)
=> $true ) ),
inference(orientation,[status(thm)],[mFinRel]) ).
fof(mEOfElem,axiom,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aElementOf0(W1,W0)
=> aElement0(W1) ) ),
input ).
fof(mEOfElem_0,plain,
! [W0] :
( ~ aSet0(W0)
| ! [W1] :
( aElementOf0(W1,W0)
=> aElement0(W1) ) ),
inference(orientation,[status(thm)],[mEOfElem]) ).
fof(mElmSort,axiom,
! [W0] :
( aElement0(W0)
=> $true ),
input ).
fof(mElmSort_0,plain,
! [W0] :
( ~ aElement0(W0)
| $true ),
inference(orientation,[status(thm)],[mElmSort]) ).
fof(mSetSort,axiom,
! [W0] :
( aSet0(W0)
=> $true ),
input ).
fof(mSetSort_0,plain,
! [W0] :
( ~ aSet0(W0)
| $true ),
inference(orientation,[status(thm)],[mSetSort]) ).
fof(def_lhs_atom1,axiom,
! [W0] :
( lhs_atom1(W0)
<=> ~ aSet0(W0) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [W0] :
( lhs_atom1(W0)
| $true ),
inference(fold_definition,[status(thm)],[mSetSort_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [W0] :
( lhs_atom2(W0)
<=> ~ aElement0(W0) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [W0] :
( lhs_atom2(W0)
| $true ),
inference(fold_definition,[status(thm)],[mElmSort_0,def_lhs_atom2]) ).
fof(to_be_clausified_2,plain,
! [W0] :
( lhs_atom1(W0)
| ! [W1] :
( aElementOf0(W1,W0)
=> aElement0(W1) ) ),
inference(fold_definition,[status(thm)],[mEOfElem_0,def_lhs_atom1]) ).
fof(to_be_clausified_3,plain,
! [W0] :
( lhs_atom1(W0)
| ( isFinite0(W0)
=> $true ) ),
inference(fold_definition,[status(thm)],[mFinRel_0,def_lhs_atom1]) ).
fof(def_lhs_atom3,axiom,
! [W0] :
( lhs_atom3(W0)
<=> W0 != slcrc0 ),
inference(definition,[],]) ).
fof(to_be_clausified_4,plain,
! [W0] :
( lhs_atom3(W0)
| ( aSet0(W0)
& ~ ? [W1] : aElementOf0(W1,W0) ) ),
inference(fold_definition,[status(thm)],[mDefEmp_1,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [W0] :
( lhs_atom4(W0)
<=> W0 = slcrc0 ),
inference(definition,[],]) ).
fof(to_be_clausified_5,plain,
! [W0] :
( lhs_atom4(W0)
| ~ ( aSet0(W0)
& ~ ? [W1] : aElementOf0(W1,W0) ) ),
inference(fold_definition,[status(thm)],[mDefEmp_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
( lhs_atom5
<=> isFinite0(slcrc0) ),
inference(definition,[],]) ).
fof(to_be_clausified_6,plain,
( lhs_atom5
| $false ),
inference(fold_definition,[status(thm)],[mEmpFin_0,def_lhs_atom5]) ).
fof(to_be_clausified_7,plain,
! [W0] :
( lhs_atom1(W0)
| ( isCountable0(W0)
=> $true ) ),
inference(fold_definition,[status(thm)],[mCntRel_0,def_lhs_atom1]) ).
fof(def_lhs_atom6,axiom,
! [W0] :
( lhs_atom6(W0)
<=> ~ isFinite0(W0) ),
inference(definition,[],]) ).
fof(to_be_clausified_8,plain,
! [W0] :
( lhs_atom6(W0)
| ~ ( aSet0(W0)
& isCountable0(W0) ) ),
inference(fold_definition,[status(thm)],[mCountNFin_0,def_lhs_atom6]) ).
fof(def_lhs_atom7,axiom,
! [W0] :
( lhs_atom7(W0)
<=> W0 != slcrc0 ),
inference(definition,[],]) ).
fof(to_be_clausified_9,plain,
! [W0] :
( lhs_atom7(W0)
| ~ ( aSet0(W0)
& isCountable0(W0) ) ),
inference(fold_definition,[status(thm)],[mCountNFin_01_0,def_lhs_atom7]) ).
fof(to_be_clausified_10,plain,
! [W0] :
( lhs_atom1(W0)
| ! [W1] :
( aSubsetOf0(W1,W0)
<=> ( aSet0(W1)
& ! [W2] :
( aElementOf0(W2,W1)
=> aElementOf0(W2,W0) ) ) ) ),
inference(fold_definition,[status(thm)],[mDefSub_0,def_lhs_atom1]) ).
fof(to_be_clausified_11,plain,
! [W0] :
( lhs_atom1(W0)
| aSubsetOf0(W0,W0) ),
inference(fold_definition,[status(thm)],[mSubRefl_0,def_lhs_atom1]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X1] :
( lhs_atom1(X1)
| ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('<stdin>',to_be_clausified_10) ).
fof(c_0_1,axiom,
! [X1] :
( lhs_atom4(X1)
| ~ ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_2,axiom,
! [X1] :
( lhs_atom1(X1)
| ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_3,axiom,
! [X1] :
( lhs_atom3(X1)
| ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_4,axiom,
! [X1] :
( lhs_atom1(X1)
| aSubsetOf0(X1,X1) ),
file('<stdin>',to_be_clausified_11) ).
fof(c_0_5,axiom,
! [X1] :
( lhs_atom7(X1)
| ~ ( aSet0(X1)
& isCountable0(X1) ) ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_6,axiom,
! [X1] :
( lhs_atom6(X1)
| ~ ( aSet0(X1)
& isCountable0(X1) ) ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_7,axiom,
! [X1] :
( lhs_atom1(X1)
| ( isCountable0(X1)
=> $true ) ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_8,axiom,
( lhs_atom5
| ~ $true ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_9,axiom,
! [X1] :
( lhs_atom1(X1)
| ( isFinite0(X1)
=> $true ) ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_10,axiom,
! [X1] :
( lhs_atom2(X1)
| $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_11,axiom,
! [X1] :
( lhs_atom1(X1)
| $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_12,axiom,
! [X1] :
( lhs_atom1(X1)
| ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
c_0_0 ).
fof(c_0_13,axiom,
! [X1] :
( lhs_atom4(X1)
| ~ ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
c_0_1 ).
fof(c_0_14,axiom,
! [X1] :
( lhs_atom1(X1)
| ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
c_0_2 ).
fof(c_0_15,axiom,
! [X1] :
( lhs_atom3(X1)
| ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
c_0_3 ).
fof(c_0_16,axiom,
! [X1] :
( lhs_atom1(X1)
| aSubsetOf0(X1,X1) ),
c_0_4 ).
fof(c_0_17,axiom,
! [X1] :
( lhs_atom7(X1)
| ~ ( aSet0(X1)
& isCountable0(X1) ) ),
c_0_5 ).
fof(c_0_18,axiom,
! [X1] :
( lhs_atom6(X1)
| ~ ( aSet0(X1)
& isCountable0(X1) ) ),
c_0_6 ).
fof(c_0_19,plain,
! [X1] : $true,
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_20,plain,
lhs_atom5,
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_21,plain,
! [X1] : $true,
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_22,plain,
! [X1] : $true,
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_23,plain,
! [X1] : $true,
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_24,plain,
! [X4,X5,X6,X7] :
( ( aSet0(X5)
| ~ aSubsetOf0(X5,X4)
| lhs_atom1(X4) )
& ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4)
| ~ aSubsetOf0(X5,X4)
| lhs_atom1(X4) )
& ( aElementOf0(esk2_2(X4,X7),X7)
| ~ aSet0(X7)
| aSubsetOf0(X7,X4)
| lhs_atom1(X4) )
& ( ~ aElementOf0(esk2_2(X4,X7),X4)
| ~ aSet0(X7)
| aSubsetOf0(X7,X4)
| lhs_atom1(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])])]) ).
fof(c_0_25,plain,
! [X3] :
( lhs_atom4(X3)
| ~ aSet0(X3)
| aElementOf0(esk1_1(X3),X3) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_26,plain,
! [X3,X4] :
( lhs_atom1(X3)
| ~ aElementOf0(X4,X3)
| aElement0(X4) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
fof(c_0_27,plain,
! [X3,X4] :
( ( aSet0(X3)
| lhs_atom3(X3) )
& ( ~ aElementOf0(X4,X3)
| lhs_atom3(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
fof(c_0_28,plain,
! [X2] :
( lhs_atom1(X2)
| aSubsetOf0(X2,X2) ),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_29,plain,
! [X2] :
( lhs_atom7(X2)
| ~ aSet0(X2)
| ~ isCountable0(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])]) ).
fof(c_0_30,plain,
! [X2] :
( lhs_atom6(X2)
| ~ aSet0(X2)
| ~ isCountable0(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])]) ).
fof(c_0_31,plain,
! [X2] : $true,
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_32,plain,
lhs_atom5,
c_0_20 ).
fof(c_0_33,plain,
! [X2] : $true,
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_34,plain,
! [X2] : $true,
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_35,plain,
! [X2] : $true,
inference(variable_rename,[status(thm)],[c_0_23]) ).
cnf(c_0_36,plain,
( lhs_atom1(X1)
| aSubsetOf0(X2,X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_37,plain,
( lhs_atom1(X1)
| aSubsetOf0(X2,X1)
| aElementOf0(esk2_2(X1,X2),X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_38,plain,
( lhs_atom1(X1)
| aElementOf0(X3,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_39,plain,
( aElementOf0(esk1_1(X1),X1)
| lhs_atom4(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_40,plain,
( lhs_atom1(X1)
| aSet0(X2)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_41,plain,
( aElement0(X1)
| lhs_atom1(X2)
| ~ aElementOf0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_42,plain,
( lhs_atom3(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_43,plain,
( aSubsetOf0(X1,X1)
| lhs_atom1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_44,plain,
( lhs_atom7(X1)
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_45,plain,
( lhs_atom6(X1)
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_46,plain,
( lhs_atom3(X1)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_47,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_48,plain,
lhs_atom5,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_49,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_50,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_51,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_52,plain,
( lhs_atom1(X1)
| aSubsetOf0(X2,X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk2_2(X1,X2),X1) ),
c_0_36,
[final] ).
cnf(c_0_53,plain,
( lhs_atom1(X1)
| aSubsetOf0(X2,X1)
| aElementOf0(esk2_2(X1,X2),X2)
| ~ aSet0(X2) ),
c_0_37,
[final] ).
cnf(c_0_54,plain,
( lhs_atom1(X1)
| aElementOf0(X3,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X2) ),
c_0_38,
[final] ).
cnf(c_0_55,plain,
( aElementOf0(esk1_1(X1),X1)
| lhs_atom4(X1)
| ~ aSet0(X1) ),
c_0_39,
[final] ).
cnf(c_0_56,plain,
( lhs_atom1(X1)
| aSet0(X2)
| ~ aSubsetOf0(X2,X1) ),
c_0_40,
[final] ).
cnf(c_0_57,plain,
( aElement0(X1)
| lhs_atom1(X2)
| ~ aElementOf0(X1,X2) ),
c_0_41,
[final] ).
cnf(c_0_58,plain,
( lhs_atom3(X1)
| ~ aElementOf0(X2,X1) ),
c_0_42,
[final] ).
cnf(c_0_59,plain,
( aSubsetOf0(X1,X1)
| lhs_atom1(X1) ),
c_0_43,
[final] ).
cnf(c_0_60,plain,
( lhs_atom7(X1)
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
c_0_44,
[final] ).
cnf(c_0_61,plain,
( lhs_atom6(X1)
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
c_0_45,
[final] ).
cnf(c_0_62,plain,
( lhs_atom3(X1)
| aSet0(X1) ),
c_0_46,
[final] ).
cnf(c_0_63,plain,
$true,
c_0_47,
[final] ).
cnf(c_0_64,plain,
lhs_atom5,
c_0_48,
[final] ).
cnf(c_0_65,plain,
$true,
c_0_49,
[final] ).
cnf(c_0_66,plain,
$true,
c_0_50,
[final] ).
cnf(c_0_67,plain,
$true,
c_0_51,
[final] ).
% End CNF derivation
cnf(c_0_52_0,axiom,
( ~ aSet0(X1)
| aSubsetOf0(X2,X1)
| ~ aSet0(X2)
| ~ aElementOf0(sk1_esk2_2(X1,X2),X1) ),
inference(unfold_definition,[status(thm)],[c_0_52,def_lhs_atom1]) ).
cnf(c_0_53_0,axiom,
( ~ aSet0(X1)
| aSubsetOf0(X2,X1)
| aElementOf0(sk1_esk2_2(X1,X2),X2)
| ~ aSet0(X2) ),
inference(unfold_definition,[status(thm)],[c_0_53,def_lhs_atom1]) ).
cnf(c_0_54_0,axiom,
( ~ aSet0(X1)
| aElementOf0(X3,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X2) ),
inference(unfold_definition,[status(thm)],[c_0_54,def_lhs_atom1]) ).
cnf(c_0_55_0,axiom,
( X1 = slcrc0
| aElementOf0(sk1_esk1_1(X1),X1)
| ~ aSet0(X1) ),
inference(unfold_definition,[status(thm)],[c_0_55,def_lhs_atom4]) ).
cnf(c_0_56_0,axiom,
( ~ aSet0(X1)
| aSet0(X2)
| ~ aSubsetOf0(X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_56,def_lhs_atom1]) ).
cnf(c_0_57_0,axiom,
( ~ aSet0(X2)
| aElement0(X1)
| ~ aElementOf0(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_57,def_lhs_atom1]) ).
cnf(c_0_58_0,axiom,
( X1 != slcrc0
| ~ aElementOf0(X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_58,def_lhs_atom3]) ).
cnf(c_0_59_0,axiom,
( ~ aSet0(X1)
| aSubsetOf0(X1,X1) ),
inference(unfold_definition,[status(thm)],[c_0_59,def_lhs_atom1]) ).
cnf(c_0_60_0,axiom,
( X1 != slcrc0
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
inference(unfold_definition,[status(thm)],[c_0_60,def_lhs_atom7]) ).
cnf(c_0_61_0,axiom,
( ~ isFinite0(X1)
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
inference(unfold_definition,[status(thm)],[c_0_61,def_lhs_atom6]) ).
cnf(c_0_62_0,axiom,
( X1 != slcrc0
| aSet0(X1) ),
inference(unfold_definition,[status(thm)],[c_0_62,def_lhs_atom3]) ).
cnf(c_0_63_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_63,def_true]) ).
cnf(c_0_64_0,axiom,
isFinite0(slcrc0),
inference(unfold_definition,[status(thm)],[c_0_64,def_lhs_atom5]) ).
cnf(c_0_65_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_65,def_true]) ).
cnf(c_0_66_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_66,def_true]) ).
cnf(c_0_67_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_67,def_true]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aSet0(X2) )
=> ( ( aSubsetOf0(X1,X2)
& aSubsetOf0(X2,X1) )
=> X1 = X2 ) ),
file('<stdin>',mSubASymm) ).
fof(c_0_1_002,axiom,
! [X1] :
( ( aSet0(X1)
& isFinite0(X1) )
=> ! [X2] :
( aSubsetOf0(X2,X1)
=> isFinite0(X2) ) ),
file('<stdin>',mSubFSet) ).
fof(c_0_2_003,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aSet0(X2) )
=> ( ( aSubsetOf0(X1,X2)
& aSubsetOf0(X2,X1) )
=> X1 = X2 ) ),
c_0_0 ).
fof(c_0_3_004,axiom,
! [X1] :
( ( aSet0(X1)
& isFinite0(X1) )
=> ! [X2] :
( aSubsetOf0(X2,X1)
=> isFinite0(X2) ) ),
c_0_1 ).
fof(c_0_4_005,plain,
! [X3,X4] :
( ~ aSet0(X3)
| ~ aSet0(X4)
| ~ aSubsetOf0(X3,X4)
| ~ aSubsetOf0(X4,X3)
| X3 = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
fof(c_0_5_006,plain,
! [X3,X4] :
( ~ aSet0(X3)
| ~ isFinite0(X3)
| ~ aSubsetOf0(X4,X3)
| isFinite0(X4) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6_007,plain,
( X1 = X2
| ~ aSubsetOf0(X2,X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_008,plain,
( isFinite0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ isFinite0(X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_009,plain,
( X1 = X2
| ~ aSubsetOf0(X2,X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| ~ aSet0(X1) ),
c_0_6,
[final] ).
cnf(c_0_9_010,plain,
( isFinite0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ isFinite0(X2)
| ~ aSet0(X2) ),
c_0_7,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_8_0,axiom,
( X1 = X2
| ~ aSubsetOf0(X2,X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| ~ aSet0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_8]) ).
cnf(c_0_8_1,axiom,
( ~ aSubsetOf0(X2,X1)
| X1 = X2
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| ~ aSet0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_8]) ).
cnf(c_0_8_2,axiom,
( ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X2,X1)
| X1 = X2
| ~ aSet0(X2)
| ~ aSet0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_8]) ).
cnf(c_0_8_3,axiom,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X2,X1)
| X1 = X2
| ~ aSet0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_8]) ).
cnf(c_0_8_4,axiom,
( ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X2,X1)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_8]) ).
cnf(c_0_9_0,axiom,
( isFinite0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ isFinite0(X2)
| ~ aSet0(X2) ),
inference(literals_permutation,[status(thm)],[c_0_9]) ).
cnf(c_0_9_1,axiom,
( ~ aSubsetOf0(X1,X2)
| isFinite0(X1)
| ~ isFinite0(X2)
| ~ aSet0(X2) ),
inference(literals_permutation,[status(thm)],[c_0_9]) ).
cnf(c_0_9_2,axiom,
( ~ isFinite0(X2)
| ~ aSubsetOf0(X1,X2)
| isFinite0(X1)
| ~ aSet0(X2) ),
inference(literals_permutation,[status(thm)],[c_0_9]) ).
cnf(c_0_9_3,axiom,
( ~ aSet0(X2)
| ~ isFinite0(X2)
| ~ aSubsetOf0(X1,X2)
| isFinite0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_9]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_011,conjecture,
( ( ! [X1] :
( aElementOf0(X1,xA)
=> aElementOf0(X1,xB) )
& aSubsetOf0(xA,xB)
& ! [X1] :
( aElementOf0(X1,xB)
=> aElementOf0(X1,xC) )
& aSubsetOf0(xB,xC) )
=> ( ! [X1] :
( aElementOf0(X1,xA)
=> aElementOf0(X1,xC) )
| aSubsetOf0(xA,xC) ) ),
file('<stdin>',m__) ).
fof(c_0_1_012,hypothesis,
( aSet0(xA)
& aSet0(xB)
& aSet0(xC) ),
file('<stdin>',m__522) ).
fof(c_0_2_013,negated_conjecture,
~ ( ( ! [X1] :
( aElementOf0(X1,xA)
=> aElementOf0(X1,xB) )
& aSubsetOf0(xA,xB)
& ! [X1] :
( aElementOf0(X1,xB)
=> aElementOf0(X1,xC) )
& aSubsetOf0(xB,xC) )
=> ( ! [X1] :
( aElementOf0(X1,xA)
=> aElementOf0(X1,xC) )
| aSubsetOf0(xA,xC) ) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_3_014,hypothesis,
( aSet0(xA)
& aSet0(xB)
& aSet0(xC) ),
c_0_1 ).
fof(c_0_4_015,negated_conjecture,
! [X2,X3] :
( ( ~ aElementOf0(X2,xA)
| aElementOf0(X2,xB) )
& aSubsetOf0(xA,xB)
& ( ~ aElementOf0(X3,xB)
| aElementOf0(X3,xC) )
& aSubsetOf0(xB,xC)
& aElementOf0(esk1_0,xA)
& ~ aElementOf0(esk1_0,xC)
& ~ aSubsetOf0(xA,xC) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
fof(c_0_5_016,hypothesis,
( aSet0(xA)
& aSet0(xB)
& aSet0(xC) ),
c_0_3 ).
cnf(c_0_6_017,negated_conjecture,
( aElementOf0(X1,xB)
| ~ aElementOf0(X1,xA) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_018,negated_conjecture,
( aElementOf0(X1,xC)
| ~ aElementOf0(X1,xB) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8_019,negated_conjecture,
~ aElementOf0(esk1_0,xC),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9_020,negated_conjecture,
~ aSubsetOf0(xA,xC),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10_021,negated_conjecture,
aSubsetOf0(xA,xB),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11_022,negated_conjecture,
aSubsetOf0(xB,xC),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12_023,negated_conjecture,
aElementOf0(esk1_0,xA),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13_024,hypothesis,
aSet0(xA),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14_025,hypothesis,
aSet0(xB),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15_026,hypothesis,
aSet0(xC),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16_027,negated_conjecture,
( aElementOf0(X1,xB)
| ~ aElementOf0(X1,xA) ),
c_0_6,
[final] ).
cnf(c_0_17_028,negated_conjecture,
( aElementOf0(X1,xC)
| ~ aElementOf0(X1,xB) ),
c_0_7,
[final] ).
cnf(c_0_18_029,negated_conjecture,
~ aElementOf0(esk1_0,xC),
c_0_8,
[final] ).
cnf(c_0_19_030,negated_conjecture,
~ aSubsetOf0(xA,xC),
c_0_9,
[final] ).
cnf(c_0_20_031,negated_conjecture,
aSubsetOf0(xA,xB),
c_0_10,
[final] ).
cnf(c_0_21_032,negated_conjecture,
aSubsetOf0(xB,xC),
c_0_11,
[final] ).
cnf(c_0_22_033,negated_conjecture,
aElementOf0(esk1_0,xA),
c_0_12,
[final] ).
cnf(c_0_23_034,hypothesis,
aSet0(xA),
c_0_13,
[final] ).
cnf(c_0_24_035,hypothesis,
aSet0(xB),
c_0_14,
[final] ).
cnf(c_0_25_036,hypothesis,
aSet0(xC),
c_0_15,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_26,negated_conjecture,
( ~ aElementOf0(X0,xB)
| aElementOf0(X0,xC) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b25d49.p',c_0_17) ).
cnf(c_55,negated_conjecture,
( ~ aElementOf0(X0,xB)
| aElementOf0(X0,xC) ),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_82,negated_conjecture,
( ~ aElementOf0(X0,xB)
| aElementOf0(X0,xC) ),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_99,negated_conjecture,
( ~ aElementOf0(X0,xB)
| aElementOf0(X0,xC) ),
inference(copy,[status(esa)],[c_82]) ).
cnf(c_102,negated_conjecture,
( ~ aElementOf0(X0,xB)
| aElementOf0(X0,xC) ),
inference(copy,[status(esa)],[c_99]) ).
cnf(c_192,negated_conjecture,
( ~ aElementOf0(X0,xB)
| aElementOf0(X0,xC) ),
inference(copy,[status(esa)],[c_102]) ).
cnf(c_27,negated_conjecture,
~ aElementOf0(sk3_esk1_0,xC),
file('/export/starexec/sandbox/tmp/iprover_modulo_b25d49.p',c_0_18) ).
cnf(c_57,negated_conjecture,
~ aElementOf0(sk3_esk1_0,xC),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_83,negated_conjecture,
~ aElementOf0(sk3_esk1_0,xC),
inference(copy,[status(esa)],[c_57]) ).
cnf(c_98,negated_conjecture,
~ aElementOf0(sk3_esk1_0,xC),
inference(copy,[status(esa)],[c_83]) ).
cnf(c_103,negated_conjecture,
~ aElementOf0(sk3_esk1_0,xC),
inference(copy,[status(esa)],[c_98]) ).
cnf(c_194,negated_conjecture,
~ aElementOf0(sk3_esk1_0,xC),
inference(copy,[status(esa)],[c_103]) ).
cnf(c_228,plain,
~ aElementOf0(sk3_esk1_0,xB),
inference(resolution,[status(thm)],[c_192,c_194]) ).
cnf(c_229,plain,
~ aElementOf0(sk3_esk1_0,xB),
inference(rewriting,[status(thm)],[c_228]) ).
cnf(c_25,negated_conjecture,
( aElementOf0(X0,xB)
| ~ aElementOf0(X0,xA) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b25d49.p',c_0_16) ).
cnf(c_53,negated_conjecture,
( aElementOf0(X0,xB)
| ~ aElementOf0(X0,xA) ),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_81,negated_conjecture,
( aElementOf0(X0,xB)
| ~ aElementOf0(X0,xA) ),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_100,negated_conjecture,
( aElementOf0(X0,xB)
| ~ aElementOf0(X0,xA) ),
inference(copy,[status(esa)],[c_81]) ).
cnf(c_101,negated_conjecture,
( aElementOf0(X0,xB)
| ~ aElementOf0(X0,xA) ),
inference(copy,[status(esa)],[c_100]) ).
cnf(c_190,negated_conjecture,
( aElementOf0(X0,xB)
| ~ aElementOf0(X0,xA) ),
inference(copy,[status(esa)],[c_101]) ).
cnf(c_31,negated_conjecture,
aElementOf0(sk3_esk1_0,xA),
file('/export/starexec/sandbox/tmp/iprover_modulo_b25d49.p',c_0_22) ).
cnf(c_65,negated_conjecture,
aElementOf0(sk3_esk1_0,xA),
inference(copy,[status(esa)],[c_31]) ).
cnf(c_87,negated_conjecture,
aElementOf0(sk3_esk1_0,xA),
inference(copy,[status(esa)],[c_65]) ).
cnf(c_94,negated_conjecture,
aElementOf0(sk3_esk1_0,xA),
inference(copy,[status(esa)],[c_87]) ).
cnf(c_107,negated_conjecture,
aElementOf0(sk3_esk1_0,xA),
inference(copy,[status(esa)],[c_94]) ).
cnf(c_202,negated_conjecture,
aElementOf0(sk3_esk1_0,xA),
inference(copy,[status(esa)],[c_107]) ).
cnf(c_222,plain,
aElementOf0(sk3_esk1_0,xB),
inference(resolution,[status(thm)],[c_190,c_202]) ).
cnf(c_223,plain,
aElementOf0(sk3_esk1_0,xB),
inference(rewriting,[status(thm)],[c_222]) ).
cnf(c_233,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_229,c_223]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : NUM533+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jul 6 03:31:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.12/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.40 % FOF problem with conjecture
% 0.12/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_387e81.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_b25d49.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_8e3d5c | grep -v "SZS"
% 0.19/0.41
% 0.19/0.41 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.41
% 0.19/0.41 %
% 0.19/0.41 % ------ iProver source info
% 0.19/0.41
% 0.19/0.41 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.41 % git: non_committed_changes: true
% 0.19/0.41 % git: last_make_outside_of_git: true
% 0.19/0.41
% 0.19/0.41 %
% 0.19/0.41 % ------ Input Options
% 0.19/0.41
% 0.19/0.41 % --out_options all
% 0.19/0.41 % --tptp_safe_out true
% 0.19/0.41 % --problem_path ""
% 0.19/0.41 % --include_path ""
% 0.19/0.41 % --clausifier .//eprover
% 0.19/0.41 % --clausifier_options --tstp-format
% 0.19/0.41 % --stdin false
% 0.19/0.41 % --dbg_backtrace false
% 0.19/0.41 % --dbg_dump_prop_clauses false
% 0.19/0.41 % --dbg_dump_prop_clauses_file -
% 0.19/0.41 % --dbg_out_stat false
% 0.19/0.41
% 0.19/0.41 % ------ General Options
% 0.19/0.41
% 0.19/0.41 % --fof false
% 0.19/0.41 % --time_out_real 150.
% 0.19/0.41 % --time_out_prep_mult 0.2
% 0.19/0.41 % --time_out_virtual -1.
% 0.19/0.41 % --schedule none
% 0.19/0.41 % --ground_splitting input
% 0.19/0.41 % --splitting_nvd 16
% 0.19/0.41 % --non_eq_to_eq false
% 0.19/0.41 % --prep_gs_sim true
% 0.19/0.41 % --prep_unflatten false
% 0.19/0.41 % --prep_res_sim true
% 0.19/0.41 % --prep_upred true
% 0.19/0.41 % --res_sim_input true
% 0.19/0.41 % --clause_weak_htbl true
% 0.19/0.41 % --gc_record_bc_elim false
% 0.19/0.41 % --symbol_type_check false
% 0.19/0.41 % --clausify_out false
% 0.19/0.41 % --large_theory_mode false
% 0.19/0.41 % --prep_sem_filter none
% 0.19/0.41 % --prep_sem_filter_out false
% 0.19/0.41 % --preprocessed_out false
% 0.19/0.41 % --sub_typing false
% 0.19/0.41 % --brand_transform false
% 0.19/0.41 % --pure_diseq_elim true
% 0.19/0.41 % --min_unsat_core false
% 0.19/0.41 % --pred_elim true
% 0.19/0.41 % --add_important_lit false
% 0.19/0.41 % --soft_assumptions false
% 0.19/0.41 % --reset_solvers false
% 0.19/0.41 % --bc_imp_inh []
% 0.19/0.41 % --conj_cone_tolerance 1.5
% 0.19/0.41 % --prolific_symb_bound 500
% 0.19/0.41 % --lt_threshold 2000
% 0.19/0.41
% 0.19/0.41 % ------ SAT Options
% 0.19/0.41
% 0.19/0.41 % --sat_mode false
% 0.19/0.41 % --sat_fm_restart_options ""
% 0.19/0.41 % --sat_gr_def false
% 0.19/0.41 % --sat_epr_types true
% 0.19/0.41 % --sat_non_cyclic_types false
% 0.19/0.41 % --sat_finite_models false
% 0.19/0.41 % --sat_fm_lemmas false
% 0.19/0.41 % --sat_fm_prep false
% 0.19/0.41 % --sat_fm_uc_incr true
% 0.19/0.41 % --sat_out_model small
% 0.19/0.41 % --sat_out_clauses false
% 0.19/0.41
% 0.19/0.41 % ------ QBF Options
% 0.19/0.41
% 0.19/0.41 % --qbf_mode false
% 0.19/0.41 % --qbf_elim_univ true
% 0.19/0.41 % --qbf_sk_in true
% 0.19/0.41 % --qbf_pred_elim true
% 0.19/0.41 % --qbf_split 32
% 0.19/0.41
% 0.19/0.41 % ------ BMC1 Options
% 0.19/0.41
% 0.19/0.41 % --bmc1_incremental false
% 0.19/0.41 % --bmc1_axioms reachable_all
% 0.19/0.41 % --bmc1_min_bound 0
% 0.19/0.41 % --bmc1_max_bound -1
% 0.19/0.41 % --bmc1_max_bound_default -1
% 0.19/0.41 % --bmc1_symbol_reachability true
% 0.19/0.41 % --bmc1_property_lemmas false
% 0.19/0.41 % --bmc1_k_induction false
% 0.19/0.41 % --bmc1_non_equiv_states false
% 0.19/0.41 % --bmc1_deadlock false
% 0.19/0.41 % --bmc1_ucm false
% 0.19/0.41 % --bmc1_add_unsat_core none
% 0.19/0.41 % --bmc1_unsat_core_children false
% 0.19/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.41 % --bmc1_out_stat full
% 0.19/0.41 % --bmc1_ground_init false
% 0.19/0.41 % --bmc1_pre_inst_next_state false
% 0.19/0.41 % --bmc1_pre_inst_state false
% 0.19/0.41 % --bmc1_pre_inst_reach_state false
% 0.19/0.41 % --bmc1_out_unsat_core false
% 0.19/0.41 % --bmc1_aig_witness_out false
% 0.19/0.41 % --bmc1_verbose false
% 0.19/0.41 % --bmc1_dump_clauses_tptp false
% 0.19/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.42 % --bmc1_dump_file -
% 0.19/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.42 % --bmc1_ucm_extend_mode 1
% 0.19/0.42 % --bmc1_ucm_init_mode 2
% 0.19/0.42 % --bmc1_ucm_cone_mode none
% 0.19/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.42 % --bmc1_ucm_relax_model 4
% 0.19/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.42 % --bmc1_ucm_layered_model none
% 0.19/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.42
% 0.19/0.42 % ------ AIG Options
% 0.19/0.42
% 0.19/0.42 % --aig_mode false
% 0.19/0.42
% 0.19/0.42 % ------ Instantiation Options
% 0.19/0.42
% 0.19/0.42 % --instantiation_flag true
% 0.19/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.42 % --inst_solver_per_active 750
% 0.19/0.42 % --inst_solver_calls_frac 0.5
% 0.19/0.42 % --inst_passive_queue_type priority_queues
% 0.19/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.42 % --inst_passive_queues_freq [25;2]
% 0.19/0.42 % --inst_dismatching true
% 0.19/0.42 % --inst_eager_unprocessed_to_passive true
% 0.19/0.42 % --inst_prop_sim_given true
% 0.19/0.42 % --inst_prop_sim_new false
% 0.19/0.42 % --inst_orphan_elimination true
% 0.19/0.42 % --inst_learning_loop_flag true
% 0.19/0.42 % --inst_learning_start 3000
% 0.19/0.42 % --inst_learning_factor 2
% 0.19/0.42 % --inst_start_prop_sim_after_learn 3
% 0.19/0.42 % --inst_sel_renew solver
% 0.19/0.42 % --inst_lit_activity_flag true
% 0.19/0.42 % --inst_out_proof true
% 0.19/0.42
% 0.19/0.42 % ------ Resolution Options
% 0.19/0.42
% 0.19/0.42 % --resolution_flag true
% 0.19/0.42 % --res_lit_sel kbo_max
% 0.19/0.42 % --res_to_prop_solver none
% 0.19/0.42 % --res_prop_simpl_new false
% 0.19/0.42 % --res_prop_simpl_given false
% 0.19/0.42 % --res_passive_queue_type priority_queues
% 0.19/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.42 % --res_passive_queues_freq [15;5]
% 0.19/0.42 % --res_forward_subs full
% 0.19/0.42 % --res_backward_subs full
% 0.19/0.42 % --res_forward_subs_resolution true
% 0.19/0.42 % --res_backward_subs_resolution true
% 0.19/0.42 % --res_orphan_elimination false
% 0.19/0.42 % --res_time_limit 1000.
% 0.19/0.42 % --res_out_proof true
% 0.19/0.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_387e81.s
% 0.19/0.42 % --modulo true
% 0.19/0.42
% 0.19/0.42 % ------ Combination Options
% 0.19/0.42
% 0.19/0.42 % --comb_res_mult 1000
% 0.19/0.42 % --comb_inst_mult 300
% 0.19/0.42 % ------
% 0.19/0.42
% 0.19/0.42 % ------ Parsing...% successful
% 0.19/0.42
% 0.19/0.42 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.19/0.42
% 0.19/0.42 % ------ Proving...
% 0.19/0.42 % ------ Problem Properties
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % EPR false
% 0.19/0.42 % Horn false
% 0.19/0.42 % Has equality true
% 0.19/0.42
% 0.19/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 % % ------ Current options:
% 0.19/0.42
% 0.19/0.42 % ------ Input Options
% 0.19/0.42
% 0.19/0.42 % --out_options all
% 0.19/0.42 % --tptp_safe_out true
% 0.19/0.42 % --problem_path ""
% 0.19/0.42 % --include_path ""
% 0.19/0.42 % --clausifier .//eprover
% 0.19/0.42 % --clausifier_options --tstp-format
% 0.19/0.42 % --stdin false
% 0.19/0.42 % --dbg_backtrace false
% 0.19/0.42 % --dbg_dump_prop_clauses false
% 0.19/0.42 % --dbg_dump_prop_clauses_file -
% 0.19/0.42 % --dbg_out_stat false
% 0.19/0.42
% 0.19/0.42 % ------ General Options
% 0.19/0.42
% 0.19/0.42 % --fof false
% 0.19/0.42 % --time_out_real 150.
% 0.19/0.42 % --time_out_prep_mult 0.2
% 0.19/0.42 % --time_out_virtual -1.
% 0.19/0.42 % --schedule none
% 0.19/0.42 % --ground_splitting input
% 0.19/0.42 % --splitting_nvd 16
% 0.19/0.42 % --non_eq_to_eq false
% 0.19/0.42 % --prep_gs_sim true
% 0.19/0.42 % --prep_unflatten false
% 0.19/0.42 % --prep_res_sim true
% 0.19/0.42 % --prep_upred true
% 0.19/0.42 % --res_sim_input true
% 0.19/0.42 % --clause_weak_htbl true
% 0.19/0.42 % --gc_record_bc_elim false
% 0.19/0.42 % --symbol_type_check false
% 0.19/0.42 % --clausify_out false
% 0.19/0.42 % --large_theory_mode false
% 0.19/0.42 % --prep_sem_filter none
% 0.19/0.42 % --prep_sem_filter_out false
% 0.19/0.42 % --preprocessed_out false
% 0.19/0.42 % --sub_typing false
% 0.19/0.42 % --brand_transform false
% 0.19/0.42 % --pure_diseq_elim true
% 0.19/0.42 % --min_unsat_core false
% 0.19/0.42 % --pred_elim true
% 0.19/0.42 % --add_important_lit false
% 0.19/0.42 % --soft_assumptions false
% 0.19/0.42 % --reset_solvers false
% 0.19/0.42 % --bc_imp_inh []
% 0.19/0.42 % --conj_cone_tolerance 1.5
% 0.19/0.42 % --prolific_symb_bound 500
% 0.19/0.42 % --lt_threshold 2000
% 0.19/0.42
% 0.19/0.42 % ------ SAT Options
% 0.19/0.42
% 0.19/0.42 % --sat_mode false
% 0.19/0.42 % --sat_fm_restart_options ""
% 0.19/0.42 % --sat_gr_def false
% 0.19/0.42 % --sat_epr_types true
% 0.19/0.42 % --sat_non_cyclic_types false
% 0.19/0.42 % --sat_finite_models false
% 0.19/0.42 % --sat_fm_lemmas false
% 0.19/0.42 % --sat_fm_prep false
% 0.19/0.42 % --sat_fm_uc_incr true
% 0.19/0.42 % --sat_out_model small
% 0.19/0.42 % --sat_out_clauses false
% 0.19/0.42
% 0.19/0.42 % ------ QBF Options
% 0.19/0.42
% 0.19/0.42 % --qbf_mode false
% 0.19/0.42 % --qbf_elim_univ true
% 0.19/0.42 % --qbf_sk_in true
% 0.19/0.42 % --qbf_pred_elim true
% 0.19/0.42 % --qbf_split 32
% 0.19/0.42
% 0.19/0.42 % ------ BMC1 Options
% 0.19/0.42
% 0.19/0.42 % --bmc1_incremental false
% 0.19/0.42 % --bmc1_axioms reachable_all
% 0.19/0.42 % --bmc1_min_bound 0
% 0.19/0.42 % --bmc1_max_bound -1
% 0.19/0.42 % --bmc1_max_bound_default -1
% 0.19/0.42 % --bmc1_symbol_reachability true
% 0.19/0.42 % --bmc1_property_lemmas false
% 0.19/0.42 % --bmc1_k_induction false
% 0.19/0.42 % --bmc1_non_equiv_states false
% 0.19/0.42 % --bmc1_deadlock false
% 0.19/0.42 % --bmc1_ucm false
% 0.19/0.42 % --bmc1_add_unsat_core none
% 0.19/0.42 % --bmc1_unsat_core_children false
% 0.19/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.42 % --bmc1_out_stat full
% 0.19/0.42 % --bmc1_ground_init false
% 0.19/0.42 % --bmc1_pre_inst_next_state false
% 0.19/0.42 % --bmc1_pre_inst_state false
% 0.19/0.42 % --bmc1_pre_inst_reach_state false
% 0.19/0.42 % --bmc1_out_unsat_core false
% 0.19/0.42 % --bmc1_aig_witness_out false
% 0.19/0.42 % --bmc1_verbose false
% 0.19/0.42 % --bmc1_dump_clauses_tptp false
% 0.19/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.42 % --bmc1_dump_file -
% 0.19/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.42 % --bmc1_ucm_extend_mode 1
% 0.19/0.42 % --bmc1_ucm_init_mode 2
% 0.19/0.42 % --bmc1_ucm_cone_mode none
% 0.19/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.42 % --bmc1_ucm_relax_model 4
% 0.19/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.42 % --bmc1_ucm_layered_model none
% 0.19/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.42
% 0.19/0.42 % ------ AIG Options
% 0.19/0.42
% 0.19/0.42 % --aig_mode false
% 0.19/0.42
% 0.19/0.42 % ------ Instantiation Options
% 0.19/0.42
% 0.19/0.42 % --instantiation_flag true
% 0.19/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.42 % --inst_solver_per_active 750
% 0.19/0.42 % --inst_solver_calls_frac 0.5
% 0.19/0.42 % --inst_passive_queue_type priority_queues
% 0.19/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.42 % --inst_passive_queues_freq [25;2]
% 0.19/0.42 % --inst_dismatching true
% 0.19/0.42 % --inst_eager_unprocessed_to_passive true
% 0.19/0.42 % --inst_prop_sim_given true
% 0.19/0.42 % --inst_prop_sim_new false
% 0.19/0.42 % --inst_orphan_elimination true
% 0.19/0.42 % --inst_learning_loop_flag true
% 0.19/0.42 % --inst_learning_start 3000
% 0.19/0.42 % --inst_learning_factor 2
% 0.19/0.42 % --inst_start_prop_sim_after_learn 3
% 0.19/0.42 % --inst_sel_renew solver
% 0.19/0.42 % --inst_lit_activity_flag true
% 0.19/0.42 % --inst_out_proof true
% 0.19/0.42
% 0.19/0.42 % ------ Resolution Options
% 0.19/0.42
% 0.19/0.42 % --resolution_flag true
% 0.19/0.42 % --res_lit_sel kbo_max
% 0.19/0.42 % --res_to_prop_solver none
% 0.19/0.42 % --res_prop_simpl_new false
% 0.19/0.42 % --res_prop_simpl_given false
% 0.19/0.42 % --res_passive_queue_type priority_queues
% 0.19/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.42 % --res_passive_queues_freq [15;5]
% 0.19/0.42 % --res_forward_subs full
% 0.19/0.42 % --res_backward_subs full
% 0.19/0.42 % --res_forward_subs_resolution true
% 0.19/0.42 % --res_backward_subs_resolution true
% 0.19/0.42 % --res_orphan_elimination false
% 0.19/0.42 % --res_time_limit 1000.
% 0.19/0.42 % --res_out_proof true
% 0.19/0.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_387e81.s
% 0.19/0.42 % --modulo true
% 0.19/0.42
% 0.19/0.42 % ------ Combination Options
% 0.19/0.42
% 0.19/0.42 % --comb_res_mult 1000
% 0.19/0.42 % --comb_inst_mult 300
% 0.19/0.42 % ------
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 % ------ Proving...
% 0.19/0.42 %
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 % Resolution empty clause
% 0.19/0.42
% 0.19/0.42 % ------ Statistics
% 0.19/0.42
% 0.19/0.42 % ------ General
% 0.19/0.42
% 0.19/0.42 % num_of_input_clauses: 35
% 0.19/0.42 % num_of_input_neg_conjectures: 7
% 0.19/0.42 % num_of_splits: 0
% 0.19/0.42 % num_of_split_atoms: 0
% 0.19/0.42 % num_of_sem_filtered_clauses: 0
% 0.19/0.42 % num_of_subtypes: 0
% 0.19/0.42 % monotx_restored_types: 0
% 0.19/0.42 % sat_num_of_epr_types: 0
% 0.19/0.42 % sat_num_of_non_cyclic_types: 0
% 0.19/0.42 % sat_guarded_non_collapsed_types: 0
% 0.19/0.42 % is_epr: 0
% 0.19/0.42 % is_horn: 0
% 0.19/0.42 % has_eq: 1
% 0.19/0.42 % num_pure_diseq_elim: 0
% 0.19/0.42 % simp_replaced_by: 0
% 0.19/0.42 % res_preprocessed: 17
% 0.19/0.42 % prep_upred: 0
% 0.19/0.42 % prep_unflattend: 0
% 0.19/0.42 % pred_elim_cands: 1
% 0.19/0.42 % pred_elim: 1
% 0.19/0.42 % pred_elim_cl: 3
% 0.19/0.42 % pred_elim_cycles: 2
% 0.19/0.42 % forced_gc_time: 0
% 0.19/0.42 % gc_basic_clause_elim: 0
% 0.19/0.42 % parsing_time: 0.
% 0.19/0.42 % sem_filter_time: 0.
% 0.19/0.42 % pred_elim_time: 0.
% 0.19/0.42 % out_proof_time: 0.
% 0.19/0.42 % monotx_time: 0.
% 0.19/0.42 % subtype_inf_time: 0.
% 0.19/0.42 % unif_index_cands_time: 0.
% 0.19/0.42 % unif_index_add_time: 0.
% 0.19/0.42 % total_time: 0.017
% 0.19/0.42 % num_of_symbols: 38
% 0.19/0.42 % num_of_terms: 115
% 0.19/0.42
% 0.19/0.42 % ------ Propositional Solver
% 0.19/0.42
% 0.19/0.42 % prop_solver_calls: 1
% 0.19/0.42 % prop_fast_solver_calls: 33
% 0.19/0.42 % prop_num_of_clauses: 38
% 0.19/0.42 % prop_preprocess_simplified: 160
% 0.19/0.42 % prop_fo_subsumed: 0
% 0.19/0.42 % prop_solver_time: 0.
% 0.19/0.42 % prop_fast_solver_time: 0.
% 0.19/0.42 % prop_unsat_core_time: 0.
% 0.19/0.42
% 0.19/0.42 % ------ QBF
% 0.19/0.42
% 0.19/0.42 % qbf_q_res: 0
% 0.19/0.42 % qbf_num_tautologies: 0
% 0.19/0.42 % qbf_prep_cycles: 0
% 0.19/0.42
% 0.19/0.42 % ------ BMC1
% 0.19/0.42
% 0.19/0.42 % bmc1_current_bound: -1
% 0.19/0.42 % bmc1_last_solved_bound: -1
% 0.19/0.42 % bmc1_unsat_core_size: -1
% 0.19/0.42 % bmc1_unsat_core_parents_size: -1
% 0.19/0.42 % bmc1_merge_next_fun: 0
% 0.19/0.42 % bmc1_unsat_core_clauses_time: 0.
% 0.19/0.42
% 0.19/0.42 % ------ Instantiation
% 0.19/0.42
% 0.19/0.42 % inst_num_of_clauses: 29
% 0.19/0.42 % inst_num_in_passive: 0
% 0.19/0.42 % inst_num_in_active: 0
% 0.19/0.42 % inst_num_in_unprocessed: 32
% 0.19/0.42 % inst_num_of_loops: 0
% 0.19/0.42 % inst_num_of_learning_restarts: 0
% 0.19/0.42 % inst_num_moves_active_passive: 0
% 0.19/0.42 % inst_lit_activity: 0
% 0.19/0.42 % inst_lit_activity_moves: 0
% 0.19/0.42 % inst_num_tautologies: 0
% 0.19/0.42 % inst_num_prop_implied: 0
% 0.19/0.42 % inst_num_existing_simplified: 0
% 0.19/0.42 % inst_num_eq_res_simplified: 0
% 0.19/0.42 % inst_num_child_elim: 0
% 0.19/0.42 % inst_num_of_dismatching_blockings: 0
% 0.19/0.42 % inst_num_of_non_proper_insts: 0
% 0.19/0.42 % inst_num_of_duplicates: 0
% 0.19/0.42 % inst_inst_num_from_inst_to_res: 0
% 0.19/0.42 % inst_dismatching_checking_time: 0.
% 0.19/0.42
% 0.19/0.42 % ------ Resolution
% 0.19/0.42
% 0.19/0.42 % res_num_of_clauses: 43
% 0.19/0.42 % res_num_in_passive: 2
% 0.19/0.42 % res_num_in_active: 26
% 0.19/0.42 % res_num_of_loops: 9
% 0.19/0.42 % res_forward_subset_subsumed: 7
% 0.19/0.42 % res_backward_subset_subsumed: 0
% 0.19/0.42 % res_forward_subsumed: 0
% 0.19/0.42 % res_backward_subsumed: 0
% 0.19/0.42 % res_forward_subsumption_resolution: 1
% 0.19/0.42 % res_backward_subsumption_resolution: 0
% 0.19/0.42 % res_clause_to_clause_subsumption: 1
% 0.19/0.42 % res_orphan_elimination: 0
% 0.19/0.42 % res_tautology_del: 0
% 0.19/0.42 % res_num_eq_res_simplified: 0
% 0.19/0.42 % res_num_sel_changes: 0
% 0.19/0.42 % res_moves_from_active_to_pass: 0
% 0.19/0.42
% 0.19/0.42 % Status Unsatisfiable
% 0.19/0.42 % SZS status Theorem
% 0.19/0.42 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------