TSTP Solution File: SWV189+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV189+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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:44 EST 2010
% Result : Theorem 0.27s
% Output : CNFRefutation 0.27s
% 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 |; 29 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-3 aty)
% Number of variables : 50 ( 0 sgn 32 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/tmp/tmpNZ_qfJ/sel_SWV189+1.p_1',transitivity_leq) ).
fof(6,axiom,
! [X1] : plus(n1,X1) = succ(X1),
file('/tmp/tmpNZ_qfJ/sel_SWV189+1.p_1',succ_plus_1_l) ).
fof(11,axiom,
succ(tptp_minus_1) = n0,
file('/tmp/tmpNZ_qfJ/sel_SWV189+1.p_1',succ_tptp_minus_1) ).
fof(14,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/tmp/tmpNZ_qfJ/sel_SWV189+1.p_1',succ_plus_1_r) ).
fof(15,axiom,
! [X1] : ~ gt(X1,X1),
file('/tmp/tmpNZ_qfJ/sel_SWV189+1.p_1',irreflexivity_gt) ).
fof(21,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> gt(succ(X2),X1) ),
file('/tmp/tmpNZ_qfJ/sel_SWV189+1.p_1',leq_succ_gt_equiv) ).
fof(34,conjecture,
( ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select3(center_init,X4,n0) = init )
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,tptp_minus_1) )
=> ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select3(q_init,X5,X6) = init ) ) ),
file('/tmp/tmpNZ_qfJ/sel_SWV189+1.p_1',cl5_nebula_init_0121) ).
fof(57,negated_conjecture,
~ ( ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select3(center_init,X4,n0) = init )
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,tptp_minus_1) )
=> ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select3(q_init,X5,X6) = init ) ) ),
inference(assume_negation,[status(cth)],[34]) ).
fof(58,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[15,theory(equality)]) ).
fof(64,plain,
! [X1,X2,X3] :
( ~ leq(X1,X2)
| ~ leq(X2,X3)
| leq(X1,X3) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(65,plain,
! [X4,X5,X6] :
( ~ leq(X4,X5)
| ~ leq(X5,X6)
| leq(X4,X6) ),
inference(variable_rename,[status(thm)],[64]) ).
cnf(66,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[65]) ).
fof(73,plain,
! [X2] : plus(n1,X2) = succ(X2),
inference(variable_rename,[status(thm)],[6]) ).
cnf(74,plain,
plus(n1,X1) = succ(X1),
inference(split_conjunct,[status(thm)],[73]) ).
cnf(85,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[11]) ).
fof(90,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[14]) ).
cnf(91,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[90]) ).
fof(92,plain,
! [X2] : ~ gt(X2,X2),
inference(variable_rename,[status(thm)],[58]) ).
cnf(93,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[92]) ).
fof(104,plain,
! [X1,X2] :
( ( ~ leq(X1,X2)
| gt(succ(X2),X1) )
& ( ~ gt(succ(X2),X1)
| leq(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(105,plain,
! [X3,X4] :
( ( ~ leq(X3,X4)
| gt(succ(X4),X3) )
& ( ~ gt(succ(X4),X3)
| leq(X3,X4) ) ),
inference(variable_rename,[status(thm)],[104]) ).
cnf(107,plain,
( gt(succ(X1),X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[105]) ).
fof(124,negated_conjecture,
( ! [X4] :
( ~ leq(n0,X4)
| ~ leq(X4,n4)
| a_select3(center_init,X4,n0) = init )
& ? [X5] :
( leq(n0,X5)
& leq(X5,tptp_minus_1)
& ? [X6] :
( leq(n0,X6)
& leq(X6,n4)
& a_select3(q_init,X5,X6) != init ) ) ),
inference(fof_nnf,[status(thm)],[57]) ).
fof(125,negated_conjecture,
( ! [X7] :
( ~ leq(n0,X7)
| ~ leq(X7,n4)
| a_select3(center_init,X7,n0) = init )
& ? [X8] :
( leq(n0,X8)
& leq(X8,tptp_minus_1)
& ? [X9] :
( leq(n0,X9)
& leq(X9,n4)
& a_select3(q_init,X8,X9) != init ) ) ),
inference(variable_rename,[status(thm)],[124]) ).
fof(126,negated_conjecture,
( ! [X7] :
( ~ leq(n0,X7)
| ~ leq(X7,n4)
| a_select3(center_init,X7,n0) = init )
& leq(n0,esk1_0)
& leq(esk1_0,tptp_minus_1)
& leq(n0,esk2_0)
& leq(esk2_0,n4)
& a_select3(q_init,esk1_0,esk2_0) != init ),
inference(skolemize,[status(esa)],[125]) ).
fof(127,negated_conjecture,
! [X7] :
( ( ~ leq(n0,X7)
| ~ leq(X7,n4)
| a_select3(center_init,X7,n0) = init )
& leq(n0,esk1_0)
& leq(esk1_0,tptp_minus_1)
& leq(n0,esk2_0)
& leq(esk2_0,n4)
& a_select3(q_init,esk1_0,esk2_0) != init ),
inference(shift_quantors,[status(thm)],[126]) ).
cnf(131,negated_conjecture,
leq(esk1_0,tptp_minus_1),
inference(split_conjunct,[status(thm)],[127]) ).
cnf(132,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[127]) ).
cnf(168,plain,
plus(tptp_minus_1,n1) = n0,
inference(rw,[status(thm)],[85,91,theory(equality)]),
[unfolding] ).
cnf(170,plain,
plus(n1,X1) = plus(X1,n1),
inference(rw,[status(thm)],[74,91,theory(equality)]),
[unfolding] ).
cnf(187,plain,
( gt(plus(X1,n1),X2)
| ~ leq(X2,X1) ),
inference(rw,[status(thm)],[107,91,theory(equality)]),
[unfolding] ).
cnf(213,negated_conjecture,
( leq(X1,tptp_minus_1)
| ~ leq(X1,esk1_0) ),
inference(spm,[status(thm)],[66,131,theory(equality)]) ).
cnf(224,plain,
plus(n1,tptp_minus_1) = n0,
inference(rw,[status(thm)],[168,170,theory(equality)]) ).
cnf(236,plain,
~ leq(plus(X1,n1),X1),
inference(spm,[status(thm)],[93,187,theory(equality)]) ).
cnf(380,plain,
~ leq(plus(n1,X1),X1),
inference(spm,[status(thm)],[236,170,theory(equality)]) ).
cnf(419,plain,
~ leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[380,224,theory(equality)]) ).
cnf(499,negated_conjecture,
leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[213,132,theory(equality)]) ).
cnf(502,negated_conjecture,
$false,
inference(sr,[status(thm)],[499,419,theory(equality)]) ).
cnf(503,negated_conjecture,
$false,
502,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV189+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpNZ_qfJ/sel_SWV189+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV189+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV189+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV189+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
%
%------------------------------------------------------------------------------