TSTP Solution File: SWV041+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV041+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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:56:37 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 14 unt; 0 def)
% Number of atoms : 90 ( 16 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 81 ( 26 ~; 19 |; 27 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 10 con; 0-3 aty)
% Number of variables : 38 ( 0 sgn 24 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/tmp/tmpdeHvfg/sel_SWV041+1.p_1',leq_gt1) ).
fof(17,axiom,
! [X1] : ~ gt(X1,X1),
file('/tmp/tmpdeHvfg/sel_SWV041+1.p_1',irreflexivity_gt) ).
fof(21,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/tmp/tmpdeHvfg/sel_SWV041+1.p_1',pred_minus_1) ).
fof(25,axiom,
! [X1,X2] :
( leq(X1,pred(X2))
<=> gt(X2,X1) ),
file('/tmp/tmpdeHvfg/sel_SWV041+1.p_1',leq_gt_pred) ).
fof(59,conjecture,
( ( geq(minus(n330,n1),n0)
& geq(minus(n410,n1),n0) )
=> ! [X11] :
( ( leq(n0,X11)
& leq(X11,n2) )
=> ! [X12] :
( ( leq(n0,X12)
& leq(X12,minus(n0,n1)) )
=> a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X12,X11) = init ) ) ),
file('/tmp/tmpdeHvfg/sel_SWV041+1.p_1',gauss_init_0077) ).
fof(67,axiom,
! [X1] :
( ( leq(n0,X1)
& leq(X1,n0) )
=> X1 = n0 ),
file('/tmp/tmpdeHvfg/sel_SWV041+1.p_1',finite_domain_0) ).
fof(79,negated_conjecture,
~ ( ( geq(minus(n330,n1),n0)
& geq(minus(n410,n1),n0) )
=> ! [X11] :
( ( leq(n0,X11)
& leq(X11,n2) )
=> ! [X12] :
( ( leq(n0,X12)
& leq(X12,minus(n0,n1)) )
=> a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X12,X11) = init ) ) ),
inference(assume_negation,[status(cth)],[59]) ).
fof(80,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[17,theory(equality)]) ).
fof(95,plain,
! [X1,X2] :
( ~ gt(X2,X1)
| leq(X1,X2) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(96,plain,
! [X3,X4] :
( ~ gt(X4,X3)
| leq(X3,X4) ),
inference(variable_rename,[status(thm)],[95]) ).
cnf(97,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
inference(split_conjunct,[status(thm)],[96]) ).
fof(119,plain,
! [X2] : ~ gt(X2,X2),
inference(variable_rename,[status(thm)],[80]) ).
cnf(120,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[119]) ).
fof(127,plain,
! [X2] : minus(X2,n1) = pred(X2),
inference(variable_rename,[status(thm)],[21]) ).
cnf(128,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[127]) ).
fof(138,plain,
! [X1,X2] :
( ( ~ leq(X1,pred(X2))
| gt(X2,X1) )
& ( ~ gt(X2,X1)
| leq(X1,pred(X2)) ) ),
inference(fof_nnf,[status(thm)],[25]) ).
fof(139,plain,
! [X3,X4] :
( ( ~ leq(X3,pred(X4))
| gt(X4,X3) )
& ( ~ gt(X4,X3)
| leq(X3,pred(X4)) ) ),
inference(variable_rename,[status(thm)],[138]) ).
cnf(141,plain,
( gt(X1,X2)
| ~ leq(X2,pred(X1)) ),
inference(split_conjunct,[status(thm)],[139]) ).
fof(186,negated_conjecture,
( geq(minus(n330,n1),n0)
& geq(minus(n410,n1),n0)
& ? [X11] :
( leq(n0,X11)
& leq(X11,n2)
& ? [X12] :
( leq(n0,X12)
& leq(X12,minus(n0,n1))
& a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X12,X11) != init ) ) ),
inference(fof_nnf,[status(thm)],[79]) ).
fof(187,negated_conjecture,
( geq(minus(n330,n1),n0)
& geq(minus(n410,n1),n0)
& ? [X13] :
( leq(n0,X13)
& leq(X13,n2)
& ? [X14] :
( leq(n0,X14)
& leq(X14,minus(n0,n1))
& a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X14,X13) != init ) ) ),
inference(variable_rename,[status(thm)],[186]) ).
fof(188,negated_conjecture,
( geq(minus(n330,n1),n0)
& geq(minus(n410,n1),n0)
& leq(n0,esk1_0)
& leq(esk1_0,n2)
& leq(n0,esk2_0)
& leq(esk2_0,minus(n0,n1))
& a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),esk2_0,esk1_0) != init ),
inference(skolemize,[status(esa)],[187]) ).
cnf(190,negated_conjecture,
leq(esk2_0,minus(n0,n1)),
inference(split_conjunct,[status(thm)],[188]) ).
cnf(191,negated_conjecture,
leq(n0,esk2_0),
inference(split_conjunct,[status(thm)],[188]) ).
fof(207,plain,
! [X1] :
( ~ leq(n0,X1)
| ~ leq(X1,n0)
| X1 = n0 ),
inference(fof_nnf,[status(thm)],[67]) ).
fof(208,plain,
! [X2] :
( ~ leq(n0,X2)
| ~ leq(X2,n0)
| X2 = n0 ),
inference(variable_rename,[status(thm)],[207]) ).
cnf(209,plain,
( X1 = n0
| ~ leq(X1,n0)
| ~ leq(n0,X1) ),
inference(split_conjunct,[status(thm)],[208]) ).
cnf(251,plain,
( gt(X1,X2)
| ~ leq(X2,minus(X1,n1)) ),
inference(rw,[status(thm)],[141,128,theory(equality)]),
[unfolding] ).
cnf(256,plain,
( n0 = X1
| ~ leq(n0,X1)
| ~ gt(n0,X1) ),
inference(spm,[status(thm)],[209,97,theory(equality)]) ).
cnf(288,negated_conjecture,
gt(n0,esk2_0),
inference(spm,[status(thm)],[251,190,theory(equality)]) ).
cnf(597,negated_conjecture,
( n0 = esk2_0
| ~ gt(n0,esk2_0) ),
inference(spm,[status(thm)],[256,191,theory(equality)]) ).
cnf(606,negated_conjecture,
( n0 = esk2_0
| $false ),
inference(rw,[status(thm)],[597,288,theory(equality)]) ).
cnf(607,negated_conjecture,
n0 = esk2_0,
inference(cn,[status(thm)],[606,theory(equality)]) ).
cnf(614,negated_conjecture,
gt(n0,n0),
inference(rw,[status(thm)],[288,607,theory(equality)]) ).
cnf(615,negated_conjecture,
$false,
inference(sr,[status(thm)],[614,120,theory(equality)]) ).
cnf(616,negated_conjecture,
$false,
615,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV041+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpdeHvfg/sel_SWV041+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV041+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV041+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV041+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
%
%------------------------------------------------------------------------------