TSTP Solution File: NUM489+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM489+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n060.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.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 12 unt; 0 def)
% Number of atoms : 91 ( 14 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 116 ( 49 ~; 52 |; 12 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
equal(xr,sdtmndt0(xn,xp)),
file('/export/starexec/sandbox/tmp/tmptc77qF/sel_theBenchmark.p_1',m__1883) ).
fof(15,axiom,
sdtlseqdt0(xp,xn),
file('/export/starexec/sandbox/tmp/tmptc77qF/sel_theBenchmark.p_1',m__1870) ).
fof(17,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/tmp/tmptc77qF/sel_theBenchmark.p_1',m__1837) ).
fof(30,conjecture,
equal(xn,sdtpldt0(xp,xr)),
file('/export/starexec/sandbox/tmp/tmptc77qF/sel_theBenchmark.p_1',m__) ).
fof(34,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
=> ! [X3] :
( equal(X3,sdtmndt0(X2,X1))
<=> ( aNaturalNumber0(X3)
& equal(sdtpldt0(X1,X3),X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmptc77qF/sel_theBenchmark.p_1',mDefDiff) ).
fof(46,negated_conjecture,
~ equal(xn,sdtpldt0(xp,xr)),
inference(assume_negation,[status(cth)],[30]) ).
fof(47,negated_conjecture,
~ equal(xn,sdtpldt0(xp,xr)),
inference(fof_simplification,[status(thm)],[46,theory(equality)]) ).
cnf(55,plain,
xr = sdtmndt0(xn,xp),
inference(split_conjunct,[status(thm)],[3]) ).
cnf(101,plain,
sdtlseqdt0(xp,xn),
inference(split_conjunct,[status(thm)],[15]) ).
cnf(105,plain,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(107,plain,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(162,negated_conjecture,
xn != sdtpldt0(xp,xr),
inference(split_conjunct,[status(thm)],[47]) ).
fof(174,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X1,X2)
| ! [X3] :
( ( ~ equal(X3,sdtmndt0(X2,X1))
| ( aNaturalNumber0(X3)
& equal(sdtpldt0(X1,X3),X2) ) )
& ( ~ aNaturalNumber0(X3)
| ~ equal(sdtpldt0(X1,X3),X2)
| equal(X3,sdtmndt0(X2,X1)) ) ) ),
inference(fof_nnf,[status(thm)],[34]) ).
fof(175,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ sdtlseqdt0(X4,X5)
| ! [X6] :
( ( ~ equal(X6,sdtmndt0(X5,X4))
| ( aNaturalNumber0(X6)
& equal(sdtpldt0(X4,X6),X5) ) )
& ( ~ aNaturalNumber0(X6)
| ~ equal(sdtpldt0(X4,X6),X5)
| equal(X6,sdtmndt0(X5,X4)) ) ) ),
inference(variable_rename,[status(thm)],[174]) ).
fof(176,plain,
! [X4,X5,X6] :
( ( ( ~ equal(X6,sdtmndt0(X5,X4))
| ( aNaturalNumber0(X6)
& equal(sdtpldt0(X4,X6),X5) ) )
& ( ~ aNaturalNumber0(X6)
| ~ equal(sdtpldt0(X4,X6),X5)
| equal(X6,sdtmndt0(X5,X4)) ) )
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ),
inference(shift_quantors,[status(thm)],[175]) ).
fof(177,plain,
! [X4,X5,X6] :
( ( aNaturalNumber0(X6)
| ~ equal(X6,sdtmndt0(X5,X4))
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( equal(sdtpldt0(X4,X6),X5)
| ~ equal(X6,sdtmndt0(X5,X4))
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( ~ aNaturalNumber0(X6)
| ~ equal(sdtpldt0(X4,X6),X5)
| equal(X6,sdtmndt0(X5,X4))
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
inference(distribute,[status(thm)],[176]) ).
cnf(179,plain,
( sdtpldt0(X2,X3) = X1
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X1)
| X3 != sdtmndt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[177]) ).
cnf(481,plain,
( sdtpldt0(xp,X1) = xn
| xr != X1
| ~ sdtlseqdt0(xp,xn)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn) ),
inference(spm,[status(thm)],[179,55,theory(equality)]) ).
cnf(482,plain,
( sdtpldt0(xp,X1) = xn
| xr != X1
| $false
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn) ),
inference(rw,[status(thm)],[481,101,theory(equality)]) ).
cnf(483,plain,
( sdtpldt0(xp,X1) = xn
| xr != X1
| $false
| $false
| ~ aNaturalNumber0(xn) ),
inference(rw,[status(thm)],[482,105,theory(equality)]) ).
cnf(484,plain,
( sdtpldt0(xp,X1) = xn
| xr != X1
| $false
| $false
| $false ),
inference(rw,[status(thm)],[483,107,theory(equality)]) ).
cnf(485,plain,
( sdtpldt0(xp,X1) = xn
| xr != X1 ),
inference(cn,[status(thm)],[484,theory(equality)]) ).
cnf(911,plain,
$false,
inference(spm,[status(thm)],[162,485,theory(equality)]) ).
cnf(933,plain,
$false,
911,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM489+1 : 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 : n060.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 : Mon Jan 8 10:25:27 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.28 --creating new selector for []
% 0.07/0.37 -running prover on /export/starexec/sandbox/tmp/tmptc77qF/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.37 -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/tmptc77qF/sel_theBenchmark.p_1']
% 0.07/0.37 -prover status Theorem
% 0.07/0.37 Problem theBenchmark.p solved in phase 0.
% 0.07/0.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.37 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.37 Solved 1 out of 1.
% 0.07/0.37 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.37 # SZS status Theorem
% 0.07/0.37 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.37 # SZS output end CNFRefutation
%------------------------------------------------------------------------------