%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM590+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n140.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:54 EST 2018
% Result : Theorem 3.99s
% Output : CNFRefutation 3.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 8 unt; 0 def)
% Number of atoms : 131 ( 0 equ)
% Maximal formula atoms : 16 ( 5 avg)
% Number of connectives : 151 ( 46 ~; 39 |; 60 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 22 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aSet0(xY)
& ! [X1] :
( aElementOf0(X1,xY)
<=> ( aElement0(X1)
& aElementOf0(X1,sdtlpdtrp0(xN,xi))
& ~ equal(X1,szmzizndt0(sdtlpdtrp0(xN,xi))) ) )
& equal(xY,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& equal(xd,sdtlpdtrp0(xC,xi)) ),
file('/export/starexec/sandbox2/tmp/tmpeUauYu/sel_theBenchmark.p_1',m__4448_02) ).
fof(6,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aSet0(sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> aElementOf0(X2,szNzAzT0) )
& aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmpeUauYu/sel_theBenchmark.p_1',m__3671) ).
fof(16,conjecture,
( ! [X1] :
( aElementOf0(X1,xY)
=> aElementOf0(X1,szNzAzT0) )
| aSubsetOf0(xY,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmpeUauYu/sel_theBenchmark.p_1',m__) ).
fof(79,axiom,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmpeUauYu/sel_theBenchmark.p_1',m__4448) ).
fof(93,negated_conjecture,
~ ( ! [X1] :
( aElementOf0(X1,xY)
=> aElementOf0(X1,szNzAzT0) )
| aSubsetOf0(xY,szNzAzT0) ),
inference(assume_negation,[status(cth)],[16]) ).
fof(108,plain,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( ~ aElementOf0(X1,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aSet0(xY)
& ! [X1] :
( ( ~ aElementOf0(X1,xY)
| ( aElement0(X1)
& aElementOf0(X1,sdtlpdtrp0(xN,xi))
& ~ equal(X1,szmzizndt0(sdtlpdtrp0(xN,xi))) ) )
& ( ~ aElement0(X1)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xi))
| equal(X1,szmzizndt0(sdtlpdtrp0(xN,xi)))
| aElementOf0(X1,xY) ) )
& equal(xY,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& equal(xd,sdtlpdtrp0(xC,xi)) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(109,plain,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X2] :
( ~ aElementOf0(X2,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X2) )
& aSet0(xY)
& ! [X3] :
( ( ~ aElementOf0(X3,xY)
| ( aElement0(X3)
& aElementOf0(X3,sdtlpdtrp0(xN,xi))
& ~ equal(X3,szmzizndt0(sdtlpdtrp0(xN,xi))) ) )
& ( ~ aElement0(X3)
| ~ aElementOf0(X3,sdtlpdtrp0(xN,xi))
| equal(X3,szmzizndt0(sdtlpdtrp0(xN,xi)))
| aElementOf0(X3,xY) ) )
& equal(xY,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& equal(xd,sdtlpdtrp0(xC,xi)) ),
inference(variable_rename,[status(thm)],[108]) ).
fof(110,plain,
! [X2,X3] :
( ( ~ aElementOf0(X3,xY)
| ( aElement0(X3)
& aElementOf0(X3,sdtlpdtrp0(xN,xi))
& ~ equal(X3,szmzizndt0(sdtlpdtrp0(xN,xi))) ) )
& ( ~ aElement0(X3)
| ~ aElementOf0(X3,sdtlpdtrp0(xN,xi))
| equal(X3,szmzizndt0(sdtlpdtrp0(xN,xi)))
| aElementOf0(X3,xY) )
& ( ~ aElementOf0(X2,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X2) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& aSet0(xY)
& equal(xY,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& equal(xd,sdtlpdtrp0(xC,xi)) ),
inference(shift_quantors,[status(thm)],[109]) ).
fof(111,plain,
! [X2,X3] :
( ( aElement0(X3)
| ~ aElementOf0(X3,xY) )
& ( aElementOf0(X3,sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X3,xY) )
& ( ~ equal(X3,szmzizndt0(sdtlpdtrp0(xN,xi)))
| ~ aElementOf0(X3,xY) )
& ( ~ aElement0(X3)
| ~ aElementOf0(X3,sdtlpdtrp0(xN,xi))
| equal(X3,szmzizndt0(sdtlpdtrp0(xN,xi)))
| aElementOf0(X3,xY) )
& ( ~ aElementOf0(X2,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X2) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& aSet0(xY)
& equal(xY,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& equal(xd,sdtlpdtrp0(xC,xi)) ),
inference(distribute,[status(thm)],[110]) ).
cnf(119,plain,
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X1,xY) ),
inference(split_conjunct,[status(thm)],[111]) ).
fof(146,plain,
! [X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ( aSet0(sdtlpdtrp0(xN,X1))
& ! [X2] :
( ~ aElementOf0(X2,sdtlpdtrp0(xN,X1))
| aElementOf0(X2,szNzAzT0) )
& aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(147,plain,
! [X3] :
( ~ aElementOf0(X3,szNzAzT0)
| ( aSet0(sdtlpdtrp0(xN,X3))
& ! [X4] :
( ~ aElementOf0(X4,sdtlpdtrp0(xN,X3))
| aElementOf0(X4,szNzAzT0) )
& aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X3)) ) ),
inference(variable_rename,[status(thm)],[146]) ).
fof(148,plain,
! [X3,X4] :
( ( ( ~ aElementOf0(X4,sdtlpdtrp0(xN,X3))
| aElementOf0(X4,szNzAzT0) )
& aSet0(sdtlpdtrp0(xN,X3))
& aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X3)) )
| ~ aElementOf0(X3,szNzAzT0) ),
inference(shift_quantors,[status(thm)],[147]) ).
fof(149,plain,
! [X3,X4] :
( ( ~ aElementOf0(X4,sdtlpdtrp0(xN,X3))
| aElementOf0(X4,szNzAzT0)
| ~ aElementOf0(X3,szNzAzT0) )
& ( aSet0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
| ~ aElementOf0(X3,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) ) ),
inference(distribute,[status(thm)],[148]) ).
cnf(153,plain,
( aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,sdtlpdtrp0(xN,X1)) ),
inference(split_conjunct,[status(thm)],[149]) ).
fof(197,negated_conjecture,
( ? [X1] :
( aElementOf0(X1,xY)
& ~ aElementOf0(X1,szNzAzT0) )
& ~ aSubsetOf0(xY,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[93]) ).
fof(198,negated_conjecture,
( ? [X2] :
( aElementOf0(X2,xY)
& ~ aElementOf0(X2,szNzAzT0) )
& ~ aSubsetOf0(xY,szNzAzT0) ),
inference(variable_rename,[status(thm)],[197]) ).
fof(199,negated_conjecture,
( aElementOf0(esk6_0,xY)
& ~ aElementOf0(esk6_0,szNzAzT0)
& ~ aSubsetOf0(xY,szNzAzT0) ),
inference(skolemize,[status(esa)],[198]) ).
cnf(201,negated_conjecture,
~ aElementOf0(esk6_0,szNzAzT0),
inference(split_conjunct,[status(thm)],[199]) ).
cnf(202,negated_conjecture,
aElementOf0(esk6_0,xY),
inference(split_conjunct,[status(thm)],[199]) ).
cnf(525,plain,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[79]) ).
cnf(5253,negated_conjecture,
aElementOf0(esk6_0,sdtlpdtrp0(xN,xi)),
inference(spm,[status(thm)],[119,202,theory(equality)]) ).
cnf(5324,plain,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xi)) ),
inference(spm,[status(thm)],[153,525,theory(equality)]) ).
cnf(36338,negated_conjecture,
aElementOf0(esk6_0,szNzAzT0),
inference(spm,[status(thm)],[5324,5253,theory(equality)]) ).
cnf(36346,negated_conjecture,
$false,
inference(sr,[status(thm)],[36338,201,theory(equality)]) ).
cnf(36347,negated_conjecture,
$false,
36346,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM590+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.05 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.24 % Computer : n140.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 11:18:30 CST 2018
% 0.02/0.24 % CPUTime :
% 0.02/0.29 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.29 --creating new selector for []
% 3.99/4.25 -running prover on /export/starexec/sandbox2/tmp/tmpeUauYu/sel_theBenchmark.p_1 with time limit 29
% 3.99/4.25 -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/tmpeUauYu/sel_theBenchmark.p_1']
% 3.99/4.25 -prover status Theorem
% 3.99/4.25 Problem theBenchmark.p solved in phase 0.
% 3.99/4.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.99/4.25 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.99/4.25 Solved 1 out of 1.
% 3.99/4.25 # Problem is unsatisfiable (or provable), constructing proof object
% 3.99/4.25 # SZS status Theorem
% 3.99/4.25 # SZS output start CNFRefutation.
% See solution above
% 3.99/4.25 # SZS output end CNFRefutation
%------------------------------------------------------------------------------