TSTP Solution File: NUM505+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM505+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n035.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:35 EST 2018
% Result : Theorem 0.33s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 109 ( 6 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 131 ( 53 ~; 47 |; 27 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 19 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(14,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
| ( ~ equal(X2,X1)
& sdtlseqdt0(X2,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmptkMSPf/sel_theBenchmark.p_1',mLETotal) ).
fof(20,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox2/tmp/tmptkMSPf/sel_theBenchmark.p_1',m__1837) ).
fof(32,conjecture,
( ~ ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xp,X1),xk) )
| sdtlseqdt0(xp,xk) )
=> ( ~ equal(xk,xp)
& ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xk,X1),xp) )
| sdtlseqdt0(xk,xp) ) ) ),
file('/export/starexec/sandbox2/tmp/tmptkMSPf/sel_theBenchmark.p_1',m__) ).
fof(35,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> sdtlseqdt0(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmptkMSPf/sel_theBenchmark.p_1',mLERefl) ).
fof(44,axiom,
( aNaturalNumber0(xk)
& equal(sdtasdt0(xn,xm),sdtasdt0(xp,xk))
& equal(xk,sdtsldt0(sdtasdt0(xn,xm),xp)) ),
file('/export/starexec/sandbox2/tmp/tmptkMSPf/sel_theBenchmark.p_1',m__2306) ).
fof(51,negated_conjecture,
~ ( ~ ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xp,X1),xk) )
| sdtlseqdt0(xp,xk) )
=> ( ~ equal(xk,xp)
& ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xk,X1),xp) )
| sdtlseqdt0(xk,xp) ) ) ),
inference(assume_negation,[status(cth)],[32]) ).
fof(251,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtlseqdt0(X1,X2)
| ( ~ equal(X2,X1)
& sdtlseqdt0(X2,X1) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(252,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| sdtlseqdt0(X3,X4)
| ( ~ equal(X4,X3)
& sdtlseqdt0(X4,X3) ) ),
inference(variable_rename,[status(thm)],[251]) ).
fof(253,plain,
! [X3,X4] :
( ( ~ equal(X4,X3)
| sdtlseqdt0(X3,X4)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4) )
& ( sdtlseqdt0(X4,X3)
| sdtlseqdt0(X3,X4)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4) ) ),
inference(distribute,[status(thm)],[252]) ).
cnf(254,plain,
( sdtlseqdt0(X2,X1)
| sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[253]) ).
cnf(280,plain,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[20]) ).
fof(335,negated_conjecture,
( ! [X1] :
( ~ aNaturalNumber0(X1)
| ~ equal(sdtpldt0(xp,X1),xk) )
& ~ sdtlseqdt0(xp,xk)
& ( equal(xk,xp)
| ( ! [X1] :
( ~ aNaturalNumber0(X1)
| ~ equal(sdtpldt0(xk,X1),xp) )
& ~ sdtlseqdt0(xk,xp) ) ) ),
inference(fof_nnf,[status(thm)],[51]) ).
fof(336,negated_conjecture,
( ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ equal(sdtpldt0(xp,X2),xk) )
& ~ sdtlseqdt0(xp,xk)
& ( equal(xk,xp)
| ( ! [X3] :
( ~ aNaturalNumber0(X3)
| ~ equal(sdtpldt0(xk,X3),xp) )
& ~ sdtlseqdt0(xk,xp) ) ) ),
inference(variable_rename,[status(thm)],[335]) ).
fof(337,negated_conjecture,
! [X2,X3] :
( ( ( ( ~ aNaturalNumber0(X3)
| ~ equal(sdtpldt0(xk,X3),xp) )
& ~ sdtlseqdt0(xk,xp) )
| equal(xk,xp) )
& ( ~ aNaturalNumber0(X2)
| ~ equal(sdtpldt0(xp,X2),xk) )
& ~ sdtlseqdt0(xp,xk) ),
inference(shift_quantors,[status(thm)],[336]) ).
fof(338,negated_conjecture,
! [X2,X3] :
( ( ~ aNaturalNumber0(X3)
| ~ equal(sdtpldt0(xk,X3),xp)
| equal(xk,xp) )
& ( ~ sdtlseqdt0(xk,xp)
| equal(xk,xp) )
& ( ~ aNaturalNumber0(X2)
| ~ equal(sdtpldt0(xp,X2),xk) )
& ~ sdtlseqdt0(xp,xk) ),
inference(distribute,[status(thm)],[337]) ).
cnf(339,negated_conjecture,
~ sdtlseqdt0(xp,xk),
inference(split_conjunct,[status(thm)],[338]) ).
cnf(341,negated_conjecture,
( xk = xp
| ~ sdtlseqdt0(xk,xp) ),
inference(split_conjunct,[status(thm)],[338]) ).
fof(351,plain,
! [X1] :
( ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,X1) ),
inference(fof_nnf,[status(thm)],[35]) ).
fof(352,plain,
! [X2] :
( ~ aNaturalNumber0(X2)
| sdtlseqdt0(X2,X2) ),
inference(variable_rename,[status(thm)],[351]) ).
cnf(353,plain,
( sdtlseqdt0(X1,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[352]) ).
cnf(397,plain,
aNaturalNumber0(xk),
inference(split_conjunct,[status(thm)],[44]) ).
cnf(492,negated_conjecture,
( xk = xp
| sdtlseqdt0(xp,xk)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xk) ),
inference(spm,[status(thm)],[341,254,theory(equality)]) ).
cnf(494,negated_conjecture,
( xk = xp
| sdtlseqdt0(xp,xk)
| $false
| ~ aNaturalNumber0(xk) ),
inference(rw,[status(thm)],[492,280,theory(equality)]) ).
cnf(495,negated_conjecture,
( xk = xp
| sdtlseqdt0(xp,xk)
| $false
| $false ),
inference(rw,[status(thm)],[494,397,theory(equality)]) ).
cnf(496,negated_conjecture,
( xk = xp
| sdtlseqdt0(xp,xk) ),
inference(cn,[status(thm)],[495,theory(equality)]) ).
cnf(497,negated_conjecture,
xk = xp,
inference(sr,[status(thm)],[496,339,theory(equality)]) ).
cnf(7626,negated_conjecture,
~ sdtlseqdt0(xp,xp),
inference(rw,[status(thm)],[339,497,theory(equality)]) ).
cnf(7633,negated_conjecture,
~ aNaturalNumber0(xp),
inference(spm,[status(thm)],[7626,353,theory(equality)]) ).
cnf(7634,negated_conjecture,
$false,
inference(rw,[status(thm)],[7633,280,theory(equality)]) ).
cnf(7635,negated_conjecture,
$false,
inference(cn,[status(thm)],[7634,theory(equality)]) ).
cnf(7636,negated_conjecture,
$false,
7635,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM505+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.24 % Computer : n035.star.cs.uiowa.edu
% 0.02/0.24 % Model : x86_64 x86_64
% 0.02/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.24 % Memory : 32218.625MB
% 0.02/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.24 % CPULimit : 300
% 0.02/0.24 % DateTime : Fri Jan 5 07:25:00 CST 2018
% 0.02/0.24 % CPUTime :
% 0.02/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.28 --creating new selector for []
% 0.33/0.93 -running prover on /export/starexec/sandbox2/tmp/tmptkMSPf/sel_theBenchmark.p_1 with time limit 29
% 0.33/0.93 -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/tmptkMSPf/sel_theBenchmark.p_1']
% 0.33/0.93 -prover status Theorem
% 0.33/0.93 Problem theBenchmark.p solved in phase 0.
% 0.33/0.93 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.33/0.93 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.33/0.93 Solved 1 out of 1.
% 0.33/0.93 # Problem is unsatisfiable (or provable), constructing proof object
% 0.33/0.93 # SZS status Theorem
% 0.33/0.93 # SZS output start CNFRefutation.
% See solution above
% 0.33/0.93 # SZS output end CNFRefutation
%------------------------------------------------------------------------------