TSTP Solution File: NUM611+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM611+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n122.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:59 EST 2018
% Result : Theorem 11.08s
% Output : CNFRefutation 11.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of formulae : 81 ( 23 unt; 0 def)
% Number of atoms : 270 ( 25 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 295 ( 106 ~; 112 |; 64 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(19,conjecture,
equal(sbrdtbr0(xP),xk),
file('/export/starexec/sandbox/tmp/tmpXDDR0w/sel_theBenchmark.p_1',m__) ).
fof(20,axiom,
( aElementOf0(xk,szNzAzT0)
& equal(szszuzczcdt0(xk),xK) ),
file('/export/starexec/sandbox/tmp/tmpXDDR0w/sel_theBenchmark.p_1',m__3533) ).
fof(26,axiom,
( aElementOf0(xp,xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> sdtlseqdt0(xp,X1) )
& equal(xp,szmzizndt0(xQ)) ),
file('/export/starexec/sandbox/tmp/tmpXDDR0w/sel_theBenchmark.p_1',m__5147) ).
fof(39,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( ( isFinite0(X1)
& aElementOf0(X2,X1) )
=> equal(szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))),sbrdtbr0(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmpXDDR0w/sel_theBenchmark.p_1',mCardDiff) ).
fof(45,axiom,
! [X1] :
( ( aSet0(X1)
& isFinite0(X1) )
=> ! [X2] :
( aSubsetOf0(X2,X1)
=> isFinite0(X2) ) ),
file('/export/starexec/sandbox/tmp/tmpXDDR0w/sel_theBenchmark.p_1',mSubFSet) ).
fof(57,axiom,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox/tmp/tmpXDDR0w/sel_theBenchmark.p_1',m__3418) ).
fof(61,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( equal(szszuzczcdt0(X1),szszuzczcdt0(X2))
=> equal(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmpXDDR0w/sel_theBenchmark.p_1',mSuccEquSucc) ).
fof(62,axiom,
! [X1] :
( aSet0(X1)
=> ( aElementOf0(sbrdtbr0(X1),szNzAzT0)
<=> isFinite0(X1) ) ),
file('/export/starexec/sandbox/tmp/tmpXDDR0w/sel_theBenchmark.p_1',mCardNum) ).
fof(79,axiom,
( ! [X1] :
( aElementOf0(X1,xP)
=> aElementOf0(X1,xQ) )
& aSubsetOf0(xP,xQ) ),
file('/export/starexec/sandbox/tmp/tmpXDDR0w/sel_theBenchmark.p_1',m__5195) ).
fof(96,axiom,
( aSet0(xP)
& ! [X1] :
( aElementOf0(X1,xQ)
=> sdtlseqdt0(szmzizndt0(xQ),X1) )
& ! [X1] :
( aElementOf0(X1,xP)
<=> ( aElement0(X1)
& aElementOf0(X1,xQ)
& ~ equal(X1,szmzizndt0(xQ)) ) )
& equal(xP,sdtmndt0(xQ,szmzizndt0(xQ))) ),
file('/export/starexec/sandbox/tmp/tmpXDDR0w/sel_theBenchmark.p_1',m__5164) ).
fof(100,axiom,
( aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xO) )
& aSubsetOf0(xQ,xO)
& equal(sbrdtbr0(xQ),xK)
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
file('/export/starexec/sandbox/tmp/tmpXDDR0w/sel_theBenchmark.p_1',m__5078) ).
fof(110,negated_conjecture,
~ equal(sbrdtbr0(xP),xk),
inference(assume_negation,[status(cth)],[19]) ).
fof(112,negated_conjecture,
~ equal(sbrdtbr0(xP),xk),
inference(fof_simplification,[status(thm)],[110,theory(equality)]) ).
cnf(237,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(split_conjunct,[status(thm)],[112]) ).
cnf(238,plain,
szszuzczcdt0(xk) = xK,
inference(split_conjunct,[status(thm)],[20]) ).
cnf(239,plain,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[20]) ).
fof(283,plain,
( aElementOf0(xp,xQ)
& ! [X1] :
( ~ aElementOf0(X1,xQ)
| sdtlseqdt0(xp,X1) )
& equal(xp,szmzizndt0(xQ)) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(284,plain,
( aElementOf0(xp,xQ)
& ! [X2] :
( ~ aElementOf0(X2,xQ)
| sdtlseqdt0(xp,X2) )
& equal(xp,szmzizndt0(xQ)) ),
inference(variable_rename,[status(thm)],[283]) ).
fof(285,plain,
! [X2] :
( ( ~ aElementOf0(X2,xQ)
| sdtlseqdt0(xp,X2) )
& aElementOf0(xp,xQ)
& equal(xp,szmzizndt0(xQ)) ),
inference(shift_quantors,[status(thm)],[284]) ).
cnf(286,plain,
xp = szmzizndt0(xQ),
inference(split_conjunct,[status(thm)],[285]) ).
cnf(287,plain,
aElementOf0(xp,xQ),
inference(split_conjunct,[status(thm)],[285]) ).
fof(345,plain,
! [X1] :
( ~ aSet0(X1)
| ! [X2] :
( ~ isFinite0(X1)
| ~ aElementOf0(X2,X1)
| equal(szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))),sbrdtbr0(X1)) ) ),
inference(fof_nnf,[status(thm)],[39]) ).
fof(346,plain,
! [X3] :
( ~ aSet0(X3)
| ! [X4] :
( ~ isFinite0(X3)
| ~ aElementOf0(X4,X3)
| equal(szszuzczcdt0(sbrdtbr0(sdtmndt0(X3,X4))),sbrdtbr0(X3)) ) ),
inference(variable_rename,[status(thm)],[345]) ).
fof(347,plain,
! [X3,X4] :
( ~ isFinite0(X3)
| ~ aElementOf0(X4,X3)
| equal(szszuzczcdt0(sbrdtbr0(sdtmndt0(X3,X4))),sbrdtbr0(X3))
| ~ aSet0(X3) ),
inference(shift_quantors,[status(thm)],[346]) ).
cnf(348,plain,
( szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))) = sbrdtbr0(X1)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1)
| ~ isFinite0(X1) ),
inference(split_conjunct,[status(thm)],[347]) ).
fof(365,plain,
! [X1] :
( ~ aSet0(X1)
| ~ isFinite0(X1)
| ! [X2] :
( ~ aSubsetOf0(X2,X1)
| isFinite0(X2) ) ),
inference(fof_nnf,[status(thm)],[45]) ).
fof(366,plain,
! [X3] :
( ~ aSet0(X3)
| ~ isFinite0(X3)
| ! [X4] :
( ~ aSubsetOf0(X4,X3)
| isFinite0(X4) ) ),
inference(variable_rename,[status(thm)],[365]) ).
fof(367,plain,
! [X3,X4] :
( ~ aSubsetOf0(X4,X3)
| isFinite0(X4)
| ~ aSet0(X3)
| ~ isFinite0(X3) ),
inference(shift_quantors,[status(thm)],[366]) ).
cnf(368,plain,
( isFinite0(X2)
| ~ isFinite0(X1)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[367]) ).
cnf(444,plain,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[57]) ).
fof(472,plain,
! [X1,X2] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ equal(szszuzczcdt0(X1),szszuzczcdt0(X2))
| equal(X1,X2) ),
inference(fof_nnf,[status(thm)],[61]) ).
fof(473,plain,
! [X3,X4] :
( ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X4,szNzAzT0)
| ~ equal(szszuzczcdt0(X3),szszuzczcdt0(X4))
| equal(X3,X4) ),
inference(variable_rename,[status(thm)],[472]) ).
cnf(474,plain,
( X1 = X2
| szszuzczcdt0(X1) != szszuzczcdt0(X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[473]) ).
fof(475,plain,
! [X1] :
( ~ aSet0(X1)
| ( ( ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| isFinite0(X1) )
& ( ~ isFinite0(X1)
| aElementOf0(sbrdtbr0(X1),szNzAzT0) ) ) ),
inference(fof_nnf,[status(thm)],[62]) ).
fof(476,plain,
! [X2] :
( ~ aSet0(X2)
| ( ( ~ aElementOf0(sbrdtbr0(X2),szNzAzT0)
| isFinite0(X2) )
& ( ~ isFinite0(X2)
| aElementOf0(sbrdtbr0(X2),szNzAzT0) ) ) ),
inference(variable_rename,[status(thm)],[475]) ).
fof(477,plain,
! [X2] :
( ( ~ aElementOf0(sbrdtbr0(X2),szNzAzT0)
| isFinite0(X2)
| ~ aSet0(X2) )
& ( ~ isFinite0(X2)
| aElementOf0(sbrdtbr0(X2),szNzAzT0)
| ~ aSet0(X2) ) ),
inference(distribute,[status(thm)],[476]) ).
cnf(478,plain,
( aElementOf0(sbrdtbr0(X1),szNzAzT0)
| ~ aSet0(X1)
| ~ isFinite0(X1) ),
inference(split_conjunct,[status(thm)],[477]) ).
cnf(479,plain,
( isFinite0(X1)
| ~ aSet0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[477]) ).
fof(594,plain,
( ! [X1] :
( ~ aElementOf0(X1,xP)
| aElementOf0(X1,xQ) )
& aSubsetOf0(xP,xQ) ),
inference(fof_nnf,[status(thm)],[79]) ).
fof(595,plain,
( ! [X2] :
( ~ aElementOf0(X2,xP)
| aElementOf0(X2,xQ) )
& aSubsetOf0(xP,xQ) ),
inference(variable_rename,[status(thm)],[594]) ).
fof(596,plain,
! [X2] :
( ( ~ aElementOf0(X2,xP)
| aElementOf0(X2,xQ) )
& aSubsetOf0(xP,xQ) ),
inference(shift_quantors,[status(thm)],[595]) ).
cnf(597,plain,
aSubsetOf0(xP,xQ),
inference(split_conjunct,[status(thm)],[596]) ).
fof(656,plain,
( aSet0(xP)
& ! [X1] :
( ~ aElementOf0(X1,xQ)
| sdtlseqdt0(szmzizndt0(xQ),X1) )
& ! [X1] :
( ( ~ aElementOf0(X1,xP)
| ( aElement0(X1)
& aElementOf0(X1,xQ)
& ~ equal(X1,szmzizndt0(xQ)) ) )
& ( ~ aElement0(X1)
| ~ aElementOf0(X1,xQ)
| equal(X1,szmzizndt0(xQ))
| aElementOf0(X1,xP) ) )
& equal(xP,sdtmndt0(xQ,szmzizndt0(xQ))) ),
inference(fof_nnf,[status(thm)],[96]) ).
fof(657,plain,
( aSet0(xP)
& ! [X2] :
( ~ aElementOf0(X2,xQ)
| sdtlseqdt0(szmzizndt0(xQ),X2) )
& ! [X3] :
( ( ~ aElementOf0(X3,xP)
| ( aElement0(X3)
& aElementOf0(X3,xQ)
& ~ equal(X3,szmzizndt0(xQ)) ) )
& ( ~ aElement0(X3)
| ~ aElementOf0(X3,xQ)
| equal(X3,szmzizndt0(xQ))
| aElementOf0(X3,xP) ) )
& equal(xP,sdtmndt0(xQ,szmzizndt0(xQ))) ),
inference(variable_rename,[status(thm)],[656]) ).
fof(658,plain,
! [X2,X3] :
( ( ~ aElementOf0(X3,xP)
| ( aElement0(X3)
& aElementOf0(X3,xQ)
& ~ equal(X3,szmzizndt0(xQ)) ) )
& ( ~ aElement0(X3)
| ~ aElementOf0(X3,xQ)
| equal(X3,szmzizndt0(xQ))
| aElementOf0(X3,xP) )
& ( ~ aElementOf0(X2,xQ)
| sdtlseqdt0(szmzizndt0(xQ),X2) )
& aSet0(xP)
& equal(xP,sdtmndt0(xQ,szmzizndt0(xQ))) ),
inference(shift_quantors,[status(thm)],[657]) ).
fof(659,plain,
! [X2,X3] :
( ( aElement0(X3)
| ~ aElementOf0(X3,xP) )
& ( aElementOf0(X3,xQ)
| ~ aElementOf0(X3,xP) )
& ( ~ equal(X3,szmzizndt0(xQ))
| ~ aElementOf0(X3,xP) )
& ( ~ aElement0(X3)
| ~ aElementOf0(X3,xQ)
| equal(X3,szmzizndt0(xQ))
| aElementOf0(X3,xP) )
& ( ~ aElementOf0(X2,xQ)
| sdtlseqdt0(szmzizndt0(xQ),X2) )
& aSet0(xP)
& equal(xP,sdtmndt0(xQ,szmzizndt0(xQ))) ),
inference(distribute,[status(thm)],[658]) ).
cnf(660,plain,
xP = sdtmndt0(xQ,szmzizndt0(xQ)),
inference(split_conjunct,[status(thm)],[659]) ).
cnf(661,plain,
aSet0(xP),
inference(split_conjunct,[status(thm)],[659]) ).
fof(4648,plain,
( aSet0(xQ)
& ! [X1] :
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,xO) )
& aSubsetOf0(xQ,xO)
& equal(sbrdtbr0(xQ),xK)
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
inference(fof_nnf,[status(thm)],[100]) ).
fof(4649,plain,
( aSet0(xQ)
& ! [X2] :
( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xO) )
& aSubsetOf0(xQ,xO)
& equal(sbrdtbr0(xQ),xK)
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
inference(variable_rename,[status(thm)],[4648]) ).
fof(4650,plain,
! [X2] :
( ( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xO) )
& aSet0(xQ)
& aSubsetOf0(xQ,xO)
& equal(sbrdtbr0(xQ),xK)
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
inference(shift_quantors,[status(thm)],[4649]) ).
cnf(4652,plain,
sbrdtbr0(xQ) = xK,
inference(split_conjunct,[status(thm)],[4650]) ).
cnf(4654,plain,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[4650]) ).
cnf(5371,plain,
sdtmndt0(xQ,xp) = xP,
inference(rw,[status(thm)],[660,286,theory(equality)]) ).
cnf(5658,plain,
( isFinite0(xQ)
| ~ aSet0(xQ)
| ~ aElementOf0(xK,szNzAzT0) ),
inference(spm,[status(thm)],[479,4652,theory(equality)]) ).
cnf(5659,plain,
( isFinite0(xQ)
| $false
| ~ aElementOf0(xK,szNzAzT0) ),
inference(rw,[status(thm)],[5658,4654,theory(equality)]) ).
cnf(5660,plain,
( isFinite0(xQ)
| $false
| $false ),
inference(rw,[status(thm)],[5659,444,theory(equality)]) ).
cnf(5661,plain,
isFinite0(xQ),
inference(cn,[status(thm)],[5660,theory(equality)]) ).
cnf(5713,plain,
( isFinite0(xP)
| ~ isFinite0(xQ)
| ~ aSet0(xQ) ),
inference(spm,[status(thm)],[368,597,theory(equality)]) ).
cnf(5724,plain,
( isFinite0(xP)
| ~ isFinite0(xQ)
| $false ),
inference(rw,[status(thm)],[5713,4654,theory(equality)]) ).
cnf(5725,plain,
( isFinite0(xP)
| ~ isFinite0(xQ) ),
inference(cn,[status(thm)],[5724,theory(equality)]) ).
cnf(5834,plain,
( xk = X1
| xK != szszuzczcdt0(X1)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(xk,szNzAzT0) ),
inference(spm,[status(thm)],[474,238,theory(equality)]) ).
cnf(5836,plain,
( xk = X1
| xK != szszuzczcdt0(X1)
| ~ aElementOf0(X1,szNzAzT0)
| $false ),
inference(rw,[status(thm)],[5834,239,theory(equality)]) ).
cnf(5837,plain,
( xk = X1
| xK != szszuzczcdt0(X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[5836,theory(equality)]) ).
cnf(6182,plain,
( szszuzczcdt0(sbrdtbr0(sdtmndt0(xQ,xp))) = sbrdtbr0(xQ)
| ~ isFinite0(xQ)
| ~ aSet0(xQ) ),
inference(spm,[status(thm)],[348,287,theory(equality)]) ).
cnf(6199,plain,
( szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ)
| ~ isFinite0(xQ)
| ~ aSet0(xQ) ),
inference(rw,[status(thm)],[6182,5371,theory(equality)]) ).
cnf(6200,plain,
( szszuzczcdt0(sbrdtbr0(xP)) = xK
| ~ isFinite0(xQ)
| ~ aSet0(xQ) ),
inference(rw,[status(thm)],[6199,4652,theory(equality)]) ).
cnf(6201,plain,
( szszuzczcdt0(sbrdtbr0(xP)) = xK
| ~ isFinite0(xQ)
| $false ),
inference(rw,[status(thm)],[6200,4654,theory(equality)]) ).
cnf(6202,plain,
( szszuzczcdt0(sbrdtbr0(xP)) = xK
| ~ isFinite0(xQ) ),
inference(cn,[status(thm)],[6201,theory(equality)]) ).
cnf(59778,plain,
( isFinite0(xP)
| $false ),
inference(rw,[status(thm)],[5725,5661,theory(equality)]) ).
cnf(59779,plain,
isFinite0(xP),
inference(cn,[status(thm)],[59778,theory(equality)]) ).
cnf(59781,plain,
( aElementOf0(sbrdtbr0(xP),szNzAzT0)
| ~ aSet0(xP) ),
inference(spm,[status(thm)],[478,59779,theory(equality)]) ).
cnf(59785,plain,
( aElementOf0(sbrdtbr0(xP),szNzAzT0)
| $false ),
inference(rw,[status(thm)],[59781,661,theory(equality)]) ).
cnf(59786,plain,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(cn,[status(thm)],[59785,theory(equality)]) ).
cnf(134357,plain,
( szszuzczcdt0(sbrdtbr0(xP)) = xK
| $false ),
inference(rw,[status(thm)],[6202,5661,theory(equality)]) ).
cnf(134358,plain,
szszuzczcdt0(sbrdtbr0(xP)) = xK,
inference(cn,[status(thm)],[134357,theory(equality)]) ).
cnf(134364,plain,
( xk = sbrdtbr0(xP)
| ~ aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
inference(spm,[status(thm)],[5837,134358,theory(equality)]) ).
cnf(134435,plain,
( xk = sbrdtbr0(xP)
| $false ),
inference(rw,[status(thm)],[134364,59786,theory(equality)]) ).
cnf(134436,plain,
xk = sbrdtbr0(xP),
inference(cn,[status(thm)],[134435,theory(equality)]) ).
cnf(134437,plain,
$false,
inference(sr,[status(thm)],[134436,237,theory(equality)]) ).
cnf(134438,plain,
$false,
134437,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM611+3 : 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 : n122.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:37:45 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.28 --creating new selector for []
% 11.08/11.30 -running prover on /export/starexec/sandbox/tmp/tmpXDDR0w/sel_theBenchmark.p_1 with time limit 29
% 11.08/11.30 -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/tmpXDDR0w/sel_theBenchmark.p_1']
% 11.08/11.30 -prover status Theorem
% 11.08/11.30 Problem theBenchmark.p solved in phase 0.
% 11.08/11.30 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.08/11.30 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.08/11.30 Solved 1 out of 1.
% 11.08/11.30 # Problem is unsatisfiable (or provable), constructing proof object
% 11.08/11.30 # SZS status Theorem
% 11.08/11.30 # SZS output start CNFRefutation.
% See solution above
% 11.08/11.31 # SZS output end CNFRefutation
%------------------------------------------------------------------------------