%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV161+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:45 EST 2010
% Result : Theorem 0.31s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 9 unt; 0 def)
% Number of atoms : 96 ( 27 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 99 ( 30 ~; 24 |; 37 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 27 ( 0 sgn 20 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1,X2] :
( ( leq(X1,X2)
& X1 != X2 )
=> gt(X2,X1) ),
file('/tmp/tmpCL3QWr/sel_SWV161+1.p_1',leq_gt2) ).
fof(23,axiom,
! [X1,X2] :
( leq(X1,pred(X2))
<=> gt(X2,X1) ),
file('/tmp/tmpCL3QWr/sel_SWV161+1.p_1',leq_gt_pred) ).
fof(38,conjecture,
( ( sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1
& 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,pv10) )
=> sum(n0,n4,a_select3(q,X6,tptp_sum_index)) = n1 ) ),
file('/tmp/tmpCL3QWr/sel_SWV161+1.p_1',cl5_nebula_norm_0011) ).
fof(68,negated_conjecture,
~ ( ( sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1
& 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,pv10) )
=> sum(n0,n4,a_select3(q,X6,tptp_sum_index)) = n1 ) ),
inference(assume_negation,[status(cth)],[38]) ).
fof(78,plain,
! [X1,X2] :
( ~ leq(X1,X2)
| X1 = X2
| gt(X2,X1) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(79,plain,
! [X3,X4] :
( ~ leq(X3,X4)
| X3 = X4
| gt(X4,X3) ),
inference(variable_rename,[status(thm)],[78]) ).
cnf(80,plain,
( gt(X1,X2)
| X2 = X1
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[79]) ).
fof(121,plain,
! [X1,X2] :
( ( ~ leq(X1,pred(X2))
| gt(X2,X1) )
& ( ~ gt(X2,X1)
| leq(X1,pred(X2)) ) ),
inference(fof_nnf,[status(thm)],[23]) ).
fof(122,plain,
! [X3,X4] :
( ( ~ leq(X3,pred(X4))
| gt(X4,X3) )
& ( ~ gt(X4,X3)
| leq(X3,pred(X4)) ) ),
inference(variable_rename,[status(thm)],[121]) ).
cnf(123,plain,
( leq(X1,pred(X2))
| ~ gt(X2,X1) ),
inference(split_conjunct,[status(thm)],[122]) ).
fof(145,negated_conjecture,
( sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1
& 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,pv10)
& sum(n0,n4,a_select3(q,X6,tptp_sum_index)) != n1 ) ),
inference(fof_nnf,[status(thm)],[68]) ).
fof(146,negated_conjecture,
( sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1
& 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,pv10)
& sum(n0,n4,a_select3(q,X8,tptp_sum_index)) != n1 ) ),
inference(variable_rename,[status(thm)],[145]) ).
fof(147,negated_conjecture,
( sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1
& 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,pv10)
& sum(n0,n4,a_select3(q,esk1_0,tptp_sum_index)) != n1 ),
inference(skolemize,[status(esa)],[146]) ).
fof(148,negated_conjecture,
! [X7] :
( ( ~ leq(n0,X7)
| ~ leq(X7,pred(pv10))
| sum(n0,n4,a_select3(q,X7,tptp_sum_index)) = n1 )
& sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1
& leq(n0,pv10)
& leq(pv10,n135299)
& leq(n0,esk1_0)
& leq(esk1_0,pv10)
& sum(n0,n4,a_select3(q,esk1_0,tptp_sum_index)) != n1 ),
inference(shift_quantors,[status(thm)],[147]) ).
cnf(149,negated_conjecture,
sum(n0,n4,a_select3(q,esk1_0,tptp_sum_index)) != n1,
inference(split_conjunct,[status(thm)],[148]) ).
cnf(150,negated_conjecture,
leq(esk1_0,pv10),
inference(split_conjunct,[status(thm)],[148]) ).
cnf(151,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[148]) ).
cnf(154,negated_conjecture,
sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1,
inference(split_conjunct,[status(thm)],[148]) ).
cnf(155,negated_conjecture,
( sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1
| ~ leq(X1,pred(pv10))
| ~ leq(n0,X1) ),
inference(split_conjunct,[status(thm)],[148]) ).
cnf(256,negated_conjecture,
( pv10 = esk1_0
| gt(pv10,esk1_0) ),
inference(spm,[status(thm)],[80,150,theory(equality)]) ).
cnf(265,negated_conjecture,
( ~ leq(esk1_0,pred(pv10))
| ~ leq(n0,esk1_0) ),
inference(spm,[status(thm)],[149,155,theory(equality)]) ).
cnf(461,negated_conjecture,
( ~ leq(n0,esk1_0)
| ~ gt(pv10,esk1_0) ),
inference(spm,[status(thm)],[265,123,theory(equality)]) ).
cnf(462,negated_conjecture,
~ gt(pv10,esk1_0),
inference(spm,[status(thm)],[461,151,theory(equality)]) ).
cnf(620,negated_conjecture,
esk1_0 = pv10,
inference(sr,[status(thm)],[256,462,theory(equality)]) ).
cnf(627,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[149,620,theory(equality)]),154,theory(equality)]) ).
cnf(628,negated_conjecture,
$false,
inference(cn,[status(thm)],[627,theory(equality)]) ).
cnf(629,negated_conjecture,
$false,
628,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV161+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpCL3QWr/sel_SWV161+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV161+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV161+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV161+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
%
%------------------------------------------------------------------------------