%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM491+1 : 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:32 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 8 unt; 0 def)
% Number of atoms : 91 ( 1 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 117 ( 51 ~; 48 |; 15 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn 23 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(10,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& equal(X2,sdtasdt0(X1,X3)) ) ) ),
file('/export/starexec/sandbox/tmp/tmpeD4xQl/sel_theBenchmark.p_1',mDefDiv) ).
fof(18,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/tmp/tmpeD4xQl/sel_theBenchmark.p_1',m__1837) ).
fof(32,conjecture,
doDivides0(xp,sdtasdt0(xp,xm)),
file('/export/starexec/sandbox/tmp/tmpeD4xQl/sel_theBenchmark.p_1',m__) ).
fof(38,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmpeD4xQl/sel_theBenchmark.p_1',mSortsB_02) ).
fof(49,negated_conjecture,
~ doDivides0(xp,sdtasdt0(xp,xm)),
inference(assume_negation,[status(cth)],[32]) ).
fof(50,negated_conjecture,
~ doDivides0(xp,sdtasdt0(xp,xm)),
inference(fof_simplification,[status(thm)],[49,theory(equality)]) ).
fof(82,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)],[10]) ).
fof(83,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)],[82]) ).
fof(84,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)],[83]) ).
fof(85,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)],[84]) ).
fof(86,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)],[85]) ).
cnf(89,plain,
( doDivides0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| X1 != sdtasdt0(X2,X3)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[86]) ).
cnf(109,plain,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[18]) ).
cnf(110,plain,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[18]) ).
cnf(167,negated_conjecture,
~ doDivides0(xp,sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[50]) ).
fof(187,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[38]) ).
fof(188,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[187]) ).
cnf(189,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[188]) ).
cnf(381,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(er,[status(thm)],[89,theory(equality)]) ).
cnf(3898,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[381,189]) ).
cnf(3902,negated_conjecture,
( ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[167,3898,theory(equality)]) ).
cnf(3937,negated_conjecture,
( $false
| ~ aNaturalNumber0(xp) ),
inference(rw,[status(thm)],[3902,110,theory(equality)]) ).
cnf(3938,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[3937,109,theory(equality)]) ).
cnf(3939,negated_conjecture,
$false,
inference(cn,[status(thm)],[3938,theory(equality)]) ).
cnf(3940,negated_conjecture,
$false,
3939,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM491+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.22 % Computer : n080.star.cs.uiowa.edu
% 0.03/0.22 % Model : x86_64 x86_64
% 0.03/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.22 % Memory : 32218.625MB
% 0.03/0.22 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.22 % CPULimit : 300
% 0.03/0.22 % DateTime : Fri Jan 5 05:24:15 CST 2018
% 0.03/0.22 % 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.40 -running prover on /export/starexec/sandbox/tmp/tmpeD4xQl/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.40 -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/tmpeD4xQl/sel_theBenchmark.p_1']
% 0.06/0.40 -prover status Theorem
% 0.06/0.40 Problem theBenchmark.p solved in phase 0.
% 0.06/0.40 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.40 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.40 Solved 1 out of 1.
% 0.06/0.40 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.40 # SZS status Theorem
% 0.06/0.40 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.40 # SZS output end CNFRefutation
%------------------------------------------------------------------------------