TSTP Solution File: NUM620+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM620+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n097.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:22:01 EST 2018
% Result : Theorem 3.56s
% Output : CNFRefutation 3.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 8 unt; 0 def)
% Number of atoms : 71 ( 1 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 70 ( 20 ~; 15 |; 29 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(13,axiom,
( aFunction0(xe)
& equal(szDzozmdt0(xe),szNzAzT0)
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(sdtlpdtrp0(xe,X1),X2) )
& equal(sdtlpdtrp0(xe,X1),szmzizndt0(sdtlpdtrp0(xN,X1))) ) ) ),
file('/export/starexec/sandbox/tmp/tmpW6du78/sel_theBenchmark.p_1',m__4660) ).
fof(19,conjecture,
( ( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xm))
=> aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn))) )
& aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))) )
=> aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
file('/export/starexec/sandbox/tmp/tmpW6du78/sel_theBenchmark.p_1',m__) ).
fof(98,axiom,
( aElementOf0(xm,szNzAzT0)
& equal(xx,sdtlpdtrp0(xe,xm)) ),
file('/export/starexec/sandbox/tmp/tmpW6du78/sel_theBenchmark.p_1',m__5389) ).
fof(118,negated_conjecture,
~ ( ( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xm))
=> aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn))) )
& aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))) )
=> aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(assume_negation,[status(cth)],[19]) ).
fof(214,plain,
( aFunction0(xe)
& equal(szDzozmdt0(xe),szNzAzT0)
& ! [X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ( aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))
& ! [X2] :
( ~ aElementOf0(X2,sdtlpdtrp0(xN,X1))
| sdtlseqdt0(sdtlpdtrp0(xe,X1),X2) )
& equal(sdtlpdtrp0(xe,X1),szmzizndt0(sdtlpdtrp0(xN,X1))) ) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(215,plain,
( aFunction0(xe)
& equal(szDzozmdt0(xe),szNzAzT0)
& ! [X3] :
( ~ aElementOf0(X3,szNzAzT0)
| ( aElementOf0(sdtlpdtrp0(xe,X3),sdtlpdtrp0(xN,X3))
& ! [X4] :
( ~ aElementOf0(X4,sdtlpdtrp0(xN,X3))
| sdtlseqdt0(sdtlpdtrp0(xe,X3),X4) )
& equal(sdtlpdtrp0(xe,X3),szmzizndt0(sdtlpdtrp0(xN,X3))) ) ) ),
inference(variable_rename,[status(thm)],[214]) ).
fof(216,plain,
! [X3,X4] :
( ( ( ( ~ aElementOf0(X4,sdtlpdtrp0(xN,X3))
| sdtlseqdt0(sdtlpdtrp0(xe,X3),X4) )
& aElementOf0(sdtlpdtrp0(xe,X3),sdtlpdtrp0(xN,X3))
& equal(sdtlpdtrp0(xe,X3),szmzizndt0(sdtlpdtrp0(xN,X3))) )
| ~ aElementOf0(X3,szNzAzT0) )
& aFunction0(xe)
& equal(szDzozmdt0(xe),szNzAzT0) ),
inference(shift_quantors,[status(thm)],[215]) ).
fof(217,plain,
! [X3,X4] :
( ( ~ aElementOf0(X4,sdtlpdtrp0(xN,X3))
| sdtlseqdt0(sdtlpdtrp0(xe,X3),X4)
| ~ aElementOf0(X3,szNzAzT0) )
& ( aElementOf0(sdtlpdtrp0(xe,X3),sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( equal(sdtlpdtrp0(xe,X3),szmzizndt0(sdtlpdtrp0(xN,X3)))
| ~ aElementOf0(X3,szNzAzT0) )
& aFunction0(xe)
& equal(szDzozmdt0(xe),szNzAzT0) ),
inference(distribute,[status(thm)],[216]) ).
cnf(221,plain,
( aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[217]) ).
fof(244,negated_conjecture,
( ! [X1] :
( ~ aElementOf0(X1,sdtlpdtrp0(xN,xm))
| aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn))) )
& aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& ~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(fof_nnf,[status(thm)],[118]) ).
fof(245,negated_conjecture,
( ! [X2] :
( ~ aElementOf0(X2,sdtlpdtrp0(xN,xm))
| aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(xn))) )
& aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& ~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(variable_rename,[status(thm)],[244]) ).
fof(246,negated_conjecture,
! [X2] :
( ( ~ aElementOf0(X2,sdtlpdtrp0(xN,xm))
| aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(xn))) )
& aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& ~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(shift_quantors,[status(thm)],[245]) ).
cnf(247,negated_conjecture,
~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(split_conjunct,[status(thm)],[246]) ).
cnf(249,negated_conjecture,
( aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xm)) ),
inference(split_conjunct,[status(thm)],[246]) ).
cnf(672,plain,
xx = sdtlpdtrp0(xe,xm),
inference(split_conjunct,[status(thm)],[98]) ).
cnf(673,plain,
aElementOf0(xm,szNzAzT0),
inference(split_conjunct,[status(thm)],[98]) ).
cnf(5630,plain,
aElementOf0(sdtlpdtrp0(xe,xm),sdtlpdtrp0(xN,xm)),
inference(spm,[status(thm)],[221,673,theory(equality)]) ).
cnf(5636,plain,
aElementOf0(xx,sdtlpdtrp0(xN,xm)),
inference(rw,[status(thm)],[5630,672,theory(equality)]) ).
cnf(29648,plain,
aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(spm,[status(thm)],[249,5636,theory(equality)]) ).
cnf(29680,plain,
$false,
inference(sr,[status(thm)],[29648,247,theory(equality)]) ).
cnf(29681,plain,
$false,
29680,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM620+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.23 % Computer : n097.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 10:50:14 CST 2018
% 0.02/0.23 % CPUTime :
% 0.07/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.28 --creating new selector for []
% 3.56/3.73 -running prover on /export/starexec/sandbox/tmp/tmpW6du78/sel_theBenchmark.p_1 with time limit 29
% 3.56/3.73 -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/tmpW6du78/sel_theBenchmark.p_1']
% 3.56/3.73 -prover status Theorem
% 3.56/3.73 Problem theBenchmark.p solved in phase 0.
% 3.56/3.73 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.56/3.73 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.56/3.73 Solved 1 out of 1.
% 3.56/3.73 # Problem is unsatisfiable (or provable), constructing proof object
% 3.56/3.73 # SZS status Theorem
% 3.56/3.73 # SZS output start CNFRefutation.
% See solution above
% 3.56/3.73 # SZS output end CNFRefutation
%------------------------------------------------------------------------------