TSTP Solution File: SWV163+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV163+1 : TPTP v5.0.0. Bugfixed 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:20:53 EST 2010
% Result : Theorem 0.26s
% Output : CNFRefutation 0.26s
% 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 : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 11 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/tmpDzvKnl/sel_SWV163+1.p_1',transitivity_leq) ).
fof(13,axiom,
succ(tptp_minus_1) = n0,
file('/tmp/tmpDzvKnl/sel_SWV163+1.p_1',succ_tptp_minus_1) ).
fof(17,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/tmp/tmpDzvKnl/sel_SWV163+1.p_1',succ_plus_1_r) ).
fof(18,axiom,
! [X1] : ~ gt(X1,X1),
file('/tmp/tmpDzvKnl/sel_SWV163+1.p_1',irreflexivity_gt) ).
fof(23,axiom,
! [X1] : plus(n1,X1) = succ(X1),
file('/tmp/tmpDzvKnl/sel_SWV163+1.p_1',succ_plus_1_l) ).
fof(24,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> gt(succ(X2),X1) ),
file('/tmp/tmpDzvKnl/sel_SWV163+1.p_1',leq_succ_gt_equiv) ).
fof(40,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(sqrt(times(minus(a_select3(center,X6,n0),a_select2(x,pv10)),minus(a_select3(center,X6,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) ),
file('/tmp/tmpDzvKnl/sel_SWV163+1.p_1',cl5_nebula_norm_0013) ).
fof(70,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(sqrt(times(minus(a_select3(center,X6,n0),a_select2(x,pv10)),minus(a_select3(center,X6,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) ),
inference(assume_negation,[status(cth)],[40]) ).
fof(71,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[18,theory(equality)]) ).
fof(80,plain,
! [X1,X2,X3] :
( ~ leq(X1,X2)
| ~ leq(X2,X3)
| leq(X1,X3) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(81,plain,
! [X4,X5,X6] :
( ~ leq(X4,X5)
| ~ leq(X5,X6)
| leq(X4,X6) ),
inference(variable_rename,[status(thm)],[80]) ).
cnf(82,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[81]) ).
cnf(103,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[13]) ).
fof(110,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[17]) ).
cnf(111,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[110]) ).
fof(112,plain,
! [X2] : ~ gt(X2,X2),
inference(variable_rename,[status(thm)],[71]) ).
cnf(113,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[112]) ).
fof(122,plain,
! [X2] : plus(n1,X2) = succ(X2),
inference(variable_rename,[status(thm)],[23]) ).
cnf(123,plain,
plus(n1,X1) = succ(X1),
inference(split_conjunct,[status(thm)],[122]) ).
fof(124,plain,
! [X1,X2] :
( ( ~ leq(X1,X2)
| gt(succ(X2),X1) )
& ( ~ gt(succ(X2),X1)
| leq(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(125,plain,
! [X3,X4] :
( ( ~ leq(X3,X4)
| gt(succ(X4),X3) )
& ( ~ gt(succ(X4),X3)
| leq(X3,X4) ) ),
inference(variable_rename,[status(thm)],[124]) ).
cnf(127,plain,
( gt(succ(X1),X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[125]) ).
fof(152,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(sqrt(times(minus(a_select3(center,X6,n0),a_select2(x,pv10)),minus(a_select3(center,X6,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) ),
inference(fof_nnf,[status(thm)],[70]) ).
fof(153,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(sqrt(times(minus(a_select3(center,X8,n0),a_select2(x,pv10)),minus(a_select3(center,X8,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) ),
inference(variable_rename,[status(thm)],[152]) ).
fof(154,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(sqrt(times(minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ),
inference(skolemize,[status(esa)],[153]) ).
fof(155,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(sqrt(times(minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ),
inference(shift_quantors,[status(thm)],[154]) ).
cnf(157,negated_conjecture,
leq(esk1_0,tptp_minus_1),
inference(split_conjunct,[status(thm)],[155]) ).
cnf(158,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[155]) ).
cnf(204,plain,
plus(tptp_minus_1,n1) = n0,
inference(rw,[status(thm)],[103,111,theory(equality)]),
[unfolding] ).
cnf(207,plain,
plus(n1,X1) = plus(X1,n1),
inference(rw,[status(thm)],[123,111,theory(equality)]),
[unfolding] ).
cnf(224,plain,
( gt(plus(X1,n1),X2)
| ~ leq(X2,X1) ),
inference(rw,[status(thm)],[127,111,theory(equality)]),
[unfolding] ).
cnf(248,plain,
plus(n1,tptp_minus_1) = n0,
inference(rw,[status(thm)],[204,207,theory(equality)]) ).
cnf(253,negated_conjecture,
( leq(X1,tptp_minus_1)
| ~ leq(X1,esk1_0) ),
inference(spm,[status(thm)],[82,157,theory(equality)]) ).
cnf(277,plain,
~ leq(plus(X1,n1),X1),
inference(spm,[status(thm)],[113,224,theory(equality)]) ).
cnf(457,plain,
~ leq(plus(n1,X1),X1),
inference(spm,[status(thm)],[277,207,theory(equality)]) ).
cnf(568,plain,
~ leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[457,248,theory(equality)]) ).
cnf(585,negated_conjecture,
leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[253,158,theory(equality)]) ).
cnf(589,negated_conjecture,
$false,
inference(sr,[status(thm)],[585,568,theory(equality)]) ).
cnf(590,negated_conjecture,
$false,
589,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV163+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpDzvKnl/sel_SWV163+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV163+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV163+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV163+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
%
%------------------------------------------------------------------------------