TSTP Solution File: SWV174+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV174+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:21:41 EST 2010
% Result : Theorem 0.45s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 7
% Syntax : Number of formulae : 55 ( 17 unt; 0 def)
% Number of atoms : 217 ( 33 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 245 ( 83 ~; 87 |; 59 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-3 aty)
% Number of variables : 76 ( 0 sgn 50 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1,X2] :
( ( leq(X1,X2)
& X1 != X2 )
=> gt(X2,X1) ),
file('/tmp/tmpDgXIb4/sel_SWV174+1.p_1',leq_gt2) ).
fof(5,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/tmp/tmpDgXIb4/sel_SWV174+1.p_1',leq_gt1) ).
fof(14,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/tmp/tmpDgXIb4/sel_SWV174+1.p_1',succ_plus_1_r) ).
fof(16,axiom,
! [X1] : gt(succ(X1),X1),
file('/tmp/tmpDgXIb4/sel_SWV174+1.p_1',gt_succ) ).
fof(21,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> gt(succ(X2),X1) ),
file('/tmp/tmpDgXIb4/sel_SWV174+1.p_1',leq_succ_gt_equiv) ).
fof(22,axiom,
! [X1,X2] :
( leq(X1,pred(X2))
<=> gt(X2,X1) ),
file('/tmp/tmpDgXIb4/sel_SWV174+1.p_1',leq_gt_pred) ).
fof(39,conjecture,
( ( leq(n0,pv10)
& leq(pv10,n135299)
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,pred(pv10)) )
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select3(q_init,X4,X5) = init ) )
& ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select3(center_init,X6,n0) = init ) )
=> ! [X7,X8] :
( ( leq(n0,X7)
& leq(n0,X8)
& leq(X7,n135299)
& leq(X8,n4) )
=> ( gt(pv10,X7)
=> a_select3(q_init,X7,X8) = init ) ) ),
file('/tmp/tmpDgXIb4/sel_SWV174+1.p_1',cl5_nebula_init_0046) ).
fof(67,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(pv10,n135299)
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,pred(pv10)) )
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select3(q_init,X4,X5) = init ) )
& ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select3(center_init,X6,n0) = init ) )
=> ! [X7,X8] :
( ( leq(n0,X7)
& leq(n0,X8)
& leq(X7,n135299)
& leq(X8,n4) )
=> ( gt(pv10,X7)
=> a_select3(q_init,X7,X8) = init ) ) ),
inference(assume_negation,[status(cth)],[39]) ).
fof(77,plain,
! [X1,X2] :
( ~ leq(X1,X2)
| X1 = X2
| gt(X2,X1) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(78,plain,
! [X3,X4] :
( ~ leq(X3,X4)
| X3 = X4
| gt(X4,X3) ),
inference(variable_rename,[status(thm)],[77]) ).
cnf(79,plain,
( gt(X1,X2)
| X2 = X1
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[78]) ).
fof(80,plain,
! [X1,X2] :
( ~ gt(X2,X1)
| leq(X1,X2) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(81,plain,
! [X3,X4] :
( ~ gt(X4,X3)
| leq(X3,X4) ),
inference(variable_rename,[status(thm)],[80]) ).
cnf(82,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
inference(split_conjunct,[status(thm)],[81]) ).
fof(100,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[14]) ).
cnf(101,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[100]) ).
fof(104,plain,
! [X2] : gt(succ(X2),X2),
inference(variable_rename,[status(thm)],[16]) ).
cnf(105,plain,
gt(succ(X1),X1),
inference(split_conjunct,[status(thm)],[104]) ).
fof(114,plain,
! [X1,X2] :
( ( ~ leq(X1,X2)
| gt(succ(X2),X1) )
& ( ~ gt(succ(X2),X1)
| leq(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(115,plain,
! [X3,X4] :
( ( ~ leq(X3,X4)
| gt(succ(X4),X3) )
& ( ~ gt(succ(X4),X3)
| leq(X3,X4) ) ),
inference(variable_rename,[status(thm)],[114]) ).
cnf(116,plain,
( leq(X1,X2)
| ~ gt(succ(X2),X1) ),
inference(split_conjunct,[status(thm)],[115]) ).
fof(118,plain,
! [X1,X2] :
( ( ~ leq(X1,pred(X2))
| gt(X2,X1) )
& ( ~ gt(X2,X1)
| leq(X1,pred(X2)) ) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(119,plain,
! [X3,X4] :
( ( ~ leq(X3,pred(X4))
| gt(X4,X3) )
& ( ~ gt(X4,X3)
| leq(X3,pred(X4)) ) ),
inference(variable_rename,[status(thm)],[118]) ).
cnf(120,plain,
( leq(X1,pred(X2))
| ~ gt(X2,X1) ),
inference(split_conjunct,[status(thm)],[119]) ).
fof(144,negated_conjecture,
( leq(n0,pv10)
& leq(pv10,n135299)
& ! [X4] :
( ~ leq(n0,X4)
| ~ leq(X4,pred(pv10))
| ! [X5] :
( ~ leq(n0,X5)
| ~ leq(X5,n4)
| a_select3(q_init,X4,X5) = init ) )
& ! [X6] :
( ~ leq(n0,X6)
| ~ leq(X6,n4)
| a_select3(center_init,X6,n0) = init )
& ? [X7,X8] :
( leq(n0,X7)
& leq(n0,X8)
& leq(X7,n135299)
& leq(X8,n4)
& gt(pv10,X7)
& a_select3(q_init,X7,X8) != init ) ),
inference(fof_nnf,[status(thm)],[67]) ).
fof(145,negated_conjecture,
( leq(n0,pv10)
& leq(pv10,n135299)
& ! [X9] :
( ~ leq(n0,X9)
| ~ leq(X9,pred(pv10))
| ! [X10] :
( ~ leq(n0,X10)
| ~ leq(X10,n4)
| a_select3(q_init,X9,X10) = init ) )
& ! [X11] :
( ~ leq(n0,X11)
| ~ leq(X11,n4)
| a_select3(center_init,X11,n0) = init )
& ? [X12,X13] :
( leq(n0,X12)
& leq(n0,X13)
& leq(X12,n135299)
& leq(X13,n4)
& gt(pv10,X12)
& a_select3(q_init,X12,X13) != init ) ),
inference(variable_rename,[status(thm)],[144]) ).
fof(146,negated_conjecture,
( leq(n0,pv10)
& leq(pv10,n135299)
& ! [X9] :
( ~ leq(n0,X9)
| ~ leq(X9,pred(pv10))
| ! [X10] :
( ~ leq(n0,X10)
| ~ leq(X10,n4)
| a_select3(q_init,X9,X10) = init ) )
& ! [X11] :
( ~ leq(n0,X11)
| ~ leq(X11,n4)
| a_select3(center_init,X11,n0) = init )
& leq(n0,esk1_0)
& leq(n0,esk2_0)
& leq(esk1_0,n135299)
& leq(esk2_0,n4)
& gt(pv10,esk1_0)
& a_select3(q_init,esk1_0,esk2_0) != init ),
inference(skolemize,[status(esa)],[145]) ).
fof(147,negated_conjecture,
! [X9,X10,X11] :
( ( ~ leq(n0,X11)
| ~ leq(X11,n4)
| a_select3(center_init,X11,n0) = init )
& ( ~ leq(n0,X10)
| ~ leq(X10,n4)
| a_select3(q_init,X9,X10) = init
| ~ leq(n0,X9)
| ~ leq(X9,pred(pv10)) )
& leq(n0,pv10)
& leq(pv10,n135299)
& leq(n0,esk1_0)
& leq(n0,esk2_0)
& leq(esk1_0,n135299)
& leq(esk2_0,n4)
& gt(pv10,esk1_0)
& a_select3(q_init,esk1_0,esk2_0) != init ),
inference(shift_quantors,[status(thm)],[146]) ).
cnf(148,negated_conjecture,
a_select3(q_init,esk1_0,esk2_0) != init,
inference(split_conjunct,[status(thm)],[147]) ).
cnf(149,negated_conjecture,
gt(pv10,esk1_0),
inference(split_conjunct,[status(thm)],[147]) ).
cnf(150,negated_conjecture,
leq(esk2_0,n4),
inference(split_conjunct,[status(thm)],[147]) ).
cnf(152,negated_conjecture,
leq(n0,esk2_0),
inference(split_conjunct,[status(thm)],[147]) ).
cnf(153,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[147]) ).
cnf(156,negated_conjecture,
( a_select3(q_init,X1,X2) = init
| ~ leq(X1,pred(pv10))
| ~ leq(n0,X1)
| ~ leq(X2,n4)
| ~ leq(n0,X2) ),
inference(split_conjunct,[status(thm)],[147]) ).
cnf(203,plain,
gt(plus(X1,n1),X1),
inference(rw,[status(thm)],[105,101,theory(equality)]),
[unfolding] ).
cnf(215,plain,
( leq(X1,X2)
| ~ gt(plus(X2,n1),X1) ),
inference(rw,[status(thm)],[116,101,theory(equality)]),
[unfolding] ).
cnf(239,plain,
( pred(X1) = X2
| gt(pred(X1),X2)
| ~ gt(X1,X2) ),
inference(spm,[status(thm)],[79,120,theory(equality)]) ).
cnf(301,plain,
leq(X1,X1),
inference(spm,[status(thm)],[215,203,theory(equality)]) ).
cnf(349,negated_conjecture,
( a_select3(q_init,X1,X2) = init
| ~ leq(X2,n4)
| ~ leq(n0,X2)
| ~ leq(n0,X1)
| ~ gt(pred(pv10),X1) ),
inference(spm,[status(thm)],[156,82,theory(equality)]) ).
cnf(4806,negated_conjecture,
( ~ gt(pred(pv10),esk1_0)
| ~ leq(esk2_0,n4)
| ~ leq(n0,esk2_0)
| ~ leq(n0,esk1_0) ),
inference(spm,[status(thm)],[148,349,theory(equality)]) ).
cnf(4807,negated_conjecture,
( ~ gt(pred(pv10),esk1_0)
| $false
| ~ leq(n0,esk2_0)
| ~ leq(n0,esk1_0) ),
inference(rw,[status(thm)],[4806,150,theory(equality)]) ).
cnf(4808,negated_conjecture,
( ~ gt(pred(pv10),esk1_0)
| $false
| $false
| ~ leq(n0,esk1_0) ),
inference(rw,[status(thm)],[4807,152,theory(equality)]) ).
cnf(4809,negated_conjecture,
( ~ gt(pred(pv10),esk1_0)
| $false
| $false
| $false ),
inference(rw,[status(thm)],[4808,153,theory(equality)]) ).
cnf(4810,negated_conjecture,
~ gt(pred(pv10),esk1_0),
inference(cn,[status(thm)],[4809,theory(equality)]) ).
cnf(4813,negated_conjecture,
( pred(pv10) = esk1_0
| ~ gt(pv10,esk1_0) ),
inference(spm,[status(thm)],[4810,239,theory(equality)]) ).
cnf(4816,negated_conjecture,
( pred(pv10) = esk1_0
| $false ),
inference(rw,[status(thm)],[4813,149,theory(equality)]) ).
cnf(4817,negated_conjecture,
pred(pv10) = esk1_0,
inference(cn,[status(thm)],[4816,theory(equality)]) ).
cnf(4857,negated_conjecture,
( a_select3(q_init,X1,X2) = init
| ~ leq(X1,esk1_0)
| ~ leq(X2,n4)
| ~ leq(n0,X2)
| ~ leq(n0,X1) ),
inference(rw,[status(thm)],[156,4817,theory(equality)]) ).
cnf(5028,negated_conjecture,
( ~ leq(esk1_0,esk1_0)
| ~ leq(esk2_0,n4)
| ~ leq(n0,esk2_0)
| ~ leq(n0,esk1_0) ),
inference(spm,[status(thm)],[148,4857,theory(equality)]) ).
cnf(5029,negated_conjecture,
( $false
| ~ leq(esk2_0,n4)
| ~ leq(n0,esk2_0)
| ~ leq(n0,esk1_0) ),
inference(rw,[status(thm)],[5028,301,theory(equality)]) ).
cnf(5030,negated_conjecture,
( $false
| $false
| ~ leq(n0,esk2_0)
| ~ leq(n0,esk1_0) ),
inference(rw,[status(thm)],[5029,150,theory(equality)]) ).
cnf(5031,negated_conjecture,
( $false
| $false
| $false
| ~ leq(n0,esk1_0) ),
inference(rw,[status(thm)],[5030,152,theory(equality)]) ).
cnf(5032,negated_conjecture,
( $false
| $false
| $false
| $false ),
inference(rw,[status(thm)],[5031,153,theory(equality)]) ).
cnf(5033,negated_conjecture,
$false,
inference(cn,[status(thm)],[5032,theory(equality)]) ).
cnf(5034,negated_conjecture,
$false,
5033,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV174+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpDgXIb4/sel_SWV174+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV174+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV174+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV174+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
%
%------------------------------------------------------------------------------