TSTP Solution File: SWV078+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV078+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:07:14 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 8 unt; 0 def)
% Number of atoms : 54 ( 17 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 59 ( 22 ~; 16 |; 15 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(25,axiom,
true,
file('/tmp/tmplWnQ2K/sel_SWV078+1.p_1',ttrue) ).
fof(46,conjecture,
( ( leq(n0,pv31)
& leq(pv31,minus(n5,n1)) )
=> ( ( n0 != pv70
=> ( leq(n0,pv31)
& leq(pv31,minus(n5,n1)) ) )
& ( n0 = pv70
=> true ) ) ),
file('/tmp/tmplWnQ2K/sel_SWV078+1.p_1',cl5_nebula_array_0019) ).
fof(63,negated_conjecture,
~ ( ( leq(n0,pv31)
& leq(pv31,minus(n5,n1)) )
=> ( ( n0 != pv70
=> ( leq(n0,pv31)
& leq(pv31,minus(n5,n1)) ) )
& ( n0 = pv70
=> true ) ) ),
inference(assume_negation,[status(cth)],[46]) ).
cnf(123,plain,
true,
inference(split_conjunct,[status(thm)],[25]) ).
fof(152,negated_conjecture,
( leq(n0,pv31)
& leq(pv31,minus(n5,n1))
& ( ( n0 != pv70
& ( ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1)) ) )
| ( n0 = pv70
& ~ true ) ) ),
inference(fof_nnf,[status(thm)],[63]) ).
fof(153,negated_conjecture,
( leq(n0,pv31)
& leq(pv31,minus(n5,n1))
& ( n0 = pv70
| n0 != pv70 )
& ( ~ true
| n0 != pv70 )
& ( n0 = pv70
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1)) )
& ( ~ true
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1)) ) ),
inference(distribute,[status(thm)],[152]) ).
cnf(155,negated_conjecture,
( n0 = pv70
| ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31) ),
inference(split_conjunct,[status(thm)],[153]) ).
cnf(156,negated_conjecture,
( n0 != pv70
| ~ true ),
inference(split_conjunct,[status(thm)],[153]) ).
cnf(158,negated_conjecture,
leq(pv31,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[153]) ).
cnf(159,negated_conjecture,
leq(n0,pv31),
inference(split_conjunct,[status(thm)],[153]) ).
cnf(214,negated_conjecture,
( pv70 != n0
| $false ),
inference(rw,[status(thm)],[156,123,theory(equality)]) ).
cnf(215,negated_conjecture,
pv70 != n0,
inference(cn,[status(thm)],[214,theory(equality)]) ).
cnf(237,negated_conjecture,
( pv70 = n0
| $false
| ~ leq(pv31,minus(n5,n1)) ),
inference(rw,[status(thm)],[155,159,theory(equality)]) ).
cnf(238,negated_conjecture,
( pv70 = n0
| $false
| $false ),
inference(rw,[status(thm)],[237,158,theory(equality)]) ).
cnf(239,negated_conjecture,
pv70 = n0,
inference(cn,[status(thm)],[238,theory(equality)]) ).
cnf(240,negated_conjecture,
$false,
inference(sr,[status(thm)],[239,215,theory(equality)]) ).
cnf(241,negated_conjecture,
$false,
240,
[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/SWV078+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmplWnQ2K/sel_SWV078+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV078+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV078+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV078+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
%
%------------------------------------------------------------------------------