TSTP Solution File: NUM454+6 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM454+6 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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 09:32:36 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 14
% Syntax : Number of formulae : 82 ( 29 unt; 0 def)
% Number of atoms : 253 ( 93 equ)
% Maximal formula atoms : 44 ( 3 avg)
% Number of connectives : 271 ( 100 ~; 99 |; 56 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 86 ( 3 sgn 47 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( sdtpldt0(sz10,xp) != smndt0(sz10)
| sdtpldt0(sz10,smndt0(xp)) != smndt0(sz10) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mMulMinOne,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtasdt0(smndt0(sz10),X1) = smndt0(X1)
& smndt0(X1) = sdtasdt0(X1,smndt0(sz10)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulMinOne) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddComm) ).
fof(m__2171,hypothesis,
( aInteger0(xp)
& xp != sz00
& aSet0(szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& ! [X1] :
( ( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
=> ( aInteger0(X1)
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(xp,X2) = sdtpldt0(X1,smndt0(sz10)) )
& aDivisorOf0(xp,sdtpldt0(X1,smndt0(sz10)))
& sdteqdtlpzmzozddtrp0(X1,sz10,xp) ) )
& ( ( aInteger0(X1)
& ( ? [X2] :
( aInteger0(X2)
& sdtasdt0(xp,X2) = sdtpldt0(X1,smndt0(sz10)) )
| aDivisorOf0(xp,sdtpldt0(X1,smndt0(sz10)))
| sdteqdtlpzmzozddtrp0(X1,sz10,xp) ) )
=> aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ) )
& aSet0(sbsmnsldt0(xS))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( aInteger0(X1)
& ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) ) ) )
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( aInteger0(X1)
& ~ aElementOf0(X1,sbsmnsldt0(xS)) ) )
& ! [X1] :
( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
=> aElementOf0(X1,stldt0(sbsmnsldt0(xS))) )
& aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,xp),stldt0(sbsmnsldt0(xS))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2171) ).
fof(mIntNeg,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mIntNeg) ).
fof(mMulOne,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtasdt0(X1,sz10) = X1
& X1 = sdtasdt0(sz10,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulOne) ).
fof(mIntOne,axiom,
aInteger0(sz10),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mIntOne) ).
fof(mAddAsso,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3) )
=> sdtpldt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtpldt0(X1,X2),X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddAsso) ).
fof(mAddNeg,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtpldt0(X1,smndt0(X1)) = sz00
& sz00 = sdtpldt0(smndt0(X1),X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddNeg) ).
fof(mAddZero,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddZero) ).
fof(mIntPlus,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mIntPlus) ).
fof(mIntZero,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mIntZero) ).
fof(mDistrib,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3) )
=> ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(sdtpldt0(X1,X2),X3) = sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDistrib) ).
fof(mZeroDiv,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> ( sdtasdt0(X1,X2) = sz00
=> ( X1 = sz00
| X2 = sz00 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mZeroDiv) ).
fof(c_0_14,negated_conjecture,
~ ( sdtpldt0(sz10,xp) != smndt0(sz10)
| sdtpldt0(sz10,smndt0(xp)) != smndt0(sz10) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_15,plain,
! [X2] :
( ( sdtasdt0(smndt0(sz10),X2) = smndt0(X2)
| ~ aInteger0(X2) )
& ( smndt0(X2) = sdtasdt0(X2,smndt0(sz10))
| ~ aInteger0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulMinOne])])]) ).
fof(c_0_16,negated_conjecture,
( sdtpldt0(sz10,xp) = smndt0(sz10)
& sdtpldt0(sz10,smndt0(xp)) = smndt0(sz10) ),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
( smndt0(X1) = sdtasdt0(X1,smndt0(sz10))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
sdtpldt0(sz10,xp) = smndt0(sz10),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X3,X4] :
( ~ aInteger0(X3)
| ~ aInteger0(X4)
| sdtpldt0(X3,X4) = sdtpldt0(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])]) ).
fof(c_0_20,hypothesis,
! [X3,X3,X5,X6,X6,X8,X9,X9,X10] :
( aInteger0(xp)
& xp != sz00
& aSet0(szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& ( aInteger0(X3)
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( aInteger0(esk11_1(X3))
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( sdtasdt0(xp,esk11_1(X3)) = sdtpldt0(X3,smndt0(sz10))
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( aDivisorOf0(xp,sdtpldt0(X3,smndt0(sz10)))
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( sdteqdtlpzmzozddtrp0(X3,sz10,xp)
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( ~ aInteger0(X5)
| sdtasdt0(xp,X5) != sdtpldt0(X3,smndt0(sz10))
| ~ aInteger0(X3)
| aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( ~ aDivisorOf0(xp,sdtpldt0(X3,smndt0(sz10)))
| ~ aInteger0(X3)
| aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( ~ sdteqdtlpzmzozddtrp0(X3,sz10,xp)
| ~ aInteger0(X3)
| aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& aSet0(sbsmnsldt0(xS))
& ( aInteger0(X6)
| ~ aElementOf0(X6,sbsmnsldt0(xS)) )
& ( aElementOf0(esk12_1(X6),xS)
| ~ aElementOf0(X6,sbsmnsldt0(xS)) )
& ( aElementOf0(X6,esk12_1(X6))
| ~ aElementOf0(X6,sbsmnsldt0(xS)) )
& ( ~ aInteger0(X6)
| ~ aElementOf0(X8,xS)
| ~ aElementOf0(X6,X8)
| aElementOf0(X6,sbsmnsldt0(xS)) )
& ( aInteger0(X9)
| ~ aElementOf0(X9,stldt0(sbsmnsldt0(xS))) )
& ( ~ aElementOf0(X9,sbsmnsldt0(xS))
| ~ aElementOf0(X9,stldt0(sbsmnsldt0(xS))) )
& ( ~ aInteger0(X9)
| aElementOf0(X9,sbsmnsldt0(xS))
| aElementOf0(X9,stldt0(sbsmnsldt0(xS))) )
& ( ~ aElementOf0(X10,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| aElementOf0(X10,stldt0(sbsmnsldt0(xS))) )
& aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,xp),stldt0(sbsmnsldt0(xS))) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[m__2171])])])])])])])]) ).
fof(c_0_21,plain,
! [X2] :
( ~ aInteger0(X2)
| aInteger0(smndt0(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])]) ).
fof(c_0_22,plain,
! [X2] :
( ( sdtasdt0(X2,sz10) = X2
| ~ aInteger0(X2) )
& ( X2 = sdtasdt0(sz10,X2)
| ~ aInteger0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulOne])])]) ).
cnf(c_0_23,plain,
( sdtasdt0(X1,sdtpldt0(sz10,xp)) = smndt0(X1)
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
aInteger0(sz10),
inference(split_conjunct,[status(thm)],[mIntOne]) ).
cnf(c_0_26,hypothesis,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
( X1 = sdtasdt0(sz10,X1)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( sdtasdt0(X1,sdtpldt0(xp,sz10)) = smndt0(X1)
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_30,negated_conjecture,
aInteger0(sdtpldt0(sz10,xp)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_18]),c_0_25])]) ).
fof(c_0_31,plain,
! [X4,X5,X6] :
( ~ aInteger0(X4)
| ~ aInteger0(X5)
| ~ aInteger0(X6)
| sdtpldt0(X4,sdtpldt0(X5,X6)) = sdtpldt0(sdtpldt0(X4,X5),X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])]) ).
cnf(c_0_32,plain,
( sdtpldt0(sz10,xp) = sdtpldt0(xp,sz10)
| ~ aInteger0(sdtpldt0(xp,sz10)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_18]),c_0_25])]) ).
cnf(c_0_33,negated_conjecture,
aInteger0(sdtpldt0(xp,sz10)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_24]),c_0_26]),c_0_25])]) ).
cnf(c_0_34,plain,
( sdtpldt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtpldt0(X1,X2),X3)
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,plain,
sdtpldt0(sz10,xp) = sdtpldt0(xp,sz10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_36,plain,
( sdtpldt0(sdtpldt0(xp,sz10),X1) = sdtpldt0(sz10,sdtpldt0(xp,X1))
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_26]),c_0_25])]) ).
fof(c_0_37,plain,
! [X2] :
( ( sdtpldt0(X2,smndt0(X2)) = sz00
| ~ aInteger0(X2) )
& ( sz00 = sdtpldt0(smndt0(X2),X2)
| ~ aInteger0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddNeg])])]) ).
cnf(c_0_38,negated_conjecture,
sdtpldt0(sz10,smndt0(xp)) = smndt0(sz10),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_39,plain,
( sdtpldt0(sz10,sdtpldt0(xp,X1)) = sdtpldt0(xp,sdtpldt0(sz10,X1))
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_36]),c_0_25]),c_0_26])]) ).
cnf(c_0_40,plain,
( sdtpldt0(X1,smndt0(X1)) = sz00
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,negated_conjecture,
sdtpldt0(sz10,smndt0(xp)) = sdtpldt0(sz10,xp),
inference(rw,[status(thm)],[c_0_38,c_0_18]) ).
cnf(c_0_42,plain,
( sz00 = sdtpldt0(smndt0(X1),X1)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_43,plain,
! [X2] :
( ( sdtpldt0(X2,sz00) = X2
| ~ aInteger0(X2) )
& ( X2 = sdtpldt0(sz00,X2)
| ~ aInteger0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])]) ).
cnf(c_0_44,plain,
( sdtpldt0(sz10,sz00) = sdtpldt0(xp,sdtpldt0(xp,sz10))
| ~ aInteger0(smndt0(xp)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_35]),c_0_26])]) ).
cnf(c_0_45,negated_conjecture,
sdtpldt0(sdtpldt0(sz10,xp),sz10) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_18]),c_0_25])]) ).
cnf(c_0_46,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_47,plain,
sdtpldt0(sz10,sz00) = sdtpldt0(xp,sdtpldt0(xp,sz10)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_27]),c_0_26])]) ).
cnf(c_0_48,negated_conjecture,
sdtpldt0(sdtpldt0(xp,sz10),sz10) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_24]),c_0_26]),c_0_25])]) ).
cnf(c_0_49,plain,
sdtpldt0(xp,sdtpldt0(xp,sz10)) = sz10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_25])]) ).
cnf(c_0_50,negated_conjecture,
sdtpldt0(sz10,sdtpldt0(xp,sz10)) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_45]),c_0_25]),c_0_26])]) ).
cnf(c_0_51,negated_conjecture,
sdtpldt0(xp,sdtpldt0(sz10,sz10)) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_48]),c_0_25]),c_0_26])]) ).
cnf(c_0_52,plain,
sdtpldt0(sz10,sz10) = sdtpldt0(xp,sz00),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_49]),c_0_50]),c_0_33])]) ).
cnf(c_0_53,negated_conjecture,
sdtpldt0(xp,sdtpldt0(xp,sz00)) = sz00,
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,negated_conjecture,
sdtpldt0(xp,xp) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_46]),c_0_26])]) ).
cnf(c_0_55,plain,
( X1 = sdtpldt0(sz00,X1)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_56,negated_conjecture,
( sdtpldt0(sz00,X1) = sdtpldt0(xp,sdtpldt0(xp,X1))
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_54]),c_0_26])]) ).
cnf(c_0_57,negated_conjecture,
( sdtpldt0(xp,sdtpldt0(xp,X1)) = X1
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
fof(c_0_58,plain,
! [X3,X4] :
( ~ aInteger0(X3)
| ~ aInteger0(X4)
| aInteger0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntPlus])]) ).
cnf(c_0_59,negated_conjecture,
sdtpldt0(xp,sz00) = xp,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_54]),c_0_26])]) ).
cnf(c_0_60,plain,
( aInteger0(sdtpldt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_61,negated_conjecture,
( smndt0(xp) = xp
| ~ aInteger0(smndt0(xp)) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_40]),c_0_26])]),c_0_59]) ).
cnf(c_0_62,plain,
( sdtpldt0(X1,sdtpldt0(X2,smndt0(sdtpldt0(X1,X2)))) = sz00
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_34]),c_0_27]),c_0_60]) ).
cnf(c_0_63,negated_conjecture,
smndt0(xp) = xp,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_27]),c_0_26])]) ).
cnf(c_0_64,plain,
aInteger0(sz00),
inference(split_conjunct,[status(thm)],[mIntZero]) ).
fof(c_0_65,plain,
! [X4,X5,X6] :
( ( sdtasdt0(X4,sdtpldt0(X5,X6)) = sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
| ~ aInteger0(X4)
| ~ aInteger0(X5)
| ~ aInteger0(X6) )
& ( sdtasdt0(sdtpldt0(X4,X5),X6) = sdtpldt0(sdtasdt0(X4,X6),sdtasdt0(X5,X6))
| ~ aInteger0(X4)
| ~ aInteger0(X5)
| ~ aInteger0(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDistrib])])]) ).
cnf(c_0_66,negated_conjecture,
sdtpldt0(xp,sdtpldt0(sz00,xp)) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_59]),c_0_63]),c_0_64]),c_0_26])]) ).
fof(c_0_67,plain,
! [X3,X4] :
( ~ aInteger0(X3)
| ~ aInteger0(X4)
| sdtasdt0(X3,X4) != sz00
| X3 = sz00
| X4 = sz00 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mZeroDiv])]) ).
cnf(c_0_68,plain,
( sdtasdt0(sdtpldt0(X3,X2),X1) = sdtpldt0(sdtasdt0(X3,X1),sdtasdt0(X2,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_69,plain,
( smndt0(sz00) = sz00
| ~ aInteger0(smndt0(sz00)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_42]),c_0_64])]) ).
cnf(c_0_70,negated_conjecture,
( sdtpldt0(sz00,xp) = xp
| ~ aInteger0(sdtpldt0(sz00,xp)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_66]),c_0_59]) ).
cnf(c_0_71,plain,
( X1 = sz00
| X2 = sz00
| sdtasdt0(X2,X1) != sz00
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_72,plain,
( sdtasdt0(X3,sdtpldt0(X2,X1)) = sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_73,negated_conjecture,
( sdtasdt0(sz00,X1) = sdtpldt0(sdtasdt0(xp,X1),sdtasdt0(xp,X1))
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_54]),c_0_26])]) ).
cnf(c_0_74,plain,
smndt0(sz00) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_27]),c_0_64])]) ).
cnf(c_0_75,plain,
( sdtpldt0(smndt0(X1),sdtpldt0(X1,X2)) = sdtpldt0(sz00,X2)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_42]),c_0_27]) ).
cnf(c_0_76,negated_conjecture,
sdtpldt0(sz00,xp) = xp,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_60]),c_0_26]),c_0_64])]) ).
cnf(c_0_77,plain,
( sdtpldt0(X1,X2) = sz00
| X3 = sz00
| sdtpldt0(sdtasdt0(X3,X1),sdtasdt0(X3,X2)) != sz00
| ~ aInteger0(X3)
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_60]) ).
cnf(c_0_78,negated_conjecture,
sdtpldt0(sdtasdt0(xp,sdtpldt0(xp,sz10)),sdtasdt0(xp,sdtpldt0(xp,sz10))) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_73]),c_0_74]),c_0_64]),c_0_33])]) ).
cnf(c_0_79,plain,
sdtpldt0(sdtpldt0(xp,sz10),sdtpldt0(xp,sz10)) = xp,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_35]),c_0_18]),c_0_35]),c_0_76]),c_0_26]),c_0_25])]) ).
cnf(c_0_80,hypothesis,
xp != sz00,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_81,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]),c_0_26]),c_0_33])]),c_0_80]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM454+6 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 5 09:41:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.026 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 82
% 0.23/1.42 # Proof object clause steps : 55
% 0.23/1.42 # Proof object formula steps : 27
% 0.23/1.42 # Proof object conjectures : 25
% 0.23/1.42 # Proof object clause conjectures : 22
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 19
% 0.23/1.42 # Proof object initial formulas used : 14
% 0.23/1.42 # Proof object generating inferences : 32
% 0.23/1.42 # Proof object simplifying inferences : 88
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 49
% 0.23/1.42 # Removed by relevancy pruning/SinE : 4
% 0.23/1.42 # Initial clauses : 210
% 0.23/1.42 # Removed in clause preprocessing : 5
% 0.23/1.42 # Initial clauses in saturation : 205
% 0.23/1.42 # Processed clauses : 825
% 0.23/1.42 # ...of these trivial : 38
% 0.23/1.42 # ...subsumed : 315
% 0.23/1.42 # ...remaining for further processing : 472
% 0.23/1.42 # Other redundant clauses eliminated : 10
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 4
% 0.23/1.42 # Backward-rewritten : 94
% 0.23/1.42 # Generated clauses : 4837
% 0.23/1.42 # ...of the previous two non-trivial : 3814
% 0.23/1.42 # Contextual simplify-reflections : 68
% 0.23/1.42 # Paramodulations : 4808
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 29
% 0.23/1.42 # Current number of processed clauses : 374
% 0.23/1.42 # Positive orientable unit clauses : 55
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 6
% 0.23/1.42 # Non-unit-clauses : 313
% 0.23/1.42 # Current number of unprocessed clauses: 2750
% 0.23/1.42 # ...number of literals in the above : 11680
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 98
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 16729
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 8340
% 0.23/1.42 # Non-unit clause-clause subsumptions : 347
% 0.23/1.42 # Unit Clause-clause subsumption calls : 412
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 19
% 0.23/1.42 # BW rewrite match successes : 19
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 95333
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.132 s
% 0.23/1.42 # System time : 0.006 s
% 0.23/1.42 # Total time : 0.138 s
% 0.23/1.42 # Maximum resident set size: 6876 pages
%------------------------------------------------------------------------------