TSTP Solution File: NUM315+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM315+1 : TPTP v7.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n092.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:07 EST 2018
% Result : Theorem 0.41s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 17 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 67 ( 32 ~; 29 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-1 aty)
% Number of variables : 57 ( 0 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(55,axiom,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
file('/export/starexec/sandbox2/tmp/tmpRCMK6S/sel_theBenchmark.p_4',rdnn5) ).
fof(87,axiom,
rdn_digit_add(rdnn(n7),rdnn(n0),rdnn(n7),rdnn(n0)),
file('/export/starexec/sandbox2/tmp/tmpRCMK6S/sel_theBenchmark.p_4',rdn_digit_add_n7_n0_n7_n0) ).
fof(89,axiom,
rdn_translate(nn7,rdn_neg(rdnn(n7))),
file('/export/starexec/sandbox2/tmp/tmpRCMK6S/sel_theBenchmark.p_4',rdnn7) ).
fof(93,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox2/tmp/tmpRCMK6S/sel_theBenchmark.p_4',rdnn2) ).
fof(107,axiom,
! [X1,X2,X13,X16,X17,X18] :
( ( rdn_translate(X1,rdn_neg(X16))
& rdn_translate(X2,rdn_neg(X17))
& rdn_add_with_carry(rdnn(n0),X16,X17,X18)
& rdn_translate(X13,rdn_neg(X18)) )
=> sum(X1,X2,X13) ),
file('/export/starexec/sandbox2/tmp/tmpRCMK6S/sel_theBenchmark.p_4',sum_entry_point_neg_neg) ).
fof(134,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/tmpRCMK6S/sel_theBenchmark.p_4',add_digit_digit_digit) ).
fof(141,axiom,
rdn_digit_add(rdnn(n2),rdnn(n5),rdnn(n7),rdnn(n0)),
file('/export/starexec/sandbox2/tmp/tmpRCMK6S/sel_theBenchmark.p_4',rdn_digit_add_n2_n5_n7_n0) ).
fof(152,conjecture,
sum(nn2,nn5,nn7),
file('/export/starexec/sandbox2/tmp/tmpRCMK6S/sel_theBenchmark.p_4',sum_nn2_nn5_nn7) ).
fof(153,negated_conjecture,
~ sum(nn2,nn5,nn7),
inference(assume_negation,[status(cth)],[152]) ).
fof(154,negated_conjecture,
~ sum(nn2,nn5,nn7),
inference(fof_simplification,[status(thm)],[153,theory(equality)]) ).
cnf(221,plain,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(253,plain,
rdn_digit_add(rdnn(n7),rdnn(n0),rdnn(n7),rdnn(n0)),
inference(split_conjunct,[status(thm)],[87]) ).
cnf(255,plain,
rdn_translate(nn7,rdn_neg(rdnn(n7))),
inference(split_conjunct,[status(thm)],[89]) ).
cnf(261,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(split_conjunct,[status(thm)],[93]) ).
fof(279,plain,
! [X1,X2,X13,X16,X17,X18] :
( ~ rdn_translate(X1,rdn_neg(X16))
| ~ rdn_translate(X2,rdn_neg(X17))
| ~ rdn_add_with_carry(rdnn(n0),X16,X17,X18)
| ~ rdn_translate(X13,rdn_neg(X18))
| sum(X1,X2,X13) ),
inference(fof_nnf,[status(thm)],[107]) ).
fof(280,plain,
! [X19,X20,X21,X22,X23,X24] :
( ~ rdn_translate(X19,rdn_neg(X22))
| ~ rdn_translate(X20,rdn_neg(X23))
| ~ rdn_add_with_carry(rdnn(n0),X22,X23,X24)
| ~ rdn_translate(X21,rdn_neg(X24))
| sum(X19,X20,X21) ),
inference(variable_rename,[status(thm)],[279]) ).
cnf(281,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_neg(X4))
| ~ rdn_add_with_carry(rdnn(n0),X5,X6,X4)
| ~ rdn_translate(X2,rdn_neg(X6))
| ~ rdn_translate(X1,rdn_neg(X5)) ),
inference(split_conjunct,[status(thm)],[280]) ).
fof(322,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)],[134]) ).
fof(323,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)],[322]) ).
cnf(324,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)],[323]) ).
cnf(333,plain,
rdn_digit_add(rdnn(n2),rdnn(n5),rdnn(n7),rdnn(n0)),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(346,negated_conjecture,
~ sum(nn2,nn5,nn7),
inference(split_conjunct,[status(thm)],[154]) ).
cnf(376,plain,
( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n7))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n7),rdnn(n0)) ),
inference(spm,[status(thm)],[324,253,theory(equality)]) ).
cnf(990,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_neg(rdnn(n7)))
| ~ rdn_translate(X2,rdn_neg(rdnn(X4)))
| ~ rdn_translate(X1,rdn_neg(rdnn(X5)))
| ~ rdn_digit_add(rdnn(X5),rdnn(X4),rdnn(n7),rdnn(n0)) ),
inference(spm,[status(thm)],[281,376,theory(equality)]) ).
cnf(2102,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_neg(rdnn(n7)))
| ~ rdn_translate(X2,rdn_neg(rdnn(n5)))
| ~ rdn_translate(X1,rdn_neg(rdnn(n2))) ),
inference(spm,[status(thm)],[990,333,theory(equality)]) ).
cnf(2166,plain,
( sum(X1,X2,nn7)
| ~ rdn_translate(X2,rdn_neg(rdnn(n5)))
| ~ rdn_translate(X1,rdn_neg(rdnn(n2))) ),
inference(spm,[status(thm)],[2102,255,theory(equality)]) ).
cnf(2167,plain,
( sum(X1,nn5,nn7)
| ~ rdn_translate(X1,rdn_neg(rdnn(n2))) ),
inference(spm,[status(thm)],[2166,221,theory(equality)]) ).
cnf(2168,plain,
sum(nn2,nn5,nn7),
inference(spm,[status(thm)],[2167,261,theory(equality)]) ).
cnf(2169,plain,
$false,
inference(sr,[status(thm)],[2168,346,theory(equality)]) ).
cnf(2170,plain,
$false,
2169,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM315+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 : n092.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 00:52:00 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.28 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 0.07/0.46 -running prover on /export/starexec/sandbox2/tmp/tmpRCMK6S/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.46 -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/tmpRCMK6S/sel_theBenchmark.p_1']
% 0.07/0.46 -prover status CounterSatisfiable
% 0.07/0.46 -running prover on /export/starexec/sandbox2/tmp/tmpRCMK6S/sel_theBenchmark.p_2 with time limit 89
% 0.07/0.46 -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/tmpRCMK6S/sel_theBenchmark.p_2']
% 0.07/0.46 -prover status CounterSatisfiable
% 0.07/0.46 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 0.07/0.57 -running prover on /export/starexec/sandbox2/tmp/tmpRCMK6S/sel_theBenchmark.p_3 with time limit 119
% 0.07/0.57 -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/tmpRCMK6S/sel_theBenchmark.p_3']
% 0.07/0.57 -prover status CounterSatisfiable
% 0.07/0.57 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 0.41/0.75 -running prover on /export/starexec/sandbox2/tmp/tmpRCMK6S/sel_theBenchmark.p_4 with time limit 149
% 0.41/0.75 -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/tmpRCMK6S/sel_theBenchmark.p_4']
% 0.41/0.75 -prover status Theorem
% 0.41/0.75 Problem theBenchmark.p solved in phase 3.
% 0.41/0.75 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.41/0.75 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.41/0.75 Solved 1 out of 1.
% 0.41/0.75 # Problem is unsatisfiable (or provable), constructing proof object
% 0.41/0.75 # SZS status Theorem
% 0.41/0.75 # SZS output start CNFRefutation.
% See solution above
% 0.41/0.77 # SZS output end CNFRefutation
%------------------------------------------------------------------------------