TSTP Solution File: SWV164+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV164+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:25:23 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 23 unt; 0 def)
% Number of atoms : 99 ( 23 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 93 ( 33 ~; 21 |; 31 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 27 ( 27 usr; 16 con; 0-3 aty)
% Number of variables : 46 ( 0 sgn 30 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/tmp/tmp0AADnn/sel_SWV164+1.p_1',transitivity_leq) ).
fof(13,axiom,
succ(tptp_minus_1) = n0,
file('/tmp/tmp0AADnn/sel_SWV164+1.p_1',succ_tptp_minus_1) ).
fof(17,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/tmp/tmp0AADnn/sel_SWV164+1.p_1',succ_plus_1_r) ).
fof(18,axiom,
! [X1] : ~ gt(X1,X1),
file('/tmp/tmp0AADnn/sel_SWV164+1.p_1',irreflexivity_gt) ).
fof(23,axiom,
! [X1] : plus(n1,X1) = succ(X1),
file('/tmp/tmp0AADnn/sel_SWV164+1.p_1',succ_plus_1_l) ).
fof(24,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> gt(succ(X2),X1) ),
file('/tmp/tmp0AADnn/sel_SWV164+1.p_1',leq_succ_gt_equiv) ).
fof(44,conjecture,
( ( leq(n0,pv10)
& leq(pv10,n135299)
& ! [X5] :
( ( leq(n0,X5)
& leq(X5,pred(pv10)) )
=> sum(n0,n4,a_select3(q,X5,tptp_sum_index)) = n1 ) )
=> ! [X6] :
( ( leq(n0,X6)
& leq(X6,tptp_minus_1) )
=> a_select3(q,pv10,X6) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X6)),minus(a_select2(x,pv10),a_select2(mu,X6))),tptp_minus_2),times(a_select2(sigma,X6),a_select2(sigma,X6)))),a_select2(rho,X6)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X6))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ) ),
file('/tmp/tmp0AADnn/sel_SWV164+1.p_1',cl5_nebula_norm_0014) ).
fof(78,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(pv10,n135299)
& ! [X5] :
( ( leq(n0,X5)
& leq(X5,pred(pv10)) )
=> sum(n0,n4,a_select3(q,X5,tptp_sum_index)) = n1 ) )
=> ! [X6] :
( ( leq(n0,X6)
& leq(X6,tptp_minus_1) )
=> a_select3(q,pv10,X6) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X6)),minus(a_select2(x,pv10),a_select2(mu,X6))),tptp_minus_2),times(a_select2(sigma,X6),a_select2(sigma,X6)))),a_select2(rho,X6)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X6))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ) ),
inference(assume_negation,[status(cth)],[44]) ).
fof(79,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[18,theory(equality)]) ).
fof(88,plain,
! [X1,X2,X3] :
( ~ leq(X1,X2)
| ~ leq(X2,X3)
| leq(X1,X3) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(89,plain,
! [X4,X5,X6] :
( ~ leq(X4,X5)
| ~ leq(X5,X6)
| leq(X4,X6) ),
inference(variable_rename,[status(thm)],[88]) ).
cnf(90,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[89]) ).
cnf(111,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[13]) ).
fof(118,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[17]) ).
cnf(119,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[118]) ).
fof(120,plain,
! [X2] : ~ gt(X2,X2),
inference(variable_rename,[status(thm)],[79]) ).
cnf(121,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[120]) ).
fof(130,plain,
! [X2] : plus(n1,X2) = succ(X2),
inference(variable_rename,[status(thm)],[23]) ).
cnf(131,plain,
plus(n1,X1) = succ(X1),
inference(split_conjunct,[status(thm)],[130]) ).
fof(132,plain,
! [X1,X2] :
( ( ~ leq(X1,X2)
| gt(succ(X2),X1) )
& ( ~ gt(succ(X2),X1)
| leq(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(133,plain,
! [X3,X4] :
( ( ~ leq(X3,X4)
| gt(succ(X4),X3) )
& ( ~ gt(succ(X4),X3)
| leq(X3,X4) ) ),
inference(variable_rename,[status(thm)],[132]) ).
cnf(135,plain,
( gt(succ(X1),X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[133]) ).
fof(164,negated_conjecture,
( leq(n0,pv10)
& leq(pv10,n135299)
& ! [X5] :
( ~ leq(n0,X5)
| ~ leq(X5,pred(pv10))
| sum(n0,n4,a_select3(q,X5,tptp_sum_index)) = n1 )
& ? [X6] :
( leq(n0,X6)
& leq(X6,tptp_minus_1)
& a_select3(q,pv10,X6) != divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X6)),minus(a_select2(x,pv10),a_select2(mu,X6))),tptp_minus_2),times(a_select2(sigma,X6),a_select2(sigma,X6)))),a_select2(rho,X6)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X6))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ) ),
inference(fof_nnf,[status(thm)],[78]) ).
fof(165,negated_conjecture,
( leq(n0,pv10)
& leq(pv10,n135299)
& ! [X7] :
( ~ leq(n0,X7)
| ~ leq(X7,pred(pv10))
| sum(n0,n4,a_select3(q,X7,tptp_sum_index)) = n1 )
& ? [X8] :
( leq(n0,X8)
& leq(X8,tptp_minus_1)
& a_select3(q,pv10,X8) != divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X8)),minus(a_select2(x,pv10),a_select2(mu,X8))),tptp_minus_2),times(a_select2(sigma,X8),a_select2(sigma,X8)))),a_select2(rho,X8)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X8))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ) ),
inference(variable_rename,[status(thm)],[164]) ).
fof(166,negated_conjecture,
( leq(n0,pv10)
& leq(pv10,n135299)
& ! [X7] :
( ~ leq(n0,X7)
| ~ leq(X7,pred(pv10))
| sum(n0,n4,a_select3(q,X7,tptp_sum_index)) = n1 )
& leq(n0,esk1_0)
& leq(esk1_0,tptp_minus_1)
& a_select3(q,pv10,esk1_0) != divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,esk1_0)),minus(a_select2(x,pv10),a_select2(mu,esk1_0))),tptp_minus_2),times(a_select2(sigma,esk1_0),a_select2(sigma,esk1_0)))),a_select2(rho,esk1_0)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,esk1_0))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ),
inference(skolemize,[status(esa)],[165]) ).
fof(167,negated_conjecture,
! [X7] :
( ( ~ leq(n0,X7)
| ~ leq(X7,pred(pv10))
| sum(n0,n4,a_select3(q,X7,tptp_sum_index)) = n1 )
& leq(n0,pv10)
& leq(pv10,n135299)
& leq(n0,esk1_0)
& leq(esk1_0,tptp_minus_1)
& a_select3(q,pv10,esk1_0) != divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,esk1_0)),minus(a_select2(x,pv10),a_select2(mu,esk1_0))),tptp_minus_2),times(a_select2(sigma,esk1_0),a_select2(sigma,esk1_0)))),a_select2(rho,esk1_0)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,esk1_0))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ),
inference(shift_quantors,[status(thm)],[166]) ).
cnf(169,negated_conjecture,
leq(esk1_0,tptp_minus_1),
inference(split_conjunct,[status(thm)],[167]) ).
cnf(170,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[167]) ).
cnf(220,plain,
plus(tptp_minus_1,n1) = n0,
inference(rw,[status(thm)],[111,119,theory(equality)]),
[unfolding] ).
cnf(223,plain,
plus(n1,X1) = plus(X1,n1),
inference(rw,[status(thm)],[131,119,theory(equality)]),
[unfolding] ).
cnf(240,plain,
( gt(plus(X1,n1),X2)
| ~ leq(X2,X1) ),
inference(rw,[status(thm)],[135,119,theory(equality)]),
[unfolding] ).
cnf(270,plain,
plus(n1,tptp_minus_1) = n0,
inference(rw,[status(thm)],[220,223,theory(equality)]) ).
cnf(277,negated_conjecture,
( leq(X1,tptp_minus_1)
| ~ leq(X1,esk1_0) ),
inference(spm,[status(thm)],[90,169,theory(equality)]) ).
cnf(303,plain,
~ leq(plus(X1,n1),X1),
inference(spm,[status(thm)],[121,240,theory(equality)]) ).
cnf(489,plain,
~ leq(plus(n1,X1),X1),
inference(spm,[status(thm)],[303,223,theory(equality)]) ).
cnf(545,plain,
~ leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[489,270,theory(equality)]) ).
cnf(594,negated_conjecture,
leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[277,170,theory(equality)]) ).
cnf(598,negated_conjecture,
$false,
inference(sr,[status(thm)],[594,545,theory(equality)]) ).
cnf(599,negated_conjecture,
$false,
598,
[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/SWV164+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmp0AADnn/sel_SWV164+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV164+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV164+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV164+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
%
%------------------------------------------------------------------------------