%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM603+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n119.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 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 94 ( 1 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 103 ( 39 ~; 36 |; 23 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(15,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmpYFOXda/sel_theBenchmark.p_1',mZeroNum) ).
fof(16,axiom,
( aElementOf0(xi,szNzAzT0)
& equal(sdtlpdtrp0(xe,xi),xx) ),
file('/export/starexec/sandbox2/tmp/tmpYFOXda/sel_theBenchmark.p_1',m__5034) ).
fof(19,conjecture,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
file('/export/starexec/sandbox2/tmp/tmpYFOXda/sel_theBenchmark.p_1',m__) ).
fof(64,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(X2,X1)
=> aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmpYFOXda/sel_theBenchmark.p_1',m__3754) ).
fof(71,axiom,
( aFunction0(xN)
& equal(szDzozmdt0(xN),szNzAzT0)
& equal(sdtlpdtrp0(xN,sz00),xS)
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) )
=> ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpYFOXda/sel_theBenchmark.p_1',m__3623) ).
fof(79,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlseqdt0(sz00,X1) ),
file('/export/starexec/sandbox2/tmp/tmpYFOXda/sel_theBenchmark.p_1',mZeroLess) ).
fof(101,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(assume_negation,[status(cth)],[19]) ).
fof(103,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(fof_simplification,[status(thm)],[101,theory(equality)]) ).
cnf(186,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[15]) ).
cnf(188,plain,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(199,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(split_conjunct,[status(thm)],[103]) ).
fof(417,plain,
! [X1,X2] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(X2,X1)
| aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)) ),
inference(fof_nnf,[status(thm)],[64]) ).
fof(418,plain,
! [X3,X4] :
( ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X4,szNzAzT0)
| ~ sdtlseqdt0(X4,X3)
| aSubsetOf0(sdtlpdtrp0(xN,X3),sdtlpdtrp0(xN,X4)) ),
inference(variable_rename,[status(thm)],[417]) ).
cnf(419,plain,
( aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2))
| ~ sdtlseqdt0(X2,X1)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[418]) ).
fof(442,plain,
( aFunction0(xN)
& equal(szDzozmdt0(xN),szNzAzT0)
& equal(sdtlpdtrp0(xN,sz00),xS)
& ! [X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X1))
| ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))) ) ) ),
inference(fof_nnf,[status(thm)],[71]) ).
fof(443,plain,
( aFunction0(xN)
& equal(szDzozmdt0(xN),szNzAzT0)
& equal(sdtlpdtrp0(xN,sz00),xS)
& ! [X2] :
( ~ aElementOf0(X2,szNzAzT0)
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X2))) ) ) ),
inference(variable_rename,[status(thm)],[442]) ).
fof(444,plain,
! [X2] :
( ( ~ aElementOf0(X2,szNzAzT0)
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X2))) ) )
& aFunction0(xN)
& equal(szDzozmdt0(xN),szNzAzT0)
& equal(sdtlpdtrp0(xN,sz00),xS) ),
inference(shift_quantors,[status(thm)],[443]) ).
fof(445,plain,
! [X2] :
( ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ~ aElementOf0(X2,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X2)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ~ aElementOf0(X2,szNzAzT0) )
& aFunction0(xN)
& equal(szDzozmdt0(xN),szNzAzT0)
& equal(sdtlpdtrp0(xN,sz00),xS) ),
inference(distribute,[status(thm)],[444]) ).
cnf(446,plain,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[445]) ).
fof(479,plain,
! [X1] :
( ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(sz00,X1) ),
inference(fof_nnf,[status(thm)],[79]) ).
fof(480,plain,
! [X2] :
( ~ aElementOf0(X2,szNzAzT0)
| sdtlseqdt0(sz00,X2) ),
inference(variable_rename,[status(thm)],[479]) ).
cnf(481,plain,
( sdtlseqdt0(sz00,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[480]) ).
cnf(933,plain,
( aSubsetOf0(sdtlpdtrp0(xN,X1),xS)
| ~ sdtlseqdt0(sz00,X1)
| ~ aElementOf0(sz00,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[419,446,theory(equality)]) ).
cnf(941,plain,
( aSubsetOf0(sdtlpdtrp0(xN,X1),xS)
| ~ sdtlseqdt0(sz00,X1)
| $false
| ~ aElementOf0(X1,szNzAzT0) ),
inference(rw,[status(thm)],[933,186,theory(equality)]) ).
cnf(942,plain,
( aSubsetOf0(sdtlpdtrp0(xN,X1),xS)
| ~ sdtlseqdt0(sz00,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[941,theory(equality)]) ).
cnf(2530,plain,
( aSubsetOf0(sdtlpdtrp0(xN,X1),xS)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(csr,[status(thm)],[942,481]) ).
cnf(2532,plain,
~ aElementOf0(xi,szNzAzT0),
inference(spm,[status(thm)],[199,2530,theory(equality)]) ).
cnf(2548,plain,
$false,
inference(rw,[status(thm)],[2532,188,theory(equality)]) ).
cnf(2549,plain,
$false,
inference(cn,[status(thm)],[2548,theory(equality)]) ).
cnf(2550,plain,
$false,
2549,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM603+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.23 % Computer : n119.star.cs.uiowa.edu
% 0.03/0.23 % Model : x86_64 x86_64
% 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23 % Memory : 32218.625MB
% 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.23 % CPULimit : 300
% 0.03/0.23 % DateTime : Fri Jan 5 10:24:15 CST 2018
% 0.03/0.23 % CPUTime :
% 0.07/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.27 --creating new selector for []
% 0.07/0.41 -running prover on /export/starexec/sandbox2/tmp/tmpYFOXda/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/tmpYFOXda/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.42 # SZS output end CNFRefutation
%------------------------------------------------------------------------------