%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET809+4 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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 03:41:00 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 53 ( 6 unt; 0 def)
% Number of atoms : 412 ( 0 equ)
% Maximal formula atoms : 84 ( 7 avg)
% Number of connectives : 541 ( 182 ~; 215 |; 130 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 166 ( 0 sgn 109 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/tmp/tmp-RizDt/sel_SET809+4.p_1',subset) ).
fof(2,axiom,
! [X1] :
( member(X1,on)
<=> ( set(X1)
& strict_well_order(member_predicate,X1)
& ! [X3] :
( member(X3,X1)
=> subset(X3,X1) ) ) ),
file('/tmp/tmp-RizDt/sel_SET809+4.p_1',ordinal_number) ).
fof(5,axiom,
! [X4,X5] :
( strict_well_order(X4,X5)
<=> ( strict_order(X4,X5)
& ! [X1] :
( ( subset(X1,X5)
& ? [X3] : member(X3,X1) )
=> ? [X7] : least(X7,X4,X1) ) ) ),
file('/tmp/tmp-RizDt/sel_SET809+4.p_1',strict_well_order) ).
fof(6,axiom,
! [X3,X7] :
( apply(member_predicate,X3,X7)
<=> member(X3,X7) ),
file('/tmp/tmp-RizDt/sel_SET809+4.p_1',rel_member) ).
fof(7,axiom,
! [X4,X5] :
( strict_order(X4,X5)
<=> ( ! [X3,X7] :
( ( member(X3,X5)
& member(X7,X5) )
=> ~ ( apply(X4,X3,X7)
& apply(X4,X7,X3) ) )
& ! [X3,X7,X8] :
( ( member(X3,X5)
& member(X7,X5)
& member(X8,X5) )
=> ( ( apply(X4,X3,X7)
& apply(X4,X7,X8) )
=> apply(X4,X3,X8) ) ) ) ),
file('/tmp/tmp-RizDt/sel_SET809+4.p_1',strict_order) ).
fof(8,conjecture,
! [X1] :
( member(X1,on)
=> ~ member(X1,X1) ),
file('/tmp/tmp-RizDt/sel_SET809+4.p_1',thV2) ).
fof(9,negated_conjecture,
~ ! [X1] :
( member(X1,on)
=> ~ member(X1,X1) ),
inference(assume_negation,[status(cth)],[8]) ).
fof(10,negated_conjecture,
~ ! [X1] :
( member(X1,on)
=> ~ member(X1,X1) ),
inference(fof_simplification,[status(thm)],[9,theory(equality)]) ).
fof(11,plain,
! [X1,X2] :
( ( ~ subset(X1,X2)
| ! [X3] :
( ~ member(X3,X1)
| member(X3,X2) ) )
& ( ? [X3] :
( member(X3,X1)
& ~ member(X3,X2) )
| subset(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(12,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ member(X6,X4)
| member(X6,X5) ) )
& ( ? [X7] :
( member(X7,X4)
& ~ member(X7,X5) )
| subset(X4,X5) ) ),
inference(variable_rename,[status(thm)],[11]) ).
fof(13,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ member(X6,X4)
| member(X6,X5) ) )
& ( ( member(esk1_2(X4,X5),X4)
& ~ member(esk1_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(skolemize,[status(esa)],[12]) ).
fof(14,plain,
! [X4,X5,X6] :
( ( ~ member(X6,X4)
| member(X6,X5)
| ~ subset(X4,X5) )
& ( ( member(esk1_2(X4,X5),X4)
& ~ member(esk1_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(shift_quantors,[status(thm)],[13]) ).
fof(15,plain,
! [X4,X5,X6] :
( ( ~ member(X6,X4)
| member(X6,X5)
| ~ subset(X4,X5) )
& ( member(esk1_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk1_2(X4,X5),X5)
| subset(X4,X5) ) ),
inference(distribute,[status(thm)],[14]) ).
cnf(18,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[15]) ).
fof(19,plain,
! [X1] :
( ( ~ member(X1,on)
| ( set(X1)
& strict_well_order(member_predicate,X1)
& ! [X3] :
( ~ member(X3,X1)
| subset(X3,X1) ) ) )
& ( ~ set(X1)
| ~ strict_well_order(member_predicate,X1)
| ? [X3] :
( member(X3,X1)
& ~ subset(X3,X1) )
| member(X1,on) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(20,plain,
! [X4] :
( ( ~ member(X4,on)
| ( set(X4)
& strict_well_order(member_predicate,X4)
& ! [X5] :
( ~ member(X5,X4)
| subset(X5,X4) ) ) )
& ( ~ set(X4)
| ~ strict_well_order(member_predicate,X4)
| ? [X6] :
( member(X6,X4)
& ~ subset(X6,X4) )
| member(X4,on) ) ),
inference(variable_rename,[status(thm)],[19]) ).
fof(21,plain,
! [X4] :
( ( ~ member(X4,on)
| ( set(X4)
& strict_well_order(member_predicate,X4)
& ! [X5] :
( ~ member(X5,X4)
| subset(X5,X4) ) ) )
& ( ~ set(X4)
| ~ strict_well_order(member_predicate,X4)
| ( member(esk2_1(X4),X4)
& ~ subset(esk2_1(X4),X4) )
| member(X4,on) ) ),
inference(skolemize,[status(esa)],[20]) ).
fof(22,plain,
! [X4,X5] :
( ( ( ( ~ member(X5,X4)
| subset(X5,X4) )
& set(X4)
& strict_well_order(member_predicate,X4) )
| ~ member(X4,on) )
& ( ~ set(X4)
| ~ strict_well_order(member_predicate,X4)
| ( member(esk2_1(X4),X4)
& ~ subset(esk2_1(X4),X4) )
| member(X4,on) ) ),
inference(shift_quantors,[status(thm)],[21]) ).
fof(23,plain,
! [X4,X5] :
( ( ~ member(X5,X4)
| subset(X5,X4)
| ~ member(X4,on) )
& ( set(X4)
| ~ member(X4,on) )
& ( strict_well_order(member_predicate,X4)
| ~ member(X4,on) )
& ( member(esk2_1(X4),X4)
| ~ set(X4)
| ~ strict_well_order(member_predicate,X4)
| member(X4,on) )
& ( ~ subset(esk2_1(X4),X4)
| ~ set(X4)
| ~ strict_well_order(member_predicate,X4)
| member(X4,on) ) ),
inference(distribute,[status(thm)],[22]) ).
cnf(26,plain,
( strict_well_order(member_predicate,X1)
| ~ member(X1,on) ),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(28,plain,
( subset(X2,X1)
| ~ member(X1,on)
| ~ member(X2,X1) ),
inference(split_conjunct,[status(thm)],[23]) ).
fof(43,plain,
! [X4,X5] :
( ( ~ strict_well_order(X4,X5)
| ( strict_order(X4,X5)
& ! [X1] :
( ~ subset(X1,X5)
| ! [X3] : ~ member(X3,X1)
| ? [X7] : least(X7,X4,X1) ) ) )
& ( ~ strict_order(X4,X5)
| ? [X1] :
( subset(X1,X5)
& ? [X3] : member(X3,X1)
& ! [X7] : ~ least(X7,X4,X1) )
| strict_well_order(X4,X5) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(44,plain,
! [X8,X9] :
( ( ~ strict_well_order(X8,X9)
| ( strict_order(X8,X9)
& ! [X10] :
( ~ subset(X10,X9)
| ! [X11] : ~ member(X11,X10)
| ? [X12] : least(X12,X8,X10) ) ) )
& ( ~ strict_order(X8,X9)
| ? [X13] :
( subset(X13,X9)
& ? [X14] : member(X14,X13)
& ! [X15] : ~ least(X15,X8,X13) )
| strict_well_order(X8,X9) ) ),
inference(variable_rename,[status(thm)],[43]) ).
fof(45,plain,
! [X8,X9] :
( ( ~ strict_well_order(X8,X9)
| ( strict_order(X8,X9)
& ! [X10] :
( ~ subset(X10,X9)
| ! [X11] : ~ member(X11,X10)
| least(esk4_3(X8,X9,X10),X8,X10) ) ) )
& ( ~ strict_order(X8,X9)
| ( subset(esk5_2(X8,X9),X9)
& member(esk6_2(X8,X9),esk5_2(X8,X9))
& ! [X15] : ~ least(X15,X8,esk5_2(X8,X9)) )
| strict_well_order(X8,X9) ) ),
inference(skolemize,[status(esa)],[44]) ).
fof(46,plain,
! [X8,X9,X10,X11,X15] :
( ( ( ~ least(X15,X8,esk5_2(X8,X9))
& subset(esk5_2(X8,X9),X9)
& member(esk6_2(X8,X9),esk5_2(X8,X9)) )
| ~ strict_order(X8,X9)
| strict_well_order(X8,X9) )
& ( ( ( ~ member(X11,X10)
| ~ subset(X10,X9)
| least(esk4_3(X8,X9,X10),X8,X10) )
& strict_order(X8,X9) )
| ~ strict_well_order(X8,X9) ) ),
inference(shift_quantors,[status(thm)],[45]) ).
fof(47,plain,
! [X8,X9,X10,X11,X15] :
( ( ~ least(X15,X8,esk5_2(X8,X9))
| ~ strict_order(X8,X9)
| strict_well_order(X8,X9) )
& ( subset(esk5_2(X8,X9),X9)
| ~ strict_order(X8,X9)
| strict_well_order(X8,X9) )
& ( member(esk6_2(X8,X9),esk5_2(X8,X9))
| ~ strict_order(X8,X9)
| strict_well_order(X8,X9) )
& ( ~ member(X11,X10)
| ~ subset(X10,X9)
| least(esk4_3(X8,X9,X10),X8,X10)
| ~ strict_well_order(X8,X9) )
& ( strict_order(X8,X9)
| ~ strict_well_order(X8,X9) ) ),
inference(distribute,[status(thm)],[46]) ).
cnf(48,plain,
( strict_order(X1,X2)
| ~ strict_well_order(X1,X2) ),
inference(split_conjunct,[status(thm)],[47]) ).
fof(53,plain,
! [X3,X7] :
( ( ~ apply(member_predicate,X3,X7)
| member(X3,X7) )
& ( ~ member(X3,X7)
| apply(member_predicate,X3,X7) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(54,plain,
! [X8,X9] :
( ( ~ apply(member_predicate,X8,X9)
| member(X8,X9) )
& ( ~ member(X8,X9)
| apply(member_predicate,X8,X9) ) ),
inference(variable_rename,[status(thm)],[53]) ).
cnf(55,plain,
( apply(member_predicate,X1,X2)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[54]) ).
fof(57,plain,
! [X4,X5] :
( ( ~ strict_order(X4,X5)
| ( ! [X3,X7] :
( ~ member(X3,X5)
| ~ member(X7,X5)
| ~ apply(X4,X3,X7)
| ~ apply(X4,X7,X3) )
& ! [X3,X7,X8] :
( ~ member(X3,X5)
| ~ member(X7,X5)
| ~ member(X8,X5)
| ~ apply(X4,X3,X7)
| ~ apply(X4,X7,X8)
| apply(X4,X3,X8) ) ) )
& ( ? [X3,X7] :
( member(X3,X5)
& member(X7,X5)
& apply(X4,X3,X7)
& apply(X4,X7,X3) )
| ? [X3,X7,X8] :
( member(X3,X5)
& member(X7,X5)
& member(X8,X5)
& apply(X4,X3,X7)
& apply(X4,X7,X8)
& ~ apply(X4,X3,X8) )
| strict_order(X4,X5) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(58,plain,
! [X9,X10] :
( ( ~ strict_order(X9,X10)
| ( ! [X11,X12] :
( ~ member(X11,X10)
| ~ member(X12,X10)
| ~ apply(X9,X11,X12)
| ~ apply(X9,X12,X11) )
& ! [X13,X14,X15] :
( ~ member(X13,X10)
| ~ member(X14,X10)
| ~ member(X15,X10)
| ~ apply(X9,X13,X14)
| ~ apply(X9,X14,X15)
| apply(X9,X13,X15) ) ) )
& ( ? [X16,X17] :
( member(X16,X10)
& member(X17,X10)
& apply(X9,X16,X17)
& apply(X9,X17,X16) )
| ? [X18,X19,X20] :
( member(X18,X10)
& member(X19,X10)
& member(X20,X10)
& apply(X9,X18,X19)
& apply(X9,X19,X20)
& ~ apply(X9,X18,X20) )
| strict_order(X9,X10) ) ),
inference(variable_rename,[status(thm)],[57]) ).
fof(59,plain,
! [X9,X10] :
( ( ~ strict_order(X9,X10)
| ( ! [X11,X12] :
( ~ member(X11,X10)
| ~ member(X12,X10)
| ~ apply(X9,X11,X12)
| ~ apply(X9,X12,X11) )
& ! [X13,X14,X15] :
( ~ member(X13,X10)
| ~ member(X14,X10)
| ~ member(X15,X10)
| ~ apply(X9,X13,X14)
| ~ apply(X9,X14,X15)
| apply(X9,X13,X15) ) ) )
& ( ( member(esk7_2(X9,X10),X10)
& member(esk8_2(X9,X10),X10)
& apply(X9,esk7_2(X9,X10),esk8_2(X9,X10))
& apply(X9,esk8_2(X9,X10),esk7_2(X9,X10)) )
| ( member(esk9_2(X9,X10),X10)
& member(esk10_2(X9,X10),X10)
& member(esk11_2(X9,X10),X10)
& apply(X9,esk9_2(X9,X10),esk10_2(X9,X10))
& apply(X9,esk10_2(X9,X10),esk11_2(X9,X10))
& ~ apply(X9,esk9_2(X9,X10),esk11_2(X9,X10)) )
| strict_order(X9,X10) ) ),
inference(skolemize,[status(esa)],[58]) ).
fof(60,plain,
! [X9,X10,X11,X12,X13,X14,X15] :
( ( ( ( ~ member(X13,X10)
| ~ member(X14,X10)
| ~ member(X15,X10)
| ~ apply(X9,X13,X14)
| ~ apply(X9,X14,X15)
| apply(X9,X13,X15) )
& ( ~ member(X11,X10)
| ~ member(X12,X10)
| ~ apply(X9,X11,X12)
| ~ apply(X9,X12,X11) ) )
| ~ strict_order(X9,X10) )
& ( ( member(esk7_2(X9,X10),X10)
& member(esk8_2(X9,X10),X10)
& apply(X9,esk7_2(X9,X10),esk8_2(X9,X10))
& apply(X9,esk8_2(X9,X10),esk7_2(X9,X10)) )
| ( member(esk9_2(X9,X10),X10)
& member(esk10_2(X9,X10),X10)
& member(esk11_2(X9,X10),X10)
& apply(X9,esk9_2(X9,X10),esk10_2(X9,X10))
& apply(X9,esk10_2(X9,X10),esk11_2(X9,X10))
& ~ apply(X9,esk9_2(X9,X10),esk11_2(X9,X10)) )
| strict_order(X9,X10) ) ),
inference(shift_quantors,[status(thm)],[59]) ).
fof(61,plain,
! [X9,X10,X11,X12,X13,X14,X15] :
( ( ~ member(X13,X10)
| ~ member(X14,X10)
| ~ member(X15,X10)
| ~ apply(X9,X13,X14)
| ~ apply(X9,X14,X15)
| apply(X9,X13,X15)
| ~ strict_order(X9,X10) )
& ( ~ member(X11,X10)
| ~ member(X12,X10)
| ~ apply(X9,X11,X12)
| ~ apply(X9,X12,X11)
| ~ strict_order(X9,X10) )
& ( member(esk9_2(X9,X10),X10)
| member(esk7_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( member(esk10_2(X9,X10),X10)
| member(esk7_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( member(esk11_2(X9,X10),X10)
| member(esk7_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( apply(X9,esk9_2(X9,X10),esk10_2(X9,X10))
| member(esk7_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( apply(X9,esk10_2(X9,X10),esk11_2(X9,X10))
| member(esk7_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( ~ apply(X9,esk9_2(X9,X10),esk11_2(X9,X10))
| member(esk7_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( member(esk9_2(X9,X10),X10)
| member(esk8_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( member(esk10_2(X9,X10),X10)
| member(esk8_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( member(esk11_2(X9,X10),X10)
| member(esk8_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( apply(X9,esk9_2(X9,X10),esk10_2(X9,X10))
| member(esk8_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( apply(X9,esk10_2(X9,X10),esk11_2(X9,X10))
| member(esk8_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( ~ apply(X9,esk9_2(X9,X10),esk11_2(X9,X10))
| member(esk8_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( member(esk9_2(X9,X10),X10)
| apply(X9,esk7_2(X9,X10),esk8_2(X9,X10))
| strict_order(X9,X10) )
& ( member(esk10_2(X9,X10),X10)
| apply(X9,esk7_2(X9,X10),esk8_2(X9,X10))
| strict_order(X9,X10) )
& ( member(esk11_2(X9,X10),X10)
| apply(X9,esk7_2(X9,X10),esk8_2(X9,X10))
| strict_order(X9,X10) )
& ( apply(X9,esk9_2(X9,X10),esk10_2(X9,X10))
| apply(X9,esk7_2(X9,X10),esk8_2(X9,X10))
| strict_order(X9,X10) )
& ( apply(X9,esk10_2(X9,X10),esk11_2(X9,X10))
| apply(X9,esk7_2(X9,X10),esk8_2(X9,X10))
| strict_order(X9,X10) )
& ( ~ apply(X9,esk9_2(X9,X10),esk11_2(X9,X10))
| apply(X9,esk7_2(X9,X10),esk8_2(X9,X10))
| strict_order(X9,X10) )
& ( member(esk9_2(X9,X10),X10)
| apply(X9,esk8_2(X9,X10),esk7_2(X9,X10))
| strict_order(X9,X10) )
& ( member(esk10_2(X9,X10),X10)
| apply(X9,esk8_2(X9,X10),esk7_2(X9,X10))
| strict_order(X9,X10) )
& ( member(esk11_2(X9,X10),X10)
| apply(X9,esk8_2(X9,X10),esk7_2(X9,X10))
| strict_order(X9,X10) )
& ( apply(X9,esk9_2(X9,X10),esk10_2(X9,X10))
| apply(X9,esk8_2(X9,X10),esk7_2(X9,X10))
| strict_order(X9,X10) )
& ( apply(X9,esk10_2(X9,X10),esk11_2(X9,X10))
| apply(X9,esk8_2(X9,X10),esk7_2(X9,X10))
| strict_order(X9,X10) )
& ( ~ apply(X9,esk9_2(X9,X10),esk11_2(X9,X10))
| apply(X9,esk8_2(X9,X10),esk7_2(X9,X10))
| strict_order(X9,X10) ) ),
inference(distribute,[status(thm)],[60]) ).
cnf(86,plain,
( ~ strict_order(X1,X2)
| ~ apply(X1,X3,X4)
| ~ apply(X1,X4,X3)
| ~ member(X3,X2)
| ~ member(X4,X2) ),
inference(split_conjunct,[status(thm)],[61]) ).
fof(88,negated_conjecture,
? [X1] :
( member(X1,on)
& member(X1,X1) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(89,negated_conjecture,
? [X2] :
( member(X2,on)
& member(X2,X2) ),
inference(variable_rename,[status(thm)],[88]) ).
fof(90,negated_conjecture,
( member(esk12_0,on)
& member(esk12_0,esk12_0) ),
inference(skolemize,[status(esa)],[89]) ).
cnf(91,negated_conjecture,
member(esk12_0,esk12_0),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(92,negated_conjecture,
member(esk12_0,on),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(93,plain,
( strict_order(member_predicate,X1)
| ~ member(X1,on) ),
inference(spm,[status(thm)],[48,26,theory(equality)]) ).
cnf(99,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ member(X2,on)
| ~ member(X3,X2) ),
inference(spm,[status(thm)],[18,28,theory(equality)]) ).
cnf(112,plain,
( ~ strict_order(member_predicate,X1)
| ~ apply(member_predicate,X3,X2)
| ~ member(X2,X1)
| ~ member(X3,X1)
| ~ member(X2,X3) ),
inference(spm,[status(thm)],[86,55,theory(equality)]) ).
cnf(529,plain,
( ~ strict_order(member_predicate,X1)
| ~ member(X3,X1)
| ~ member(X2,X1)
| ~ member(X3,X2)
| ~ member(X2,X3) ),
inference(spm,[status(thm)],[112,55,theory(equality)]) ).
cnf(544,plain,
( ~ member(X2,X1)
| ~ member(X3,X1)
| ~ member(X2,X3)
| ~ member(X3,X2)
| ~ member(X1,on) ),
inference(spm,[status(thm)],[529,93,theory(equality)]) ).
cnf(545,plain,
( ~ member(X1,on)
| ~ member(X2,X3)
| ~ member(X3,X2)
| ~ member(X2,X1) ),
inference(csr,[status(thm)],[544,99]) ).
cnf(546,negated_conjecture,
( ~ member(X1,esk12_0)
| ~ member(X1,X2)
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[545,92,theory(equality)]) ).
cnf(558,negated_conjecture,
( ~ member(esk12_0,X1)
| ~ member(X1,esk12_0) ),
inference(spm,[status(thm)],[546,91,theory(equality)]) ).
cnf(573,negated_conjecture,
~ member(esk12_0,esk12_0),
inference(spm,[status(thm)],[558,91,theory(equality)]) ).
cnf(574,negated_conjecture,
$false,
inference(rw,[status(thm)],[573,91,theory(equality)]) ).
cnf(575,negated_conjecture,
$false,
inference(cn,[status(thm)],[574,theory(equality)]) ).
cnf(576,negated_conjecture,
$false,
575,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET809+4.p
% --creating new selector for [SET006+0.ax, SET006+4.ax]
% -running prover on /tmp/tmp-RizDt/sel_SET809+4.p_1 with time limit 29
% -prover status Theorem
% Problem SET809+4.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET809+4.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET809+4.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
%
%------------------------------------------------------------------------------