TSTP Solution File: SWV056+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV056+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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 11:59:27 EST 2010
% Result : Theorem 0.33s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 30 unt; 0 def)
% Number of atoms : 54 ( 31 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 29 ( 11 ~; 8 |; 8 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 19 ( 1 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(9,axiom,
! [X4] : sum(n0,tptp_minus_1,X4) = n0,
file('/tmp/tmpDerpO8/sel_SWV056+1.p_1',sum_plus_base) ).
fof(13,axiom,
succ(tptp_minus_1) = n0,
file('/tmp/tmpDerpO8/sel_SWV056+1.p_1',succ_tptp_minus_1) ).
fof(17,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/tmp/tmpDerpO8/sel_SWV056+1.p_1',succ_plus_1_r) ).
fof(22,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/tmp/tmpDerpO8/sel_SWV056+1.p_1',pred_minus_1) ).
fof(23,axiom,
! [X1] : plus(n1,X1) = succ(X1),
file('/tmp/tmpDerpO8/sel_SWV056+1.p_1',succ_plus_1_l) ).
fof(27,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/tmp/tmpDerpO8/sel_SWV056+1.p_1',pred_succ) ).
fof(50,conjecture,
( ( leq(n0,pv25)
& leq(pv25,minus(n5,n1)) )
=> ( n0 = sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))
& leq(n0,pv25)
& leq(pv25,minus(n5,n1)) ) ),
file('/tmp/tmpDerpO8/sel_SWV056+1.p_1',cl5_nebula_norm_0040) ).
fof(63,negated_conjecture,
~ ( ( leq(n0,pv25)
& leq(pv25,minus(n5,n1)) )
=> ( n0 = sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))
& leq(n0,pv25)
& leq(pv25,minus(n5,n1)) ) ),
inference(assume_negation,[status(cth)],[50]) ).
fof(86,plain,
! [X5] : sum(n0,tptp_minus_1,X5) = n0,
inference(variable_rename,[status(thm)],[9]) ).
cnf(87,plain,
sum(n0,tptp_minus_1,X1) = n0,
inference(split_conjunct,[status(thm)],[86]) ).
cnf(96,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[13]) ).
fof(103,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[17]) ).
cnf(104,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[103]) ).
fof(113,plain,
! [X2] : minus(X2,n1) = pred(X2),
inference(variable_rename,[status(thm)],[22]) ).
cnf(114,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[113]) ).
fof(115,plain,
! [X2] : plus(n1,X2) = succ(X2),
inference(variable_rename,[status(thm)],[23]) ).
cnf(116,plain,
plus(n1,X1) = succ(X1),
inference(split_conjunct,[status(thm)],[115]) ).
fof(128,plain,
! [X2] : pred(succ(X2)) = X2,
inference(variable_rename,[status(thm)],[27]) ).
cnf(129,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[128]) ).
fof(159,negated_conjecture,
( leq(n0,pv25)
& leq(pv25,minus(n5,n1))
& ( n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))
| ~ leq(n0,pv25)
| ~ leq(pv25,minus(n5,n1)) ) ),
inference(fof_nnf,[status(thm)],[63]) ).
cnf(160,negated_conjecture,
( ~ leq(pv25,minus(n5,n1))
| ~ leq(n0,pv25)
| n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ),
inference(split_conjunct,[status(thm)],[159]) ).
cnf(161,negated_conjecture,
leq(pv25,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[159]) ).
cnf(162,negated_conjecture,
leq(n0,pv25),
inference(split_conjunct,[status(thm)],[159]) ).
cnf(184,plain,
plus(tptp_minus_1,n1) = n0,
inference(rw,[status(thm)],[96,104,theory(equality)]),
[unfolding] ).
cnf(186,plain,
pred(plus(X1,n1)) = X1,
inference(rw,[status(thm)],[129,104,theory(equality)]),
[unfolding] ).
cnf(187,plain,
plus(n1,X1) = plus(X1,n1),
inference(rw,[status(thm)],[116,104,theory(equality)]),
[unfolding] ).
cnf(208,plain,
minus(plus(X1,n1),n1) = X1,
inference(rw,[status(thm)],[186,114,theory(equality)]),
[unfolding] ).
cnf(242,plain,
minus(plus(n1,X1),n1) = X1,
inference(spm,[status(thm)],[208,187,theory(equality)]) ).
cnf(246,plain,
plus(n1,tptp_minus_1) = n0,
inference(rw,[status(thm)],[184,187,theory(equality)]) ).
cnf(371,negated_conjecture,
( sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) != n0
| $false
| ~ leq(pv25,minus(n5,n1)) ),
inference(rw,[status(thm)],[160,162,theory(equality)]) ).
cnf(372,negated_conjecture,
( sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) != n0
| $false
| $false ),
inference(rw,[status(thm)],[371,161,theory(equality)]) ).
cnf(373,negated_conjecture,
sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) != n0,
inference(cn,[status(thm)],[372,theory(equality)]) ).
cnf(647,plain,
minus(n0,n1) = tptp_minus_1,
inference(spm,[status(thm)],[242,246,theory(equality)]) ).
cnf(675,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[373,647,theory(equality)]),87,theory(equality)]) ).
cnf(676,negated_conjecture,
$false,
inference(cn,[status(thm)],[675,theory(equality)]) ).
cnf(677,negated_conjecture,
$false,
676,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV056+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpDerpO8/sel_SWV056+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV056+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV056+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV056+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
%
%------------------------------------------------------------------------------