TSTP Solution File: ALG073+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : ALG073+1 : TPTP v5.0.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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 : Sat Dec 25 03:47:08 EST 2010
% Result : Theorem 15.66s
% Output : CNFRefutation 15.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 4
% Syntax : Number of formulae : 96 ( 17 unt; 0 def)
% Number of atoms : 313 ( 113 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 367 ( 150 ~; 158 |; 39 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 121 ( 0 sgn 54 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( sorti2(X1)
=> ! [X2] :
( sorti2(X2)
=> sorti2(op2(X1,X2)) ) ),
file('/tmp/tmpdv6ayF/sel_ALG073+1.p_1',ax2) ).
fof(2,axiom,
? [X1] :
( sorti1(X1)
& ? [X2] :
( sorti1(X2)
& op1(X1,X1) = X2
& op1(X2,X2) = X1
& op1(X1,X2) != X1 ) ),
file('/tmp/tmpdv6ayF/sel_ALG073+1.p_1',ax3) ).
fof(3,conjecture,
( ( ! [X1] :
( sorti1(X1)
=> sorti2(h(X1)) )
& ! [X2] :
( sorti2(X2)
=> sorti1(j(X2)) ) )
=> ~ ( ! [X3] :
( sorti1(X3)
=> ! [X4] :
( sorti1(X4)
=> h(op1(X3,X4)) = op2(h(X3),h(X4)) ) )
& ! [X5] :
( sorti2(X5)
=> ! [X6] :
( sorti2(X6)
=> j(op2(X5,X6)) = op1(j(X5),j(X6)) ) )
& ! [X7] :
( sorti2(X7)
=> h(j(X7)) = X7 )
& ! [X8] :
( sorti1(X8)
=> j(h(X8)) = X8 ) ) ),
file('/tmp/tmpdv6ayF/sel_ALG073+1.p_1',co1) ).
fof(5,axiom,
~ ? [X1] :
( sorti2(X1)
& ? [X2] :
( sorti2(X2)
& op2(X1,X1) = X2
& op2(X2,X2) = X1
& op2(X1,X2) != X1 ) ),
file('/tmp/tmpdv6ayF/sel_ALG073+1.p_1',ax4) ).
fof(6,negated_conjecture,
~ ( ( ! [X1] :
( sorti1(X1)
=> sorti2(h(X1)) )
& ! [X2] :
( sorti2(X2)
=> sorti1(j(X2)) ) )
=> ~ ( ! [X3] :
( sorti1(X3)
=> ! [X4] :
( sorti1(X4)
=> h(op1(X3,X4)) = op2(h(X3),h(X4)) ) )
& ! [X5] :
( sorti2(X5)
=> ! [X6] :
( sorti2(X6)
=> j(op2(X5,X6)) = op1(j(X5),j(X6)) ) )
& ! [X7] :
( sorti2(X7)
=> h(j(X7)) = X7 )
& ! [X8] :
( sorti1(X8)
=> j(h(X8)) = X8 ) ) ),
inference(assume_negation,[status(cth)],[3]) ).
fof(7,plain,
! [X1] :
( ~ sorti2(X1)
| ! [X2] :
( ~ sorti2(X2)
| sorti2(op2(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(8,plain,
! [X3] :
( ~ sorti2(X3)
| ! [X4] :
( ~ sorti2(X4)
| sorti2(op2(X3,X4)) ) ),
inference(variable_rename,[status(thm)],[7]) ).
fof(9,plain,
! [X3,X4] :
( ~ sorti2(X4)
| sorti2(op2(X3,X4))
| ~ sorti2(X3) ),
inference(shift_quantors,[status(thm)],[8]) ).
cnf(10,plain,
( sorti2(op2(X1,X2))
| ~ sorti2(X1)
| ~ sorti2(X2) ),
inference(split_conjunct,[status(thm)],[9]) ).
fof(11,plain,
? [X3] :
( sorti1(X3)
& ? [X4] :
( sorti1(X4)
& op1(X3,X3) = X4
& op1(X4,X4) = X3
& op1(X3,X4) != X3 ) ),
inference(variable_rename,[status(thm)],[2]) ).
fof(12,plain,
( sorti1(esk1_0)
& sorti1(esk2_0)
& op1(esk1_0,esk1_0) = esk2_0
& op1(esk2_0,esk2_0) = esk1_0
& op1(esk1_0,esk2_0) != esk1_0 ),
inference(skolemize,[status(esa)],[11]) ).
cnf(13,plain,
op1(esk1_0,esk2_0) != esk1_0,
inference(split_conjunct,[status(thm)],[12]) ).
cnf(14,plain,
op1(esk2_0,esk2_0) = esk1_0,
inference(split_conjunct,[status(thm)],[12]) ).
cnf(15,plain,
op1(esk1_0,esk1_0) = esk2_0,
inference(split_conjunct,[status(thm)],[12]) ).
cnf(16,plain,
sorti1(esk2_0),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(17,plain,
sorti1(esk1_0),
inference(split_conjunct,[status(thm)],[12]) ).
fof(18,negated_conjecture,
( ! [X1] :
( ~ sorti1(X1)
| sorti2(h(X1)) )
& ! [X2] :
( ~ sorti2(X2)
| sorti1(j(X2)) )
& ! [X3] :
( ~ sorti1(X3)
| ! [X4] :
( ~ sorti1(X4)
| h(op1(X3,X4)) = op2(h(X3),h(X4)) ) )
& ! [X5] :
( ~ sorti2(X5)
| ! [X6] :
( ~ sorti2(X6)
| j(op2(X5,X6)) = op1(j(X5),j(X6)) ) )
& ! [X7] :
( ~ sorti2(X7)
| h(j(X7)) = X7 )
& ! [X8] :
( ~ sorti1(X8)
| j(h(X8)) = X8 ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(19,negated_conjecture,
( ! [X9] :
( ~ sorti1(X9)
| sorti2(h(X9)) )
& ! [X10] :
( ~ sorti2(X10)
| sorti1(j(X10)) )
& ! [X11] :
( ~ sorti1(X11)
| ! [X12] :
( ~ sorti1(X12)
| h(op1(X11,X12)) = op2(h(X11),h(X12)) ) )
& ! [X13] :
( ~ sorti2(X13)
| ! [X14] :
( ~ sorti2(X14)
| j(op2(X13,X14)) = op1(j(X13),j(X14)) ) )
& ! [X15] :
( ~ sorti2(X15)
| h(j(X15)) = X15 )
& ! [X16] :
( ~ sorti1(X16)
| j(h(X16)) = X16 ) ),
inference(variable_rename,[status(thm)],[18]) ).
fof(20,negated_conjecture,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ( ~ sorti1(X16)
| j(h(X16)) = X16 )
& ( ~ sorti2(X15)
| h(j(X15)) = X15 )
& ( ~ sorti2(X14)
| j(op2(X13,X14)) = op1(j(X13),j(X14))
| ~ sorti2(X13) )
& ( ~ sorti1(X12)
| h(op1(X11,X12)) = op2(h(X11),h(X12))
| ~ sorti1(X11) )
& ( ~ sorti2(X10)
| sorti1(j(X10)) )
& ( ~ sorti1(X9)
| sorti2(h(X9)) ) ),
inference(shift_quantors,[status(thm)],[19]) ).
cnf(21,negated_conjecture,
( sorti2(h(X1))
| ~ sorti1(X1) ),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(22,negated_conjecture,
( sorti1(j(X1))
| ~ sorti2(X1) ),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(23,negated_conjecture,
( h(op1(X1,X2)) = op2(h(X1),h(X2))
| ~ sorti1(X1)
| ~ sorti1(X2) ),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(24,negated_conjecture,
( j(op2(X1,X2)) = op1(j(X1),j(X2))
| ~ sorti2(X1)
| ~ sorti2(X2) ),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(25,negated_conjecture,
( h(j(X1)) = X1
| ~ sorti2(X1) ),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(26,negated_conjecture,
( j(h(X1)) = X1
| ~ sorti1(X1) ),
inference(split_conjunct,[status(thm)],[20]) ).
fof(31,plain,
! [X1] :
( ~ sorti2(X1)
| ! [X2] :
( ~ sorti2(X2)
| op2(X1,X1) != X2
| op2(X2,X2) != X1
| op2(X1,X2) = X1 ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(32,plain,
! [X3] :
( ~ sorti2(X3)
| ! [X4] :
( ~ sorti2(X4)
| op2(X3,X3) != X4
| op2(X4,X4) != X3
| op2(X3,X4) = X3 ) ),
inference(variable_rename,[status(thm)],[31]) ).
fof(33,plain,
! [X3,X4] :
( ~ sorti2(X4)
| op2(X3,X3) != X4
| op2(X4,X4) != X3
| op2(X3,X4) = X3
| ~ sorti2(X3) ),
inference(shift_quantors,[status(thm)],[32]) ).
cnf(34,plain,
( op2(X1,X2) = X1
| ~ sorti2(X1)
| op2(X2,X2) != X1
| op2(X1,X1) != X2
| ~ sorti2(X2) ),
inference(split_conjunct,[status(thm)],[33]) ).
cnf(45,negated_conjecture,
( op2(X1,h(X2)) = h(op1(j(X1),X2))
| ~ sorti1(X2)
| ~ sorti1(j(X1))
| ~ sorti2(X1) ),
inference(spm,[status(thm)],[23,25,theory(equality)]) ).
cnf(46,negated_conjecture,
( op2(h(X1),X2) = h(op1(X1,j(X2)))
| ~ sorti1(j(X2))
| ~ sorti1(X1)
| ~ sorti2(X2) ),
inference(spm,[status(thm)],[23,25,theory(equality)]) ).
cnf(47,negated_conjecture,
( sorti2(h(op1(X1,X2)))
| ~ sorti2(h(X2))
| ~ sorti2(h(X1))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
inference(spm,[status(thm)],[10,23,theory(equality)]) ).
cnf(48,negated_conjecture,
( op1(X1,j(X2)) = j(op2(h(X1),X2))
| ~ sorti2(X2)
| ~ sorti2(h(X1))
| ~ sorti1(X1) ),
inference(spm,[status(thm)],[24,26,theory(equality)]) ).
cnf(51,plain,
( op2(op2(X1,X1),X1) = op2(X1,X1)
| op2(op2(X1,X1),op2(X1,X1)) != X1
| ~ sorti2(X1)
| ~ sorti2(op2(X1,X1)) ),
inference(er,[status(thm)],[34,theory(equality)]) ).
cnf(53,negated_conjecture,
( sorti2(h(op1(X1,X2)))
| ~ sorti1(X2)
| ~ sorti1(X1)
| ~ sorti2(h(X2)) ),
inference(csr,[status(thm)],[47,21]) ).
cnf(54,negated_conjecture,
( sorti2(h(op1(X1,X2)))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
inference(csr,[status(thm)],[53,21]) ).
cnf(55,negated_conjecture,
( sorti2(h(esk2_0))
| ~ sorti1(esk1_0) ),
inference(spm,[status(thm)],[54,15,theory(equality)]) ).
cnf(56,negated_conjecture,
( sorti2(h(esk1_0))
| ~ sorti1(esk2_0) ),
inference(spm,[status(thm)],[54,14,theory(equality)]) ).
cnf(58,negated_conjecture,
( sorti2(h(esk2_0))
| $false ),
inference(rw,[status(thm)],[55,17,theory(equality)]) ).
cnf(59,negated_conjecture,
sorti2(h(esk2_0)),
inference(cn,[status(thm)],[58,theory(equality)]) ).
cnf(60,negated_conjecture,
( sorti2(h(esk1_0))
| $false ),
inference(rw,[status(thm)],[56,16,theory(equality)]) ).
cnf(61,negated_conjecture,
sorti2(h(esk1_0)),
inference(cn,[status(thm)],[60,theory(equality)]) ).
cnf(62,negated_conjecture,
( h(op1(j(X1),X2)) = op2(X1,h(X2))
| ~ sorti1(X2)
| ~ sorti2(X1) ),
inference(csr,[status(thm)],[45,22]) ).
cnf(68,negated_conjecture,
( h(j(op2(X1,X2))) = op2(X1,h(j(X2)))
| ~ sorti1(j(X2))
| ~ sorti2(X1)
| ~ sorti2(X2) ),
inference(spm,[status(thm)],[62,24,theory(equality)]) ).
cnf(99,negated_conjecture,
( h(op1(X1,j(X2))) = op2(h(X1),X2)
| ~ sorti1(X1)
| ~ sorti2(X2) ),
inference(csr,[status(thm)],[46,22]) ).
cnf(133,negated_conjecture,
( j(op2(h(X1),X2)) = op1(X1,j(X2))
| ~ sorti1(X1)
| ~ sorti2(X2) ),
inference(csr,[status(thm)],[48,21]) ).
cnf(137,negated_conjecture,
( j(h(op1(X1,X2))) = op1(X1,j(h(X2)))
| ~ sorti1(X1)
| ~ sorti2(h(X2))
| ~ sorti1(X2) ),
inference(spm,[status(thm)],[133,23,theory(equality)]) ).
cnf(196,plain,
( op2(op2(X1,X1),X1) = op2(X1,X1)
| op2(op2(X1,X1),op2(X1,X1)) != X1
| ~ sorti2(X1) ),
inference(spm,[status(thm)],[51,10,theory(equality)]) ).
cnf(381,negated_conjecture,
( op2(X1,h(j(X2))) = h(j(op2(X1,X2)))
| ~ sorti2(X1)
| ~ sorti2(X2) ),
inference(csr,[status(thm)],[68,22]) ).
cnf(382,negated_conjecture,
( op2(X1,X2) = h(j(op2(X1,X2)))
| ~ sorti2(X1)
| ~ sorti2(X2) ),
inference(spm,[status(thm)],[381,25,theory(equality)]) ).
cnf(1354,negated_conjecture,
( op1(X1,j(h(X2))) = j(h(op1(X1,X2)))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
inference(csr,[status(thm)],[137,21]) ).
cnf(1360,negated_conjecture,
( op1(X1,X2) = j(h(op1(X1,X2)))
| ~ sorti1(X1)
| ~ sorti1(X2) ),
inference(spm,[status(thm)],[1354,26,theory(equality)]) ).
cnf(1452,negated_conjecture,
( j(h(esk2_0)) = esk2_0
| ~ sorti1(esk1_0) ),
inference(spm,[status(thm)],[1360,15,theory(equality)]) ).
cnf(1453,negated_conjecture,
( j(h(esk1_0)) = esk1_0
| ~ sorti1(esk2_0) ),
inference(spm,[status(thm)],[1360,14,theory(equality)]) ).
cnf(1497,negated_conjecture,
( j(h(esk2_0)) = esk2_0
| $false ),
inference(rw,[status(thm)],[1452,17,theory(equality)]) ).
cnf(1498,negated_conjecture,
j(h(esk2_0)) = esk2_0,
inference(cn,[status(thm)],[1497,theory(equality)]) ).
cnf(1499,negated_conjecture,
( j(h(esk1_0)) = esk1_0
| $false ),
inference(rw,[status(thm)],[1453,16,theory(equality)]) ).
cnf(1500,negated_conjecture,
j(h(esk1_0)) = esk1_0,
inference(cn,[status(thm)],[1499,theory(equality)]) ).
cnf(1521,negated_conjecture,
( op1(j(X1),esk2_0) = j(op2(X1,h(esk2_0)))
| ~ sorti2(h(esk2_0))
| ~ sorti2(X1) ),
inference(spm,[status(thm)],[24,1498,theory(equality)]) ).
cnf(1523,negated_conjecture,
( h(op1(X1,esk2_0)) = op2(h(X1),h(esk2_0))
| ~ sorti1(X1)
| ~ sorti2(h(esk2_0)) ),
inference(spm,[status(thm)],[99,1498,theory(equality)]) ).
cnf(1564,negated_conjecture,
( op1(j(X1),esk2_0) = j(op2(X1,h(esk2_0)))
| $false
| ~ sorti2(X1) ),
inference(rw,[status(thm)],[1521,59,theory(equality)]) ).
cnf(1565,negated_conjecture,
( op1(j(X1),esk2_0) = j(op2(X1,h(esk2_0)))
| ~ sorti2(X1) ),
inference(cn,[status(thm)],[1564,theory(equality)]) ).
cnf(1568,negated_conjecture,
( h(op1(X1,esk2_0)) = op2(h(X1),h(esk2_0))
| ~ sorti1(X1)
| $false ),
inference(rw,[status(thm)],[1523,59,theory(equality)]) ).
cnf(1569,negated_conjecture,
( h(op1(X1,esk2_0)) = op2(h(X1),h(esk2_0))
| ~ sorti1(X1) ),
inference(cn,[status(thm)],[1568,theory(equality)]) ).
cnf(1615,negated_conjecture,
( op1(esk1_0,j(X1)) = j(op2(h(esk1_0),X1))
| ~ sorti2(X1)
| ~ sorti2(h(esk1_0)) ),
inference(spm,[status(thm)],[24,1500,theory(equality)]) ).
cnf(1656,negated_conjecture,
( op1(esk1_0,j(X1)) = j(op2(h(esk1_0),X1))
| ~ sorti2(X1)
| $false ),
inference(rw,[status(thm)],[1615,61,theory(equality)]) ).
cnf(1657,negated_conjecture,
( op1(esk1_0,j(X1)) = j(op2(h(esk1_0),X1))
| ~ sorti2(X1) ),
inference(cn,[status(thm)],[1656,theory(equality)]) ).
cnf(3321,negated_conjecture,
( op2(h(op1(X1,X1)),h(X1)) = h(op1(X1,X1))
| op2(h(op1(X1,X1)),h(op1(X1,X1))) != h(X1)
| ~ sorti2(h(X1))
| ~ sorti1(X1) ),
inference(spm,[status(thm)],[196,23,theory(equality)]) ).
cnf(4520,negated_conjecture,
( h(op1(j(X1),esk2_0)) = op2(X1,h(esk2_0))
| ~ sorti2(X1)
| ~ sorti2(h(esk2_0)) ),
inference(spm,[status(thm)],[382,1565,theory(equality)]) ).
cnf(4603,negated_conjecture,
( h(op1(j(X1),esk2_0)) = op2(X1,h(esk2_0))
| ~ sorti2(X1)
| $false ),
inference(rw,[status(thm)],[4520,59,theory(equality)]) ).
cnf(4604,negated_conjecture,
( h(op1(j(X1),esk2_0)) = op2(X1,h(esk2_0))
| ~ sorti2(X1) ),
inference(cn,[status(thm)],[4603,theory(equality)]) ).
cnf(6512,negated_conjecture,
( h(op1(esk1_0,j(X1))) = op2(h(esk1_0),X1)
| ~ sorti2(h(esk1_0))
| ~ sorti2(X1) ),
inference(spm,[status(thm)],[382,1657,theory(equality)]) ).
cnf(6580,negated_conjecture,
( j(h(op1(esk1_0,esk2_0))) = op1(esk1_0,j(h(esk2_0)))
| ~ sorti2(h(esk2_0))
| ~ sorti1(esk1_0) ),
inference(spm,[status(thm)],[1657,1569,theory(equality)]) ).
cnf(6614,negated_conjecture,
( h(op1(esk1_0,j(X1))) = op2(h(esk1_0),X1)
| $false
| ~ sorti2(X1) ),
inference(rw,[status(thm)],[6512,61,theory(equality)]) ).
cnf(6615,negated_conjecture,
( h(op1(esk1_0,j(X1))) = op2(h(esk1_0),X1)
| ~ sorti2(X1) ),
inference(cn,[status(thm)],[6614,theory(equality)]) ).
cnf(6657,negated_conjecture,
( j(h(op1(esk1_0,esk2_0))) = op1(esk1_0,esk2_0)
| ~ sorti2(h(esk2_0))
| ~ sorti1(esk1_0) ),
inference(rw,[status(thm)],[6580,1498,theory(equality)]) ).
cnf(6658,negated_conjecture,
( j(h(op1(esk1_0,esk2_0))) = op1(esk1_0,esk2_0)
| $false
| ~ sorti1(esk1_0) ),
inference(rw,[status(thm)],[6657,59,theory(equality)]) ).
cnf(6659,negated_conjecture,
( j(h(op1(esk1_0,esk2_0))) = op1(esk1_0,esk2_0)
| $false
| $false ),
inference(rw,[status(thm)],[6658,17,theory(equality)]) ).
cnf(6660,negated_conjecture,
j(h(op1(esk1_0,esk2_0))) = op1(esk1_0,esk2_0),
inference(cn,[status(thm)],[6659,theory(equality)]) ).
cnf(18121,negated_conjecture,
( h(op1(esk1_0,esk2_0)) = op2(h(esk1_0),h(esk2_0))
| ~ sorti2(h(esk1_0)) ),
inference(spm,[status(thm)],[4604,1500,theory(equality)]) ).
cnf(18268,negated_conjecture,
( h(op1(esk1_0,esk2_0)) = op2(h(esk1_0),h(esk2_0))
| $false ),
inference(rw,[status(thm)],[18121,61,theory(equality)]) ).
cnf(18269,negated_conjecture,
h(op1(esk1_0,esk2_0)) = op2(h(esk1_0),h(esk2_0)),
inference(cn,[status(thm)],[18268,theory(equality)]) ).
cnf(20710,negated_conjecture,
( h(op1(esk1_0,esk1_0)) = op2(h(esk1_0),h(esk1_0))
| ~ sorti2(h(esk1_0)) ),
inference(spm,[status(thm)],[6615,1500,theory(equality)]) ).
cnf(20856,negated_conjecture,
( h(esk2_0) = op2(h(esk1_0),h(esk1_0))
| ~ sorti2(h(esk1_0)) ),
inference(rw,[status(thm)],[20710,15,theory(equality)]) ).
cnf(20857,negated_conjecture,
( h(esk2_0) = op2(h(esk1_0),h(esk1_0))
| $false ),
inference(rw,[status(thm)],[20856,61,theory(equality)]) ).
cnf(20858,negated_conjecture,
h(esk2_0) = op2(h(esk1_0),h(esk1_0)),
inference(cn,[status(thm)],[20857,theory(equality)]) ).
cnf(279383,negated_conjecture,
( op2(h(op1(X1,X1)),h(X1)) = h(op1(X1,X1))
| op2(h(op1(X1,X1)),h(op1(X1,X1))) != h(X1)
| ~ sorti1(X1) ),
inference(csr,[status(thm)],[3321,21]) ).
cnf(279385,negated_conjecture,
( op2(h(esk1_0),h(esk2_0)) = h(esk1_0)
| op2(h(esk1_0),h(esk1_0)) != h(esk2_0)
| ~ sorti1(esk2_0) ),
inference(spm,[status(thm)],[279383,14,theory(equality)]) ).
cnf(279460,negated_conjecture,
( h(op1(esk1_0,esk2_0)) = h(esk1_0)
| op2(h(esk1_0),h(esk1_0)) != h(esk2_0)
| ~ sorti1(esk2_0) ),
inference(rw,[status(thm)],[279385,18269,theory(equality)]) ).
cnf(279461,negated_conjecture,
( h(op1(esk1_0,esk2_0)) = h(esk1_0)
| $false
| ~ sorti1(esk2_0) ),
inference(rw,[status(thm)],[279460,20858,theory(equality)]) ).
cnf(279462,negated_conjecture,
( h(op1(esk1_0,esk2_0)) = h(esk1_0)
| $false
| $false ),
inference(rw,[status(thm)],[279461,16,theory(equality)]) ).
cnf(279463,negated_conjecture,
h(op1(esk1_0,esk2_0)) = h(esk1_0),
inference(cn,[status(thm)],[279462,theory(equality)]) ).
cnf(280136,negated_conjecture,
j(h(esk1_0)) = op1(esk1_0,esk2_0),
inference(rw,[status(thm)],[6660,279463,theory(equality)]) ).
cnf(280137,negated_conjecture,
esk1_0 = op1(esk1_0,esk2_0),
inference(rw,[status(thm)],[280136,1500,theory(equality)]) ).
cnf(280138,negated_conjecture,
$false,
inference(sr,[status(thm)],[280137,13,theory(equality)]) ).
cnf(280139,negated_conjecture,
$false,
280138,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/ALG/ALG073+1.p
% --creating new selector for []
% -running prover on /tmp/tmpdv6ayF/sel_ALG073+1.p_1 with time limit 29
% -prover status Theorem
% Problem ALG073+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/ALG/ALG073+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/ALG/ALG073+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
%
%------------------------------------------------------------------------------