TSTP Solution File: SWV187+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV187+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 12:27:01 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 17 unt; 0 def)
% Number of atoms : 250 ( 48 equ)
% Maximal formula atoms : 27 ( 5 avg)
% Number of connectives : 311 ( 107 ~; 100 |; 68 &)
% ( 1 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 12 con; 0-3 aty)
% Number of variables : 81 ( 0 sgn 64 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/tmp/tmpUPRSd_/sel_SWV187+1.p_1',transitivity_leq) ).
fof(14,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/tmp/tmpUPRSd_/sel_SWV187+1.p_1',succ_plus_1_r) ).
fof(16,axiom,
! [X1] : gt(succ(X1),X1),
file('/tmp/tmpUPRSd_/sel_SWV187+1.p_1',gt_succ) ).
fof(21,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> gt(succ(X2),X1) ),
file('/tmp/tmpUPRSd_/sel_SWV187+1.p_1',leq_succ_gt_equiv) ).
fof(50,conjecture,
( ( gt(loopcounter,n1)
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,n135299) )
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select3(q_init,X4,X5) = init ) )
& ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select3(center_init,X6,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X7] :
( ( leq(n0,X7)
& leq(X7,n4) )
=> a_select2(muold_init,X7) = init ) )
& ( gt(loopcounter,n1)
=> ! [X8] :
( ( leq(n0,X8)
& leq(X8,n4) )
=> a_select2(rhoold_init,X8) = init ) )
& ( gt(loopcounter,n1)
=> ! [X9] :
( ( leq(n0,X9)
& leq(X9,n4) )
=> a_select2(sigmaold_init,X9) = init ) ) )
=> ! [X10] :
( ( leq(n0,X10)
& leq(X10,n4) )
=> a_select2(sigmaold_init,X10) = init ) ),
file('/tmp/tmpUPRSd_/sel_SWV187+1.p_1',cl5_nebula_init_0111) ).
fof(64,negated_conjecture,
~ ( ( gt(loopcounter,n1)
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,n135299) )
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select3(q_init,X4,X5) = init ) )
& ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select3(center_init,X6,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X7] :
( ( leq(n0,X7)
& leq(X7,n4) )
=> a_select2(muold_init,X7) = init ) )
& ( gt(loopcounter,n1)
=> ! [X8] :
( ( leq(n0,X8)
& leq(X8,n4) )
=> a_select2(rhoold_init,X8) = init ) )
& ( gt(loopcounter,n1)
=> ! [X9] :
( ( leq(n0,X9)
& leq(X9,n4) )
=> a_select2(sigmaold_init,X9) = init ) ) )
=> ! [X10] :
( ( leq(n0,X10)
& leq(X10,n4) )
=> a_select2(sigmaold_init,X10) = init ) ),
inference(assume_negation,[status(cth)],[50]) ).
fof(66,plain,
( epred1_0
=> ( gt(loopcounter,n1)
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,n135299) )
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select3(q_init,X4,X5) = init ) )
& ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select3(center_init,X6,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X7] :
( ( leq(n0,X7)
& leq(X7,n4) )
=> a_select2(muold_init,X7) = init ) )
& ( gt(loopcounter,n1)
=> ! [X8] :
( ( leq(n0,X8)
& leq(X8,n4) )
=> a_select2(rhoold_init,X8) = init ) )
& ( gt(loopcounter,n1)
=> ! [X9] :
( ( leq(n0,X9)
& leq(X9,n4) )
=> a_select2(sigmaold_init,X9) = init ) ) ) ),
introduced(definition) ).
fof(67,negated_conjecture,
~ ( epred1_0
=> ! [X10] :
( ( leq(n0,X10)
& leq(X10,n4) )
=> a_select2(sigmaold_init,X10) = init ) ),
inference(apply_def,[status(esa)],[64,66,theory(equality)]) ).
fof(73,plain,
! [X1,X2,X3] :
( ~ leq(X1,X2)
| ~ leq(X2,X3)
| leq(X1,X3) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(74,plain,
! [X4,X5,X6] :
( ~ leq(X4,X5)
| ~ leq(X5,X6)
| leq(X4,X6) ),
inference(variable_rename,[status(thm)],[73]) ).
cnf(75,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[74]) ).
fof(99,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[14]) ).
cnf(100,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[99]) ).
fof(103,plain,
! [X2] : gt(succ(X2),X2),
inference(variable_rename,[status(thm)],[16]) ).
cnf(104,plain,
gt(succ(X1),X1),
inference(split_conjunct,[status(thm)],[103]) ).
fof(113,plain,
! [X1,X2] :
( ( ~ leq(X1,X2)
| gt(succ(X2),X1) )
& ( ~ gt(succ(X2),X1)
| leq(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(114,plain,
! [X3,X4] :
( ( ~ leq(X3,X4)
| gt(succ(X4),X3) )
& ( ~ gt(succ(X4),X3)
| leq(X3,X4) ) ),
inference(variable_rename,[status(thm)],[113]) ).
cnf(115,plain,
( leq(X1,X2)
| ~ gt(succ(X2),X1) ),
inference(split_conjunct,[status(thm)],[114]) ).
fof(153,negated_conjecture,
( epred1_0
& ? [X10] :
( leq(n0,X10)
& leq(X10,n4)
& a_select2(sigmaold_init,X10) != init ) ),
inference(fof_nnf,[status(thm)],[67]) ).
fof(154,negated_conjecture,
( epred1_0
& ? [X11] :
( leq(n0,X11)
& leq(X11,n4)
& a_select2(sigmaold_init,X11) != init ) ),
inference(variable_rename,[status(thm)],[153]) ).
fof(155,negated_conjecture,
( epred1_0
& leq(n0,esk1_0)
& leq(esk1_0,n4)
& a_select2(sigmaold_init,esk1_0) != init ),
inference(skolemize,[status(esa)],[154]) ).
cnf(156,negated_conjecture,
a_select2(sigmaold_init,esk1_0) != init,
inference(split_conjunct,[status(thm)],[155]) ).
cnf(157,negated_conjecture,
leq(esk1_0,n4),
inference(split_conjunct,[status(thm)],[155]) ).
cnf(158,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[155]) ).
cnf(159,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[155]) ).
fof(181,plain,
( ~ epred1_0
| ( gt(loopcounter,n1)
& ! [X4] :
( ~ leq(n0,X4)
| ~ leq(X4,n135299)
| ! [X5] :
( ~ leq(n0,X5)
| ~ leq(X5,n4)
| a_select3(q_init,X4,X5) = init ) )
& ! [X6] :
( ~ leq(n0,X6)
| ~ leq(X6,n4)
| a_select3(center_init,X6,n0) = init )
& ( ~ gt(loopcounter,n1)
| ! [X7] :
( ~ leq(n0,X7)
| ~ leq(X7,n4)
| a_select2(muold_init,X7) = init ) )
& ( ~ gt(loopcounter,n1)
| ! [X8] :
( ~ leq(n0,X8)
| ~ leq(X8,n4)
| a_select2(rhoold_init,X8) = init ) )
& ( ~ gt(loopcounter,n1)
| ! [X9] :
( ~ leq(n0,X9)
| ~ leq(X9,n4)
| a_select2(sigmaold_init,X9) = init ) ) ) ),
inference(fof_nnf,[status(thm)],[66]) ).
fof(182,plain,
( ~ epred1_0
| ( gt(loopcounter,n1)
& ! [X10] :
( ~ leq(n0,X10)
| ~ leq(X10,n135299)
| ! [X11] :
( ~ leq(n0,X11)
| ~ leq(X11,n4)
| a_select3(q_init,X10,X11) = init ) )
& ! [X12] :
( ~ leq(n0,X12)
| ~ leq(X12,n4)
| a_select3(center_init,X12,n0) = init )
& ( ~ gt(loopcounter,n1)
| ! [X13] :
( ~ leq(n0,X13)
| ~ leq(X13,n4)
| a_select2(muold_init,X13) = init ) )
& ( ~ gt(loopcounter,n1)
| ! [X14] :
( ~ leq(n0,X14)
| ~ leq(X14,n4)
| a_select2(rhoold_init,X14) = init ) )
& ( ~ gt(loopcounter,n1)
| ! [X15] :
( ~ leq(n0,X15)
| ~ leq(X15,n4)
| a_select2(sigmaold_init,X15) = init ) ) ) ),
inference(variable_rename,[status(thm)],[181]) ).
fof(183,plain,
! [X10,X11,X12,X13,X14,X15] :
( ( ( ~ leq(n0,X15)
| ~ leq(X15,n4)
| a_select2(sigmaold_init,X15) = init
| ~ gt(loopcounter,n1) )
& ( ~ leq(n0,X14)
| ~ leq(X14,n4)
| a_select2(rhoold_init,X14) = init
| ~ gt(loopcounter,n1) )
& ( ~ leq(n0,X13)
| ~ leq(X13,n4)
| a_select2(muold_init,X13) = init
| ~ gt(loopcounter,n1) )
& ( ~ leq(n0,X12)
| ~ leq(X12,n4)
| a_select3(center_init,X12,n0) = init )
& ( ~ leq(n0,X11)
| ~ leq(X11,n4)
| a_select3(q_init,X10,X11) = init
| ~ leq(n0,X10)
| ~ leq(X10,n135299) )
& gt(loopcounter,n1) )
| ~ epred1_0 ),
inference(shift_quantors,[status(thm)],[182]) ).
fof(184,plain,
! [X10,X11,X12,X13,X14,X15] :
( ( ~ leq(n0,X15)
| ~ leq(X15,n4)
| a_select2(sigmaold_init,X15) = init
| ~ gt(loopcounter,n1)
| ~ epred1_0 )
& ( ~ leq(n0,X14)
| ~ leq(X14,n4)
| a_select2(rhoold_init,X14) = init
| ~ gt(loopcounter,n1)
| ~ epred1_0 )
& ( ~ leq(n0,X13)
| ~ leq(X13,n4)
| a_select2(muold_init,X13) = init
| ~ gt(loopcounter,n1)
| ~ epred1_0 )
& ( ~ leq(n0,X12)
| ~ leq(X12,n4)
| a_select3(center_init,X12,n0) = init
| ~ epred1_0 )
& ( ~ leq(n0,X11)
| ~ leq(X11,n4)
| a_select3(q_init,X10,X11) = init
| ~ leq(n0,X10)
| ~ leq(X10,n135299)
| ~ epred1_0 )
& ( gt(loopcounter,n1)
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[183]) ).
cnf(185,plain,
( gt(loopcounter,n1)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[184]) ).
cnf(190,plain,
( a_select2(sigmaold_init,X1) = init
| ~ epred1_0
| ~ gt(loopcounter,n1)
| ~ leq(X1,n4)
| ~ leq(n0,X1) ),
inference(split_conjunct,[status(thm)],[184]) ).
cnf(195,plain,
gt(plus(X1,n1),X1),
inference(rw,[status(thm)],[104,100,theory(equality)]),
[unfolding] ).
cnf(207,plain,
( leq(X1,X2)
| ~ gt(plus(X2,n1),X1) ),
inference(rw,[status(thm)],[115,100,theory(equality)]),
[unfolding] ).
cnf(213,plain,
( gt(loopcounter,n1)
| $false ),
inference(rw,[status(thm)],[185,159,theory(equality)]) ).
cnf(214,plain,
gt(loopcounter,n1),
inference(cn,[status(thm)],[213,theory(equality)]) ).
cnf(217,negated_conjecture,
( leq(X1,n4)
| ~ leq(X1,esk1_0) ),
inference(spm,[status(thm)],[75,157,theory(equality)]) ).
cnf(243,plain,
leq(X1,X1),
inference(spm,[status(thm)],[207,195,theory(equality)]) ).
cnf(322,plain,
( a_select2(sigmaold_init,X1) = init
| $false
| ~ leq(X1,n4)
| ~ leq(n0,X1)
| ~ gt(loopcounter,n1) ),
inference(rw,[status(thm)],[190,159,theory(equality)]) ).
cnf(323,plain,
( a_select2(sigmaold_init,X1) = init
| ~ leq(X1,n4)
| ~ leq(n0,X1)
| ~ gt(loopcounter,n1) ),
inference(cn,[status(thm)],[322,theory(equality)]) ).
cnf(421,negated_conjecture,
leq(esk1_0,n4),
inference(spm,[status(thm)],[217,243,theory(equality)]) ).
cnf(751,plain,
( ~ gt(loopcounter,n1)
| ~ leq(esk1_0,n4)
| ~ leq(n0,esk1_0) ),
inference(spm,[status(thm)],[156,323,theory(equality)]) ).
cnf(752,plain,
( ~ gt(loopcounter,n1)
| $false
| ~ leq(n0,esk1_0) ),
inference(rw,[status(thm)],[751,421,theory(equality)]) ).
cnf(753,plain,
( ~ gt(loopcounter,n1)
| ~ leq(n0,esk1_0) ),
inference(cn,[status(thm)],[752,theory(equality)]) ).
cnf(788,negated_conjecture,
~ gt(loopcounter,n1),
inference(spm,[status(thm)],[753,158,theory(equality)]) ).
cnf(795,plain,
$false,
inference(sr,[status(thm)],[214,788,theory(equality)]) ).
cnf(796,plain,
$false,
795,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV187+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpUPRSd_/sel_SWV187+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV187+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV187+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV187+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
%
%------------------------------------------------------------------------------