TSTP Solution File: NUM490+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM490+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n134.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:31 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 9 unt; 0 def)
% Number of atoms : 90 ( 5 equ)
% Maximal formula atoms : 15 ( 5 avg)
% Number of connectives : 110 ( 38 ~; 27 |; 44 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn 11 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
( ~ equal(xp,sz00)
& ~ equal(xp,sz10)
& ! [X1] :
( ( aNaturalNumber0(X1)
& ( ? [X2] :
( aNaturalNumber0(X2)
& equal(xp,sdtasdt0(X1,X2)) )
| doDivides0(X1,xp) ) )
=> ( equal(X1,sz10)
| equal(X1,xp) ) )
& isPrime0(xp)
& ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtasdt0(xn,xm),sdtasdt0(xp,X1)) )
& doDivides0(xp,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox2/tmp/tmph9qbo_/sel_theBenchmark.p_1',m__1860) ).
fof(11,axiom,
equal(sdtasdt0(xn,xm),sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm))),
file('/export/starexec/sandbox2/tmp/tmph9qbo_/sel_theBenchmark.p_1',m__1951) ).
fof(31,conjecture,
( equal(sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),sdtasdt0(xn,xm))
| equal(sdtasdt0(xr,xm),sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))) ),
file('/export/starexec/sandbox2/tmp/tmph9qbo_/sel_theBenchmark.p_1',m__) ).
fof(48,negated_conjecture,
~ ( equal(sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),sdtasdt0(xn,xm))
| equal(sdtasdt0(xr,xm),sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))) ),
inference(assume_negation,[status(cth)],[31]) ).
fof(54,plain,
( ~ equal(xp,sz00)
& ~ equal(xp,sz10)
& ! [X1] :
( ~ aNaturalNumber0(X1)
| ( ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ equal(xp,sdtasdt0(X1,X2)) )
& ~ doDivides0(X1,xp) )
| equal(X1,sz10)
| equal(X1,xp) )
& isPrime0(xp)
& ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtasdt0(xn,xm),sdtasdt0(xp,X1)) )
& doDivides0(xp,sdtasdt0(xn,xm)) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(55,plain,
( ~ equal(xp,sz00)
& ~ equal(xp,sz10)
& ! [X3] :
( ~ aNaturalNumber0(X3)
| ( ! [X4] :
( ~ aNaturalNumber0(X4)
| ~ equal(xp,sdtasdt0(X3,X4)) )
& ~ doDivides0(X3,xp) )
| equal(X3,sz10)
| equal(X3,xp) )
& isPrime0(xp)
& ? [X5] :
( aNaturalNumber0(X5)
& equal(sdtasdt0(xn,xm),sdtasdt0(xp,X5)) )
& doDivides0(xp,sdtasdt0(xn,xm)) ),
inference(variable_rename,[status(thm)],[54]) ).
fof(56,plain,
( ~ equal(xp,sz00)
& ~ equal(xp,sz10)
& ! [X3] :
( ~ aNaturalNumber0(X3)
| ( ! [X4] :
( ~ aNaturalNumber0(X4)
| ~ equal(xp,sdtasdt0(X3,X4)) )
& ~ doDivides0(X3,xp) )
| equal(X3,sz10)
| equal(X3,xp) )
& isPrime0(xp)
& aNaturalNumber0(esk1_0)
& equal(sdtasdt0(xn,xm),sdtasdt0(xp,esk1_0))
& doDivides0(xp,sdtasdt0(xn,xm)) ),
inference(skolemize,[status(esa)],[55]) ).
fof(57,plain,
! [X3,X4] :
( ( ( ( ~ aNaturalNumber0(X4)
| ~ equal(xp,sdtasdt0(X3,X4)) )
& ~ doDivides0(X3,xp) )
| ~ aNaturalNumber0(X3)
| equal(X3,sz10)
| equal(X3,xp) )
& ~ equal(xp,sz00)
& ~ equal(xp,sz10)
& isPrime0(xp)
& aNaturalNumber0(esk1_0)
& equal(sdtasdt0(xn,xm),sdtasdt0(xp,esk1_0))
& doDivides0(xp,sdtasdt0(xn,xm)) ),
inference(shift_quantors,[status(thm)],[56]) ).
fof(58,plain,
! [X3,X4] :
( ( ~ aNaturalNumber0(X4)
| ~ equal(xp,sdtasdt0(X3,X4))
| ~ aNaturalNumber0(X3)
| equal(X3,sz10)
| equal(X3,xp) )
& ( ~ doDivides0(X3,xp)
| ~ aNaturalNumber0(X3)
| equal(X3,sz10)
| equal(X3,xp) )
& ~ equal(xp,sz00)
& ~ equal(xp,sz10)
& isPrime0(xp)
& aNaturalNumber0(esk1_0)
& equal(sdtasdt0(xn,xm),sdtasdt0(xp,esk1_0))
& doDivides0(xp,sdtasdt0(xn,xm)) ),
inference(distribute,[status(thm)],[57]) ).
cnf(60,plain,
sdtasdt0(xn,xm) = sdtasdt0(xp,esk1_0),
inference(split_conjunct,[status(thm)],[58]) ).
cnf(229,plain,
sdtasdt0(xn,xm) = sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),
inference(split_conjunct,[status(thm)],[11]) ).
fof(313,negated_conjecture,
( ~ equal(sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),sdtasdt0(xn,xm))
& ~ equal(sdtasdt0(xr,xm),sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))) ),
inference(fof_nnf,[status(thm)],[48]) ).
cnf(315,negated_conjecture,
sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) != sdtasdt0(xn,xm),
inference(split_conjunct,[status(thm)],[313]) ).
cnf(387,plain,
sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) = sdtasdt0(xp,esk1_0),
inference(rw,[status(thm)],[229,60,theory(equality)]) ).
cnf(395,negated_conjecture,
sdtasdt0(xp,esk1_0) != sdtasdt0(xn,xm),
inference(rw,[status(thm)],[315,387,theory(equality)]) ).
cnf(396,negated_conjecture,
$false,
inference(rw,[status(thm)],[395,60,theory(equality)]) ).
cnf(397,negated_conjecture,
$false,
inference(cn,[status(thm)],[396,theory(equality)]) ).
cnf(398,negated_conjecture,
$false,
397,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM490+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.24 % Computer : n134.star.cs.uiowa.edu
% 0.02/0.24 % Model : x86_64 x86_64
% 0.02/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.24 % Memory : 32218.625MB
% 0.02/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.06/0.24 % CPULimit : 300
% 0.06/0.24 % DateTime : Fri Jan 5 05:25:15 CST 2018
% 0.06/0.24 % CPUTime :
% 0.06/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.28 --creating new selector for []
% 0.06/0.36 -running prover on /export/starexec/sandbox2/tmp/tmph9qbo_/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.36 -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/tmph9qbo_/sel_theBenchmark.p_1']
% 0.06/0.36 -prover status Theorem
% 0.06/0.36 Problem theBenchmark.p solved in phase 0.
% 0.06/0.36 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.36 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.36 Solved 1 out of 1.
% 0.06/0.36 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.36 # SZS status Theorem
% 0.06/0.36 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.36 # SZS output end CNFRefutation
%------------------------------------------------------------------------------