TSTP Solution File: NUM604+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM604+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n068.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:57 EST 2018
% Result : Theorem 4.02s
% Output : CNFRefutation 4.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 11 unt; 0 def)
% Number of atoms : 66 ( 1 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 61 ( 18 ~; 15 |; 25 &)
% ( 0 <=>; 3 =>; 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 : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 14 !; 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/tmpTby2Qu/sel_theBenchmark.p_1',m__4660) ).
fof(16,axiom,
( aElementOf0(xi,szNzAzT0)
& equal(sdtlpdtrp0(xe,xi),xx) ),
file('/export/starexec/sandbox/tmp/tmpTby2Qu/sel_theBenchmark.p_1',m__5034) ).
fof(19,conjecture,
aElementOf0(xx,xS),
file('/export/starexec/sandbox/tmp/tmpTby2Qu/sel_theBenchmark.p_1',m__) ).
fof(31,axiom,
( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> aElementOf0(X1,xS) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
file('/export/starexec/sandbox/tmp/tmpTby2Qu/sel_theBenchmark.p_1',m__5045) ).
fof(102,negated_conjecture,
~ aElementOf0(xx,xS),
inference(assume_negation,[status(cth)],[19]) ).
fof(104,negated_conjecture,
~ aElementOf0(xx,xS),
inference(fof_simplification,[status(thm)],[102,theory(equality)]) ).
fof(199,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(200,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)],[199]) ).
fof(201,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)],[200]) ).
fof(202,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)],[201]) ).
cnf(206,plain,
( aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[202]) ).
cnf(212,plain,
sdtlpdtrp0(xe,xi) = xx,
inference(split_conjunct,[status(thm)],[16]) ).
cnf(213,plain,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(224,negated_conjecture,
~ aElementOf0(xx,xS),
inference(split_conjunct,[status(thm)],[104]) ).
fof(290,plain,
( ! [X1] :
( ~ aElementOf0(X1,sdtlpdtrp0(xN,xi))
| aElementOf0(X1,xS) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(291,plain,
( ! [X2] :
( ~ aElementOf0(X2,sdtlpdtrp0(xN,xi))
| aElementOf0(X2,xS) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
inference(variable_rename,[status(thm)],[290]) ).
fof(292,plain,
! [X2] :
( ( ~ aElementOf0(X2,sdtlpdtrp0(xN,xi))
| aElementOf0(X2,xS) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
inference(shift_quantors,[status(thm)],[291]) ).
cnf(294,plain,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xi)) ),
inference(split_conjunct,[status(thm)],[292]) ).
cnf(5635,plain,
aElementOf0(sdtlpdtrp0(xe,xi),sdtlpdtrp0(xN,xi)),
inference(spm,[status(thm)],[206,213,theory(equality)]) ).
cnf(5639,plain,
aElementOf0(xx,sdtlpdtrp0(xN,xi)),
inference(rw,[status(thm)],[5635,212,theory(equality)]) ).
cnf(37497,plain,
aElementOf0(xx,xS),
inference(spm,[status(thm)],[294,5639,theory(equality)]) ).
cnf(37528,plain,
$false,
inference(sr,[status(thm)],[37497,224,theory(equality)]) ).
cnf(37529,plain,
$false,
37528,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM604+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.24 % Computer : n068.star.cs.uiowa.edu
% 0.03/0.24 % Model : x86_64 x86_64
% 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.24 % Memory : 32218.625MB
% 0.03/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.24 % CPULimit : 300
% 0.03/0.24 % DateTime : Fri Jan 5 11:18:30 CST 2018
% 0.03/0.24 % CPUTime :
% 0.03/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.28 --creating new selector for []
% 4.02/4.23 -running prover on /export/starexec/sandbox/tmp/tmpTby2Qu/sel_theBenchmark.p_1 with time limit 29
% 4.02/4.23 -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/tmpTby2Qu/sel_theBenchmark.p_1']
% 4.02/4.23 -prover status Theorem
% 4.02/4.23 Problem theBenchmark.p solved in phase 0.
% 4.02/4.23 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.02/4.23 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.02/4.23 Solved 1 out of 1.
% 4.02/4.23 # Problem is unsatisfiable (or provable), constructing proof object
% 4.02/4.23 # SZS status Theorem
% 4.02/4.23 # SZS output start CNFRefutation.
% See solution above
% 4.02/4.23 # SZS output end CNFRefutation
%------------------------------------------------------------------------------