%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM433+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n067.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:19 EST 2018
% Result : Theorem 0.43s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 47
% Number of leaves : 12
% Syntax : Number of formulae : 114 ( 15 unt; 0 def)
% Number of atoms : 512 ( 39 equ)
% Maximal formula atoms : 29 ( 4 avg)
% Number of connectives : 684 ( 286 ~; 278 |; 105 &)
% ( 4 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 138 ( 0 sgn 80 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp3du6Qm/sel_theBenchmark.p_1',mIntPlus) ).
fof(6,axiom,
! [X1] :
( aInteger0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( aInteger0(X2)
& ~ equal(X2,sz00)
& ? [X3] :
( aInteger0(X3)
& equal(sdtasdt0(X2,X3),X1) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp3du6Qm/sel_theBenchmark.p_1',mDivisor) ).
fof(7,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3)
& ~ equal(X3,sz00) )
=> ( sdteqdtlpzmzozddtrp0(X1,X2,X3)
=> sdteqdtlpzmzozddtrp0(X2,X1,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp3du6Qm/sel_theBenchmark.p_1',mEquModSym) ).
fof(11,axiom,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xp)
& ~ equal(xp,sz00)
& aInteger0(xq)
& ~ equal(xq,sz00) ),
file('/export/starexec/sandbox/tmp/tmp3du6Qm/sel_theBenchmark.p_1',m__979) ).
fof(13,conjecture,
( ( ~ equal(sdtasdt0(xp,xq),sz00)
& ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(sdtasdt0(xp,xq),X1),sdtpldt0(xa,smndt0(xb))) )
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) )
=> ( ( ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(xp,X1),sdtpldt0(xa,smndt0(xb))) )
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(xq,X1),sdtpldt0(xa,smndt0(xb))) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ) ),
file('/export/starexec/sandbox/tmp/tmp3du6Qm/sel_theBenchmark.p_1',m__) ).
fof(14,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3) )
=> equal(sdtasdt0(X1,sdtasdt0(X2,X3)),sdtasdt0(sdtasdt0(X1,X2),X3)) ),
file('/export/starexec/sandbox/tmp/tmp3du6Qm/sel_theBenchmark.p_1',mMulAsso) ).
fof(16,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp3du6Qm/sel_theBenchmark.p_1',mIntMult) ).
fof(18,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox/tmp/tmp3du6Qm/sel_theBenchmark.p_1',mIntNeg) ).
fof(21,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> equal(sdtasdt0(X1,X2),sdtasdt0(X2,X1)) ),
file('/export/starexec/sandbox/tmp/tmp3du6Qm/sel_theBenchmark.p_1',mMulComm) ).
fof(22,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3)
& ~ equal(X3,sz00) )
=> ( sdteqdtlpzmzozddtrp0(X1,X2,X3)
<=> aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))) ) ),
file('/export/starexec/sandbox/tmp/tmp3du6Qm/sel_theBenchmark.p_1',mEquMod) ).
fof(25,negated_conjecture,
~ ( ( ~ equal(sdtasdt0(xp,xq),sz00)
& ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(sdtasdt0(xp,xq),X1),sdtpldt0(xa,smndt0(xb))) )
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) )
=> ( ( ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(xp,X1),sdtpldt0(xa,smndt0(xb))) )
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(xq,X1),sdtpldt0(xa,smndt0(xb))) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ) ),
inference(assume_negation,[status(cth)],[13]) ).
fof(44,plain,
! [X1,X2] :
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| aInteger0(sdtpldt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(45,plain,
! [X3,X4] :
( ~ aInteger0(X3)
| ~ aInteger0(X4)
| aInteger0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[44]) ).
cnf(46,plain,
( aInteger0(sdtpldt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[45]) ).
fof(47,plain,
! [X1] :
( ~ aInteger0(X1)
| ! [X2] :
( ( ~ aDivisorOf0(X2,X1)
| ( aInteger0(X2)
& ~ equal(X2,sz00)
& ? [X3] :
( aInteger0(X3)
& equal(sdtasdt0(X2,X3),X1) ) ) )
& ( ~ aInteger0(X2)
| equal(X2,sz00)
| ! [X3] :
( ~ aInteger0(X3)
| ~ equal(sdtasdt0(X2,X3),X1) )
| aDivisorOf0(X2,X1) ) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(48,plain,
! [X4] :
( ~ aInteger0(X4)
| ! [X5] :
( ( ~ aDivisorOf0(X5,X4)
| ( aInteger0(X5)
& ~ equal(X5,sz00)
& ? [X6] :
( aInteger0(X6)
& equal(sdtasdt0(X5,X6),X4) ) ) )
& ( ~ aInteger0(X5)
| equal(X5,sz00)
| ! [X7] :
( ~ aInteger0(X7)
| ~ equal(sdtasdt0(X5,X7),X4) )
| aDivisorOf0(X5,X4) ) ) ),
inference(variable_rename,[status(thm)],[47]) ).
fof(49,plain,
! [X4] :
( ~ aInteger0(X4)
| ! [X5] :
( ( ~ aDivisorOf0(X5,X4)
| ( aInteger0(X5)
& ~ equal(X5,sz00)
& aInteger0(esk1_2(X4,X5))
& equal(sdtasdt0(X5,esk1_2(X4,X5)),X4) ) )
& ( ~ aInteger0(X5)
| equal(X5,sz00)
| ! [X7] :
( ~ aInteger0(X7)
| ~ equal(sdtasdt0(X5,X7),X4) )
| aDivisorOf0(X5,X4) ) ) ),
inference(skolemize,[status(esa)],[48]) ).
fof(50,plain,
! [X4,X5,X7] :
( ( ( ~ aInteger0(X7)
| ~ equal(sdtasdt0(X5,X7),X4)
| ~ aInteger0(X5)
| equal(X5,sz00)
| aDivisorOf0(X5,X4) )
& ( ~ aDivisorOf0(X5,X4)
| ( aInteger0(X5)
& ~ equal(X5,sz00)
& aInteger0(esk1_2(X4,X5))
& equal(sdtasdt0(X5,esk1_2(X4,X5)),X4) ) ) )
| ~ aInteger0(X4) ),
inference(shift_quantors,[status(thm)],[49]) ).
fof(51,plain,
! [X4,X5,X7] :
( ( ~ aInteger0(X7)
| ~ equal(sdtasdt0(X5,X7),X4)
| ~ aInteger0(X5)
| equal(X5,sz00)
| aDivisorOf0(X5,X4)
| ~ aInteger0(X4) )
& ( aInteger0(X5)
| ~ aDivisorOf0(X5,X4)
| ~ aInteger0(X4) )
& ( ~ equal(X5,sz00)
| ~ aDivisorOf0(X5,X4)
| ~ aInteger0(X4) )
& ( aInteger0(esk1_2(X4,X5))
| ~ aDivisorOf0(X5,X4)
| ~ aInteger0(X4) )
& ( equal(sdtasdt0(X5,esk1_2(X4,X5)),X4)
| ~ aDivisorOf0(X5,X4)
| ~ aInteger0(X4) ) ),
inference(distribute,[status(thm)],[50]) ).
cnf(55,plain,
( aInteger0(X2)
| ~ aInteger0(X1)
| ~ aDivisorOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[51]) ).
fof(57,plain,
! [X1,X2,X3] :
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| equal(X3,sz00)
| ~ sdteqdtlpzmzozddtrp0(X1,X2,X3)
| sdteqdtlpzmzozddtrp0(X2,X1,X3) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(58,plain,
! [X4,X5,X6] :
( ~ aInteger0(X4)
| ~ aInteger0(X5)
| ~ aInteger0(X6)
| equal(X6,sz00)
| ~ sdteqdtlpzmzozddtrp0(X4,X5,X6)
| sdteqdtlpzmzozddtrp0(X5,X4,X6) ),
inference(variable_rename,[status(thm)],[57]) ).
cnf(59,plain,
( sdteqdtlpzmzozddtrp0(X1,X2,X3)
| X3 = sz00
| ~ sdteqdtlpzmzozddtrp0(X2,X1,X3)
| ~ aInteger0(X3)
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[58]) ).
cnf(68,plain,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[11]) ).
cnf(70,plain,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[11]) ).
cnf(71,plain,
aInteger0(xb),
inference(split_conjunct,[status(thm)],[11]) ).
cnf(72,plain,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[11]) ).
fof(78,negated_conjecture,
( ~ equal(sdtasdt0(xp,xq),sz00)
& ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(sdtasdt0(xp,xq),X1),sdtpldt0(xa,smndt0(xb))) )
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& ( ( ! [X1] :
( ~ aInteger0(X1)
| ~ equal(sdtasdt0(xp,X1),sdtpldt0(xa,smndt0(xb))) )
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) )
| ( ! [X1] :
( ~ aInteger0(X1)
| ~ equal(sdtasdt0(xq,X1),sdtpldt0(xa,smndt0(xb))) )
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ) ),
inference(fof_nnf,[status(thm)],[25]) ).
fof(79,negated_conjecture,
( ~ equal(sdtasdt0(xp,xq),sz00)
& ? [X2] :
( aInteger0(X2)
& equal(sdtasdt0(sdtasdt0(xp,xq),X2),sdtpldt0(xa,smndt0(xb))) )
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& ( ( ! [X3] :
( ~ aInteger0(X3)
| ~ equal(sdtasdt0(xp,X3),sdtpldt0(xa,smndt0(xb))) )
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) )
| ( ! [X4] :
( ~ aInteger0(X4)
| ~ equal(sdtasdt0(xq,X4),sdtpldt0(xa,smndt0(xb))) )
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ) ),
inference(variable_rename,[status(thm)],[78]) ).
fof(80,negated_conjecture,
( ~ equal(sdtasdt0(xp,xq),sz00)
& aInteger0(esk2_0)
& equal(sdtasdt0(sdtasdt0(xp,xq),esk2_0),sdtpldt0(xa,smndt0(xb)))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& ( ( ! [X3] :
( ~ aInteger0(X3)
| ~ equal(sdtasdt0(xp,X3),sdtpldt0(xa,smndt0(xb))) )
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) )
| ( ! [X4] :
( ~ aInteger0(X4)
| ~ equal(sdtasdt0(xq,X4),sdtpldt0(xa,smndt0(xb))) )
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ) ),
inference(skolemize,[status(esa)],[79]) ).
fof(81,negated_conjecture,
! [X3,X4] :
( ( ( ( ~ aInteger0(X4)
| ~ equal(sdtasdt0(xq,X4),sdtpldt0(xa,smndt0(xb))) )
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) )
| ( ( ~ aInteger0(X3)
| ~ equal(sdtasdt0(xp,X3),sdtpldt0(xa,smndt0(xb))) )
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) ) )
& ~ equal(sdtasdt0(xp,xq),sz00)
& aInteger0(esk2_0)
& equal(sdtasdt0(sdtasdt0(xp,xq),esk2_0),sdtpldt0(xa,smndt0(xb)))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) ),
inference(shift_quantors,[status(thm)],[80]) ).
fof(82,negated_conjecture,
! [X3,X4] :
( ( ~ aInteger0(X3)
| ~ equal(sdtasdt0(xp,X3),sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(X4)
| ~ equal(sdtasdt0(xq,X4),sdtpldt0(xa,smndt0(xb))) )
& ( ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(X4)
| ~ equal(sdtasdt0(xq,X4),sdtpldt0(xa,smndt0(xb))) )
& ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ aInteger0(X4)
| ~ equal(sdtasdt0(xq,X4),sdtpldt0(xa,smndt0(xb))) )
& ( ~ aInteger0(X3)
| ~ equal(sdtasdt0(xp,X3),sdtpldt0(xa,smndt0(xb)))
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) )
& ( ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) )
& ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) )
& ( ~ aInteger0(X3)
| ~ equal(sdtasdt0(xp,X3),sdtpldt0(xa,smndt0(xb)))
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) )
& ( ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) )
& ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) )
& ~ equal(sdtasdt0(xp,xq),sz00)
& aInteger0(esk2_0)
& equal(sdtasdt0(sdtasdt0(xp,xq),esk2_0),sdtpldt0(xa,smndt0(xb)))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) ),
inference(distribute,[status(thm)],[81]) ).
cnf(83,negated_conjecture,
sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)),
inference(split_conjunct,[status(thm)],[82]) ).
cnf(85,negated_conjecture,
sdtasdt0(sdtasdt0(xp,xq),esk2_0) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[82]) ).
cnf(86,negated_conjecture,
aInteger0(esk2_0),
inference(split_conjunct,[status(thm)],[82]) ).
cnf(87,negated_conjecture,
sdtasdt0(xp,xq) != sz00,
inference(split_conjunct,[status(thm)],[82]) ).
cnf(96,negated_conjecture,
( sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X1)
| sdtasdt0(xp,X2) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[82]) ).
fof(97,plain,
! [X1,X2,X3] :
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| equal(sdtasdt0(X1,sdtasdt0(X2,X3)),sdtasdt0(sdtasdt0(X1,X2),X3)) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(98,plain,
! [X4,X5,X6] :
( ~ aInteger0(X4)
| ~ aInteger0(X5)
| ~ aInteger0(X6)
| equal(sdtasdt0(X4,sdtasdt0(X5,X6)),sdtasdt0(sdtasdt0(X4,X5),X6)) ),
inference(variable_rename,[status(thm)],[97]) ).
cnf(99,plain,
( sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(sdtasdt0(X1,X2),X3)
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[98]) ).
fof(103,plain,
! [X1,X2] :
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| aInteger0(sdtasdt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(104,plain,
! [X3,X4] :
( ~ aInteger0(X3)
| ~ aInteger0(X4)
| aInteger0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[103]) ).
cnf(105,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[104]) ).
fof(109,plain,
! [X1] :
( ~ aInteger0(X1)
| aInteger0(smndt0(X1)) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(110,plain,
! [X2] :
( ~ aInteger0(X2)
| aInteger0(smndt0(X2)) ),
inference(variable_rename,[status(thm)],[109]) ).
cnf(111,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[110]) ).
fof(118,plain,
! [X1,X2] :
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| equal(sdtasdt0(X1,X2),sdtasdt0(X2,X1)) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(119,plain,
! [X3,X4] :
( ~ aInteger0(X3)
| ~ aInteger0(X4)
| equal(sdtasdt0(X3,X4),sdtasdt0(X4,X3)) ),
inference(variable_rename,[status(thm)],[118]) ).
cnf(120,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[119]) ).
fof(121,plain,
! [X1,X2,X3] :
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| equal(X3,sz00)
| ( ( ~ sdteqdtlpzmzozddtrp0(X1,X2,X3)
| aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))) )
& ( ~ aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2)))
| sdteqdtlpzmzozddtrp0(X1,X2,X3) ) ) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(122,plain,
! [X4,X5,X6] :
( ~ aInteger0(X4)
| ~ aInteger0(X5)
| ~ aInteger0(X6)
| equal(X6,sz00)
| ( ( ~ sdteqdtlpzmzozddtrp0(X4,X5,X6)
| aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5))) )
& ( ~ aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5)))
| sdteqdtlpzmzozddtrp0(X4,X5,X6) ) ) ),
inference(variable_rename,[status(thm)],[121]) ).
fof(123,plain,
! [X4,X5,X6] :
( ( ~ sdteqdtlpzmzozddtrp0(X4,X5,X6)
| aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5)))
| ~ aInteger0(X4)
| ~ aInteger0(X5)
| ~ aInteger0(X6)
| equal(X6,sz00) )
& ( ~ aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5)))
| sdteqdtlpzmzozddtrp0(X4,X5,X6)
| ~ aInteger0(X4)
| ~ aInteger0(X5)
| ~ aInteger0(X6)
| equal(X6,sz00) ) ),
inference(distribute,[status(thm)],[122]) ).
cnf(125,plain,
( X1 = sz00
| aDivisorOf0(X1,sdtpldt0(X3,smndt0(X2)))
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| ~ sdteqdtlpzmzozddtrp0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[123]) ).
cnf(261,negated_conjecture,
( sz00 = sdtasdt0(xp,xq)
| sdteqdtlpzmzozddtrp0(xb,xa,sdtasdt0(xp,xq))
| ~ aInteger0(sdtasdt0(xp,xq))
| ~ aInteger0(xa)
| ~ aInteger0(xb) ),
inference(spm,[status(thm)],[59,83,theory(equality)]) ).
cnf(263,negated_conjecture,
( sz00 = sdtasdt0(xp,xq)
| sdteqdtlpzmzozddtrp0(xb,xa,sdtasdt0(xp,xq))
| ~ aInteger0(sdtasdt0(xp,xq))
| $false
| ~ aInteger0(xb) ),
inference(rw,[status(thm)],[261,72,theory(equality)]) ).
cnf(264,negated_conjecture,
( sz00 = sdtasdt0(xp,xq)
| sdteqdtlpzmzozddtrp0(xb,xa,sdtasdt0(xp,xq))
| ~ aInteger0(sdtasdt0(xp,xq))
| $false
| $false ),
inference(rw,[status(thm)],[263,71,theory(equality)]) ).
cnf(265,negated_conjecture,
( sz00 = sdtasdt0(xp,xq)
| sdteqdtlpzmzozddtrp0(xb,xa,sdtasdt0(xp,xq))
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(cn,[status(thm)],[264,theory(equality)]) ).
cnf(266,negated_conjecture,
( sdteqdtlpzmzozddtrp0(xb,xa,sdtasdt0(xp,xq))
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(sr,[status(thm)],[265,87,theory(equality)]) ).
cnf(325,negated_conjecture,
( sdtasdt0(sdtasdt0(xp,xq),esk2_0) != sdtasdt0(xp,X2)
| sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X1)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[96,85,theory(equality)]) ).
cnf(326,negated_conjecture,
( sdtasdt0(sdtasdt0(xp,xq),esk2_0) != sdtasdt0(xp,X2)
| sdtasdt0(sdtasdt0(xp,xq),esk2_0) != sdtasdt0(xq,X1)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[325,85,theory(equality)]) ).
fof(327,plain,
( ~ epred1_0
<=> ! [X2] :
( ~ aInteger0(X2)
| ~ equal(sdtasdt0(sdtasdt0(xp,xq),esk2_0),sdtasdt0(xp,X2)) ) ),
introduced(definition),
[split] ).
cnf(328,plain,
( epred1_0
| ~ aInteger0(X2)
| sdtasdt0(sdtasdt0(xp,xq),esk2_0) != sdtasdt0(xp,X2) ),
inference(split_equiv,[status(thm)],[327]) ).
fof(329,plain,
( ~ epred2_0
<=> ! [X1] :
( ~ aInteger0(X1)
| ~ equal(sdtasdt0(sdtasdt0(xp,xq),esk2_0),sdtasdt0(xq,X1)) ) ),
introduced(definition),
[split] ).
cnf(330,plain,
( epred2_0
| ~ aInteger0(X1)
| sdtasdt0(sdtasdt0(xp,xq),esk2_0) != sdtasdt0(xq,X1) ),
inference(split_equiv,[status(thm)],[329]) ).
cnf(331,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[326,327,theory(equality)]),329,theory(equality)]),
[split] ).
cnf(474,negated_conjecture,
( sdteqdtlpzmzozddtrp0(xb,xa,sdtasdt0(xp,xq))
| ~ aInteger0(xq)
| ~ aInteger0(xp) ),
inference(spm,[status(thm)],[266,105,theory(equality)]) ).
cnf(475,negated_conjecture,
( sdteqdtlpzmzozddtrp0(xb,xa,sdtasdt0(xp,xq))
| $false
| ~ aInteger0(xp) ),
inference(rw,[status(thm)],[474,68,theory(equality)]) ).
cnf(476,negated_conjecture,
( sdteqdtlpzmzozddtrp0(xb,xa,sdtasdt0(xp,xq))
| $false
| $false ),
inference(rw,[status(thm)],[475,70,theory(equality)]) ).
cnf(477,negated_conjecture,
sdteqdtlpzmzozddtrp0(xb,xa,sdtasdt0(xp,xq)),
inference(cn,[status(thm)],[476,theory(equality)]) ).
cnf(479,negated_conjecture,
( sz00 = sdtasdt0(xp,xq)
| aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xb,smndt0(xa)))
| ~ aInteger0(xb)
| ~ aInteger0(xa)
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(spm,[status(thm)],[125,477,theory(equality)]) ).
cnf(486,negated_conjecture,
( sz00 = sdtasdt0(xp,xq)
| aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xb,smndt0(xa)))
| $false
| ~ aInteger0(xa)
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(rw,[status(thm)],[479,71,theory(equality)]) ).
cnf(487,negated_conjecture,
( sz00 = sdtasdt0(xp,xq)
| aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xb,smndt0(xa)))
| $false
| $false
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(rw,[status(thm)],[486,72,theory(equality)]) ).
cnf(488,negated_conjecture,
( sz00 = sdtasdt0(xp,xq)
| aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xb,smndt0(xa)))
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(cn,[status(thm)],[487,theory(equality)]) ).
cnf(489,negated_conjecture,
( aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xb,smndt0(xa)))
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(sr,[status(thm)],[488,87,theory(equality)]) ).
cnf(494,negated_conjecture,
( aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xb,smndt0(xa)))
| ~ aInteger0(xq)
| ~ aInteger0(xp) ),
inference(spm,[status(thm)],[489,105,theory(equality)]) ).
cnf(495,negated_conjecture,
( aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xb,smndt0(xa)))
| $false
| ~ aInteger0(xp) ),
inference(rw,[status(thm)],[494,68,theory(equality)]) ).
cnf(496,negated_conjecture,
( aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xb,smndt0(xa)))
| $false
| $false ),
inference(rw,[status(thm)],[495,70,theory(equality)]) ).
cnf(497,negated_conjecture,
aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xb,smndt0(xa))),
inference(cn,[status(thm)],[496,theory(equality)]) ).
cnf(536,negated_conjecture,
( aInteger0(sdtasdt0(xp,xq))
| ~ aInteger0(sdtpldt0(xb,smndt0(xa))) ),
inference(spm,[status(thm)],[55,497,theory(equality)]) ).
cnf(545,negated_conjecture,
( aInteger0(sdtasdt0(xp,xq))
| ~ aInteger0(smndt0(xa))
| ~ aInteger0(xb) ),
inference(spm,[status(thm)],[536,46,theory(equality)]) ).
cnf(546,negated_conjecture,
( aInteger0(sdtasdt0(xp,xq))
| ~ aInteger0(smndt0(xa))
| $false ),
inference(rw,[status(thm)],[545,71,theory(equality)]) ).
cnf(547,negated_conjecture,
( aInteger0(sdtasdt0(xp,xq))
| ~ aInteger0(smndt0(xa)) ),
inference(cn,[status(thm)],[546,theory(equality)]) ).
cnf(548,negated_conjecture,
( aInteger0(sdtasdt0(xp,xq))
| ~ aInteger0(xa) ),
inference(spm,[status(thm)],[547,111,theory(equality)]) ).
cnf(549,negated_conjecture,
( aInteger0(sdtasdt0(xp,xq))
| $false ),
inference(rw,[status(thm)],[548,72,theory(equality)]) ).
cnf(550,negated_conjecture,
aInteger0(sdtasdt0(xp,xq)),
inference(cn,[status(thm)],[549,theory(equality)]) ).
cnf(578,negated_conjecture,
( epred1_0
| sdtasdt0(xp,sdtasdt0(xq,esk2_0)) != sdtasdt0(xp,X1)
| ~ aInteger0(X1)
| ~ aInteger0(esk2_0)
| ~ aInteger0(xq)
| ~ aInteger0(xp) ),
inference(spm,[status(thm)],[328,99,theory(equality)]) ).
cnf(591,negated_conjecture,
( epred1_0
| sdtasdt0(xp,sdtasdt0(xq,esk2_0)) != sdtasdt0(xp,X1)
| ~ aInteger0(X1)
| $false
| ~ aInteger0(xq)
| ~ aInteger0(xp) ),
inference(rw,[status(thm)],[578,86,theory(equality)]) ).
cnf(592,negated_conjecture,
( epred1_0
| sdtasdt0(xp,sdtasdt0(xq,esk2_0)) != sdtasdt0(xp,X1)
| ~ aInteger0(X1)
| $false
| $false
| ~ aInteger0(xp) ),
inference(rw,[status(thm)],[591,68,theory(equality)]) ).
cnf(593,negated_conjecture,
( epred1_0
| sdtasdt0(xp,sdtasdt0(xq,esk2_0)) != sdtasdt0(xp,X1)
| ~ aInteger0(X1)
| $false
| $false
| $false ),
inference(rw,[status(thm)],[592,70,theory(equality)]) ).
cnf(594,negated_conjecture,
( epred1_0
| sdtasdt0(xp,sdtasdt0(xq,esk2_0)) != sdtasdt0(xp,X1)
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[593,theory(equality)]) ).
cnf(614,negated_conjecture,
( epred2_0
| sdtasdt0(esk2_0,sdtasdt0(xp,xq)) != sdtasdt0(xq,X1)
| ~ aInteger0(X1)
| ~ aInteger0(esk2_0)
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(spm,[status(thm)],[330,120,theory(equality)]) ).
cnf(621,negated_conjecture,
( epred2_0
| sdtasdt0(esk2_0,sdtasdt0(xp,xq)) != sdtasdt0(xq,X1)
| ~ aInteger0(X1)
| $false
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(rw,[status(thm)],[614,86,theory(equality)]) ).
cnf(622,negated_conjecture,
( epred2_0
| sdtasdt0(esk2_0,sdtasdt0(xp,xq)) != sdtasdt0(xq,X1)
| ~ aInteger0(X1)
| $false
| $false ),
inference(rw,[status(thm)],[621,550,theory(equality)]) ).
cnf(623,negated_conjecture,
( epred2_0
| sdtasdt0(esk2_0,sdtasdt0(xp,xq)) != sdtasdt0(xq,X1)
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[622,theory(equality)]) ).
cnf(704,negated_conjecture,
( epred1_0
| ~ aInteger0(sdtasdt0(xq,esk2_0)) ),
inference(er,[status(thm)],[594,theory(equality)]) ).
cnf(714,negated_conjecture,
( epred1_0
| ~ aInteger0(esk2_0)
| ~ aInteger0(xq) ),
inference(spm,[status(thm)],[704,105,theory(equality)]) ).
cnf(715,negated_conjecture,
( epred1_0
| $false
| ~ aInteger0(xq) ),
inference(rw,[status(thm)],[714,86,theory(equality)]) ).
cnf(716,negated_conjecture,
( epred1_0
| $false
| $false ),
inference(rw,[status(thm)],[715,68,theory(equality)]) ).
cnf(717,negated_conjecture,
epred1_0,
inference(cn,[status(thm)],[716,theory(equality)]) ).
cnf(726,negated_conjecture,
( ~ epred2_0
| $false ),
inference(rw,[status(thm)],[331,717,theory(equality)]) ).
cnf(727,negated_conjecture,
~ epred2_0,
inference(cn,[status(thm)],[726,theory(equality)]) ).
cnf(729,negated_conjecture,
( sdtasdt0(esk2_0,sdtasdt0(xp,xq)) != sdtasdt0(xq,X1)
| ~ aInteger0(X1) ),
inference(sr,[status(thm)],[623,727,theory(equality)]) ).
cnf(731,negated_conjecture,
( sdtasdt0(esk2_0,sdtasdt0(xp,xq)) != sdtasdt0(X1,xq)
| ~ aInteger0(X1)
| ~ aInteger0(xq) ),
inference(spm,[status(thm)],[729,120,theory(equality)]) ).
cnf(735,negated_conjecture,
( sdtasdt0(esk2_0,sdtasdt0(xp,xq)) != sdtasdt0(X1,xq)
| ~ aInteger0(X1)
| $false ),
inference(rw,[status(thm)],[731,68,theory(equality)]) ).
cnf(736,negated_conjecture,
( sdtasdt0(esk2_0,sdtasdt0(xp,xq)) != sdtasdt0(X1,xq)
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[735,theory(equality)]) ).
cnf(745,negated_conjecture,
( sdtasdt0(esk2_0,sdtasdt0(xp,xq)) != sdtasdt0(X1,sdtasdt0(X2,xq))
| ~ aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(xq)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[736,99,theory(equality)]) ).
cnf(752,negated_conjecture,
( sdtasdt0(esk2_0,sdtasdt0(xp,xq)) != sdtasdt0(X1,sdtasdt0(X2,xq))
| ~ aInteger0(sdtasdt0(X1,X2))
| $false
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[745,68,theory(equality)]) ).
cnf(753,negated_conjecture,
( sdtasdt0(esk2_0,sdtasdt0(xp,xq)) != sdtasdt0(X1,sdtasdt0(X2,xq))
| ~ aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[752,theory(equality)]) ).
cnf(39416,negated_conjecture,
( sdtasdt0(esk2_0,sdtasdt0(xp,xq)) != sdtasdt0(X1,sdtasdt0(X2,xq))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[753,105]) ).
cnf(39417,negated_conjecture,
( ~ aInteger0(xp)
| ~ aInteger0(esk2_0) ),
inference(er,[status(thm)],[39416,theory(equality)]) ).
cnf(39451,negated_conjecture,
( $false
| ~ aInteger0(esk2_0) ),
inference(rw,[status(thm)],[39417,70,theory(equality)]) ).
cnf(39452,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[39451,86,theory(equality)]) ).
cnf(39453,negated_conjecture,
$false,
inference(cn,[status(thm)],[39452,theory(equality)]) ).
cnf(39454,negated_conjecture,
$false,
39453,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM433+3 : 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 : n067.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 03:30:15 CST 2018
% 0.03/0.24 % CPUTime :
% 0.06/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.28 --creating new selector for []
% 0.43/0.84 -running prover on /export/starexec/sandbox/tmp/tmp3du6Qm/sel_theBenchmark.p_1 with time limit 29
% 0.43/0.84 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmp3du6Qm/sel_theBenchmark.p_1']
% 0.43/0.84 -prover status Theorem
% 0.43/0.84 Problem theBenchmark.p solved in phase 0.
% 0.43/0.84 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.84 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.84 Solved 1 out of 1.
% 0.43/0.84 # Problem is unsatisfiable (or provable), constructing proof object
% 0.43/0.84 # SZS status Theorem
% 0.43/0.84 # SZS output start CNFRefutation.
% See solution above
% 0.43/0.85 # SZS output end CNFRefutation
%------------------------------------------------------------------------------