TSTP Solution File: NUM843+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM843+1 : TPTP v7.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n122.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.625MB
% OS : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan 8 15:22:29 EST 2018
% Result : Theorem 1.01s
% Output : CNFRefutation 1.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of formulae : 81 ( 28 unt; 0 def)
% Number of atoms : 166 ( 16 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 148 ( 63 ~; 65 |; 12 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 140 ( 6 sgn 81 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X5,X6] : greater(vplus(X5,X6),X5),
file('/export/starexec/sandbox2/tmp/tmpY3yWih/sel_theBenchmark.p_1','ass(cond(189, 0), 0)') ).
fof(4,axiom,
! [X7] : equal(vplus(v1,X7),vsucc(X7)),
file('/export/starexec/sandbox2/tmp/tmpY3yWih/sel_theBenchmark.p_1','ass(cond(43, 0), 0)') ).
fof(5,axiom,
! [X8,X9] : equal(vplus(X9,X8),vplus(X8,X9)),
file('/export/starexec/sandbox2/tmp/tmpY3yWih/sel_theBenchmark.p_1','ass(cond(61, 0), 0)') ).
fof(6,axiom,
! [X10,X11,X12] :
( ( leq(X11,X12)
& leq(X10,X11) )
=> leq(X10,X12) ),
file('/export/starexec/sandbox2/tmp/tmpY3yWih/sel_theBenchmark.p_1','ass(cond(184, 0), 0)') ).
fof(7,axiom,
! [X13,X14] :
( greater(X13,X14)
=> geq(X13,vplus(X14,v1)) ),
file('/export/starexec/sandbox2/tmp/tmpY3yWih/sel_theBenchmark.p_1','ass(cond(234, 0), 0)') ).
fof(10,axiom,
! [X20,X21] :
( equal(vplus(X20,vsucc(X21)),vsucc(vplus(X20,X21)))
& equal(vplus(X20,v1),vsucc(X20)) ),
file('/export/starexec/sandbox2/tmp/tmpY3yWih/sel_theBenchmark.p_1','qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))') ).
fof(11,axiom,
! [X22,X23] :
( less(X22,X23)
=> greater(X23,X22) ),
file('/export/starexec/sandbox2/tmp/tmpY3yWih/sel_theBenchmark.p_1','ass(cond(147, 0), 0)') ).
fof(12,axiom,
! [X24,X25] :
( greater(X25,X24)
<=> ? [X26] : equal(X25,vplus(X24,X26)) ),
file('/export/starexec/sandbox2/tmp/tmpY3yWih/sel_theBenchmark.p_1','def(cond(conseq(axiom(3)), 11), 1)') ).
fof(13,axiom,
! [X27,X28,X29] :
( greater(vplus(X27,X29),vplus(X28,X29))
=> greater(X27,X28) ),
file('/export/starexec/sandbox2/tmp/tmpY3yWih/sel_theBenchmark.p_1','ass(cond(goal(202), 0), 2)') ).
fof(20,axiom,
! [X41,X42,X43] :
( ( ( less(X42,X43)
& leq(X41,X42) )
| ( leq(X42,X43)
& less(X41,X42) ) )
=> less(X41,X43) ),
file('/export/starexec/sandbox2/tmp/tmpY3yWih/sel_theBenchmark.p_1','ass(cond(goal(177), 0), 0)') ).
fof(26,axiom,
! [X58] :
( ~ equal(X58,v1)
=> equal(X58,vsucc(vskolem2(X58))) ),
file('/export/starexec/sandbox2/tmp/tmpY3yWih/sel_theBenchmark.p_1','ass(cond(20, 0), 0)') ).
fof(27,axiom,
less(vd390,vplus(vd391,v1)),
file('/export/starexec/sandbox2/tmp/tmpY3yWih/sel_theBenchmark.p_1','holds(conjunct1(243), 392, 0)') ).
fof(30,axiom,
~ leq(vd390,vd391),
file('/export/starexec/sandbox2/tmp/tmpY3yWih/sel_theBenchmark.p_1','holds(conjunct2(243), 393, 0)') ).
fof(31,axiom,
! [X65] : geq(X65,v1),
file('/export/starexec/sandbox2/tmp/tmpY3yWih/sel_theBenchmark.p_1','ass(cond(228, 0), 0)') ).
fof(32,axiom,
! [X66,X67] :
( geq(X66,X67)
=> leq(X67,X66) ),
file('/export/starexec/sandbox2/tmp/tmpY3yWih/sel_theBenchmark.p_1','ass(cond(158, 0), 0)') ).
fof(37,plain,
~ leq(vd390,vd391),
inference(fof_simplification,[status(thm)],[30,theory(equality)]) ).
fof(43,plain,
! [X7,X8] : greater(vplus(X7,X8),X7),
inference(variable_rename,[status(thm)],[3]) ).
cnf(44,plain,
greater(vplus(X1,X2),X1),
inference(split_conjunct,[status(thm)],[43]) ).
fof(45,plain,
! [X8] : equal(vplus(v1,X8),vsucc(X8)),
inference(variable_rename,[status(thm)],[4]) ).
cnf(46,plain,
vplus(v1,X1) = vsucc(X1),
inference(split_conjunct,[status(thm)],[45]) ).
fof(47,plain,
! [X10,X11] : equal(vplus(X11,X10),vplus(X10,X11)),
inference(variable_rename,[status(thm)],[5]) ).
cnf(48,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[47]) ).
fof(49,plain,
! [X10,X11,X12] :
( ~ leq(X11,X12)
| ~ leq(X10,X11)
| leq(X10,X12) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(50,plain,
! [X13,X14,X15] :
( ~ leq(X14,X15)
| ~ leq(X13,X14)
| leq(X13,X15) ),
inference(variable_rename,[status(thm)],[49]) ).
cnf(51,plain,
( leq(X1,X2)
| ~ leq(X1,X3)
| ~ leq(X3,X2) ),
inference(split_conjunct,[status(thm)],[50]) ).
fof(52,plain,
! [X13,X14] :
( ~ greater(X13,X14)
| geq(X13,vplus(X14,v1)) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(53,plain,
! [X15,X16] :
( ~ greater(X15,X16)
| geq(X15,vplus(X16,v1)) ),
inference(variable_rename,[status(thm)],[52]) ).
cnf(54,plain,
( geq(X1,vplus(X2,v1))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[53]) ).
fof(62,plain,
! [X22,X23] :
( equal(vplus(X22,vsucc(X23)),vsucc(vplus(X22,X23)))
& equal(vplus(X22,v1),vsucc(X22)) ),
inference(variable_rename,[status(thm)],[10]) ).
cnf(63,plain,
vplus(X1,v1) = vsucc(X1),
inference(split_conjunct,[status(thm)],[62]) ).
fof(65,plain,
! [X22,X23] :
( ~ less(X22,X23)
| greater(X23,X22) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(66,plain,
! [X24,X25] :
( ~ less(X24,X25)
| greater(X25,X24) ),
inference(variable_rename,[status(thm)],[65]) ).
cnf(67,plain,
( greater(X1,X2)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[66]) ).
fof(68,plain,
! [X24,X25] :
( ( ~ greater(X25,X24)
| ? [X26] : equal(X25,vplus(X24,X26)) )
& ( ! [X26] : ~ equal(X25,vplus(X24,X26))
| greater(X25,X24) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(69,plain,
! [X27,X28] :
( ( ~ greater(X28,X27)
| ? [X29] : equal(X28,vplus(X27,X29)) )
& ( ! [X30] : ~ equal(X28,vplus(X27,X30))
| greater(X28,X27) ) ),
inference(variable_rename,[status(thm)],[68]) ).
fof(70,plain,
! [X27,X28] :
( ( ~ greater(X28,X27)
| equal(X28,vplus(X27,esk1_2(X27,X28))) )
& ( ! [X30] : ~ equal(X28,vplus(X27,X30))
| greater(X28,X27) ) ),
inference(skolemize,[status(esa)],[69]) ).
fof(71,plain,
! [X27,X28,X30] :
( ( ~ equal(X28,vplus(X27,X30))
| greater(X28,X27) )
& ( ~ greater(X28,X27)
| equal(X28,vplus(X27,esk1_2(X27,X28))) ) ),
inference(shift_quantors,[status(thm)],[70]) ).
cnf(72,plain,
( X1 = vplus(X2,esk1_2(X2,X1))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[71]) ).
fof(74,plain,
! [X27,X28,X29] :
( ~ greater(vplus(X27,X29),vplus(X28,X29))
| greater(X27,X28) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(75,plain,
! [X30,X31,X32] :
( ~ greater(vplus(X30,X32),vplus(X31,X32))
| greater(X30,X31) ),
inference(variable_rename,[status(thm)],[74]) ).
cnf(76,plain,
( greater(X1,X2)
| ~ greater(vplus(X1,X3),vplus(X2,X3)) ),
inference(split_conjunct,[status(thm)],[75]) ).
fof(90,plain,
! [X41,X42,X43] :
( ( ( ~ less(X42,X43)
| ~ leq(X41,X42) )
& ( ~ leq(X42,X43)
| ~ less(X41,X42) ) )
| less(X41,X43) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(91,plain,
! [X44,X45,X46] :
( ( ( ~ less(X45,X46)
| ~ leq(X44,X45) )
& ( ~ leq(X45,X46)
| ~ less(X44,X45) ) )
| less(X44,X46) ),
inference(variable_rename,[status(thm)],[90]) ).
fof(92,plain,
! [X44,X45,X46] :
( ( ~ less(X45,X46)
| ~ leq(X44,X45)
| less(X44,X46) )
& ( ~ leq(X45,X46)
| ~ less(X44,X45)
| less(X44,X46) ) ),
inference(distribute,[status(thm)],[91]) ).
cnf(93,plain,
( less(X1,X2)
| ~ less(X1,X3)
| ~ leq(X3,X2) ),
inference(split_conjunct,[status(thm)],[92]) ).
fof(110,plain,
! [X58] :
( equal(X58,v1)
| equal(X58,vsucc(vskolem2(X58))) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(111,plain,
! [X59] :
( equal(X59,v1)
| equal(X59,vsucc(vskolem2(X59))) ),
inference(variable_rename,[status(thm)],[110]) ).
cnf(112,plain,
( X1 = vsucc(vskolem2(X1))
| X1 = v1 ),
inference(split_conjunct,[status(thm)],[111]) ).
cnf(113,plain,
less(vd390,vplus(vd391,v1)),
inference(split_conjunct,[status(thm)],[27]) ).
cnf(120,plain,
~ leq(vd390,vd391),
inference(split_conjunct,[status(thm)],[37]) ).
fof(121,plain,
! [X66] : geq(X66,v1),
inference(variable_rename,[status(thm)],[31]) ).
cnf(122,plain,
geq(X1,v1),
inference(split_conjunct,[status(thm)],[121]) ).
fof(123,plain,
! [X66,X67] :
( ~ geq(X66,X67)
| leq(X67,X66) ),
inference(fof_nnf,[status(thm)],[32]) ).
fof(124,plain,
! [X68,X69] :
( ~ geq(X68,X69)
| leq(X69,X68) ),
inference(variable_rename,[status(thm)],[123]) ).
cnf(125,plain,
( leq(X1,X2)
| ~ geq(X2,X1) ),
inference(split_conjunct,[status(thm)],[124]) ).
cnf(130,plain,
vplus(v1,X1) = vplus(X1,v1),
inference(rw,[status(thm)],[46,63,theory(equality)]),
[unfolding] ).
cnf(133,plain,
( v1 = X1
| vplus(vskolem2(X1),v1) = X1 ),
inference(rw,[status(thm)],[112,63,theory(equality)]),
[unfolding] ).
cnf(157,plain,
less(vd390,vplus(v1,vd391)),
inference(rw,[status(thm)],[113,130,theory(equality)]) ).
cnf(158,plain,
( vplus(v1,vskolem2(X1)) = X1
| v1 = X1 ),
inference(rw,[status(thm)],[133,130,theory(equality)]) ).
cnf(159,plain,
greater(vplus(X2,X1),X1),
inference(spm,[status(thm)],[44,48,theory(equality)]) ).
cnf(167,plain,
~ geq(vd391,vd390),
inference(spm,[status(thm)],[120,125,theory(equality)]) ).
cnf(180,plain,
( geq(X1,vplus(v1,X2))
| ~ greater(X1,X2) ),
inference(spm,[status(thm)],[54,48,theory(equality)]) ).
cnf(199,plain,
( greater(X1,X2)
| ~ greater(vplus(X1,esk1_2(X2,X3)),X3)
| ~ greater(X3,X2) ),
inference(spm,[status(thm)],[76,72,theory(equality)]) ).
cnf(202,plain,
( leq(X1,X2)
| ~ leq(X1,X3)
| ~ geq(X2,X3) ),
inference(spm,[status(thm)],[51,125,theory(equality)]) ).
cnf(203,plain,
( less(X1,X2)
| ~ less(X1,X3)
| ~ geq(X2,X3) ),
inference(spm,[status(thm)],[93,125,theory(equality)]) ).
cnf(290,plain,
( greater(X1,vskolem2(X1))
| v1 = X1 ),
inference(spm,[status(thm)],[159,158,theory(equality)]) ).
cnf(490,plain,
( geq(X1,X2)
| v1 = X2
| ~ greater(X1,vskolem2(X2)) ),
inference(spm,[status(thm)],[180,158,theory(equality)]) ).
cnf(1056,plain,
( leq(X1,X2)
| ~ leq(X1,v1) ),
inference(spm,[status(thm)],[202,122,theory(equality)]) ).
cnf(1078,plain,
( leq(X1,X2)
| ~ geq(v1,X1) ),
inference(spm,[status(thm)],[1056,125,theory(equality)]) ).
cnf(1082,plain,
( less(X1,X2)
| ~ less(X1,vplus(v1,X3))
| ~ greater(X2,X3) ),
inference(spm,[status(thm)],[203,180,theory(equality)]) ).
cnf(1101,plain,
~ geq(v1,vd390),
inference(spm,[status(thm)],[120,1078,theory(equality)]) ).
cnf(25819,plain,
( less(vd390,X1)
| ~ greater(X1,vd391) ),
inference(spm,[status(thm)],[1082,157,theory(equality)]) ).
cnf(25843,plain,
( greater(X1,vd390)
| ~ greater(X1,vd391) ),
inference(spm,[status(thm)],[67,25819,theory(equality)]) ).
cnf(25851,plain,
greater(vplus(vd391,X1),vd390),
inference(spm,[status(thm)],[25843,44,theory(equality)]) ).
cnf(25915,plain,
( greater(vd391,X1)
| ~ greater(vd390,X1) ),
inference(spm,[status(thm)],[199,25851,theory(equality)]) ).
cnf(26006,plain,
( v1 = X1
| geq(vd391,X1)
| ~ greater(vd390,vskolem2(X1)) ),
inference(spm,[status(thm)],[490,25915,theory(equality)]) ).
cnf(53096,plain,
( v1 = vd390
| geq(vd391,vd390) ),
inference(spm,[status(thm)],[26006,290,theory(equality)]) ).
cnf(53110,plain,
vd390 = v1,
inference(sr,[status(thm)],[53096,167,theory(equality)]) ).
cnf(53188,plain,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[1101,53110,theory(equality)]),122,theory(equality)]) ).
cnf(53189,plain,
$false,
inference(cn,[status(thm)],[53188,theory(equality)]) ).
cnf(53190,plain,
$false,
53189,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM843+1 : TPTP v7.0.0. Released v4.1.0.
% 0.02/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.24 % Computer : n122.star.cs.uiowa.edu
% 0.03/0.24 % Model : x86_64 x86_64
% 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.24 % Memory : 32218.625MB
% 0.03/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.24 % CPULimit : 300
% 0.03/0.24 % DateTime : Fri Jan 5 14:43:48 CST 2018
% 0.03/0.24 % CPUTime :
% 0.07/0.31 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.31 --creating new selector for []
% 1.01/1.27 -running prover on /export/starexec/sandbox2/tmp/tmpY3yWih/sel_theBenchmark.p_1 with time limit 29
% 1.01/1.27 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpY3yWih/sel_theBenchmark.p_1']
% 1.01/1.27 -prover status Theorem
% 1.01/1.27 Problem theBenchmark.p solved in phase 0.
% 1.01/1.27 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.01/1.27 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.01/1.27 Solved 1 out of 1.
% 1.01/1.27 # Problem is unsatisfiable (or provable), constructing proof object
% 1.01/1.27 # SZS status Theorem
% 1.01/1.27 # SZS output start CNFRefutation.
% See solution above
% 1.01/1.27 # SZS output end CNFRefutation
%------------------------------------------------------------------------------