TSTP Solution File: NUM293+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM293+1 : TPTP v7.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n138.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:05 EST 2018
% Result : Theorem 242.41s
% Output : CNFRefutation 242.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 16 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 51 ( 27 ~; 19 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 6 sgn 26 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(17,axiom,
! [X1] :
( rdn_non_zero_digit(rdnn(X1))
=> rdn_non_zero(rdnn(X1)) ),
file('/export/starexec/sandbox/tmp/tmpNmUji7/sel_theBenchmark.p_5',rdn_non_zero_by_digit) ).
fof(28,axiom,
rdn_non_zero_digit(rdnn(n1)),
file('/export/starexec/sandbox/tmp/tmpNmUji7/sel_theBenchmark.p_5',rdn_digit1) ).
fof(72,axiom,
rdn_translate(n3,rdn_pos(rdnn(n3))),
file('/export/starexec/sandbox/tmp/tmpNmUji7/sel_theBenchmark.p_5',rdn3) ).
fof(81,axiom,
rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
file('/export/starexec/sandbox/tmp/tmpNmUji7/sel_theBenchmark.p_5',rdn13) ).
fof(121,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/tmpNmUji7/sel_theBenchmark.p_5',less_entry_point_pos_pos) ).
fof(141,axiom,
! [X29,X26,X27] :
( rdn_non_zero(X27)
=> rdn_positive_less(rdnn(X29),rdn(rdnn(X26),X27)) ),
file('/export/starexec/sandbox/tmp/tmpNmUji7/sel_theBenchmark.p_5',rdn_extra_digits_positive_less) ).
fof(154,conjecture,
? [X1] : less(X1,n13),
file('/export/starexec/sandbox/tmp/tmpNmUji7/sel_theBenchmark.p_5',something_less_n13) ).
fof(155,negated_conjecture,
~ ? [X1] : less(X1,n13),
inference(assume_negation,[status(cth)],[154]) ).
fof(177,plain,
! [X1] :
( ~ rdn_non_zero_digit(rdnn(X1))
| rdn_non_zero(rdnn(X1)) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(178,plain,
! [X2] :
( ~ rdn_non_zero_digit(rdnn(X2))
| rdn_non_zero(rdnn(X2)) ),
inference(variable_rename,[status(thm)],[177]) ).
cnf(179,plain,
( rdn_non_zero(rdnn(X1))
| ~ rdn_non_zero_digit(rdnn(X1)) ),
inference(split_conjunct,[status(thm)],[178]) ).
cnf(194,plain,
rdn_non_zero_digit(rdnn(n1)),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(244,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(253,plain,
rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
inference(split_conjunct,[status(thm)],[81]) ).
fof(307,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)],[121]) ).
fof(308,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)],[307]) ).
cnf(309,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)],[308]) ).
fof(344,plain,
! [X29,X26,X27] :
( ~ rdn_non_zero(X27)
| rdn_positive_less(rdnn(X29),rdn(rdnn(X26),X27)) ),
inference(fof_nnf,[status(thm)],[141]) ).
fof(345,plain,
! [X30,X31,X32] :
( ~ rdn_non_zero(X32)
| rdn_positive_less(rdnn(X30),rdn(rdnn(X31),X32)) ),
inference(variable_rename,[status(thm)],[344]) ).
cnf(346,plain,
( rdn_positive_less(rdnn(X1),rdn(rdnn(X2),X3))
| ~ rdn_non_zero(X3) ),
inference(split_conjunct,[status(thm)],[345]) ).
fof(361,negated_conjecture,
! [X1] : ~ less(X1,n13),
inference(fof_nnf,[status(thm)],[155]) ).
fof(362,negated_conjecture,
! [X2] : ~ less(X2,n13),
inference(variable_rename,[status(thm)],[361]) ).
cnf(363,negated_conjecture,
~ less(X1,n13),
inference(split_conjunct,[status(thm)],[362]) ).
cnf(393,plain,
( less(X1,n13)
| ~ rdn_translate(X1,rdn_pos(X2))
| ~ rdn_positive_less(X2,rdn(rdnn(n3),rdnn(n1))) ),
inference(spm,[status(thm)],[309,253,theory(equality)]) ).
cnf(394,plain,
( ~ rdn_translate(X1,rdn_pos(X2))
| ~ rdn_positive_less(X2,rdn(rdnn(n3),rdnn(n1))) ),
inference(sr,[status(thm)],[393,363,theory(equality)]) ).
cnf(585,plain,
( ~ rdn_translate(X1,rdn_pos(rdnn(X2)))
| ~ rdn_non_zero(rdnn(n1)) ),
inference(spm,[status(thm)],[394,346,theory(equality)]) ).
cnf(588,plain,
~ rdn_non_zero(rdnn(n1)),
inference(spm,[status(thm)],[585,244,theory(equality)]) ).
cnf(598,plain,
~ rdn_non_zero_digit(rdnn(n1)),
inference(spm,[status(thm)],[588,179,theory(equality)]) ).
cnf(599,plain,
$false,
inference(rw,[status(thm)],[598,194,theory(equality)]) ).
cnf(600,plain,
$false,
inference(cn,[status(thm)],[599,theory(equality)]) ).
cnf(601,plain,
$false,
600,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM293+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 : n138.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 00:31:15 CST 2018
% 0.03/0.23 % CPUTime :
% 0.07/0.30 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.31 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 29.13/29.41 eprover: CPU time limit exceeded, terminating
% 110.16/110.61 eprover: CPU time limit exceeded, terminating
% 110.16/110.65 -running prover on /export/starexec/sandbox/tmp/tmpNmUji7/sel_theBenchmark.p_1 with time limit 29
% 110.16/110.65 -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/tmpNmUji7/sel_theBenchmark.p_1']
% 110.16/110.65 -prover status ResourceOut
% 110.16/110.65 -running prover on /export/starexec/sandbox/tmp/tmpNmUji7/sel_theBenchmark.p_2 with time limit 81
% 110.16/110.65 -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/tmpNmUji7/sel_theBenchmark.p_2']
% 110.16/110.65 -prover status ResourceOut
% 110.16/110.65 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 185.20/185.76 eprover: CPU time limit exceeded, terminating
% 185.29/185.82 -running prover on /export/starexec/sandbox/tmp/tmpNmUji7/sel_theBenchmark.p_3 with time limit 75
% 185.29/185.82 -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/tmpNmUji7/sel_theBenchmark.p_3']
% 185.29/185.82 -prover status ResourceOut
% 185.29/185.82 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 242.32/242.90 eprover: CPU time limit exceeded, terminating
% 242.32/242.96 -running prover on /export/starexec/sandbox/tmp/tmpNmUji7/sel_theBenchmark.p_4 with time limit 57
% 242.32/242.96 -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/tmpNmUji7/sel_theBenchmark.p_4']
% 242.32/242.96 -prover status ResourceOut
% 242.32/242.96 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 242.41/243.06 -running prover on /export/starexec/sandbox/tmp/tmpNmUji7/sel_theBenchmark.p_5 with time limit 57
% 242.41/243.06 -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/tmpNmUji7/sel_theBenchmark.p_5']
% 242.41/243.06 -prover status Theorem
% 242.41/243.06 Problem theBenchmark.p solved in phase 4.
% 242.41/243.06 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 242.41/243.06 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 242.41/243.06 Solved 1 out of 1.
% 242.41/243.06 # Problem is unsatisfiable (or provable), constructing proof object
% 242.41/243.06 # SZS status Theorem
% 242.41/243.06 # SZS output start CNFRefutation.
% See solution above
% 242.41/243.08 # SZS output end CNFRefutation
%------------------------------------------------------------------------------