↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : LCL548+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n028.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 11:44:59 AM UTC 2026

% Result   : Theorem 15.36s 4.27s
% Output   : CNFRefutation 15.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   36
% Syntax   : Number of clauses     :  112 (  64 unt;   0 nHn;  58 RR)
%            Number of literals    :  171 (  27 equ;  63 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :   21 (  19 usr;  19 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   1 con; 0-2 aty)
%            Number of variables   :  119 (  13 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_97,plain,
    ( is_a_theorem(X1)
    | ~ modus_ponens
    | ~ is_a_theorem(X2)
    | ~ is_a_theorem(implies(X2,X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_97) ).

cnf(i_0_68,plain,
    modus_ponens,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_68) ).

cnf(i_0_10,plain,
    ( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
    | ~ and_3 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_10) ).

cnf(i_0_61,plain,
    and_3,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_61) ).

cnf(i_0_140,plain,
    ( X1 = X2
    | ~ substitution_of_equivalents
    | ~ is_a_theorem(equiv(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_140) ).

cnf(i_0_144,plain,
    substitution_of_equivalents,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_144) ).

cnf(i_0_108,plain,
    ( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
    | ~ op_equiv ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_108) ).

cnf(i_0_70,plain,
    op_equiv,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_70) ).

cnf(i_0_79,plain,
    ( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
    | ~ implies_2 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_79) ).

cnf(i_0_66,plain,
    implies_2,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_66) ).

cnf(i_0_109,plain,
    ( not(and(X1,not(X2))) = implies(X1,X2)
    | ~ op_implies_and ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_109) ).

cnf(i_0_71,plain,
    op_implies_and,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_71) ).

cnf(i_0_6,plain,
    ( is_a_theorem(implies(and(X1,X2),X1))
    | ~ and_1 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_6) ).

cnf(i_0_59,plain,
    and_1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_59) ).

cnf(i_0_112,plain,
    ( not(and(not(X1),not(X2))) = or(X1,X2)
    | ~ op_or ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_112) ).

cnf(i_0_72,plain,
    op_or,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_72) ).

cnf(i_0_103,plain,
    ( is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1)))
    | ~ modus_tollens ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_103) ).

cnf(i_0_69,plain,
    modus_tollens,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_69) ).

cnf(i_0_117,plain,
    ( is_a_theorem(implies(X1,or(X1,X2)))
    | ~ or_1 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_117) ).

cnf(i_0_73,plain,
    or_1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_73) ).

cnf(i_0_119,plain,
    ( is_a_theorem(implies(X1,or(X2,X1)))
    | ~ or_2 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_119) ).

cnf(i_0_74,plain,
    or_2,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_74) ).

cnf(i_0_106,plain,
    ( is_a_theorem(necessarily(X1))
    | ~ necessitation
    | ~ is_a_theorem(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_106) ).

cnf(i_0_86,plain,
    necessitation,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_86) ).

cnf(i_0_115,plain,
    ( necessarily(implies(X1,X2)) = strict_implies(X1,X2)
    | ~ op_strict_implies ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_115) ).

cnf(i_0_137,plain,
    op_strict_implies,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_137) ).

cnf(i_0_113,plain,
    ( not(necessarily(not(X1))) = possibly(X1)
    | ~ op_possibly ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_113) ).

cnf(i_0_87,plain,
    op_possibly,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_87) ).

cnf(i_0_12,plain,
    ( is_a_theorem(implies(necessarily(X1),necessarily(necessarily(X1))))
    | ~ axiom_4 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_12) ).

cnf(i_0_82,plain,
    axiom_4,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_82) ).

cnf(i_0_20,plain,
    ( is_a_theorem(implies(necessarily(X1),X1))
    | ~ axiom_M ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_20) ).

cnf(i_0_85,plain,
    axiom_M,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_85) ).

cnf(i_0_39,plain,
    ( axiom_m9
    | ~ is_a_theorem(strict_implies(possibly(possibly(esk32_0)),possibly(esk32_0))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_39) ).

cnf(i_0_132,negated_conjecture,
    ~ axiom_m9,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_132) ).

