TSTP Solution File: REL027+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : REL027+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:17:35 EST 2010
% Result : Theorem 186.63s
% Output : CNFRefutation 186.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 41
% Number of leaves : 13
% Syntax : Number of formulae : 124 ( 119 unt; 0 def)
% Number of atoms : 129 ( 126 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 10 ~; 0 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 181 ( 9 sgn 50 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/tmp/tmp60a94f/sel_REL027+1.p_4',converse_multiplicativity) ).
fof(2,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/tmp/tmp60a94f/sel_REL027+1.p_4',converse_idempotence) ).
fof(3,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/tmp/tmp60a94f/sel_REL027+1.p_4',composition_distributivity) ).
fof(4,axiom,
! [X1] : composition(X1,one) = X1,
file('/tmp/tmp60a94f/sel_REL027+1.p_4',composition_identity) ).
fof(5,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/tmp/tmp60a94f/sel_REL027+1.p_4',converse_additivity) ).
fof(6,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/tmp/tmp60a94f/sel_REL027+1.p_4',maddux1_join_commutativity) ).
fof(7,axiom,
! [X1,X2,X3] : composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
file('/tmp/tmp60a94f/sel_REL027+1.p_4',composition_associativity) ).
fof(8,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/tmp/tmp60a94f/sel_REL027+1.p_4',def_top) ).
fof(9,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/tmp/tmp60a94f/sel_REL027+1.p_4',maddux4_definiton_of_meet) ).
fof(10,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/tmp/tmp60a94f/sel_REL027+1.p_4',converse_cancellativity) ).
fof(11,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/tmp/tmp60a94f/sel_REL027+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/tmp60a94f/sel_REL027+1.p_4',maddux3_a_kind_of_de_Morgan) ).
fof(13,conjecture,
! [X1] :
( join(X1,one) = one
=> meet(complement(composition(X1,top)),one) = meet(complement(X1),one) ),
file('/tmp/tmp60a94f/sel_REL027+1.p_4',goals) ).
fof(14,negated_conjecture,
~ ! [X1] :
( join(X1,one) = one
=> meet(complement(composition(X1,top)),one) = meet(complement(X1),one) ),
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,
! [X2] : converse(converse(X2)) = X2,
inference(variable_rename,[status(thm)],[2]) ).
cnf(18,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[17]) ).
fof(19,plain,
! [X4,X5,X6] : composition(join(X4,X5),X6) = join(composition(X4,X6),composition(X5,X6)),
inference(variable_rename,[status(thm)],[3]) ).
cnf(20,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[19]) ).
fof(21,plain,
! [X2] : composition(X2,one) = X2,
inference(variable_rename,[status(thm)],[4]) ).
cnf(22,plain,
composition(X1,one) = X1,
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(27,plain,
! [X4,X5,X6] : composition(X4,composition(X5,X6)) = composition(composition(X4,X5),X6),
inference(variable_rename,[status(thm)],[7]) ).
cnf(28,plain,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[27]) ).
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,
! [X3,X4] : meet(X3,X4) = complement(join(complement(X3),complement(X4))),
inference(variable_rename,[status(thm)],[9]) ).
cnf(32,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
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] :
( join(X1,one) = one
& meet(complement(composition(X1,top)),one) != meet(complement(X1),one) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(40,negated_conjecture,
? [X2] :
( join(X2,one) = one
& meet(complement(composition(X2,top)),one) != meet(complement(X2),one) ),
inference(variable_rename,[status(thm)],[39]) ).
fof(41,negated_conjecture,
( join(esk1_0,one) = one
& meet(complement(composition(esk1_0,top)),one) != meet(complement(esk1_0),one) ),
inference(skolemize,[status(esa)],[40]) ).
cnf(42,negated_conjecture,
meet(complement(composition(esk1_0,top)),one) != meet(complement(esk1_0),one),
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(complement(composition(esk1_0,top))),complement(one))) != complement(join(complement(complement(esk1_0)),complement(one))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[42,32,theory(equality)]),32,theory(equality)]),
[unfolding] ).
cnf(45,negated_conjecture,
join(one,esk1_0) = one,
inference(rw,[status(thm)],[43,26,theory(equality)]) ).
cnf(52,plain,
join(X1,join(X2,complement(join(X1,X2)))) = top,
inference(spm,[status(thm)],[30,36,theory(equality)]) ).
cnf(53,plain,
join(top,X2) = join(X1,join(complement(X1),X2)),
inference(spm,[status(thm)],[36,30,theory(equality)]) ).
cnf(55,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[26,36,theory(equality)]) ).
cnf(57,plain,
join(join(X2,X1),X3) = join(X1,join(X2,X3)),
inference(spm,[status(thm)],[36,26,theory(equality)]) ).
cnf(61,plain,
join(X2,join(X1,X3)) = join(X1,join(X2,X3)),
inference(rw,[status(thm)],[57,36,theory(equality)]) ).
cnf(63,plain,
composition(X1,converse(X2)) = converse(composition(X2,converse(X1))),
inference(spm,[status(thm)],[16,18,theory(equality)]) ).
cnf(64,plain,
composition(converse(X1),X2) = converse(composition(converse(X2),X1)),
inference(spm,[status(thm)],[16,18,theory(equality)]) ).
cnf(66,plain,
join(X1,converse(X2)) = converse(join(converse(X1),X2)),
inference(spm,[status(thm)],[24,18,theory(equality)]) ).
cnf(88,plain,
join(complement(X2),composition(converse(X1),complement(composition(X1,X2)))) = complement(X2),
inference(rw,[status(thm)],[34,26,theory(equality)]) ).
cnf(91,plain,
join(complement(X1),composition(converse(composition(X2,X3)),complement(composition(X2,composition(X3,X1))))) = complement(X1),
inference(spm,[status(thm)],[88,28,theory(equality)]) ).
cnf(95,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[38,26,theory(equality)]) ).
cnf(99,plain,
join(complement(complement(X1)),complement(join(complement(X1),complement(composition(converse(X2),complement(composition(X2,X1))))))) = X1,
inference(spm,[status(thm)],[95,88,theory(equality)]) ).
cnf(100,plain,
join(complement(X1),complement(join(complement(join(complement(X1),X2)),complement(complement(join(complement(X1),complement(X2))))))) = join(complement(X1),X2),
inference(spm,[status(thm)],[95,95,theory(equality)]) ).
cnf(102,plain,
join(complement(join(X2,complement(X1))),complement(join(complement(X1),complement(X2)))) = X1,
inference(spm,[status(thm)],[95,26,theory(equality)]) ).
cnf(108,negated_conjecture,
complement(join(complement(one),complement(complement(composition(esk1_0,top))))) != complement(join(complement(complement(esk1_0)),complement(one))),
inference(rw,[status(thm)],[44,26,theory(equality)]) ).
cnf(109,negated_conjecture,
complement(join(complement(one),complement(complement(composition(esk1_0,top))))) != complement(join(complement(one),complement(complement(esk1_0)))),
inference(rw,[status(thm)],[108,26,theory(equality)]) ).
cnf(148,plain,
join(X1,join(X2,complement(join(X2,X1)))) = top,
inference(spm,[status(thm)],[52,26,theory(equality)]) ).
cnf(205,plain,
join(X1,top) = join(top,complement(complement(X1))),
inference(spm,[status(thm)],[53,30,theory(equality)]) ).
cnf(219,plain,
join(X1,join(X2,complement(X1))) = join(top,X2),
inference(spm,[status(thm)],[53,26,theory(equality)]) ).
cnf(764,plain,
converse(converse(X1)) = composition(converse(one),X1),
inference(spm,[status(thm)],[64,22,theory(equality)]) ).
cnf(778,plain,
X1 = composition(converse(one),X1),
inference(rw,[status(thm)],[764,18,theory(equality)]) ).
cnf(828,plain,
one = converse(one),
inference(spm,[status(thm)],[22,778,theory(equality)]) ).
cnf(859,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[778,828,theory(equality)]) ).
cnf(869,plain,
join(X1,composition(X2,X1)) = composition(join(one,X2),X1),
inference(spm,[status(thm)],[20,859,theory(equality)]) ).
cnf(871,plain,
join(complement(X1),composition(converse(one),complement(X1))) = complement(X1),
inference(spm,[status(thm)],[88,859,theory(equality)]) ).
cnf(876,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[871,828,theory(equality)]),859,theory(equality)]) ).
cnf(880,plain,
join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1))))) = X1,
inference(spm,[status(thm)],[95,876,theory(equality)]) ).
cnf(882,plain,
join(complement(X1),join(complement(X1),complement(complement(X1)))) = top,
inference(spm,[status(thm)],[52,876,theory(equality)]) ).
cnf(894,plain,
join(complement(top),complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[880,30,theory(equality)]),26,theory(equality)]) ).
cnf(896,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[882,30,theory(equality)]),26,theory(equality)]) ).
cnf(918,plain,
top = join(X1,top),
inference(rw,[status(thm)],[205,896,theory(equality)]) ).
cnf(946,plain,
join(top,join(X1,complement(top))) = top,
inference(spm,[status(thm)],[148,918,theory(equality)]) ).
cnf(966,plain,
join(top,X1) = top,
inference(rw,[status(thm)],[946,219,theory(equality)]) ).
cnf(978,plain,
converse(top) = join(X1,converse(complement(converse(X1)))),
inference(spm,[status(thm)],[66,30,theory(equality)]) ).
cnf(998,plain,
converse(top) = join(X1,converse(top)),
inference(spm,[status(thm)],[66,918,theory(equality)]) ).
cnf(1150,plain,
converse(top) = top,
inference(spm,[status(thm)],[966,998,theory(equality)]) ).
cnf(1789,plain,
join(X1,converse(complement(converse(X1)))) = top,
inference(rw,[status(thm)],[978,1150,theory(equality)]) ).
cnf(2958,plain,
join(composition(converse(composition(X1,X2)),complement(composition(X1,composition(X2,X3)))),join(complement(X3),complement(complement(X3)))) = top,
inference(spm,[status(thm)],[148,91,theory(equality)]) ).
cnf(3005,plain,
join(complement(X3),complement(complement(X3))) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2958,55,theory(equality)]),26,theory(equality)]),91,theory(equality)]),26,theory(equality)]) ).
cnf(3037,plain,
join(top,X2) = join(complement(X1),join(complement(complement(X1)),X2)),
inference(spm,[status(thm)],[36,3005,theory(equality)]) ).
cnf(3050,plain,
top = join(complement(X1),join(complement(complement(X1)),X2)),
inference(rw,[status(thm)],[3037,966,theory(equality)]) ).
cnf(4406,plain,
join(complement(join(complement(complement(X1)),join(complement(X1),complement(composition(converse(X2),complement(composition(X2,X1))))))),complement(X1)) = complement(X1),
inference(spm,[status(thm)],[95,99,theory(equality)]) ).
cnf(4440,plain,
join(complement(top),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[4406,61,theory(equality)]),3050,theory(equality)]) ).
cnf(4487,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[894,4440,theory(equality)]) ).
cnf(4505,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[876,4487,theory(equality)]) ).
cnf(4520,negated_conjecture,
complement(join(complement(one),composition(esk1_0,top))) != complement(join(complement(one),complement(complement(esk1_0)))),
inference(rw,[status(thm)],[109,4487,theory(equality)]) ).
cnf(4521,negated_conjecture,
complement(join(complement(one),composition(esk1_0,top))) != complement(join(esk1_0,complement(one))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[4520,4487,theory(equality)]),26,theory(equality)]) ).
cnf(4526,plain,
join(X1,X2) = join(X1,join(X1,X2)),
inference(spm,[status(thm)],[36,4505,theory(equality)]) ).
cnf(4530,plain,
join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1))))) = X1,
inference(spm,[status(thm)],[95,4505,theory(equality)]) ).
cnf(4584,plain,
join(X1,complement(top)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[4530,4487,theory(equality)]),4487,theory(equality)]),26,theory(equality)]),30,theory(equality)]) ).
cnf(5032,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)],[100,4487,theory(equality)]),26,theory(equality)]),36,theory(equality)]) ).
cnf(5564,plain,
join(complement(join(X1,complement(X2))),X2) = X2,
inference(spm,[status(thm)],[4526,102,theory(equality)]) ).
cnf(5604,plain,
join(X2,complement(join(X1,complement(X2)))) = X2,
inference(rw,[status(thm)],[5564,26,theory(equality)]) ).
cnf(6457,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[5604,4487,theory(equality)]) ).
cnf(8177,plain,
join(complement(X1),complement(join(complement(X1),complement(X2)))) = join(complement(X1),X2),
inference(rw,[status(thm)],[5032,6457,theory(equality)]) ).
cnf(8421,plain,
join(X1,complement(join(X1,complement(X2)))) = join(X1,X2),
inference(spm,[status(thm)],[8177,4487,theory(equality)]) ).
cnf(16345,plain,
join(X1,complement(join(X1,X2))) = join(X1,complement(X2)),
inference(spm,[status(thm)],[8421,4487,theory(equality)]) ).
cnf(16951,plain,
join(X1,complement(top)) = join(X1,complement(converse(complement(converse(X1))))),
inference(spm,[status(thm)],[16345,1789,theory(equality)]) ).
cnf(17137,plain,
X1 = join(X1,complement(converse(complement(converse(X1))))),
inference(rw,[status(thm)],[16951,4584,theory(equality)]) ).
cnf(17794,plain,
converse(converse(X1)) = join(X1,converse(complement(converse(complement(converse(converse(X1))))))),
inference(spm,[status(thm)],[66,17137,theory(equality)]) ).
cnf(17873,plain,
X1 = join(X1,converse(complement(converse(complement(converse(converse(X1))))))),
inference(rw,[status(thm)],[17794,18,theory(equality)]) ).
cnf(17874,plain,
X1 = join(X1,converse(complement(converse(complement(X1))))),
inference(rw,[status(thm)],[17873,18,theory(equality)]) ).
cnf(18767,plain,
join(complement(converse(complement(converse(complement(X1))))),complement(X1)) = complement(converse(complement(converse(complement(X1))))),
inference(spm,[status(thm)],[6457,17874,theory(equality)]) ).
cnf(18829,plain,
complement(X1) = complement(converse(complement(converse(complement(X1))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[18767,26,theory(equality)]),17137,theory(equality)]) ).
cnf(19035,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = converse(complement(converse(complement(X1)))),
inference(spm,[status(thm)],[95,18829,theory(equality)]) ).
cnf(19078,plain,
X1 = converse(complement(converse(complement(X1)))),
inference(rw,[status(thm)],[19035,95,theory(equality)]) ).
cnf(19107,plain,
converse(X1) = complement(converse(complement(X1))),
inference(spm,[status(thm)],[18,19078,theory(equality)]) ).
cnf(19335,plain,
complement(converse(X1)) = converse(complement(X1)),
inference(spm,[status(thm)],[4487,19107,theory(equality)]) ).
cnf(33444,plain,
join(X1,composition(complement(one),X1)) = composition(top,X1),
inference(spm,[status(thm)],[869,30,theory(equality)]) ).
cnf(33454,negated_conjecture,
join(X1,composition(esk1_0,X1)) = composition(one,X1),
inference(spm,[status(thm)],[869,45,theory(equality)]) ).
cnf(33661,negated_conjecture,
join(X1,composition(esk1_0,X1)) = X1,
inference(rw,[status(thm)],[33454,859,theory(equality)]) ).
cnf(33860,negated_conjecture,
join(X1,X2) = join(X2,join(X1,composition(esk1_0,X2))),
inference(spm,[status(thm)],[61,33661,theory(equality)]) ).
cnf(39093,plain,
converse(composition(top,converse(X1))) = join(X1,converse(composition(complement(one),converse(X1)))),
inference(spm,[status(thm)],[66,33444,theory(equality)]) ).
cnf(39182,plain,
composition(X1,top) = join(X1,converse(composition(complement(one),converse(X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[39093,63,theory(equality)]),1150,theory(equality)]) ).
cnf(39183,plain,
composition(X1,top) = join(X1,composition(X1,complement(one))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[39182,63,theory(equality)]),19335,theory(equality)]),828,theory(equality)]) ).
cnf(75544,negated_conjecture,
join(complement(one),composition(esk1_0,top)) = join(esk1_0,complement(one)),
inference(spm,[status(thm)],[33860,39183,theory(equality)]) ).
cnf(75911,negated_conjecture,
$false,
inference(rw,[status(thm)],[4521,75544,theory(equality)]) ).
cnf(75912,negated_conjecture,
$false,
inference(cn,[status(thm)],[75911,theory(equality)]) ).
cnf(75913,negated_conjecture,
$false,
75912,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/REL/REL027+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/tmp60a94f/sel_REL027+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmp60a94f/sel_REL027+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/tmp60a94f/sel_REL027+1.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [REL001+0.ax]
% -running prover on /tmp/tmp60a94f/sel_REL027+1.p_4 with time limit 55
% -prover status Theorem
% Problem REL027+1.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/REL/REL027+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/REL/REL027+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
%
%------------------------------------------------------------------------------