%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV067+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:01:40 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 10 unt; 0 def)
% Number of atoms : 142 ( 0 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 181 ( 69 ~; 57 |; 44 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-3 aty)
% Number of variables : 21 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/tmp/tmp8fcTkH/sel_SWV067+1.p_1',transitivity_leq) ).
fof(6,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/tmp/tmp8fcTkH/sel_SWV067+1.p_1',leq_gt1) ).
fof(29,conjecture,
( ( leq(n0,pv10)
& leq(n1,pv63)
& leq(pv10,minus(n135300,n1))
& leq(pv63,minus(n5,n1)) )
=> ( leq(n0,pv10)
& leq(n0,pv63)
& leq(pv10,minus(n135300,n1))
& leq(pv63,minus(n5,n1))
& ( ~ gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) ) )
& ( gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) ) ) ) ),
file('/tmp/tmp8fcTkH/sel_SWV067+1.p_1',cl5_nebula_array_0008) ).
fof(46,axiom,
gt(n1,n0),
file('/tmp/tmp8fcTkH/sel_SWV067+1.p_1',gt_1_0) ).
fof(69,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(n1,pv63)
& leq(pv10,minus(n135300,n1))
& leq(pv63,minus(n5,n1)) )
=> ( leq(n0,pv10)
& leq(n0,pv63)
& leq(pv10,minus(n135300,n1))
& leq(pv63,minus(n5,n1))
& ( ~ gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) ) )
& ( gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) ) ) ) ),
inference(assume_negation,[status(cth)],[29]) ).
fof(71,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(n1,pv63)
& leq(pv10,minus(n135300,n1))
& leq(pv63,minus(n5,n1)) )
=> ( leq(n0,pv10)
& leq(n0,pv63)
& leq(pv10,minus(n135300,n1))
& leq(pv63,minus(n5,n1))
& ( ~ gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) ) )
& ( gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) ) ) ) ),
inference(fof_simplification,[status(thm)],[69,theory(equality)]) ).
fof(80,plain,
! [X1,X2,X3] :
( ~ leq(X1,X2)
| ~ leq(X2,X3)
| leq(X1,X3) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(81,plain,
! [X4,X5,X6] :
( ~ leq(X4,X5)
| ~ leq(X5,X6)
| leq(X4,X6) ),
inference(variable_rename,[status(thm)],[80]) ).
cnf(82,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[81]) ).
fof(86,plain,
! [X1,X2] :
( ~ gt(X2,X1)
| leq(X1,X2) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(87,plain,
! [X3,X4] :
( ~ gt(X4,X3)
| leq(X3,X4) ),
inference(variable_rename,[status(thm)],[86]) ).
cnf(88,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
inference(split_conjunct,[status(thm)],[87]) ).
fof(140,negated_conjecture,
( leq(n0,pv10)
& leq(n1,pv63)
& leq(pv10,minus(n135300,n1))
& leq(pv63,minus(n5,n1))
& ( ~ leq(n0,pv10)
| ~ leq(n0,pv63)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv63,minus(n5,n1))
| ( ~ gt(a_select3(q,pv10,pv63),pv78)
& ( ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) ) )
| ( gt(a_select3(q,pv10,pv63),pv78)
& ( ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) ) ) ) ),
inference(fof_nnf,[status(thm)],[71]) ).
fof(141,negated_conjecture,
( leq(n0,pv10)
& leq(n1,pv63)
& leq(pv10,minus(n135300,n1))
& leq(pv63,minus(n5,n1))
& ( gt(a_select3(q,pv10,pv63),pv78)
| ~ gt(a_select3(q,pv10,pv63),pv78)
| ~ leq(n0,pv10)
| ~ leq(n0,pv63)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv63,minus(n5,n1)) )
& ( ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1))
| ~ gt(a_select3(q,pv10,pv63),pv78)
| ~ leq(n0,pv10)
| ~ leq(n0,pv63)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv63,minus(n5,n1)) )
& ( gt(a_select3(q,pv10,pv63),pv78)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| ~ leq(n0,pv63)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv63,minus(n5,n1)) )
& ( ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| ~ leq(n0,pv63)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv63,minus(n5,n1)) ) ),
inference(distribute,[status(thm)],[140]) ).
cnf(142,negated_conjecture,
( ~ leq(pv63,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv63)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(146,negated_conjecture,
leq(pv63,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(147,negated_conjecture,
leq(pv10,minus(n135300,n1)),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(148,negated_conjecture,
leq(n1,pv63),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(149,negated_conjecture,
leq(n0,pv10),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(166,plain,
gt(n1,n0),
inference(split_conjunct,[status(thm)],[46]) ).
cnf(233,plain,
leq(n0,n1),
inference(spm,[status(thm)],[88,166,theory(equality)]) ).
cnf(284,negated_conjecture,
( leq(X1,pv63)
| ~ leq(X1,n1) ),
inference(spm,[status(thm)],[82,148,theory(equality)]) ).
cnf(390,negated_conjecture,
( ~ leq(n0,pv10)
| ~ leq(n0,pv63)
| $false
| ~ leq(pv63,minus(n5,n1)) ),
inference(rw,[status(thm)],[142,147,theory(equality)]) ).
cnf(391,negated_conjecture,
( ~ leq(n0,pv10)
| ~ leq(n0,pv63)
| $false
| $false ),
inference(rw,[status(thm)],[390,146,theory(equality)]) ).
cnf(392,negated_conjecture,
( ~ leq(n0,pv10)
| ~ leq(n0,pv63) ),
inference(cn,[status(thm)],[391,theory(equality)]) ).
cnf(706,negated_conjecture,
( ~ leq(n0,pv10)
| ~ leq(n0,n1) ),
inference(spm,[status(thm)],[392,284,theory(equality)]) ).
cnf(709,negated_conjecture,
( ~ leq(n0,pv10)
| $false ),
inference(rw,[status(thm)],[706,233,theory(equality)]) ).
cnf(710,negated_conjecture,
~ leq(n0,pv10),
inference(cn,[status(thm)],[709,theory(equality)]) ).
cnf(712,negated_conjecture,
$false,
inference(sr,[status(thm)],[149,710,theory(equality)]) ).
cnf(713,negated_conjecture,
$false,
712,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV067+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmp8fcTkH/sel_SWV067+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV067+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV067+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV067+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
%
%------------------------------------------------------------------------------