cnf(i_0_77,plain,
    ( is_a_theorem(implies(X1,implies(X2,X1)))
    | ~ implies_1 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_77) ).

cnf(i_0_65,plain,
    implies_1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2g23f8_c/lgb.p',i_0_65) ).

cnf(c_0_181,plain,
    ( is_a_theorem(X1)
    | ~ modus_ponens
    | ~ is_a_theorem(X2)
    | ~ is_a_theorem(implies(X2,X1)) ),
    i_0_97 ).

cnf(c_0_182,plain,
    modus_ponens,
    i_0_68 ).

cnf(c_0_183,plain,
    ( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
    | ~ and_3 ),
    i_0_10 ).

cnf(c_0_184,plain,
    and_3,
    i_0_61 ).

cnf(c_0_185,plain,
    ( X1 = X2
    | ~ substitution_of_equivalents
    | ~ is_a_theorem(equiv(X1,X2)) ),
    i_0_140 ).

cnf(c_0_186,plain,
    substitution_of_equivalents,
    i_0_144 ).

cnf(c_0_187,plain,
    ( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
    | ~ op_equiv ),
    i_0_108 ).

cnf(c_0_188,plain,
    op_equiv,
    i_0_70 ).

cnf(c_0_189,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(implies(X2,X1))
    | ~ is_a_theorem(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_181,c_0_182])]) ).

cnf(c_0_190,plain,
    is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_183,c_0_184])]) ).

cnf(c_0_191,plain,
    ( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
    | ~ implies_2 ),
    i_0_79 ).

cnf(c_0_192,plain,
    implies_2,
    i_0_66 ).

cnf(c_0_193,plain,
    ( X1 = X2
    | ~ is_a_theorem(equiv(X1,X2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_185,c_0_186])]) ).

cnf(c_0_194,plain,
    and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_187,c_0_188])]) ).

cnf(c_0_195,plain,
    ( is_a_theorem(implies(X1,and(X2,X1)))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_189,c_0_190]) ).

cnf(c_0_196,plain,
    is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_191,c_0_192])]) ).

cnf(c_0_197,plain,
    ( not(and(X1,not(X2))) = implies(X1,X2)
    | ~ op_implies_and ),
    i_0_109 ).

cnf(c_0_198,plain,
    op_implies_and,
    i_0_71 ).

cnf(c_0_199,plain,
    ( X1 = X2
    | ~ is_a_theorem(and(implies(X1,X2),implies(X2,X1))) ),
    inference(spm,[status(thm)],[c_0_193,c_0_194]) ).

cnf(c_0_200,plain,
    ( is_a_theorem(and(X1,X2))
    | ~ is_a_theorem(X2)
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_189,c_0_195]) ).

cnf(c_0_201,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
    inference(spm,[status(thm)],[c_0_189,c_0_196]) ).

cnf(c_0_202,plain,
    ( is_a_theorem(implies(and(X1,X2),X1))
    | ~ and_1 ),
    i_0_6 ).

cnf(c_0_203,plain,
    and_1,
    i_0_59 ).

cnf(c_0_204,plain,
    ( not(and(not(X1),not(X2))) = or(X1,X2)
    | ~ op_or ),
    i_0_112 ).

cnf(c_0_205,plain,
    not(and(X1,not(X2))) = implies(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_197,c_0_198])]) ).

cnf(c_0_206,plain,
    op_or,
    i_0_72 ).

cnf(c_0_207,plain,
    ( X1 = X2
    | ~ is_a_theorem(implies(X2,X1))
    | ~ is_a_theorem(implies(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_199,c_0_200]) ).

cnf(c_0_208,plain,
    is_a_theorem(implies(X1,and(X1,X1))),
    inference(spm,[status(thm)],[c_0_201,c_0_190]) ).

cnf(c_0_209,plain,
    is_a_theorem(implies(and(X1,X2),X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_202,c_0_203])]) ).

