%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV169+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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:21:20 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 25 ( 6 unt; 0 def)
% Number of atoms : 240 ( 43 equ)
% Maximal formula atoms : 37 ( 9 avg)
% Number of connectives : 312 ( 97 ~; 96 |; 94 &)
% ( 0 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-3 aty)
% Number of variables : 52 ( 0 sgn 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(36,conjecture,
( ( leq(n0,pv10)
& leq(n0,pv11)
& leq(n0,pv65)
& leq(pv10,n135299)
& leq(pv11,n4)
& leq(pv65,n4)
& ! [X4,X5] :
( ( leq(n0,X4)
& leq(n0,X5)
& leq(X4,n135299)
& leq(X5,n4) )
=> ( ( X4 = pv10
& gt(pv11,X5) )
=> a_select3(q_init,X4,X5) = init ) )
& ! [X6,X7] :
( ( leq(n0,X6)
& leq(n0,X7)
& leq(X6,n135299)
& leq(X7,n4) )
=> ( gt(pv10,X6)
=> a_select3(q_init,X6,X7) = init ) )
& ! [X8] :
( ( leq(n0,X8)
& leq(X8,pred(pv10)) )
=> ! [X9] :
( ( leq(n0,X9)
& leq(X9,n4) )
=> a_select3(q_init,X8,X9) = init ) )
& ! [X10] :
( ( leq(n0,X10)
& leq(X10,n4) )
=> a_select3(center_init,X10,n0) = init ) )
=> a_select3(center_init,pv65,n0) = init ),
file('/tmp/tmpP5e3Gl/sel_SWV169+1.p_1',cl5_nebula_init_0021) ).
fof(67,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(n0,pv11)
& leq(n0,pv65)
& leq(pv10,n135299)
& leq(pv11,n4)
& leq(pv65,n4)
& ! [X4,X5] :
( ( leq(n0,X4)
& leq(n0,X5)
& leq(X4,n135299)
& leq(X5,n4) )
=> ( ( X4 = pv10
& gt(pv11,X5) )
=> a_select3(q_init,X4,X5) = init ) )
& ! [X6,X7] :
( ( leq(n0,X6)
& leq(n0,X7)
& leq(X6,n135299)
& leq(X7,n4) )
=> ( gt(pv10,X6)
=> a_select3(q_init,X6,X7) = init ) )
& ! [X8] :
( ( leq(n0,X8)
& leq(X8,pred(pv10)) )
=> ! [X9] :
( ( leq(n0,X9)
& leq(X9,n4) )
=> a_select3(q_init,X8,X9) = init ) )
& ! [X10] :
( ( leq(n0,X10)
& leq(X10,n4) )
=> a_select3(center_init,X10,n0) = init ) )
=> a_select3(center_init,pv65,n0) = init ),
inference(assume_negation,[status(cth)],[36]) ).
fof(69,plain,
( epred1_0
=> ( leq(n0,pv10)
& leq(n0,pv11)
& leq(n0,pv65)
& leq(pv10,n135299)
& leq(pv11,n4)
& leq(pv65,n4)
& ! [X4,X5] :
( ( leq(n0,X4)
& leq(n0,X5)
& leq(X4,n135299)
& leq(X5,n4) )
=> ( ( X4 = pv10
& gt(pv11,X5) )
=> a_select3(q_init,X4,X5) = init ) )
& ! [X6,X7] :
( ( leq(n0,X6)
& leq(n0,X7)
& leq(X6,n135299)
& leq(X7,n4) )
=> ( gt(pv10,X6)
=> a_select3(q_init,X6,X7) = init ) )
& ! [X8] :
( ( leq(n0,X8)
& leq(X8,pred(pv10)) )
=> ! [X9] :
( ( leq(n0,X9)
& leq(X9,n4) )
=> a_select3(q_init,X8,X9) = init ) )
& ! [X10] :
( ( leq(n0,X10)
& leq(X10,n4) )
=> a_select3(center_init,X10,n0) = init ) ) ),
introduced(definition) ).
fof(70,negated_conjecture,
~ ( epred1_0
=> a_select3(center_init,pv65,n0) = init ),
inference(apply_def,[status(esa)],[67,69,theory(equality)]) ).
fof(143,negated_conjecture,
( epred1_0
& a_select3(center_init,pv65,n0) != init ),
inference(fof_nnf,[status(thm)],[70]) ).
cnf(144,negated_conjecture,
a_select3(center_init,pv65,n0) != init,
inference(split_conjunct,[status(thm)],[143]) ).
cnf(145,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[143]) ).
fof(188,plain,
( ~ epred1_0
| ( leq(n0,pv10)
& leq(n0,pv11)
& leq(n0,pv65)
& leq(pv10,n135299)
& leq(pv11,n4)
& leq(pv65,n4)
& ! [X4,X5] :
( ~ leq(n0,X4)
| ~ leq(n0,X5)
| ~ leq(X4,n135299)
| ~ leq(X5,n4)
| X4 != pv10
| ~ gt(pv11,X5)
| a_select3(q_init,X4,X5) = init )
& ! [X6,X7] :
( ~ leq(n0,X6)
| ~ leq(n0,X7)
| ~ leq(X6,n135299)
| ~ leq(X7,n4)
| ~ gt(pv10,X6)
| a_select3(q_init,X6,X7) = init )
& ! [X8] :
( ~ leq(n0,X8)
| ~ leq(X8,pred(pv10))
| ! [X9] :
( ~ leq(n0,X9)
| ~ leq(X9,n4)
| a_select3(q_init,X8,X9) = init ) )
& ! [X10] :
( ~ leq(n0,X10)
| ~ leq(X10,n4)
| a_select3(center_init,X10,n0) = init ) ) ),
inference(fof_nnf,[status(thm)],[69]) ).
fof(189,plain,
( ~ epred1_0
| ( leq(n0,pv10)
& leq(n0,pv11)
& leq(n0,pv65)
& leq(pv10,n135299)
& leq(pv11,n4)
& leq(pv65,n4)
& ! [X11,X12] :
( ~ leq(n0,X11)
| ~ leq(n0,X12)
| ~ leq(X11,n135299)
| ~ leq(X12,n4)
| X11 != pv10
| ~ gt(pv11,X12)
| a_select3(q_init,X11,X12) = init )
& ! [X13,X14] :
( ~ leq(n0,X13)
| ~ leq(n0,X14)
| ~ leq(X13,n135299)
| ~ leq(X14,n4)
| ~ gt(pv10,X13)
| a_select3(q_init,X13,X14) = init )
& ! [X15] :
( ~ leq(n0,X15)
| ~ leq(X15,pred(pv10))
| ! [X16] :
( ~ leq(n0,X16)
| ~ leq(X16,n4)
| a_select3(q_init,X15,X16) = init ) )
& ! [X17] :
( ~ leq(n0,X17)
| ~ leq(X17,n4)
| a_select3(center_init,X17,n0) = init ) ) ),
inference(variable_rename,[status(thm)],[188]) ).
fof(190,plain,
! [X11,X12,X13,X14,X15,X16,X17] :
( ( ( ~ leq(n0,X17)
| ~ leq(X17,n4)
| a_select3(center_init,X17,n0) = init )
& ( ~ leq(n0,X16)
| ~ leq(X16,n4)
| a_select3(q_init,X15,X16) = init
| ~ leq(n0,X15)
| ~ leq(X15,pred(pv10)) )
& ( ~ leq(n0,X13)
| ~ leq(n0,X14)
| ~ leq(X13,n135299)
| ~ leq(X14,n4)
| ~ gt(pv10,X13)
| a_select3(q_init,X13,X14) = init )
& ( ~ leq(n0,X11)
| ~ leq(n0,X12)
| ~ leq(X11,n135299)
| ~ leq(X12,n4)
| X11 != pv10
| ~ gt(pv11,X12)
| a_select3(q_init,X11,X12) = init )
& leq(n0,pv10)
& leq(n0,pv11)
& leq(n0,pv65)
& leq(pv10,n135299)
& leq(pv11,n4)
& leq(pv65,n4) )
| ~ epred1_0 ),
inference(shift_quantors,[status(thm)],[189]) ).
fof(191,plain,
! [X11,X12,X13,X14,X15,X16,X17] :
( ( ~ leq(n0,X17)
| ~ leq(X17,n4)
| a_select3(center_init,X17,n0) = init
| ~ epred1_0 )
& ( ~ leq(n0,X16)
| ~ leq(X16,n4)
| a_select3(q_init,X15,X16) = init
| ~ leq(n0,X15)
| ~ leq(X15,pred(pv10))
| ~ epred1_0 )
& ( ~ leq(n0,X13)
| ~ leq(n0,X14)
| ~ leq(X13,n135299)
| ~ leq(X14,n4)
| ~ gt(pv10,X13)
| a_select3(q_init,X13,X14) = init
| ~ epred1_0 )
& ( ~ leq(n0,X11)
| ~ leq(n0,X12)
| ~ leq(X11,n135299)
| ~ leq(X12,n4)
| X11 != pv10
| ~ gt(pv11,X12)
| a_select3(q_init,X11,X12) = init
| ~ epred1_0 )
& ( leq(n0,pv10)
| ~ epred1_0 )
& ( leq(n0,pv11)
| ~ epred1_0 )
& ( leq(n0,pv65)
| ~ epred1_0 )
& ( leq(pv10,n135299)
| ~ epred1_0 )
& ( leq(pv11,n4)
| ~ epred1_0 )
& ( leq(pv65,n4)
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[190]) ).
cnf(192,plain,
( leq(pv65,n4)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(195,plain,
( leq(n0,pv65)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(201,plain,
( a_select3(center_init,X1,n0) = init
| ~ epred1_0
| ~ leq(X1,n4)
| ~ leq(n0,X1) ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(226,plain,
( leq(n0,pv65)
| $false ),
inference(rw,[status(thm)],[195,145,theory(equality)]) ).
cnf(227,plain,
leq(n0,pv65),
inference(cn,[status(thm)],[226,theory(equality)]) ).
cnf(232,plain,
( leq(pv65,n4)
| $false ),
inference(rw,[status(thm)],[192,145,theory(equality)]) ).
cnf(233,plain,
leq(pv65,n4),
inference(cn,[status(thm)],[232,theory(equality)]) ).
cnf(321,plain,
( a_select3(center_init,X1,n0) = init
| $false
| ~ leq(X1,n4)
| ~ leq(n0,X1) ),
inference(rw,[status(thm)],[201,145,theory(equality)]) ).
cnf(322,plain,
( a_select3(center_init,X1,n0) = init
| ~ leq(X1,n4)
| ~ leq(n0,X1) ),
inference(cn,[status(thm)],[321,theory(equality)]) ).
cnf(323,plain,
( ~ leq(pv65,n4)
| ~ leq(n0,pv65) ),
inference(spm,[status(thm)],[144,322,theory(equality)]) ).
cnf(324,plain,
( $false
| ~ leq(n0,pv65) ),
inference(rw,[status(thm)],[323,233,theory(equality)]) ).
cnf(325,plain,
( $false
| $false ),
inference(rw,[status(thm)],[324,227,theory(equality)]) ).
cnf(326,plain,
$false,
inference(cn,[status(thm)],[325,theory(equality)]) ).
cnf(327,plain,
$false,
326,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV169+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpP5e3Gl/sel_SWV169+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV169+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV169+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV169+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
%
%------------------------------------------------------------------------------