TSTP Solution File: NUM582+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM582+1 : 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:52 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 13 unt; 0 def)
% Number of atoms : 93 ( 1 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 102 ( 39 ~; 36 |; 22 &)
% ( 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 : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(X2,X1)
=> aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmpViUMd7/sel_theBenchmark.p_1',m__3754) ).
fof(12,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmpViUMd7/sel_theBenchmark.p_1',mZeroNum) ).
fof(16,conjecture,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
file('/export/starexec/sandbox2/tmp/tmpViUMd7/sel_theBenchmark.p_1',m__) ).
fof(62,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/tmpViUMd7/sel_theBenchmark.p_1',m__3623) ).
fof(68,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlseqdt0(sz00,X1) ),
file('/export/starexec/sandbox2/tmp/tmpViUMd7/sel_theBenchmark.p_1',mZeroLess) ).
fof(81,axiom,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmpViUMd7/sel_theBenchmark.p_1',m__3989) ).
fof(89,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(assume_negation,[status(cth)],[16]) ).
fof(91,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(fof_simplification,[status(thm)],[89,theory(equality)]) ).
fof(102,plain,
! [X1,X2] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(X2,X1)
| aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(103,plain,
! [X3,X4] :
( ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X4,szNzAzT0)
| ~ sdtlseqdt0(X4,X3)
| aSubsetOf0(sdtlpdtrp0(xN,X3),sdtlpdtrp0(xN,X4)) ),
inference(variable_rename,[status(thm)],[102]) ).
cnf(104,plain,
( aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2))
| ~ sdtlseqdt0(X2,X1)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[103]) ).
cnf(151,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(163,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(split_conjunct,[status(thm)],[91]) ).
fof(377,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)],[62]) ).
fof(378,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)],[377]) ).
fof(379,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)],[378]) ).
fof(380,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)],[379]) ).
cnf(381,plain,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[380]) ).
fof(406,plain,
! [X1] :
( ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(sz00,X1) ),
inference(fof_nnf,[status(thm)],[68]) ).
fof(407,plain,
! [X2] :
( ~ aElementOf0(X2,szNzAzT0)
| sdtlseqdt0(sz00,X2) ),
inference(variable_rename,[status(thm)],[406]) ).
cnf(408,plain,
( sdtlseqdt0(sz00,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[407]) ).
cnf(457,plain,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[81]) ).
cnf(747,plain,
( aSubsetOf0(sdtlpdtrp0(xN,X1),xS)
| ~ sdtlseqdt0(sz00,X1)
| ~ aElementOf0(sz00,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[104,381,theory(equality)]) ).
cnf(755,plain,
( aSubsetOf0(sdtlpdtrp0(xN,X1),xS)
| ~ sdtlseqdt0(sz00,X1)
| $false
| ~ aElementOf0(X1,szNzAzT0) ),
inference(rw,[status(thm)],[747,151,theory(equality)]) ).
cnf(756,plain,
( aSubsetOf0(sdtlpdtrp0(xN,X1),xS)
| ~ sdtlseqdt0(sz00,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[755,theory(equality)]) ).
cnf(1807,plain,
( aSubsetOf0(sdtlpdtrp0(xN,X1),xS)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(csr,[status(thm)],[756,408]) ).
cnf(1809,plain,
~ aElementOf0(xi,szNzAzT0),
inference(spm,[status(thm)],[163,1807,theory(equality)]) ).
cnf(1824,plain,
$false,
inference(rw,[status(thm)],[1809,457,theory(equality)]) ).
cnf(1825,plain,
$false,
inference(cn,[status(thm)],[1824,theory(equality)]) ).
cnf(1826,plain,
$false,
1825,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM582+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.24 % Computer : n140.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 09:56:45 CST 2018
% 0.03/0.24 % CPUTime :
% 0.06/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.28 --creating new selector for []
% 0.06/0.40 -running prover on /export/starexec/sandbox2/tmp/tmpViUMd7/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.40 -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/tmpViUMd7/sel_theBenchmark.p_1']
% 0.06/0.40 -prover status Theorem
% 0.06/0.40 Problem theBenchmark.p solved in phase 0.
% 0.06/0.40 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.40 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.40 Solved 1 out of 1.
% 0.06/0.40 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.40 # SZS status Theorem
% 0.06/0.40 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.40 # SZS output end CNFRefutation
%------------------------------------------------------------------------------