TSTP Solution File: SWV048+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV048+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 12:02:10 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 42 ( 33 unt; 0 def)
% Number of atoms : 105 ( 56 equ)
% Maximal formula atoms : 17 ( 2 avg)
% Number of connectives : 100 ( 37 ~; 34 |; 23 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 11 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/tmpOPXkut/sel_SWV048+1.p_1',sum_plus_base) ).
fof(12,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/tmp/tmpOPXkut/sel_SWV048+1.p_1',succ_plus_1_r) ).
fof(13,axiom,
succ(tptp_minus_1) = n0,
file('/tmp/tmpOPXkut/sel_SWV048+1.p_1',succ_tptp_minus_1) ).
fof(23,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/tmp/tmpOPXkut/sel_SWV048+1.p_1',pred_minus_1) ).
fof(24,axiom,
! [X1] : plus(n1,X1) = succ(X1),
file('/tmp/tmpOPXkut/sel_SWV048+1.p_1',succ_plus_1_l) ).
fof(26,axiom,
true,
file('/tmp/tmpOPXkut/sel_SWV048+1.p_1',ttrue) ).
fof(28,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/tmp/tmpOPXkut/sel_SWV048+1.p_1',pred_succ) ).
fof(44,conjecture,
( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) )
=> ( ( n0 != pv78
=> ( n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ) )
& ( n0 = pv78
=> true ) ) ),
file('/tmp/tmpOPXkut/sel_SWV048+1.p_1',cl5_nebula_norm_0016) ).
fof(71,negated_conjecture,
~ ( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) )
=> ( ( n0 != pv78
=> ( n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ) )
& ( n0 = pv78
=> true ) ) ),
inference(assume_negation,[status(cth)],[44]) ).
fof(94,plain,
! [X5] : sum(n0,tptp_minus_1,X5) = n0,
inference(variable_rename,[status(thm)],[9]) ).
cnf(95,plain,
sum(n0,tptp_minus_1,X1) = n0,
inference(split_conjunct,[status(thm)],[94]) ).
fof(102,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[12]) ).
cnf(103,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[102]) ).
cnf(104,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[13]) ).
fof(125,plain,
! [X2] : minus(X2,n1) = pred(X2),
inference(variable_rename,[status(thm)],[23]) ).
cnf(126,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[125]) ).
fof(127,plain,
! [X2] : plus(n1,X2) = succ(X2),
inference(variable_rename,[status(thm)],[24]) ).
cnf(128,plain,
plus(n1,X1) = succ(X1),
inference(split_conjunct,[status(thm)],[127]) ).
cnf(133,plain,
true,
inference(split_conjunct,[status(thm)],[26]) ).
fof(137,plain,
! [X2] : pred(succ(X2)) = X2,
inference(variable_rename,[status(thm)],[28]) ).
cnf(138,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[137]) ).
fof(157,negated_conjecture,
( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1))
& ( ( n0 != pv78
& ( n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1)) ) )
| ( n0 = pv78
& ~ true ) ) ),
inference(fof_nnf,[status(thm)],[71]) ).
fof(158,negated_conjecture,
( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1))
& ( n0 = pv78
| n0 != pv78 )
& ( ~ true
| n0 != pv78 )
& ( n0 = pv78
| n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
| 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(a_select3(q,pv81,pv35),a_select2(x,pv81)))
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1)) ) ),
inference(distribute,[status(thm)],[157]) ).
cnf(159,negated_conjecture,
( ~ 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(a_select3(q,pv81,pv35),a_select2(x,pv81)))
| ~ true ),
inference(split_conjunct,[status(thm)],[158]) ).
cnf(163,negated_conjecture,
leq(pv35,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[158]) ).
cnf(164,negated_conjecture,
leq(n0,pv35),
inference(split_conjunct,[status(thm)],[158]) ).
cnf(165,negated_conjecture,
pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)),
inference(split_conjunct,[status(thm)],[158]) ).
cnf(205,plain,
plus(tptp_minus_1,n1) = n0,
inference(rw,[status(thm)],[104,103,theory(equality)]),
[unfolding] ).
cnf(207,plain,
pred(plus(X1,n1)) = X1,
inference(rw,[status(thm)],[138,103,theory(equality)]),
[unfolding] ).
cnf(208,plain,
plus(n1,X1) = plus(X1,n1),
inference(rw,[status(thm)],[128,103,theory(equality)]),
[unfolding] ).
cnf(229,plain,
minus(plus(X1,n1),n1) = X1,
inference(rw,[status(thm)],[207,126,theory(equality)]),
[unfolding] ).
cnf(245,plain,
minus(plus(n1,X1),n1) = X1,
inference(spm,[status(thm)],[229,208,theory(equality)]) ).
cnf(249,plain,
plus(n1,tptp_minus_1) = n0,
inference(rw,[status(thm)],[205,208,theory(equality)]) ).
cnf(441,negated_conjecture,
( $false
| sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0
| ~ true
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1)) ),
inference(rw,[status(thm)],[159,165,theory(equality)]) ).
cnf(442,negated_conjecture,
( $false
| sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0
| $false
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1)) ),
inference(rw,[status(thm)],[441,133,theory(equality)]) ).
cnf(443,negated_conjecture,
( $false
| sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0
| $false
| $false
| ~ leq(pv35,minus(n5,n1)) ),
inference(rw,[status(thm)],[442,164,theory(equality)]) ).
cnf(444,negated_conjecture,
( $false
| sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0
| $false
| $false
| $false ),
inference(rw,[status(thm)],[443,163,theory(equality)]) ).
cnf(445,negated_conjecture,
sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0,
inference(cn,[status(thm)],[444,theory(equality)]) ).
cnf(677,plain,
minus(n0,n1) = tptp_minus_1,
inference(spm,[status(thm)],[245,249,theory(equality)]) ).
cnf(714,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[445,677,theory(equality)]),95,theory(equality)]) ).
cnf(715,negated_conjecture,
$false,
inference(cn,[status(thm)],[714,theory(equality)]) ).
cnf(716,negated_conjecture,
$false,
715,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV048+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpOPXkut/sel_SWV048+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV048+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV048+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV048+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
%
%------------------------------------------------------------------------------