TSTP Solution File: RNG090+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG090+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 02:14:36 EST 2010
% Result : Theorem 0.35s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 10
% Syntax : Number of formulae : 90 ( 27 unt; 0 def)
% Number of atoms : 281 ( 40 equ)
% Maximal formula atoms : 29 ( 3 avg)
% Number of connectives : 319 ( 128 ~; 139 |; 43 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-2 aty)
% Number of variables : 83 ( 0 sgn 53 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/tmp/tmpsa5weH/sel_RNG090+1.p_1',mEOfElem) ).
fof(3,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/tmp/tmpsa5weH/sel_RNG090+1.p_1',mAddComm) ).
fof(4,axiom,
( aElementOf0(sdtpldt0(xk,xm),xI)
& aElementOf0(sdtpldt0(xl,xn),xJ) ),
file('/tmp/tmpsa5weH/sel_RNG090+1.p_1',m__994) ).
fof(7,axiom,
( aElementOf0(xk,xI)
& aElementOf0(xl,xJ)
& xx = sdtpldt0(xk,xl) ),
file('/tmp/tmpsa5weH/sel_RNG090+1.p_1',m__934) ).
fof(9,conjecture,
sdtpldt0(xx,xy) = sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
file('/tmp/tmpsa5weH/sel_RNG090+1.p_1',m__) ).
fof(10,axiom,
( aIdeal0(xI)
& aIdeal0(xJ) ),
file('/tmp/tmpsa5weH/sel_RNG090+1.p_1',m__870) ).
fof(13,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3) )
=> sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
file('/tmp/tmpsa5weH/sel_RNG090+1.p_1',mAddAsso) ).
fof(16,axiom,
! [X1] :
( aIdeal0(X1)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> ( ! [X3] :
( aElementOf0(X3,X1)
=> aElementOf0(sdtpldt0(X2,X3),X1) )
& ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X2),X1) ) ) ) ) ),
file('/tmp/tmpsa5weH/sel_RNG090+1.p_1',mDefIdeal) ).
fof(22,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtpldt0(X1,X2)) ),
file('/tmp/tmpsa5weH/sel_RNG090+1.p_1',mSortsB) ).
fof(28,axiom,
( aElementOf0(xm,xI)
& aElementOf0(xn,xJ)
& xy = sdtpldt0(xm,xn) ),
file('/tmp/tmpsa5weH/sel_RNG090+1.p_1',m__967) ).
fof(32,negated_conjecture,
sdtpldt0(xx,xy) != sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
inference(assume_negation,[status(cth)],[9]) ).
fof(33,negated_conjecture,
sdtpldt0(xx,xy) != sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
inference(fof_simplification,[status(thm)],[32,theory(equality)]) ).
fof(34,plain,
! [X1] :
( ~ aSet0(X1)
| ! [X2] :
( ~ aElementOf0(X2,X1)
| aElement0(X2) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(35,plain,
! [X3] :
( ~ aSet0(X3)
| ! [X4] :
( ~ aElementOf0(X4,X3)
| aElement0(X4) ) ),
inference(variable_rename,[status(thm)],[34]) ).
fof(36,plain,
! [X3,X4] :
( ~ aElementOf0(X4,X3)
| aElement0(X4)
| ~ aSet0(X3) ),
inference(shift_quantors,[status(thm)],[35]) ).
cnf(37,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[36]) ).
fof(43,plain,
! [X1,X2] :
( ~ aElement0(X1)
| ~ aElement0(X2)
| sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(44,plain,
! [X3,X4] :
( ~ aElement0(X3)
| ~ aElement0(X4)
| sdtpldt0(X3,X4) = sdtpldt0(X4,X3) ),
inference(variable_rename,[status(thm)],[43]) ).
cnf(45,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[44]) ).
cnf(46,plain,
aElementOf0(sdtpldt0(xl,xn),xJ),
inference(split_conjunct,[status(thm)],[4]) ).
cnf(61,plain,
xx = sdtpldt0(xk,xl),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(62,plain,
aElementOf0(xl,xJ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(63,plain,
aElementOf0(xk,xI),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(67,negated_conjecture,
sdtpldt0(xx,xy) != sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
inference(split_conjunct,[status(thm)],[33]) ).
cnf(68,plain,
aIdeal0(xJ),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(69,plain,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[10]) ).
fof(78,plain,
! [X1,X2,X3] :
( ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3)
| sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(79,plain,
! [X4,X5,X6] :
( ~ aElement0(X4)
| ~ aElement0(X5)
| ~ aElement0(X6)
| sdtpldt0(sdtpldt0(X4,X5),X6) = sdtpldt0(X4,sdtpldt0(X5,X6)) ),
inference(variable_rename,[status(thm)],[78]) ).
cnf(80,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[79]) ).
fof(83,plain,
! [X1] :
( ( ~ aIdeal0(X1)
| ( aSet0(X1)
& ! [X2] :
( ~ aElementOf0(X2,X1)
| ( ! [X3] :
( ~ aElementOf0(X3,X1)
| aElementOf0(sdtpldt0(X2,X3),X1) )
& ! [X3] :
( ~ aElement0(X3)
| aElementOf0(sdtasdt0(X3,X2),X1) ) ) ) ) )
& ( ~ aSet0(X1)
| ? [X2] :
( aElementOf0(X2,X1)
& ( ? [X3] :
( aElementOf0(X3,X1)
& ~ aElementOf0(sdtpldt0(X2,X3),X1) )
| ? [X3] :
( aElement0(X3)
& ~ aElementOf0(sdtasdt0(X3,X2),X1) ) ) )
| aIdeal0(X1) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(84,plain,
! [X4] :
( ( ~ aIdeal0(X4)
| ( aSet0(X4)
& ! [X5] :
( ~ aElementOf0(X5,X4)
| ( ! [X6] :
( ~ aElementOf0(X6,X4)
| aElementOf0(sdtpldt0(X5,X6),X4) )
& ! [X7] :
( ~ aElement0(X7)
| aElementOf0(sdtasdt0(X7,X5),X4) ) ) ) ) )
& ( ~ aSet0(X4)
| ? [X8] :
( aElementOf0(X8,X4)
& ( ? [X9] :
( aElementOf0(X9,X4)
& ~ aElementOf0(sdtpldt0(X8,X9),X4) )
| ? [X10] :
( aElement0(X10)
& ~ aElementOf0(sdtasdt0(X10,X8),X4) ) ) )
| aIdeal0(X4) ) ),
inference(variable_rename,[status(thm)],[83]) ).
fof(85,plain,
! [X4] :
( ( ~ aIdeal0(X4)
| ( aSet0(X4)
& ! [X5] :
( ~ aElementOf0(X5,X4)
| ( ! [X6] :
( ~ aElementOf0(X6,X4)
| aElementOf0(sdtpldt0(X5,X6),X4) )
& ! [X7] :
( ~ aElement0(X7)
| aElementOf0(sdtasdt0(X7,X5),X4) ) ) ) ) )
& ( ~ aSet0(X4)
| ( aElementOf0(esk3_1(X4),X4)
& ( ( aElementOf0(esk4_1(X4),X4)
& ~ aElementOf0(sdtpldt0(esk3_1(X4),esk4_1(X4)),X4) )
| ( aElement0(esk5_1(X4))
& ~ aElementOf0(sdtasdt0(esk5_1(X4),esk3_1(X4)),X4) ) ) )
| aIdeal0(X4) ) ),
inference(skolemize,[status(esa)],[84]) ).
fof(86,plain,
! [X4,X5,X6,X7] :
( ( ( ( ( ( ~ aElement0(X7)
| aElementOf0(sdtasdt0(X7,X5),X4) )
& ( ~ aElementOf0(X6,X4)
| aElementOf0(sdtpldt0(X5,X6),X4) ) )
| ~ aElementOf0(X5,X4) )
& aSet0(X4) )
| ~ aIdeal0(X4) )
& ( ~ aSet0(X4)
| ( aElementOf0(esk3_1(X4),X4)
& ( ( aElementOf0(esk4_1(X4),X4)
& ~ aElementOf0(sdtpldt0(esk3_1(X4),esk4_1(X4)),X4) )
| ( aElement0(esk5_1(X4))
& ~ aElementOf0(sdtasdt0(esk5_1(X4),esk3_1(X4)),X4) ) ) )
| aIdeal0(X4) ) ),
inference(shift_quantors,[status(thm)],[85]) ).
fof(87,plain,
! [X4,X5,X6,X7] :
( ( ~ aElement0(X7)
| aElementOf0(sdtasdt0(X7,X5),X4)
| ~ aElementOf0(X5,X4)
| ~ aIdeal0(X4) )
& ( ~ aElementOf0(X6,X4)
| aElementOf0(sdtpldt0(X5,X6),X4)
| ~ aElementOf0(X5,X4)
| ~ aIdeal0(X4) )
& ( aSet0(X4)
| ~ aIdeal0(X4) )
& ( aElementOf0(esk3_1(X4),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( aElement0(esk5_1(X4))
| aElementOf0(esk4_1(X4),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( ~ aElementOf0(sdtasdt0(esk5_1(X4),esk3_1(X4)),X4)
| aElementOf0(esk4_1(X4),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( aElement0(esk5_1(X4))
| ~ aElementOf0(sdtpldt0(esk3_1(X4),esk4_1(X4)),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( ~ aElementOf0(sdtasdt0(esk5_1(X4),esk3_1(X4)),X4)
| ~ aElementOf0(sdtpldt0(esk3_1(X4),esk4_1(X4)),X4)
| ~ aSet0(X4)
| aIdeal0(X4) ) ),
inference(distribute,[status(thm)],[86]) ).
cnf(93,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
inference(split_conjunct,[status(thm)],[87]) ).
fof(122,plain,
! [X1,X2] :
( ~ aElement0(X1)
| ~ aElement0(X2)
| aElement0(sdtpldt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(123,plain,
! [X3,X4] :
( ~ aElement0(X3)
| ~ aElement0(X4)
| aElement0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[122]) ).
cnf(124,plain,
( aElement0(sdtpldt0(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[123]) ).
cnf(144,plain,
xy = sdtpldt0(xm,xn),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(145,plain,
aElementOf0(xn,xJ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(146,plain,
aElementOf0(xm,xI),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(164,plain,
aSet0(xI),
inference(spm,[status(thm)],[93,69,theory(equality)]) ).
cnf(165,plain,
aSet0(xJ),
inference(spm,[status(thm)],[93,68,theory(equality)]) ).
cnf(178,plain,
( aElement0(xk)
| ~ aSet0(xI) ),
inference(spm,[status(thm)],[37,63,theory(equality)]) ).
cnf(179,plain,
( aElement0(xm)
| ~ aSet0(xI) ),
inference(spm,[status(thm)],[37,146,theory(equality)]) ).
cnf(180,plain,
( aElement0(xl)
| ~ aSet0(xJ) ),
inference(spm,[status(thm)],[37,62,theory(equality)]) ).
cnf(181,plain,
( aElement0(xn)
| ~ aSet0(xJ) ),
inference(spm,[status(thm)],[37,145,theory(equality)]) ).
cnf(183,plain,
( aElement0(sdtpldt0(xl,xn))
| ~ aSet0(xJ) ),
inference(spm,[status(thm)],[37,46,theory(equality)]) ).
cnf(272,plain,
( aElement0(xy)
| ~ aElement0(xn)
| ~ aElement0(xm) ),
inference(spm,[status(thm)],[124,144,theory(equality)]) ).
cnf(322,plain,
( sdtpldt0(xx,X1) = sdtpldt0(xk,sdtpldt0(xl,X1))
| ~ aElement0(X1)
| ~ aElement0(xl)
| ~ aElement0(xk) ),
inference(spm,[status(thm)],[80,61,theory(equality)]) ).
cnf(323,plain,
( sdtpldt0(xy,X1) = sdtpldt0(xm,sdtpldt0(xn,X1))
| ~ aElement0(X1)
| ~ aElement0(xn)
| ~ aElement0(xm) ),
inference(spm,[status(thm)],[80,144,theory(equality)]) ).
cnf(324,negated_conjecture,
( sdtpldt0(xk,sdtpldt0(xm,sdtpldt0(xl,xn))) != sdtpldt0(xx,xy)
| ~ aElement0(sdtpldt0(xl,xn))
| ~ aElement0(xm)
| ~ aElement0(xk) ),
inference(spm,[status(thm)],[67,80,theory(equality)]) ).
cnf(464,plain,
( aElement0(xk)
| $false ),
inference(rw,[status(thm)],[178,164,theory(equality)]) ).
cnf(465,plain,
aElement0(xk),
inference(cn,[status(thm)],[464,theory(equality)]) ).
cnf(466,negated_conjecture,
( sdtpldt0(xk,sdtpldt0(xm,sdtpldt0(xl,xn))) != sdtpldt0(xx,xy)
| ~ aElement0(sdtpldt0(xl,xn))
| ~ aElement0(xm)
| $false ),
inference(rw,[status(thm)],[324,465,theory(equality)]) ).
cnf(467,negated_conjecture,
( sdtpldt0(xk,sdtpldt0(xm,sdtpldt0(xl,xn))) != sdtpldt0(xx,xy)
| ~ aElement0(sdtpldt0(xl,xn))
| ~ aElement0(xm) ),
inference(cn,[status(thm)],[466,theory(equality)]) ).
cnf(468,plain,
( aElement0(xm)
| $false ),
inference(rw,[status(thm)],[179,164,theory(equality)]) ).
cnf(469,plain,
aElement0(xm),
inference(cn,[status(thm)],[468,theory(equality)]) ).
cnf(470,plain,
( aElement0(xl)
| $false ),
inference(rw,[status(thm)],[180,165,theory(equality)]) ).
cnf(471,plain,
aElement0(xl),
inference(cn,[status(thm)],[470,theory(equality)]) ).
cnf(472,plain,
( aElement0(xn)
| $false ),
inference(rw,[status(thm)],[181,165,theory(equality)]) ).
cnf(473,plain,
aElement0(xn),
inference(cn,[status(thm)],[472,theory(equality)]) ).
cnf(474,negated_conjecture,
( sdtpldt0(xk,sdtpldt0(xm,sdtpldt0(xl,xn))) != sdtpldt0(xx,xy)
| ~ aElement0(sdtpldt0(xl,xn))
| $false ),
inference(rw,[status(thm)],[467,469,theory(equality)]) ).
cnf(475,negated_conjecture,
( sdtpldt0(xk,sdtpldt0(xm,sdtpldt0(xl,xn))) != sdtpldt0(xx,xy)
| ~ aElement0(sdtpldt0(xl,xn)) ),
inference(cn,[status(thm)],[474,theory(equality)]) ).
cnf(511,plain,
( aElement0(sdtpldt0(xl,xn))
| $false ),
inference(rw,[status(thm)],[183,165,theory(equality)]) ).
cnf(512,plain,
aElement0(sdtpldt0(xl,xn)),
inference(cn,[status(thm)],[511,theory(equality)]) ).
cnf(513,negated_conjecture,
( sdtpldt0(xk,sdtpldt0(xm,sdtpldt0(xl,xn))) != sdtpldt0(xx,xy)
| $false ),
inference(rw,[status(thm)],[475,512,theory(equality)]) ).
cnf(514,negated_conjecture,
sdtpldt0(xk,sdtpldt0(xm,sdtpldt0(xl,xn))) != sdtpldt0(xx,xy),
inference(cn,[status(thm)],[513,theory(equality)]) ).
cnf(521,plain,
( aElement0(xy)
| $false
| ~ aElement0(xm) ),
inference(rw,[status(thm)],[272,473,theory(equality)]) ).
cnf(522,plain,
( aElement0(xy)
| $false
| $false ),
inference(rw,[status(thm)],[521,469,theory(equality)]) ).
cnf(523,plain,
aElement0(xy),
inference(cn,[status(thm)],[522,theory(equality)]) ).
cnf(648,plain,
( sdtpldt0(xk,sdtpldt0(xl,X1)) = sdtpldt0(xx,X1)
| ~ aElement0(X1)
| $false
| ~ aElement0(xk) ),
inference(rw,[status(thm)],[322,471,theory(equality)]) ).
cnf(649,plain,
( sdtpldt0(xk,sdtpldt0(xl,X1)) = sdtpldt0(xx,X1)
| ~ aElement0(X1)
| $false
| $false ),
inference(rw,[status(thm)],[648,465,theory(equality)]) ).
cnf(650,plain,
( sdtpldt0(xk,sdtpldt0(xl,X1)) = sdtpldt0(xx,X1)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[649,theory(equality)]) ).
cnf(653,plain,
( sdtpldt0(xk,sdtpldt0(X1,xl)) = sdtpldt0(xx,X1)
| ~ aElement0(X1)
| ~ aElement0(xl) ),
inference(spm,[status(thm)],[650,45,theory(equality)]) ).
cnf(664,plain,
( sdtpldt0(xk,sdtpldt0(X1,xl)) = sdtpldt0(xx,X1)
| ~ aElement0(X1)
| $false ),
inference(rw,[status(thm)],[653,471,theory(equality)]) ).
cnf(665,plain,
( sdtpldt0(xk,sdtpldt0(X1,xl)) = sdtpldt0(xx,X1)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[664,theory(equality)]) ).
cnf(4699,plain,
( sdtpldt0(xm,sdtpldt0(xn,X1)) = sdtpldt0(xy,X1)
| ~ aElement0(X1)
| $false
| ~ aElement0(xm) ),
inference(rw,[status(thm)],[323,473,theory(equality)]) ).
cnf(4700,plain,
( sdtpldt0(xm,sdtpldt0(xn,X1)) = sdtpldt0(xy,X1)
| ~ aElement0(X1)
| $false
| $false ),
inference(rw,[status(thm)],[4699,469,theory(equality)]) ).
cnf(4701,plain,
( sdtpldt0(xm,sdtpldt0(xn,X1)) = sdtpldt0(xy,X1)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[4700,theory(equality)]) ).
cnf(4704,plain,
( sdtpldt0(xm,sdtpldt0(X1,xn)) = sdtpldt0(xy,X1)
| ~ aElement0(X1)
| ~ aElement0(xn) ),
inference(spm,[status(thm)],[4701,45,theory(equality)]) ).
cnf(4717,plain,
( sdtpldt0(xm,sdtpldt0(X1,xn)) = sdtpldt0(xy,X1)
| ~ aElement0(X1)
| $false ),
inference(rw,[status(thm)],[4704,473,theory(equality)]) ).
cnf(4718,plain,
( sdtpldt0(xm,sdtpldt0(X1,xn)) = sdtpldt0(xy,X1)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[4717,theory(equality)]) ).
cnf(5190,plain,
( sdtpldt0(xk,sdtpldt0(xy,xl)) != sdtpldt0(xx,xy)
| ~ aElement0(xl) ),
inference(spm,[status(thm)],[514,4718,theory(equality)]) ).
cnf(5204,plain,
( sdtpldt0(xk,sdtpldt0(xy,xl)) != sdtpldt0(xx,xy)
| $false ),
inference(rw,[status(thm)],[5190,471,theory(equality)]) ).
cnf(5205,plain,
sdtpldt0(xk,sdtpldt0(xy,xl)) != sdtpldt0(xx,xy),
inference(cn,[status(thm)],[5204,theory(equality)]) ).
cnf(5362,plain,
~ aElement0(xy),
inference(spm,[status(thm)],[5205,665,theory(equality)]) ).
cnf(5369,plain,
$false,
inference(rw,[status(thm)],[5362,523,theory(equality)]) ).
cnf(5370,plain,
$false,
inference(cn,[status(thm)],[5369,theory(equality)]) ).
cnf(5371,plain,
$false,
5370,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG090+1.p
% --creating new selector for []
% -running prover on /tmp/tmpsa5weH/sel_RNG090+1.p_1 with time limit 29
% -prover status Theorem
% Problem RNG090+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG090+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG090+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------