TSTP Solution File: NUM474+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM474+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n072.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.625MB
% OS : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan 8 15:21:28 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 12
% Syntax : Number of formulae : 92 ( 22 unt; 0 def)
% Number of atoms : 384 ( 93 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 506 ( 214 ~; 253 |; 31 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 103 ( 0 sgn 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( equal(sdtasdt0(X1,sdtpldt0(X2,X3)),sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)))
& equal(sdtasdt0(sdtpldt0(X2,X3),X1),sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))) ) ),
file('/export/starexec/sandbox2/tmp/tmpIUp9JN/sel_theBenchmark.p_1',mAMDistr) ).
fof(10,axiom,
~ equal(xl,sz00),
file('/export/starexec/sandbox2/tmp/tmpIUp9JN/sel_theBenchmark.p_1',m__1347) ).
fof(12,axiom,
equal(xr,sdtmndt0(xq,xp)),
file('/export/starexec/sandbox2/tmp/tmpIUp9JN/sel_theBenchmark.p_1',m__1422) ).
fof(13,axiom,
sdtlseqdt0(xp,xq),
file('/export/starexec/sandbox2/tmp/tmpIUp9JN/sel_theBenchmark.p_1',m__1395) ).
fof(21,axiom,
equal(xp,sdtsldt0(xm,xl)),
file('/export/starexec/sandbox2/tmp/tmpIUp9JN/sel_theBenchmark.p_1',m__1360) ).
fof(22,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( ~ equal(X1,sz00)
& doDivides0(X1,X2) )
=> ! [X3] :
( equal(X3,sdtsldt0(X2,X1))
<=> ( aNaturalNumber0(X3)
& equal(X2,sdtasdt0(X1,X3)) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpIUp9JN/sel_theBenchmark.p_1',mDefQuot) ).
fof(23,axiom,
( doDivides0(xl,xm)
& doDivides0(xl,sdtpldt0(xm,xn)) ),
file('/export/starexec/sandbox2/tmp/tmpIUp9JN/sel_theBenchmark.p_1',m__1324_04) ).
fof(25,axiom,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/tmp/tmpIUp9JN/sel_theBenchmark.p_1',m__1324) ).
fof(28,axiom,
equal(xq,sdtsldt0(sdtpldt0(xm,xn),xl)),
file('/export/starexec/sandbox2/tmp/tmpIUp9JN/sel_theBenchmark.p_1',m__1379) ).
fof(29,conjecture,
equal(sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)),sdtpldt0(sdtasdt0(xl,xp),xn)),
file('/export/starexec/sandbox2/tmp/tmpIUp9JN/sel_theBenchmark.p_1',m__) ).
fof(33,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
=> ! [X3] :
( equal(X3,sdtmndt0(X2,X1))
<=> ( aNaturalNumber0(X3)
& equal(sdtpldt0(X1,X3),X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpIUp9JN/sel_theBenchmark.p_1',mDefDiff) ).
fof(36,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmpIUp9JN/sel_theBenchmark.p_1',mSortsB) ).
fof(42,negated_conjecture,
~ equal(sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)),sdtpldt0(sdtasdt0(xl,xp),xn)),
inference(assume_negation,[status(cth)],[29]) ).
fof(43,negated_conjecture,
~ equal(sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)),sdtpldt0(sdtasdt0(xl,xp),xn)),
inference(fof_simplification,[status(thm)],[42,theory(equality)]) ).
fof(64,plain,
! [X1,X2,X3] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ( equal(sdtasdt0(X1,sdtpldt0(X2,X3)),sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)))
& equal(sdtasdt0(sdtpldt0(X2,X3),X1),sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(65,plain,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| ( equal(sdtasdt0(X4,sdtpldt0(X5,X6)),sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6)))
& equal(sdtasdt0(sdtpldt0(X5,X6),X4),sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4))) ) ),
inference(variable_rename,[status(thm)],[64]) ).
fof(66,plain,
! [X4,X5,X6] :
( ( equal(sdtasdt0(X4,sdtpldt0(X5,X6)),sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6)))
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6) )
& ( equal(sdtasdt0(sdtpldt0(X5,X6),X4),sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4)))
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6) ) ),
inference(distribute,[status(thm)],[65]) ).
cnf(68,plain,
( sdtasdt0(X3,sdtpldt0(X2,X1)) = sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[66]) ).
cnf(85,plain,
xl != sz00,
inference(split_conjunct,[status(thm)],[10]) ).
cnf(89,plain,
xr = sdtmndt0(xq,xp),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(90,plain,
sdtlseqdt0(xp,xq),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(126,plain,
xp = sdtsldt0(xm,xl),
inference(split_conjunct,[status(thm)],[21]) ).
fof(127,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| equal(X1,sz00)
| ~ doDivides0(X1,X2)
| ! [X3] :
( ( ~ equal(X3,sdtsldt0(X2,X1))
| ( aNaturalNumber0(X3)
& equal(X2,sdtasdt0(X1,X3)) ) )
& ( ~ aNaturalNumber0(X3)
| ~ equal(X2,sdtasdt0(X1,X3))
| equal(X3,sdtsldt0(X2,X1)) ) ) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(128,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| equal(X4,sz00)
| ~ doDivides0(X4,X5)
| ! [X6] :
( ( ~ equal(X6,sdtsldt0(X5,X4))
| ( aNaturalNumber0(X6)
& equal(X5,sdtasdt0(X4,X6)) ) )
& ( ~ aNaturalNumber0(X6)
| ~ equal(X5,sdtasdt0(X4,X6))
| equal(X6,sdtsldt0(X5,X4)) ) ) ),
inference(variable_rename,[status(thm)],[127]) ).
fof(129,plain,
! [X4,X5,X6] :
( ( ( ~ equal(X6,sdtsldt0(X5,X4))
| ( aNaturalNumber0(X6)
& equal(X5,sdtasdt0(X4,X6)) ) )
& ( ~ aNaturalNumber0(X6)
| ~ equal(X5,sdtasdt0(X4,X6))
| equal(X6,sdtsldt0(X5,X4)) ) )
| equal(X4,sz00)
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ),
inference(shift_quantors,[status(thm)],[128]) ).
fof(130,plain,
! [X4,X5,X6] :
( ( aNaturalNumber0(X6)
| ~ equal(X6,sdtsldt0(X5,X4))
| equal(X4,sz00)
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( equal(X5,sdtasdt0(X4,X6))
| ~ equal(X6,sdtsldt0(X5,X4))
| equal(X4,sz00)
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( ~ aNaturalNumber0(X6)
| ~ equal(X5,sdtasdt0(X4,X6))
| equal(X6,sdtsldt0(X5,X4))
| equal(X4,sz00)
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
inference(distribute,[status(thm)],[129]) ).
cnf(132,plain,
( X2 = sz00
| X1 = sdtasdt0(X2,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X3 != sdtsldt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[130]) ).
cnf(133,plain,
( X2 = sz00
| aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X3 != sdtsldt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[130]) ).
cnf(134,plain,
doDivides0(xl,sdtpldt0(xm,xn)),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(135,plain,
doDivides0(xl,xm),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(141,plain,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(142,plain,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(143,plain,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(149,plain,
xq = sdtsldt0(sdtpldt0(xm,xn),xl),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(150,negated_conjecture,
sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) != sdtpldt0(sdtasdt0(xl,xp),xn),
inference(split_conjunct,[status(thm)],[43]) ).
fof(162,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X1,X2)
| ! [X3] :
( ( ~ equal(X3,sdtmndt0(X2,X1))
| ( aNaturalNumber0(X3)
& equal(sdtpldt0(X1,X3),X2) ) )
& ( ~ aNaturalNumber0(X3)
| ~ equal(sdtpldt0(X1,X3),X2)
| equal(X3,sdtmndt0(X2,X1)) ) ) ),
inference(fof_nnf,[status(thm)],[33]) ).
fof(163,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ sdtlseqdt0(X4,X5)
| ! [X6] :
( ( ~ equal(X6,sdtmndt0(X5,X4))
| ( aNaturalNumber0(X6)
& equal(sdtpldt0(X4,X6),X5) ) )
& ( ~ aNaturalNumber0(X6)
| ~ equal(sdtpldt0(X4,X6),X5)
| equal(X6,sdtmndt0(X5,X4)) ) ) ),
inference(variable_rename,[status(thm)],[162]) ).
fof(164,plain,
! [X4,X5,X6] :
( ( ( ~ equal(X6,sdtmndt0(X5,X4))
| ( aNaturalNumber0(X6)
& equal(sdtpldt0(X4,X6),X5) ) )
& ( ~ aNaturalNumber0(X6)
| ~ equal(sdtpldt0(X4,X6),X5)
| equal(X6,sdtmndt0(X5,X4)) ) )
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ),
inference(shift_quantors,[status(thm)],[163]) ).
fof(165,plain,
! [X4,X5,X6] :
( ( aNaturalNumber0(X6)
| ~ equal(X6,sdtmndt0(X5,X4))
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( equal(sdtpldt0(X4,X6),X5)
| ~ equal(X6,sdtmndt0(X5,X4))
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( ~ aNaturalNumber0(X6)
| ~ equal(sdtpldt0(X4,X6),X5)
| equal(X6,sdtmndt0(X5,X4))
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
inference(distribute,[status(thm)],[164]) ).
cnf(167,plain,
( sdtpldt0(X2,X3) = X1
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X1)
| X3 != sdtmndt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[165]) ).
cnf(168,plain,
( aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X1)
| X3 != sdtmndt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[165]) ).
fof(173,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[36]) ).
fof(174,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[173]) ).
cnf(175,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[174]) ).
cnf(472,plain,
( sdtpldt0(xp,X1) = xq
| xr != X1
| ~ sdtlseqdt0(xp,xq)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xq) ),
inference(spm,[status(thm)],[167,89,theory(equality)]) ).
cnf(473,plain,
( sdtpldt0(xp,X1) = xq
| xr != X1
| $false
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xq) ),
inference(rw,[status(thm)],[472,90,theory(equality)]) ).
cnf(474,plain,
( sdtpldt0(xp,X1) = xq
| xr != X1
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xq) ),
inference(cn,[status(thm)],[473,theory(equality)]) ).
cnf(476,plain,
( aNaturalNumber0(X1)
| xr != X1
| ~ sdtlseqdt0(xp,xq)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xq) ),
inference(spm,[status(thm)],[168,89,theory(equality)]) ).
cnf(477,plain,
( aNaturalNumber0(X1)
| xr != X1
| $false
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xq) ),
inference(rw,[status(thm)],[476,90,theory(equality)]) ).
cnf(478,plain,
( aNaturalNumber0(X1)
| xr != X1
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xq) ),
inference(cn,[status(thm)],[477,theory(equality)]) ).
cnf(508,negated_conjecture,
( sdtasdt0(xl,sdtpldt0(xp,xr)) != sdtpldt0(sdtasdt0(xl,xp),xn)
| ~ aNaturalNumber0(xl)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xr) ),
inference(spm,[status(thm)],[150,68,theory(equality)]) ).
cnf(536,negated_conjecture,
( sdtasdt0(xl,sdtpldt0(xp,xr)) != sdtpldt0(sdtasdt0(xl,xp),xn)
| $false
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xr) ),
inference(rw,[status(thm)],[508,143,theory(equality)]) ).
cnf(537,negated_conjecture,
( sdtasdt0(xl,sdtpldt0(xp,xr)) != sdtpldt0(sdtasdt0(xl,xp),xn)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xr) ),
inference(cn,[status(thm)],[536,theory(equality)]) ).
cnf(599,plain,
( sdtasdt0(xl,X1) = xm
| sz00 = xl
| xp != X1
| ~ doDivides0(xl,xm)
| ~ aNaturalNumber0(xl)
| ~ aNaturalNumber0(xm) ),
inference(spm,[status(thm)],[132,126,theory(equality)]) ).
cnf(600,plain,
( sdtasdt0(xl,X1) = sdtpldt0(xm,xn)
| sz00 = xl
| xq != X1
| ~ doDivides0(xl,sdtpldt0(xm,xn))
| ~ aNaturalNumber0(xl)
| ~ aNaturalNumber0(sdtpldt0(xm,xn)) ),
inference(spm,[status(thm)],[132,149,theory(equality)]) ).
cnf(601,plain,
( sdtasdt0(xl,X1) = xm
| sz00 = xl
| xp != X1
| $false
| ~ aNaturalNumber0(xl)
| ~ aNaturalNumber0(xm) ),
inference(rw,[status(thm)],[599,135,theory(equality)]) ).
cnf(602,plain,
( sdtasdt0(xl,X1) = xm
| sz00 = xl
| xp != X1
| $false
| $false
| ~ aNaturalNumber0(xm) ),
inference(rw,[status(thm)],[601,143,theory(equality)]) ).
cnf(603,plain,
( sdtasdt0(xl,X1) = xm
| sz00 = xl
| xp != X1
| $false
| $false
| $false ),
inference(rw,[status(thm)],[602,142,theory(equality)]) ).
cnf(604,plain,
( sdtasdt0(xl,X1) = xm
| sz00 = xl
| xp != X1 ),
inference(cn,[status(thm)],[603,theory(equality)]) ).
cnf(605,plain,
( sdtasdt0(xl,X1) = xm
| xp != X1 ),
inference(sr,[status(thm)],[604,85,theory(equality)]) ).
cnf(606,plain,
( sdtasdt0(xl,X1) = sdtpldt0(xm,xn)
| sz00 = xl
| xq != X1
| $false
| ~ aNaturalNumber0(xl)
| ~ aNaturalNumber0(sdtpldt0(xm,xn)) ),
inference(rw,[status(thm)],[600,134,theory(equality)]) ).
cnf(607,plain,
( sdtasdt0(xl,X1) = sdtpldt0(xm,xn)
| sz00 = xl
| xq != X1
| $false
| $false
| ~ aNaturalNumber0(sdtpldt0(xm,xn)) ),
inference(rw,[status(thm)],[606,143,theory(equality)]) ).
cnf(608,plain,
( sdtasdt0(xl,X1) = sdtpldt0(xm,xn)
| sz00 = xl
| xq != X1
| ~ aNaturalNumber0(sdtpldt0(xm,xn)) ),
inference(cn,[status(thm)],[607,theory(equality)]) ).
cnf(609,plain,
( sdtasdt0(xl,X1) = sdtpldt0(xm,xn)
| xq != X1
| ~ aNaturalNumber0(sdtpldt0(xm,xn)) ),
inference(sr,[status(thm)],[608,85,theory(equality)]) ).
cnf(611,plain,
( sz00 = xl
| aNaturalNumber0(X1)
| xp != X1
| ~ doDivides0(xl,xm)
| ~ aNaturalNumber0(xl)
| ~ aNaturalNumber0(xm) ),
inference(spm,[status(thm)],[133,126,theory(equality)]) ).
cnf(612,plain,
( sz00 = xl
| aNaturalNumber0(X1)
| xq != X1
| ~ doDivides0(xl,sdtpldt0(xm,xn))
| ~ aNaturalNumber0(xl)
| ~ aNaturalNumber0(sdtpldt0(xm,xn)) ),
inference(spm,[status(thm)],[133,149,theory(equality)]) ).
cnf(613,plain,
( sz00 = xl
| aNaturalNumber0(X1)
| xp != X1
| $false
| ~ aNaturalNumber0(xl)
| ~ aNaturalNumber0(xm) ),
inference(rw,[status(thm)],[611,135,theory(equality)]) ).
cnf(614,plain,
( sz00 = xl
| aNaturalNumber0(X1)
| xp != X1
| $false
| $false
| ~ aNaturalNumber0(xm) ),
inference(rw,[status(thm)],[613,143,theory(equality)]) ).
cnf(615,plain,
( sz00 = xl
| aNaturalNumber0(X1)
| xp != X1
| $false
| $false
| $false ),
inference(rw,[status(thm)],[614,142,theory(equality)]) ).
cnf(616,plain,
( sz00 = xl
| aNaturalNumber0(X1)
| xp != X1 ),
inference(cn,[status(thm)],[615,theory(equality)]) ).
cnf(617,plain,
( aNaturalNumber0(X1)
| xp != X1 ),
inference(sr,[status(thm)],[616,85,theory(equality)]) ).
cnf(618,plain,
( sz00 = xl
| aNaturalNumber0(X1)
| xq != X1
| $false
| ~ aNaturalNumber0(xl)
| ~ aNaturalNumber0(sdtpldt0(xm,xn)) ),
inference(rw,[status(thm)],[612,134,theory(equality)]) ).
cnf(619,plain,
( sz00 = xl
| aNaturalNumber0(X1)
| xq != X1
| $false
| $false
| ~ aNaturalNumber0(sdtpldt0(xm,xn)) ),
inference(rw,[status(thm)],[618,143,theory(equality)]) ).
cnf(620,plain,
( sz00 = xl
| aNaturalNumber0(X1)
| xq != X1
| ~ aNaturalNumber0(sdtpldt0(xm,xn)) ),
inference(cn,[status(thm)],[619,theory(equality)]) ).
cnf(621,plain,
( aNaturalNumber0(X1)
| xq != X1
| ~ aNaturalNumber0(sdtpldt0(xm,xn)) ),
inference(sr,[status(thm)],[620,85,theory(equality)]) ).
cnf(1421,plain,
( aNaturalNumber0(X1)
| xq != X1
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xm) ),
inference(spm,[status(thm)],[621,175,theory(equality)]) ).
cnf(1423,plain,
( aNaturalNumber0(X1)
| xq != X1
| $false
| ~ aNaturalNumber0(xm) ),
inference(rw,[status(thm)],[1421,141,theory(equality)]) ).
cnf(1424,plain,
( aNaturalNumber0(X1)
| xq != X1
| $false
| $false ),
inference(rw,[status(thm)],[1423,142,theory(equality)]) ).
cnf(1425,plain,
( aNaturalNumber0(X1)
| xq != X1 ),
inference(cn,[status(thm)],[1424,theory(equality)]) ).
cnf(1689,plain,
( aNaturalNumber0(X1)
| xr != X1
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[478,1425,theory(equality)]) ).
cnf(1690,plain,
( aNaturalNumber0(X1)
| xr != X1 ),
inference(spm,[status(thm)],[1689,617,theory(equality)]) ).
cnf(1807,plain,
( sdtpldt0(xm,xn) != sdtasdt0(xl,sdtpldt0(xp,xr))
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xr) ),
inference(spm,[status(thm)],[537,605,theory(equality)]) ).
cnf(1897,plain,
( sdtasdt0(xl,X1) = sdtpldt0(xm,xn)
| xq != X1
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xm) ),
inference(spm,[status(thm)],[609,175,theory(equality)]) ).
cnf(1901,plain,
( sdtasdt0(xl,X1) = sdtpldt0(xm,xn)
| xq != X1
| $false
| ~ aNaturalNumber0(xm) ),
inference(rw,[status(thm)],[1897,141,theory(equality)]) ).
cnf(1902,plain,
( sdtasdt0(xl,X1) = sdtpldt0(xm,xn)
| xq != X1
| $false
| $false ),
inference(rw,[status(thm)],[1901,142,theory(equality)]) ).
cnf(1903,plain,
( sdtasdt0(xl,X1) = sdtpldt0(xm,xn)
| xq != X1 ),
inference(cn,[status(thm)],[1902,theory(equality)]) ).
cnf(1949,plain,
( ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xr)
| xq != sdtpldt0(xp,xr) ),
inference(spm,[status(thm)],[1807,1903,theory(equality)]) ).
cnf(2569,plain,
( ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xr)
| ~ aNaturalNumber0(xq) ),
inference(spm,[status(thm)],[1949,474,theory(equality)]) ).
cnf(2685,plain,
( ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xq) ),
inference(spm,[status(thm)],[2569,1690,theory(equality)]) ).
cnf(2694,plain,
~ aNaturalNumber0(xp),
inference(spm,[status(thm)],[2685,1425,theory(equality)]) ).
cnf(2696,plain,
$false,
inference(spm,[status(thm)],[2694,617,theory(equality)]) ).
cnf(2700,plain,
$false,
2696,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM474+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.24 % Computer : n072.star.cs.uiowa.edu
% 0.03/0.24 % Model : x86_64 x86_64
% 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.24 % Memory : 32218.625MB
% 0.03/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.24 % CPULimit : 300
% 0.03/0.24 % DateTime : Fri Jan 5 05:03:45 CST 2018
% 0.03/0.24 % CPUTime :
% 0.03/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.28 --creating new selector for []
% 0.07/0.41 -running prover on /export/starexec/sandbox2/tmp/tmpIUp9JN/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.41 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpIUp9JN/sel_theBenchmark.p_1']
% 0.07/0.41 -prover status Theorem
% 0.07/0.41 Problem theBenchmark.p solved in phase 0.
% 0.07/0.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.41 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.41 Solved 1 out of 1.
% 0.07/0.41 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.41 # SZS status Theorem
% 0.07/0.41 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.41 # SZS output end CNFRefutation
%------------------------------------------------------------------------------