TSTP Solution File: NUM340+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM340+1 : TPTP v7.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n041.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:10 EST 2018
% Result : Theorem 0.30s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 13 unt; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 82 ( 39 ~; 34 |; 6 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 75 ( 0 sgn 44 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(14,axiom,
rdn_digit_add(rdnn(n0),rdnn(n0),rdnn(n0),rdnn(n0)),
file('/export/starexec/sandbox/tmp/tmpvww8kx/sel_theBenchmark.p_4',rdn_digit_add_n0_n0_n0_n0) ).
fof(54,axiom,
! [X1,X2,X13,X16,X17,X18] :
( ( rdn_translate(X1,rdn_pos(X16))
& rdn_translate(X2,rdn_pos(X17))
& rdn_add_with_carry(rdnn(n0),X16,X17,X18)
& rdn_translate(X13,rdn_pos(X18)) )
=> sum(X1,X2,X13) ),
file('/export/starexec/sandbox/tmp/tmpvww8kx/sel_theBenchmark.p_4',sum_entry_point_pos_pos) ).
fof(68,axiom,
rdn_translate(n0,rdn_pos(rdnn(n0))),
file('/export/starexec/sandbox/tmp/tmpvww8kx/sel_theBenchmark.p_4',rdn0) ).
fof(130,axiom,
! [X1,X2,X13] :
( sum(X2,X13,X1)
<=> difference(X1,X2,X13) ),
file('/export/starexec/sandbox/tmp/tmpvww8kx/sel_theBenchmark.p_4',minus_entry_point) ).
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/sandbox/tmp/tmpvww8kx/sel_theBenchmark.p_4',add_digit_digit_digit) ).
fof(150,conjecture,
? [X1] : difference(X1,n0,X1),
file('/export/starexec/sandbox/tmp/tmpvww8kx/sel_theBenchmark.p_4',diff_zero_identity) ).
fof(151,negated_conjecture,
~ ? [X1] : difference(X1,n0,X1),
inference(assume_negation,[status(cth)],[150]) ).
cnf(165,plain,
rdn_digit_add(rdnn(n0),rdnn(n0),rdnn(n0),rdnn(n0)),
inference(split_conjunct,[status(thm)],[14]) ).
fof(215,plain,
! [X1,X2,X13,X16,X17,X18] :
( ~ rdn_translate(X1,rdn_pos(X16))
| ~ rdn_translate(X2,rdn_pos(X17))
| ~ rdn_add_with_carry(rdnn(n0),X16,X17,X18)
| ~ rdn_translate(X13,rdn_pos(X18))
| sum(X1,X2,X13) ),
inference(fof_nnf,[status(thm)],[54]) ).
fof(216,plain,
! [X19,X20,X21,X22,X23,X24] :
( ~ rdn_translate(X19,rdn_pos(X22))
| ~ rdn_translate(X20,rdn_pos(X23))
| ~ rdn_add_with_carry(rdnn(n0),X22,X23,X24)
| ~ rdn_translate(X21,rdn_pos(X24))
| sum(X19,X20,X21) ),
inference(variable_rename,[status(thm)],[215]) ).
cnf(217,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(X4))
| ~ rdn_add_with_carry(rdnn(n0),X5,X6,X4)
| ~ rdn_translate(X2,rdn_pos(X6))
| ~ rdn_translate(X1,rdn_pos(X5)) ),
inference(split_conjunct,[status(thm)],[216]) ).
cnf(231,plain,
rdn_translate(n0,rdn_pos(rdnn(n0))),
inference(split_conjunct,[status(thm)],[68]) ).
fof(313,plain,
! [X1,X2,X13] :
( ( ~ sum(X2,X13,X1)
| difference(X1,X2,X13) )
& ( ~ difference(X1,X2,X13)
| sum(X2,X13,X1) ) ),
inference(fof_nnf,[status(thm)],[130]) ).
fof(314,plain,
! [X14,X15,X16] :
( ( ~ sum(X15,X16,X14)
| difference(X14,X15,X16) )
& ( ~ difference(X14,X15,X16)
| sum(X15,X16,X14) ) ),
inference(variable_rename,[status(thm)],[313]) ).
cnf(316,plain,
( difference(X1,X2,X3)
| ~ sum(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[314]) ).
fof(320,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(321,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)],[320]) ).
cnf(322,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)],[321]) ).
fof(344,negated_conjecture,
! [X1] : ~ difference(X1,n0,X1),
inference(fof_nnf,[status(thm)],[151]) ).
fof(345,negated_conjecture,
! [X2] : ~ difference(X2,n0,X2),
inference(variable_rename,[status(thm)],[344]) ).
cnf(346,negated_conjecture,
~ difference(X1,n0,X1),
inference(split_conjunct,[status(thm)],[345]) ).
cnf(347,negated_conjecture,
~ sum(n0,X1,X1),
inference(spm,[status(thm)],[346,316,theory(equality)]) ).
cnf(368,plain,
( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n0))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n0),rdnn(n0)) ),
inference(spm,[status(thm)],[322,165,theory(equality)]) ).
cnf(576,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(rdnn(n0)))
| ~ rdn_translate(X2,rdn_pos(rdnn(X4)))
| ~ rdn_translate(X1,rdn_pos(rdnn(X5)))
| ~ rdn_digit_add(rdnn(X5),rdnn(X4),rdnn(n0),rdnn(n0)) ),
inference(spm,[status(thm)],[217,368,theory(equality)]) ).
cnf(1595,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(rdnn(n0)))
| ~ rdn_translate(X2,rdn_pos(rdnn(n0)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n0))) ),
inference(spm,[status(thm)],[576,165,theory(equality)]) ).
cnf(1596,plain,
( sum(X1,X2,n0)
| ~ rdn_translate(X2,rdn_pos(rdnn(n0)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n0))) ),
inference(spm,[status(thm)],[1595,231,theory(equality)]) ).
cnf(1597,plain,
( sum(X1,n0,n0)
| ~ rdn_translate(X1,rdn_pos(rdnn(n0))) ),
inference(spm,[status(thm)],[1596,231,theory(equality)]) ).
cnf(1598,plain,
sum(n0,n0,n0),
inference(spm,[status(thm)],[1597,231,theory(equality)]) ).
cnf(1599,plain,
$false,
inference(sr,[status(thm)],[1598,347,theory(equality)]) ).
cnf(1600,plain,
$false,
1599,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM340+1 : TPTP v7.0.0. Released v3.1.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.23 % Computer : n041.star.cs.uiowa.edu
% 0.03/0.23 % Model : x86_64 x86_64
% 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23 % Memory : 32218.625MB
% 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.23 % CPULimit : 300
% 0.03/0.23 % DateTime : Fri Jan 5 01:20:00 CST 2018
% 0.03/0.23 % CPUTime :
% 0.03/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.28 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 0.06/0.43 -running prover on /export/starexec/sandbox/tmp/tmpvww8kx/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.43 -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/tmpvww8kx/sel_theBenchmark.p_1']
% 0.06/0.43 -prover status CounterSatisfiable
% 0.06/0.43 -running prover on /export/starexec/sandbox/tmp/tmpvww8kx/sel_theBenchmark.p_2 with time limit 89
% 0.06/0.43 -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/tmpvww8kx/sel_theBenchmark.p_2']
% 0.06/0.43 -prover status CounterSatisfiable
% 0.06/0.43 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 0.06/0.50 -running prover on /export/starexec/sandbox/tmp/tmpvww8kx/sel_theBenchmark.p_3 with time limit 119
% 0.06/0.50 -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/tmpvww8kx/sel_theBenchmark.p_3']
% 0.06/0.50 -prover status CounterSatisfiable
% 0.06/0.50 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 0.30/0.63 -running prover on /export/starexec/sandbox/tmp/tmpvww8kx/sel_theBenchmark.p_4 with time limit 149
% 0.30/0.63 -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/tmpvww8kx/sel_theBenchmark.p_4']
% 0.30/0.63 -prover status Theorem
% 0.30/0.63 Problem theBenchmark.p solved in phase 3.
% 0.30/0.63 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.30/0.63 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.30/0.63 Solved 1 out of 1.
% 0.30/0.63 # Problem is unsatisfiable (or provable), constructing proof object
% 0.30/0.63 # SZS status Theorem
% 0.30/0.63 # SZS output start CNFRefutation.
% See solution above
% 0.30/0.65 # SZS output end CNFRefutation
%------------------------------------------------------------------------------