TSTP Solution File: SWV188+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV188+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:22:40 EST 2010
% Result : Theorem 0.31s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 23 unt; 0 def)
% Number of atoms : 143 ( 35 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 128 ( 25 ~; 13 |; 51 &)
% ( 1 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 15 con; 0-3 aty)
% Number of variables : 62 ( 0 sgn 46 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/tmp/tmp6TSUIf/sel_SWV188+1.p_1',transitivity_leq) ).
fof(6,axiom,
! [X1] : plus(n1,X1) = succ(X1),
file('/tmp/tmp6TSUIf/sel_SWV188+1.p_1',succ_plus_1_l) ).
fof(11,axiom,
succ(tptp_minus_1) = n0,
file('/tmp/tmp6TSUIf/sel_SWV188+1.p_1',succ_tptp_minus_1) ).
fof(14,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/tmp/tmp6TSUIf/sel_SWV188+1.p_1',succ_plus_1_r) ).
fof(15,axiom,
! [X1] : ~ gt(X1,X1),
file('/tmp/tmp6TSUIf/sel_SWV188+1.p_1',irreflexivity_gt) ).
fof(21,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> gt(succ(X2),X1) ),
file('/tmp/tmp6TSUIf/sel_SWV188+1.p_1',leq_succ_gt_equiv) ).
fof(50,conjecture,
( ( ! [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_select2(rho_init,X6) = init )
& ! [X7] :
( ( leq(n0,X7)
& leq(X7,n4) )
=> a_select3(center_init,X7,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X8] :
( ( leq(n0,X8)
& leq(X8,n4) )
=> a_select2(muold_init,X8) = init ) )
& ( gt(loopcounter,n1)
=> ! [X9] :
( ( leq(n0,X9)
& leq(X9,n4) )
=> a_select2(rhoold_init,X9) = init ) )
& ( gt(loopcounter,n1)
=> ! [X10] :
( ( leq(n0,X10)
& leq(X10,n4) )
=> a_select2(sigmaold_init,X10) = init ) ) )
=> ! [X11] :
( ( leq(n0,X11)
& leq(X11,tptp_minus_1) )
=> a_select2(mu_init,X11) = init ) ),
file('/tmp/tmp6TSUIf/sel_SWV188+1.p_1',cl5_nebula_init_0116) ).
fof(64,negated_conjecture,
~ ( ( ! [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_select2(rho_init,X6) = init )
& ! [X7] :
( ( leq(n0,X7)
& leq(X7,n4) )
=> a_select3(center_init,X7,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X8] :
( ( leq(n0,X8)
& leq(X8,n4) )
=> a_select2(muold_init,X8) = init ) )
& ( gt(loopcounter,n1)
=> ! [X9] :
( ( leq(n0,X9)
& leq(X9,n4) )
=> a_select2(rhoold_init,X9) = init ) )
& ( gt(loopcounter,n1)
=> ! [X10] :
( ( leq(n0,X10)
& leq(X10,n4) )
=> a_select2(sigmaold_init,X10) = init ) ) )
=> ! [X11] :
( ( leq(n0,X11)
& leq(X11,tptp_minus_1) )
=> a_select2(mu_init,X11) = init ) ),
inference(assume_negation,[status(cth)],[50]) ).
fof(65,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[15,theory(equality)]) ).
fof(66,plain,
( epred1_0
=> ( ! [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_select2(rho_init,X6) = init )
& ! [X7] :
( ( leq(n0,X7)
& leq(X7,n4) )
=> a_select3(center_init,X7,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X8] :
( ( leq(n0,X8)
& leq(X8,n4) )
=> a_select2(muold_init,X8) = init ) )
& ( gt(loopcounter,n1)
=> ! [X9] :
( ( leq(n0,X9)
& leq(X9,n4) )
=> a_select2(rhoold_init,X9) = init ) )
& ( gt(loopcounter,n1)
=> ! [X10] :
( ( leq(n0,X10)
& leq(X10,n4) )
=> a_select2(sigmaold_init,X10) = init ) ) ) ),
introduced(definition) ).
fof(67,negated_conjecture,
~ ( epred1_0
=> ! [X11] :
( ( leq(n0,X11)
& leq(X11,tptp_minus_1) )
=> a_select2(mu_init,X11) = init ) ),
inference(apply_def,[status(esa)],[64,66,theory(equality)]) ).
fof(73,plain,
! [X1,X2,X3] :
( ~ leq(X1,X2)
| ~ leq(X2,X3)
| leq(X1,X3) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(74,plain,
! [X4,X5,X6] :
( ~ leq(X4,X5)
| ~ leq(X5,X6)
| leq(X4,X6) ),
inference(variable_rename,[status(thm)],[73]) ).
cnf(75,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[74]) ).
fof(82,plain,
! [X2] : plus(n1,X2) = succ(X2),
inference(variable_rename,[status(thm)],[6]) ).
cnf(83,plain,
plus(n1,X1) = succ(X1),
inference(split_conjunct,[status(thm)],[82]) ).
cnf(94,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[11]) ).
fof(99,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[14]) ).
cnf(100,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[99]) ).
fof(101,plain,
! [X2] : ~ gt(X2,X2),
inference(variable_rename,[status(thm)],[65]) ).
cnf(102,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[101]) ).
fof(113,plain,
! [X1,X2] :
( ( ~ leq(X1,X2)
| gt(succ(X2),X1) )
& ( ~ gt(succ(X2),X1)
| leq(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(114,plain,
! [X3,X4] :
( ( ~ leq(X3,X4)
| gt(succ(X4),X3) )
& ( ~ gt(succ(X4),X3)
| leq(X3,X4) ) ),
inference(variable_rename,[status(thm)],[113]) ).
cnf(116,plain,
( gt(succ(X1),X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[114]) ).
fof(153,negated_conjecture,
( epred1_0
& ? [X11] :
( leq(n0,X11)
& leq(X11,tptp_minus_1)
& a_select2(mu_init,X11) != init ) ),
inference(fof_nnf,[status(thm)],[67]) ).
fof(154,negated_conjecture,
( epred1_0
& ? [X12] :
( leq(n0,X12)
& leq(X12,tptp_minus_1)
& a_select2(mu_init,X12) != init ) ),
inference(variable_rename,[status(thm)],[153]) ).
fof(155,negated_conjecture,
( epred1_0
& leq(n0,esk1_0)
& leq(esk1_0,tptp_minus_1)
& a_select2(mu_init,esk1_0) != init ),
inference(skolemize,[status(esa)],[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(191,plain,
plus(tptp_minus_1,n1) = n0,
inference(rw,[status(thm)],[94,100,theory(equality)]),
[unfolding] ).
cnf(193,plain,
plus(n1,X1) = plus(X1,n1),
inference(rw,[status(thm)],[83,100,theory(equality)]),
[unfolding] ).
cnf(210,plain,
( gt(plus(X1,n1),X2)
| ~ leq(X2,X1) ),
inference(rw,[status(thm)],[116,100,theory(equality)]),
[unfolding] ).
cnf(242,negated_conjecture,
( leq(X1,tptp_minus_1)
| ~ leq(X1,esk1_0) ),
inference(spm,[status(thm)],[75,157,theory(equality)]) ).
cnf(259,plain,
plus(n1,tptp_minus_1) = n0,
inference(rw,[status(thm)],[191,193,theory(equality)]) ).
cnf(268,plain,
~ leq(plus(X1,n1),X1),
inference(spm,[status(thm)],[102,210,theory(equality)]) ).
cnf(425,plain,
~ leq(plus(n1,X1),X1),
inference(spm,[status(thm)],[268,193,theory(equality)]) ).
cnf(450,plain,
~ leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[425,259,theory(equality)]) ).
cnf(545,negated_conjecture,
leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[242,158,theory(equality)]) ).
cnf(548,negated_conjecture,
$false,
inference(sr,[status(thm)],[545,450,theory(equality)]) ).
cnf(549,negated_conjecture,
$false,
548,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV188+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmp6TSUIf/sel_SWV188+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV188+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV188+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV188+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
%
%------------------------------------------------------------------------------