TSTP Solution File: NUM464+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM464+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n064.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:26 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 10 unt; 0 def)
% Number of atoms : 63 ( 10 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 59 ( 23 ~; 25 |; 7 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 9 ( 0 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(14,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( equal(X1,sz00)
| equal(X1,sz10)
| ( ~ equal(sz10,X1)
& sdtlseqdt0(sz10,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmpZAyHbN/sel_theBenchmark.p_1',mLENTr) ).
fof(15,axiom,
( aNaturalNumber0(sz10)
& ~ equal(sz10,sz00) ),
file('/export/starexec/sandbox/tmp/tmpZAyHbN/sel_theBenchmark.p_1',mSortsC_01) ).
fof(16,conjecture,
( ~ equal(xm,sz00)
=> sdtlseqdt0(sz10,xm) ),
file('/export/starexec/sandbox/tmp/tmpZAyHbN/sel_theBenchmark.p_1',m__) ).
fof(17,axiom,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/tmp/tmpZAyHbN/sel_theBenchmark.p_1',m__987) ).
fof(20,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> sdtlseqdt0(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmpZAyHbN/sel_theBenchmark.p_1',mLERefl) ).
fof(29,negated_conjecture,
~ ( ~ equal(xm,sz00)
=> sdtlseqdt0(sz10,xm) ),
inference(assume_negation,[status(cth)],[16]) ).
fof(92,plain,
! [X1] :
( ~ aNaturalNumber0(X1)
| equal(X1,sz00)
| equal(X1,sz10)
| ( ~ equal(sz10,X1)
& sdtlseqdt0(sz10,X1) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(93,plain,
! [X2] :
( ~ aNaturalNumber0(X2)
| equal(X2,sz00)
| equal(X2,sz10)
| ( ~ equal(sz10,X2)
& sdtlseqdt0(sz10,X2) ) ),
inference(variable_rename,[status(thm)],[92]) ).
fof(94,plain,
! [X2] :
( ( ~ equal(sz10,X2)
| equal(X2,sz00)
| equal(X2,sz10)
| ~ aNaturalNumber0(X2) )
& ( sdtlseqdt0(sz10,X2)
| equal(X2,sz00)
| equal(X2,sz10)
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[93]) ).
cnf(95,plain,
( X1 = sz10
| X1 = sz00
| sdtlseqdt0(sz10,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[94]) ).
cnf(98,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[15]) ).
fof(99,negated_conjecture,
( ~ equal(xm,sz00)
& ~ sdtlseqdt0(sz10,xm) ),
inference(fof_nnf,[status(thm)],[29]) ).
cnf(100,negated_conjecture,
~ sdtlseqdt0(sz10,xm),
inference(split_conjunct,[status(thm)],[99]) ).
cnf(101,negated_conjecture,
xm != sz00,
inference(split_conjunct,[status(thm)],[99]) ).
cnf(103,plain,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[17]) ).
fof(112,plain,
! [X1] :
( ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,X1) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(113,plain,
! [X2] :
( ~ aNaturalNumber0(X2)
| sdtlseqdt0(X2,X2) ),
inference(variable_rename,[status(thm)],[112]) ).
cnf(114,plain,
( sdtlseqdt0(X1,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[113]) ).
cnf(147,negated_conjecture,
( sz10 = xm
| sz00 = xm
| ~ aNaturalNumber0(xm) ),
inference(spm,[status(thm)],[100,95,theory(equality)]) ).
cnf(148,negated_conjecture,
( sz10 = xm
| sz00 = xm
| $false ),
inference(rw,[status(thm)],[147,103,theory(equality)]) ).
cnf(149,negated_conjecture,
( sz10 = xm
| sz00 = xm ),
inference(cn,[status(thm)],[148,theory(equality)]) ).
cnf(150,negated_conjecture,
xm = sz10,
inference(sr,[status(thm)],[149,101,theory(equality)]) ).
cnf(622,negated_conjecture,
~ sdtlseqdt0(sz10,sz10),
inference(rw,[status(thm)],[100,150,theory(equality)]) ).
cnf(630,negated_conjecture,
~ aNaturalNumber0(sz10),
inference(spm,[status(thm)],[622,114,theory(equality)]) ).
cnf(632,negated_conjecture,
$false,
inference(rw,[status(thm)],[630,98,theory(equality)]) ).
cnf(633,negated_conjecture,
$false,
inference(cn,[status(thm)],[632,theory(equality)]) ).
cnf(634,negated_conjecture,
$false,
633,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM464+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 : n064.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.06/0.26 % DateTime : Fri Jan 5 04:43:45 CST 2018
% 0.06/0.26 % CPUTime :
% 0.06/0.30 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.30 --creating new selector for []
% 0.06/0.37 -running prover on /export/starexec/sandbox/tmp/tmpZAyHbN/sel_theBenchmark.p_1 with time limit 29
% 0.06/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/tmpZAyHbN/sel_theBenchmark.p_1']
% 0.06/0.37 -prover status Theorem
% 0.06/0.37 Problem theBenchmark.p solved in phase 0.
% 0.06/0.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.37 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.37 Solved 1 out of 1.
% 0.06/0.37 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.37 # SZS status Theorem
% 0.06/0.37 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.37 # SZS output end CNFRefutation
%------------------------------------------------------------------------------