TSTP Solution File: NUM620+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM620+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n087.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:01 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 11
% Syntax : Number of formulae : 68 ( 12 unt; 0 def)
% Number of atoms : 272 ( 11 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 344 ( 140 ~; 134 |; 58 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 10 con; 0-2 aty)
% Number of variables : 87 ( 0 sgn 58 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1] :
( ( aSubsetOf0(X1,szNzAzT0)
& ~ equal(X1,slcrc0) )
=> ! [X2] :
( equal(X2,szmzizndt0(X1))
<=> ( aElementOf0(X2,X1)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmpSJA9zN/sel_theBenchmark.p_1',mDefMin) ).
fof(5,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmpSJA9zN/sel_theBenchmark.p_1',m__3671) ).
fof(7,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmpSJA9zN/sel_theBenchmark.p_1',mDefSub) ).
fof(19,conjecture,
( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
=> aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
file('/export/starexec/sandbox/tmp/tmpSJA9zN/sel_theBenchmark.p_1',m__) ).
fof(31,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
& ~ equal(szszuzczcdt0(X1),sz00) ) ),
file('/export/starexec/sandbox/tmp/tmpSJA9zN/sel_theBenchmark.p_1',mSuccNum) ).
fof(84,axiom,
( aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(xn,szNzAzT0)
& equal(sdtlpdtrp0(xe,xn),xp) ),
file('/export/starexec/sandbox/tmp/tmpSJA9zN/sel_theBenchmark.p_1',m__5309) ).
fof(89,axiom,
! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> ~ equal(X1,slcrc0) ),
file('/export/starexec/sandbox/tmp/tmpSJA9zN/sel_theBenchmark.p_1',mCountNFin_01) ).
fof(91,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox/tmp/tmpSJA9zN/sel_theBenchmark.p_1',mNATSet) ).
fof(98,axiom,
( aElementOf0(xm,szNzAzT0)
& equal(xx,sdtlpdtrp0(xe,xm)) ),
file('/export/starexec/sandbox/tmp/tmpSJA9zN/sel_theBenchmark.p_1',m__5389) ).
fof(107,axiom,
! [X1] :
( equal(X1,slcrc0)
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmpSJA9zN/sel_theBenchmark.p_1',mDefEmp) ).
fof(112,axiom,
equal(xx,szmzizndt0(sdtlpdtrp0(xN,xm))),
file('/export/starexec/sandbox/tmp/tmpSJA9zN/sel_theBenchmark.p_1',m__5401) ).
fof(118,negated_conjecture,
~ ( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
=> aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(assume_negation,[status(cth)],[19]) ).
fof(139,plain,
! [X1] :
( ~ aSubsetOf0(X1,szNzAzT0)
| equal(X1,slcrc0)
| ! [X2] :
( ( ~ equal(X2,szmzizndt0(X1))
| ( aElementOf0(X2,X1)
& ! [X3] :
( ~ aElementOf0(X3,X1)
| sdtlseqdt0(X2,X3) ) ) )
& ( ~ aElementOf0(X2,X1)
| ? [X3] :
( aElementOf0(X3,X1)
& ~ sdtlseqdt0(X2,X3) )
| equal(X2,szmzizndt0(X1)) ) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(140,plain,
! [X4] :
( ~ aSubsetOf0(X4,szNzAzT0)
| equal(X4,slcrc0)
| ! [X5] :
( ( ~ equal(X5,szmzizndt0(X4))
| ( aElementOf0(X5,X4)
& ! [X6] :
( ~ aElementOf0(X6,X4)
| sdtlseqdt0(X5,X6) ) ) )
& ( ~ aElementOf0(X5,X4)
| ? [X7] :
( aElementOf0(X7,X4)
& ~ sdtlseqdt0(X5,X7) )
| equal(X5,szmzizndt0(X4)) ) ) ),
inference(variable_rename,[status(thm)],[139]) ).
fof(141,plain,
! [X4] :
( ~ aSubsetOf0(X4,szNzAzT0)
| equal(X4,slcrc0)
| ! [X5] :
( ( ~ equal(X5,szmzizndt0(X4))
| ( aElementOf0(X5,X4)
& ! [X6] :
( ~ aElementOf0(X6,X4)
| sdtlseqdt0(X5,X6) ) ) )
& ( ~ aElementOf0(X5,X4)
| ( aElementOf0(esk1_2(X4,X5),X4)
& ~ sdtlseqdt0(X5,esk1_2(X4,X5)) )
| equal(X5,szmzizndt0(X4)) ) ) ),
inference(skolemize,[status(esa)],[140]) ).
fof(142,plain,
! [X4,X5,X6] :
( ( ( ( ( ~ aElementOf0(X6,X4)
| sdtlseqdt0(X5,X6) )
& aElementOf0(X5,X4) )
| ~ equal(X5,szmzizndt0(X4)) )
& ( ~ aElementOf0(X5,X4)
| ( aElementOf0(esk1_2(X4,X5),X4)
& ~ sdtlseqdt0(X5,esk1_2(X4,X5)) )
| equal(X5,szmzizndt0(X4)) ) )
| ~ aSubsetOf0(X4,szNzAzT0)
| equal(X4,slcrc0) ),
inference(shift_quantors,[status(thm)],[141]) ).
fof(143,plain,
! [X4,X5,X6] :
( ( ~ aElementOf0(X6,X4)
| sdtlseqdt0(X5,X6)
| ~ equal(X5,szmzizndt0(X4))
| ~ aSubsetOf0(X4,szNzAzT0)
| equal(X4,slcrc0) )
& ( aElementOf0(X5,X4)
| ~ equal(X5,szmzizndt0(X4))
| ~ aSubsetOf0(X4,szNzAzT0)
| equal(X4,slcrc0) )
& ( aElementOf0(esk1_2(X4,X5),X4)
| ~ aElementOf0(X5,X4)
| equal(X5,szmzizndt0(X4))
| ~ aSubsetOf0(X4,szNzAzT0)
| equal(X4,slcrc0) )
& ( ~ sdtlseqdt0(X5,esk1_2(X4,X5))
| ~ aElementOf0(X5,X4)
| equal(X5,szmzizndt0(X4))
| ~ aSubsetOf0(X4,szNzAzT0)
| equal(X4,slcrc0) ) ),
inference(distribute,[status(thm)],[142]) ).
cnf(146,plain,
( X1 = slcrc0
| aElementOf0(X2,X1)
| ~ aSubsetOf0(X1,szNzAzT0)
| X2 != szmzizndt0(X1) ),
inference(split_conjunct,[status(thm)],[143]) ).
fof(148,plain,
! [X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(149,plain,
! [X2] :
( ~ aElementOf0(X2,szNzAzT0)
| ( aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X2)) ) ),
inference(variable_rename,[status(thm)],[148]) ).
fof(150,plain,
! [X2] :
( ( aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,X2))
| ~ aElementOf0(X2,szNzAzT0) ) ),
inference(distribute,[status(thm)],[149]) ).
cnf(151,plain,
( isCountable0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[150]) ).
cnf(152,plain,
( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[150]) ).
fof(157,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(158,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)],[157]) ).
fof(159,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)],[158]) ).
fof(160,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)],[159]) ).
fof(161,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)],[160]) ).
cnf(164,plain,
( aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[161]) ).
cnf(165,plain,
( aElementOf0(X3,X1)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X2) ),
inference(split_conjunct,[status(thm)],[161]) ).
fof(215,negated_conjecture,
( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& ~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(fof_nnf,[status(thm)],[118]) ).
cnf(216,negated_conjecture,
~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(split_conjunct,[status(thm)],[215]) ).
cnf(217,negated_conjecture,
aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(split_conjunct,[status(thm)],[215]) ).
fof(264,plain,
! [X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
& ~ equal(szszuzczcdt0(X1),sz00) ) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(265,plain,
! [X2] :
( ~ aElementOf0(X2,szNzAzT0)
| ( aElementOf0(szszuzczcdt0(X2),szNzAzT0)
& ~ equal(szszuzczcdt0(X2),sz00) ) ),
inference(variable_rename,[status(thm)],[264]) ).
fof(266,plain,
! [X2] :
( ( aElementOf0(szszuzczcdt0(X2),szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0) )
& ( ~ equal(szszuzczcdt0(X2),sz00)
| ~ aElementOf0(X2,szNzAzT0) ) ),
inference(distribute,[status(thm)],[265]) ).
cnf(268,plain,
( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[266]) ).
cnf(494,plain,
aElementOf0(xn,szNzAzT0),
inference(split_conjunct,[status(thm)],[84]) ).
fof(511,plain,
! [X1] :
( ~ aSet0(X1)
| ~ isCountable0(X1)
| ~ equal(X1,slcrc0) ),
inference(fof_nnf,[status(thm)],[89]) ).
fof(512,plain,
! [X2] :
( ~ aSet0(X2)
| ~ isCountable0(X2)
| ~ equal(X2,slcrc0) ),
inference(variable_rename,[status(thm)],[511]) ).
cnf(513,plain,
( X1 != slcrc0
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[512]) ).
cnf(516,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[91]) ).
cnf(532,plain,
aElementOf0(xm,szNzAzT0),
inference(split_conjunct,[status(thm)],[98]) ).
fof(561,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)],[107]) ).
fof(562,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)],[561]) ).
fof(563,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)],[562]) ).
fof(564,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)],[563]) ).
fof(565,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)],[564]) ).
cnf(567,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[565]) ).
cnf(579,plain,
xx = szmzizndt0(sdtlpdtrp0(xN,xm)),
inference(split_conjunct,[status(thm)],[112]) ).
cnf(689,plain,
( aSet0(sdtlpdtrp0(xN,X1))
| ~ aSet0(szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[164,152,theory(equality)]) ).
cnf(701,plain,
( aSet0(sdtlpdtrp0(xN,X1))
| $false
| ~ aElementOf0(X1,szNzAzT0) ),
inference(rw,[status(thm)],[689,516,theory(equality)]) ).
cnf(702,plain,
( aSet0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[701,theory(equality)]) ).
cnf(759,plain,
( slcrc0 != X1
| ~ isCountable0(X1) ),
inference(csr,[status(thm)],[513,567]) ).
cnf(765,plain,
( slcrc0 != sdtlpdtrp0(xN,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[759,151,theory(equality)]) ).
cnf(814,negated_conjecture,
( aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| ~ aSet0(sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xm)) ),
inference(spm,[status(thm)],[165,217,theory(equality)]) ).
cnf(925,plain,
( slcrc0 = sdtlpdtrp0(xN,X1)
| aElementOf0(X2,sdtlpdtrp0(xN,X1))
| szmzizndt0(sdtlpdtrp0(xN,X1)) != X2
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[146,152,theory(equality)]) ).
cnf(3729,negated_conjecture,
( ~ aSet0(sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| ~ aElementOf0(xx,sdtlpdtrp0(xN,xm)) ),
inference(spm,[status(thm)],[216,814,theory(equality)]) ).
cnf(5309,plain,
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
| szmzizndt0(sdtlpdtrp0(xN,X1)) != X2
| ~ aElementOf0(X1,szNzAzT0) ),
inference(csr,[status(thm)],[925,765]) ).
cnf(5586,plain,
( ~ aElementOf0(xx,sdtlpdtrp0(xN,xm))
| ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0) ),
inference(spm,[status(thm)],[3729,702,theory(equality)]) ).
cnf(5591,plain,
( ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| szmzizndt0(sdtlpdtrp0(xN,xm)) != xx
| ~ aElementOf0(xm,szNzAzT0) ),
inference(spm,[status(thm)],[5586,5309,theory(equality)]) ).
cnf(5592,plain,
( ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| $false
| ~ aElementOf0(xm,szNzAzT0) ),
inference(rw,[status(thm)],[5591,579,theory(equality)]) ).
cnf(5593,plain,
( ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| $false
| $false ),
inference(rw,[status(thm)],[5592,532,theory(equality)]) ).
cnf(5594,plain,
~ aElementOf0(szszuzczcdt0(xn),szNzAzT0),
inference(cn,[status(thm)],[5593,theory(equality)]) ).
cnf(5595,plain,
~ aElementOf0(xn,szNzAzT0),
inference(spm,[status(thm)],[5594,268,theory(equality)]) ).
cnf(5604,plain,
$false,
inference(rw,[status(thm)],[5595,494,theory(equality)]) ).
cnf(5605,plain,
$false,
inference(cn,[status(thm)],[5604,theory(equality)]) ).
cnf(5606,plain,
$false,
5605,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM620+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.22 % Computer : n087.star.cs.uiowa.edu
% 0.02/0.22 % Model : x86_64 x86_64
% 0.02/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.22 % Memory : 32218.625MB
% 0.02/0.22 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.22 % CPULimit : 300
% 0.02/0.22 % DateTime : Fri Jan 5 11:18:59 CST 2018
% 0.02/0.22 % CPUTime :
% 0.06/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.27 --creating new selector for []
% 0.06/0.50 -running prover on /export/starexec/sandbox/tmp/tmpSJA9zN/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.50 -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/tmpSJA9zN/sel_theBenchmark.p_1']
% 0.06/0.50 -prover status Theorem
% 0.06/0.50 Problem theBenchmark.p solved in phase 0.
% 0.06/0.50 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.50 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.50 Solved 1 out of 1.
% 0.06/0.50 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.50 # SZS status Theorem
% 0.06/0.50 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.51 # SZS output end CNFRefutation
%------------------------------------------------------------------------------