%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM324+1 : TPTP v7.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n029.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.35s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 47 ( 25 unt; 0 def)
% Number of atoms : 106 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 113 ( 54 ~; 50 |; 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 : 10 ( 10 usr; 7 con; 0-1 aty)
% Number of variables : 84 ( 2 sgn 44 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(11,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_4',rdn_positive_less23) ).
fof(55,axiom,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
file('/export/starexec/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_4',rdnn5) ).
fof(71,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_4',rdn2) ).
fof(81,axiom,
rdn_positive_less(rdnn(n4),rdnn(n5)),
file('/export/starexec/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_4',rdn_positive_less45) ).
fof(92,axiom,
rdn_translate(nn3,rdn_neg(rdnn(n3))),
file('/export/starexec/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_4',rdnn3) ).
fof(96,axiom,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_4',rdn_digit_add_n2_n3_n5_n0) ).
fof(124,axiom,
! [X1,X2,X13,X16,X17,X18] :
( ( rdn_translate(X1,rdn_pos(X16))
& rdn_translate(X2,rdn_neg(X17))
& rdn_positive_less(X16,X17)
& rdn_add_with_carry(rdnn(n0),X16,X18,X17)
& rdn_translate(X13,rdn_neg(X18)) )
=> sum(X1,X2,X13) ),
file('/export/starexec/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_4',sum_entry_point_pos_neg_1) ).
fof(133,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/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_4',add_digit_digit_digit) ).
fof(142,axiom,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_4',rdn_digit_add_n5_n0_n5_n0) ).
fof(148,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/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_4',rdn_positive_less_transitivity) ).
fof(149,axiom,
rdn_positive_less(rdnn(n3),rdnn(n4)),
file('/export/starexec/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_4',rdn_positive_less34) ).
fof(151,conjecture,
? [X1] : sum(X1,nn5,nn3),
file('/export/starexec/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_4',sum_what_nn5_nn3) ).
fof(152,negated_conjecture,
~ ? [X1] : sum(X1,nn5,nn3),
inference(assume_negation,[status(cth)],[151]) ).
cnf(163,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(split_conjunct,[status(thm)],[11]) ).
cnf(219,plain,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(235,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(split_conjunct,[status(thm)],[71]) ).
cnf(245,plain,
rdn_positive_less(rdnn(n4),rdnn(n5)),
inference(split_conjunct,[status(thm)],[81]) ).
cnf(258,plain,
rdn_translate(nn3,rdn_neg(rdnn(n3))),
inference(split_conjunct,[status(thm)],[92]) ).
cnf(264,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
inference(split_conjunct,[status(thm)],[96]) ).
fof(306,plain,
! [X1,X2,X13,X16,X17,X18] :
( ~ rdn_translate(X1,rdn_pos(X16))
| ~ rdn_translate(X2,rdn_neg(X17))
| ~ rdn_positive_less(X16,X17)
| ~ rdn_add_with_carry(rdnn(n0),X16,X18,X17)
| ~ rdn_translate(X13,rdn_neg(X18))
| sum(X1,X2,X13) ),
inference(fof_nnf,[status(thm)],[124]) ).
fof(307,plain,
! [X19,X20,X21,X22,X23,X24] :
( ~ rdn_translate(X19,rdn_pos(X22))
| ~ rdn_translate(X20,rdn_neg(X23))
| ~ rdn_positive_less(X22,X23)
| ~ rdn_add_with_carry(rdnn(n0),X22,X24,X23)
| ~ rdn_translate(X21,rdn_neg(X24))
| sum(X19,X20,X21) ),
inference(variable_rename,[status(thm)],[306]) ).
cnf(308,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_neg(X4))
| ~ rdn_add_with_carry(rdnn(n0),X5,X4,X6)
| ~ rdn_positive_less(X5,X6)
| ~ rdn_translate(X2,rdn_neg(X6))
| ~ rdn_translate(X1,rdn_pos(X5)) ),
inference(split_conjunct,[status(thm)],[307]) ).
fof(319,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)],[133]) ).
fof(320,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)],[319]) ).
cnf(321,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)],[320]) ).
cnf(332,plain,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
inference(split_conjunct,[status(thm)],[142]) ).
fof(338,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)],[148]) ).
fof(339,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)],[338]) ).
cnf(340,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)],[339]) ).
cnf(341,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(split_conjunct,[status(thm)],[149]) ).
fof(343,negated_conjecture,
! [X1] : ~ sum(X1,nn5,nn3),
inference(fof_nnf,[status(thm)],[152]) ).
fof(344,negated_conjecture,
! [X2] : ~ sum(X2,nn5,nn3),
inference(variable_rename,[status(thm)],[343]) ).
cnf(345,negated_conjecture,
~ sum(X1,nn5,nn3),
inference(split_conjunct,[status(thm)],[344]) ).
cnf(348,plain,
( rdn_positive_less(rdnn(X1),rdnn(n4))
| ~ rdn_positive_less(rdnn(X1),rdnn(n3)) ),
inference(spm,[status(thm)],[340,341,theory(equality)]) ).
cnf(356,plain,
( rdn_positive_less(rdnn(X1),rdnn(n5))
| ~ rdn_positive_less(rdnn(X1),rdnn(n4)) ),
inference(spm,[status(thm)],[340,245,theory(equality)]) ).
cnf(405,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)],[321,332,theory(equality)]) ).
cnf(597,plain,
( rdn_positive_less(rdnn(X1),rdnn(n5))
| ~ rdn_positive_less(rdnn(X1),rdnn(n3)) ),
inference(spm,[status(thm)],[356,348,theory(equality)]) ).
cnf(734,plain,
rdn_positive_less(rdnn(n2),rdnn(n5)),
inference(spm,[status(thm)],[597,163,theory(equality)]) ).
cnf(948,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_neg(rdnn(X4)))
| ~ rdn_translate(X2,rdn_neg(rdnn(n5)))
| ~ rdn_translate(X1,rdn_pos(rdnn(X5)))
| ~ rdn_positive_less(rdnn(X5),rdnn(n5))
| ~ rdn_digit_add(rdnn(X5),rdnn(X4),rdnn(n5),rdnn(n0)) ),
inference(spm,[status(thm)],[308,405,theory(equality)]) ).
cnf(3990,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X2,rdn_neg(rdnn(n5)))
| ~ rdn_translate(X3,rdn_neg(rdnn(n3)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n2)))
| ~ rdn_positive_less(rdnn(n2),rdnn(n5)) ),
inference(spm,[status(thm)],[948,264,theory(equality)]) ).
cnf(3997,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X2,rdn_neg(rdnn(n5)))
| ~ rdn_translate(X3,rdn_neg(rdnn(n3)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n2)))
| $false ),
inference(rw,[status(thm)],[3990,734,theory(equality)]) ).
cnf(3998,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X2,rdn_neg(rdnn(n5)))
| ~ rdn_translate(X3,rdn_neg(rdnn(n3)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(cn,[status(thm)],[3997,theory(equality)]) ).
cnf(4040,plain,
( sum(X1,nn5,X2)
| ~ rdn_translate(X2,rdn_neg(rdnn(n3)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(spm,[status(thm)],[3998,219,theory(equality)]) ).
cnf(4041,plain,
( sum(X1,nn5,nn3)
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(spm,[status(thm)],[4040,258,theory(equality)]) ).
cnf(4042,plain,
~ rdn_translate(X1,rdn_pos(rdnn(n2))),
inference(sr,[status(thm)],[4041,345,theory(equality)]) ).
cnf(4043,plain,
$false,
inference(sr,[status(thm)],[235,4042,theory(equality)]) ).
cnf(4044,plain,
$false,
4043,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM324+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 : n029.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 01:02:15 CST 2018
% 0.02/0.24 % CPUTime :
% 0.02/0.29 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.29 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 0.06/0.46 -running prover on /export/starexec/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.46 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_1']
% 0.06/0.46 -prover status CounterSatisfiable
% 0.06/0.46 -running prover on /export/starexec/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_2 with time limit 89
% 0.06/0.46 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=89', '/export/starexec/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_2']
% 0.06/0.46 -prover status CounterSatisfiable
% 0.06/0.46 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 0.29/0.56 -running prover on /export/starexec/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_3 with time limit 119
% 0.29/0.56 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=119', '/export/starexec/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_3']
% 0.29/0.56 -prover status CounterSatisfiable
% 0.29/0.56 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 0.35/0.94 -running prover on /export/starexec/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_4 with time limit 149
% 0.35/0.94 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=149', '/export/starexec/sandbox/tmp/tmpMOr2HN/sel_theBenchmark.p_4']
% 0.35/0.94 -prover status Theorem
% 0.35/0.94 Problem theBenchmark.p solved in phase 3.
% 0.35/0.94 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.35/0.94 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.35/0.94 Solved 1 out of 1.
% 0.35/0.94 # Problem is unsatisfiable (or provable), constructing proof object
% 0.35/0.94 # SZS status Theorem
% 0.35/0.94 # SZS output start CNFRefutation.
% See solution above
% 0.35/0.95 # SZS output end CNFRefutation
%------------------------------------------------------------------------------