TSTP Solution File: NUM584+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM584+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n103.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:53 EST 2018
% Result : Theorem 0.62s
% Output : CNFRefutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 44 ( 18 unt; 0 def)
% Number of atoms : 239 ( 9 equ)
% Maximal formula atoms : 39 ( 5 avg)
% Number of connectives : 321 ( 126 ~; 136 |; 53 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 8 con; 0-3 aty)
% Number of variables : 59 ( 0 sgn 42 !; 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/tmp9WVeMR/sel_theBenchmark.p_1',mDefSub) ).
fof(14,axiom,
aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS),
file('/export/starexec/sandbox/tmp/tmp9WVeMR/sel_theBenchmark.p_1',m__4024) ).
fof(17,conjecture,
aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
file('/export/starexec/sandbox/tmp/tmp9WVeMR/sel_theBenchmark.p_1',m__) ).
fof(19,axiom,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox/tmp/tmp9WVeMR/sel_theBenchmark.p_1',m__3435) ).
fof(41,axiom,
equal(sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),xK),
file('/export/starexec/sandbox/tmp/tmp9WVeMR/sel_theBenchmark.p_1',m__4007) ).
fof(48,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElementOf0(X2,szNzAzT0) )
=> ! [X3] :
( equal(X3,slbdtsldtrb0(X1,X2))
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aSubsetOf0(X4,X1)
& equal(sbrdtbr0(X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp9WVeMR/sel_theBenchmark.p_1',mDefSel) ).
fof(50,axiom,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox/tmp/tmp9WVeMR/sel_theBenchmark.p_1',m__3418) ).
fof(71,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox/tmp/tmp9WVeMR/sel_theBenchmark.p_1',mNATSet) ).
fof(83,axiom,
( aFunction0(xc)
& equal(szDzozmdt0(xc),slbdtsldtrb0(xS,xK))
& aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT) ),
file('/export/starexec/sandbox/tmp/tmp9WVeMR/sel_theBenchmark.p_1',m__3453) ).
fof(90,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
inference(assume_negation,[status(cth)],[17]) ).
fof(92,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
inference(fof_simplification,[status(thm)],[90,theory(equality)]) ).
fof(124,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(125,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)],[124]) ).
fof(126,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)],[125]) ).
fof(127,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)],[126]) ).
fof(128,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)],[127]) ).
cnf(131,plain,
( aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[128]) ).
cnf(154,plain,
aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(165,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
inference(split_conjunct,[status(thm)],[92]) ).
cnf(169,plain,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[19]) ).
cnf(267,plain,
sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK,
inference(split_conjunct,[status(thm)],[41]) ).
fof(313,plain,
! [X1,X2] :
( ~ aSet0(X1)
| ~ aElementOf0(X2,szNzAzT0)
| ! [X3] :
( ( ~ equal(X3,slbdtsldtrb0(X1,X2))
| ( aSet0(X3)
& ! [X4] :
( ( ~ aElementOf0(X4,X3)
| ( aSubsetOf0(X4,X1)
& equal(sbrdtbr0(X4),X2) ) )
& ( ~ aSubsetOf0(X4,X1)
| ~ equal(sbrdtbr0(X4),X2)
| aElementOf0(X4,X3) ) ) ) )
& ( ~ aSet0(X3)
| ? [X4] :
( ( ~ aElementOf0(X4,X3)
| ~ aSubsetOf0(X4,X1)
| ~ equal(sbrdtbr0(X4),X2) )
& ( aElementOf0(X4,X3)
| ( aSubsetOf0(X4,X1)
& equal(sbrdtbr0(X4),X2) ) ) )
| equal(X3,slbdtsldtrb0(X1,X2)) ) ) ),
inference(fof_nnf,[status(thm)],[48]) ).
fof(314,plain,
! [X5,X6] :
( ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0)
| ! [X7] :
( ( ~ equal(X7,slbdtsldtrb0(X5,X6))
| ( aSet0(X7)
& ! [X8] :
( ( ~ aElementOf0(X8,X7)
| ( aSubsetOf0(X8,X5)
& equal(sbrdtbr0(X8),X6) ) )
& ( ~ aSubsetOf0(X8,X5)
| ~ equal(sbrdtbr0(X8),X6)
| aElementOf0(X8,X7) ) ) ) )
& ( ~ aSet0(X7)
| ? [X9] :
( ( ~ aElementOf0(X9,X7)
| ~ aSubsetOf0(X9,X5)
| ~ equal(sbrdtbr0(X9),X6) )
& ( aElementOf0(X9,X7)
| ( aSubsetOf0(X9,X5)
& equal(sbrdtbr0(X9),X6) ) ) )
| equal(X7,slbdtsldtrb0(X5,X6)) ) ) ),
inference(variable_rename,[status(thm)],[313]) ).
fof(315,plain,
! [X5,X6] :
( ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0)
| ! [X7] :
( ( ~ equal(X7,slbdtsldtrb0(X5,X6))
| ( aSet0(X7)
& ! [X8] :
( ( ~ aElementOf0(X8,X7)
| ( aSubsetOf0(X8,X5)
& equal(sbrdtbr0(X8),X6) ) )
& ( ~ aSubsetOf0(X8,X5)
| ~ equal(sbrdtbr0(X8),X6)
| aElementOf0(X8,X7) ) ) ) )
& ( ~ aSet0(X7)
| ( ( ~ aElementOf0(esk14_3(X5,X6,X7),X7)
| ~ aSubsetOf0(esk14_3(X5,X6,X7),X5)
| ~ equal(sbrdtbr0(esk14_3(X5,X6,X7)),X6) )
& ( aElementOf0(esk14_3(X5,X6,X7),X7)
| ( aSubsetOf0(esk14_3(X5,X6,X7),X5)
& equal(sbrdtbr0(esk14_3(X5,X6,X7)),X6) ) ) )
| equal(X7,slbdtsldtrb0(X5,X6)) ) ) ),
inference(skolemize,[status(esa)],[314]) ).
fof(316,plain,
! [X5,X6,X7,X8] :
( ( ( ( ( ~ aElementOf0(X8,X7)
| ( aSubsetOf0(X8,X5)
& equal(sbrdtbr0(X8),X6) ) )
& ( ~ aSubsetOf0(X8,X5)
| ~ equal(sbrdtbr0(X8),X6)
| aElementOf0(X8,X7) )
& aSet0(X7) )
| ~ equal(X7,slbdtsldtrb0(X5,X6)) )
& ( ~ aSet0(X7)
| ( ( ~ aElementOf0(esk14_3(X5,X6,X7),X7)
| ~ aSubsetOf0(esk14_3(X5,X6,X7),X5)
| ~ equal(sbrdtbr0(esk14_3(X5,X6,X7)),X6) )
& ( aElementOf0(esk14_3(X5,X6,X7),X7)
| ( aSubsetOf0(esk14_3(X5,X6,X7),X5)
& equal(sbrdtbr0(esk14_3(X5,X6,X7)),X6) ) ) )
| equal(X7,slbdtsldtrb0(X5,X6)) ) )
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) ),
inference(shift_quantors,[status(thm)],[315]) ).
fof(317,plain,
! [X5,X6,X7,X8] :
( ( aSubsetOf0(X8,X5)
| ~ aElementOf0(X8,X7)
| ~ equal(X7,slbdtsldtrb0(X5,X6))
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( equal(sbrdtbr0(X8),X6)
| ~ aElementOf0(X8,X7)
| ~ equal(X7,slbdtsldtrb0(X5,X6))
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( ~ aSubsetOf0(X8,X5)
| ~ equal(sbrdtbr0(X8),X6)
| aElementOf0(X8,X7)
| ~ equal(X7,slbdtsldtrb0(X5,X6))
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( aSet0(X7)
| ~ equal(X7,slbdtsldtrb0(X5,X6))
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( ~ aElementOf0(esk14_3(X5,X6,X7),X7)
| ~ aSubsetOf0(esk14_3(X5,X6,X7),X5)
| ~ equal(sbrdtbr0(esk14_3(X5,X6,X7)),X6)
| ~ aSet0(X7)
| equal(X7,slbdtsldtrb0(X5,X6))
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( aSubsetOf0(esk14_3(X5,X6,X7),X5)
| aElementOf0(esk14_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| equal(X7,slbdtsldtrb0(X5,X6))
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( equal(sbrdtbr0(esk14_3(X5,X6,X7)),X6)
| aElementOf0(esk14_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| equal(X7,slbdtsldtrb0(X5,X6))
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) ) ),
inference(distribute,[status(thm)],[316]) ).
cnf(322,plain,
( aElementOf0(X4,X3)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X2)
| X3 != slbdtsldtrb0(X2,X1)
| sbrdtbr0(X4) != X1
| ~ aSubsetOf0(X4,X2) ),
inference(split_conjunct,[status(thm)],[317]) ).
cnf(328,plain,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[50]) ).
cnf(415,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[71]) ).
cnf(461,plain,
szDzozmdt0(xc) = slbdtsldtrb0(xS,xK),
inference(split_conjunct,[status(thm)],[83]) ).
cnf(566,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),szDzozmdt0(xc)),
inference(rw,[status(thm)],[165,461,theory(equality)]) ).
cnf(574,plain,
( aSet0(xS)
| ~ aSet0(szNzAzT0) ),
inference(spm,[status(thm)],[131,169,theory(equality)]) ).
cnf(579,plain,
( aSet0(xS)
| $false ),
inference(rw,[status(thm)],[574,415,theory(equality)]) ).
cnf(580,plain,
aSet0(xS),
inference(cn,[status(thm)],[579,theory(equality)]) ).
cnf(974,plain,
( aElementOf0(X1,slbdtsldtrb0(X2,X3))
| sbrdtbr0(X1) != X3
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| ~ aElementOf0(X3,szNzAzT0) ),
inference(er,[status(thm)],[322,theory(equality)]) ).
cnf(12247,plain,
( aElementOf0(X1,szDzozmdt0(xc))
| sbrdtbr0(X1) != xK
| ~ aSet0(xS)
| ~ aSubsetOf0(X1,xS)
| ~ aElementOf0(xK,szNzAzT0) ),
inference(spm,[status(thm)],[974,461,theory(equality)]) ).
cnf(12264,plain,
( aElementOf0(X1,szDzozmdt0(xc))
| sbrdtbr0(X1) != xK
| $false
| ~ aSubsetOf0(X1,xS)
| ~ aElementOf0(xK,szNzAzT0) ),
inference(rw,[status(thm)],[12247,580,theory(equality)]) ).
cnf(12265,plain,
( aElementOf0(X1,szDzozmdt0(xc))
| sbrdtbr0(X1) != xK
| $false
| ~ aSubsetOf0(X1,xS)
| $false ),
inference(rw,[status(thm)],[12264,328,theory(equality)]) ).
cnf(12266,plain,
( aElementOf0(X1,szDzozmdt0(xc))
| sbrdtbr0(X1) != xK
| ~ aSubsetOf0(X1,xS) ),
inference(cn,[status(thm)],[12265,theory(equality)]) ).
cnf(14923,plain,
( aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),szDzozmdt0(xc))
| ~ aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS) ),
inference(spm,[status(thm)],[12266,267,theory(equality)]) ).
cnf(14932,plain,
( aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),szDzozmdt0(xc))
| $false ),
inference(rw,[status(thm)],[14923,154,theory(equality)]) ).
cnf(14933,plain,
aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),szDzozmdt0(xc)),
inference(cn,[status(thm)],[14932,theory(equality)]) ).
cnf(14934,plain,
$false,
inference(sr,[status(thm)],[14933,566,theory(equality)]) ).
cnf(14935,plain,
$false,
14934,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM584+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.23 % Computer : n103.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 09:42:00 CST 2018
% 0.03/0.23 % CPUTime :
% 0.03/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.28 --creating new selector for []
% 0.62/0.82 -running prover on /export/starexec/sandbox/tmp/tmp9WVeMR/sel_theBenchmark.p_1 with time limit 29
% 0.62/0.82 -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/tmp9WVeMR/sel_theBenchmark.p_1']
% 0.62/0.82 -prover status Theorem
% 0.62/0.82 Problem theBenchmark.p solved in phase 0.
% 0.62/0.82 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.62/0.82 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.62/0.82 Solved 1 out of 1.
% 0.62/0.82 # Problem is unsatisfiable (or provable), constructing proof object
% 0.62/0.82 # SZS status Theorem
% 0.62/0.82 # SZS output start CNFRefutation.
% See solution above
% 0.62/0.82 # SZS output end CNFRefutation
%------------------------------------------------------------------------------