TSTP Solution File: SWV055+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV055+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:03:41 EST 2010
% Result : Theorem 201.77s
% Output : CNFRefutation 201.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 36
% Number of leaves : 26
% Syntax : Number of formulae : 219 ( 100 unt; 0 def)
% Number of atoms : 524 ( 139 equ)
% Maximal formula atoms : 41 ( 2 avg)
% Number of connectives : 490 ( 185 ~; 227 |; 63 &)
% ( 3 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 3 avg)
% Maximal term depth : 7 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 26 ( 26 usr; 16 con; 0-3 aty)
% Number of variables : 199 ( 2 sgn 94 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] : plus(n4,X1) = succ(succ(succ(succ(X1)))),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',succ_plus_4_l) ).
fof(2,axiom,
! [X1,X2] :
( leq(X1,X2)
=> leq(X1,succ(X2)) ),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',leq_succ) ).
fof(4,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',transitivity_leq) ).
fof(5,axiom,
! [X1,X2] :
( ( leq(X1,X2)
& X1 != X2 )
=> gt(X2,X1) ),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',leq_gt2) ).
fof(6,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',leq_gt1) ).
fof(7,axiom,
! [X1] : plus(X1,n3) = succ(succ(succ(X1))),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',succ_plus_3_r) ).
fof(10,axiom,
! [X1] : plus(X1,n4) = succ(succ(succ(succ(X1)))),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',succ_plus_4_r) ).
fof(14,axiom,
! [X1,X2] :
( leq(succ(X1),succ(X2))
<=> leq(X1,X2) ),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',leq_succ_succ) ).
fof(15,axiom,
! [X1] : plus(n3,X1) = succ(succ(succ(X1))),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',succ_plus_3_l) ).
fof(16,axiom,
succ(tptp_minus_1) = n0,
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',succ_tptp_minus_1) ).
fof(17,axiom,
! [X1] : plus(X1,n2) = succ(succ(X1)),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',succ_plus_2_r) ).
fof(18,axiom,
! [X1,X2] :
( gt(X1,X2)
| gt(X2,X1)
| X1 = X2 ),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',totality) ).
fof(20,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',succ_plus_1_r) ).
fof(21,axiom,
! [X1] : ~ gt(X1,X1),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',irreflexivity_gt) ).
fof(22,axiom,
! [X1] : gt(succ(X1),X1),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',gt_succ) ).
fof(25,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',pred_minus_1) ).
fof(26,axiom,
! [X1] : plus(n1,X1) = succ(X1),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',succ_plus_1_l) ).
fof(27,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> gt(succ(X2),X1) ),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',leq_succ_gt_equiv) ).
fof(28,axiom,
! [X1,X2] :
( leq(X1,pred(X2))
<=> gt(X2,X1) ),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',leq_gt_pred) ).
fof(30,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',pred_succ) ).
fof(49,conjecture,
( ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X10,X11] :
( ( leq(n0,X10)
& leq(X10,minus(pv10,n1)) )
=> sum(n0,minus(n5,n1),a_select3(q,X10,X11)) = n1 ) )
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X12,X13] :
( ( leq(n0,X12)
& leq(X12,minus(n0,n1)) )
=> a_select3(q,pv10,X12) = divide(sqrt(times(minus(a_select3(center,X12,n0),a_select2(x,pv10)),minus(a_select3(center,X12,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X13,n0),a_select2(x,pv10)),minus(a_select3(center,X13,n0),a_select2(x,pv10)))))) )
& ! [X14,X15] :
( ( leq(n0,X14)
& leq(X14,minus(pv10,n1)) )
=> sum(n0,minus(n5,n1),a_select3(q,X14,X15)) = n1 ) ) ),
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',cl5_nebula_norm_0037) ).
fof(64,axiom,
succ(succ(n0)) = n2,
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',successor_2) ).
fof(65,axiom,
succ(succ(succ(succ(n0)))) = n4,
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',successor_4) ).
fof(66,axiom,
succ(succ(succ(succ(succ(n0))))) = n5,
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',successor_5) ).
fof(67,axiom,
succ(n0) = n1,
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',successor_1) ).
fof(69,axiom,
succ(succ(succ(n0))) = n3,
file('/tmp/tmpSBevsj/sel_SWV055+1.p_4',successor_3) ).
fof(73,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X10,X11] :
( ( leq(n0,X10)
& leq(X10,minus(pv10,n1)) )
=> sum(n0,minus(n5,n1),a_select3(q,X10,X11)) = n1 ) )
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X12,X13] :
( ( leq(n0,X12)
& leq(X12,minus(n0,n1)) )
=> a_select3(q,pv10,X12) = divide(sqrt(times(minus(a_select3(center,X12,n0),a_select2(x,pv10)),minus(a_select3(center,X12,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X13,n0),a_select2(x,pv10)),minus(a_select3(center,X13,n0),a_select2(x,pv10)))))) )
& ! [X14,X15] :
( ( leq(n0,X14)
& leq(X14,minus(pv10,n1)) )
=> sum(n0,minus(n5,n1),a_select3(q,X14,X15)) = n1 ) ) ),
inference(assume_negation,[status(cth)],[49]) ).
fof(74,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[21,theory(equality)]) ).
fof(75,plain,
! [X2] : plus(n4,X2) = succ(succ(succ(succ(X2)))),
inference(variable_rename,[status(thm)],[1]) ).
cnf(76,plain,
plus(n4,X1) = succ(succ(succ(succ(X1)))),
inference(split_conjunct,[status(thm)],[75]) ).
fof(77,plain,
! [X1,X2] :
( ~ leq(X1,X2)
| leq(X1,succ(X2)) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(78,plain,
! [X3,X4] :
( ~ leq(X3,X4)
| leq(X3,succ(X4)) ),
inference(variable_rename,[status(thm)],[77]) ).
cnf(79,plain,
( leq(X1,succ(X2))
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[78]) ).
fof(83,plain,
! [X1,X2,X3] :
( ~ leq(X1,X2)
| ~ leq(X2,X3)
| leq(X1,X3) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(84,plain,
! [X4,X5,X6] :
( ~ leq(X4,X5)
| ~ leq(X5,X6)
| leq(X4,X6) ),
inference(variable_rename,[status(thm)],[83]) ).
cnf(85,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[84]) ).
fof(86,plain,
! [X1,X2] :
( ~ leq(X1,X2)
| X1 = X2
| gt(X2,X1) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(87,plain,
! [X3,X4] :
( ~ leq(X3,X4)
| X3 = X4
| gt(X4,X3) ),
inference(variable_rename,[status(thm)],[86]) ).
cnf(88,plain,
( gt(X1,X2)
| X2 = X1
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[87]) ).
fof(89,plain,
! [X1,X2] :
( ~ gt(X2,X1)
| leq(X1,X2) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(90,plain,
! [X3,X4] :
( ~ gt(X4,X3)
| leq(X3,X4) ),
inference(variable_rename,[status(thm)],[89]) ).
cnf(91,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
inference(split_conjunct,[status(thm)],[90]) ).
fof(92,plain,
! [X2] : plus(X2,n3) = succ(succ(succ(X2))),
inference(variable_rename,[status(thm)],[7]) ).
cnf(93,plain,
plus(X1,n3) = succ(succ(succ(X1))),
inference(split_conjunct,[status(thm)],[92]) ).
fof(104,plain,
! [X2] : plus(X2,n4) = succ(succ(succ(succ(X2)))),
inference(variable_rename,[status(thm)],[10]) ).
cnf(105,plain,
plus(X1,n4) = succ(succ(succ(succ(X1)))),
inference(split_conjunct,[status(thm)],[104]) ).
fof(112,plain,
! [X1,X2] :
( ( ~ leq(succ(X1),succ(X2))
| leq(X1,X2) )
& ( ~ leq(X1,X2)
| leq(succ(X1),succ(X2)) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(113,plain,
! [X3,X4] :
( ( ~ leq(succ(X3),succ(X4))
| leq(X3,X4) )
& ( ~ leq(X3,X4)
| leq(succ(X3),succ(X4)) ) ),
inference(variable_rename,[status(thm)],[112]) ).
cnf(114,plain,
( leq(succ(X1),succ(X2))
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[113]) ).
fof(116,plain,
! [X2] : plus(n3,X2) = succ(succ(succ(X2))),
inference(variable_rename,[status(thm)],[15]) ).
cnf(117,plain,
plus(n3,X1) = succ(succ(succ(X1))),
inference(split_conjunct,[status(thm)],[116]) ).
cnf(118,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[16]) ).
fof(119,plain,
! [X2] : plus(X2,n2) = succ(succ(X2)),
inference(variable_rename,[status(thm)],[17]) ).
cnf(120,plain,
plus(X1,n2) = succ(succ(X1)),
inference(split_conjunct,[status(thm)],[119]) ).
fof(121,plain,
! [X3,X4] :
( gt(X3,X4)
| gt(X4,X3)
| X3 = X4 ),
inference(variable_rename,[status(thm)],[18]) ).
cnf(122,plain,
( X1 = X2
| gt(X2,X1)
| gt(X1,X2) ),
inference(split_conjunct,[status(thm)],[121]) ).
fof(125,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[20]) ).
cnf(126,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[125]) ).
fof(127,plain,
! [X2] : ~ gt(X2,X2),
inference(variable_rename,[status(thm)],[74]) ).
cnf(128,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[127]) ).
fof(129,plain,
! [X2] : gt(succ(X2),X2),
inference(variable_rename,[status(thm)],[22]) ).
cnf(130,plain,
gt(succ(X1),X1),
inference(split_conjunct,[status(thm)],[129]) ).
fof(135,plain,
! [X2] : minus(X2,n1) = pred(X2),
inference(variable_rename,[status(thm)],[25]) ).
cnf(136,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[135]) ).
fof(137,plain,
! [X2] : plus(n1,X2) = succ(X2),
inference(variable_rename,[status(thm)],[26]) ).
cnf(138,plain,
plus(n1,X1) = succ(X1),
inference(split_conjunct,[status(thm)],[137]) ).
fof(139,plain,
! [X1,X2] :
( ( ~ leq(X1,X2)
| gt(succ(X2),X1) )
& ( ~ gt(succ(X2),X1)
| leq(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[27]) ).
fof(140,plain,
! [X3,X4] :
( ( ~ leq(X3,X4)
| gt(succ(X4),X3) )
& ( ~ gt(succ(X4),X3)
| leq(X3,X4) ) ),
inference(variable_rename,[status(thm)],[139]) ).
cnf(141,plain,
( leq(X1,X2)
| ~ gt(succ(X2),X1) ),
inference(split_conjunct,[status(thm)],[140]) ).
cnf(142,plain,
( gt(succ(X1),X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[140]) ).
fof(143,plain,
! [X1,X2] :
( ( ~ leq(X1,pred(X2))
| gt(X2,X1) )
& ( ~ gt(X2,X1)
| leq(X1,pred(X2)) ) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(144,plain,
! [X3,X4] :
( ( ~ leq(X3,pred(X4))
| gt(X4,X3) )
& ( ~ gt(X4,X3)
| leq(X3,pred(X4)) ) ),
inference(variable_rename,[status(thm)],[143]) ).
cnf(145,plain,
( leq(X1,pred(X2))
| ~ gt(X2,X1) ),
inference(split_conjunct,[status(thm)],[144]) ).
fof(150,plain,
! [X2] : pred(succ(X2)) = X2,
inference(variable_rename,[status(thm)],[30]) ).
cnf(151,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[150]) ).
fof(173,negated_conjecture,
( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X10,X11] :
( ~ leq(n0,X10)
| ~ leq(X10,minus(pv10,n1))
| sum(n0,minus(n5,n1),a_select3(q,X10,X11)) = n1 )
& ( ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1))
| ? [X12,X13] :
( leq(n0,X12)
& leq(X12,minus(n0,n1))
& a_select3(q,pv10,X12) != divide(sqrt(times(minus(a_select3(center,X12,n0),a_select2(x,pv10)),minus(a_select3(center,X12,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X13,n0),a_select2(x,pv10)),minus(a_select3(center,X13,n0),a_select2(x,pv10)))))) )
| ? [X14,X15] :
( leq(n0,X14)
& leq(X14,minus(pv10,n1))
& sum(n0,minus(n5,n1),a_select3(q,X14,X15)) != n1 ) ) ),
inference(fof_nnf,[status(thm)],[73]) ).
fof(174,negated_conjecture,
( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X16,X17] :
( ~ leq(n0,X16)
| ~ leq(X16,minus(pv10,n1))
| sum(n0,minus(n5,n1),a_select3(q,X16,X17)) = n1 )
& ( ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1))
| ? [X18,X19] :
( leq(n0,X18)
& leq(X18,minus(n0,n1))
& a_select3(q,pv10,X18) != divide(sqrt(times(minus(a_select3(center,X18,n0),a_select2(x,pv10)),minus(a_select3(center,X18,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X19,n0),a_select2(x,pv10)),minus(a_select3(center,X19,n0),a_select2(x,pv10)))))) )
| ? [X20,X21] :
( leq(n0,X20)
& leq(X20,minus(pv10,n1))
& sum(n0,minus(n5,n1),a_select3(q,X20,X21)) != n1 ) ) ),
inference(variable_rename,[status(thm)],[173]) ).
fof(175,negated_conjecture,
( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X16,X17] :
( ~ leq(n0,X16)
| ~ leq(X16,minus(pv10,n1))
| sum(n0,minus(n5,n1),a_select3(q,X16,X17)) = n1 )
& ( ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1))
| ( leq(n0,esk2_0)
& leq(esk2_0,minus(n0,n1))
& a_select3(q,pv10,esk2_0) != divide(sqrt(times(minus(a_select3(center,esk2_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk2_0,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,esk3_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk3_0,n0),a_select2(x,pv10)))))) )
| ( leq(n0,esk4_0)
& leq(esk4_0,minus(pv10,n1))
& sum(n0,minus(n5,n1),a_select3(q,esk4_0,esk5_0)) != n1 ) ) ),
inference(skolemize,[status(esa)],[174]) ).
fof(176,negated_conjecture,
! [X16,X17] :
( ( ~ leq(n0,X16)
| ~ leq(X16,minus(pv10,n1))
| sum(n0,minus(n5,n1),a_select3(q,X16,X17)) = n1 )
& leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ( ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1))
| ( leq(n0,esk2_0)
& leq(esk2_0,minus(n0,n1))
& a_select3(q,pv10,esk2_0) != divide(sqrt(times(minus(a_select3(center,esk2_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk2_0,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,esk3_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk3_0,n0),a_select2(x,pv10)))))) )
| ( leq(n0,esk4_0)
& leq(esk4_0,minus(pv10,n1))
& sum(n0,minus(n5,n1),a_select3(q,esk4_0,esk5_0)) != n1 ) ) ),
inference(shift_quantors,[status(thm)],[175]) ).
fof(177,negated_conjecture,
! [X16,X17] :
( ( ~ leq(n0,X16)
| ~ leq(X16,minus(pv10,n1))
| sum(n0,minus(n5,n1),a_select3(q,X16,X17)) = n1 )
& leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ( leq(n0,esk4_0)
| leq(n0,esk2_0)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( leq(esk4_0,minus(pv10,n1))
| leq(n0,esk2_0)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( sum(n0,minus(n5,n1),a_select3(q,esk4_0,esk5_0)) != n1
| leq(n0,esk2_0)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( leq(n0,esk4_0)
| leq(esk2_0,minus(n0,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( leq(esk4_0,minus(pv10,n1))
| leq(esk2_0,minus(n0,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( sum(n0,minus(n5,n1),a_select3(q,esk4_0,esk5_0)) != n1
| leq(esk2_0,minus(n0,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( leq(n0,esk4_0)
| a_select3(q,pv10,esk2_0) != divide(sqrt(times(minus(a_select3(center,esk2_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk2_0,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,esk3_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk3_0,n0),a_select2(x,pv10))))))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( leq(esk4_0,minus(pv10,n1))
| a_select3(q,pv10,esk2_0) != divide(sqrt(times(minus(a_select3(center,esk2_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk2_0,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,esk3_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk3_0,n0),a_select2(x,pv10))))))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( sum(n0,minus(n5,n1),a_select3(q,esk4_0,esk5_0)) != n1
| a_select3(q,pv10,esk2_0) != divide(sqrt(times(minus(a_select3(center,esk2_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk2_0,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,esk3_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk3_0,n0),a_select2(x,pv10))))))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) ) ),
inference(distribute,[status(thm)],[176]) ).
cnf(181,negated_conjecture,
( leq(esk2_0,minus(n0,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| sum(n0,minus(n5,n1),a_select3(q,esk4_0,esk5_0)) != n1 ),
inference(split_conjunct,[status(thm)],[177]) ).
cnf(182,negated_conjecture,
( leq(esk2_0,minus(n0,n1))
| leq(esk4_0,minus(pv10,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(split_conjunct,[status(thm)],[177]) ).
cnf(183,negated_conjecture,
( leq(esk2_0,minus(n0,n1))
| leq(n0,esk4_0)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(split_conjunct,[status(thm)],[177]) ).
cnf(184,negated_conjecture,
( leq(n0,esk2_0)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| sum(n0,minus(n5,n1),a_select3(q,esk4_0,esk5_0)) != n1 ),
inference(split_conjunct,[status(thm)],[177]) ).
cnf(185,negated_conjecture,
( leq(n0,esk2_0)
| leq(esk4_0,minus(pv10,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(split_conjunct,[status(thm)],[177]) ).
cnf(186,negated_conjecture,
( leq(n0,esk2_0)
| leq(n0,esk4_0)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(split_conjunct,[status(thm)],[177]) ).
cnf(187,negated_conjecture,
leq(pv10,minus(n135300,n1)),
inference(split_conjunct,[status(thm)],[177]) ).
cnf(188,negated_conjecture,
leq(n0,pv10),
inference(split_conjunct,[status(thm)],[177]) ).
cnf(189,negated_conjecture,
( sum(n0,minus(n5,n1),a_select3(q,X1,X2)) = n1
| ~ leq(X1,minus(pv10,n1))
| ~ leq(n0,X1) ),
inference(split_conjunct,[status(thm)],[177]) ).
cnf(216,plain,
succ(succ(n0)) = n2,
inference(split_conjunct,[status(thm)],[64]) ).
cnf(217,plain,
succ(succ(succ(succ(n0)))) = n4,
inference(split_conjunct,[status(thm)],[65]) ).
cnf(218,plain,
succ(succ(succ(succ(succ(n0))))) = n5,
inference(split_conjunct,[status(thm)],[66]) ).
cnf(219,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[67]) ).
cnf(221,plain,
succ(succ(succ(n0))) = n3,
inference(split_conjunct,[status(thm)],[69]) ).
cnf(225,plain,
plus(n0,n1) = n1,
inference(rw,[status(thm)],[219,126,theory(equality)]),
[unfolding] ).
cnf(226,plain,
plus(tptp_minus_1,n1) = n0,
inference(rw,[status(thm)],[118,126,theory(equality)]),
[unfolding] ).
cnf(228,plain,
pred(plus(X1,n1)) = X1,
inference(rw,[status(thm)],[151,126,theory(equality)]),
[unfolding] ).
cnf(229,plain,
plus(n1,X1) = plus(X1,n1),
inference(rw,[status(thm)],[138,126,theory(equality)]),
[unfolding] ).
cnf(230,plain,
plus(plus(n0,n1),n1) = n2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[216,126,theory(equality)]),126,theory(equality)]),
[unfolding] ).
cnf(231,plain,
gt(plus(X1,n1),X1),
inference(rw,[status(thm)],[130,126,theory(equality)]),
[unfolding] ).
cnf(232,plain,
plus(X1,n2) = plus(plus(X1,n1),n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[120,126,theory(equality)]),126,theory(equality)]),
[unfolding] ).
cnf(234,plain,
plus(plus(plus(n0,n1),n1),n1) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[221,126,theory(equality)]),126,theory(equality)]),126,theory(equality)]),
[unfolding] ).
cnf(235,plain,
plus(plus(plus(X1,n1),n1),n1) = plus(X1,n3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[93,126,theory(equality)]),126,theory(equality)]),126,theory(equality)]),
[unfolding] ).
cnf(236,plain,
plus(plus(plus(X1,n1),n1),n1) = plus(n3,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[117,126,theory(equality)]),126,theory(equality)]),126,theory(equality)]),
[unfolding] ).
cnf(237,plain,
plus(plus(plus(plus(n0,n1),n1),n1),n1) = n4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[217,126,theory(equality)]),126,theory(equality)]),126,theory(equality)]),126,theory(equality)]),
[unfolding] ).
cnf(238,plain,
plus(plus(plus(plus(X1,n1),n1),n1),n1) = plus(X1,n4),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[105,126,theory(equality)]),126,theory(equality)]),126,theory(equality)]),126,theory(equality)]),
[unfolding] ).
cnf(239,plain,
plus(plus(plus(plus(X1,n1),n1),n1),n1) = plus(n4,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[76,126,theory(equality)]),126,theory(equality)]),126,theory(equality)]),126,theory(equality)]),
[unfolding] ).
cnf(240,plain,
plus(plus(plus(plus(plus(n0,n1),n1),n1),n1),n1) = n5,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[218,126,theory(equality)]),126,theory(equality)]),126,theory(equality)]),126,theory(equality)]),126,theory(equality)]),
[unfolding] ).
cnf(243,plain,
( leq(X1,X2)
| ~ gt(plus(X2,n1),X1) ),
inference(rw,[status(thm)],[141,126,theory(equality)]),
[unfolding] ).
cnf(245,plain,
( leq(X1,plus(X2,n1))
| ~ leq(X1,X2) ),
inference(rw,[status(thm)],[79,126,theory(equality)]),
[unfolding] ).
cnf(246,plain,
( gt(plus(X1,n1),X2)
| ~ leq(X2,X1) ),
inference(rw,[status(thm)],[142,126,theory(equality)]),
[unfolding] ).
cnf(248,plain,
( leq(plus(X1,n1),plus(X2,n1))
| ~ leq(X1,X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[114,126,theory(equality)]),126,theory(equality)]),
[unfolding] ).
cnf(250,plain,
minus(plus(X1,n1),n1) = X1,
inference(rw,[status(thm)],[228,136,theory(equality)]),
[unfolding] ).
cnf(252,plain,
( leq(X1,minus(X2,n1))
| ~ gt(X2,X1) ),
inference(rw,[status(thm)],[145,136,theory(equality)]),
[unfolding] ).
cnf(253,plain,
plus(n1,tptp_minus_1) = n0,
inference(rw,[status(thm)],[226,229,theory(equality)]) ).
cnf(254,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[225,229,theory(equality)]) ).
cnf(284,negated_conjecture,
( leq(n0,esk2_0)
| leq(n0,esk4_0)
| ~ leq(n0,pv10)
| $false ),
inference(rw,[status(thm)],[186,187,theory(equality)]) ).
cnf(285,negated_conjecture,
( leq(n0,esk2_0)
| leq(n0,esk4_0)
| ~ leq(n0,pv10) ),
inference(cn,[status(thm)],[284,theory(equality)]) ).
cnf(288,plain,
minus(plus(n1,X1),n1) = X1,
inference(spm,[status(thm)],[250,229,theory(equality)]) ).
cnf(297,plain,
( leq(X1,X2)
| X2 = X1
| gt(X1,X2) ),
inference(spm,[status(thm)],[91,122,theory(equality)]) ).
cnf(299,negated_conjecture,
( leq(X1,pv10)
| ~ leq(X1,n0) ),
inference(spm,[status(thm)],[85,188,theory(equality)]) ).
cnf(303,plain,
( leq(X1,plus(n1,X2))
| ~ leq(X1,X2) ),
inference(spm,[status(thm)],[245,229,theory(equality)]) ).
cnf(305,plain,
( leq(X1,plus(X2,n1))
| ~ leq(X1,X3)
| ~ leq(X3,X2) ),
inference(spm,[status(thm)],[85,245,theory(equality)]) ).
cnf(308,negated_conjecture,
( leq(n0,esk2_0)
| leq(esk4_0,minus(pv10,n1))
| ~ leq(n0,pv10)
| $false ),
inference(rw,[status(thm)],[185,187,theory(equality)]) ).
cnf(309,negated_conjecture,
( leq(n0,esk2_0)
| leq(esk4_0,minus(pv10,n1))
| ~ leq(n0,pv10) ),
inference(cn,[status(thm)],[308,theory(equality)]) ).
cnf(311,negated_conjecture,
( leq(n0,esk4_0)
| leq(esk2_0,minus(n0,n1))
| ~ leq(n0,pv10)
| $false ),
inference(rw,[status(thm)],[183,187,theory(equality)]) ).
cnf(312,negated_conjecture,
( leq(n0,esk4_0)
| leq(esk2_0,minus(n0,n1))
| ~ leq(n0,pv10) ),
inference(cn,[status(thm)],[311,theory(equality)]) ).
cnf(314,plain,
plus(n1,plus(n1,n0)) = n2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[230,229,theory(equality)]),229,theory(equality)]) ).
cnf(324,plain,
~ leq(plus(X1,n1),X1),
inference(spm,[status(thm)],[128,246,theory(equality)]) ).
cnf(326,plain,
leq(X1,X1),
inference(spm,[status(thm)],[243,231,theory(equality)]) ).
cnf(328,plain,
( leq(X1,X2)
| ~ gt(plus(n1,X2),X1) ),
inference(spm,[status(thm)],[243,229,theory(equality)]) ).
cnf(331,plain,
( leq(X1,X2)
| plus(X2,n1) = X1
| ~ leq(X1,plus(X2,n1)) ),
inference(spm,[status(thm)],[243,88,theory(equality)]) ).
cnf(339,negated_conjecture,
( leq(esk2_0,minus(n0,n1))
| leq(esk4_0,minus(pv10,n1))
| ~ leq(n0,pv10)
| $false ),
inference(rw,[status(thm)],[182,187,theory(equality)]) ).
cnf(340,negated_conjecture,
( leq(esk2_0,minus(n0,n1))
| leq(esk4_0,minus(pv10,n1))
| ~ leq(n0,pv10) ),
inference(cn,[status(thm)],[339,theory(equality)]) ).
cnf(343,plain,
plus(n1,n2) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[234,229,theory(equality)]),229,theory(equality)]),314,theory(equality)]),229,theory(equality)]) ).
cnf(344,plain,
( leq(plus(n1,n1),plus(X1,n1))
| ~ leq(n1,X1) ),
inference(spm,[status(thm)],[248,229,theory(equality)]) ).
cnf(346,plain,
( leq(plus(n1,X1),plus(X2,n1))
| ~ leq(X1,X2) ),
inference(spm,[status(thm)],[248,229,theory(equality)]) ).
cnf(347,plain,
( leq(plus(X1,n1),plus(n1,X2))
| ~ leq(X1,X2) ),
inference(spm,[status(thm)],[248,229,theory(equality)]) ).
cnf(350,plain,
plus(n1,plus(X1,n1)) = plus(X1,n2),
inference(rw,[status(thm)],[232,229,theory(equality)]) ).
cnf(421,negated_conjecture,
( leq(n0,esk2_0)
| sum(n0,minus(n5,n1),a_select3(q,esk4_0,esk5_0)) != n1
| ~ leq(n0,pv10)
| $false ),
inference(rw,[status(thm)],[184,187,theory(equality)]) ).
cnf(422,negated_conjecture,
( leq(n0,esk2_0)
| sum(n0,minus(n5,n1),a_select3(q,esk4_0,esk5_0)) != n1
| ~ leq(n0,pv10) ),
inference(cn,[status(thm)],[421,theory(equality)]) ).
cnf(424,negated_conjecture,
( leq(esk2_0,minus(n0,n1))
| sum(n0,minus(n5,n1),a_select3(q,esk4_0,esk5_0)) != n1
| ~ leq(n0,pv10)
| $false ),
inference(rw,[status(thm)],[181,187,theory(equality)]) ).
cnf(425,negated_conjecture,
( leq(esk2_0,minus(n0,n1))
| sum(n0,minus(n5,n1),a_select3(q,esk4_0,esk5_0)) != n1
| ~ leq(n0,pv10) ),
inference(cn,[status(thm)],[424,theory(equality)]) ).
cnf(427,plain,
plus(n1,plus(X1,n2)) = plus(X1,n3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[235,229,theory(equality)]),350,theory(equality)]),229,theory(equality)]) ).
cnf(431,plain,
plus(X1,n3) = plus(n3,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[236,229,theory(equality)]),350,theory(equality)]),229,theory(equality)]),427,theory(equality)]) ).
cnf(445,plain,
plus(n1,n3) = n4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[237,229,theory(equality)]),229,theory(equality)]),314,theory(equality)]),229,theory(equality)]),343,theory(equality)]),431,theory(equality)]) ).
cnf(446,plain,
plus(n1,n4) = n5,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[240,229,theory(equality)]),229,theory(equality)]),314,theory(equality)]),229,theory(equality)]),343,theory(equality)]),431,theory(equality)]),445,theory(equality)]),229,theory(equality)]) ).
cnf(447,plain,
plus(n1,plus(X1,n3)) = plus(X1,n4),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[238,229,theory(equality)]),350,theory(equality)]),229,theory(equality)]),427,theory(equality)]),229,theory(equality)]) ).
cnf(451,plain,
plus(X1,n4) = plus(n4,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[239,229,theory(equality)]),350,theory(equality)]),229,theory(equality)]),427,theory(equality)]),229,theory(equality)]),447,theory(equality)]) ).
cnf(452,plain,
minus(plus(n1,n4),n1) = n4,
inference(spm,[status(thm)],[250,451,theory(equality)]) ).
cnf(465,plain,
minus(n5,n1) = n4,
inference(rw,[status(thm)],[452,446,theory(equality)]) ).
cnf(512,plain,
plus(n1,n1) = n2,
inference(rw,[status(thm)],[314,254,theory(equality)]) ).
cnf(514,plain,
~ leq(plus(n1,X1),X1),
inference(spm,[status(thm)],[324,229,theory(equality)]) ).
cnf(536,plain,
~ leq(n2,n1),
inference(spm,[status(thm)],[324,512,theory(equality)]) ).
cnf(559,plain,
~ leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[514,253,theory(equality)]) ).
cnf(681,negated_conjecture,
( sum(n0,n4,a_select3(q,X1,X2)) = n1
| ~ leq(X1,minus(pv10,n1))
| ~ leq(n0,X1) ),
inference(rw,[status(thm)],[189,465,theory(equality)]) ).
cnf(707,negated_conjecture,
~ leq(plus(pv10,n1),n0),
inference(spm,[status(thm)],[324,299,theory(equality)]) ).
cnf(715,negated_conjecture,
~ leq(plus(n1,pv10),n0),
inference(rw,[status(thm)],[707,229,theory(equality)]) ).
cnf(749,negated_conjecture,
( leq(esk2_0,minus(n0,n1))
| sum(n0,n4,a_select3(q,esk4_0,esk5_0)) != n1
| ~ leq(n0,pv10) ),
inference(rw,[status(thm)],[425,465,theory(equality)]) ).
cnf(778,negated_conjecture,
( leq(n0,esk2_0)
| sum(n0,n4,a_select3(q,esk4_0,esk5_0)) != n1
| ~ leq(n0,pv10) ),
inference(rw,[status(thm)],[422,465,theory(equality)]) ).
cnf(1355,plain,
minus(n0,n1) = tptp_minus_1,
inference(spm,[status(thm)],[288,253,theory(equality)]) ).
cnf(1356,plain,
minus(n1,n1) = n0,
inference(spm,[status(thm)],[288,254,theory(equality)]) ).
cnf(1381,plain,
( leq(X1,n0)
| ~ gt(n1,X1) ),
inference(spm,[status(thm)],[252,1356,theory(equality)]) ).
cnf(1427,negated_conjecture,
( leq(esk2_0,tptp_minus_1)
| leq(n0,esk4_0)
| ~ leq(n0,pv10) ),
inference(rw,[status(thm)],[312,1355,theory(equality)]) ).
cnf(1446,negated_conjecture,
( leq(esk2_0,tptp_minus_1)
| leq(esk4_0,minus(pv10,n1))
| ~ leq(n0,pv10) ),
inference(rw,[status(thm)],[340,1355,theory(equality)]) ).
cnf(1504,negated_conjecture,
( leq(esk2_0,tptp_minus_1)
| sum(n0,n4,a_select3(q,esk4_0,esk5_0)) != n1
| ~ leq(n0,pv10) ),
inference(rw,[status(thm)],[749,1355,theory(equality)]) ).
cnf(1523,plain,
( leq(X1,X2)
| X1 = X2
| leq(X2,X1) ),
inference(spm,[status(thm)],[91,297,theory(equality)]) ).
cnf(1720,plain,
~ leq(plus(plus(n1,X1),n1),X1),
inference(spm,[status(thm)],[324,303,theory(equality)]) ).
cnf(1735,plain,
~ leq(plus(n1,plus(n1,X1)),X1),
inference(rw,[status(thm)],[1720,229,theory(equality)]) ).
cnf(1977,plain,
~ leq(plus(n1,n0),tptp_minus_1),
inference(spm,[status(thm)],[1735,253,theory(equality)]) ).
cnf(2010,plain,
~ leq(n1,tptp_minus_1),
inference(rw,[status(thm)],[1977,254,theory(equality)]) ).
cnf(2448,plain,
( leq(X1,X2)
| plus(n1,X2) = X1
| ~ leq(X1,plus(n1,X2)) ),
inference(spm,[status(thm)],[328,88,theory(equality)]) ).
cnf(2813,plain,
( leq(n2,plus(X1,n1))
| ~ leq(n1,X1) ),
inference(rw,[status(thm)],[344,512,theory(equality)]) ).
cnf(2822,plain,
( leq(n2,plus(X1,n1))
| ~ leq(plus(X2,n1),X1)
| ~ leq(n1,X2) ),
inference(spm,[status(thm)],[305,2813,theory(equality)]) ).
cnf(2963,plain,
( plus(X1,n1) = plus(n1,X2)
| leq(plus(n1,X2),X1)
| ~ leq(X2,X1) ),
inference(spm,[status(thm)],[331,346,theory(equality)]) ).
cnf(3072,plain,
( leq(plus(X1,n1),n0)
| ~ leq(X1,tptp_minus_1) ),
inference(spm,[status(thm)],[347,253,theory(equality)]) ).
cnf(24066,negated_conjecture,
( n0 = plus(n1,pv10)
| leq(n0,plus(n1,pv10)) ),
inference(spm,[status(thm)],[715,1523,theory(equality)]) ).
cnf(39539,plain,
( leq(X1,n0)
| X1 = n1
| leq(n1,X1) ),
inference(spm,[status(thm)],[1381,297,theory(equality)]) ).
cnf(189665,negated_conjecture,
( plus(n1,pv10) = n0
| leq(n0,pv10) ),
inference(spm,[status(thm)],[2448,24066,theory(equality)]) ).
cnf(190258,negated_conjecture,
( leq(n0,pv10)
| ~ leq(n0,n0) ),
inference(spm,[status(thm)],[715,189665,theory(equality)]) ).
cnf(190307,negated_conjecture,
( leq(n0,pv10)
| $false ),
inference(rw,[status(thm)],[190258,326,theory(equality)]) ).
cnf(190308,negated_conjecture,
leq(n0,pv10),
inference(cn,[status(thm)],[190307,theory(equality)]) ).
cnf(190365,negated_conjecture,
( leq(esk4_0,minus(pv10,n1))
| leq(n0,esk2_0)
| $false ),
inference(rw,[status(thm)],[309,190308,theory(equality)]) ).
cnf(190366,negated_conjecture,
( leq(esk4_0,minus(pv10,n1))
| leq(n0,esk2_0) ),
inference(cn,[status(thm)],[190365,theory(equality)]) ).
cnf(190368,negated_conjecture,
( leq(n0,esk4_0)
| leq(esk2_0,tptp_minus_1)
| $false ),
inference(rw,[status(thm)],[1427,190308,theory(equality)]) ).
cnf(190369,negated_conjecture,
( leq(n0,esk4_0)
| leq(esk2_0,tptp_minus_1) ),
inference(cn,[status(thm)],[190368,theory(equality)]) ).
cnf(190386,negated_conjecture,
( leq(esk4_0,minus(pv10,n1))
| leq(esk2_0,tptp_minus_1)
| $false ),
inference(rw,[status(thm)],[1446,190308,theory(equality)]) ).
cnf(190387,negated_conjecture,
( leq(esk4_0,minus(pv10,n1))
| leq(esk2_0,tptp_minus_1) ),
inference(cn,[status(thm)],[190386,theory(equality)]) ).
cnf(190397,negated_conjecture,
( leq(esk2_0,tptp_minus_1)
| sum(n0,n4,a_select3(q,esk4_0,esk5_0)) != n1
| $false ),
inference(rw,[status(thm)],[1504,190308,theory(equality)]) ).
cnf(190398,negated_conjecture,
( leq(esk2_0,tptp_minus_1)
| sum(n0,n4,a_select3(q,esk4_0,esk5_0)) != n1 ),
inference(cn,[status(thm)],[190397,theory(equality)]) ).
cnf(190409,negated_conjecture,
( leq(n0,esk2_0)
| sum(n0,n4,a_select3(q,esk4_0,esk5_0)) != n1
| $false ),
inference(rw,[status(thm)],[778,190308,theory(equality)]) ).
cnf(190410,negated_conjecture,
( leq(n0,esk2_0)
| sum(n0,n4,a_select3(q,esk4_0,esk5_0)) != n1 ),
inference(cn,[status(thm)],[190409,theory(equality)]) ).
cnf(190415,negated_conjecture,
( leq(n0,esk4_0)
| leq(n0,esk2_0)
| $false ),
inference(rw,[status(thm)],[285,190308,theory(equality)]) ).
cnf(190416,negated_conjecture,
( leq(n0,esk4_0)
| leq(n0,esk2_0) ),
inference(cn,[status(thm)],[190415,theory(equality)]) ).
cnf(190783,negated_conjecture,
( leq(esk2_0,tptp_minus_1)
| ~ leq(esk4_0,minus(pv10,n1))
| ~ leq(n0,esk4_0) ),
inference(spm,[status(thm)],[190398,681,theory(equality)]) ).
cnf(190784,negated_conjecture,
( leq(n0,esk2_0)
| ~ leq(esk4_0,minus(pv10,n1))
| ~ leq(n0,esk4_0) ),
inference(spm,[status(thm)],[190410,681,theory(equality)]) ).
cnf(213133,plain,
( leq(n2,plus(n0,n1))
| ~ leq(n1,X1)
| ~ leq(X1,tptp_minus_1) ),
inference(spm,[status(thm)],[2822,3072,theory(equality)]) ).
cnf(213169,plain,
( leq(n2,n1)
| ~ leq(n1,X1)
| ~ leq(X1,tptp_minus_1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[213133,229,theory(equality)]),254,theory(equality)]) ).
cnf(213170,plain,
( ~ leq(n1,X1)
| ~ leq(X1,tptp_minus_1) ),
inference(sr,[status(thm)],[213169,536,theory(equality)]) ).
cnf(232090,negated_conjecture,
( leq(n0,esk2_0)
| ~ leq(esk4_0,minus(pv10,n1)) ),
inference(csr,[status(thm)],[190784,190416]) ).
cnf(232091,negated_conjecture,
leq(n0,esk2_0),
inference(csr,[status(thm)],[232090,190366]) ).
cnf(232092,negated_conjecture,
( leq(X1,esk2_0)
| ~ leq(X1,n0) ),
inference(spm,[status(thm)],[85,232091,theory(equality)]) ).
cnf(232191,negated_conjecture,
~ leq(plus(esk2_0,n1),n0),
inference(spm,[status(thm)],[324,232092,theory(equality)]) ).
cnf(232304,negated_conjecture,
~ leq(plus(n1,esk2_0),n0),
inference(rw,[status(thm)],[232191,229,theory(equality)]) ).
cnf(232493,negated_conjecture,
( plus(n0,n1) = plus(n1,esk2_0)
| ~ leq(esk2_0,n0) ),
inference(spm,[status(thm)],[232304,2963,theory(equality)]) ).
cnf(232504,negated_conjecture,
( n1 = plus(n1,esk2_0)
| ~ leq(esk2_0,n0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[232493,229,theory(equality)]),254,theory(equality)]) ).
cnf(239126,negated_conjecture,
( minus(n1,n1) = esk2_0
| ~ leq(esk2_0,n0) ),
inference(spm,[status(thm)],[288,232504,theory(equality)]) ).
cnf(239220,negated_conjecture,
( n0 = esk2_0
| ~ leq(esk2_0,n0) ),
inference(rw,[status(thm)],[239126,1356,theory(equality)]) ).
cnf(239294,negated_conjecture,
( esk2_0 = n0
| esk2_0 = n1
| leq(n1,esk2_0) ),
inference(spm,[status(thm)],[239220,39539,theory(equality)]) ).
cnf(239405,negated_conjecture,
( esk2_0 = n1
| esk2_0 = n0
| ~ leq(esk2_0,tptp_minus_1) ),
inference(spm,[status(thm)],[213170,239294,theory(equality)]) ).
cnf(370954,negated_conjecture,
( leq(esk2_0,tptp_minus_1)
| ~ leq(esk4_0,minus(pv10,n1)) ),
inference(csr,[status(thm)],[190783,190369]) ).
cnf(370955,negated_conjecture,
leq(esk2_0,tptp_minus_1),
inference(csr,[status(thm)],[370954,190387]) ).
cnf(371004,negated_conjecture,
( esk2_0 = n0
| esk2_0 = n1
| $false ),
inference(rw,[status(thm)],[239405,370955,theory(equality)]) ).
cnf(371005,negated_conjecture,
( esk2_0 = n0
| esk2_0 = n1 ),
inference(cn,[status(thm)],[371004,theory(equality)]) ).
cnf(371063,negated_conjecture,
( leq(n0,tptp_minus_1)
| esk2_0 = n1 ),
inference(spm,[status(thm)],[370955,371005,theory(equality)]) ).
cnf(371282,negated_conjecture,
esk2_0 = n1,
inference(sr,[status(thm)],[371063,559,theory(equality)]) ).
cnf(371523,negated_conjecture,
leq(n1,tptp_minus_1),
inference(rw,[status(thm)],[370955,371282,theory(equality)]) ).
cnf(371524,negated_conjecture,
$false,
inference(sr,[status(thm)],[371523,2010,theory(equality)]) ).
cnf(371525,negated_conjecture,
$false,
371524,
[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/SWV055+1.p
% --creating new selector for [SWV003+0.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpSBevsj/sel_SWV055+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpSBevsj/sel_SWV055+1.p_2 with time limit 81
% -prover status ResourceOut
% --creating new selector for [SWV003+0.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpSBevsj/sel_SWV055+1.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpSBevsj/sel_SWV055+1.p_4 with time limit 55
% -prover status Theorem
% Problem SWV055+1.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV055+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV055+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
%
%------------------------------------------------------------------------------