TSTP Solution File: NUM472+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM472+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n135.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:27 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% 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(16,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& equal(sdtpldt0(X1,X3),X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpv8GjO8/sel_theBenchmark.p_1',mDefLE) ).
fof(23,axiom,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/tmp/tmpv8GjO8/sel_theBenchmark.p_1',m__1324) ).
fof(27,conjecture,
sdtlseqdt0(xm,sdtpldt0(xm,xn)),
file('/export/starexec/sandbox2/tmp/tmpv8GjO8/sel_theBenchmark.p_1',m__) ).
fof(34,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmpv8GjO8/sel_theBenchmark.p_1',mSortsB) ).
fof(40,negated_conjecture,
~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
inference(assume_negation,[status(cth)],[27]) ).
fof(41,negated_conjecture,
~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
inference(fof_simplification,[status(thm)],[40,theory(equality)]) ).
fof(108,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)],[16]) ).
fof(109,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)],[108]) ).
fof(110,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ( ( ~ sdtlseqdt0(X4,X5)
| ( aNaturalNumber0(esk2_2(X4,X5))
& equal(sdtpldt0(X4,esk2_2(X4,X5)),X5) ) )
& ( ! [X7] :
( ~ aNaturalNumber0(X7)
| ~ equal(sdtpldt0(X4,X7),X5) )
| sdtlseqdt0(X4,X5) ) ) ),
inference(skolemize,[status(esa)],[109]) ).
fof(111,plain,
! [X4,X5,X7] :
( ( ( ~ aNaturalNumber0(X7)
| ~ equal(sdtpldt0(X4,X7),X5)
| sdtlseqdt0(X4,X5) )
& ( ~ sdtlseqdt0(X4,X5)
| ( aNaturalNumber0(esk2_2(X4,X5))
& equal(sdtpldt0(X4,esk2_2(X4,X5)),X5) ) ) )
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ),
inference(shift_quantors,[status(thm)],[110]) ).
fof(112,plain,
! [X4,X5,X7] :
( ( ~ aNaturalNumber0(X7)
| ~ equal(sdtpldt0(X4,X7),X5)
| sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( aNaturalNumber0(esk2_2(X4,X5))
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( equal(sdtpldt0(X4,esk2_2(X4,X5)),X5)
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
inference(distribute,[status(thm)],[111]) ).
cnf(115,plain,
( sdtlseqdt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X2,X3) != X1
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[112]) ).
cnf(137,plain,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(138,plain,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(146,negated_conjecture,
~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
inference(split_conjunct,[status(thm)],[41]) ).
fof(169,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[34]) ).
fof(170,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[169]) ).
cnf(171,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[170]) ).
cnf(294,plain,
( sdtlseqdt0(X1,sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(er,[status(thm)],[115,theory(equality)]) ).
cnf(2210,plain,
( sdtlseqdt0(X1,sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[294,171]) ).
cnf(2211,negated_conjecture,
( ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xm) ),
inference(spm,[status(thm)],[146,2210,theory(equality)]) ).
cnf(2225,negated_conjecture,
( $false
| ~ aNaturalNumber0(xm) ),
inference(rw,[status(thm)],[2211,137,theory(equality)]) ).
cnf(2226,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[2225,138,theory(equality)]) ).
cnf(2227,negated_conjecture,
$false,
inference(cn,[status(thm)],[2226,theory(equality)]) ).
cnf(2228,negated_conjecture,
$false,
2227,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM472+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.05 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.25 % Computer : n135.star.cs.uiowa.edu
% 0.03/0.25 % Model : x86_64 x86_64
% 0.03/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.25 % Memory : 32218.625MB
% 0.03/0.25 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.25 % CPULimit : 300
% 0.03/0.25 % DateTime : Fri Jan 5 05:17:59 CST 2018
% 0.03/0.25 % CPUTime :
% 0.07/0.29 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.29 --creating new selector for []
% 0.07/0.41 -running prover on /export/starexec/sandbox2/tmp/tmpv8GjO8/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.41 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpv8GjO8/sel_theBenchmark.p_1']
% 0.07/0.41 -prover status Theorem
% 0.07/0.41 Problem theBenchmark.p solved in phase 0.
% 0.07/0.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.41 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.41 Solved 1 out of 1.
% 0.07/0.41 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.41 # SZS status Theorem
% 0.07/0.41 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.41 # SZS output end CNFRefutation
%------------------------------------------------------------------------------