TSTP Solution File: NUM519+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM519+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n030.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:38 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 71 ( 22 ~; 21 |; 28 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 6 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
( ( ? [X1] :
( aNaturalNumber0(X1)
& equal(xn,sdtasdt0(xr,X1)) )
& doDivides0(xr,xn) )
| ( ? [X1] :
( aNaturalNumber0(X1)
& equal(xm,sdtasdt0(xr,X1)) )
& doDivides0(xr,xm) ) ),
file('/export/starexec/sandbox/tmp/tmp7f6ir6/sel_theBenchmark.p_1',m__2449) ).
fof(10,axiom,
~ ( ? [X1] :
( aNaturalNumber0(X1)
& equal(xn,sdtasdt0(xr,X1)) )
| doDivides0(xr,xn) ),
file('/export/starexec/sandbox/tmp/tmp7f6ir6/sel_theBenchmark.p_1',m__2487) ).
fof(54,axiom,
~ ( ? [X1] :
( aNaturalNumber0(X1)
& equal(xm,sdtasdt0(xr,X1)) )
| doDivides0(xr,xm) ),
file('/export/starexec/sandbox/tmp/tmp7f6ir6/sel_theBenchmark.p_1',m__2698) ).
fof(77,plain,
( ( ? [X2] :
( aNaturalNumber0(X2)
& equal(xn,sdtasdt0(xr,X2)) )
& doDivides0(xr,xn) )
| ( ? [X3] :
( aNaturalNumber0(X3)
& equal(xm,sdtasdt0(xr,X3)) )
& doDivides0(xr,xm) ) ),
inference(variable_rename,[status(thm)],[4]) ).
fof(78,plain,
( ( aNaturalNumber0(esk2_0)
& equal(xn,sdtasdt0(xr,esk2_0))
& doDivides0(xr,xn) )
| ( aNaturalNumber0(esk3_0)
& equal(xm,sdtasdt0(xr,esk3_0))
& doDivides0(xr,xm) ) ),
inference(skolemize,[status(esa)],[77]) ).
fof(79,plain,
( ( aNaturalNumber0(esk3_0)
| aNaturalNumber0(esk2_0) )
& ( equal(xm,sdtasdt0(xr,esk3_0))
| aNaturalNumber0(esk2_0) )
& ( doDivides0(xr,xm)
| aNaturalNumber0(esk2_0) )
& ( aNaturalNumber0(esk3_0)
| equal(xn,sdtasdt0(xr,esk2_0)) )
& ( equal(xm,sdtasdt0(xr,esk3_0))
| equal(xn,sdtasdt0(xr,esk2_0)) )
& ( doDivides0(xr,xm)
| equal(xn,sdtasdt0(xr,esk2_0)) )
& ( aNaturalNumber0(esk3_0)
| doDivides0(xr,xn) )
& ( equal(xm,sdtasdt0(xr,esk3_0))
| doDivides0(xr,xn) )
& ( doDivides0(xr,xm)
| doDivides0(xr,xn) ) ),
inference(distribute,[status(thm)],[78]) ).
cnf(80,plain,
( doDivides0(xr,xn)
| doDivides0(xr,xm) ),
inference(split_conjunct,[status(thm)],[79]) ).
fof(118,plain,
( ! [X1] :
( ~ aNaturalNumber0(X1)
| ~ equal(xn,sdtasdt0(xr,X1)) )
& ~ doDivides0(xr,xn) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(119,plain,
( ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ equal(xn,sdtasdt0(xr,X2)) )
& ~ doDivides0(xr,xn) ),
inference(variable_rename,[status(thm)],[118]) ).
fof(120,plain,
! [X2] :
( ( ~ aNaturalNumber0(X2)
| ~ equal(xn,sdtasdt0(xr,X2)) )
& ~ doDivides0(xr,xn) ),
inference(shift_quantors,[status(thm)],[119]) ).
cnf(121,plain,
~ doDivides0(xr,xn),
inference(split_conjunct,[status(thm)],[120]) ).
fof(453,plain,
( ! [X1] :
( ~ aNaturalNumber0(X1)
| ~ equal(xm,sdtasdt0(xr,X1)) )
& ~ doDivides0(xr,xm) ),
inference(fof_nnf,[status(thm)],[54]) ).
fof(454,plain,
( ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ equal(xm,sdtasdt0(xr,X2)) )
& ~ doDivides0(xr,xm) ),
inference(variable_rename,[status(thm)],[453]) ).
fof(455,plain,
! [X2] :
( ( ~ aNaturalNumber0(X2)
| ~ equal(xm,sdtasdt0(xr,X2)) )
& ~ doDivides0(xr,xm) ),
inference(shift_quantors,[status(thm)],[454]) ).
cnf(456,plain,
~ doDivides0(xr,xm),
inference(split_conjunct,[status(thm)],[455]) ).
cnf(461,plain,
doDivides0(xr,xm),
inference(sr,[status(thm)],[80,121,theory(equality)]) ).
cnf(462,plain,
$false,
inference(sr,[status(thm)],[461,456,theory(equality)]) ).
cnf(463,plain,
$false,
462,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM519+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.23 % Computer : n030.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 08:30:15 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.28 --creating new selector for []
% 0.06/0.36 -running prover on /export/starexec/sandbox/tmp/tmp7f6ir6/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.36 -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/tmp7f6ir6/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/sandbox/benchmark/theBenchmark.p
% 0.06/0.36 % SZS status Ended for /export/starexec/sandbox/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
%------------------------------------------------------------------------------