TSTP Solution File: KLE089+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE089+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:50:04 EDT 2022
% Result : Theorem 7.66s 2.47s
% Output : CNFRefutation 7.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 6 RR)
% Number of literals : 16 ( 15 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j5ggexc_/lgb.p',i_0_4) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j5ggexc_/lgb.p',i_0_2) ).
cnf(i_0_16,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j5ggexc_/lgb.p',i_0_16) ).
cnf(i_0_9,plain,
multiplication(antidomain(X1),X1) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j5ggexc_/lgb.p',i_0_9) ).
cnf(i_0_14,negated_conjecture,
addition(antidomain(antidomain(esk1_0)),antidomain(esk2_0)) = antidomain(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j5ggexc_/lgb.p',i_0_14) ).
cnf(i_0_13,negated_conjecture,
multiplication(antidomain(antidomain(esk1_0)),esk2_0) != zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j5ggexc_/lgb.p',i_0_13) ).
cnf(c_0_23,plain,
addition(X1,zero) = X1,
i_0_4 ).
cnf(c_0_24,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_25,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_16 ).
cnf(c_0_26,plain,
multiplication(antidomain(X1),X1) = zero,
i_0_9 ).
cnf(c_0_27,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
addition(antidomain(antidomain(esk1_0)),antidomain(esk2_0)) = antidomain(esk2_0),
i_0_14 ).
cnf(c_0_29,plain,
multiplication(addition(antidomain(X1),X2),X1) = multiplication(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
addition(antidomain(esk2_0),antidomain(antidomain(esk1_0))) = antidomain(esk2_0),
inference(rw,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
multiplication(antidomain(antidomain(esk1_0)),esk2_0) != zero,
i_0_13 ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_26]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : KLE089+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.15 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.37 % Computer : n021.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Thu Jun 16 09:57:01 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.23/0.47 # ENIGMATIC: Selected SinE mode:
% 0.23/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.23/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.23/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.23/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.66/2.47 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.66/2.47 # No SInE strategy applied
% 7.66/2.47 # Trying AutoSched0 for 150 seconds
% 7.66/2.47 # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 7.66/2.47 # and selection function SelectNewComplexAHP.
% 7.66/2.47 #
% 7.66/2.47 # Preprocessing time : 0.023 s
% 7.66/2.47 # Presaturation interreduction done
% 7.66/2.47
% 7.66/2.47 # Proof found!
% 7.66/2.47 # SZS status Theorem
% 7.66/2.47 # SZS output start CNFRefutation
% See solution above
% 7.66/2.47 # Training examples: 0 positive, 0 negative
% 7.66/2.47
% 7.66/2.47 # -------------------------------------------------
% 7.66/2.47 # User time : 0.028 s
% 7.66/2.47 # System time : 0.008 s
% 7.66/2.47 # Total time : 0.036 s
% 7.66/2.47 # Maximum resident set size: 7128 pages
% 7.66/2.47
%------------------------------------------------------------------------------