TSTP Solution File: REL026+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : REL026+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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 01:16:26 EST 2010
% Result : Theorem 230.20s
% Output : CNFRefutation 230.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 35
% Number of leaves : 12
% Syntax : Number of formulae : 124 ( 119 unt; 0 def)
% Number of atoms : 129 ( 126 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 0 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 210 ( 27 sgn 46 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/tmp/tmpnQm5--/sel_REL026+1.p_4',converse_multiplicativity) ).
fof(2,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/tmp/tmpnQm5--/sel_REL026+1.p_4',maddux4_definiton_of_meet) ).
fof(3,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/tmp/tmpnQm5--/sel_REL026+1.p_4',converse_idempotence) ).
fof(4,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/tmp/tmpnQm5--/sel_REL026+1.p_4',composition_distributivity) ).
fof(5,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/tmp/tmpnQm5--/sel_REL026+1.p_4',converse_additivity) ).
fof(6,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/tmp/tmpnQm5--/sel_REL026+1.p_4',maddux1_join_commutativity) ).
fof(8,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/tmp/tmpnQm5--/sel_REL026+1.p_4',def_top) ).
fof(9,axiom,
! [X1] : composition(X1,one) = X1,
file('/tmp/tmpnQm5--/sel_REL026+1.p_4',composition_identity) ).
fof(10,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/tmp/tmpnQm5--/sel_REL026+1.p_4',converse_cancellativity) ).
fof(11,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/tmp/tmpnQm5--/sel_REL026+1.p_4',maddux2_join_associativity) ).
fof(12,axiom,
! [X1,X2] : X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/tmp/tmpnQm5--/sel_REL026+1.p_4',maddux3_a_kind_of_de_Morgan) ).
fof(13,conjecture,
! [X1,X2] :
( join(X1,one) = one
=> meet(composition(X1,top),X2) = composition(X1,X2) ),
file('/tmp/tmpnQm5--/sel_REL026+1.p_4',goals) ).
fof(14,negated_conjecture,
~ ! [X1,X2] :
( join(X1,one) = one
=> meet(composition(X1,top),X2) = composition(X1,X2) ),
inference(assume_negation,[status(cth)],[13]) ).
fof(15,plain,
! [X3,X4] : converse(composition(X3,X4)) = composition(converse(X4),converse(X3)),
inference(variable_rename,[status(thm)],[1]) ).
cnf(16,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[15]) ).
fof(17,plain,
! [X3,X4] : meet(X3,X4) = complement(join(complement(X3),complement(X4))),
inference(variable_rename,[status(thm)],[2]) ).
cnf(18,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[17]) ).
fof(19,plain,
! [X2] : converse(converse(X2)) = X2,
inference(variable_rename,[status(thm)],[3]) ).
cnf(20,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[19]) ).
fof(21,plain,
! [X4,X5,X6] : composition(join(X4,X5),X6) = join(composition(X4,X6),composition(X5,X6)),
inference(variable_rename,[status(thm)],[4]) ).
cnf(22,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[21]) ).
fof(23,plain,
! [X3,X4] : converse(join(X3,X4)) = join(converse(X3),converse(X4)),
inference(variable_rename,[status(thm)],[5]) ).
cnf(24,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[23]) ).
fof(25,plain,
! [X3,X4] : join(X3,X4) = join(X4,X3),
inference(variable_rename,[status(thm)],[6]) ).
cnf(26,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[25]) ).
fof(29,plain,
! [X2] : top = join(X2,complement(X2)),
inference(variable_rename,[status(thm)],[8]) ).
cnf(30,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[29]) ).
fof(31,plain,
! [X2] : composition(X2,one) = X2,
inference(variable_rename,[status(thm)],[9]) ).
cnf(32,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[31]) ).
fof(33,plain,
! [X3,X4] : join(composition(converse(X3),complement(composition(X3,X4))),complement(X4)) = complement(X4),
inference(variable_rename,[status(thm)],[10]) ).
cnf(34,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[33]) ).
fof(35,plain,
! [X4,X5,X6] : join(X4,join(X5,X6)) = join(join(X4,X5),X6),
inference(variable_rename,[status(thm)],[11]) ).
cnf(36,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[35]) ).
fof(37,plain,
! [X3,X4] : X3 = join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),
inference(variable_rename,[status(thm)],[12]) ).
cnf(38,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[37]) ).
fof(39,negated_conjecture,
? [X1,X2] :
( join(X1,one) = one
& meet(composition(X1,top),X2) != composition(X1,X2) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(40,negated_conjecture,
? [X3,X4] :
( join(X3,one) = one
& meet(composition(X3,top),X4) != composition(X3,X4) ),
inference(variable_rename,[status(thm)],[39]) ).
fof(41,negated_conjecture,
( join(esk1_0,one) = one
& meet(composition(esk1_0,top),esk2_0) != composition(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[40]) ).
cnf(42,negated_conjecture,
meet(composition(esk1_0,top),esk2_0) != composition(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(43,negated_conjecture,
join(esk1_0,one) = one,
inference(split_conjunct,[status(thm)],[41]) ).
cnf(44,negated_conjecture,
complement(join(complement(composition(esk1_0,top)),complement(esk2_0))) != composition(esk1_0,esk2_0),
inference(rw,[status(thm)],[42,18,theory(equality)]),
[unfolding] ).
cnf(45,negated_conjecture,
join(one,esk1_0) = one,
inference(rw,[status(thm)],[43,26,theory(equality)]) ).
cnf(46,negated_conjecture,
complement(join(complement(esk2_0),complement(composition(esk1_0,top)))) != composition(esk1_0,esk2_0),
inference(rw,[status(thm)],[44,26,theory(equality)]) ).
cnf(48,plain,
composition(converse(X1),X2) = converse(composition(converse(X2),X1)),
inference(spm,[status(thm)],[16,20,theory(equality)]) ).
cnf(63,plain,
join(top,X2) = join(X1,join(complement(X1),X2)),
inference(spm,[status(thm)],[36,30,theory(equality)]) ).
cnf(66,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[26,36,theory(equality)]) ).
cnf(77,plain,
join(composition(X1,converse(X2)),converse(composition(X2,X3))) = composition(join(X1,converse(X3)),converse(X2)),
inference(spm,[status(thm)],[22,16,theory(equality)]) ).
cnf(89,plain,
join(complement(X2),composition(converse(X1),complement(composition(X1,X2)))) = complement(X2),
inference(rw,[status(thm)],[34,26,theory(equality)]) ).
cnf(96,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[38,26,theory(equality)]) ).
cnf(102,plain,
join(complement(join(complement(join(complement(X1),X2)),join(complement(X1),complement(X2)))),complement(X1)) = join(complement(X1),X2),
inference(spm,[status(thm)],[96,96,theory(equality)]) ).
cnf(103,plain,
join(complement(join(X2,complement(X1))),complement(join(complement(X1),complement(X2)))) = X1,
inference(spm,[status(thm)],[96,26,theory(equality)]) ).
cnf(108,plain,
join(complement(X1),complement(join(complement(X1),join(complement(X2),complement(join(complement(X1),X2)))))) = join(complement(X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[102,26,theory(equality)]),36,theory(equality)]),26,theory(equality)]) ).
cnf(143,plain,
converse(converse(X1)) = composition(converse(one),X1),
inference(spm,[status(thm)],[48,32,theory(equality)]) ).
cnf(147,plain,
join(composition(converse(X2),X1),converse(X3)) = converse(join(composition(converse(X1),X2),X3)),
inference(spm,[status(thm)],[24,48,theory(equality)]) ).
cnf(157,plain,
X1 = composition(converse(one),X1),
inference(rw,[status(thm)],[143,20,theory(equality)]) ).
cnf(169,plain,
one = converse(one),
inference(spm,[status(thm)],[32,157,theory(equality)]) ).
cnf(195,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[157,169,theory(equality)]) ).
cnf(203,plain,
join(X1,composition(X2,X1)) = composition(join(one,X2),X1),
inference(spm,[status(thm)],[22,195,theory(equality)]) ).
cnf(205,plain,
join(complement(X1),composition(converse(one),complement(X1))) = complement(X1),
inference(spm,[status(thm)],[89,195,theory(equality)]) ).
cnf(210,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[205,169,theory(equality)]),195,theory(equality)]) ).
cnf(237,plain,
join(complement(X1),X2) = join(complement(X1),join(complement(X1),X2)),
inference(spm,[status(thm)],[36,210,theory(equality)]) ).
cnf(238,plain,
join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1))))) = X1,
inference(spm,[status(thm)],[96,210,theory(equality)]) ).
cnf(242,plain,
join(complement(top),complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[238,30,theory(equality)]),26,theory(equality)]) ).
cnf(400,plain,
join(X1,top) = join(top,complement(complement(X1))),
inference(spm,[status(thm)],[63,30,theory(equality)]) ).
cnf(407,plain,
join(X1,complement(X1)) = join(top,complement(X1)),
inference(spm,[status(thm)],[63,210,theory(equality)]) ).
cnf(420,plain,
top = join(top,complement(X1)),
inference(rw,[status(thm)],[407,30,theory(equality)]) ).
cnf(425,plain,
top = join(X1,top),
inference(rw,[status(thm)],[400,420,theory(equality)]) ).
cnf(432,plain,
top = join(top,X1),
inference(spm,[status(thm)],[26,425,theory(equality)]) ).
cnf(446,plain,
join(X1,join(complement(X1),X2)) = top,
inference(rw,[status(thm)],[63,432,theory(equality)]) ).
cnf(532,plain,
join(join(complement(X1),X2),X1) = top,
inference(spm,[status(thm)],[446,96,theory(equality)]) ).
cnf(542,plain,
join(X1,join(X2,complement(X1))) = top,
inference(spm,[status(thm)],[446,26,theory(equality)]) ).
cnf(548,plain,
join(complement(X1),join(X2,X1)) = top,
inference(rw,[status(thm)],[532,36,theory(equality)]) ).
cnf(560,plain,
join(top,X3) = join(complement(X1),join(join(X2,X1),X3)),
inference(spm,[status(thm)],[36,548,theory(equality)]) ).
cnf(582,plain,
join(join(X1,X2),complement(X2)) = top,
inference(spm,[status(thm)],[26,548,theory(equality)]) ).
cnf(586,plain,
top = join(complement(X1),join(join(X2,X1),X3)),
inference(rw,[status(thm)],[560,432,theory(equality)]) ).
cnf(587,plain,
top = join(complement(X1),join(X2,join(X1,X3))),
inference(rw,[status(thm)],[586,36,theory(equality)]) ).
cnf(606,plain,
join(X1,join(X2,complement(X2))) = top,
inference(rw,[status(thm)],[582,36,theory(equality)]) ).
cnf(610,plain,
join(X1,join(X2,join(X3,complement(X1)))) = top,
inference(spm,[status(thm)],[542,36,theory(equality)]) ).
cnf(2742,plain,
join(complement(join(X3,join(complement(X1),X2))),complement(join(complement(X1),complement(join(X2,X3))))) = X1,
inference(spm,[status(thm)],[96,66,theory(equality)]) ).
cnf(3659,plain,
join(complement(top),X1) = X1,
inference(spm,[status(thm)],[237,242,theory(equality)]) ).
cnf(3808,plain,
X1 = join(X1,complement(top)),
inference(spm,[status(thm)],[26,3659,theory(equality)]) ).
cnf(3818,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[242,3659,theory(equality)]) ).
cnf(3869,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[210,3818,theory(equality)]) ).
cnf(3878,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[237,3818,theory(equality)]) ).
cnf(3942,plain,
join(X1,X2) = join(X2,join(X1,X2)),
inference(spm,[status(thm)],[66,3869,theory(equality)]) ).
cnf(4608,plain,
join(complement(join(complement(X1),X2)),X1) = X1,
inference(spm,[status(thm)],[3878,96,theory(equality)]) ).
cnf(4716,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[4608,26,theory(equality)]) ).
cnf(5816,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[4716,3942,theory(equality)]) ).
cnf(5824,plain,
join(X1,complement(join(X2,join(X3,complement(X1))))) = X1,
inference(spm,[status(thm)],[4716,66,theory(equality)]) ).
cnf(5911,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[5816,3818,theory(equality)]) ).
cnf(12977,plain,
join(complement(X1),complement(join(complement(X1),complement(X2)))) = join(complement(X1),X2),
inference(rw,[status(thm)],[108,5911,theory(equality)]) ).
cnf(12999,plain,
join(X1,complement(join(X1,complement(X2)))) = join(X1,X2),
inference(spm,[status(thm)],[12977,3818,theory(equality)]) ).
cnf(13426,plain,
join(X1,complement(join(X1,X2))) = join(X1,complement(X2)),
inference(spm,[status(thm)],[12999,3818,theory(equality)]) ).
cnf(13620,plain,
join(X1,complement(top)) = join(X1,complement(join(X2,complement(X2)))),
inference(spm,[status(thm)],[13426,606,theory(equality)]) ).
cnf(13738,plain,
join(X1,complement(complement(X2))) = join(X1,X2),
inference(rw,[status(thm)],[12999,13426,theory(equality)]) ).
cnf(13777,plain,
X1 = join(X1,complement(join(X2,complement(X2)))),
inference(rw,[status(thm)],[13620,3808,theory(equality)]) ).
cnf(14357,plain,
join(complement(join(join(X1,complement(complement(X2))),complement(X2))),complement(complement(X2))) = X2,
inference(spm,[status(thm)],[103,5816,theory(equality)]) ).
cnf(14435,plain,
complement(complement(X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[14357,13738,theory(equality)]),36,theory(equality)]),606,theory(equality)]),3659,theory(equality)]) ).
cnf(14916,plain,
X1 = join(complement(join(X2,complement(X2))),X1),
inference(spm,[status(thm)],[26,13777,theory(equality)]) ).
cnf(15005,plain,
join(complement(X2),complement(join(complement(join(X1,complement(X1))),complement(X2)))) = join(X1,complement(X1)),
inference(spm,[status(thm)],[96,14916,theory(equality)]) ).
cnf(15112,plain,
join(X2,complement(X2)) = join(X1,complement(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[15005,30,theory(equality)]),3659,theory(equality)]),14435,theory(equality)]),26,theory(equality)]) ).
cnf(15113,plain,
join(X2,complement(X2)) = top,
inference(rw,[status(thm)],[15112,30,theory(equality)]) ).
cnf(21277,plain,
converse(composition(join(converse(X1),converse(X3)),converse(X2))) = join(composition(converse(converse(X2)),X1),converse(converse(composition(X2,X3)))),
inference(spm,[status(thm)],[147,77,theory(equality)]) ).
cnf(21385,plain,
composition(X2,join(X1,X3)) = join(composition(converse(converse(X2)),X1),converse(converse(composition(X2,X3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[21277,24,theory(equality)]),16,theory(equality)]),20,theory(equality)]) ).
cnf(21386,plain,
composition(X2,join(X1,X3)) = join(composition(X2,X1),composition(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[21385,20,theory(equality)]),20,theory(equality)]) ).
cnf(24495,negated_conjecture,
join(X1,composition(esk1_0,X1)) = composition(one,X1),
inference(spm,[status(thm)],[203,45,theory(equality)]) ).
cnf(24653,negated_conjecture,
join(X1,composition(esk1_0,X1)) = X1,
inference(rw,[status(thm)],[24495,195,theory(equality)]) ).
cnf(24754,negated_conjecture,
join(X1,X2) = join(X1,join(composition(esk1_0,X1),X2)),
inference(spm,[status(thm)],[36,24653,theory(equality)]) ).
cnf(24780,negated_conjecture,
join(complement(composition(esk1_0,X1)),complement(X1)) = complement(composition(esk1_0,X1)),
inference(spm,[status(thm)],[5911,24653,theory(equality)]) ).
cnf(24845,negated_conjecture,
join(complement(X1),complement(composition(esk1_0,X1))) = complement(composition(esk1_0,X1)),
inference(rw,[status(thm)],[24780,26,theory(equality)]) ).
cnf(29751,negated_conjecture,
join(X1,composition(esk1_0,join(X1,X2))) = join(X1,composition(esk1_0,X2)),
inference(spm,[status(thm)],[24754,21386,theory(equality)]) ).
cnf(53506,plain,
join(complement(join(join(X1,join(X2,complement(complement(X3)))),complement(X3))),complement(complement(X3))) = X3,
inference(spm,[status(thm)],[103,5824,theory(equality)]) ).
cnf(53753,plain,
join(complement(top),X3) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[53506,13738,theory(equality)]),36,theory(equality)]),36,theory(equality)]),606,theory(equality)]),425,theory(equality)]),14435,theory(equality)]) ).
cnf(94210,negated_conjecture,
join(X1,composition(esk1_0,top)) = join(X1,composition(esk1_0,complement(X1))),
inference(spm,[status(thm)],[29751,15113,theory(equality)]) ).
cnf(94902,negated_conjecture,
join(X1,complement(join(X1,composition(esk1_0,top)))) = join(X1,complement(composition(esk1_0,complement(X1)))),
inference(spm,[status(thm)],[13426,94210,theory(equality)]) ).
cnf(95041,negated_conjecture,
join(X1,complement(composition(esk1_0,top))) = join(X1,complement(composition(esk1_0,complement(X1)))),
inference(rw,[status(thm)],[94902,13426,theory(equality)]) ).
cnf(211605,plain,
join(complement(join(join(X1,join(X2,X3)),join(complement(X4),complement(X2)))),complement(join(complement(X4),complement(top)))) = X4,
inference(spm,[status(thm)],[2742,587,theory(equality)]) ).
cnf(212400,plain,
complement(complement(X4)) = X4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[211605,36,theory(equality)]),36,theory(equality)]),610,theory(equality)]),425,theory(equality)]),3808,theory(equality)]),53753,theory(equality)]) ).
cnf(213139,negated_conjecture,
join(X1,complement(composition(esk1_0,complement(X1)))) = complement(composition(esk1_0,complement(X1))),
inference(spm,[status(thm)],[24845,212400,theory(equality)]) ).
cnf(1320559,negated_conjecture,
complement(composition(esk1_0,complement(X1))) = join(X1,complement(composition(esk1_0,top))),
inference(rw,[status(thm)],[95041,213139,theory(equality)]) ).
cnf(1320687,negated_conjecture,
complement(join(X1,complement(composition(esk1_0,top)))) = composition(esk1_0,complement(X1)),
inference(spm,[status(thm)],[212400,1320559,theory(equality)]) ).
cnf(1321911,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[46,1320687,theory(equality)]),212400,theory(equality)]) ).
cnf(1321912,negated_conjecture,
$false,
inference(cn,[status(thm)],[1321911,theory(equality)]) ).
cnf(1321913,negated_conjecture,
$false,
1321912,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/REL/REL026+1.p
% --creating new selector for [REL001+0.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpnQm5--/sel_REL026+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpnQm5--/sel_REL026+1.p_2 with time limit 80
% -prover status ResourceOut
% --creating new selector for [REL001+0.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpnQm5--/sel_REL026+1.p_3 with time limit 74
% -prover status ResourceOut
% --creating new selector for [REL001+0.ax]
% -running prover on /tmp/tmpnQm5--/sel_REL026+1.p_4 with time limit 55
% -prover status Theorem
% Problem REL026+1.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/REL/REL026+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/REL/REL026+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
%
%------------------------------------------------------------------------------