TSTP Solution File: NUM514+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM514+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n032.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:37 EST 2018
% Result : Theorem 0.42s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 40 ( 3 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 41 ( 15 ~; 7 |; 17 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn 3 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(36,conjecture,
( ( aNaturalNumber0(sdtsldt0(xn,xr))
& equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr))) )
=> ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtasdt0(sdtsldt0(xn,xr),xm),sdtasdt0(xp,X1)) )
| doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)) ) ),
file('/export/starexec/sandbox/tmp/tmpDBh0xI/sel_theBenchmark.p_1',m__) ).
fof(52,axiom,
( aNaturalNumber0(sdtsldt0(xk,xr))
& equal(xk,sdtasdt0(xr,sdtsldt0(xk,xr)))
& aNaturalNumber0(sdtsldt0(xn,xr))
& equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr)))
& equal(sdtasdt0(xp,sdtsldt0(xk,xr)),sdtasdt0(sdtsldt0(xn,xr),xm)) ),
file('/export/starexec/sandbox/tmp/tmpDBh0xI/sel_theBenchmark.p_1',m__2613) ).
fof(57,negated_conjecture,
~ ( ( aNaturalNumber0(sdtsldt0(xn,xr))
& equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr))) )
=> ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtasdt0(sdtsldt0(xn,xr),xm),sdtasdt0(xp,X1)) )
| doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)) ) ),
inference(assume_negation,[status(cth)],[36]) ).
fof(375,negated_conjecture,
( aNaturalNumber0(sdtsldt0(xn,xr))
& equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr)))
& ! [X1] :
( ~ aNaturalNumber0(X1)
| ~ equal(sdtasdt0(sdtsldt0(xn,xr),xm),sdtasdt0(xp,X1)) )
& ~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)) ),
inference(fof_nnf,[status(thm)],[57]) ).
fof(376,negated_conjecture,
( aNaturalNumber0(sdtsldt0(xn,xr))
& equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr)))
& ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ equal(sdtasdt0(sdtsldt0(xn,xr),xm),sdtasdt0(xp,X2)) )
& ~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)) ),
inference(variable_rename,[status(thm)],[375]) ).
fof(377,negated_conjecture,
! [X2] :
( ( ~ aNaturalNumber0(X2)
| ~ equal(sdtasdt0(sdtsldt0(xn,xr),xm),sdtasdt0(xp,X2)) )
& ~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))
& aNaturalNumber0(sdtsldt0(xn,xr))
& equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr))) ),
inference(shift_quantors,[status(thm)],[376]) ).
cnf(381,negated_conjecture,
( sdtasdt0(sdtsldt0(xn,xr),xm) != sdtasdt0(xp,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[377]) ).
cnf(451,plain,
sdtasdt0(xp,sdtsldt0(xk,xr)) = sdtasdt0(sdtsldt0(xn,xr),xm),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(455,plain,
aNaturalNumber0(sdtsldt0(xk,xr)),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(663,negated_conjecture,
( sdtasdt0(xp,sdtsldt0(xk,xr)) != sdtasdt0(xp,X1)
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[381,451,theory(equality)]) ).
cnf(15354,negated_conjecture,
~ aNaturalNumber0(sdtsldt0(xk,xr)),
inference(er,[status(thm)],[663,theory(equality)]) ).
cnf(15357,negated_conjecture,
$false,
inference(rw,[status(thm)],[15354,455,theory(equality)]) ).
cnf(15358,negated_conjecture,
$false,
inference(cn,[status(thm)],[15357,theory(equality)]) ).
cnf(15359,negated_conjecture,
$false,
15358,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM514+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.23 % Computer : n032.star.cs.uiowa.edu
% 0.03/0.23 % Model : x86_64 x86_64
% 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23 % Memory : 32218.625MB
% 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.23 % CPULimit : 300
% 0.03/0.23 % DateTime : Fri Jan 5 06:42:15 CST 2018
% 0.03/0.23 % CPUTime :
% 0.03/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.28 --creating new selector for []
% 0.42/0.66 -running prover on /export/starexec/sandbox/tmp/tmpDBh0xI/sel_theBenchmark.p_1 with time limit 29
% 0.42/0.66 -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/tmpDBh0xI/sel_theBenchmark.p_1']
% 0.42/0.66 -prover status Theorem
% 0.42/0.66 Problem theBenchmark.p solved in phase 0.
% 0.42/0.66 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.66 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.66 Solved 1 out of 1.
% 0.42/0.66 # Problem is unsatisfiable (or provable), constructing proof object
% 0.42/0.66 # SZS status Theorem
% 0.42/0.66 # SZS output start CNFRefutation.
% See solution above
% 0.42/0.66 # SZS output end CNFRefutation
%------------------------------------------------------------------------------