TSTP Solution File: SWV152+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV152+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:19:55 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 42 ( 25 unt; 0 def)
% Number of atoms : 72 ( 16 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 55 ( 25 ~; 15 |; 11 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 44 ( 0 sgn 26 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/tmp/tmpiF9YTv/sel_SWV152+1.p_1',transitivity_leq) ).
fof(6,axiom,
! [X1] : plus(n1,X1) = succ(X1),
file('/tmp/tmpiF9YTv/sel_SWV152+1.p_1',succ_plus_1_l) ).
fof(12,axiom,
succ(tptp_minus_1) = n0,
file('/tmp/tmpiF9YTv/sel_SWV152+1.p_1',succ_tptp_minus_1) ).
fof(15,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/tmp/tmpiF9YTv/sel_SWV152+1.p_1',succ_plus_1_r) ).
fof(16,axiom,
! [X1] : ~ gt(X1,X1),
file('/tmp/tmpiF9YTv/sel_SWV152+1.p_1',irreflexivity_gt) ).
fof(19,axiom,
! [X1] : leq(X1,X1),
file('/tmp/tmpiF9YTv/sel_SWV152+1.p_1',reflexivity_leq) ).
fof(22,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> gt(succ(X2),X1) ),
file('/tmp/tmpiF9YTv/sel_SWV152+1.p_1',leq_succ_gt_equiv) ).
fof(53,conjecture,
! [X5] :
( ( leq(n0,X5)
& leq(X5,tptp_minus_1) )
=> sum(n0,n4,a_select3(q,X5,tptp_sum_index)) = n1 ),
file('/tmp/tmpiF9YTv/sel_SWV152+1.p_1',cl5_nebula_norm_0002) ).
fof(58,negated_conjecture,
~ ! [X5] :
( ( leq(n0,X5)
& leq(X5,tptp_minus_1) )
=> sum(n0,n4,a_select3(q,X5,tptp_sum_index)) = n1 ),
inference(assume_negation,[status(cth)],[53]) ).
fof(59,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[16,theory(equality)]) ).
fof(65,plain,
! [X1,X2,X3] :
( ~ leq(X1,X2)
| ~ leq(X2,X3)
| leq(X1,X3) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(66,plain,
! [X4,X5,X6] :
( ~ leq(X4,X5)
| ~ leq(X5,X6)
| leq(X4,X6) ),
inference(variable_rename,[status(thm)],[65]) ).
cnf(67,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[66]) ).
fof(74,plain,
! [X2] : plus(n1,X2) = succ(X2),
inference(variable_rename,[status(thm)],[6]) ).
cnf(75,plain,
plus(n1,X1) = succ(X1),
inference(split_conjunct,[status(thm)],[74]) ).
cnf(88,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[12]) ).
fof(93,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[15]) ).
cnf(94,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[93]) ).
fof(95,plain,
! [X2] : ~ gt(X2,X2),
inference(variable_rename,[status(thm)],[59]) ).
cnf(96,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[95]) ).
fof(101,plain,
! [X2] : leq(X2,X2),
inference(variable_rename,[status(thm)],[19]) ).
cnf(102,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[101]) ).
fof(107,plain,
! [X1,X2] :
( ( ~ leq(X1,X2)
| gt(succ(X2),X1) )
& ( ~ gt(succ(X2),X1)
| leq(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(108,plain,
! [X3,X4] :
( ( ~ leq(X3,X4)
| gt(succ(X4),X3) )
& ( ~ gt(succ(X4),X3)
| leq(X3,X4) ) ),
inference(variable_rename,[status(thm)],[107]) ).
cnf(110,plain,
( gt(succ(X1),X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[108]) ).
fof(157,negated_conjecture,
? [X5] :
( leq(n0,X5)
& leq(X5,tptp_minus_1)
& sum(n0,n4,a_select3(q,X5,tptp_sum_index)) != n1 ),
inference(fof_nnf,[status(thm)],[58]) ).
fof(158,negated_conjecture,
? [X6] :
( leq(n0,X6)
& leq(X6,tptp_minus_1)
& sum(n0,n4,a_select3(q,X6,tptp_sum_index)) != n1 ),
inference(variable_rename,[status(thm)],[157]) ).
fof(159,negated_conjecture,
( leq(n0,esk1_0)
& leq(esk1_0,tptp_minus_1)
& sum(n0,n4,a_select3(q,esk1_0,tptp_sum_index)) != n1 ),
inference(skolemize,[status(esa)],[158]) ).
cnf(161,negated_conjecture,
leq(esk1_0,tptp_minus_1),
inference(split_conjunct,[status(thm)],[159]) ).
cnf(162,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[159]) ).
cnf(168,plain,
plus(tptp_minus_1,n1) = n0,
inference(rw,[status(thm)],[88,94,theory(equality)]),
[unfolding] ).
cnf(169,plain,
plus(n1,X1) = plus(X1,n1),
inference(rw,[status(thm)],[75,94,theory(equality)]),
[unfolding] ).
cnf(186,plain,
( gt(plus(X1,n1),X2)
| ~ leq(X2,X1) ),
inference(rw,[status(thm)],[110,94,theory(equality)]),
[unfolding] ).
cnf(195,negated_conjecture,
( leq(X1,esk1_0)
| ~ leq(X1,n0) ),
inference(spm,[status(thm)],[67,162,theory(equality)]) ).
cnf(196,negated_conjecture,
( leq(X1,tptp_minus_1)
| ~ leq(X1,esk1_0) ),
inference(spm,[status(thm)],[67,161,theory(equality)]) ).
cnf(206,plain,
plus(n1,tptp_minus_1) = n0,
inference(rw,[status(thm)],[168,169,theory(equality)]) ).
cnf(225,plain,
~ leq(plus(X1,n1),X1),
inference(spm,[status(thm)],[96,186,theory(equality)]) ).
cnf(408,negated_conjecture,
( leq(X1,tptp_minus_1)
| ~ leq(X1,n0) ),
inference(spm,[status(thm)],[196,195,theory(equality)]) ).
cnf(412,negated_conjecture,
~ leq(plus(tptp_minus_1,n1),n0),
inference(spm,[status(thm)],[225,408,theory(equality)]) ).
cnf(416,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[412,169,theory(equality)]),206,theory(equality)]),102,theory(equality)]) ).
cnf(417,negated_conjecture,
$false,
inference(cn,[status(thm)],[416,theory(equality)]) ).
cnf(418,negated_conjecture,
$false,
417,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV152+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpiF9YTv/sel_SWV152+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV152+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV152+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV152+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
%
%------------------------------------------------------------------------------