%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM466+2 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n080.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:26 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 5
% Syntax : Number of formulae : 46 ( 10 unt; 0 def)
% Number of atoms : 161 ( 21 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 199 ( 84 ~; 64 |; 46 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 25 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(20,conjecture,
( ( ? [X1] :
( aNaturalNumber0(X1)
& equal(xm,sdtasdt0(xl,X1)) )
& doDivides0(xl,xm)
& ? [X1] :
( aNaturalNumber0(X1)
& equal(xn,sdtasdt0(xm,X1)) )
& doDivides0(xm,xn) )
=> ( ? [X1] :
( aNaturalNumber0(X1)
& equal(xn,sdtasdt0(xl,X1)) )
| doDivides0(xl,xn) ) ),
file('/export/starexec/sandbox/tmp/tmp6iFY09/sel_theBenchmark.p_1',m__) ).
fof(21,axiom,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/tmp/tmp6iFY09/sel_theBenchmark.p_1',m__1218) ).
fof(22,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> equal(sdtasdt0(sdtasdt0(X1,X2),X3),sdtasdt0(X1,sdtasdt0(X2,X3))) ),
file('/export/starexec/sandbox/tmp/tmp6iFY09/sel_theBenchmark.p_1',mMulAsso) ).
fof(26,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp6iFY09/sel_theBenchmark.p_1',mSortsB_02) ).
fof(31,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> equal(sdtasdt0(X1,X2),sdtasdt0(X2,X1)) ),
file('/export/starexec/sandbox/tmp/tmp6iFY09/sel_theBenchmark.p_1',mMulComm) ).
fof(34,negated_conjecture,
~ ( ( ? [X1] :
( aNaturalNumber0(X1)
& equal(xm,sdtasdt0(xl,X1)) )
& doDivides0(xl,xm)
& ? [X1] :
( aNaturalNumber0(X1)
& equal(xn,sdtasdt0(xm,X1)) )
& doDivides0(xm,xn) )
=> ( ? [X1] :
( aNaturalNumber0(X1)
& equal(xn,sdtasdt0(xl,X1)) )
| doDivides0(xl,xn) ) ),
inference(assume_negation,[status(cth)],[20]) ).
fof(125,negated_conjecture,
( ? [X1] :
( aNaturalNumber0(X1)
& equal(xm,sdtasdt0(xl,X1)) )
& doDivides0(xl,xm)
& ? [X1] :
( aNaturalNumber0(X1)
& equal(xn,sdtasdt0(xm,X1)) )
& doDivides0(xm,xn)
& ! [X1] :
( ~ aNaturalNumber0(X1)
| ~ equal(xn,sdtasdt0(xl,X1)) )
& ~ doDivides0(xl,xn) ),
inference(fof_nnf,[status(thm)],[34]) ).
fof(126,negated_conjecture,
( ? [X2] :
( aNaturalNumber0(X2)
& equal(xm,sdtasdt0(xl,X2)) )
& doDivides0(xl,xm)
& ? [X3] :
( aNaturalNumber0(X3)
& equal(xn,sdtasdt0(xm,X3)) )
& doDivides0(xm,xn)
& ! [X4] :
( ~ aNaturalNumber0(X4)
| ~ equal(xn,sdtasdt0(xl,X4)) )
& ~ doDivides0(xl,xn) ),
inference(variable_rename,[status(thm)],[125]) ).
fof(127,negated_conjecture,
( aNaturalNumber0(esk3_0)
& equal(xm,sdtasdt0(xl,esk3_0))
& doDivides0(xl,xm)
& aNaturalNumber0(esk4_0)
& equal(xn,sdtasdt0(xm,esk4_0))
& doDivides0(xm,xn)
& ! [X4] :
( ~ aNaturalNumber0(X4)
| ~ equal(xn,sdtasdt0(xl,X4)) )
& ~ doDivides0(xl,xn) ),
inference(skolemize,[status(esa)],[126]) ).
fof(128,negated_conjecture,
! [X4] :
( ( ~ aNaturalNumber0(X4)
| ~ equal(xn,sdtasdt0(xl,X4)) )
& ~ doDivides0(xl,xn)
& aNaturalNumber0(esk3_0)
& equal(xm,sdtasdt0(xl,esk3_0))
& doDivides0(xl,xm)
& aNaturalNumber0(esk4_0)
& equal(xn,sdtasdt0(xm,esk4_0))
& doDivides0(xm,xn) ),
inference(shift_quantors,[status(thm)],[127]) ).
cnf(130,negated_conjecture,
xn = sdtasdt0(xm,esk4_0),
inference(split_conjunct,[status(thm)],[128]) ).
cnf(131,negated_conjecture,
aNaturalNumber0(esk4_0),
inference(split_conjunct,[status(thm)],[128]) ).
cnf(133,negated_conjecture,
xm = sdtasdt0(xl,esk3_0),
inference(split_conjunct,[status(thm)],[128]) ).
cnf(134,negated_conjecture,
aNaturalNumber0(esk3_0),
inference(split_conjunct,[status(thm)],[128]) ).
cnf(136,negated_conjecture,
( xn != sdtasdt0(xl,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[128]) ).
cnf(138,plain,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(139,plain,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[21]) ).
fof(140,plain,
! [X1,X2,X3] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| equal(sdtasdt0(sdtasdt0(X1,X2),X3),sdtasdt0(X1,sdtasdt0(X2,X3))) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(141,plain,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| equal(sdtasdt0(sdtasdt0(X4,X5),X6),sdtasdt0(X4,sdtasdt0(X5,X6))) ),
inference(variable_rename,[status(thm)],[140]) ).
cnf(142,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[141]) ).
fof(158,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(159,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[158]) ).
cnf(160,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[159]) ).
fof(173,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| equal(sdtasdt0(X1,X2),sdtasdt0(X2,X1)) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(174,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| equal(sdtasdt0(X3,X4),sdtasdt0(X4,X3)) ),
inference(variable_rename,[status(thm)],[173]) ).
cnf(175,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[174]) ).
cnf(233,negated_conjecture,
( sdtasdt0(X1,xl) != xn
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(xl) ),
inference(spm,[status(thm)],[136,175,theory(equality)]) ).
cnf(251,negated_conjecture,
( sdtasdt0(X1,xl) != xn
| ~ aNaturalNumber0(X1)
| $false ),
inference(rw,[status(thm)],[233,139,theory(equality)]) ).
cnf(252,negated_conjecture,
( sdtasdt0(X1,xl) != xn
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[251,theory(equality)]) ).
cnf(908,negated_conjecture,
( sdtasdt0(X1,sdtasdt0(X2,xl)) != xn
| ~ aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(xl)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[252,142,theory(equality)]) ).
cnf(919,negated_conjecture,
( sdtasdt0(X1,sdtasdt0(X2,xl)) != xn
| ~ aNaturalNumber0(sdtasdt0(X1,X2))
| $false
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[908,139,theory(equality)]) ).
cnf(920,negated_conjecture,
( sdtasdt0(X1,sdtasdt0(X2,xl)) != xn
| ~ aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[919,theory(equality)]) ).
cnf(1339,negated_conjecture,
( sdtasdt0(X1,sdtasdt0(X2,xl)) != xn
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[920,160]) ).
cnf(1344,negated_conjecture,
( sdtasdt0(X1,sdtasdt0(xl,X2)) != xn
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(xl) ),
inference(spm,[status(thm)],[1339,175,theory(equality)]) ).
cnf(1361,negated_conjecture,
( sdtasdt0(X1,sdtasdt0(xl,X2)) != xn
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| $false ),
inference(rw,[status(thm)],[1344,139,theory(equality)]) ).
cnf(1362,negated_conjecture,
( sdtasdt0(X1,sdtasdt0(xl,X2)) != xn
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[1361,theory(equality)]) ).
cnf(1514,negated_conjecture,
( sdtasdt0(X1,xm) != xn
| ~ aNaturalNumber0(esk3_0)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[1362,133,theory(equality)]) ).
cnf(1526,negated_conjecture,
( sdtasdt0(X1,xm) != xn
| $false
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[1514,134,theory(equality)]) ).
cnf(1527,negated_conjecture,
( sdtasdt0(X1,xm) != xn
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[1526,theory(equality)]) ).
cnf(1548,negated_conjecture,
( sdtasdt0(xm,X1) != xn
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(xm) ),
inference(spm,[status(thm)],[1527,175,theory(equality)]) ).
cnf(1557,negated_conjecture,
( sdtasdt0(xm,X1) != xn
| ~ aNaturalNumber0(X1)
| $false ),
inference(rw,[status(thm)],[1548,138,theory(equality)]) ).
cnf(1558,negated_conjecture,
( sdtasdt0(xm,X1) != xn
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[1557,theory(equality)]) ).
cnf(1603,negated_conjecture,
~ aNaturalNumber0(esk4_0),
inference(spm,[status(thm)],[1558,130,theory(equality)]) ).
cnf(1609,negated_conjecture,
$false,
inference(rw,[status(thm)],[1603,131,theory(equality)]) ).
cnf(1610,negated_conjecture,
$false,
inference(cn,[status(thm)],[1609,theory(equality)]) ).
cnf(1611,negated_conjecture,
$false,
1610,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM466+2 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.03 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.23 % Computer : n080.star.cs.uiowa.edu
% 0.03/0.23 % Model : x86_64 x86_64
% 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23 % Memory : 32218.625MB
% 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.23 % CPULimit : 300
% 0.03/0.23 % DateTime : Fri Jan 5 04:47:15 CST 2018
% 0.03/0.23 % CPUTime :
% 0.03/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.27 --creating new selector for []
% 0.06/0.38 -running prover on /export/starexec/sandbox/tmp/tmp6iFY09/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.38 -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/tmp6iFY09/sel_theBenchmark.p_1']
% 0.06/0.38 -prover status Theorem
% 0.06/0.38 Problem theBenchmark.p solved in phase 0.
% 0.06/0.38 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.38 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.38 Solved 1 out of 1.
% 0.06/0.38 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.38 # SZS status Theorem
% 0.06/0.38 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.38 # SZS output end CNFRefutation
%------------------------------------------------------------------------------