cnf(c_0_210,plain,
    ( is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1)))
    | ~ modus_tollens ),
    i_0_103 ).

cnf(c_0_211,plain,
    implies(not(X1),X2) = or(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_204,c_0_205]),c_0_206])]) ).

cnf(c_0_212,plain,
    modus_tollens,
    i_0_69 ).

cnf(c_0_213,plain,
    ( is_a_theorem(implies(X1,or(X1,X2)))
    | ~ or_1 ),
    i_0_117 ).

cnf(c_0_214,plain,
    or_1,
    i_0_73 ).

cnf(c_0_215,plain,
    and(X1,X1) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_207,c_0_208]),c_0_209])]) ).

cnf(c_0_216,plain,
    is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_210,c_0_211]),c_0_212])]) ).

cnf(c_0_217,plain,
    ( is_a_theorem(implies(X1,or(X2,X1)))
    | ~ or_2 ),
    i_0_119 ).

cnf(c_0_218,plain,
    or_2,
    i_0_74 ).

cnf(c_0_219,plain,
    is_a_theorem(implies(X1,or(X1,X2))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_213,c_0_214])]) ).

cnf(c_0_220,plain,
    not(not(X1)) = or(X1,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_205,c_0_215]),c_0_211]) ).

cnf(c_0_221,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(or(X2,not(X1))) ),
    inference(spm,[status(thm)],[c_0_189,c_0_216]) ).

cnf(c_0_222,plain,
    is_a_theorem(implies(X1,or(X2,X1))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_217,c_0_218])]) ).

cnf(c_0_223,plain,
    is_a_theorem(implies(X1,not(not(X1)))),
    inference(spm,[status(thm)],[c_0_219,c_0_220]) ).

cnf(c_0_224,plain,
    ( is_a_theorem(or(X1,X2))
    | ~ is_a_theorem(or(X2,or(X1,X1))) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_221,c_0_220]),c_0_211]) ).

cnf(c_0_225,plain,
    is_a_theorem(or(X1,or(X2,not(X1)))),
    inference(spm,[status(thm)],[c_0_222,c_0_211]) ).

cnf(c_0_226,plain,
    ( is_a_theorem(necessarily(X1))
    | ~ necessitation
    | ~ is_a_theorem(X1) ),
    i_0_106 ).

cnf(c_0_227,plain,
    necessitation,
    i_0_86 ).

cnf(c_0_228,plain,
    ( necessarily(implies(X1,X2)) = strict_implies(X1,X2)
    | ~ op_strict_implies ),
    i_0_115 ).

cnf(c_0_229,plain,
    op_strict_implies,
    i_0_137 ).

cnf(c_0_230,plain,
    ( not(necessarily(not(X1))) = possibly(X1)
    | ~ op_possibly ),
    i_0_113 ).

cnf(c_0_231,plain,
    op_possibly,
    i_0_87 ).

cnf(c_0_232,plain,
    ( not(not(X1)) = X1
    | ~ is_a_theorem(or(not(X1),X1)) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_207,c_0_223]),c_0_211]) ).

cnf(c_0_233,plain,
    is_a_theorem(or(not(X1),X1)),
    inference(spm,[status(thm)],[c_0_224,c_0_225]) ).

cnf(c_0_234,plain,
    ( is_a_theorem(implies(necessarily(X1),necessarily(necessarily(X1))))
    | ~ axiom_4 ),
    i_0_12 ).

cnf(c_0_235,plain,
    axiom_4,
    i_0_82 ).

cnf(c_0_236,plain,
    ( is_a_theorem(implies(necessarily(X1),X1))
    | ~ axiom_M ),
    i_0_20 ).

cnf(c_0_237,plain,
    axiom_M,
    i_0_85 ).

cnf(c_0_238,plain,
    ( axiom_m9
    | ~ is_a_theorem(strict_implies(possibly(possibly(esk32_0)),possibly(esk32_0))) ),
    i_0_39 ).

