TSTP Solution File: NUM458+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM458+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n142.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:24 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 12 unt; 0 def)
% Number of atoms : 98 ( 5 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 124 ( 54 ~; 51 |; 16 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn 21 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/tmp/tmpPN1dFA/sel_theBenchmark.p_1',mSortsC) ).
fof(5,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& equal(sdtpldt0(X1,X3),X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmpPN1dFA/sel_theBenchmark.p_1',mDefLE) ).
fof(7,axiom,
aNaturalNumber0(xm),
file('/export/starexec/sandbox/tmp/tmpPN1dFA/sel_theBenchmark.p_1',m__718) ).
fof(13,conjecture,
sdtlseqdt0(xm,xm),
file('/export/starexec/sandbox/tmp/tmpPN1dFA/sel_theBenchmark.p_1',m__) ).
fof(14,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( equal(sdtpldt0(X1,sz00),X1)
& equal(X1,sdtpldt0(sz00,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmpPN1dFA/sel_theBenchmark.p_1',m_AddZero) ).
fof(22,negated_conjecture,
~ sdtlseqdt0(xm,xm),
inference(assume_negation,[status(cth)],[13]) ).
fof(23,negated_conjecture,
~ sdtlseqdt0(xm,xm),
inference(fof_simplification,[status(thm)],[22,theory(equality)]) ).
cnf(24,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[1]) ).
fof(36,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ( ( ~ sdtlseqdt0(X1,X2)
| ? [X3] :
( aNaturalNumber0(X3)
& equal(sdtpldt0(X1,X3),X2) ) )
& ( ! [X3] :
( ~ aNaturalNumber0(X3)
| ~ equal(sdtpldt0(X1,X3),X2) )
| sdtlseqdt0(X1,X2) ) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(37,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ( ( ~ sdtlseqdt0(X4,X5)
| ? [X6] :
( aNaturalNumber0(X6)
& equal(sdtpldt0(X4,X6),X5) ) )
& ( ! [X7] :
( ~ aNaturalNumber0(X7)
| ~ equal(sdtpldt0(X4,X7),X5) )
| sdtlseqdt0(X4,X5) ) ) ),
inference(variable_rename,[status(thm)],[36]) ).
fof(38,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ( ( ~ sdtlseqdt0(X4,X5)
| ( aNaturalNumber0(esk1_2(X4,X5))
& equal(sdtpldt0(X4,esk1_2(X4,X5)),X5) ) )
& ( ! [X7] :
( ~ aNaturalNumber0(X7)
| ~ equal(sdtpldt0(X4,X7),X5) )
| sdtlseqdt0(X4,X5) ) ) ),
inference(skolemize,[status(esa)],[37]) ).
fof(39,plain,
! [X4,X5,X7] :
( ( ( ~ aNaturalNumber0(X7)
| ~ equal(sdtpldt0(X4,X7),X5)
| sdtlseqdt0(X4,X5) )
& ( ~ sdtlseqdt0(X4,X5)
| ( aNaturalNumber0(esk1_2(X4,X5))
& equal(sdtpldt0(X4,esk1_2(X4,X5)),X5) ) ) )
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ),
inference(shift_quantors,[status(thm)],[38]) ).
fof(40,plain,
! [X4,X5,X7] :
( ( ~ aNaturalNumber0(X7)
| ~ equal(sdtpldt0(X4,X7),X5)
| sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( aNaturalNumber0(esk1_2(X4,X5))
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( equal(sdtpldt0(X4,esk1_2(X4,X5)),X5)
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
inference(distribute,[status(thm)],[39]) ).
cnf(43,plain,
( sdtlseqdt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X2,X3) != X1
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(47,plain,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(65,negated_conjecture,
~ sdtlseqdt0(xm,xm),
inference(split_conjunct,[status(thm)],[23]) ).
fof(66,plain,
! [X1] :
( ~ aNaturalNumber0(X1)
| ( equal(sdtpldt0(X1,sz00),X1)
& equal(X1,sdtpldt0(sz00,X1)) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(67,plain,
! [X2] :
( ~ aNaturalNumber0(X2)
| ( equal(sdtpldt0(X2,sz00),X2)
& equal(X2,sdtpldt0(sz00,X2)) ) ),
inference(variable_rename,[status(thm)],[66]) ).
fof(68,plain,
! [X2] :
( ( equal(sdtpldt0(X2,sz00),X2)
| ~ aNaturalNumber0(X2) )
& ( equal(X2,sdtpldt0(sz00,X2))
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[67]) ).
cnf(70,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[68]) ).
cnf(189,plain,
( sdtlseqdt0(X1,X2)
| X1 != X2
| ~ aNaturalNumber0(sz00)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(spm,[status(thm)],[43,70,theory(equality)]) ).
cnf(194,plain,
( sdtlseqdt0(X1,X2)
| X1 != X2
| $false
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(rw,[status(thm)],[189,24,theory(equality)]) ).
cnf(195,plain,
( sdtlseqdt0(X1,X2)
| X1 != X2
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(cn,[status(thm)],[194,theory(equality)]) ).
cnf(196,plain,
( sdtlseqdt0(X1,X1)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[195,theory(equality)]) ).
cnf(446,negated_conjecture,
~ aNaturalNumber0(xm),
inference(spm,[status(thm)],[65,196,theory(equality)]) ).
cnf(447,negated_conjecture,
$false,
inference(rw,[status(thm)],[446,47,theory(equality)]) ).
cnf(448,negated_conjecture,
$false,
inference(cn,[status(thm)],[447,theory(equality)]) ).
cnf(449,negated_conjecture,
$false,
448,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM458+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 : n142.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 04:31:14 CST 2018
% 0.06/0.23 % 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.35 -running prover on /export/starexec/sandbox/tmp/tmpPN1dFA/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.35 -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/tmpPN1dFA/sel_theBenchmark.p_1']
% 0.06/0.35 -prover status Theorem
% 0.06/0.35 Problem theBenchmark.p solved in phase 0.
% 0.06/0.35 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.35 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.35 Solved 1 out of 1.
% 0.06/0.35 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.35 # SZS status Theorem
% 0.06/0.35 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.36 # SZS output end CNFRefutation
%------------------------------------------------------------------------------