TSTP Solution File: NUM292+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM292+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 08:24:05 EDT 2022
% Result : Theorem 8.00s 2.35s
% Output : CNFRefutation 8.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 10 unt; 0 nHn; 16 RR)
% Number of literals : 32 ( 0 equ; 17 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 20 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( less(X1,X2)
| ~ rdn_positive_less(X3,X4)
| ~ rdn_translate(X2,rdn_pos(X4))
| ~ rdn_translate(X1,rdn_pos(X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ajosmo9m/lgb.p',i_0_8) ).
cnf(i_0_20,plain,
rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ajosmo9m/lgb.p',i_0_20) ).
cnf(i_0_139,plain,
( rdn_positive_less(rdnn(X1),rdn(rdnn(X2),X3))
| ~ rdn_non_zero(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ajosmo9m/lgb.p',i_0_139) ).
cnf(i_0_22,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ajosmo9m/lgb.p',i_0_22) ).
cnf(i_0_18,negated_conjecture,
~ less(n2,n13),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ajosmo9m/lgb.p',i_0_18) ).
cnf(i_0_140,plain,
( rdn_non_zero(rdnn(X1))
| ~ rdn_non_zero_digit(rdnn(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ajosmo9m/lgb.p',i_0_140) ).
cnf(i_0_30,plain,
rdn_non_zero_digit(rdnn(n1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ajosmo9m/lgb.p',i_0_30) ).
cnf(c_0_148,plain,
( less(X1,X2)
| ~ rdn_positive_less(X3,X4)
| ~ rdn_translate(X2,rdn_pos(X4))
| ~ rdn_translate(X1,rdn_pos(X3)) ),
i_0_8 ).
cnf(c_0_149,plain,
rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
i_0_20 ).
cnf(c_0_150,plain,
( less(X1,n13)
| ~ rdn_positive_less(X2,rdn(rdnn(n3),rdnn(n1)))
| ~ rdn_translate(X1,rdn_pos(X2)) ),
inference(spm,[status(thm)],[c_0_148,c_0_149]) ).
cnf(c_0_151,plain,
( rdn_positive_less(rdnn(X1),rdn(rdnn(X2),X3))
| ~ rdn_non_zero(X3) ),
i_0_139 ).
cnf(c_0_152,plain,
( less(X1,n13)
| ~ rdn_non_zero(rdnn(n1))
| ~ rdn_translate(X1,rdn_pos(rdnn(X2))) ),
inference(spm,[status(thm)],[c_0_150,c_0_151]) ).
cnf(c_0_153,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
i_0_22 ).
cnf(c_0_154,negated_conjecture,
~ less(n2,n13),
i_0_18 ).
cnf(c_0_155,plain,
~ rdn_non_zero(rdnn(n1)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_153]),c_0_154]) ).
cnf(c_0_156,plain,
( rdn_non_zero(rdnn(X1))
| ~ rdn_non_zero_digit(rdnn(X1)) ),
i_0_140 ).
cnf(c_0_157,plain,
rdn_non_zero_digit(rdnn(n1)),
i_0_30 ).
cnf(c_0_158,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_156]),c_0_157])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM292+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jul 6 18:31:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.00/2.35 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.00/2.35 # No SInE strategy applied
% 8.00/2.35 # Trying AutoSched0 for 150 seconds
% 8.00/2.35 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 8.00/2.35 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.00/2.35 #
% 8.00/2.35 # Preprocessing time : 0.013 s
% 8.00/2.35
% 8.00/2.35 # Proof found!
% 8.00/2.35 # SZS status Theorem
% 8.00/2.35 # SZS output start CNFRefutation
% See solution above
% 8.00/2.35 # Training examples: 0 positive, 0 negative
% 8.00/2.35
% 8.00/2.35 # -------------------------------------------------
% 8.00/2.35 # User time : 0.013 s
% 8.00/2.35 # System time : 0.006 s
% 8.00/2.35 # Total time : 0.020 s
% 8.00/2.35 # Maximum resident set size: 7120 pages
% 8.00/2.35
%------------------------------------------------------------------------------