TSTP Solution File: NUM477+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM477+2 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n061.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 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 10 unt; 0 def)
% Number of atoms : 88 ( 13 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 85 ( 31 ~; 31 |; 20 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 13 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( equal(sdtasdt0(X1,sz00),sz00)
& equal(sz00,sdtasdt0(sz00,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmpt88USs/sel_theBenchmark.p_1',m_MulZero) ).
fof(21,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ~ equal(X1,sz00)
=> sdtlseqdt0(X2,sdtasdt0(X2,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmpt88USs/sel_theBenchmark.p_1',mMonMul2) ).
fof(23,conjecture,
( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xm,X1),xn) )
| sdtlseqdt0(xm,xn) ),
file('/export/starexec/sandbox/tmp/tmpt88USs/sel_theBenchmark.p_1',m__) ).
fof(26,axiom,
( ? [X1] :
( aNaturalNumber0(X1)
& equal(xn,sdtasdt0(xm,X1)) )
& doDivides0(xm,xn)
& ~ equal(xn,sz00) ),
file('/export/starexec/sandbox/tmp/tmpt88USs/sel_theBenchmark.p_1',m__1494_04) ).
fof(35,axiom,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/tmp/tmpt88USs/sel_theBenchmark.p_1',m__1494) ).
fof(38,negated_conjecture,
~ ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xm,X1),xn) )
| sdtlseqdt0(xm,xn) ),
inference(assume_negation,[status(cth)],[23]) ).
fof(39,plain,
! [X1] :
( ~ aNaturalNumber0(X1)
| ( equal(sdtasdt0(X1,sz00),sz00)
& equal(sz00,sdtasdt0(sz00,X1)) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(40,plain,
! [X2] :
( ~ aNaturalNumber0(X2)
| ( equal(sdtasdt0(X2,sz00),sz00)
& equal(sz00,sdtasdt0(sz00,X2)) ) ),
inference(variable_rename,[status(thm)],[39]) ).
fof(41,plain,
! [X2] :
( ( equal(sdtasdt0(X2,sz00),sz00)
| ~ aNaturalNumber0(X2) )
& ( equal(sz00,sdtasdt0(sz00,X2))
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[40]) ).
cnf(43,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[41]) ).
fof(133,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| equal(X1,sz00)
| sdtlseqdt0(X2,sdtasdt0(X2,X1)) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(134,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| equal(X3,sz00)
| sdtlseqdt0(X4,sdtasdt0(X4,X3)) ),
inference(variable_rename,[status(thm)],[133]) ).
cnf(135,plain,
( sdtlseqdt0(X1,sdtasdt0(X1,X2))
| X2 = sz00
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[134]) ).
fof(138,negated_conjecture,
( ! [X1] :
( ~ aNaturalNumber0(X1)
| ~ equal(sdtpldt0(xm,X1),xn) )
& ~ sdtlseqdt0(xm,xn) ),
inference(fof_nnf,[status(thm)],[38]) ).
fof(139,negated_conjecture,
( ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ equal(sdtpldt0(xm,X2),xn) )
& ~ sdtlseqdt0(xm,xn) ),
inference(variable_rename,[status(thm)],[138]) ).
fof(140,negated_conjecture,
! [X2] :
( ( ~ aNaturalNumber0(X2)
| ~ equal(sdtpldt0(xm,X2),xn) )
& ~ sdtlseqdt0(xm,xn) ),
inference(shift_quantors,[status(thm)],[139]) ).
cnf(141,negated_conjecture,
~ sdtlseqdt0(xm,xn),
inference(split_conjunct,[status(thm)],[140]) ).
fof(151,plain,
( ? [X2] :
( aNaturalNumber0(X2)
& equal(xn,sdtasdt0(xm,X2)) )
& doDivides0(xm,xn)
& ~ equal(xn,sz00) ),
inference(variable_rename,[status(thm)],[26]) ).
fof(152,plain,
( aNaturalNumber0(esk3_0)
& equal(xn,sdtasdt0(xm,esk3_0))
& doDivides0(xm,xn)
& ~ equal(xn,sz00) ),
inference(skolemize,[status(esa)],[151]) ).
cnf(153,plain,
xn != sz00,
inference(split_conjunct,[status(thm)],[152]) ).
cnf(155,plain,
xn = sdtasdt0(xm,esk3_0),
inference(split_conjunct,[status(thm)],[152]) ).
cnf(156,plain,
aNaturalNumber0(esk3_0),
inference(split_conjunct,[status(thm)],[152]) ).
cnf(186,plain,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[35]) ).
cnf(305,plain,
( sz00 = esk3_0
| sdtlseqdt0(xm,xn)
| ~ aNaturalNumber0(esk3_0)
| ~ aNaturalNumber0(xm) ),
inference(spm,[status(thm)],[135,155,theory(equality)]) ).
cnf(312,plain,
( sz00 = esk3_0
| sdtlseqdt0(xm,xn)
| $false
| ~ aNaturalNumber0(xm) ),
inference(rw,[status(thm)],[305,156,theory(equality)]) ).
cnf(313,plain,
( sz00 = esk3_0
| sdtlseqdt0(xm,xn)
| $false
| $false ),
inference(rw,[status(thm)],[312,186,theory(equality)]) ).
cnf(314,plain,
( sz00 = esk3_0
| sdtlseqdt0(xm,xn) ),
inference(cn,[status(thm)],[313,theory(equality)]) ).
cnf(315,plain,
esk3_0 = sz00,
inference(sr,[status(thm)],[314,141,theory(equality)]) ).
cnf(864,plain,
sdtasdt0(xm,sz00) = xn,
inference(rw,[status(thm)],[155,315,theory(equality)]) ).
cnf(886,plain,
( xn = sz00
| ~ aNaturalNumber0(xm) ),
inference(spm,[status(thm)],[43,864,theory(equality)]) ).
cnf(901,plain,
( xn = sz00
| $false ),
inference(rw,[status(thm)],[886,186,theory(equality)]) ).
cnf(902,plain,
xn = sz00,
inference(cn,[status(thm)],[901,theory(equality)]) ).
cnf(903,plain,
$false,
inference(sr,[status(thm)],[902,153,theory(equality)]) ).
cnf(904,plain,
$false,
903,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM477+2 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n061.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:42:00 CST 2018
% 0.02/0.23 % CPUTime :
% 0.06/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.27 --creating new selector for []
% 0.06/0.35 -running prover on /export/starexec/sandbox/tmp/tmpt88USs/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.35 -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/tmpt88USs/sel_theBenchmark.p_1']
% 0.06/0.35 -prover status Theorem
% 0.06/0.35 Problem theBenchmark.p solved in phase 0.
% 0.06/0.35 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.35 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.35 Solved 1 out of 1.
% 0.06/0.35 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.35 # SZS status Theorem
% 0.06/0.35 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.35 # SZS output end CNFRefutation
%------------------------------------------------------------------------------