TSTP Solution File: NUM477+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM477+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n044.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:29 EST 2018
% Result : Theorem 2.33s
% Output : CNFRefutation 2.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 12 unt; 0 def)
% Number of atoms : 139 ( 15 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 166 ( 67 ~; 75 |; 19 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 27 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( equal(sdtasdt0(X1,sz00),sz00)
& equal(sz00,sdtasdt0(sz00,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmptbbXOi/sel_theBenchmark.p_1',m_MulZero) ).
fof(7,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& equal(X2,sdtasdt0(X1,X3)) ) ) ),
file('/export/starexec/sandbox/tmp/tmptbbXOi/sel_theBenchmark.p_1',mDefDiv) ).
fof(21,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ~ equal(X1,sz00)
=> sdtlseqdt0(X2,sdtasdt0(X2,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmptbbXOi/sel_theBenchmark.p_1',mMonMul2) ).
fof(23,conjecture,
sdtlseqdt0(xm,xn),
file('/export/starexec/sandbox/tmp/tmptbbXOi/sel_theBenchmark.p_1',m__) ).
fof(26,axiom,
( doDivides0(xm,xn)
& ~ equal(xn,sz00) ),
file('/export/starexec/sandbox/tmp/tmptbbXOi/sel_theBenchmark.p_1',m__1494_04) ).
fof(35,axiom,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/tmp/tmptbbXOi/sel_theBenchmark.p_1',m__1494) ).
fof(38,negated_conjecture,
~ sdtlseqdt0(xm,xn),
inference(assume_negation,[status(cth)],[23]) ).
fof(39,negated_conjecture,
~ sdtlseqdt0(xm,xn),
inference(fof_simplification,[status(thm)],[38,theory(equality)]) ).
fof(40,plain,
! [X1] :
( ~ aNaturalNumber0(X1)
| ( equal(sdtasdt0(X1,sz00),sz00)
& equal(sz00,sdtasdt0(sz00,X1)) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(41,plain,
! [X2] :
( ~ aNaturalNumber0(X2)
| ( equal(sdtasdt0(X2,sz00),sz00)
& equal(sz00,sdtasdt0(sz00,X2)) ) ),
inference(variable_rename,[status(thm)],[40]) ).
fof(42,plain,
! [X2] :
( ( equal(sdtasdt0(X2,sz00),sz00)
| ~ aNaturalNumber0(X2) )
& ( equal(sz00,sdtasdt0(sz00,X2))
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[41]) ).
cnf(44,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[42]) ).
fof(65,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ( ( ~ doDivides0(X1,X2)
| ? [X3] :
( aNaturalNumber0(X3)
& equal(X2,sdtasdt0(X1,X3)) ) )
& ( ! [X3] :
( ~ aNaturalNumber0(X3)
| ~ equal(X2,sdtasdt0(X1,X3)) )
| doDivides0(X1,X2) ) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(66,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ( ( ~ doDivides0(X4,X5)
| ? [X6] :
( aNaturalNumber0(X6)
& equal(X5,sdtasdt0(X4,X6)) ) )
& ( ! [X7] :
( ~ aNaturalNumber0(X7)
| ~ equal(X5,sdtasdt0(X4,X7)) )
| doDivides0(X4,X5) ) ) ),
inference(variable_rename,[status(thm)],[65]) ).
fof(67,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ( ( ~ doDivides0(X4,X5)
| ( aNaturalNumber0(esk1_2(X4,X5))
& equal(X5,sdtasdt0(X4,esk1_2(X4,X5))) ) )
& ( ! [X7] :
( ~ aNaturalNumber0(X7)
| ~ equal(X5,sdtasdt0(X4,X7)) )
| doDivides0(X4,X5) ) ) ),
inference(skolemize,[status(esa)],[66]) ).
fof(68,plain,
! [X4,X5,X7] :
( ( ( ~ aNaturalNumber0(X7)
| ~ equal(X5,sdtasdt0(X4,X7))
| doDivides0(X4,X5) )
& ( ~ doDivides0(X4,X5)
| ( aNaturalNumber0(esk1_2(X4,X5))
& equal(X5,sdtasdt0(X4,esk1_2(X4,X5))) ) ) )
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ),
inference(shift_quantors,[status(thm)],[67]) ).
fof(69,plain,
! [X4,X5,X7] :
( ( ~ aNaturalNumber0(X7)
| ~ equal(X5,sdtasdt0(X4,X7))
| doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( aNaturalNumber0(esk1_2(X4,X5))
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( equal(X5,sdtasdt0(X4,esk1_2(X4,X5)))
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
inference(distribute,[status(thm)],[68]) ).
cnf(70,plain,
( X1 = sdtasdt0(X2,esk1_2(X2,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1) ),
inference(split_conjunct,[status(thm)],[69]) ).
cnf(71,plain,
( aNaturalNumber0(esk1_2(X2,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1) ),
inference(split_conjunct,[status(thm)],[69]) ).
fof(134,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| equal(X1,sz00)
| sdtlseqdt0(X2,sdtasdt0(X2,X1)) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(135,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| equal(X3,sz00)
| sdtlseqdt0(X4,sdtasdt0(X4,X3)) ),
inference(variable_rename,[status(thm)],[134]) ).
cnf(136,plain,
( sdtlseqdt0(X1,sdtasdt0(X1,X2))
| X2 = sz00
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[135]) ).
cnf(139,negated_conjecture,
~ sdtlseqdt0(xm,xn),
inference(split_conjunct,[status(thm)],[39]) ).
cnf(148,plain,
xn != sz00,
inference(split_conjunct,[status(thm)],[26]) ).
cnf(149,plain,
doDivides0(xm,xn),
inference(split_conjunct,[status(thm)],[26]) ).
cnf(178,plain,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[35]) ).
cnf(179,plain,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[35]) ).
cnf(339,plain,
( sz00 = esk1_2(X1,X2)
| sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(esk1_2(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X2) ),
inference(spm,[status(thm)],[136,70,theory(equality)]) ).
cnf(2749,plain,
( esk1_2(X1,X2) = sz00
| sdtlseqdt0(X1,X2)
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[339,71]) ).
cnf(2751,plain,
( sdtasdt0(X1,sz00) = X2
| sdtlseqdt0(X1,X2)
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(spm,[status(thm)],[70,2749,theory(equality)]) ).
cnf(123040,plain,
( sdtasdt0(xm,sz00) = xn
| sdtlseqdt0(xm,xn)
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xn) ),
inference(spm,[status(thm)],[2751,149,theory(equality)]) ).
cnf(123094,plain,
( sdtasdt0(xm,sz00) = xn
| sdtlseqdt0(xm,xn)
| $false
| ~ aNaturalNumber0(xn) ),
inference(rw,[status(thm)],[123040,179,theory(equality)]) ).
cnf(123095,plain,
( sdtasdt0(xm,sz00) = xn
| sdtlseqdt0(xm,xn)
| $false
| $false ),
inference(rw,[status(thm)],[123094,178,theory(equality)]) ).
cnf(123096,plain,
( sdtasdt0(xm,sz00) = xn
| sdtlseqdt0(xm,xn) ),
inference(cn,[status(thm)],[123095,theory(equality)]) ).
cnf(123097,plain,
sdtasdt0(xm,sz00) = xn,
inference(sr,[status(thm)],[123096,139,theory(equality)]) ).
cnf(123463,plain,
( xn = sz00
| ~ aNaturalNumber0(xm) ),
inference(spm,[status(thm)],[44,123097,theory(equality)]) ).
cnf(123586,plain,
( xn = sz00
| $false ),
inference(rw,[status(thm)],[123463,179,theory(equality)]) ).
cnf(123587,plain,
xn = sz00,
inference(cn,[status(thm)],[123586,theory(equality)]) ).
cnf(123588,plain,
$false,
inference(sr,[status(thm)],[123587,148,theory(equality)]) ).
cnf(123589,plain,
$false,
123588,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM477+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.03 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n044.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.625MB
% 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Fri Jan 5 05:17:59 CST 2018
% 0.02/0.23 % CPUTime :
% 0.07/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.27 --creating new selector for []
% 2.33/2.56 -running prover on /export/starexec/sandbox/tmp/tmptbbXOi/sel_theBenchmark.p_1 with time limit 29
% 2.33/2.56 -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/tmptbbXOi/sel_theBenchmark.p_1']
% 2.33/2.56 -prover status Theorem
% 2.33/2.56 Problem theBenchmark.p solved in phase 0.
% 2.33/2.56 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.33/2.56 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.33/2.56 Solved 1 out of 1.
% 2.33/2.56 # Problem is unsatisfiable (or provable), constructing proof object
% 2.33/2.56 # SZS status Theorem
% 2.33/2.56 # SZS output start CNFRefutation.
% See solution above
% 2.33/2.57 # SZS output end CNFRefutation
%------------------------------------------------------------------------------