TSTP Solution File: NUM325+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM325+1 : TPTP v7.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n063.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:02:08 EST 2018
% Result : Theorem 0.72s
% Output : CNFRefutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 47 ( 26 unt; 0 def)
% Number of atoms : 102 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 107 ( 52 ~; 46 |; 6 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-1 aty)
% Number of variables : 77 ( 1 sgn 44 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(11,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_4',rdn_positive_less23) ).
fof(65,axiom,
rdn_translate(n5,rdn_pos(rdnn(n5))),
file('/export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_4',rdn5) ).
fof(71,axiom,
rdn_translate(n3,rdn_pos(rdnn(n3))),
file('/export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_4',rdn3) ).
fof(79,axiom,
rdn_positive_less(rdnn(n4),rdnn(n5)),
file('/export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_4',rdn_positive_less45) ).
fof(91,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_4',rdnn2) ).
fof(95,axiom,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_4',rdn_digit_add_n2_n3_n5_n0) ).
fof(123,axiom,
! [X1,X2,X13,X16,X17,X18] :
( ( rdn_translate(X1,rdn_pos(X16))
& rdn_translate(X2,rdn_neg(X17))
& rdn_positive_less(X17,X16)
& rdn_add_with_carry(rdnn(n0),X17,X18,X16)
& rdn_translate(X13,rdn_pos(X18)) )
=> sum(X1,X2,X13) ),
file('/export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_4',sum_entry_point_pos_neg_2) ).
fof(132,axiom,
! [X5,X6,X8,X9,X20] :
( ( rdn_digit_add(rdnn(X6),rdnn(X8),rdnn(X20),rdnn(n0))
& rdn_digit_add(rdnn(X20),rdnn(X5),rdnn(X9),rdnn(n0)) )
=> rdn_add_with_carry(rdnn(X5),rdnn(X6),rdnn(X8),rdnn(X9)) ),
file('/export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_4',add_digit_digit_digit) ).
fof(141,axiom,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_4',rdn_digit_add_n5_n0_n5_n0) ).
fof(147,axiom,
! [X1,X2,X13] :
( ( rdn_positive_less(rdnn(X1),rdnn(X2))
& rdn_positive_less(rdnn(X2),rdnn(X13)) )
=> rdn_positive_less(rdnn(X1),rdnn(X13)) ),
file('/export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_4',rdn_positive_less_transitivity) ).
fof(148,axiom,
rdn_positive_less(rdnn(n3),rdnn(n4)),
file('/export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_4',rdn_positive_less34) ).
fof(150,conjecture,
? [X1] : sum(X1,nn2,n3),
file('/export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_4',sum_what_nn2_n3) ).
fof(151,negated_conjecture,
~ ? [X1] : sum(X1,nn2,n3),
inference(assume_negation,[status(cth)],[150]) ).
cnf(162,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(split_conjunct,[status(thm)],[11]) ).
cnf(228,plain,
rdn_translate(n5,rdn_pos(rdnn(n5))),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(234,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(split_conjunct,[status(thm)],[71]) ).
cnf(242,plain,
rdn_positive_less(rdnn(n4),rdnn(n5)),
inference(split_conjunct,[status(thm)],[79]) ).
cnf(256,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(split_conjunct,[status(thm)],[91]) ).
cnf(262,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
inference(split_conjunct,[status(thm)],[95]) ).
fof(302,plain,
! [X1,X2,X13,X16,X17,X18] :
( ~ rdn_translate(X1,rdn_pos(X16))
| ~ rdn_translate(X2,rdn_neg(X17))
| ~ rdn_positive_less(X17,X16)
| ~ rdn_add_with_carry(rdnn(n0),X17,X18,X16)
| ~ rdn_translate(X13,rdn_pos(X18))
| sum(X1,X2,X13) ),
inference(fof_nnf,[status(thm)],[123]) ).
fof(303,plain,
! [X19,X20,X21,X22,X23,X24] :
( ~ rdn_translate(X19,rdn_pos(X22))
| ~ rdn_translate(X20,rdn_neg(X23))
| ~ rdn_positive_less(X23,X22)
| ~ rdn_add_with_carry(rdnn(n0),X23,X24,X22)
| ~ rdn_translate(X21,rdn_pos(X24))
| sum(X19,X20,X21) ),
inference(variable_rename,[status(thm)],[302]) ).
cnf(304,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(X4))
| ~ rdn_add_with_carry(rdnn(n0),X5,X4,X6)
| ~ rdn_positive_less(X5,X6)
| ~ rdn_translate(X2,rdn_neg(X5))
| ~ rdn_translate(X1,rdn_pos(X6)) ),
inference(split_conjunct,[status(thm)],[303]) ).
fof(317,plain,
! [X5,X6,X8,X9,X20] :
( ~ rdn_digit_add(rdnn(X6),rdnn(X8),rdnn(X20),rdnn(n0))
| ~ rdn_digit_add(rdnn(X20),rdnn(X5),rdnn(X9),rdnn(n0))
| rdn_add_with_carry(rdnn(X5),rdnn(X6),rdnn(X8),rdnn(X9)) ),
inference(fof_nnf,[status(thm)],[132]) ).
fof(318,plain,
! [X21,X22,X23,X24,X25] :
( ~ rdn_digit_add(rdnn(X22),rdnn(X23),rdnn(X25),rdnn(n0))
| ~ rdn_digit_add(rdnn(X25),rdnn(X21),rdnn(X24),rdnn(n0))
| rdn_add_with_carry(rdnn(X21),rdnn(X22),rdnn(X23),rdnn(X24)) ),
inference(variable_rename,[status(thm)],[317]) ).
cnf(319,plain,
( rdn_add_with_carry(rdnn(X1),rdnn(X2),rdnn(X3),rdnn(X4))
| ~ rdn_digit_add(rdnn(X5),rdnn(X1),rdnn(X4),rdnn(n0))
| ~ rdn_digit_add(rdnn(X2),rdnn(X3),rdnn(X5),rdnn(n0)) ),
inference(split_conjunct,[status(thm)],[318]) ).
cnf(330,plain,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
inference(split_conjunct,[status(thm)],[141]) ).
fof(336,plain,
! [X1,X2,X13] :
( ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X2),rdnn(X13))
| rdn_positive_less(rdnn(X1),rdnn(X13)) ),
inference(fof_nnf,[status(thm)],[147]) ).
fof(337,plain,
! [X14,X15,X16] :
( ~ rdn_positive_less(rdnn(X14),rdnn(X15))
| ~ rdn_positive_less(rdnn(X15),rdnn(X16))
| rdn_positive_less(rdnn(X14),rdnn(X16)) ),
inference(variable_rename,[status(thm)],[336]) ).
cnf(338,plain,
( rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X3),rdnn(X2))
| ~ rdn_positive_less(rdnn(X1),rdnn(X3)) ),
inference(split_conjunct,[status(thm)],[337]) ).
cnf(339,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(split_conjunct,[status(thm)],[148]) ).
fof(341,negated_conjecture,
! [X1] : ~ sum(X1,nn2,n3),
inference(fof_nnf,[status(thm)],[151]) ).
fof(342,negated_conjecture,
! [X2] : ~ sum(X2,nn2,n3),
inference(variable_rename,[status(thm)],[341]) ).
cnf(343,negated_conjecture,
~ sum(X1,nn2,n3),
inference(split_conjunct,[status(thm)],[342]) ).
cnf(345,plain,
( rdn_positive_less(rdnn(X1),rdnn(n4))
| ~ rdn_positive_less(rdnn(X1),rdnn(n3)) ),
inference(spm,[status(thm)],[338,339,theory(equality)]) ).
cnf(353,plain,
( rdn_positive_less(rdnn(X1),rdnn(n5))
| ~ rdn_positive_less(rdnn(X1),rdnn(n4)) ),
inference(spm,[status(thm)],[338,242,theory(equality)]) ).
cnf(404,plain,
( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n5))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n5),rdnn(n0)) ),
inference(spm,[status(thm)],[319,330,theory(equality)]) ).
cnf(577,plain,
( rdn_positive_less(rdnn(X1),rdnn(n5))
| ~ rdn_positive_less(rdnn(X1),rdnn(n3)) ),
inference(spm,[status(thm)],[353,345,theory(equality)]) ).
cnf(801,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(rdnn(X4)))
| ~ rdn_translate(X2,rdn_neg(rdnn(X5)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n5)))
| ~ rdn_positive_less(rdnn(X5),rdnn(n5))
| ~ rdn_digit_add(rdnn(X5),rdnn(X4),rdnn(n5),rdnn(n0)) ),
inference(spm,[status(thm)],[304,404,theory(equality)]) ).
cnf(3791,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X1,rdn_pos(rdnn(n5)))
| ~ rdn_translate(X3,rdn_pos(rdnn(n3)))
| ~ rdn_translate(X2,rdn_neg(rdnn(n2)))
| ~ rdn_positive_less(rdnn(n2),rdnn(n5)) ),
inference(spm,[status(thm)],[801,262,theory(equality)]) ).
cnf(3859,plain,
( sum(n5,X1,X2)
| ~ rdn_translate(X2,rdn_pos(rdnn(n3)))
| ~ rdn_translate(X1,rdn_neg(rdnn(n2)))
| ~ rdn_positive_less(rdnn(n2),rdnn(n5)) ),
inference(spm,[status(thm)],[3791,228,theory(equality)]) ).
cnf(3860,plain,
( sum(n5,X1,n3)
| ~ rdn_translate(X1,rdn_neg(rdnn(n2)))
| ~ rdn_positive_less(rdnn(n2),rdnn(n5)) ),
inference(spm,[status(thm)],[3859,234,theory(equality)]) ).
cnf(3861,plain,
( sum(n5,nn2,n3)
| ~ rdn_positive_less(rdnn(n2),rdnn(n5)) ),
inference(spm,[status(thm)],[3860,256,theory(equality)]) ).
cnf(3862,plain,
~ rdn_positive_less(rdnn(n2),rdnn(n5)),
inference(sr,[status(thm)],[3861,343,theory(equality)]) ).
cnf(3875,plain,
~ rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(spm,[status(thm)],[3862,577,theory(equality)]) ).
cnf(3879,plain,
$false,
inference(rw,[status(thm)],[3875,162,theory(equality)]) ).
cnf(3880,plain,
$false,
inference(cn,[status(thm)],[3879,theory(equality)]) ).
cnf(3881,plain,
$false,
3880,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM325+1 : TPTP v7.0.0. Released v3.1.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n063.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.625MB
% 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Fri Jan 5 02:23:15 CST 2018
% 0.02/0.23 % CPUTime :
% 0.06/0.30 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.30 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 0.06/0.47 -running prover on /export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.47 -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/tmpqvssFO/sel_theBenchmark.p_1']
% 0.06/0.47 -prover status CounterSatisfiable
% 0.06/0.47 -running prover on /export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_2 with time limit 89
% 0.06/0.47 -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=89', '/export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_2']
% 0.06/0.47 -prover status CounterSatisfiable
% 0.06/0.47 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 0.06/0.56 -running prover on /export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_3 with time limit 119
% 0.06/0.56 -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=119', '/export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_3']
% 0.06/0.56 -prover status CounterSatisfiable
% 0.06/0.56 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 0.72/0.94 -running prover on /export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_4 with time limit 149
% 0.72/0.94 -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=149', '/export/starexec/sandbox2/tmp/tmpqvssFO/sel_theBenchmark.p_4']
% 0.72/0.94 -prover status Theorem
% 0.72/0.94 Problem theBenchmark.p solved in phase 3.
% 0.72/0.94 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.72/0.94 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.72/0.94 Solved 1 out of 1.
% 0.72/0.94 # Problem is unsatisfiable (or provable), constructing proof object
% 0.72/0.94 # SZS status Theorem
% 0.72/0.94 # SZS output start CNFRefutation.
% See solution above
% 0.72/0.96 # SZS output end CNFRefutation
%------------------------------------------------------------------------------