TSTP Solution File: SWV186+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV186+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:26:57 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 23 ( 6 unt; 0 def)
% Number of atoms : 247 ( 66 equ)
% Maximal formula atoms : 36 ( 10 avg)
% Number of connectives : 324 ( 100 ~; 95 |; 95 &)
% ( 0 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 15 con; 0-3 aty)
% Number of variables : 71 ( 0 sgn 66 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(61,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 )
& ! [X7] :
( ( leq(n0,X7)
& leq(X7,n4) )
=> a_select2(muold_init,X7) = init )
& ! [X8] :
( ( leq(n0,X8)
& leq(X8,n4) )
=> a_select2(rhoold_init,X8) = init )
& ! [X9] :
( ( leq(n0,X9)
& leq(X9,n4) )
=> a_select2(sigmaold_init,X9) = init )
& ! [X10] :
( ( leq(n0,X10)
& leq(X10,n4) )
=> a_select2(mu_init,X10) = init )
& ! [X11] :
( ( leq(n0,X11)
& leq(X11,n4) )
=> a_select2(rho_init,X11) = init )
& ! [X12] :
( ( leq(n0,X12)
& leq(X12,n4) )
=> a_select2(sigma_init,X12) = init ) )
=> ! [X13] :
( ( leq(n0,X13)
& leq(X13,n4) )
=> a_select2(muold_init,X13) = init ) ),
file('/tmp/tmpu81uUN/sel_SWV186+1.p_1',cl5_nebula_init_0106) ).
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 )
& ! [X7] :
( ( leq(n0,X7)
& leq(X7,n4) )
=> a_select2(muold_init,X7) = init )
& ! [X8] :
( ( leq(n0,X8)
& leq(X8,n4) )
=> a_select2(rhoold_init,X8) = init )
& ! [X9] :
( ( leq(n0,X9)
& leq(X9,n4) )
=> a_select2(sigmaold_init,X9) = init )
& ! [X10] :
( ( leq(n0,X10)
& leq(X10,n4) )
=> a_select2(mu_init,X10) = init )
& ! [X11] :
( ( leq(n0,X11)
& leq(X11,n4) )
=> a_select2(rho_init,X11) = init )
& ! [X12] :
( ( leq(n0,X12)
& leq(X12,n4) )
=> a_select2(sigma_init,X12) = init ) )
=> ! [X13] :
( ( leq(n0,X13)
& leq(X13,n4) )
=> a_select2(muold_init,X13) = init ) ),
inference(assume_negation,[status(cth)],[61]) ).
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 )
& ! [X7] :
( ( leq(n0,X7)
& leq(X7,n4) )
=> a_select2(muold_init,X7) = init )
& ! [X8] :
( ( leq(n0,X8)
& leq(X8,n4) )
=> a_select2(rhoold_init,X8) = init )
& ! [X9] :
( ( leq(n0,X9)
& leq(X9,n4) )
=> a_select2(sigmaold_init,X9) = init )
& ! [X10] :
( ( leq(n0,X10)
& leq(X10,n4) )
=> a_select2(mu_init,X10) = init )
& ! [X11] :
( ( leq(n0,X11)
& leq(X11,n4) )
=> a_select2(rho_init,X11) = init )
& ! [X12] :
( ( leq(n0,X12)
& leq(X12,n4) )
=> a_select2(sigma_init,X12) = init ) ) ),
introduced(definition) ).
fof(67,negated_conjecture,
~ ( epred1_0
=> ! [X13] :
( ( leq(n0,X13)
& leq(X13,n4) )
=> a_select2(muold_init,X13) = init ) ),
inference(apply_def,[status(esa)],[64,66,theory(equality)]) ).
fof(172,negated_conjecture,
( epred1_0
& ? [X13] :
( leq(n0,X13)
& leq(X13,n4)
& a_select2(muold_init,X13) != init ) ),
inference(fof_nnf,[status(thm)],[67]) ).
fof(173,negated_conjecture,
( epred1_0
& ? [X14] :
( leq(n0,X14)
& leq(X14,n4)
& a_select2(muold_init,X14) != init ) ),
inference(variable_rename,[status(thm)],[172]) ).
fof(174,negated_conjecture,
( epred1_0
& leq(n0,esk1_0)
& leq(esk1_0,n4)
& a_select2(muold_init,esk1_0) != init ),
inference(skolemize,[status(esa)],[173]) ).
cnf(175,negated_conjecture,
a_select2(muold_init,esk1_0) != init,
inference(split_conjunct,[status(thm)],[174]) ).
cnf(176,negated_conjecture,
leq(esk1_0,n4),
inference(split_conjunct,[status(thm)],[174]) ).
cnf(177,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[174]) ).
cnf(178,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[174]) ).
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 )
& ! [X7] :
( ~ leq(n0,X7)
| ~ leq(X7,n4)
| a_select2(muold_init,X7) = init )
& ! [X8] :
( ~ leq(n0,X8)
| ~ leq(X8,n4)
| a_select2(rhoold_init,X8) = init )
& ! [X9] :
( ~ leq(n0,X9)
| ~ leq(X9,n4)
| a_select2(sigmaold_init,X9) = init )
& ! [X10] :
( ~ leq(n0,X10)
| ~ leq(X10,n4)
| a_select2(mu_init,X10) = init )
& ! [X11] :
( ~ leq(n0,X11)
| ~ leq(X11,n4)
| a_select2(rho_init,X11) = init )
& ! [X12] :
( ~ leq(n0,X12)
| ~ leq(X12,n4)
| a_select2(sigma_init,X12) = init ) ) ),
inference(fof_nnf,[status(thm)],[66]) ).
fof(182,plain,
( ~ epred1_0
| ( gt(loopcounter,n1)
& ! [X13] :
( ~ leq(n0,X13)
| ~ leq(X13,n135299)
| ! [X14] :
( ~ leq(n0,X14)
| ~ leq(X14,n4)
| a_select3(q_init,X13,X14) = init ) )
& ! [X15] :
( ~ leq(n0,X15)
| ~ leq(X15,n4)
| a_select3(center_init,X15,n0) = init )
& ! [X16] :
( ~ leq(n0,X16)
| ~ leq(X16,n4)
| a_select2(muold_init,X16) = init )
& ! [X17] :
( ~ leq(n0,X17)
| ~ leq(X17,n4)
| a_select2(rhoold_init,X17) = init )
& ! [X18] :
( ~ leq(n0,X18)
| ~ leq(X18,n4)
| a_select2(sigmaold_init,X18) = init )
& ! [X19] :
( ~ leq(n0,X19)
| ~ leq(X19,n4)
| a_select2(mu_init,X19) = init )
& ! [X20] :
( ~ leq(n0,X20)
| ~ leq(X20,n4)
| a_select2(rho_init,X20) = init )
& ! [X21] :
( ~ leq(n0,X21)
| ~ leq(X21,n4)
| a_select2(sigma_init,X21) = init ) ) ),
inference(variable_rename,[status(thm)],[181]) ).
fof(183,plain,
! [X13,X14,X15,X16,X17,X18,X19,X20,X21] :
( ( ( ~ leq(n0,X21)
| ~ leq(X21,n4)
| a_select2(sigma_init,X21) = init )
& ( ~ leq(n0,X20)
| ~ leq(X20,n4)
| a_select2(rho_init,X20) = init )
& ( ~ leq(n0,X19)
| ~ leq(X19,n4)
| a_select2(mu_init,X19) = init )
& ( ~ leq(n0,X18)
| ~ leq(X18,n4)
| a_select2(sigmaold_init,X18) = init )
& ( ~ leq(n0,X17)
| ~ leq(X17,n4)
| a_select2(rhoold_init,X17) = init )
& ( ~ leq(n0,X16)
| ~ leq(X16,n4)
| a_select2(muold_init,X16) = init )
& ( ~ leq(n0,X15)
| ~ leq(X15,n4)
| a_select3(center_init,X15,n0) = init )
& ( ~ leq(n0,X14)
| ~ leq(X14,n4)
| a_select3(q_init,X13,X14) = init
| ~ leq(n0,X13)
| ~ leq(X13,n135299) )
& gt(loopcounter,n1) )
| ~ epred1_0 ),
inference(shift_quantors,[status(thm)],[182]) ).
fof(184,plain,
! [X13,X14,X15,X16,X17,X18,X19,X20,X21] :
( ( ~ leq(n0,X21)
| ~ leq(X21,n4)
| a_select2(sigma_init,X21) = init
| ~ epred1_0 )
& ( ~ leq(n0,X20)
| ~ leq(X20,n4)
| a_select2(rho_init,X20) = init
| ~ epred1_0 )
& ( ~ leq(n0,X19)
| ~ leq(X19,n4)
| a_select2(mu_init,X19) = init
| ~ epred1_0 )
& ( ~ leq(n0,X18)
| ~ leq(X18,n4)
| a_select2(sigmaold_init,X18) = init
| ~ epred1_0 )
& ( ~ leq(n0,X17)
| ~ leq(X17,n4)
| a_select2(rhoold_init,X17) = init
| ~ epred1_0 )
& ( ~ leq(n0,X16)
| ~ leq(X16,n4)
| a_select2(muold_init,X16) = init
| ~ epred1_0 )
& ( ~ leq(n0,X15)
| ~ leq(X15,n4)
| a_select3(center_init,X15,n0) = init
| ~ epred1_0 )
& ( ~ leq(n0,X14)
| ~ leq(X14,n4)
| a_select3(q_init,X13,X14) = init
| ~ leq(n0,X13)
| ~ leq(X13,n135299)
| ~ epred1_0 )
& ( gt(loopcounter,n1)
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[183]) ).
cnf(188,plain,
( a_select2(muold_init,X1) = init
| ~ epred1_0
| ~ leq(X1,n4)
| ~ leq(n0,X1) ),
inference(split_conjunct,[status(thm)],[184]) ).
cnf(250,plain,
( a_select2(muold_init,X1) = init
| $false
| ~ leq(X1,n4)
| ~ leq(n0,X1) ),
inference(rw,[status(thm)],[188,178,theory(equality)]) ).
cnf(251,plain,
( a_select2(muold_init,X1) = init
| ~ leq(X1,n4)
| ~ leq(n0,X1) ),
inference(cn,[status(thm)],[250,theory(equality)]) ).
cnf(252,plain,
( ~ leq(esk1_0,n4)
| ~ leq(n0,esk1_0) ),
inference(spm,[status(thm)],[175,251,theory(equality)]) ).
cnf(253,plain,
( $false
| ~ leq(n0,esk1_0) ),
inference(rw,[status(thm)],[252,176,theory(equality)]) ).
cnf(254,plain,
( $false
| $false ),
inference(rw,[status(thm)],[253,177,theory(equality)]) ).
cnf(255,plain,
$false,
inference(cn,[status(thm)],[254,theory(equality)]) ).
cnf(256,plain,
$false,
255,
[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/SWV186+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpu81uUN/sel_SWV186+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV186+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV186+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV186+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
%
%------------------------------------------------------------------------------