TSTP Solution File: NUM612+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM612+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n081.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:59 EST 2018
% Result : Theorem 9.75s
% Output : CNFRefutation 9.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 71 ( 17 unt; 0 def)
% Number of atoms : 243 ( 16 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 267 ( 95 ~; 97 |; 64 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(19,conjecture,
( equal(szszuzczcdt0(sbrdtbr0(xP)),sbrdtbr0(xQ))
& aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmpPiKSuX/sel_theBenchmark.p_1',m__) ).
fof(26,axiom,
( aElementOf0(xp,xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> sdtlseqdt0(xp,X1) )
& equal(xp,szmzizndt0(xQ)) ),
file('/export/starexec/sandbox2/tmp/tmpPiKSuX/sel_theBenchmark.p_1',m__5147) ).
fof(39,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( ( isFinite0(X1)
& aElementOf0(X2,X1) )
=> equal(szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))),sbrdtbr0(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmpPiKSuX/sel_theBenchmark.p_1',mCardDiff) ).
fof(45,axiom,
! [X1] :
( ( aSet0(X1)
& isFinite0(X1) )
=> ! [X2] :
( aSubsetOf0(X2,X1)
=> isFinite0(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmpPiKSuX/sel_theBenchmark.p_1',mSubFSet) ).
fof(57,axiom,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmpPiKSuX/sel_theBenchmark.p_1',m__3418) ).
fof(62,axiom,
! [X1] :
( aSet0(X1)
=> ( aElementOf0(sbrdtbr0(X1),szNzAzT0)
<=> isFinite0(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmpPiKSuX/sel_theBenchmark.p_1',mCardNum) ).
fof(79,axiom,
( ! [X1] :
( aElementOf0(X1,xP)
=> aElementOf0(X1,xQ) )
& aSubsetOf0(xP,xQ) ),
file('/export/starexec/sandbox2/tmp/tmpPiKSuX/sel_theBenchmark.p_1',m__5195) ).
fof(96,axiom,
( aSet0(xP)
& ! [X1] :
( aElementOf0(X1,xQ)
=> sdtlseqdt0(szmzizndt0(xQ),X1) )
& ! [X1] :
( aElementOf0(X1,xP)
<=> ( aElement0(X1)
& aElementOf0(X1,xQ)
& ~ equal(X1,szmzizndt0(xQ)) ) )
& equal(xP,sdtmndt0(xQ,szmzizndt0(xQ))) ),
file('/export/starexec/sandbox2/tmp/tmpPiKSuX/sel_theBenchmark.p_1',m__5164) ).
fof(100,axiom,
( aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xO) )
& aSubsetOf0(xQ,xO)
& equal(sbrdtbr0(xQ),xK)
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
file('/export/starexec/sandbox2/tmp/tmpPiKSuX/sel_theBenchmark.p_1',m__5078) ).
fof(110,negated_conjecture,
~ ( equal(szszuzczcdt0(sbrdtbr0(xP)),sbrdtbr0(xQ))
& aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
inference(assume_negation,[status(cth)],[19]) ).
fof(236,negated_conjecture,
( ~ equal(szszuzczcdt0(sbrdtbr0(xP)),sbrdtbr0(xQ))
| ~ aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
inference(fof_nnf,[status(thm)],[110]) ).
cnf(237,negated_conjecture,
( ~ aElementOf0(sbrdtbr0(xP),szNzAzT0)
| szszuzczcdt0(sbrdtbr0(xP)) != sbrdtbr0(xQ) ),
inference(split_conjunct,[status(thm)],[236]) ).
fof(283,plain,
( aElementOf0(xp,xQ)
& ! [X1] :
( ~ aElementOf0(X1,xQ)
| sdtlseqdt0(xp,X1) )
& equal(xp,szmzizndt0(xQ)) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(284,plain,
( aElementOf0(xp,xQ)
& ! [X2] :
( ~ aElementOf0(X2,xQ)
| sdtlseqdt0(xp,X2) )
& equal(xp,szmzizndt0(xQ)) ),
inference(variable_rename,[status(thm)],[283]) ).
fof(285,plain,
! [X2] :
( ( ~ aElementOf0(X2,xQ)
| sdtlseqdt0(xp,X2) )
& aElementOf0(xp,xQ)
& equal(xp,szmzizndt0(xQ)) ),
inference(shift_quantors,[status(thm)],[284]) ).
cnf(286,plain,
xp = szmzizndt0(xQ),
inference(split_conjunct,[status(thm)],[285]) ).
cnf(287,plain,
aElementOf0(xp,xQ),
inference(split_conjunct,[status(thm)],[285]) ).
fof(345,plain,
! [X1] :
( ~ aSet0(X1)
| ! [X2] :
( ~ isFinite0(X1)
| ~ aElementOf0(X2,X1)
| equal(szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))),sbrdtbr0(X1)) ) ),
inference(fof_nnf,[status(thm)],[39]) ).
fof(346,plain,
! [X3] :
( ~ aSet0(X3)
| ! [X4] :
( ~ isFinite0(X3)
| ~ aElementOf0(X4,X3)
| equal(szszuzczcdt0(sbrdtbr0(sdtmndt0(X3,X4))),sbrdtbr0(X3)) ) ),
inference(variable_rename,[status(thm)],[345]) ).
fof(347,plain,
! [X3,X4] :
( ~ isFinite0(X3)
| ~ aElementOf0(X4,X3)
| equal(szszuzczcdt0(sbrdtbr0(sdtmndt0(X3,X4))),sbrdtbr0(X3))
| ~ aSet0(X3) ),
inference(shift_quantors,[status(thm)],[346]) ).
cnf(348,plain,
( szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))) = sbrdtbr0(X1)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1)
| ~ isFinite0(X1) ),
inference(split_conjunct,[status(thm)],[347]) ).
fof(365,plain,
! [X1] :
( ~ aSet0(X1)
| ~ isFinite0(X1)
| ! [X2] :
( ~ aSubsetOf0(X2,X1)
| isFinite0(X2) ) ),
inference(fof_nnf,[status(thm)],[45]) ).
fof(366,plain,
! [X3] :
( ~ aSet0(X3)
| ~ isFinite0(X3)
| ! [X4] :
( ~ aSubsetOf0(X4,X3)
| isFinite0(X4) ) ),
inference(variable_rename,[status(thm)],[365]) ).
fof(367,plain,
! [X3,X4] :
( ~ aSubsetOf0(X4,X3)
| isFinite0(X4)
| ~ aSet0(X3)
| ~ isFinite0(X3) ),
inference(shift_quantors,[status(thm)],[366]) ).
cnf(368,plain,
( isFinite0(X2)
| ~ isFinite0(X1)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[367]) ).
cnf(444,plain,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[57]) ).
fof(475,plain,
! [X1] :
( ~ aSet0(X1)
| ( ( ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| isFinite0(X1) )
& ( ~ isFinite0(X1)
| aElementOf0(sbrdtbr0(X1),szNzAzT0) ) ) ),
inference(fof_nnf,[status(thm)],[62]) ).
fof(476,plain,
! [X2] :
( ~ aSet0(X2)
| ( ( ~ aElementOf0(sbrdtbr0(X2),szNzAzT0)
| isFinite0(X2) )
& ( ~ isFinite0(X2)
| aElementOf0(sbrdtbr0(X2),szNzAzT0) ) ) ),
inference(variable_rename,[status(thm)],[475]) ).
fof(477,plain,
! [X2] :
( ( ~ aElementOf0(sbrdtbr0(X2),szNzAzT0)
| isFinite0(X2)
| ~ aSet0(X2) )
& ( ~ isFinite0(X2)
| aElementOf0(sbrdtbr0(X2),szNzAzT0)
| ~ aSet0(X2) ) ),
inference(distribute,[status(thm)],[476]) ).
cnf(478,plain,
( aElementOf0(sbrdtbr0(X1),szNzAzT0)
| ~ aSet0(X1)
| ~ isFinite0(X1) ),
inference(split_conjunct,[status(thm)],[477]) ).
cnf(479,plain,
( isFinite0(X1)
| ~ aSet0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[477]) ).
fof(594,plain,
( ! [X1] :
( ~ aElementOf0(X1,xP)
| aElementOf0(X1,xQ) )
& aSubsetOf0(xP,xQ) ),
inference(fof_nnf,[status(thm)],[79]) ).
fof(595,plain,
( ! [X2] :
( ~ aElementOf0(X2,xP)
| aElementOf0(X2,xQ) )
& aSubsetOf0(xP,xQ) ),
inference(variable_rename,[status(thm)],[594]) ).
fof(596,plain,
! [X2] :
( ( ~ aElementOf0(X2,xP)
| aElementOf0(X2,xQ) )
& aSubsetOf0(xP,xQ) ),
inference(shift_quantors,[status(thm)],[595]) ).
cnf(597,plain,
aSubsetOf0(xP,xQ),
inference(split_conjunct,[status(thm)],[596]) ).
fof(656,plain,
( aSet0(xP)
& ! [X1] :
( ~ aElementOf0(X1,xQ)
| sdtlseqdt0(szmzizndt0(xQ),X1) )
& ! [X1] :
( ( ~ aElementOf0(X1,xP)
| ( aElement0(X1)
& aElementOf0(X1,xQ)
& ~ equal(X1,szmzizndt0(xQ)) ) )
& ( ~ aElement0(X1)
| ~ aElementOf0(X1,xQ)
| equal(X1,szmzizndt0(xQ))
| aElementOf0(X1,xP) ) )
& equal(xP,sdtmndt0(xQ,szmzizndt0(xQ))) ),
inference(fof_nnf,[status(thm)],[96]) ).
fof(657,plain,
( aSet0(xP)
& ! [X2] :
( ~ aElementOf0(X2,xQ)
| sdtlseqdt0(szmzizndt0(xQ),X2) )
& ! [X3] :
( ( ~ aElementOf0(X3,xP)
| ( aElement0(X3)
& aElementOf0(X3,xQ)
& ~ equal(X3,szmzizndt0(xQ)) ) )
& ( ~ aElement0(X3)
| ~ aElementOf0(X3,xQ)
| equal(X3,szmzizndt0(xQ))
| aElementOf0(X3,xP) ) )
& equal(xP,sdtmndt0(xQ,szmzizndt0(xQ))) ),
inference(variable_rename,[status(thm)],[656]) ).
fof(658,plain,
! [X2,X3] :
( ( ~ aElementOf0(X3,xP)
| ( aElement0(X3)
& aElementOf0(X3,xQ)
& ~ equal(X3,szmzizndt0(xQ)) ) )
& ( ~ aElement0(X3)
| ~ aElementOf0(X3,xQ)
| equal(X3,szmzizndt0(xQ))
| aElementOf0(X3,xP) )
& ( ~ aElementOf0(X2,xQ)
| sdtlseqdt0(szmzizndt0(xQ),X2) )
& aSet0(xP)
& equal(xP,sdtmndt0(xQ,szmzizndt0(xQ))) ),
inference(shift_quantors,[status(thm)],[657]) ).
fof(659,plain,
! [X2,X3] :
( ( aElement0(X3)
| ~ aElementOf0(X3,xP) )
& ( aElementOf0(X3,xQ)
| ~ aElementOf0(X3,xP) )
& ( ~ equal(X3,szmzizndt0(xQ))
| ~ aElementOf0(X3,xP) )
& ( ~ aElement0(X3)
| ~ aElementOf0(X3,xQ)
| equal(X3,szmzizndt0(xQ))
| aElementOf0(X3,xP) )
& ( ~ aElementOf0(X2,xQ)
| sdtlseqdt0(szmzizndt0(xQ),X2) )
& aSet0(xP)
& equal(xP,sdtmndt0(xQ,szmzizndt0(xQ))) ),
inference(distribute,[status(thm)],[658]) ).
cnf(660,plain,
xP = sdtmndt0(xQ,szmzizndt0(xQ)),
inference(split_conjunct,[status(thm)],[659]) ).
cnf(661,plain,
aSet0(xP),
inference(split_conjunct,[status(thm)],[659]) ).
fof(4648,plain,
( aSet0(xQ)
& ! [X1] :
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,xO) )
& aSubsetOf0(xQ,xO)
& equal(sbrdtbr0(xQ),xK)
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
inference(fof_nnf,[status(thm)],[100]) ).
fof(4649,plain,
( aSet0(xQ)
& ! [X2] :
( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xO) )
& aSubsetOf0(xQ,xO)
& equal(sbrdtbr0(xQ),xK)
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
inference(variable_rename,[status(thm)],[4648]) ).
fof(4650,plain,
! [X2] :
( ( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xO) )
& aSet0(xQ)
& aSubsetOf0(xQ,xO)
& equal(sbrdtbr0(xQ),xK)
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
inference(shift_quantors,[status(thm)],[4649]) ).
cnf(4652,plain,
sbrdtbr0(xQ) = xK,
inference(split_conjunct,[status(thm)],[4650]) ).
cnf(4654,plain,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[4650]) ).
cnf(5405,plain,
sdtmndt0(xQ,xp) = xP,
inference(rw,[status(thm)],[660,286,theory(equality)]) ).
cnf(5450,negated_conjecture,
( szszuzczcdt0(sbrdtbr0(xP)) != xK
| ~ aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
inference(rw,[status(thm)],[237,4652,theory(equality)]) ).
cnf(5602,plain,
( isFinite0(xQ)
| ~ aSet0(xQ)
| ~ aElementOf0(xK,szNzAzT0) ),
inference(spm,[status(thm)],[479,4652,theory(equality)]) ).
cnf(5603,plain,
( isFinite0(xQ)
| $false
| ~ aElementOf0(xK,szNzAzT0) ),
inference(rw,[status(thm)],[5602,4654,theory(equality)]) ).
cnf(5604,plain,
( isFinite0(xQ)
| $false
| $false ),
inference(rw,[status(thm)],[5603,444,theory(equality)]) ).
cnf(5605,plain,
isFinite0(xQ),
inference(cn,[status(thm)],[5604,theory(equality)]) ).
cnf(5753,plain,
( isFinite0(xP)
| ~ isFinite0(xQ)
| ~ aSet0(xQ) ),
inference(spm,[status(thm)],[368,597,theory(equality)]) ).
cnf(5764,plain,
( isFinite0(xP)
| ~ isFinite0(xQ)
| $false ),
inference(rw,[status(thm)],[5753,4654,theory(equality)]) ).
cnf(5765,plain,
( isFinite0(xP)
| ~ isFinite0(xQ) ),
inference(cn,[status(thm)],[5764,theory(equality)]) ).
cnf(6219,plain,
( szszuzczcdt0(sbrdtbr0(sdtmndt0(xQ,xp))) = sbrdtbr0(xQ)
| ~ isFinite0(xQ)
| ~ aSet0(xQ) ),
inference(spm,[status(thm)],[348,287,theory(equality)]) ).
cnf(6236,plain,
( szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ)
| ~ isFinite0(xQ)
| ~ aSet0(xQ) ),
inference(rw,[status(thm)],[6219,5405,theory(equality)]) ).
cnf(6237,plain,
( szszuzczcdt0(sbrdtbr0(xP)) = xK
| ~ isFinite0(xQ)
| ~ aSet0(xQ) ),
inference(rw,[status(thm)],[6236,4652,theory(equality)]) ).
cnf(6238,plain,
( szszuzczcdt0(sbrdtbr0(xP)) = xK
| ~ isFinite0(xQ)
| $false ),
inference(rw,[status(thm)],[6237,4654,theory(equality)]) ).
cnf(6239,plain,
( szszuzczcdt0(sbrdtbr0(xP)) = xK
| ~ isFinite0(xQ) ),
inference(cn,[status(thm)],[6238,theory(equality)]) ).
cnf(53977,plain,
( isFinite0(xP)
| $false ),
inference(rw,[status(thm)],[5765,5605,theory(equality)]) ).
cnf(53978,plain,
isFinite0(xP),
inference(cn,[status(thm)],[53977,theory(equality)]) ).
cnf(53980,plain,
( aElementOf0(sbrdtbr0(xP),szNzAzT0)
| ~ aSet0(xP) ),
inference(spm,[status(thm)],[478,53978,theory(equality)]) ).
cnf(53983,plain,
( aElementOf0(sbrdtbr0(xP),szNzAzT0)
| $false ),
inference(rw,[status(thm)],[53980,661,theory(equality)]) ).
cnf(53984,plain,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(cn,[status(thm)],[53983,theory(equality)]) ).
cnf(54060,negated_conjecture,
( szszuzczcdt0(sbrdtbr0(xP)) != xK
| $false ),
inference(rw,[status(thm)],[5450,53984,theory(equality)]) ).
cnf(54061,negated_conjecture,
szszuzczcdt0(sbrdtbr0(xP)) != xK,
inference(cn,[status(thm)],[54060,theory(equality)]) ).
cnf(105107,plain,
( szszuzczcdt0(sbrdtbr0(xP)) = xK
| $false ),
inference(rw,[status(thm)],[6239,5605,theory(equality)]) ).
cnf(105108,plain,
szszuzczcdt0(sbrdtbr0(xP)) = xK,
inference(cn,[status(thm)],[105107,theory(equality)]) ).
cnf(105109,plain,
$false,
inference(sr,[status(thm)],[105108,54061,theory(equality)]) ).
cnf(105110,plain,
$false,
105109,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.04 % Problem : NUM612+3 : TPTP v7.0.0. Released v4.0.0.
% 0.01/0.05 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.24 % Computer : n081.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 10:39:15 CST 2018
% 0.03/0.24 % CPUTime :
% 0.07/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.28 --creating new selector for []
% 9.75/10.05 -running prover on /export/starexec/sandbox2/tmp/tmpPiKSuX/sel_theBenchmark.p_1 with time limit 29
% 9.75/10.05 -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/tmpPiKSuX/sel_theBenchmark.p_1']
% 9.75/10.05 -prover status Theorem
% 9.75/10.05 Problem theBenchmark.p solved in phase 0.
% 9.75/10.05 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.75/10.05 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.75/10.05 Solved 1 out of 1.
% 9.75/10.05 # Problem is unsatisfiable (or provable), constructing proof object
% 9.75/10.05 # SZS status Theorem
% 9.75/10.05 # SZS output start CNFRefutation.
% See solution above
% 9.75/10.05 # SZS output end CNFRefutation
%------------------------------------------------------------------------------