TSTP Solution File: NUM346+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM346+1 : TPTP v7.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n103.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 185.33s
% Output : CNFRefutation 185.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 52 ( 22 unt; 0 def)
% Number of atoms : 117 ( 3 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 118 ( 53 ~; 49 |; 10 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 96 ( 0 sgn 59 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(16,axiom,
! [X1,X2,X5,X6] :
( ( sum(X1,X2,X5)
& sum(X1,X2,X6) )
=> equal(X5,X6) ),
file('/export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_4',unique_sum) ).
fof(55,axiom,
! [X1,X2,X15,X3,X4,X18] :
( ( rdn_translate(X1,rdn_pos(X3))
& rdn_translate(X2,rdn_pos(X4))
& rdn_add_with_carry(rdnn(n0),X3,X4,X18)
& rdn_translate(X15,rdn_pos(X18)) )
=> sum(X1,X2,X15) ),
file('/export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_4',sum_entry_point_pos_pos) ).
fof(65,axiom,
rdn_translate(n4,rdn_pos(rdnn(n4))),
file('/export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_4',rdn4) ).
fof(66,axiom,
rdn_translate(n5,rdn_pos(rdnn(n5))),
file('/export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_4',rdn5) ).
fof(71,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_4',rdn2) ).
fof(72,axiom,
rdn_translate(n3,rdn_pos(rdnn(n3))),
file('/export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_4',rdn3) ).
fof(81,axiom,
rdn_positive_less(rdnn(n4),rdnn(n5)),
file('/export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_4',rdn_positive_less45) ).
fof(95,axiom,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_4',rdn_digit_add_n2_n3_n5_n0) ).
fof(120,axiom,
! [X1,X2,X3,X4] :
( ( rdn_translate(X1,rdn_pos(X3))
& rdn_translate(X2,rdn_pos(X4))
& rdn_positive_less(X3,X4) )
=> less(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_4',less_entry_point_pos_pos) ).
fof(134,axiom,
! [X7,X8,X10,X11,X20] :
( ( rdn_digit_add(rdnn(X8),rdnn(X10),rdnn(X20),rdnn(n0))
& rdn_digit_add(rdnn(X20),rdnn(X7),rdnn(X11),rdnn(n0)) )
=> rdn_add_with_carry(rdnn(X7),rdnn(X8),rdnn(X10),rdnn(X11)) ),
file('/export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_4',add_digit_digit_digit) ).
fof(144,axiom,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_4',rdn_digit_add_n5_n0_n5_n0) ).
fof(153,conjecture,
! [X1] :
( sum(n2,n3,X1)
=> less(n4,X1) ),
file('/export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_4',sum_n2_n3_greater_n4) ).
fof(154,negated_conjecture,
~ ! [X1] :
( sum(n2,n3,X1)
=> less(n4,X1) ),
inference(assume_negation,[status(cth)],[153]) ).
fof(173,plain,
! [X1,X2,X5,X6] :
( ~ sum(X1,X2,X5)
| ~ sum(X1,X2,X6)
| equal(X5,X6) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(174,plain,
! [X7,X8,X9,X10] :
( ~ sum(X7,X8,X9)
| ~ sum(X7,X8,X10)
| equal(X9,X10) ),
inference(variable_rename,[status(thm)],[173]) ).
cnf(175,plain,
( X1 = X2
| ~ sum(X3,X4,X2)
| ~ sum(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[174]) ).
fof(224,plain,
! [X1,X2,X15,X3,X4,X18] :
( ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X2,rdn_pos(X4))
| ~ rdn_add_with_carry(rdnn(n0),X3,X4,X18)
| ~ rdn_translate(X15,rdn_pos(X18))
| sum(X1,X2,X15) ),
inference(fof_nnf,[status(thm)],[55]) ).
fof(225,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)],[224]) ).
cnf(226,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)],[225]) ).
cnf(236,plain,
rdn_translate(n4,rdn_pos(rdnn(n4))),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(237,plain,
rdn_translate(n5,rdn_pos(rdnn(n5))),
inference(split_conjunct,[status(thm)],[66]) ).
cnf(242,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(split_conjunct,[status(thm)],[71]) ).
cnf(243,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(252,plain,
rdn_positive_less(rdnn(n4),rdnn(n5)),
inference(split_conjunct,[status(thm)],[81]) ).
cnf(270,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
inference(split_conjunct,[status(thm)],[95]) ).
fof(305,plain,
! [X1,X2,X3,X4] :
( ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X2,rdn_pos(X4))
| ~ rdn_positive_less(X3,X4)
| less(X1,X2) ),
inference(fof_nnf,[status(thm)],[120]) ).
fof(306,plain,
! [X5,X6,X7,X8] :
( ~ rdn_translate(X5,rdn_pos(X7))
| ~ rdn_translate(X6,rdn_pos(X8))
| ~ rdn_positive_less(X7,X8)
| less(X5,X6) ),
inference(variable_rename,[status(thm)],[305]) ).
cnf(307,plain,
( less(X1,X2)
| ~ rdn_positive_less(X3,X4)
| ~ rdn_translate(X2,rdn_pos(X4))
| ~ rdn_translate(X1,rdn_pos(X3)) ),
inference(split_conjunct,[status(thm)],[306]) ).
fof(329,plain,
! [X7,X8,X10,X11,X20] :
( ~ rdn_digit_add(rdnn(X8),rdnn(X10),rdnn(X20),rdnn(n0))
| ~ rdn_digit_add(rdnn(X20),rdnn(X7),rdnn(X11),rdnn(n0))
| rdn_add_with_carry(rdnn(X7),rdnn(X8),rdnn(X10),rdnn(X11)) ),
inference(fof_nnf,[status(thm)],[134]) ).
fof(330,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)],[329]) ).
cnf(331,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)],[330]) ).
cnf(348,plain,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
inference(split_conjunct,[status(thm)],[144]) ).
fof(359,negated_conjecture,
? [X1] :
( sum(n2,n3,X1)
& ~ less(n4,X1) ),
inference(fof_nnf,[status(thm)],[154]) ).
fof(360,negated_conjecture,
? [X2] :
( sum(n2,n3,X2)
& ~ less(n4,X2) ),
inference(variable_rename,[status(thm)],[359]) ).
fof(361,negated_conjecture,
( sum(n2,n3,esk1_0)
& ~ less(n4,esk1_0) ),
inference(skolemize,[status(esa)],[360]) ).
cnf(362,negated_conjecture,
~ less(n4,esk1_0),
inference(split_conjunct,[status(thm)],[361]) ).
cnf(363,negated_conjecture,
sum(n2,n3,esk1_0),
inference(split_conjunct,[status(thm)],[361]) ).
cnf(369,negated_conjecture,
( X1 = esk1_0
| ~ sum(n2,n3,X1) ),
inference(spm,[status(thm)],[175,363,theory(equality)]) ).
cnf(388,plain,
( less(X1,n5)
| ~ rdn_translate(X1,rdn_pos(X2))
| ~ rdn_positive_less(X2,rdnn(n5)) ),
inference(spm,[status(thm)],[307,237,theory(equality)]) ).
cnf(459,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)],[331,348,theory(equality)]) ).
cnf(708,plain,
( less(n4,n5)
| ~ rdn_positive_less(rdnn(n4),rdnn(n5)) ),
inference(spm,[status(thm)],[388,236,theory(equality)]) ).
cnf(716,plain,
( less(n4,n5)
| $false ),
inference(rw,[status(thm)],[708,252,theory(equality)]) ).
cnf(717,plain,
less(n4,n5),
inference(cn,[status(thm)],[716,theory(equality)]) ).
cnf(1170,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(rdnn(n5)))
| ~ rdn_translate(X2,rdn_pos(rdnn(X5)))
| ~ rdn_translate(X1,rdn_pos(rdnn(X4)))
| ~ rdn_digit_add(rdnn(X4),rdnn(X5),rdnn(n5),rdnn(n0)) ),
inference(spm,[status(thm)],[226,459,theory(equality)]) ).
cnf(3227,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(rdnn(n5)))
| ~ rdn_translate(X2,rdn_pos(rdnn(n3)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(spm,[status(thm)],[1170,270,theory(equality)]) ).
cnf(3238,plain,
( sum(X1,X2,n5)
| ~ rdn_translate(X2,rdn_pos(rdnn(n3)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(spm,[status(thm)],[3227,237,theory(equality)]) ).
cnf(3239,plain,
( sum(X1,n3,n5)
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(spm,[status(thm)],[3238,243,theory(equality)]) ).
cnf(3240,plain,
sum(n2,n3,n5),
inference(spm,[status(thm)],[3239,242,theory(equality)]) ).
cnf(3244,negated_conjecture,
n5 = esk1_0,
inference(spm,[status(thm)],[369,3240,theory(equality)]) ).
cnf(3247,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[362,3244,theory(equality)]),717,theory(equality)]) ).
cnf(3248,negated_conjecture,
$false,
inference(cn,[status(thm)],[3247,theory(equality)]) ).
cnf(3249,negated_conjecture,
$false,
3248,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM346+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 : n103.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:23: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]
% 29.06/29.36 eprover: CPU time limit exceeded, terminating
% 110.12/110.54 eprover: CPU time limit exceeded, terminating
% 110.22/110.60 -running prover on /export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_1 with time limit 29
% 110.22/110.60 -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/tmpLqa57V/sel_theBenchmark.p_1']
% 110.22/110.60 -prover status ResourceOut
% 110.22/110.60 -running prover on /export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_2 with time limit 81
% 110.22/110.60 -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=81', '/export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_2']
% 110.22/110.60 -prover status ResourceOut
% 110.22/110.60 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 185.21/185.71 eprover: CPU time limit exceeded, terminating
% 185.21/185.77 -running prover on /export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_3 with time limit 75
% 185.21/185.77 -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=75', '/export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_3']
% 185.21/185.77 -prover status ResourceOut
% 185.21/185.77 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 185.33/186.04 -running prover on /export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_4 with time limit 57
% 185.33/186.04 -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=57', '/export/starexec/sandbox/tmp/tmpLqa57V/sel_theBenchmark.p_4']
% 185.33/186.04 -prover status Theorem
% 185.33/186.04 Problem theBenchmark.p solved in phase 3.
% 185.33/186.04 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 185.33/186.04 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 185.33/186.04 Solved 1 out of 1.
% 185.33/186.04 # Problem is unsatisfiable (or provable), constructing proof object
% 185.33/186.04 # SZS status Theorem
% 185.33/186.04 # SZS output start CNFRefutation.
% See solution above
% 185.33/186.05 # SZS output end CNFRefutation
%------------------------------------------------------------------------------