TSTP Solution File: NUM623+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM623+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n032.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:22:02 EST 2018
% Result : Theorem 1.09s
% Output : CNFRefutation 1.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 9
% Syntax : Number of formulae : 45 ( 18 unt; 0 def)
% Number of atoms : 140 ( 17 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 163 ( 68 ~; 70 |; 21 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 36 ( 1 sgn 21 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp7jzPH2/sel_theBenchmark.p_1',m__3671) ).
fof(19,conjecture,
equal(xp,xx),
file('/export/starexec/sandbox2/tmp/tmp7jzPH2/sel_theBenchmark.p_1',m__) ).
fof(26,axiom,
equal(xp,szmzizndt0(xQ)),
file('/export/starexec/sandbox2/tmp/tmp7jzPH2/sel_theBenchmark.p_1',m__5147) ).
fof(66,axiom,
aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmp7jzPH2/sel_theBenchmark.p_1',m__5106) ).
fof(100,axiom,
( aElementOf0(xm,szNzAzT0)
& equal(xx,sdtlpdtrp0(xe,xm)) ),
file('/export/starexec/sandbox2/tmp/tmp7jzPH2/sel_theBenchmark.p_1',m__5389) ).
fof(103,axiom,
( aElementOf0(xp,sdtlpdtrp0(xN,xm))
& aElementOf0(xx,xQ) ),
file('/export/starexec/sandbox2/tmp/tmp7jzPH2/sel_theBenchmark.p_1',m__5481) ).
fof(110,axiom,
! [X1] :
( equal(X1,slcrc0)
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp7jzPH2/sel_theBenchmark.p_1',mDefEmp) ).
fof(115,axiom,
equal(xx,szmzizndt0(sdtlpdtrp0(xN,xm))),
file('/export/starexec/sandbox2/tmp/tmp7jzPH2/sel_theBenchmark.p_1',m__5401) ).
fof(116,axiom,
! [X1,X2] :
( ( aSubsetOf0(X1,szNzAzT0)
& aSubsetOf0(X2,szNzAzT0)
& ~ equal(X1,slcrc0)
& ~ equal(X2,slcrc0) )
=> ( ( aElementOf0(szmzizndt0(X1),X2)
& aElementOf0(szmzizndt0(X2),X1) )
=> equal(szmzizndt0(X1),szmzizndt0(X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp7jzPH2/sel_theBenchmark.p_1',mMinMin) ).
fof(121,negated_conjecture,
~ equal(xp,xx),
inference(assume_negation,[status(cth)],[19]) ).
fof(123,negated_conjecture,
~ equal(xp,xx),
inference(fof_simplification,[status(thm)],[121,theory(equality)]) ).
fof(153,plain,
! [X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(154,plain,
! [X2] :
( ~ aElementOf0(X2,szNzAzT0)
| ( aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X2)) ) ),
inference(variable_rename,[status(thm)],[153]) ).
fof(155,plain,
! [X2] :
( ( aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,X2))
| ~ aElementOf0(X2,szNzAzT0) ) ),
inference(distribute,[status(thm)],[154]) ).
cnf(157,plain,
( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[155]) ).
cnf(220,negated_conjecture,
xp != xx,
inference(split_conjunct,[status(thm)],[123]) ).
cnf(251,plain,
xp = szmzizndt0(xQ),
inference(split_conjunct,[status(thm)],[26]) ).
cnf(435,plain,
aSubsetOf0(xQ,szNzAzT0),
inference(split_conjunct,[status(thm)],[66]) ).
cnf(537,plain,
aElementOf0(xm,szNzAzT0),
inference(split_conjunct,[status(thm)],[100]) ).
cnf(545,plain,
aElementOf0(xx,xQ),
inference(split_conjunct,[status(thm)],[103]) ).
cnf(546,plain,
aElementOf0(xp,sdtlpdtrp0(xN,xm)),
inference(split_conjunct,[status(thm)],[103]) ).
fof(568,plain,
! [X1] :
( ( ~ equal(X1,slcrc0)
| ( aSet0(X1)
& ! [X2] : ~ aElementOf0(X2,X1) ) )
& ( ~ aSet0(X1)
| ? [X2] : aElementOf0(X2,X1)
| equal(X1,slcrc0) ) ),
inference(fof_nnf,[status(thm)],[110]) ).
fof(569,plain,
! [X3] :
( ( ~ equal(X3,slcrc0)
| ( aSet0(X3)
& ! [X4] : ~ aElementOf0(X4,X3) ) )
& ( ~ aSet0(X3)
| ? [X5] : aElementOf0(X5,X3)
| equal(X3,slcrc0) ) ),
inference(variable_rename,[status(thm)],[568]) ).
fof(570,plain,
! [X3] :
( ( ~ equal(X3,slcrc0)
| ( aSet0(X3)
& ! [X4] : ~ aElementOf0(X4,X3) ) )
& ( ~ aSet0(X3)
| aElementOf0(esk24_1(X3),X3)
| equal(X3,slcrc0) ) ),
inference(skolemize,[status(esa)],[569]) ).
fof(571,plain,
! [X3,X4] :
( ( ( ~ aElementOf0(X4,X3)
& aSet0(X3) )
| ~ equal(X3,slcrc0) )
& ( ~ aSet0(X3)
| aElementOf0(esk24_1(X3),X3)
| equal(X3,slcrc0) ) ),
inference(shift_quantors,[status(thm)],[570]) ).
fof(572,plain,
! [X3,X4] :
( ( ~ aElementOf0(X4,X3)
| ~ equal(X3,slcrc0) )
& ( aSet0(X3)
| ~ equal(X3,slcrc0) )
& ( ~ aSet0(X3)
| aElementOf0(esk24_1(X3),X3)
| equal(X3,slcrc0) ) ),
inference(distribute,[status(thm)],[571]) ).
cnf(575,plain,
( X1 != slcrc0
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[572]) ).
cnf(586,plain,
xx = szmzizndt0(sdtlpdtrp0(xN,xm)),
inference(split_conjunct,[status(thm)],[115]) ).
fof(587,plain,
! [X1,X2] :
( ~ aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X2,szNzAzT0)
| equal(X1,slcrc0)
| equal(X2,slcrc0)
| ~ aElementOf0(szmzizndt0(X1),X2)
| ~ aElementOf0(szmzizndt0(X2),X1)
| equal(szmzizndt0(X1),szmzizndt0(X2)) ),
inference(fof_nnf,[status(thm)],[116]) ).
fof(588,plain,
! [X3,X4] :
( ~ aSubsetOf0(X3,szNzAzT0)
| ~ aSubsetOf0(X4,szNzAzT0)
| equal(X3,slcrc0)
| equal(X4,slcrc0)
| ~ aElementOf0(szmzizndt0(X3),X4)
| ~ aElementOf0(szmzizndt0(X4),X3)
| equal(szmzizndt0(X3),szmzizndt0(X4)) ),
inference(variable_rename,[status(thm)],[587]) ).
cnf(589,plain,
( szmzizndt0(X1) = szmzizndt0(X2)
| X2 = slcrc0
| X1 = slcrc0
| ~ aElementOf0(szmzizndt0(X2),X1)
| ~ aElementOf0(szmzizndt0(X1),X2)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ aSubsetOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[588]) ).
cnf(1617,plain,
( szmzizndt0(X1) = szmzizndt0(X2)
| slcrc0 = X2
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ aElementOf0(szmzizndt0(X2),X1)
| ~ aElementOf0(szmzizndt0(X1),X2) ),
inference(csr,[status(thm)],[589,575]) ).
cnf(1618,plain,
( szmzizndt0(X1) = szmzizndt0(X2)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ aElementOf0(szmzizndt0(X2),X1)
| ~ aElementOf0(szmzizndt0(X1),X2) ),
inference(csr,[status(thm)],[1617,575]) ).
cnf(1619,plain,
( szmzizndt0(X1) = xp
| ~ aSubsetOf0(xQ,szNzAzT0)
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ aElementOf0(xp,X1)
| ~ aElementOf0(szmzizndt0(X1),xQ) ),
inference(spm,[status(thm)],[1618,251,theory(equality)]) ).
cnf(1623,plain,
( szmzizndt0(X1) = xp
| $false
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ aElementOf0(xp,X1)
| ~ aElementOf0(szmzizndt0(X1),xQ) ),
inference(rw,[status(thm)],[1619,435,theory(equality)]) ).
cnf(1624,plain,
( szmzizndt0(X1) = xp
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ aElementOf0(xp,X1)
| ~ aElementOf0(szmzizndt0(X1),xQ) ),
inference(cn,[status(thm)],[1623,theory(equality)]) ).
cnf(25933,plain,
( xx = xp
| ~ aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0)
| ~ aElementOf0(xx,xQ)
| ~ aElementOf0(xp,sdtlpdtrp0(xN,xm)) ),
inference(spm,[status(thm)],[1624,586,theory(equality)]) ).
cnf(25946,plain,
( xx = xp
| ~ aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0)
| $false
| ~ aElementOf0(xp,sdtlpdtrp0(xN,xm)) ),
inference(rw,[status(thm)],[25933,545,theory(equality)]) ).
cnf(25947,plain,
( xx = xp
| ~ aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0)
| $false
| $false ),
inference(rw,[status(thm)],[25946,546,theory(equality)]) ).
cnf(25948,plain,
( xx = xp
| ~ aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0) ),
inference(cn,[status(thm)],[25947,theory(equality)]) ).
cnf(25949,plain,
~ aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0),
inference(sr,[status(thm)],[25948,220,theory(equality)]) ).
cnf(25968,plain,
~ aElementOf0(xm,szNzAzT0),
inference(spm,[status(thm)],[25949,157,theory(equality)]) ).
cnf(25975,plain,
$false,
inference(rw,[status(thm)],[25968,537,theory(equality)]) ).
cnf(25976,plain,
$false,
inference(cn,[status(thm)],[25975,theory(equality)]) ).
cnf(25977,plain,
$false,
25976,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM623+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 : n032.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 10:56:30 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.28 --creating new selector for []
% 1.09/1.44 -running prover on /export/starexec/sandbox2/tmp/tmp7jzPH2/sel_theBenchmark.p_1 with time limit 29
% 1.09/1.44 -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/tmp7jzPH2/sel_theBenchmark.p_1']
% 1.09/1.44 -prover status Theorem
% 1.09/1.44 Problem theBenchmark.p solved in phase 0.
% 1.09/1.44 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.09/1.44 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.09/1.44 Solved 1 out of 1.
% 1.09/1.44 # Problem is unsatisfiable (or provable), constructing proof object
% 1.09/1.44 # SZS status Theorem
% 1.09/1.44 # SZS output start CNFRefutation.
% See solution above
% 1.09/1.45 # SZS output end CNFRefutation
%------------------------------------------------------------------------------