TSTP Solution File: SWV046+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV046+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:57:36 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 37 unt; 0 def)
% Number of atoms : 119 ( 73 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 110 ( 40 ~; 37 |; 27 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 15 con; 0-3 aty)
% Number of variables : 28 ( 2 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(11,axiom,
! [X1,X5,X6] : a_select2(tptp_update2(X1,X5,X6),X5) = X6,
file('/tmp/tmpkv1npT/sel_SWV046+1.p_1',sel2_update_1) ).
fof(12,axiom,
! [X9] : sum(n0,tptp_minus_1,X9) = n0,
file('/tmp/tmpkv1npT/sel_SWV046+1.p_1',sum_plus_base) ).
fof(15,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/tmp/tmpkv1npT/sel_SWV046+1.p_1',succ_plus_1_r) ).
fof(16,axiom,
succ(tptp_minus_1) = n0,
file('/tmp/tmpkv1npT/sel_SWV046+1.p_1',succ_tptp_minus_1) ).
fof(19,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/tmp/tmpkv1npT/sel_SWV046+1.p_1',pred_minus_1) ).
fof(27,axiom,
! [X1] : plus(n1,X1) = succ(X1),
file('/tmp/tmpkv1npT/sel_SWV046+1.p_1',succ_plus_1_l) ).
fof(29,axiom,
true,
file('/tmp/tmpkv1npT/sel_SWV046+1.p_1',ttrue) ).
fof(31,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/tmp/tmpkv1npT/sel_SWV046+1.p_1',pred_succ) ).
fof(51,conjecture,
( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) )
=> ( ( n0 != pv44
=> ( n0 = sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ) )
& ( n0 = pv44
=> true ) ) ),
file('/tmp/tmpkv1npT/sel_SWV046+1.p_1',cl5_nebula_norm_0010) ).
fof(74,negated_conjecture,
~ ( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) )
=> ( ( n0 != pv44
=> ( n0 = sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ) )
& ( n0 = pv44
=> true ) ) ),
inference(assume_negation,[status(cth)],[51]) ).
fof(107,plain,
! [X7,X8,X9] : a_select2(tptp_update2(X7,X8,X9),X8) = X9,
inference(variable_rename,[status(thm)],[11]) ).
cnf(108,plain,
a_select2(tptp_update2(X1,X2,X3),X2) = X3,
inference(split_conjunct,[status(thm)],[107]) ).
fof(109,plain,
! [X10] : sum(n0,tptp_minus_1,X10) = n0,
inference(variable_rename,[status(thm)],[12]) ).
cnf(110,plain,
sum(n0,tptp_minus_1,X1) = n0,
inference(split_conjunct,[status(thm)],[109]) ).
fof(117,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[15]) ).
cnf(118,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[117]) ).
cnf(119,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[16]) ).
fof(124,plain,
! [X2] : minus(X2,n1) = pred(X2),
inference(variable_rename,[status(thm)],[19]) ).
cnf(125,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[124]) ).
fof(142,plain,
! [X2] : plus(n1,X2) = succ(X2),
inference(variable_rename,[status(thm)],[27]) ).
cnf(143,plain,
plus(n1,X1) = succ(X1),
inference(split_conjunct,[status(thm)],[142]) ).
cnf(148,plain,
true,
inference(split_conjunct,[status(thm)],[29]) ).
fof(152,plain,
! [X2] : pred(succ(X2)) = X2,
inference(variable_rename,[status(thm)],[31]) ).
cnf(153,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[152]) ).
fof(176,negated_conjecture,
( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1))
& ( ( n0 != pv44
& ( n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1)) ) )
| ( n0 = pv44
& ~ true ) ) ),
inference(fof_nnf,[status(thm)],[74]) ).
fof(177,negated_conjecture,
( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1))
& ( n0 = pv44
| n0 != pv44 )
& ( ~ true
| n0 != pv44 )
& ( n0 = pv44
| n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1)) )
& ( ~ true
| n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1)) ) ),
inference(distribute,[status(thm)],[176]) ).
cnf(179,negated_conjecture,
( n0 = pv44
| ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) ),
inference(split_conjunct,[status(thm)],[177]) ).
cnf(180,negated_conjecture,
( n0 != pv44
| ~ true ),
inference(split_conjunct,[status(thm)],[177]) ).
cnf(182,negated_conjecture,
leq(pv35,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[177]) ).
cnf(183,negated_conjecture,
leq(n0,pv35),
inference(split_conjunct,[status(thm)],[177]) ).
cnf(185,negated_conjecture,
pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)),
inference(split_conjunct,[status(thm)],[177]) ).
cnf(221,plain,
plus(tptp_minus_1,n1) = n0,
inference(rw,[status(thm)],[119,118,theory(equality)]),
[unfolding] ).
cnf(223,plain,
pred(plus(X1,n1)) = X1,
inference(rw,[status(thm)],[153,118,theory(equality)]),
[unfolding] ).
cnf(224,plain,
plus(n1,X1) = plus(X1,n1),
inference(rw,[status(thm)],[143,118,theory(equality)]),
[unfolding] ).
cnf(245,plain,
minus(plus(X1,n1),n1) = X1,
inference(rw,[status(thm)],[223,125,theory(equality)]),
[unfolding] ).
cnf(248,negated_conjecture,
( pv44 != n0
| $false ),
inference(rw,[status(thm)],[180,148,theory(equality)]) ).
cnf(249,negated_conjecture,
pv44 != n0,
inference(cn,[status(thm)],[248,theory(equality)]) ).
cnf(288,plain,
minus(plus(n1,X1),n1) = X1,
inference(spm,[status(thm)],[245,224,theory(equality)]) ).
cnf(292,plain,
plus(n1,tptp_minus_1) = n0,
inference(rw,[status(thm)],[221,224,theory(equality)]) ).
cnf(500,negated_conjecture,
( pv44 = n0
| $false
| sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) != n0
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1)) ),
inference(rw,[status(thm)],[179,185,theory(equality)]) ).
cnf(501,negated_conjecture,
( pv44 = n0
| $false
| sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),divide(pv80,pv44)),times(minus(a_select2(x,pv83),divide(pv80,pv44)),a_select3(q,pv83,pv35)))) != n0
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[500,108,theory(equality)]),108,theory(equality)]) ).
cnf(502,negated_conjecture,
( pv44 = n0
| $false
| sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),divide(pv80,pv44)),times(minus(a_select2(x,pv83),divide(pv80,pv44)),a_select3(q,pv83,pv35)))) != n0
| $false
| ~ leq(pv35,minus(n5,n1)) ),
inference(rw,[status(thm)],[501,183,theory(equality)]) ).
cnf(503,negated_conjecture,
( pv44 = n0
| $false
| sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),divide(pv80,pv44)),times(minus(a_select2(x,pv83),divide(pv80,pv44)),a_select3(q,pv83,pv35)))) != n0
| $false
| $false ),
inference(rw,[status(thm)],[502,182,theory(equality)]) ).
cnf(504,negated_conjecture,
( pv44 = n0
| sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),divide(pv80,pv44)),times(minus(a_select2(x,pv83),divide(pv80,pv44)),a_select3(q,pv83,pv35)))) != n0 ),
inference(cn,[status(thm)],[503,theory(equality)]) ).
cnf(505,negated_conjecture,
sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),divide(pv80,pv44)),times(minus(a_select2(x,pv83),divide(pv80,pv44)),a_select3(q,pv83,pv35)))) != n0,
inference(sr,[status(thm)],[504,249,theory(equality)]) ).
cnf(738,plain,
minus(n0,n1) = tptp_minus_1,
inference(spm,[status(thm)],[288,292,theory(equality)]) ).
cnf(766,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[505,738,theory(equality)]),110,theory(equality)]) ).
cnf(767,negated_conjecture,
$false,
inference(cn,[status(thm)],[766,theory(equality)]) ).
cnf(768,negated_conjecture,
$false,
767,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV046+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpkv1npT/sel_SWV046+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV046+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV046+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV046+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
%
%------------------------------------------------------------------------------