TSTP Solution File: LAT381+3 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : LAT381+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n026.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 : Sun Jul 17 05:25:50 EDT 2022
% Result : Theorem 1.99s 2.18s
% Output : CNFRefutation 1.99s
% 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(mDefSup,axiom,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aSubsetOf0(W1,W0)
=> ! [W2] :
( aSupremumOfIn0(W2,W1,W0)
<=> ( aElementOf0(W2,W0)
& aUpperBoundOfIn0(W2,W1,W0)
& ! [W3] :
( aUpperBoundOfIn0(W3,W1,W0)
=> sdtlseqdt0(W2,W3) ) ) ) ) ),
input ).
fof(mDefSup_0,plain,
! [W0] :
( ~ aSet0(W0)
| ! [W1] :
( aSubsetOf0(W1,W0)
=> ! [W2] :
( aSupremumOfIn0(W2,W1,W0)
<=> ( aElementOf0(W2,W0)
& aUpperBoundOfIn0(W2,W1,W0)
& ! [W3] :
( aUpperBoundOfIn0(W3,W1,W0)
=> sdtlseqdt0(W2,W3) ) ) ) ) ),
inference(orientation,[status(thm)],[mDefSup]) ).
fof(mDefInf,axiom,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aSubsetOf0(W1,W0)
=> ! [W2] :
( aInfimumOfIn0(W2,W1,W0)
<=> ( aElementOf0(W2,W0)
& aLowerBoundOfIn0(W2,W1,W0)
& ! [W3] :
( aLowerBoundOfIn0(W3,W1,W0)
=> sdtlseqdt0(W3,W2) ) ) ) ) ),
input ).
fof(mDefInf_0,plain,
! [W0] :
( ~ aSet0(W0)
| ! [W1] :
( aSubsetOf0(W1,W0)
=> ! [W2] :
( aInfimumOfIn0(W2,W1,W0)
<=> ( aElementOf0(W2,W0)
& aLowerBoundOfIn0(W2,W1,W0)
& ! [W3] :
( aLowerBoundOfIn0(W3,W1,W0)
=> sdtlseqdt0(W3,W2) ) ) ) ) ),
inference(orientation,[status(thm)],[mDefInf]) ).
fof(mDefUB,axiom,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aSubsetOf0(W1,W0)
=> ! [W2] :
( aUpperBoundOfIn0(W2,W1,W0)
<=> ( aElementOf0(W2,W0)
& ! [W3] :
( aElementOf0(W3,W1)
=> sdtlseqdt0(W3,W2) ) ) ) ) ),
input ).
fof(mDefUB_0,plain,
! [W0] :
( ~ aSet0(W0)
| ! [W1] :
( aSubsetOf0(W1,W0)
=> ! [W2] :
( aUpperBoundOfIn0(W2,W1,W0)
<=> ( aElementOf0(W2,W0)
& ! [W3] :
( aElementOf0(W3,W1)
=> sdtlseqdt0(W3,W2) ) ) ) ) ),
inference(orientation,[status(thm)],[mDefUB]) ).
fof(mDefLB,axiom,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aSubsetOf0(W1,W0)
=> ! [W2] :
( aLowerBoundOfIn0(W2,W1,W0)
<=> ( aElementOf0(W2,W0)
& ! [W3] :
( aElementOf0(W3,W1)
=> sdtlseqdt0(W2,W3) ) ) ) ) ),
input ).
fof(mDefLB_0,plain,
! [W0] :
( ~ aSet0(W0)
| ! [W1] :
( aSubsetOf0(W1,W0)
=> ! [W2] :
( aLowerBoundOfIn0(W2,W1,W0)
<=> ( aElementOf0(W2,W0)
& ! [W3] :
( aElementOf0(W3,W1)
=> sdtlseqdt0(W2,W3) ) ) ) ) ),
inference(orientation,[status(thm)],[mDefLB]) ).
fof(mARefl,axiom,
! [W0] :
( aElement0(W0)
=> sdtlseqdt0(W0,W0) ),
input ).
fof(mARefl_0,plain,
! [W0] :
( ~ aElement0(W0)
| sdtlseqdt0(W0,W0) ),
inference(orientation,[status(thm)],[mARefl]) ).
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(mDefEmpty,axiom,
! [W0] :
( aSet0(W0)
=> ( isEmpty0(W0)
<=> ~ ? [W1] : aElementOf0(W1,W0) ) ),
input ).
fof(mDefEmpty_0,plain,
! [W0] :
( ~ aSet0(W0)
| ( isEmpty0(W0)
<=> ~ ? [W1] : aElementOf0(W1,W0) ) ),
inference(orientation,[status(thm)],[mDefEmpty]) ).
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)
| ( isEmpty0(W0)
<=> ~ ? [W1] : aElementOf0(W1,W0) ) ),
inference(fold_definition,[status(thm)],[mDefEmpty_0,def_lhs_atom1]) ).
fof(to_be_clausified_4,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_5,plain,
! [W0] :
( lhs_atom2(W0)
| sdtlseqdt0(W0,W0) ),
inference(fold_definition,[status(thm)],[mARefl_0,def_lhs_atom2]) ).
fof(to_be_clausified_6,plain,
! [W0] :
( lhs_atom1(W0)
| ! [W1] :
( aSubsetOf0(W1,W0)
=> ! [W2] :
( aLowerBoundOfIn0(W2,W1,W0)
<=> ( aElementOf0(W2,W0)
& ! [W3] :
( aElementOf0(W3,W1)
=> sdtlseqdt0(W2,W3) ) ) ) ) ),
inference(fold_definition,[status(thm)],[mDefLB_0,def_lhs_atom1]) ).
fof(to_be_clausified_7,plain,
! [W0] :
( lhs_atom1(W0)
| ! [W1] :
( aSubsetOf0(W1,W0)
=> ! [W2] :
( aUpperBoundOfIn0(W2,W1,W0)
<=> ( aElementOf0(W2,W0)
& ! [W3] :
( aElementOf0(W3,W1)
=> sdtlseqdt0(W3,W2) ) ) ) ) ),
inference(fold_definition,[status(thm)],[mDefUB_0,def_lhs_atom1]) ).
fof(to_be_clausified_8,plain,
! [W0] :
( lhs_atom1(W0)
| ! [W1] :
( aSubsetOf0(W1,W0)
=> ! [W2] :
( aInfimumOfIn0(W2,W1,W0)
<=> ( aElementOf0(W2,W0)
& aLowerBoundOfIn0(W2,W1,W0)
& ! [W3] :
( aLowerBoundOfIn0(W3,W1,W0)
=> sdtlseqdt0(W3,W2) ) ) ) ) ),
inference(fold_definition,[status(thm)],[mDefInf_0,def_lhs_atom1]) ).
fof(to_be_clausified_9,plain,
! [W0] :
( lhs_atom1(W0)
| ! [W1] :
( aSubsetOf0(W1,W0)
=> ! [W2] :
( aSupremumOfIn0(W2,W1,W0)
<=> ( aElementOf0(W2,W0)
& aUpperBoundOfIn0(W2,W1,W0)
& ! [W3] :
( aUpperBoundOfIn0(W3,W1,W0)
=> sdtlseqdt0(W2,W3) ) ) ) ) ),
inference(fold_definition,[status(thm)],[mDefSup_0,def_lhs_atom1]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X1] :
( lhs_atom1(X1)
| ! [X2] :
( aSubsetOf0(X2,X1)
=> ! [X3] :
( aSupremumOfIn0(X3,X2,X1)
<=> ( aElementOf0(X3,X1)
& aUpperBoundOfIn0(X3,X2,X1)
& ! [X4] :
( aUpperBoundOfIn0(X4,X2,X1)
=> sdtlseqdt0(X3,X4) ) ) ) ) ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_1,axiom,
! [X1] :
( lhs_atom1(X1)
| ! [X2] :
( aSubsetOf0(X2,X1)
=> ! [X3] :
( aInfimumOfIn0(X3,X2,X1)
<=> ( aElementOf0(X3,X1)
& aLowerBoundOfIn0(X3,X2,X1)
& ! [X4] :
( aLowerBoundOfIn0(X4,X2,X1)
=> sdtlseqdt0(X4,X3) ) ) ) ) ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_2,axiom,
! [X1] :
( lhs_atom1(X1)
| ! [X2] :
( aSubsetOf0(X2,X1)
=> ! [X3] :
( aUpperBoundOfIn0(X3,X2,X1)
<=> ( aElementOf0(X3,X1)
& ! [X4] :
( aElementOf0(X4,X2)
=> sdtlseqdt0(X4,X3) ) ) ) ) ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_3,axiom,
! [X1] :
( lhs_atom1(X1)
| ! [X2] :
( aSubsetOf0(X2,X1)
=> ! [X3] :
( aLowerBoundOfIn0(X3,X2,X1)
<=> ( aElementOf0(X3,X1)
& ! [X4] :
( aElementOf0(X4,X2)
=> sdtlseqdt0(X3,X4) ) ) ) ) ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_4,axiom,
! [X1] :
( lhs_atom1(X1)
| ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_5,axiom,
! [X1] :
( lhs_atom1(X1)
| ( isEmpty0(X1)
<=> ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_6,axiom,
! [X1] :
( lhs_atom1(X1)
| ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_7,axiom,
! [X1] :
( lhs_atom2(X1)
| sdtlseqdt0(X1,X1) ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_8,axiom,
! [X1] :
( lhs_atom2(X1)
| $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_9,axiom,
! [X1] :
( lhs_atom1(X1)
| $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_10,axiom,
! [X1] :
( lhs_atom1(X1)
| ! [X2] :
( aSubsetOf0(X2,X1)
=> ! [X3] :
( aSupremumOfIn0(X3,X2,X1)
<=> ( aElementOf0(X3,X1)
& aUpperBoundOfIn0(X3,X2,X1)
& ! [X4] :
( aUpperBoundOfIn0(X4,X2,X1)
=> sdtlseqdt0(X3,X4) ) ) ) ) ),
c_0_0 ).
fof(c_0_11,axiom,
! [X1] :
( lhs_atom1(X1)
| ! [X2] :
( aSubsetOf0(X2,X1)
=> ! [X3] :
( aInfimumOfIn0(X3,X2,X1)
<=> ( aElementOf0(X3,X1)
& aLowerBoundOfIn0(X3,X2,X1)
& ! [X4] :
( aLowerBoundOfIn0(X4,X2,X1)
=> sdtlseqdt0(X4,X3) ) ) ) ) ),
c_0_1 ).
fof(c_0_12,axiom,
! [X1] :
( lhs_atom1(X1)
| ! [X2] :
( aSubsetOf0(X2,X1)
=> ! [X3] :
( aUpperBoundOfIn0(X3,X2,X1)
<=> ( aElementOf0(X3,X1)
& ! [X4] :
( aElementOf0(X4,X2)
=> sdtlseqdt0(X4,X3) ) ) ) ) ),
c_0_2 ).
fof(c_0_13,axiom,
! [X1] :
( lhs_atom1(X1)
| ! [X2] :
( aSubsetOf0(X2,X1)
=> ! [X3] :
( aLowerBoundOfIn0(X3,X2,X1)
<=> ( aElementOf0(X3,X1)
& ! [X4] :
( aElementOf0(X4,X2)
=> sdtlseqdt0(X3,X4) ) ) ) ) ),
c_0_3 ).
fof(c_0_14,axiom,
! [X1] :
( lhs_atom1(X1)
| ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
c_0_4 ).
fof(c_0_15,axiom,
! [X1] :
( lhs_atom1(X1)
| ( isEmpty0(X1)
<=> ~ ? [X2] : aElementOf0(X2,X1) ) ),
c_0_5 ).
fof(c_0_16,axiom,
! [X1] :
( lhs_atom1(X1)
| ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
c_0_6 ).
fof(c_0_17,axiom,
! [X1] :
( lhs_atom2(X1)
| sdtlseqdt0(X1,X1) ),
c_0_7 ).
fof(c_0_18,plain,
! [X1] : $true,
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_19,plain,
! [X1] : $true,
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_20,plain,
! [X5,X6,X7,X8,X9] :
( ( aElementOf0(X7,X5)
| ~ aSupremumOfIn0(X7,X6,X5)
| ~ aSubsetOf0(X6,X5)
| lhs_atom1(X5) )
& ( aUpperBoundOfIn0(X7,X6,X5)
| ~ aSupremumOfIn0(X7,X6,X5)
| ~ aSubsetOf0(X6,X5)
| lhs_atom1(X5) )
& ( ~ aUpperBoundOfIn0(X8,X6,X5)
| sdtlseqdt0(X7,X8)
| ~ aSupremumOfIn0(X7,X6,X5)
| ~ aSubsetOf0(X6,X5)
| lhs_atom1(X5) )
& ( aUpperBoundOfIn0(esk6_3(X5,X6,X9),X6,X5)
| ~ aUpperBoundOfIn0(X9,X6,X5)
| ~ aElementOf0(X9,X5)
| aSupremumOfIn0(X9,X6,X5)
| ~ aSubsetOf0(X6,X5)
| lhs_atom1(X5) )
& ( ~ sdtlseqdt0(X9,esk6_3(X5,X6,X9))
| ~ aUpperBoundOfIn0(X9,X6,X5)
| ~ aElementOf0(X9,X5)
| aSupremumOfIn0(X9,X6,X5)
| ~ aSubsetOf0(X6,X5)
| lhs_atom1(X5) ) ),
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_10])])])])])]) ).
fof(c_0_21,plain,
! [X5,X6,X7,X8,X9] :
( ( aElementOf0(X7,X5)
| ~ aInfimumOfIn0(X7,X6,X5)
| ~ aSubsetOf0(X6,X5)
| lhs_atom1(X5) )
& ( aLowerBoundOfIn0(X7,X6,X5)
| ~ aInfimumOfIn0(X7,X6,X5)
| ~ aSubsetOf0(X6,X5)
| lhs_atom1(X5) )
& ( ~ aLowerBoundOfIn0(X8,X6,X5)
| sdtlseqdt0(X8,X7)
| ~ aInfimumOfIn0(X7,X6,X5)
| ~ aSubsetOf0(X6,X5)
| lhs_atom1(X5) )
& ( aLowerBoundOfIn0(esk5_3(X5,X6,X9),X6,X5)
| ~ aLowerBoundOfIn0(X9,X6,X5)
| ~ aElementOf0(X9,X5)
| aInfimumOfIn0(X9,X6,X5)
| ~ aSubsetOf0(X6,X5)
| lhs_atom1(X5) )
& ( ~ sdtlseqdt0(esk5_3(X5,X6,X9),X9)
| ~ aLowerBoundOfIn0(X9,X6,X5)
| ~ aElementOf0(X9,X5)
| aInfimumOfIn0(X9,X6,X5)
| ~ aSubsetOf0(X6,X5)
| lhs_atom1(X5) ) ),
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_11])])])])])]) ).
fof(c_0_22,plain,
! [X5,X6,X7,X8,X9] :
( ( aElementOf0(X7,X5)
| ~ aUpperBoundOfIn0(X7,X6,X5)
| ~ aSubsetOf0(X6,X5)
| lhs_atom1(X5) )
& ( ~ aElementOf0(X8,X6)
| sdtlseqdt0(X8,X7)
| ~ aUpperBoundOfIn0(X7,X6,X5)
| ~ aSubsetOf0(X6,X5)
| lhs_atom1(X5) )
& ( aElementOf0(esk4_3(X5,X6,X9),X6)
| ~ aElementOf0(X9,X5)
| aUpperBoundOfIn0(X9,X6,X5)
| ~ aSubsetOf0(X6,X5)
| lhs_atom1(X5) )
& ( ~ sdtlseqdt0(esk4_3(X5,X6,X9),X9)
| ~ aElementOf0(X9,X5)
| aUpperBoundOfIn0(X9,X6,X5)
| ~ aSubsetOf0(X6,X5)
| lhs_atom1(X5) ) ),
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_23,plain,
! [X5,X6,X7,X8,X9] :
( ( aElementOf0(X7,X5)
| ~ aLowerBoundOfIn0(X7,X6,X5)
| ~ aSubsetOf0(X6,X5)
| lhs_atom1(X5) )
& ( ~ aElementOf0(X8,X6)
| sdtlseqdt0(X7,X8)
| ~ aLowerBoundOfIn0(X7,X6,X5)
| ~ aSubsetOf0(X6,X5)
| lhs_atom1(X5) )
& ( aElementOf0(esk3_3(X5,X6,X9),X6)
| ~ aElementOf0(X9,X5)
| aLowerBoundOfIn0(X9,X6,X5)
| ~ aSubsetOf0(X6,X5)
| lhs_atom1(X5) )
& ( ~ sdtlseqdt0(X9,esk3_3(X5,X6,X9))
| ~ aElementOf0(X9,X5)
| aLowerBoundOfIn0(X9,X6,X5)
| ~ aSubsetOf0(X6,X5)
| lhs_atom1(X5) ) ),
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_13])])])])])]) ).
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_14])])])])])]) ).
fof(c_0_25,plain,
! [X3,X4] :
( ( ~ isEmpty0(X3)
| ~ aElementOf0(X4,X3)
| lhs_atom1(X3) )
& ( aElementOf0(esk1_1(X3),X3)
| isEmpty0(X3)
| lhs_atom1(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])]) ).
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_16])])]) ).
fof(c_0_27,plain,
! [X2] :
( lhs_atom2(X2)
| sdtlseqdt0(X2,X2) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
fof(c_0_28,plain,
! [X2] : $true,
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_29,plain,
! [X2] : $true,
inference(variable_rename,[status(thm)],[c_0_19]) ).
cnf(c_0_30,plain,
( lhs_atom1(X1)
| aSupremumOfIn0(X3,X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1)
| ~ aUpperBoundOfIn0(X3,X2,X1)
| ~ sdtlseqdt0(X3,esk6_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,plain,
( lhs_atom1(X1)
| aInfimumOfIn0(X3,X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1)
| ~ aLowerBoundOfIn0(X3,X2,X1)
| ~ sdtlseqdt0(esk5_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,plain,
( lhs_atom1(X1)
| aSupremumOfIn0(X3,X2,X1)
| aUpperBoundOfIn0(esk6_3(X1,X2,X3),X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1)
| ~ aUpperBoundOfIn0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_33,plain,
( lhs_atom1(X1)
| aInfimumOfIn0(X3,X2,X1)
| aLowerBoundOfIn0(esk5_3(X1,X2,X3),X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1)
| ~ aLowerBoundOfIn0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_34,plain,
( lhs_atom1(X1)
| aUpperBoundOfIn0(X3,X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1)
| ~ sdtlseqdt0(esk4_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_35,plain,
( lhs_atom1(X1)
| aLowerBoundOfIn0(X3,X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1)
| ~ sdtlseqdt0(X3,esk3_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_36,plain,
( lhs_atom1(X1)
| aUpperBoundOfIn0(X3,X2,X1)
| aElementOf0(esk4_3(X1,X2,X3),X2)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_37,plain,
( lhs_atom1(X1)
| aLowerBoundOfIn0(X3,X2,X1)
| aElementOf0(esk3_3(X1,X2,X3),X2)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_38,plain,
( lhs_atom1(X1)
| sdtlseqdt0(X3,X4)
| ~ aSubsetOf0(X2,X1)
| ~ aSupremumOfIn0(X3,X2,X1)
| ~ aUpperBoundOfIn0(X4,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_39,plain,
( lhs_atom1(X1)
| sdtlseqdt0(X4,X3)
| ~ aSubsetOf0(X2,X1)
| ~ aInfimumOfIn0(X3,X2,X1)
| ~ aLowerBoundOfIn0(X4,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_40,plain,
( lhs_atom1(X1)
| aUpperBoundOfIn0(X3,X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aSupremumOfIn0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_41,plain,
( lhs_atom1(X1)
| aLowerBoundOfIn0(X3,X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aInfimumOfIn0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_42,plain,
( lhs_atom1(X1)
| sdtlseqdt0(X4,X3)
| ~ aSubsetOf0(X2,X1)
| ~ aUpperBoundOfIn0(X3,X2,X1)
| ~ aElementOf0(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_43,plain,
( lhs_atom1(X1)
| sdtlseqdt0(X3,X4)
| ~ aSubsetOf0(X2,X1)
| ~ aLowerBoundOfIn0(X3,X2,X1)
| ~ aElementOf0(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_44,plain,
( lhs_atom1(X1)
| aElementOf0(X3,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aSupremumOfIn0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_45,plain,
( lhs_atom1(X1)
| aElementOf0(X3,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aInfimumOfIn0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_46,plain,
( lhs_atom1(X1)
| aElementOf0(X3,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aUpperBoundOfIn0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_47,plain,
( lhs_atom1(X1)
| aElementOf0(X3,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aLowerBoundOfIn0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_48,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_49,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_50,plain,
( lhs_atom1(X1)
| aElementOf0(X3,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_51,plain,
( lhs_atom1(X1)
| ~ aElementOf0(X2,X1)
| ~ isEmpty0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_52,plain,
( lhs_atom1(X1)
| aSet0(X2)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_53,plain,
( aElement0(X1)
| lhs_atom1(X2)
| ~ aElementOf0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_54,plain,
( lhs_atom1(X1)
| isEmpty0(X1)
| aElementOf0(esk1_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_55,plain,
( sdtlseqdt0(X1,X1)
| lhs_atom2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_56,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_57,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_58,plain,
( lhs_atom1(X1)
| aSupremumOfIn0(X3,X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1)
| ~ aUpperBoundOfIn0(X3,X2,X1)
| ~ sdtlseqdt0(X3,esk6_3(X1,X2,X3)) ),
c_0_30,
[final] ).
cnf(c_0_59,plain,
( lhs_atom1(X1)
| aInfimumOfIn0(X3,X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1)
| ~ aLowerBoundOfIn0(X3,X2,X1)
| ~ sdtlseqdt0(esk5_3(X1,X2,X3),X3) ),
c_0_31,
[final] ).
cnf(c_0_60,plain,
( lhs_atom1(X1)
| aSupremumOfIn0(X3,X2,X1)
| aUpperBoundOfIn0(esk6_3(X1,X2,X3),X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1)
| ~ aUpperBoundOfIn0(X3,X2,X1) ),
c_0_32,
[final] ).
cnf(c_0_61,plain,
( lhs_atom1(X1)
| aInfimumOfIn0(X3,X2,X1)
| aLowerBoundOfIn0(esk5_3(X1,X2,X3),X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1)
| ~ aLowerBoundOfIn0(X3,X2,X1) ),
c_0_33,
[final] ).
cnf(c_0_62,plain,
( lhs_atom1(X1)
| aUpperBoundOfIn0(X3,X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1)
| ~ sdtlseqdt0(esk4_3(X1,X2,X3),X3) ),
c_0_34,
[final] ).
cnf(c_0_63,plain,
( lhs_atom1(X1)
| aLowerBoundOfIn0(X3,X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1)
| ~ sdtlseqdt0(X3,esk3_3(X1,X2,X3)) ),
c_0_35,
[final] ).
cnf(c_0_64,plain,
( lhs_atom1(X1)
| aUpperBoundOfIn0(X3,X2,X1)
| aElementOf0(esk4_3(X1,X2,X3),X2)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1) ),
c_0_36,
[final] ).
cnf(c_0_65,plain,
( lhs_atom1(X1)
| aLowerBoundOfIn0(X3,X2,X1)
| aElementOf0(esk3_3(X1,X2,X3),X2)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1) ),
c_0_37,
[final] ).
cnf(c_0_66,plain,
( lhs_atom1(X1)
| sdtlseqdt0(X3,X4)
| ~ aSubsetOf0(X2,X1)
| ~ aSupremumOfIn0(X3,X2,X1)
| ~ aUpperBoundOfIn0(X4,X2,X1) ),
c_0_38,
[final] ).
cnf(c_0_67,plain,
( lhs_atom1(X1)
| sdtlseqdt0(X4,X3)
| ~ aSubsetOf0(X2,X1)
| ~ aInfimumOfIn0(X3,X2,X1)
| ~ aLowerBoundOfIn0(X4,X2,X1) ),
c_0_39,
[final] ).
cnf(c_0_68,plain,
( lhs_atom1(X1)
| aUpperBoundOfIn0(X3,X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aSupremumOfIn0(X3,X2,X1) ),
c_0_40,
[final] ).
cnf(c_0_69,plain,
( lhs_atom1(X1)
| aLowerBoundOfIn0(X3,X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aInfimumOfIn0(X3,X2,X1) ),
c_0_41,
[final] ).
cnf(c_0_70,plain,
( lhs_atom1(X1)
| sdtlseqdt0(X4,X3)
| ~ aSubsetOf0(X2,X1)
| ~ aUpperBoundOfIn0(X3,X2,X1)
| ~ aElementOf0(X4,X2) ),
c_0_42,
[final] ).
cnf(c_0_71,plain,
( lhs_atom1(X1)
| sdtlseqdt0(X3,X4)
| ~ aSubsetOf0(X2,X1)
| ~ aLowerBoundOfIn0(X3,X2,X1)
| ~ aElementOf0(X4,X2) ),
c_0_43,
[final] ).
cnf(c_0_72,plain,
( lhs_atom1(X1)
| aElementOf0(X3,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aSupremumOfIn0(X3,X2,X1) ),
c_0_44,
[final] ).
cnf(c_0_73,plain,
( lhs_atom1(X1)
| aElementOf0(X3,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aInfimumOfIn0(X3,X2,X1) ),
c_0_45,
[final] ).
cnf(c_0_74,plain,
( lhs_atom1(X1)
| aElementOf0(X3,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aUpperBoundOfIn0(X3,X2,X1) ),
c_0_46,
[final] ).
cnf(c_0_75,plain,
( lhs_atom1(X1)
| aElementOf0(X3,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aLowerBoundOfIn0(X3,X2,X1) ),
c_0_47,
[final] ).
cnf(c_0_76,plain,
( lhs_atom1(X1)
| aSubsetOf0(X2,X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk2_2(X1,X2),X1) ),
c_0_48,
[final] ).
cnf(c_0_77,plain,
( lhs_atom1(X1)
| aSubsetOf0(X2,X1)
| aElementOf0(esk2_2(X1,X2),X2)
| ~ aSet0(X2) ),
c_0_49,
[final] ).
cnf(c_0_78,plain,
( lhs_atom1(X1)
| aElementOf0(X3,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X2) ),
c_0_50,
[final] ).
cnf(c_0_79,plain,
( lhs_atom1(X1)
| ~ aElementOf0(X2,X1)
| ~ isEmpty0(X1) ),
c_0_51,
[final] ).
cnf(c_0_80,plain,
( lhs_atom1(X1)
| aSet0(X2)
| ~ aSubsetOf0(X2,X1) ),
c_0_52,
[final] ).
cnf(c_0_81,plain,
( aElement0(X1)
| lhs_atom1(X2)
| ~ aElementOf0(X1,X2) ),
c_0_53,
[final] ).
cnf(c_0_82,plain,
( lhs_atom1(X1)
| isEmpty0(X1)
| aElementOf0(esk1_1(X1),X1) ),
c_0_54,
[final] ).
cnf(c_0_83,plain,
( sdtlseqdt0(X1,X1)
| lhs_atom2(X1) ),
c_0_55,
[final] ).
cnf(c_0_84,plain,
$true,
c_0_56,
[final] ).
cnf(c_0_85,plain,
$true,
c_0_57,
[final] ).
% End CNF derivation
cnf(c_0_58_0,axiom,
( ~ aSet0(X1)
| aSupremumOfIn0(X3,X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1)
| ~ aUpperBoundOfIn0(X3,X2,X1)
| ~ sdtlseqdt0(X3,sk1_esk6_3(X1,X2,X3)) ),
inference(unfold_definition,[status(thm)],[c_0_58,def_lhs_atom1]) ).
cnf(c_0_59_0,axiom,
( ~ aSet0(X1)
| aInfimumOfIn0(X3,X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1)
| ~ aLowerBoundOfIn0(X3,X2,X1)
| ~ sdtlseqdt0(sk1_esk5_3(X1,X2,X3),X3) ),
inference(unfold_definition,[status(thm)],[c_0_59,def_lhs_atom1]) ).
cnf(c_0_60_0,axiom,
( ~ aSet0(X1)
| aSupremumOfIn0(X3,X2,X1)
| aUpperBoundOfIn0(sk1_esk6_3(X1,X2,X3),X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1)
| ~ aUpperBoundOfIn0(X3,X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_60,def_lhs_atom1]) ).
cnf(c_0_61_0,axiom,
( ~ aSet0(X1)
| aInfimumOfIn0(X3,X2,X1)
| aLowerBoundOfIn0(sk1_esk5_3(X1,X2,X3),X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1)
| ~ aLowerBoundOfIn0(X3,X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_61,def_lhs_atom1]) ).
cnf(c_0_62_0,axiom,
( ~ aSet0(X1)
| aUpperBoundOfIn0(X3,X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1)
| ~ sdtlseqdt0(sk1_esk4_3(X1,X2,X3),X3) ),
inference(unfold_definition,[status(thm)],[c_0_62,def_lhs_atom1]) ).
cnf(c_0_63_0,axiom,
( ~ aSet0(X1)
| aLowerBoundOfIn0(X3,X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1)
| ~ sdtlseqdt0(X3,sk1_esk3_3(X1,X2,X3)) ),
inference(unfold_definition,[status(thm)],[c_0_63,def_lhs_atom1]) ).
cnf(c_0_64_0,axiom,
( ~ aSet0(X1)
| aUpperBoundOfIn0(X3,X2,X1)
| aElementOf0(sk1_esk4_3(X1,X2,X3),X2)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_64,def_lhs_atom1]) ).
cnf(c_0_65_0,axiom,
( ~ aSet0(X1)
| aLowerBoundOfIn0(X3,X2,X1)
| aElementOf0(sk1_esk3_3(X1,X2,X3),X2)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_65,def_lhs_atom1]) ).
cnf(c_0_66_0,axiom,
( ~ aSet0(X1)
| sdtlseqdt0(X3,X4)
| ~ aSubsetOf0(X2,X1)
| ~ aSupremumOfIn0(X3,X2,X1)
| ~ aUpperBoundOfIn0(X4,X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_66,def_lhs_atom1]) ).
cnf(c_0_67_0,axiom,
( ~ aSet0(X1)
| sdtlseqdt0(X4,X3)
| ~ aSubsetOf0(X2,X1)
| ~ aInfimumOfIn0(X3,X2,X1)
| ~ aLowerBoundOfIn0(X4,X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_67,def_lhs_atom1]) ).
cnf(c_0_68_0,axiom,
( ~ aSet0(X1)
| aUpperBoundOfIn0(X3,X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aSupremumOfIn0(X3,X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_68,def_lhs_atom1]) ).
cnf(c_0_69_0,axiom,
( ~ aSet0(X1)
| aLowerBoundOfIn0(X3,X2,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aInfimumOfIn0(X3,X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_69,def_lhs_atom1]) ).
cnf(c_0_70_0,axiom,
( ~ aSet0(X1)
| sdtlseqdt0(X4,X3)
| ~ aSubsetOf0(X2,X1)
| ~ aUpperBoundOfIn0(X3,X2,X1)
| ~ aElementOf0(X4,X2) ),
inference(unfold_definition,[status(thm)],[c_0_70,def_lhs_atom1]) ).
cnf(c_0_71_0,axiom,
( ~ aSet0(X1)
| sdtlseqdt0(X3,X4)
| ~ aSubsetOf0(X2,X1)
| ~ aLowerBoundOfIn0(X3,X2,X1)
| ~ aElementOf0(X4,X2) ),
inference(unfold_definition,[status(thm)],[c_0_71,def_lhs_atom1]) ).
cnf(c_0_72_0,axiom,
( ~ aSet0(X1)
| aElementOf0(X3,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aSupremumOfIn0(X3,X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_72,def_lhs_atom1]) ).
cnf(c_0_73_0,axiom,
( ~ aSet0(X1)
| aElementOf0(X3,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aInfimumOfIn0(X3,X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_73,def_lhs_atom1]) ).
cnf(c_0_74_0,axiom,
( ~ aSet0(X1)
| aElementOf0(X3,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aUpperBoundOfIn0(X3,X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_74,def_lhs_atom1]) ).
cnf(c_0_75_0,axiom,
( ~ aSet0(X1)
| aElementOf0(X3,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aLowerBoundOfIn0(X3,X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_75,def_lhs_atom1]) ).
cnf(c_0_76_0,axiom,
( ~ aSet0(X1)
| aSubsetOf0(X2,X1)
| ~ aSet0(X2)
| ~ aElementOf0(sk1_esk2_2(X1,X2),X1) ),
inference(unfold_definition,[status(thm)],[c_0_76,def_lhs_atom1]) ).
cnf(c_0_77_0,axiom,
( ~ aSet0(X1)
| aSubsetOf0(X2,X1)
| aElementOf0(sk1_esk2_2(X1,X2),X2)
| ~ aSet0(X2) ),
inference(unfold_definition,[status(thm)],[c_0_77,def_lhs_atom1]) ).
cnf(c_0_78_0,axiom,
( ~ aSet0(X1)
| aElementOf0(X3,X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X2) ),
inference(unfold_definition,[status(thm)],[c_0_78,def_lhs_atom1]) ).
cnf(c_0_79_0,axiom,
( ~ aSet0(X1)
| ~ aElementOf0(X2,X1)
| ~ isEmpty0(X1) ),
inference(unfold_definition,[status(thm)],[c_0_79,def_lhs_atom1]) ).
cnf(c_0_80_0,axiom,
( ~ aSet0(X1)
| aSet0(X2)
| ~ aSubsetOf0(X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_80,def_lhs_atom1]) ).
cnf(c_0_81_0,axiom,
( ~ aSet0(X2)
| aElement0(X1)
| ~ aElementOf0(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_81,def_lhs_atom1]) ).
cnf(c_0_82_0,axiom,
( ~ aSet0(X1)
| isEmpty0(X1)
| aElementOf0(sk1_esk1_1(X1),X1) ),
inference(unfold_definition,[status(thm)],[c_0_82,def_lhs_atom1]) ).
cnf(c_0_83_0,axiom,
( ~ aElement0(X1)
| sdtlseqdt0(X1,X1) ),
inference(unfold_definition,[status(thm)],[c_0_83,def_lhs_atom2]) ).
cnf(c_0_84_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_84,def_true]) ).
cnf(c_0_85_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_85,def_true]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X3) )
=> sdtlseqdt0(X1,X3) ) ),
file('<stdin>',mTrans) ).
fof(c_0_1_002,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X1) )
=> X1 = X2 ) ),
file('<stdin>',mASymm) ).
fof(c_0_2_003,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> ( sdtlseqdt0(X1,X2)
=> $true ) ),
file('<stdin>',mLessRel) ).
fof(c_0_3_004,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X3) )
=> sdtlseqdt0(X1,X3) ) ),
c_0_0 ).
fof(c_0_4_005,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X1) )
=> X1 = X2 ) ),
c_0_1 ).
fof(c_0_5_006,plain,
! [X1,X2] : $true,
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_6_007,plain,
! [X4,X5,X6] :
( ~ aElement0(X4)
| ~ aElement0(X5)
| ~ aElement0(X6)
| ~ sdtlseqdt0(X4,X5)
| ~ sdtlseqdt0(X5,X6)
| sdtlseqdt0(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
fof(c_0_7_008,plain,
! [X3,X4] :
( ~ aElement0(X3)
| ~ aElement0(X4)
| ~ sdtlseqdt0(X3,X4)
| ~ sdtlseqdt0(X4,X3)
| X3 = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
fof(c_0_8_009,plain,
! [X3,X4] : $true,
inference(variable_rename,[status(thm)],[c_0_5]) ).
cnf(c_0_9_010,plain,
( sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X3,X2)
| ~ sdtlseqdt0(X1,X3)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10_011,plain,
( X1 = X2
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11_012,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12_013,plain,
( sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X3,X2)
| ~ sdtlseqdt0(X1,X3)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
c_0_9,
[final] ).
cnf(c_0_13_014,plain,
( X1 = X2
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
c_0_10,
[final] ).
cnf(c_0_14_015,plain,
$true,
c_0_11,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_12_0,axiom,
( sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X3,X2)
| ~ sdtlseqdt0(X1,X3)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_12]) ).
cnf(c_0_12_1,axiom,
( ~ sdtlseqdt0(X3,X2)
| sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X1,X3)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_12]) ).
cnf(c_0_12_2,axiom,
( ~ sdtlseqdt0(X1,X3)
| ~ sdtlseqdt0(X3,X2)
| sdtlseqdt0(X1,X2)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_12]) ).
cnf(c_0_12_3,axiom,
( ~ aElement0(X2)
| ~ sdtlseqdt0(X1,X3)
| ~ sdtlseqdt0(X3,X2)
| sdtlseqdt0(X1,X2)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_12]) ).
cnf(c_0_12_4,axiom,
( ~ aElement0(X3)
| ~ aElement0(X2)
| ~ sdtlseqdt0(X1,X3)
| ~ sdtlseqdt0(X3,X2)
| sdtlseqdt0(X1,X2)
| ~ aElement0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_12]) ).
cnf(c_0_12_5,axiom,
( ~ aElement0(X1)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ sdtlseqdt0(X1,X3)
| ~ sdtlseqdt0(X3,X2)
| sdtlseqdt0(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_12]) ).
cnf(c_0_13_0,axiom,
( X1 = X2
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_13]) ).
cnf(c_0_13_1,axiom,
( ~ sdtlseqdt0(X2,X1)
| X1 = X2
| ~ sdtlseqdt0(X1,X2)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_13]) ).
cnf(c_0_13_2,axiom,
( ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X2,X1)
| X1 = X2
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_13]) ).
cnf(c_0_13_3,axiom,
( ~ aElement0(X2)
| ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X2,X1)
| X1 = X2
| ~ aElement0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_13]) ).
cnf(c_0_13_4,axiom,
( ~ aElement0(X1)
| ~ aElement0(X2)
| ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X2,X1)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_13]) ).
cnf(c_0_14_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_14]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_016,hypothesis,
( aElementOf0(xu,xT)
& aElementOf0(xu,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,xu) )
& aUpperBoundOfIn0(xu,xS,xT)
& ! [X1] :
( ( ( aElementOf0(X1,xT)
& ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xS,xT) )
=> sdtlseqdt0(xu,X1) )
& aSupremumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,xv) )
& aUpperBoundOfIn0(xv,xS,xT)
& ! [X1] :
( ( ( aElementOf0(X1,xT)
& ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xS,xT) )
=> sdtlseqdt0(xv,X1) )
& aSupremumOfIn0(xv,xS,xT) ),
file('<stdin>',m__744) ).
fof(c_0_1_017,hypothesis,
( aSet0(xS)
& ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,xT) )
& aSubsetOf0(xS,xT) ),
file('<stdin>',m__725_01) ).
fof(c_0_2_018,hypothesis,
aSet0(xT),
file('<stdin>',m__725) ).
fof(c_0_3_019,conjecture,
xu = xv,
file('<stdin>',m__) ).
fof(c_0_4_020,hypothesis,
( aElementOf0(xu,xT)
& aElementOf0(xu,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,xu) )
& aUpperBoundOfIn0(xu,xS,xT)
& ! [X1] :
( ( ( aElementOf0(X1,xT)
& ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xS,xT) )
=> sdtlseqdt0(xu,X1) )
& aSupremumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,xv) )
& aUpperBoundOfIn0(xv,xS,xT)
& ! [X1] :
( ( ( aElementOf0(X1,xT)
& ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xS,xT) )
=> sdtlseqdt0(xv,X1) )
& aSupremumOfIn0(xv,xS,xT) ),
c_0_0 ).
fof(c_0_5_021,hypothesis,
( aSet0(xS)
& ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,xT) )
& aSubsetOf0(xS,xT) ),
c_0_1 ).
fof(c_0_6_022,hypothesis,
aSet0(xT),
c_0_2 ).
fof(c_0_7_023,negated_conjecture,
xu != xv,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[c_0_3])]) ).
fof(c_0_8_024,hypothesis,
! [X3,X4,X6,X7] :
( aElementOf0(xu,xT)
& aElementOf0(xu,xT)
& ( ~ aElementOf0(X3,xS)
| sdtlseqdt0(X3,xu) )
& aUpperBoundOfIn0(xu,xS,xT)
& ( aElementOf0(esk1_1(X4),xS)
| ~ aElementOf0(X4,xT)
| sdtlseqdt0(xu,X4) )
& ( ~ sdtlseqdt0(esk1_1(X4),X4)
| ~ aElementOf0(X4,xT)
| sdtlseqdt0(xu,X4) )
& ( ~ aUpperBoundOfIn0(X4,xS,xT)
| sdtlseqdt0(xu,X4) )
& aSupremumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ( ~ aElementOf0(X6,xS)
| sdtlseqdt0(X6,xv) )
& aUpperBoundOfIn0(xv,xS,xT)
& ( aElementOf0(esk2_1(X7),xS)
| ~ aElementOf0(X7,xT)
| sdtlseqdt0(xv,X7) )
& ( ~ sdtlseqdt0(esk2_1(X7),X7)
| ~ aElementOf0(X7,xT)
| sdtlseqdt0(xv,X7) )
& ( ~ aUpperBoundOfIn0(X7,xS,xT)
| sdtlseqdt0(xv,X7) )
& aSupremumOfIn0(xv,xS,xT) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
fof(c_0_9_025,hypothesis,
! [X2] :
( aSet0(xS)
& ( ~ aElementOf0(X2,xS)
| aElementOf0(X2,xT) )
& aSubsetOf0(xS,xT) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_10_026,hypothesis,
aSet0(xT),
c_0_6 ).
fof(c_0_11_027,negated_conjecture,
xu != xv,
c_0_7 ).
cnf(c_0_12_028,hypothesis,
( sdtlseqdt0(xu,X1)
| ~ aUpperBoundOfIn0(X1,xS,xT) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13_029,hypothesis,
( sdtlseqdt0(xv,X1)
| ~ aUpperBoundOfIn0(X1,xS,xT) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14_030,hypothesis,
( sdtlseqdt0(xu,X1)
| ~ aElementOf0(X1,xT)
| ~ sdtlseqdt0(esk1_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15_031,hypothesis,
( sdtlseqdt0(xv,X1)
| ~ aElementOf0(X1,xT)
| ~ sdtlseqdt0(esk2_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16_032,hypothesis,
( sdtlseqdt0(xu,X1)
| aElementOf0(esk1_1(X1),xS)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17_033,hypothesis,
( sdtlseqdt0(xv,X1)
| aElementOf0(esk2_1(X1),xS)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18_034,hypothesis,
aUpperBoundOfIn0(xu,xS,xT),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19_035,hypothesis,
aSupremumOfIn0(xu,xS,xT),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20_036,hypothesis,
aUpperBoundOfIn0(xv,xS,xT),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21_037,hypothesis,
aSupremumOfIn0(xv,xS,xT),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22_038,hypothesis,
( sdtlseqdt0(X1,xu)
| ~ aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23_039,hypothesis,
( sdtlseqdt0(X1,xv)
| ~ aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24_040,hypothesis,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25_041,hypothesis,
aElementOf0(xu,xT),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26_042,hypothesis,
aElementOf0(xu,xT),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27_043,hypothesis,
aElementOf0(xv,xT),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28_044,hypothesis,
aElementOf0(xv,xT),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29_045,hypothesis,
aSubsetOf0(xS,xT),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_30_046,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_31_047,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_32_048,negated_conjecture,
xu != xv,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_33_049,hypothesis,
( sdtlseqdt0(xu,X1)
| ~ aUpperBoundOfIn0(X1,xS,xT) ),
c_0_12,
[final] ).
cnf(c_0_34_050,hypothesis,
( sdtlseqdt0(xv,X1)
| ~ aUpperBoundOfIn0(X1,xS,xT) ),
c_0_13,
[final] ).
cnf(c_0_35_051,hypothesis,
( sdtlseqdt0(xu,X1)
| ~ aElementOf0(X1,xT)
| ~ sdtlseqdt0(esk1_1(X1),X1) ),
c_0_14,
[final] ).
cnf(c_0_36_052,hypothesis,
( sdtlseqdt0(xv,X1)
| ~ aElementOf0(X1,xT)
| ~ sdtlseqdt0(esk2_1(X1),X1) ),
c_0_15,
[final] ).
cnf(c_0_37_053,hypothesis,
( sdtlseqdt0(xu,X1)
| aElementOf0(esk1_1(X1),xS)
| ~ aElementOf0(X1,xT) ),
c_0_16,
[final] ).
cnf(c_0_38_054,hypothesis,
( sdtlseqdt0(xv,X1)
| aElementOf0(esk2_1(X1),xS)
| ~ aElementOf0(X1,xT) ),
c_0_17,
[final] ).
cnf(c_0_39_055,hypothesis,
aUpperBoundOfIn0(xu,xS,xT),
c_0_18,
[final] ).
cnf(c_0_40_056,hypothesis,
aSupremumOfIn0(xu,xS,xT),
c_0_19,
[final] ).
cnf(c_0_41_057,hypothesis,
aUpperBoundOfIn0(xv,xS,xT),
c_0_20,
[final] ).
cnf(c_0_42_058,hypothesis,
aSupremumOfIn0(xv,xS,xT),
c_0_21,
[final] ).
cnf(c_0_43_059,hypothesis,
( sdtlseqdt0(X1,xu)
| ~ aElementOf0(X1,xS) ),
c_0_22,
[final] ).
cnf(c_0_44_060,hypothesis,
( sdtlseqdt0(X1,xv)
| ~ aElementOf0(X1,xS) ),
c_0_23,
[final] ).
cnf(c_0_45_061,hypothesis,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,xS) ),
c_0_24,
[final] ).
cnf(c_0_46_062,hypothesis,
aElementOf0(xu,xT),
c_0_25,
[final] ).
cnf(c_0_47_063,hypothesis,
aElementOf0(xu,xT),
c_0_26,
[final] ).
cnf(c_0_48_064,hypothesis,
aElementOf0(xv,xT),
c_0_27,
[final] ).
cnf(c_0_49_065,hypothesis,
aElementOf0(xv,xT),
c_0_28,
[final] ).
cnf(c_0_50_066,hypothesis,
aSubsetOf0(xS,xT),
c_0_29,
[final] ).
cnf(c_0_51_067,hypothesis,
aSet0(xS),
c_0_30,
[final] ).
cnf(c_0_52_068,hypothesis,
aSet0(xT),
c_0_31,
[final] ).
cnf(c_0_53_069,negated_conjecture,
xu != xv,
c_0_32,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_9,plain,
( ~ aElement0(X0)
| X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9fbfed.p',c_0_13_3) ).
cnf(c_232,plain,
( ~ aElement0(X0)
| X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_26606,plain,
( ~ sdtlseqdt0(xu,X0)
| ~ sdtlseqdt0(X0,xu)
| ~ aElement0(xu)
| ~ aElement0(X0)
| xu = X0 ),
inference(instantiation,[status(thm)],[c_232]) ).
cnf(c_26918,plain,
( ~ sdtlseqdt0(xu,xv)
| ~ sdtlseqdt0(xv,xu)
| ~ aElement0(xu)
| ~ aElement0(xv)
| xu = xv ),
inference(instantiation,[status(thm)],[c_26606]) ).
cnf(c_16,plain,
( ~ aElementOf0(X0,X1)
| aElement0(X0)
| ~ aSet0(X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9fbfed.p',c_0_81_0) ).
cnf(c_239,plain,
( ~ aElementOf0(X0,X1)
| aElement0(X0)
| ~ aSet0(X1) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_26552,plain,
( aElement0(xv)
| ~ aSet0(xT)
| ~ aElementOf0(xv,xT) ),
inference(instantiation,[status(thm)],[c_239]) ).
cnf(c_26551,plain,
( aElement0(xu)
| ~ aSet0(xT)
| ~ aElementOf0(xu,xT) ),
inference(instantiation,[status(thm)],[c_239]) ).
cnf(c_40,plain,
( sdtlseqdt0(xu,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9fbfed.p',c_0_33) ).
cnf(c_95,plain,
( sdtlseqdt0(xu,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT) ),
inference(copy,[status(esa)],[c_40]) ).
cnf(c_139,plain,
( sdtlseqdt0(xu,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT) ),
inference(copy,[status(esa)],[c_95]) ).
cnf(c_176,plain,
( sdtlseqdt0(xu,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT) ),
inference(copy,[status(esa)],[c_139]) ).
cnf(c_52,plain,
aUpperBoundOfIn0(xv,xS,xT),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9fbfed.p',c_0_41) ).
cnf(c_117,plain,
aUpperBoundOfIn0(xv,xS,xT),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_151,plain,
aUpperBoundOfIn0(xv,xS,xT),
inference(copy,[status(esa)],[c_117]) ).
cnf(c_164,plain,
aUpperBoundOfIn0(xv,xS,xT),
inference(copy,[status(esa)],[c_151]) ).
cnf(c_195,plain,
( sdtlseqdt0(xu,X0)
| xS != xS
| xT != xT
| X0 != xv ),
inference(resolution_lifted,[status(thm)],[c_176,c_164]) ).
cnf(c_196,plain,
sdtlseqdt0(xu,xv),
inference(unflattening,[status(esa)],[c_195]) ).
cnf(c_41,plain,
( sdtlseqdt0(xv,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9fbfed.p',c_0_34) ).
cnf(c_97,plain,
( sdtlseqdt0(xv,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT) ),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_140,plain,
( sdtlseqdt0(xv,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT) ),
inference(copy,[status(esa)],[c_97]) ).
cnf(c_175,plain,
( sdtlseqdt0(xv,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT) ),
inference(copy,[status(esa)],[c_140]) ).
cnf(c_50,plain,
aUpperBoundOfIn0(xu,xS,xT),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9fbfed.p',c_0_39) ).
cnf(c_113,plain,
aUpperBoundOfIn0(xu,xS,xT),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_149,plain,
aUpperBoundOfIn0(xu,xS,xT),
inference(copy,[status(esa)],[c_113]) ).
cnf(c_166,plain,
aUpperBoundOfIn0(xu,xS,xT),
inference(copy,[status(esa)],[c_149]) ).
cnf(c_177,plain,
( sdtlseqdt0(xv,X0)
| xS != xS
| xT != xT
| X0 != xu ),
inference(resolution_lifted,[status(thm)],[c_175,c_166]) ).
cnf(c_178,plain,
sdtlseqdt0(xv,xu),
inference(unflattening,[status(esa)],[c_177]) ).
cnf(c_55,plain,
aElementOf0(xu,xT),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9fbfed.p',c_0_47) ).
cnf(c_57,plain,
aElementOf0(xv,xT),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9fbfed.p',c_0_49) ).
cnf(c_60,plain,
aSet0(xT),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9fbfed.p',c_0_52) ).
cnf(c_49,negated_conjecture,
xu != xv,
file('/export/starexec/sandbox2/tmp/iprover_modulo_9fbfed.p',c_0_53) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_26918,c_26552,c_26551,c_196,c_178,c_55,c_57,c_60,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LAT381+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 28 19:10:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % Running in mono-core mode
% 0.13/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.13/0.40 % FOF problem with conjecture
% 0.13/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/sandbox2/tmp/iprover_proof_f166c9.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_9fbfed.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_f184ca | grep -v "SZS"
% 0.19/0.42
% 0.19/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % ------ iProver source info
% 0.19/0.42
% 0.19/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.42 % git: non_committed_changes: true
% 0.19/0.42 % git: last_make_outside_of_git: true
% 0.19/0.42
% 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.43 % --inst_passive_queues_freq [25;2]
% 0.19/0.43 % --inst_dismatching true
% 0.19/0.43 % --inst_eager_unprocessed_to_passive true
% 0.19/0.43 % --inst_prop_sim_given true
% 0.19/0.43 % --inst_prop_sim_new false
% 0.19/0.43 % --inst_orphan_elimination true
% 0.19/0.43 % --inst_learning_loop_flag true
% 0.19/0.43 % --inst_learning_start 3000
% 0.19/0.43 % --inst_learning_factor 2
% 0.19/0.43 % --inst_start_prop_sim_after_learn 3
% 0.19/0.43 % --inst_sel_renew solver
% 0.19/0.43 % --inst_lit_activity_flag true
% 0.19/0.43 % --inst_out_proof true
% 0.19/0.43
% 0.19/0.43 % ------ Resolution Options
% 0.19/0.43
% 0.19/0.43 % --resolution_flag true
% 0.19/0.43 % --res_lit_sel kbo_max
% 0.19/0.43 % --res_to_prop_solver none
% 0.19/0.43 % --res_prop_simpl_new false
% 0.19/0.43 % --res_prop_simpl_given false
% 0.19/0.43 % --res_passive_queue_type priority_queues
% 0.19/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.43 % --res_passive_queues_freq [15;5]
% 0.19/0.43 % --res_forward_subs full
% 0.19/0.43 % --res_backward_subs full
% 0.19/0.43 % --res_forward_subs_resolution true
% 0.19/0.43 % --res_backward_subs_resolution true
% 0.19/0.43 % --res_orphan_elimination false
% 0.19/0.43 % --res_time_limit 1000.
% 0.19/0.43 % --res_out_proof true
% 0.19/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_f166c9.s
% 0.19/0.43 % --modulo true
% 0.19/0.43
% 0.19/0.43 % ------ Combination Options
% 0.19/0.43
% 0.19/0.43 % --comb_res_mult 1000
% 0.19/0.43 % --comb_inst_mult 300
% 0.19/0.43 % ------
% 0.19/0.43
% 0.19/0.43 % ------ Parsing...% successful
% 0.19/0.43
% 0.19/0.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.19/0.43
% 0.19/0.43 % ------ Proving...
% 0.19/0.43 % ------ Problem Properties
% 0.19/0.43
% 0.19/0.43 %
% 0.19/0.43 % EPR false
% 0.19/0.43 % Horn false
% 0.19/0.43 % Has equality true
% 0.19/0.43
% 0.19/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 % % ------ Current options:
% 0.19/0.43
% 0.19/0.43 % ------ Input Options
% 0.19/0.43
% 0.19/0.43 % --out_options all
% 0.19/0.43 % --tptp_safe_out true
% 0.19/0.43 % --problem_path ""
% 0.19/0.43 % --include_path ""
% 0.19/0.43 % --clausifier .//eprover
% 0.19/0.43 % --clausifier_options --tstp-format
% 0.19/0.43 % --stdin false
% 0.19/0.43 % --dbg_backtrace false
% 0.19/0.43 % --dbg_dump_prop_clauses false
% 0.19/0.43 % --dbg_dump_prop_clauses_file -
% 0.19/0.43 % --dbg_out_stat false
% 0.19/0.43
% 0.19/0.43 % ------ General Options
% 0.19/0.43
% 0.19/0.43 % --fof false
% 0.19/0.43 % --time_out_real 150.
% 0.19/0.43 % --time_out_prep_mult 0.2
% 0.19/0.43 % --time_out_virtual -1.
% 0.19/0.43 % --schedule none
% 0.19/0.43 % --ground_splitting input
% 0.19/0.43 % --splitting_nvd 16
% 0.19/0.43 % --non_eq_to_eq false
% 0.19/0.43 % --prep_gs_sim true
% 0.19/0.43 % --prep_unflatten false
% 0.19/0.43 % --prep_res_sim true
% 0.19/0.43 % --prep_upred true
% 0.19/0.43 % --res_sim_input true
% 0.19/0.43 % --clause_weak_htbl true
% 0.19/0.43 % --gc_record_bc_elim false
% 0.19/0.43 % --symbol_type_check false
% 0.19/0.43 % --clausify_out false
% 0.19/0.43 % --large_theory_mode false
% 0.19/0.43 % --prep_sem_filter none
% 0.19/0.43 % --prep_sem_filter_out false
% 0.19/0.43 % --preprocessed_out false
% 0.19/0.43 % --sub_typing false
% 0.19/0.43 % --brand_transform false
% 0.19/0.43 % --pure_diseq_elim true
% 0.19/0.43 % --min_unsat_core false
% 0.19/0.43 % --pred_elim true
% 0.19/0.43 % --add_important_lit false
% 0.19/0.43 % --soft_assumptions false
% 0.19/0.43 % --reset_solvers false
% 0.19/0.43 % --bc_imp_inh []
% 0.19/0.43 % --conj_cone_tolerance 1.5
% 0.19/0.43 % --prolific_symb_bound 500
% 0.19/0.43 % --lt_threshold 2000
% 0.19/0.43
% 0.19/0.43 % ------ SAT Options
% 0.19/0.43
% 0.19/0.43 % --sat_mode false
% 0.19/0.43 % --sat_fm_restart_options ""
% 0.19/0.43 % --sat_gr_def false
% 0.19/0.43 % --sat_epr_types true
% 0.19/0.43 % --sat_non_cyclic_types false
% 0.19/0.43 % --sat_finite_models false
% 0.19/0.43 % --sat_fm_lemmas false
% 0.19/0.43 % --sat_fm_prep false
% 0.19/0.43 % --sat_fm_uc_incr true
% 0.19/0.43 % --sat_out_model small
% 0.19/0.43 % --sat_out_clauses false
% 0.19/0.43
% 0.19/0.43 % ------ QBF Options
% 0.19/0.43
% 0.19/0.43 % --qbf_mode false
% 0.19/0.43 % --qbf_elim_univ true
% 0.19/0.43 % --qbf_sk_in true
% 0.19/0.43 % --qbf_pred_elim true
% 0.19/0.43 % --qbf_split 32
% 0.19/0.43
% 0.19/0.43 % ------ BMC1 Options
% 0.19/0.43
% 0.19/0.43 % --bmc1_incremental false
% 0.19/0.43 % --bmc1_axioms reachable_all
% 0.19/0.43 % --bmc1_min_bound 0
% 0.19/0.43 % --bmc1_max_bound -1
% 0.19/0.43 % --bmc1_max_bound_default -1
% 0.19/0.43 % --bmc1_symbol_reachability true
% 0.19/0.43 % --bmc1_property_lemmas false
% 0.19/0.43 % --bmc1_k_induction false
% 0.19/0.43 % --bmc1_non_equiv_states false
% 0.19/0.43 % --bmc1_deadlock false
% 0.19/0.43 % --bmc1_ucm false
% 0.19/0.43 % --bmc1_add_unsat_core none
% 0.19/0.43 % --bmc1_unsat_core_children false
% 0.19/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.43 % --bmc1_out_stat full
% 0.19/0.43 % --bmc1_ground_init false
% 0.19/0.43 % --bmc1_pre_inst_next_state false
% 0.19/0.43 % --bmc1_pre_inst_state false
% 0.19/0.43 % --bmc1_pre_inst_reach_state false
% 0.19/0.43 % --bmc1_out_unsat_core false
% 0.19/0.43 % --bmc1_aig_witness_out false
% 0.19/0.43 % --bmc1_verbose false
% 0.19/0.43 % --bmc1_dump_clauses_tptp false
% 0.19/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.43 % --bmc1_dump_file -
% 0.19/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.43 % --bmc1_ucm_extend_mode 1
% 0.19/0.43 % --bmc1_ucm_init_mode 2
% 0.19/0.43 % --bmc1_ucm_cone_mode none
% 0.19/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.43 % --bmc1_ucm_relax_model 4
% 0.19/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.43 % --bmc1_ucm_layered_model none
% 0.19/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.43
% 0.19/0.43 % ------ AIG Options
% 0.19/0.43
% 0.19/0.43 % --aig_mode false
% 0.19/0.43
% 0.19/0.43 % ------ Instantiation Options
% 0.19/0.43
% 0.19/0.43 % --instantiation_flag true
% 0.19/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.43 % --inst_solver_per_active 750
% 0.19/0.43 % --inst_solver_calls_frac 0.5
% 0.19/0.43 % --inst_passive_queue_type priority_queues
% 0.19/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.43 % --inst_passive_queues_freq [25;2]
% 0.19/0.43 % --inst_dismatching true
% 0.19/0.43 % --inst_eager_unprocessed_to_passive true
% 1.99/2.18 % --inst_prop_sim_given true
% 1.99/2.18 % --inst_prop_sim_new false
% 1.99/2.18 % --inst_orphan_elimination true
% 1.99/2.18 % --inst_learning_loop_flag true
% 1.99/2.18 % --inst_learning_start 3000
% 1.99/2.18 % --inst_learning_factor 2
% 1.99/2.18 % --inst_start_prop_sim_after_learn 3
% 1.99/2.18 % --inst_sel_renew solver
% 1.99/2.18 % --inst_lit_activity_flag true
% 1.99/2.18 % --inst_out_proof true
% 1.99/2.18
% 1.99/2.18 % ------ Resolution Options
% 1.99/2.18
% 1.99/2.18 % --resolution_flag true
% 1.99/2.18 % --res_lit_sel kbo_max
% 1.99/2.18 % --res_to_prop_solver none
% 1.99/2.18 % --res_prop_simpl_new false
% 1.99/2.18 % --res_prop_simpl_given false
% 1.99/2.18 % --res_passive_queue_type priority_queues
% 1.99/2.18 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.99/2.18 % --res_passive_queues_freq [15;5]
% 1.99/2.18 % --res_forward_subs full
% 1.99/2.18 % --res_backward_subs full
% 1.99/2.18 % --res_forward_subs_resolution true
% 1.99/2.18 % --res_backward_subs_resolution true
% 1.99/2.18 % --res_orphan_elimination false
% 1.99/2.18 % --res_time_limit 1000.
% 1.99/2.18 % --res_out_proof true
% 1.99/2.18 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_f166c9.s
% 1.99/2.18 % --modulo true
% 1.99/2.18
% 1.99/2.18 % ------ Combination Options
% 1.99/2.18
% 1.99/2.18 % --comb_res_mult 1000
% 1.99/2.18 % --comb_inst_mult 300
% 1.99/2.18 % ------
% 1.99/2.18
% 1.99/2.18
% 1.99/2.18
% 1.99/2.18 % ------ Proving...
% 1.99/2.18 %
% 1.99/2.18
% 1.99/2.18
% 1.99/2.18 % ------ Statistics
% 1.99/2.18
% 1.99/2.18 % ------ General
% 1.99/2.18
% 1.99/2.18 % num_of_input_clauses: 61
% 1.99/2.18 % num_of_input_neg_conjectures: 1
% 1.99/2.18 % num_of_splits: 0
% 1.99/2.18 % num_of_split_atoms: 0
% 1.99/2.18 % num_of_sem_filtered_clauses: 0
% 1.99/2.18 % num_of_subtypes: 0
% 1.99/2.18 % monotx_restored_types: 0
% 1.99/2.18 % sat_num_of_epr_types: 0
% 1.99/2.18 % sat_num_of_non_cyclic_types: 0
% 1.99/2.18 % sat_guarded_non_collapsed_types: 0
% 1.99/2.18 % is_epr: 0
% 1.99/2.18 % is_horn: 0
% 1.99/2.18 % has_eq: 1
% 1.99/2.18 % num_pure_diseq_elim: 0
% 1.99/2.18 % simp_replaced_by: 0
% 1.99/2.18 % res_preprocessed: 22
% 1.99/2.18 % prep_upred: 0
% 1.99/2.18 % prep_unflattend: 4
% 1.99/2.18 % pred_elim_cands: 6
% 1.99/2.18 % pred_elim: 4
% 1.99/2.18 % pred_elim_cl: 5
% 1.99/2.18 % pred_elim_cycles: 5
% 1.99/2.18 % forced_gc_time: 0
% 1.99/2.18 % gc_basic_clause_elim: 0
% 1.99/2.18 % parsing_time: 0.002
% 1.99/2.18 % sem_filter_time: 0.
% 1.99/2.18 % pred_elim_time: 0.
% 1.99/2.18 % out_proof_time: 0.
% 1.99/2.18 % monotx_time: 0.
% 1.99/2.18 % subtype_inf_time: 0.
% 1.99/2.18 % unif_index_cands_time: 0.
% 1.99/2.18 % unif_index_add_time: 0.
% 1.99/2.18 % total_time: 1.773
% 1.99/2.18 % num_of_symbols: 47
% 1.99/2.18 % num_of_terms: 1350
% 1.99/2.18
% 1.99/2.18 % ------ Propositional Solver
% 1.99/2.18
% 1.99/2.18 % prop_solver_calls: 5
% 1.99/2.18 % prop_fast_solver_calls: 71
% 1.99/2.18 % prop_num_of_clauses: 376
% 1.99/2.18 % prop_preprocess_simplified: 757
% 1.99/2.18 % prop_fo_subsumed: 0
% 1.99/2.18 % prop_solver_time: 0.
% 1.99/2.18 % prop_fast_solver_time: 0.
% 1.99/2.18 % prop_unsat_core_time: 0.
% 1.99/2.18
% 1.99/2.18 % ------ QBF
% 1.99/2.18
% 1.99/2.18 % qbf_q_res: 0
% 1.99/2.18 % qbf_num_tautologies: 0
% 1.99/2.18 % qbf_prep_cycles: 0
% 1.99/2.18
% 1.99/2.18 % ------ BMC1
% 1.99/2.18
% 1.99/2.18 % bmc1_current_bound: -1
% 1.99/2.18 % bmc1_last_solved_bound: -1
% 1.99/2.18 % bmc1_unsat_core_size: -1
% 1.99/2.18 % bmc1_unsat_core_parents_size: -1
% 1.99/2.18 % bmc1_merge_next_fun: 0
% 1.99/2.18 % bmc1_unsat_core_clauses_time: 0.
% 1.99/2.18
% 1.99/2.18 % ------ Instantiation
% 1.99/2.18
% 1.99/2.18 % inst_num_of_clauses: 285
% 1.99/2.18 % inst_num_in_passive: 92
% 1.99/2.18 % inst_num_in_active: 131
% 1.99/2.18 % inst_num_in_unprocessed: 60
% 1.99/2.18 % inst_num_of_loops: 137
% 1.99/2.18 % inst_num_of_learning_restarts: 0
% 1.99/2.18 % inst_num_moves_active_passive: 4
% 1.99/2.18 % inst_lit_activity: 133
% 1.99/2.18 % inst_lit_activity_moves: 0
% 1.99/2.18 % inst_num_tautologies: 0
% 1.99/2.18 % inst_num_prop_implied: 0
% 1.99/2.18 % inst_num_existing_simplified: 0
% 1.99/2.18 % inst_num_eq_res_simplified: 0
% 1.99/2.18 % inst_num_child_elim: 0
% 1.99/2.18 % inst_num_of_dismatching_blockings: 13
% 1.99/2.18 % inst_num_of_non_proper_insts: 130
% 1.99/2.18 % inst_num_of_duplicates: 31
% 1.99/2.18 % inst_inst_num_from_inst_to_res: 0
% 1.99/2.18 % inst_dismatching_checking_time: 0.
% 1.99/2.18
% 1.99/2.18 % ------ Resolution
% 1.99/2.18
% 1.99/2.18 % res_num_of_clauses: 675
% 1.99/2.18 % res_num_in_passive: 173
% 1.99/2.18 % res_num_in_active: 467
% 1.99/2.18 % res_num_of_loops: 1000
% 1.99/2.18 % res_forward_subset_subsumed: 2248
% 1.99/2.18 % res_backward_subset_subsumed: 0
% 1.99/2.18 % res_forward_subsumed: 488
% 1.99/2.18 % res_backward_subsumed: 0
% 1.99/2.18 % res_forward_subsumption_resolution: 79
% 1.99/2.18 % res_backward_subsumption_resolution: 4
% 1.99/2.18 % res_clause_to_clause_subsumption: 166838
% 1.99/2.18 % res_orphan_elimination: 0
% 1.99/2.18 % res_tautology_del: 276
% 1.99/2.18 % res_num_eq_res_simplified: 0
% 1.99/2.18 % res_num_sel_changes: 0
% 1.99/2.18 % res_moves_from_active_to_pass: 0
% 1.99/2.18
% 1.99/2.18 % Status Unsatisfiable
% 1.99/2.18 % SZS status Theorem
% 1.99/2.18 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------