TSTP Solution File: NUM609+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM609+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n142.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:58 EST 2018
% Result : Theorem 0.41s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 10
% Syntax : Number of formulae : 59 ( 20 unt; 0 def)
% Number of atoms : 307 ( 4 equ)
% Maximal formula atoms : 52 ( 5 avg)
% Number of connectives : 405 ( 157 ~; 177 |; 63 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 76 ( 0 sgn 50 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmpo4Qm4l/sel_theBenchmark.p_1',mDefSub) ).
fof(11,axiom,
( aSet0(xO)
& equal(xO,sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))) ),
file('/export/starexec/sandbox/tmp/tmpo4Qm4l/sel_theBenchmark.p_1',m__4891) ).
fof(19,conjecture,
aSubsetOf0(xP,xQ),
file('/export/starexec/sandbox/tmp/tmpo4Qm4l/sel_theBenchmark.p_1',m__) ).
fof(26,axiom,
equal(xp,szmzizndt0(xQ)),
file('/export/starexec/sandbox/tmp/tmpo4Qm4l/sel_theBenchmark.p_1',m__5147) ).
fof(30,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/tmp/tmpo4Qm4l/sel_theBenchmark.p_1',mEOfElem) ).
fof(32,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElement0(X2) )
=> ! [X3] :
( equal(X3,sdtmndt0(X1,X2))
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aElement0(X4)
& aElementOf0(X4,X1)
& ~ equal(X4,X2) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmpo4Qm4l/sel_theBenchmark.p_1',mDefDiff) ).
fof(65,axiom,
aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox/tmp/tmpo4Qm4l/sel_theBenchmark.p_1',m__5106) ).
fof(86,axiom,
aElementOf0(xp,xO),
file('/export/starexec/sandbox/tmp/tmpo4Qm4l/sel_theBenchmark.p_1',m__5182) ).
fof(87,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox/tmp/tmpo4Qm4l/sel_theBenchmark.p_1',mNATSet) ).
fof(95,axiom,
( aSet0(xP)
& equal(xP,sdtmndt0(xQ,szmzizndt0(xQ))) ),
file('/export/starexec/sandbox/tmp/tmpo4Qm4l/sel_theBenchmark.p_1',m__5164) ).
fof(108,negated_conjecture,
~ aSubsetOf0(xP,xQ),
inference(assume_negation,[status(cth)],[19]) ).
fof(110,negated_conjecture,
~ aSubsetOf0(xP,xQ),
inference(fof_simplification,[status(thm)],[108,theory(equality)]) ).
fof(148,plain,
! [X1] :
( ~ aSet0(X1)
| ! [X2] :
( ( ~ aSubsetOf0(X2,X1)
| ( aSet0(X2)
& ! [X3] :
( ~ aElementOf0(X3,X2)
| aElementOf0(X3,X1) ) ) )
& ( ~ aSet0(X2)
| ? [X3] :
( aElementOf0(X3,X2)
& ~ aElementOf0(X3,X1) )
| aSubsetOf0(X2,X1) ) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(149,plain,
! [X4] :
( ~ aSet0(X4)
| ! [X5] :
( ( ~ aSubsetOf0(X5,X4)
| ( aSet0(X5)
& ! [X6] :
( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) ) ) )
& ( ~ aSet0(X5)
| ? [X7] :
( aElementOf0(X7,X5)
& ~ aElementOf0(X7,X4) )
| aSubsetOf0(X5,X4) ) ) ),
inference(variable_rename,[status(thm)],[148]) ).
fof(150,plain,
! [X4] :
( ~ aSet0(X4)
| ! [X5] :
( ( ~ aSubsetOf0(X5,X4)
| ( aSet0(X5)
& ! [X6] :
( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) ) ) )
& ( ~ aSet0(X5)
| ( aElementOf0(esk2_2(X4,X5),X5)
& ~ aElementOf0(esk2_2(X4,X5),X4) )
| aSubsetOf0(X5,X4) ) ) ),
inference(skolemize,[status(esa)],[149]) ).
fof(151,plain,
! [X4,X5,X6] :
( ( ( ( ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) )
& aSet0(X5) )
| ~ aSubsetOf0(X5,X4) )
& ( ~ aSet0(X5)
| ( aElementOf0(esk2_2(X4,X5),X5)
& ~ aElementOf0(esk2_2(X4,X5),X4) )
| aSubsetOf0(X5,X4) ) )
| ~ aSet0(X4) ),
inference(shift_quantors,[status(thm)],[150]) ).
fof(152,plain,
! [X4,X5,X6] :
( ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aSet0(X5)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aElementOf0(esk2_2(X4,X5),X5)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(esk2_2(X4,X5),X4)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) ) ),
inference(distribute,[status(thm)],[151]) ).
cnf(153,plain,
( aSubsetOf0(X2,X1)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[152]) ).
cnf(154,plain,
( aSubsetOf0(X2,X1)
| aElementOf0(esk2_2(X1,X2),X2)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[152]) ).
cnf(155,plain,
( aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[152]) ).
cnf(174,plain,
aSet0(xO),
inference(split_conjunct,[status(thm)],[11]) ).
cnf(206,negated_conjecture,
~ aSubsetOf0(xP,xQ),
inference(split_conjunct,[status(thm)],[110]) ).
cnf(237,plain,
xp = szmzizndt0(xQ),
inference(split_conjunct,[status(thm)],[26]) ).
fof(249,plain,
! [X1] :
( ~ aSet0(X1)
| ! [X2] :
( ~ aElementOf0(X2,X1)
| aElement0(X2) ) ),
inference(fof_nnf,[status(thm)],[30]) ).
fof(250,plain,
! [X3] :
( ~ aSet0(X3)
| ! [X4] :
( ~ aElementOf0(X4,X3)
| aElement0(X4) ) ),
inference(variable_rename,[status(thm)],[249]) ).
fof(251,plain,
! [X3,X4] :
( ~ aElementOf0(X4,X3)
| aElement0(X4)
| ~ aSet0(X3) ),
inference(shift_quantors,[status(thm)],[250]) ).
cnf(252,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[251]) ).
fof(258,plain,
! [X1,X2] :
( ~ aSet0(X1)
| ~ aElement0(X2)
| ! [X3] :
( ( ~ equal(X3,sdtmndt0(X1,X2))
| ( aSet0(X3)
& ! [X4] :
( ( ~ aElementOf0(X4,X3)
| ( aElement0(X4)
& aElementOf0(X4,X1)
& ~ equal(X4,X2) ) )
& ( ~ aElement0(X4)
| ~ aElementOf0(X4,X1)
| equal(X4,X2)
| aElementOf0(X4,X3) ) ) ) )
& ( ~ aSet0(X3)
| ? [X4] :
( ( ~ aElementOf0(X4,X3)
| ~ aElement0(X4)
| ~ aElementOf0(X4,X1)
| equal(X4,X2) )
& ( aElementOf0(X4,X3)
| ( aElement0(X4)
& aElementOf0(X4,X1)
& ~ equal(X4,X2) ) ) )
| equal(X3,sdtmndt0(X1,X2)) ) ) ),
inference(fof_nnf,[status(thm)],[32]) ).
fof(259,plain,
! [X5,X6] :
( ~ aSet0(X5)
| ~ aElement0(X6)
| ! [X7] :
( ( ~ equal(X7,sdtmndt0(X5,X6))
| ( aSet0(X7)
& ! [X8] :
( ( ~ aElementOf0(X8,X7)
| ( aElement0(X8)
& aElementOf0(X8,X5)
& ~ equal(X8,X6) ) )
& ( ~ aElement0(X8)
| ~ aElementOf0(X8,X5)
| equal(X8,X6)
| aElementOf0(X8,X7) ) ) ) )
& ( ~ aSet0(X7)
| ? [X9] :
( ( ~ aElementOf0(X9,X7)
| ~ aElement0(X9)
| ~ aElementOf0(X9,X5)
| equal(X9,X6) )
& ( aElementOf0(X9,X7)
| ( aElement0(X9)
& aElementOf0(X9,X5)
& ~ equal(X9,X6) ) ) )
| equal(X7,sdtmndt0(X5,X6)) ) ) ),
inference(variable_rename,[status(thm)],[258]) ).
fof(260,plain,
! [X5,X6] :
( ~ aSet0(X5)
| ~ aElement0(X6)
| ! [X7] :
( ( ~ equal(X7,sdtmndt0(X5,X6))
| ( aSet0(X7)
& ! [X8] :
( ( ~ aElementOf0(X8,X7)
| ( aElement0(X8)
& aElementOf0(X8,X5)
& ~ equal(X8,X6) ) )
& ( ~ aElement0(X8)
| ~ aElementOf0(X8,X5)
| equal(X8,X6)
| aElementOf0(X8,X7) ) ) ) )
& ( ~ aSet0(X7)
| ( ( ~ aElementOf0(esk9_3(X5,X6,X7),X7)
| ~ aElement0(esk9_3(X5,X6,X7))
| ~ aElementOf0(esk9_3(X5,X6,X7),X5)
| equal(esk9_3(X5,X6,X7),X6) )
& ( aElementOf0(esk9_3(X5,X6,X7),X7)
| ( aElement0(esk9_3(X5,X6,X7))
& aElementOf0(esk9_3(X5,X6,X7),X5)
& ~ equal(esk9_3(X5,X6,X7),X6) ) ) )
| equal(X7,sdtmndt0(X5,X6)) ) ) ),
inference(skolemize,[status(esa)],[259]) ).
fof(261,plain,
! [X5,X6,X7,X8] :
( ( ( ( ( ~ aElementOf0(X8,X7)
| ( aElement0(X8)
& aElementOf0(X8,X5)
& ~ equal(X8,X6) ) )
& ( ~ aElement0(X8)
| ~ aElementOf0(X8,X5)
| equal(X8,X6)
| aElementOf0(X8,X7) )
& aSet0(X7) )
| ~ equal(X7,sdtmndt0(X5,X6)) )
& ( ~ aSet0(X7)
| ( ( ~ aElementOf0(esk9_3(X5,X6,X7),X7)
| ~ aElement0(esk9_3(X5,X6,X7))
| ~ aElementOf0(esk9_3(X5,X6,X7),X5)
| equal(esk9_3(X5,X6,X7),X6) )
& ( aElementOf0(esk9_3(X5,X6,X7),X7)
| ( aElement0(esk9_3(X5,X6,X7))
& aElementOf0(esk9_3(X5,X6,X7),X5)
& ~ equal(esk9_3(X5,X6,X7),X6) ) ) )
| equal(X7,sdtmndt0(X5,X6)) ) )
| ~ aSet0(X5)
| ~ aElement0(X6) ),
inference(shift_quantors,[status(thm)],[260]) ).
fof(262,plain,
! [X5,X6,X7,X8] :
( ( aElement0(X8)
| ~ aElementOf0(X8,X7)
| ~ equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aElementOf0(X8,X5)
| ~ aElementOf0(X8,X7)
| ~ equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( ~ equal(X8,X6)
| ~ aElementOf0(X8,X7)
| ~ equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( ~ aElement0(X8)
| ~ aElementOf0(X8,X5)
| equal(X8,X6)
| aElementOf0(X8,X7)
| ~ equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aSet0(X7)
| ~ equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( ~ aElementOf0(esk9_3(X5,X6,X7),X7)
| ~ aElement0(esk9_3(X5,X6,X7))
| ~ aElementOf0(esk9_3(X5,X6,X7),X5)
| equal(esk9_3(X5,X6,X7),X6)
| ~ aSet0(X7)
| equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aElement0(esk9_3(X5,X6,X7))
| aElementOf0(esk9_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aElementOf0(esk9_3(X5,X6,X7),X5)
| aElementOf0(esk9_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( ~ equal(esk9_3(X5,X6,X7),X6)
| aElementOf0(esk9_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) ) ),
inference(distribute,[status(thm)],[261]) ).
cnf(270,plain,
( aElementOf0(X4,X2)
| ~ aElement0(X1)
| ~ aSet0(X2)
| X3 != sdtmndt0(X2,X1)
| ~ aElementOf0(X4,X3) ),
inference(split_conjunct,[status(thm)],[262]) ).
cnf(420,plain,
aSubsetOf0(xQ,szNzAzT0),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(497,plain,
aElementOf0(xp,xO),
inference(split_conjunct,[status(thm)],[86]) ).
cnf(499,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[87]) ).
cnf(520,plain,
xP = sdtmndt0(xQ,szmzizndt0(xQ)),
inference(split_conjunct,[status(thm)],[95]) ).
cnf(521,plain,
aSet0(xP),
inference(split_conjunct,[status(thm)],[95]) ).
cnf(579,plain,
sdtmndt0(xQ,xp) = xP,
inference(rw,[status(thm)],[520,237,theory(equality)]) ).
cnf(604,plain,
( aSet0(xQ)
| ~ aSet0(szNzAzT0) ),
inference(spm,[status(thm)],[155,420,theory(equality)]) ).
cnf(609,plain,
( aSet0(xQ)
| $false ),
inference(rw,[status(thm)],[604,499,theory(equality)]) ).
cnf(610,plain,
aSet0(xQ),
inference(cn,[status(thm)],[609,theory(equality)]) ).
cnf(658,plain,
( aElement0(xp)
| ~ aSet0(xO) ),
inference(spm,[status(thm)],[252,497,theory(equality)]) ).
cnf(668,plain,
( aElement0(xp)
| $false ),
inference(rw,[status(thm)],[658,174,theory(equality)]) ).
cnf(669,plain,
aElement0(xp),
inference(cn,[status(thm)],[668,theory(equality)]) ).
cnf(1007,plain,
( aElementOf0(X1,X2)
| ~ aElement0(X3)
| ~ aSet0(X2)
| ~ aElementOf0(X1,sdtmndt0(X2,X3)) ),
inference(er,[status(thm)],[270,theory(equality)]) ).
cnf(7591,plain,
( aElementOf0(X1,xQ)
| ~ aElement0(xp)
| ~ aSet0(xQ)
| ~ aElementOf0(X1,xP) ),
inference(spm,[status(thm)],[1007,579,theory(equality)]) ).
cnf(7606,plain,
( aElementOf0(X1,xQ)
| $false
| ~ aSet0(xQ)
| ~ aElementOf0(X1,xP) ),
inference(rw,[status(thm)],[7591,669,theory(equality)]) ).
cnf(7607,plain,
( aElementOf0(X1,xQ)
| $false
| $false
| ~ aElementOf0(X1,xP) ),
inference(rw,[status(thm)],[7606,610,theory(equality)]) ).
cnf(7608,plain,
( aElementOf0(X1,xQ)
| ~ aElementOf0(X1,xP) ),
inference(cn,[status(thm)],[7607,theory(equality)]) ).
cnf(7623,plain,
( aElementOf0(esk2_2(X1,xP),xQ)
| aSubsetOf0(xP,X1)
| ~ aSet0(xP)
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[7608,154,theory(equality)]) ).
cnf(7638,plain,
( aElementOf0(esk2_2(X1,xP),xQ)
| aSubsetOf0(xP,X1)
| $false
| ~ aSet0(X1) ),
inference(rw,[status(thm)],[7623,521,theory(equality)]) ).
cnf(7639,plain,
( aElementOf0(esk2_2(X1,xP),xQ)
| aSubsetOf0(xP,X1)
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[7638,theory(equality)]) ).
cnf(8538,plain,
( aSubsetOf0(xP,xQ)
| ~ aSet0(xP)
| ~ aSet0(xQ) ),
inference(spm,[status(thm)],[153,7639,theory(equality)]) ).
cnf(8550,plain,
( aSubsetOf0(xP,xQ)
| $false
| ~ aSet0(xQ) ),
inference(rw,[status(thm)],[8538,521,theory(equality)]) ).
cnf(8551,plain,
( aSubsetOf0(xP,xQ)
| $false
| $false ),
inference(rw,[status(thm)],[8550,610,theory(equality)]) ).
cnf(8552,plain,
aSubsetOf0(xP,xQ),
inference(cn,[status(thm)],[8551,theory(equality)]) ).
cnf(8553,plain,
$false,
inference(sr,[status(thm)],[8552,206,theory(equality)]) ).
cnf(8554,plain,
$false,
8553,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.03 % Problem : NUM609+1 : TPTP v7.0.0. Released v4.0.0.
% 0.01/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.23 % Computer : n142.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:35:29 CST 2018
% 0.03/0.24 % CPUTime :
% 0.06/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.28 --creating new selector for []
% 0.41/0.62 -running prover on /export/starexec/sandbox/tmp/tmpo4Qm4l/sel_theBenchmark.p_1 with time limit 29
% 0.41/0.62 -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/tmpo4Qm4l/sel_theBenchmark.p_1']
% 0.41/0.62 -prover status Theorem
% 0.41/0.62 Problem theBenchmark.p solved in phase 0.
% 0.41/0.62 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.62 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.62 Solved 1 out of 1.
% 0.41/0.62 # Problem is unsatisfiable (or provable), constructing proof object
% 0.41/0.62 # SZS status Theorem
% 0.41/0.62 # SZS output start CNFRefutation.
% See solution above
% 0.41/0.62 # SZS output end CNFRefutation
%------------------------------------------------------------------------------