TSTP Solution File: KLE001+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE001+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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 : Sun Jul 17 01:49:27 EDT 2022
% Result : Theorem 7.35s 2.76s
% Output : CNFRefutation 7.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 5 RR)
% Number of literals : 10 ( 4 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q9qh69l3/lgb.p',i_0_12) ).
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q9qh69l3/lgb.p',i_0_3) ).
cnf(i_0_5,negated_conjecture,
~ leq(addition(esk1_0,esk3_0),addition(esk1_0,esk3_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q9qh69l3/lgb.p',i_0_5) ).
cnf(c_0_16,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_12 ).
cnf(c_0_17,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_18,negated_conjecture,
~ leq(addition(esk1_0,esk3_0),addition(esk1_0,esk3_0)),
i_0_5 ).
cnf(c_0_19,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : KLE001+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n027.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jun 16 14:57:37 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected SinE mode:
% 0.21/0.48 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.35/2.76 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.35/2.76 # No SInE strategy applied
% 7.35/2.76 # Trying AutoSched0 for 150 seconds
% 7.35/2.76 # AutoSched0-Mode selected heuristic H_____047_C18_F1_AE_R8_CS_SP_S2S
% 7.35/2.76 # and selection function SelectNewComplexAHP.
% 7.35/2.76 #
% 7.35/2.76 # Preprocessing time : 0.012 s
% 7.35/2.76
% 7.35/2.76 # Proof found!
% 7.35/2.76 # SZS status Theorem
% 7.35/2.76 # SZS output start CNFRefutation
% See solution above
% 7.35/2.76 # Training examples: 0 positive, 0 negative
% 7.35/2.76
% 7.35/2.76 # -------------------------------------------------
% 7.35/2.76 # User time : 0.011 s
% 7.35/2.76 # System time : 0.007 s
% 7.35/2.76 # Total time : 0.018 s
% 7.35/2.76 # Maximum resident set size: 7120 pages
% 7.35/2.76
%------------------------------------------------------------------------------