%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV396+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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 12:37:22 EST 2010
% Result : Theorem 239.90s
% Output : CNFRefutation 239.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 14
% Syntax : Number of formulae : 104 ( 21 unt; 0 def)
% Number of atoms : 317 ( 92 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 330 ( 117 ~; 140 |; 54 &)
% ( 5 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-3 aty)
% Number of variables : 277 ( 27 sgn 182 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3,X4] :
( ~ contains_slb(X2,X4)
=> remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
file('/tmp/tmpM1F6s9/sel_SWV396+1.p_5',ax43) ).
fof(6,axiom,
! [X1,X2,X3,X4] :
( ( X2 != X3
& contains_slb(X1,X3) )
=> remove_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(remove_slb(X1,X3),pair(X2,X4)) ),
file('/tmp/tmpM1F6s9/sel_SWV396+1.p_5',ax25) ).
fof(7,axiom,
! [X1,X2,X3] : remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
file('/tmp/tmpM1F6s9/sel_SWV396+1.p_5',ax24) ).
fof(8,axiom,
! [X1,X2,X3,X4] :
( ( X2 != X3
& contains_slb(X1,X3) )
=> lookup_slb(insert_slb(X1,pair(X2,X4)),X3) = lookup_slb(X1,X3) ),
file('/tmp/tmpM1F6s9/sel_SWV396+1.p_5',ax27) ).
fof(9,axiom,
! [X1,X2,X3] : lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
file('/tmp/tmpM1F6s9/sel_SWV396+1.p_5',ax26) ).
fof(10,axiom,
! [X1,X2,X3,X4] :
( contains_slb(insert_slb(X1,pair(X2,X4)),X3)
<=> ( contains_slb(X1,X3)
| X2 = X3 ) ),
file('/tmp/tmpM1F6s9/sel_SWV396+1.p_5',ax21) ).
fof(12,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& strictly_less_than(X4,lookup_slb(X2,X4)) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad) ),
file('/tmp/tmpM1F6s9/sel_SWV396+1.p_5',ax45) ).
fof(13,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& less_than(lookup_slb(X2,X4),X4) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) ),
file('/tmp/tmpM1F6s9/sel_SWV396+1.p_5',ax44) ).
fof(15,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/tmp/tmpM1F6s9/sel_SWV396+1.p_5',ax40) ).
fof(19,axiom,
! [X1,X2,X3,X4,X5] :
( pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)
<=> ( pair_in_list(X1,X3,X5)
| ( X2 = X3
& X4 = X5 ) ) ),
file('/tmp/tmpM1F6s9/sel_SWV396+1.p_5',ax23) ).
fof(20,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/tmp/tmpM1F6s9/sel_SWV396+1.p_5',totality) ).
fof(21,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/tmp/tmpM1F6s9/sel_SWV396+1.p_5',stricly_smaller_definition) ).
fof(23,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
file('/tmp/tmpM1F6s9/sel_SWV396+1.p_5',ax41) ).
fof(36,conjecture,
! [X1] :
( ! [X2,X3,X4,X5] :
( ( pair_in_list(X1,X4,X5)
& strictly_less_than(X4,X5)
& ok(remove_cpq(triple(X2,X1,X3),X4)) )
=> pair_in_list(remove_slb(X1,X4),X4,X5) )
=> ! [X6,X7,X8,X9,X10,X11] :
( ( pair_in_list(insert_slb(X1,pair(X10,X11)),X8,X9)
& strictly_less_than(X8,X9)
& ok(remove_cpq(triple(X6,insert_slb(X1,pair(X10,X11)),X7),X8)) )
=> pair_in_list(remove_slb(insert_slb(X1,pair(X10,X11)),X8),X8,X9) ) ),
file('/tmp/tmpM1F6s9/sel_SWV396+1.p_5',l32_co) ).
fof(37,negated_conjecture,
~ ! [X1] :
( ! [X2,X3,X4,X5] :
( ( pair_in_list(X1,X4,X5)
& strictly_less_than(X4,X5)
& ok(remove_cpq(triple(X2,X1,X3),X4)) )
=> pair_in_list(remove_slb(X1,X4),X4,X5) )
=> ! [X6,X7,X8,X9,X10,X11] :
( ( pair_in_list(insert_slb(X1,pair(X10,X11)),X8,X9)
& strictly_less_than(X8,X9)
& ok(remove_cpq(triple(X6,insert_slb(X1,pair(X10,X11)),X7),X8)) )
=> pair_in_list(remove_slb(insert_slb(X1,pair(X10,X11)),X8),X8,X9) ) ),
inference(assume_negation,[status(cth)],[36]) ).
fof(38,plain,
! [X1,X2,X3,X4] :
( ~ contains_slb(X2,X4)
=> remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).
fof(40,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[21,theory(equality)]) ).
fof(42,plain,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
inference(fof_simplification,[status(thm)],[23,theory(equality)]) ).
fof(44,plain,
! [X1,X2,X3,X4] :
( contains_slb(X2,X4)
| remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
inference(fof_nnf,[status(thm)],[38]) ).
fof(45,plain,
! [X5,X6,X7,X8] :
( contains_slb(X6,X8)
| remove_cpq(triple(X5,X6,X7),X8) = triple(X5,X6,bad) ),
inference(variable_rename,[status(thm)],[44]) ).
cnf(46,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad)
| contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[45]) ).
fof(58,plain,
! [X1,X2,X3,X4] :
( X2 = X3
| ~ contains_slb(X1,X3)
| remove_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(remove_slb(X1,X3),pair(X2,X4)) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(59,plain,
! [X5,X6,X7,X8] :
( X6 = X7
| ~ contains_slb(X5,X7)
| remove_slb(insert_slb(X5,pair(X6,X8)),X7) = insert_slb(remove_slb(X5,X7),pair(X6,X8)) ),
inference(variable_rename,[status(thm)],[58]) ).
cnf(60,plain,
( remove_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(remove_slb(X1,X4),pair(X2,X3))
| X2 = X4
| ~ contains_slb(X1,X4) ),
inference(split_conjunct,[status(thm)],[59]) ).
fof(61,plain,
! [X4,X5,X6] : remove_slb(insert_slb(X4,pair(X5,X6)),X5) = X4,
inference(variable_rename,[status(thm)],[7]) ).
cnf(62,plain,
remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
inference(split_conjunct,[status(thm)],[61]) ).
fof(63,plain,
! [X1,X2,X3,X4] :
( X2 = X3
| ~ contains_slb(X1,X3)
| lookup_slb(insert_slb(X1,pair(X2,X4)),X3) = lookup_slb(X1,X3) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(64,plain,
! [X5,X6,X7,X8] :
( X6 = X7
| ~ contains_slb(X5,X7)
| lookup_slb(insert_slb(X5,pair(X6,X8)),X7) = lookup_slb(X5,X7) ),
inference(variable_rename,[status(thm)],[63]) ).
cnf(65,plain,
( lookup_slb(insert_slb(X1,pair(X2,X3)),X4) = lookup_slb(X1,X4)
| X2 = X4
| ~ contains_slb(X1,X4) ),
inference(split_conjunct,[status(thm)],[64]) ).
fof(66,plain,
! [X4,X5,X6] : lookup_slb(insert_slb(X4,pair(X5,X6)),X5) = X6,
inference(variable_rename,[status(thm)],[9]) ).
cnf(67,plain,
lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
inference(split_conjunct,[status(thm)],[66]) ).
fof(68,plain,
! [X1,X2,X3,X4] :
( ( ~ contains_slb(insert_slb(X1,pair(X2,X4)),X3)
| contains_slb(X1,X3)
| X2 = X3 )
& ( ( ~ contains_slb(X1,X3)
& X2 != X3 )
| contains_slb(insert_slb(X1,pair(X2,X4)),X3) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(69,plain,
! [X5,X6,X7,X8] :
( ( ~ contains_slb(insert_slb(X5,pair(X6,X8)),X7)
| contains_slb(X5,X7)
| X6 = X7 )
& ( ( ~ contains_slb(X5,X7)
& X6 != X7 )
| contains_slb(insert_slb(X5,pair(X6,X8)),X7) ) ),
inference(variable_rename,[status(thm)],[68]) ).
fof(70,plain,
! [X5,X6,X7,X8] :
( ( ~ contains_slb(insert_slb(X5,pair(X6,X8)),X7)
| contains_slb(X5,X7)
| X6 = X7 )
& ( ~ contains_slb(X5,X7)
| contains_slb(insert_slb(X5,pair(X6,X8)),X7) )
& ( X6 != X7
| contains_slb(insert_slb(X5,pair(X6,X8)),X7) ) ),
inference(distribute,[status(thm)],[69]) ).
cnf(73,plain,
( X1 = X2
| contains_slb(X3,X2)
| ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2) ),
inference(split_conjunct,[status(thm)],[70]) ).
fof(79,plain,
! [X1,X2,X3,X4] :
( ~ contains_slb(X2,X4)
| ~ strictly_less_than(X4,lookup_slb(X2,X4))
| remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(80,plain,
! [X5,X6,X7,X8] :
( ~ contains_slb(X6,X8)
| ~ strictly_less_than(X8,lookup_slb(X6,X8))
| remove_cpq(triple(X5,X6,X7),X8) = triple(remove_pqp(X5,X8),remove_slb(X6,X8),bad) ),
inference(variable_rename,[status(thm)],[79]) ).
cnf(81,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)
| ~ strictly_less_than(X4,lookup_slb(X2,X4))
| ~ contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[80]) ).
fof(82,plain,
! [X1,X2,X3,X4] :
( ~ contains_slb(X2,X4)
| ~ less_than(lookup_slb(X2,X4),X4)
| remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(83,plain,
! [X5,X6,X7,X8] :
( ~ contains_slb(X6,X8)
| ~ less_than(lookup_slb(X6,X8),X8)
| remove_cpq(triple(X5,X6,X7),X8) = triple(remove_pqp(X5,X8),remove_slb(X6,X8),X7) ),
inference(variable_rename,[status(thm)],[82]) ).
cnf(84,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3)
| ~ less_than(lookup_slb(X2,X4),X4)
| ~ contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[83]) ).
fof(87,plain,
! [X1,X2] :
( ( ~ ok(triple(X1,X2,bad))
| ~ $true )
& ( $true
| ok(triple(X1,X2,bad)) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(88,plain,
! [X3,X4] :
( ( ~ ok(triple(X3,X4,bad))
| ~ $true )
& ( $true
| ok(triple(X3,X4,bad)) ) ),
inference(variable_rename,[status(thm)],[87]) ).
cnf(90,plain,
( $false
| ~ ok(triple(X1,X2,bad)) ),
inference(split_conjunct,[status(thm)],[88]) ).
fof(98,plain,
! [X1,X2,X3,X4,X5] :
( ( ~ pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)
| pair_in_list(X1,X3,X5)
| ( X2 = X3
& X4 = X5 ) )
& ( ( ~ pair_in_list(X1,X3,X5)
& ( X2 != X3
| X4 != X5 ) )
| pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5) ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(99,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10)
| pair_in_list(X6,X8,X10)
| ( X7 = X8
& X9 = X10 ) )
& ( ( ~ pair_in_list(X6,X8,X10)
& ( X7 != X8
| X9 != X10 ) )
| pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) ) ),
inference(variable_rename,[status(thm)],[98]) ).
fof(100,plain,
! [X6,X7,X8,X9,X10] :
( ( X7 = X8
| pair_in_list(X6,X8,X10)
| ~ pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( X9 = X10
| pair_in_list(X6,X8,X10)
| ~ pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( ~ pair_in_list(X6,X8,X10)
| pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( X7 != X8
| X9 != X10
| pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) ) ),
inference(distribute,[status(thm)],[99]) ).
cnf(102,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| ~ pair_in_list(X1,X4,X5) ),
inference(split_conjunct,[status(thm)],[100]) ).
cnf(103,plain,
( pair_in_list(X1,X4,X5)
| X3 = X5
| ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
inference(split_conjunct,[status(thm)],[100]) ).
cnf(104,plain,
( pair_in_list(X1,X4,X5)
| X2 = X4
| ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
inference(split_conjunct,[status(thm)],[100]) ).
fof(105,plain,
! [X3,X4] :
( less_than(X3,X4)
| less_than(X4,X3) ),
inference(variable_rename,[status(thm)],[20]) ).
cnf(106,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[105]) ).
fof(107,plain,
! [X1,X2] :
( ( ~ strictly_less_than(X1,X2)
| ( less_than(X1,X2)
& ~ less_than(X2,X1) ) )
& ( ~ less_than(X1,X2)
| less_than(X2,X1)
| strictly_less_than(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[40]) ).
fof(108,plain,
! [X3,X4] :
( ( ~ strictly_less_than(X3,X4)
| ( less_than(X3,X4)
& ~ less_than(X4,X3) ) )
& ( ~ less_than(X3,X4)
| less_than(X4,X3)
| strictly_less_than(X3,X4) ) ),
inference(variable_rename,[status(thm)],[107]) ).
fof(109,plain,
! [X3,X4] :
( ( less_than(X3,X4)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X4,X3)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X3,X4)
| less_than(X4,X3)
| strictly_less_than(X3,X4) ) ),
inference(distribute,[status(thm)],[108]) ).
cnf(110,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[109]) ).
cnf(111,plain,
( ~ strictly_less_than(X1,X2)
| ~ less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[109]) ).
fof(115,plain,
! [X1,X2,X3] :
( ok(triple(X1,X2,X3))
| X3 = bad ),
inference(fof_nnf,[status(thm)],[42]) ).
fof(116,plain,
! [X4,X5,X6] :
( ok(triple(X4,X5,X6))
| X6 = bad ),
inference(variable_rename,[status(thm)],[115]) ).
cnf(117,plain,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[116]) ).
fof(151,negated_conjecture,
? [X1] :
( ! [X2,X3,X4,X5] :
( ~ pair_in_list(X1,X4,X5)
| ~ strictly_less_than(X4,X5)
| ~ ok(remove_cpq(triple(X2,X1,X3),X4))
| pair_in_list(remove_slb(X1,X4),X4,X5) )
& ? [X6,X7,X8,X9,X10,X11] :
( pair_in_list(insert_slb(X1,pair(X10,X11)),X8,X9)
& strictly_less_than(X8,X9)
& ok(remove_cpq(triple(X6,insert_slb(X1,pair(X10,X11)),X7),X8))
& ~ pair_in_list(remove_slb(insert_slb(X1,pair(X10,X11)),X8),X8,X9) ) ),
inference(fof_nnf,[status(thm)],[37]) ).
fof(152,negated_conjecture,
? [X12] :
( ! [X13,X14,X15,X16] :
( ~ pair_in_list(X12,X15,X16)
| ~ strictly_less_than(X15,X16)
| ~ ok(remove_cpq(triple(X13,X12,X14),X15))
| pair_in_list(remove_slb(X12,X15),X15,X16) )
& ? [X17,X18,X19,X20,X21,X22] :
( pair_in_list(insert_slb(X12,pair(X21,X22)),X19,X20)
& strictly_less_than(X19,X20)
& ok(remove_cpq(triple(X17,insert_slb(X12,pair(X21,X22)),X18),X19))
& ~ pair_in_list(remove_slb(insert_slb(X12,pair(X21,X22)),X19),X19,X20) ) ),
inference(variable_rename,[status(thm)],[151]) ).
fof(153,negated_conjecture,
( ! [X13,X14,X15,X16] :
( ~ pair_in_list(esk1_0,X15,X16)
| ~ strictly_less_than(X15,X16)
| ~ ok(remove_cpq(triple(X13,esk1_0,X14),X15))
| pair_in_list(remove_slb(esk1_0,X15),X15,X16) )
& pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0,esk5_0)
& strictly_less_than(esk4_0,esk5_0)
& ok(remove_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk3_0),esk4_0))
& ~ pair_in_list(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),esk4_0,esk5_0) ),
inference(skolemize,[status(esa)],[152]) ).
fof(154,negated_conjecture,
! [X13,X14,X15,X16] :
( ( ~ pair_in_list(esk1_0,X15,X16)
| ~ strictly_less_than(X15,X16)
| ~ ok(remove_cpq(triple(X13,esk1_0,X14),X15))
| pair_in_list(remove_slb(esk1_0,X15),X15,X16) )
& pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0,esk5_0)
& strictly_less_than(esk4_0,esk5_0)
& ok(remove_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk3_0),esk4_0))
& ~ pair_in_list(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),esk4_0,esk5_0) ),
inference(shift_quantors,[status(thm)],[153]) ).
cnf(155,negated_conjecture,
~ pair_in_list(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[154]) ).
cnf(156,negated_conjecture,
ok(remove_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk3_0),esk4_0)),
inference(split_conjunct,[status(thm)],[154]) ).
cnf(157,negated_conjecture,
strictly_less_than(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[154]) ).
cnf(158,negated_conjecture,
pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[154]) ).
cnf(159,negated_conjecture,
( pair_in_list(remove_slb(esk1_0,X1),X1,X2)
| ~ ok(remove_cpq(triple(X3,esk1_0,X4),X1))
| ~ strictly_less_than(X1,X2)
| ~ pair_in_list(esk1_0,X1,X2) ),
inference(split_conjunct,[status(thm)],[154]) ).
cnf(166,negated_conjecture,
~ less_than(esk5_0,esk4_0),
inference(spm,[status(thm)],[111,157,theory(equality)]) ).
cnf(168,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[110,106]) ).
cnf(185,negated_conjecture,
( esk7_0 = esk5_0
| pair_in_list(esk1_0,esk4_0,esk5_0) ),
inference(spm,[status(thm)],[103,158,theory(equality)]) ).
cnf(187,negated_conjecture,
( esk6_0 = esk4_0
| pair_in_list(esk1_0,esk4_0,esk5_0) ),
inference(spm,[status(thm)],[104,158,theory(equality)]) ).
cnf(189,negated_conjecture,
( ok(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),bad))
| contains_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0) ),
inference(spm,[status(thm)],[156,46,theory(equality)]) ).
cnf(191,negated_conjecture,
contains_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),
inference(sr,[status(thm)],[189,90,theory(equality)]) ).
cnf(214,negated_conjecture,
( esk6_0 = esk4_0
| ~ pair_in_list(insert_slb(remove_slb(esk1_0,esk4_0),pair(esk6_0,esk7_0)),esk4_0,esk5_0)
| ~ contains_slb(esk1_0,esk4_0) ),
inference(spm,[status(thm)],[155,60,theory(equality)]) ).
cnf(231,plain,
( ~ ok(remove_cpq(triple(X1,X3,X4),X2))
| ~ strictly_less_than(X2,lookup_slb(X3,X2))
| ~ contains_slb(X3,X2) ),
inference(spm,[status(thm)],[90,81,theory(equality)]) ).
cnf(242,plain,
( bad = X1
| ok(remove_cpq(triple(X2,X4,X1),X3))
| ~ less_than(lookup_slb(X4,X3),X3)
| ~ contains_slb(X4,X3) ),
inference(spm,[status(thm)],[117,84,theory(equality)]) ).
cnf(263,negated_conjecture,
( esk6_0 = esk4_0
| contains_slb(esk1_0,esk4_0) ),
inference(spm,[status(thm)],[73,191,theory(equality)]) ).
cnf(268,negated_conjecture,
( esk6_0 = esk4_0
| ~ pair_in_list(insert_slb(remove_slb(esk1_0,esk4_0),pair(esk6_0,esk7_0)),esk4_0,esk5_0) ),
inference(csr,[status(thm)],[214,263]) ).
cnf(269,negated_conjecture,
( esk6_0 = esk4_0
| ~ pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,esk5_0) ),
inference(spm,[status(thm)],[268,102,theory(equality)]) ).
cnf(590,negated_conjecture,
( ~ strictly_less_than(esk4_0,lookup_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0))
| ~ contains_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0) ),
inference(spm,[status(thm)],[231,156,theory(equality)]) ).
cnf(596,negated_conjecture,
( ~ strictly_less_than(esk4_0,lookup_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0))
| $false ),
inference(rw,[status(thm)],[590,191,theory(equality)]) ).
cnf(597,negated_conjecture,
~ strictly_less_than(esk4_0,lookup_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0)),
inference(cn,[status(thm)],[596,theory(equality)]) ).
cnf(602,negated_conjecture,
( esk6_0 = esk4_0
| ~ strictly_less_than(esk4_0,lookup_slb(esk1_0,esk4_0))
| ~ contains_slb(esk1_0,esk4_0) ),
inference(spm,[status(thm)],[597,65,theory(equality)]) ).
cnf(619,negated_conjecture,
( esk6_0 = esk4_0
| ~ strictly_less_than(esk4_0,lookup_slb(esk1_0,esk4_0)) ),
inference(csr,[status(thm)],[602,263]) ).
cnf(620,negated_conjecture,
( esk6_0 = esk4_0
| less_than(lookup_slb(esk1_0,esk4_0),esk4_0) ),
inference(spm,[status(thm)],[619,168,theory(equality)]) ).
cnf(2907,negated_conjecture,
( bad = X1
| ok(remove_cpq(triple(X2,esk1_0,X1),esk4_0))
| esk6_0 = esk4_0
| ~ contains_slb(esk1_0,esk4_0) ),
inference(spm,[status(thm)],[242,620,theory(equality)]) ).
cnf(2986,negated_conjecture,
( esk6_0 = esk4_0
| bad = X1
| ok(remove_cpq(triple(X2,esk1_0,X1),esk4_0)) ),
inference(csr,[status(thm)],[2907,263]) ).
cnf(2988,negated_conjecture,
( pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,X1)
| esk6_0 = esk4_0
| bad = X3
| ~ pair_in_list(esk1_0,esk4_0,X1)
| ~ strictly_less_than(esk4_0,X1) ),
inference(spm,[status(thm)],[159,2986,theory(equality)]) ).
cnf(2998,negated_conjecture,
( esk6_0 = esk4_0
| bad = X1
| pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,esk5_0)
| ~ strictly_less_than(esk4_0,esk5_0) ),
inference(spm,[status(thm)],[2988,187,theory(equality)]) ).
cnf(3001,negated_conjecture,
( esk6_0 = esk4_0
| bad = X1
| pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,esk5_0)
| $false ),
inference(rw,[status(thm)],[2998,157,theory(equality)]) ).
cnf(3002,negated_conjecture,
( esk6_0 = esk4_0
| bad = X1
| pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,esk5_0) ),
inference(cn,[status(thm)],[3001,theory(equality)]) ).
cnf(3003,negated_conjecture,
( esk6_0 = esk4_0
| bad = X1 ),
inference(csr,[status(thm)],[3002,269]) ).
cnf(3057,negated_conjecture,
( esk6_0 = esk4_0
| ~ ok(bad) ),
inference(spm,[status(thm)],[90,3003,theory(equality)]) ).
cnf(3487,negated_conjecture,
( esk6_0 = esk4_0
| ~ ok(X1) ),
inference(spm,[status(thm)],[3057,3003,theory(equality)]) ).
cnf(3488,negated_conjecture,
esk6_0 = esk4_0,
inference(spm,[status(thm)],[3487,156,theory(equality)]) ).
cnf(3497,negated_conjecture,
~ strictly_less_than(esk4_0,esk7_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[597,3488,theory(equality)]),67,theory(equality)]) ).
cnf(3498,negated_conjecture,
~ pair_in_list(esk1_0,esk4_0,esk5_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[155,3488,theory(equality)]),62,theory(equality)]) ).
cnf(3528,negated_conjecture,
less_than(esk7_0,esk4_0),
inference(spm,[status(thm)],[3497,168,theory(equality)]) ).
cnf(3562,negated_conjecture,
esk7_0 = esk5_0,
inference(sr,[status(thm)],[185,3498,theory(equality)]) ).
cnf(3576,negated_conjecture,
less_than(esk5_0,esk4_0),
inference(rw,[status(thm)],[3528,3562,theory(equality)]) ).
cnf(3577,negated_conjecture,
$false,
inference(sr,[status(thm)],[3576,166,theory(equality)]) ).
cnf(3578,negated_conjecture,
$false,
3577,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV396+1.p
% --creating new selector for [SWV007+0.ax, SWV007+2.ax, SWV007+3.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpM1F6s9/sel_SWV396+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpM1F6s9/sel_SWV396+1.p_2 with time limit 81
% -prover status ResourceOut
% --creating new selector for [SWV007+0.ax, SWV007+2.ax, SWV007+3.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpM1F6s9/sel_SWV396+1.p_3 with time limit 74
% -prover status ResourceOut
% --creating new selector for [SWV007+0.ax, SWV007+2.ax, SWV007+3.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpM1F6s9/sel_SWV396+1.p_4 with time limit 55
% -prover status ResourceOut
% --creating new selector for [SWV007+0.ax, SWV007+2.ax, SWV007+3.ax]
% -running prover on /tmp/tmpM1F6s9/sel_SWV396+1.p_5 with time limit 54
% -prover status Theorem
% Problem SWV396+1.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV396+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV396+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
%
%------------------------------------------------------------------------------