cnf(c_0_239,negated_conjecture,
    ~ axiom_m9,
    i_0_132 ).

cnf(c_0_240,plain,
    ( is_a_theorem(necessarily(X1))
    | ~ is_a_theorem(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_226,c_0_227])]) ).

cnf(c_0_241,plain,
    necessarily(implies(X1,X2)) = strict_implies(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_228,c_0_229])]) ).

cnf(c_0_242,plain,
    not(necessarily(not(X1))) = possibly(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_230,c_0_231])]) ).

cnf(c_0_243,plain,
    not(not(X1)) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_232,c_0_233])]) ).

cnf(c_0_244,plain,
    is_a_theorem(implies(necessarily(X1),necessarily(necessarily(X1)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_234,c_0_235])]) ).

cnf(c_0_245,plain,
    is_a_theorem(implies(necessarily(X1),X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_236,c_0_237])]) ).

cnf(c_0_246,plain,
    ( is_a_theorem(implies(X1,implies(X2,X1)))
    | ~ implies_1 ),
    i_0_77 ).

cnf(c_0_247,plain,
    implies_1,
    i_0_65 ).

cnf(c_0_248,plain,
    ~ is_a_theorem(strict_implies(possibly(possibly(esk32_0)),possibly(esk32_0))),
    inference(sr,[status(thm)],[c_0_238,c_0_239]) ).

cnf(c_0_249,plain,
    ( is_a_theorem(strict_implies(X1,X2))
    | ~ is_a_theorem(implies(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_240,c_0_241]) ).

cnf(c_0_250,plain,
    possibly(not(X1)) = not(necessarily(X1)),
    inference(spm,[status(thm)],[c_0_242,c_0_243]) ).

cnf(c_0_251,plain,
    necessarily(necessarily(X1)) = necessarily(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_207,c_0_244]),c_0_245])]) ).

cnf(c_0_252,plain,
    is_a_theorem(implies(X1,implies(X2,X1))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_246,c_0_247])]) ).

cnf(c_0_253,plain,
    ~ is_a_theorem(implies(possibly(possibly(esk32_0)),possibly(esk32_0))),
    inference(spm,[status(thm)],[c_0_248,c_0_249]) ).

cnf(c_0_254,plain,
    possibly(possibly(X1)) = possibly(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_250,c_0_242]),c_0_251]),c_0_242]) ).

cnf(c_0_255,plain,
    is_a_theorem(implies(X1,X1)),
    inference(spm,[status(thm)],[c_0_201,c_0_252]) ).

cnf(c_0_256,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_253,c_0_254]),c_0_255])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL548+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03  % Command  : enigmatic-eprover.py %s %d 1
% 0.09/0.36  % Computer : n028.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Fri Sep  4 15:52:30 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.14/0.46  # ENIGMATIC: Selected SinE mode:
% 0.14/0.46  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.14/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.14/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 15.36/4.27  # ENIGMATIC: Solved by autoschedule-lgb:
% 15.36/4.27  # No SInE strategy applied
% 15.36/4.27  # Trying AutoSched0 for 150 seconds
% 15.36/4.27  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 15.36/4.27  # and selection function SelectComplexExceptUniqMaxHorn.
% 15.36/4.27  #
% 15.36/4.27  # Preprocessing time       : 0.026 s
% 15.36/4.27  # Presaturation interreduction done
% 15.36/4.27  
% 15.36/4.27  # Proof found!
% 15.36/4.27  # SZS status Theorem
% 15.36/4.27  # SZS output start CNFRefutation
% See solution above
% 15.36/4.27  # Training examples: 0 positive, 0 negative
% 15.36/4.27  
% 15.36/4.27  # -------------------------------------------------
% 15.36/4.27  # User time                : 0.241 s
% 15.36/4.27  # System time              : 0.018 s
% 15.36/4.27  # Total time               : 0.259 s
% 15.36/4.27  # Maximum resident set size: 3584 pages
% 15.36/4.27  
%------------------------------------------------------------------------------