TSTP Solution File: NUM566+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM566+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n136.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:49 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 11
% Syntax : Number of formulae : 74 ( 20 unt; 0 def)
% Number of atoms : 228 ( 10 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 275 ( 121 ~; 113 |; 32 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 83 ( 1 sgn 44 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmpQMChAI/sel_theBenchmark.p_1',mSubRefl) ).
fof(5,axiom,
! [X1] :
( aFunction0(X1)
=> ! [X2] :
( aElementOf0(X2,szDzozmdt0(X1))
=> aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1))) ) ),
file('/export/starexec/sandbox/tmp/tmpQMChAI/sel_theBenchmark.p_1',mImgRng) ).
fof(15,axiom,
( aFunction0(xc)
& equal(szDzozmdt0(xc),slbdtsldtrb0(xS,xK))
& aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT) ),
file('/export/starexec/sandbox/tmp/tmpQMChAI/sel_theBenchmark.p_1',m__3453) ).
fof(18,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmpQMChAI/sel_theBenchmark.p_1',mDefSub) ).
fof(27,axiom,
equal(xK,sz00),
file('/export/starexec/sandbox/tmp/tmpQMChAI/sel_theBenchmark.p_1',m__3462) ).
fof(41,axiom,
( aSet0(xT)
& isFinite0(xT) ),
file('/export/starexec/sandbox/tmp/tmpQMChAI/sel_theBenchmark.p_1',m__3291) ).
fof(47,axiom,
! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xS,sz00))
=> equal(sdtlpdtrp0(xc,X1),sdtlpdtrp0(xc,slcrc0)) ),
file('/export/starexec/sandbox/tmp/tmpQMChAI/sel_theBenchmark.p_1',m__3507) ).
fof(63,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox/tmp/tmpQMChAI/sel_theBenchmark.p_1',mNATSet) ).
fof(66,axiom,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox/tmp/tmpQMChAI/sel_theBenchmark.p_1',m__3435) ).
fof(73,axiom,
aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),
file('/export/starexec/sandbox/tmp/tmpQMChAI/sel_theBenchmark.p_1',m__3476) ).
fof(77,conjecture,
? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( aSubsetOf0(X2,xS)
& isCountable0(X2)
& ! [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
=> equal(sdtlpdtrp0(xc,X3),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmpQMChAI/sel_theBenchmark.p_1',m__) ).
fof(82,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( aSubsetOf0(X2,xS)
& isCountable0(X2)
& ! [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
=> equal(sdtlpdtrp0(xc,X3),X1) ) ) ),
inference(assume_negation,[status(cth)],[77]) ).
fof(88,plain,
! [X1] :
( ~ aSet0(X1)
| aSubsetOf0(X1,X1) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(89,plain,
! [X2] :
( ~ aSet0(X2)
| aSubsetOf0(X2,X2) ),
inference(variable_rename,[status(thm)],[88]) ).
cnf(90,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[89]) ).
fof(99,plain,
! [X1] :
( ~ aFunction0(X1)
| ! [X2] :
( ~ aElementOf0(X2,szDzozmdt0(X1))
| aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1))) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(100,plain,
! [X3] :
( ~ aFunction0(X3)
| ! [X4] :
( ~ aElementOf0(X4,szDzozmdt0(X3))
| aElementOf0(sdtlpdtrp0(X3,X4),sdtlcdtrc0(X3,szDzozmdt0(X3))) ) ),
inference(variable_rename,[status(thm)],[99]) ).
fof(101,plain,
! [X3,X4] :
( ~ aElementOf0(X4,szDzozmdt0(X3))
| aElementOf0(sdtlpdtrp0(X3,X4),sdtlcdtrc0(X3,szDzozmdt0(X3)))
| ~ aFunction0(X3) ),
inference(shift_quantors,[status(thm)],[100]) ).
cnf(102,plain,
( aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1)))
| ~ aFunction0(X1)
| ~ aElementOf0(X2,szDzozmdt0(X1)) ),
inference(split_conjunct,[status(thm)],[101]) ).
cnf(152,plain,
aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT),
inference(split_conjunct,[status(thm)],[15]) ).
cnf(153,plain,
szDzozmdt0(xc) = slbdtsldtrb0(xS,xK),
inference(split_conjunct,[status(thm)],[15]) ).
cnf(154,plain,
aFunction0(xc),
inference(split_conjunct,[status(thm)],[15]) ).
fof(163,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)],[18]) ).
fof(164,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)],[163]) ).
fof(165,plain,
! [X4] :
( ~ aSet0(X4)
| ! [X5] :
( ( ~ aSubsetOf0(X5,X4)
| ( aSet0(X5)
& ! [X6] :
( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) ) ) )
& ( ~ aSet0(X5)
| ( aElementOf0(esk4_2(X4,X5),X5)
& ~ aElementOf0(esk4_2(X4,X5),X4) )
| aSubsetOf0(X5,X4) ) ) ),
inference(skolemize,[status(esa)],[164]) ).
fof(166,plain,
! [X4,X5,X6] :
( ( ( ( ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) )
& aSet0(X5) )
| ~ aSubsetOf0(X5,X4) )
& ( ~ aSet0(X5)
| ( aElementOf0(esk4_2(X4,X5),X5)
& ~ aElementOf0(esk4_2(X4,X5),X4) )
| aSubsetOf0(X5,X4) ) )
| ~ aSet0(X4) ),
inference(shift_quantors,[status(thm)],[165]) ).
fof(167,plain,
! [X4,X5,X6] :
( ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aSet0(X5)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aElementOf0(esk4_2(X4,X5),X5)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(esk4_2(X4,X5),X4)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) ) ),
inference(distribute,[status(thm)],[166]) ).
cnf(170,plain,
( aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[167]) ).
cnf(171,plain,
( aElementOf0(X3,X1)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X2) ),
inference(split_conjunct,[status(thm)],[167]) ).
cnf(211,plain,
xK = sz00,
inference(split_conjunct,[status(thm)],[27]) ).
cnf(286,plain,
aSet0(xT),
inference(split_conjunct,[status(thm)],[41]) ).
fof(300,plain,
! [X1] :
( ~ aElementOf0(X1,slbdtsldtrb0(xS,sz00))
| equal(sdtlpdtrp0(xc,X1),sdtlpdtrp0(xc,slcrc0)) ),
inference(fof_nnf,[status(thm)],[47]) ).
fof(301,plain,
! [X2] :
( ~ aElementOf0(X2,slbdtsldtrb0(xS,sz00))
| equal(sdtlpdtrp0(xc,X2),sdtlpdtrp0(xc,slcrc0)) ),
inference(variable_rename,[status(thm)],[300]) ).
cnf(302,plain,
( sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0)
| ~ aElementOf0(X1,slbdtsldtrb0(xS,sz00)) ),
inference(split_conjunct,[status(thm)],[301]) ).
cnf(385,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[63]) ).
cnf(392,plain,
isCountable0(xS),
inference(split_conjunct,[status(thm)],[66]) ).
cnf(393,plain,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[66]) ).
cnf(425,plain,
aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),
inference(split_conjunct,[status(thm)],[73]) ).
fof(436,negated_conjecture,
! [X1] :
( ~ aElementOf0(X1,xT)
| ! [X2] :
( ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ? [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
& ~ equal(sdtlpdtrp0(xc,X3),X1) ) ) ),
inference(fof_nnf,[status(thm)],[82]) ).
fof(437,negated_conjecture,
! [X4] :
( ~ aElementOf0(X4,xT)
| ! [X5] :
( ~ aSubsetOf0(X5,xS)
| ~ isCountable0(X5)
| ? [X6] :
( aElementOf0(X6,slbdtsldtrb0(X5,xK))
& ~ equal(sdtlpdtrp0(xc,X6),X4) ) ) ),
inference(variable_rename,[status(thm)],[436]) ).
fof(438,negated_conjecture,
! [X4] :
( ~ aElementOf0(X4,xT)
| ! [X5] :
( ~ aSubsetOf0(X5,xS)
| ~ isCountable0(X5)
| ( aElementOf0(esk21_2(X4,X5),slbdtsldtrb0(X5,xK))
& ~ equal(sdtlpdtrp0(xc,esk21_2(X4,X5)),X4) ) ) ),
inference(skolemize,[status(esa)],[437]) ).
fof(439,negated_conjecture,
! [X4,X5] :
( ~ aSubsetOf0(X5,xS)
| ~ isCountable0(X5)
| ( aElementOf0(esk21_2(X4,X5),slbdtsldtrb0(X5,xK))
& ~ equal(sdtlpdtrp0(xc,esk21_2(X4,X5)),X4) )
| ~ aElementOf0(X4,xT) ),
inference(shift_quantors,[status(thm)],[438]) ).
fof(440,negated_conjecture,
! [X4,X5] :
( ( aElementOf0(esk21_2(X4,X5),slbdtsldtrb0(X5,xK))
| ~ aSubsetOf0(X5,xS)
| ~ isCountable0(X5)
| ~ aElementOf0(X4,xT) )
& ( ~ equal(sdtlpdtrp0(xc,esk21_2(X4,X5)),X4)
| ~ aSubsetOf0(X5,xS)
| ~ isCountable0(X5)
| ~ aElementOf0(X4,xT) ) ),
inference(distribute,[status(thm)],[439]) ).
cnf(441,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS)
| sdtlpdtrp0(xc,esk21_2(X1,X2)) != X1 ),
inference(split_conjunct,[status(thm)],[440]) ).
cnf(442,negated_conjecture,
( aElementOf0(esk21_2(X1,X2),slbdtsldtrb0(X2,xK))
| ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS) ),
inference(split_conjunct,[status(thm)],[440]) ).
cnf(469,plain,
slbdtsldtrb0(xS,sz00) = szDzozmdt0(xc),
inference(rw,[status(thm)],[153,211,theory(equality)]) ).
cnf(470,plain,
aElementOf0(slcrc0,szDzozmdt0(xc)),
inference(rw,[status(thm)],[425,469,theory(equality)]) ).
cnf(486,plain,
( aSet0(xS)
| ~ aSet0(szNzAzT0) ),
inference(spm,[status(thm)],[170,393,theory(equality)]) ).
cnf(489,plain,
( aSet0(xS)
| $false ),
inference(rw,[status(thm)],[486,385,theory(equality)]) ).
cnf(490,plain,
aSet0(xS),
inference(cn,[status(thm)],[489,theory(equality)]) ).
cnf(493,plain,
( sdtlpdtrp0(xc,slcrc0) = sdtlpdtrp0(xc,X1)
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(rw,[status(thm)],[302,469,theory(equality)]) ).
cnf(512,plain,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))
| ~ aSet0(xT) ),
inference(spm,[status(thm)],[171,152,theory(equality)]) ).
cnf(516,plain,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))
| $false ),
inference(rw,[status(thm)],[512,286,theory(equality)]) ).
cnf(517,plain,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc))) ),
inference(cn,[status(thm)],[516,theory(equality)]) ).
cnf(526,negated_conjecture,
( aElementOf0(esk21_2(X1,X2),slbdtsldtrb0(X2,sz00))
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS)
| ~ aElementOf0(X1,xT) ),
inference(rw,[status(thm)],[442,211,theory(equality)]) ).
cnf(527,plain,
( aElementOf0(esk21_2(X1,xS),szDzozmdt0(xc))
| ~ isCountable0(xS)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(xS,xS) ),
inference(spm,[status(thm)],[526,469,theory(equality)]) ).
cnf(530,plain,
( aElementOf0(esk21_2(X1,xS),szDzozmdt0(xc))
| $false
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(xS,xS) ),
inference(rw,[status(thm)],[527,392,theory(equality)]) ).
cnf(531,plain,
( aElementOf0(esk21_2(X1,xS),szDzozmdt0(xc))
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(xS,xS) ),
inference(cn,[status(thm)],[530,theory(equality)]) ).
cnf(578,plain,
( sdtlpdtrp0(xc,slcrc0) != X1
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xS)
| ~ aElementOf0(esk21_2(X1,X2),szDzozmdt0(xc)) ),
inference(spm,[status(thm)],[441,493,theory(equality)]) ).
cnf(1450,plain,
( aElementOf0(sdtlpdtrp0(xc,X1),xT)
| ~ aFunction0(xc)
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(spm,[status(thm)],[517,102,theory(equality)]) ).
cnf(1462,plain,
( aElementOf0(sdtlpdtrp0(xc,X1),xT)
| $false
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(rw,[status(thm)],[1450,154,theory(equality)]) ).
cnf(1463,plain,
( aElementOf0(sdtlpdtrp0(xc,X1),xT)
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(cn,[status(thm)],[1462,theory(equality)]) ).
cnf(1473,plain,
( aElementOf0(sdtlpdtrp0(xc,slcrc0),xT)
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(spm,[status(thm)],[1463,493,theory(equality)]) ).
cnf(1493,plain,
aElementOf0(sdtlpdtrp0(xc,slcrc0),xT),
inference(spm,[status(thm)],[1473,470,theory(equality)]) ).
cnf(2220,plain,
( sdtlpdtrp0(xc,slcrc0) != X1
| ~ isCountable0(xS)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(xS,xS) ),
inference(spm,[status(thm)],[578,531,theory(equality)]) ).
cnf(2221,plain,
( sdtlpdtrp0(xc,slcrc0) != X1
| $false
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(xS,xS) ),
inference(rw,[status(thm)],[2220,392,theory(equality)]) ).
cnf(2222,plain,
( sdtlpdtrp0(xc,slcrc0) != X1
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(xS,xS) ),
inference(cn,[status(thm)],[2221,theory(equality)]) ).
cnf(2223,plain,
( ~ aElementOf0(sdtlpdtrp0(xc,slcrc0),xT)
| ~ aSubsetOf0(xS,xS) ),
inference(er,[status(thm)],[2222,theory(equality)]) ).
cnf(2228,plain,
( $false
| ~ aSubsetOf0(xS,xS) ),
inference(rw,[status(thm)],[2223,1493,theory(equality)]) ).
cnf(2229,plain,
~ aSubsetOf0(xS,xS),
inference(cn,[status(thm)],[2228,theory(equality)]) ).
cnf(2236,plain,
~ aSet0(xS),
inference(spm,[status(thm)],[2229,90,theory(equality)]) ).
cnf(2238,plain,
$false,
inference(rw,[status(thm)],[2236,490,theory(equality)]) ).
cnf(2239,plain,
$false,
inference(cn,[status(thm)],[2238,theory(equality)]) ).
cnf(2240,plain,
$false,
2239,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM566+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n136.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.625MB
% 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Fri Jan 5 09:06:14 CST 2018
% 0.02/0.23 % CPUTime :
% 0.06/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.28 --creating new selector for []
% 0.06/0.41 -running prover on /export/starexec/sandbox/tmp/tmpQMChAI/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.41 -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/tmpQMChAI/sel_theBenchmark.p_1']
% 0.06/0.41 -prover status Theorem
% 0.06/0.41 Problem theBenchmark.p solved in phase 0.
% 0.06/0.41 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.41 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.41 Solved 1 out of 1.
% 0.06/0.41 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.41 # SZS status Theorem
% 0.06/0.41 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.41 # SZS output end CNFRefutation
%------------------------------------------------------------------------------