TSTP Solution File: LCL475+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : LCL475+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n004.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 09:26:18 EDT 2022

% Result   : Theorem 263.97s 34.55s
% Output   : CNFRefutation 263.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   82 (  51 unt;   0 nHn;  32 RR)
%            Number of literals    :  118 (   9 equ;  40 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :   11 (   9 usr;   9 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :  154 (  27 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_40,plain,
    ( is_a_theorem(X1)
    | ~ modus_ponens
    | ~ is_a_theorem(X2)
    | ~ is_a_theorem(implies(X2,X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-evd4hxnp/input.p',i_0_40) ).

cnf(i_0_34,plain,
    modus_ponens,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-evd4hxnp/input.p',i_0_34) ).

cnf(i_0_8,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))
    | ~ cn1 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-evd4hxnp/input.p',i_0_8) ).

cnf(i_0_31,plain,
    cn1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-evd4hxnp/input.p',i_0_31) ).

cnf(i_0_10,plain,
    ( is_a_theorem(implies(X1,implies(not(X1),X2)))
    | ~ cn2 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-evd4hxnp/input.p',i_0_10) ).

cnf(i_0_32,plain,
    cn2,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-evd4hxnp/input.p',i_0_32) ).

cnf(i_0_12,plain,
    ( is_a_theorem(implies(implies(not(X1),X1),X1))
    | ~ cn3 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-evd4hxnp/input.p',i_0_12) ).

cnf(i_0_33,plain,
    cn3,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-evd4hxnp/input.p',i_0_33) ).

cnf(i_0_46,plain,
    ( or(not(X1),X2) = implies(X1,X2)
    | ~ op_implies_or ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-evd4hxnp/input.p',i_0_46) ).

cnf(i_0_56,plain,
    op_implies_or,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-evd4hxnp/input.p',i_0_56) ).

cnf(i_0_43,plain,
    ( not(or(not(X1),not(X2))) = and(X1,X2)
    | ~ op_and ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-evd4hxnp/input.p',i_0_43) ).

cnf(i_0_54,plain,
    op_and,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-evd4hxnp/input.p',i_0_54) ).

cnf(i_0_58,plain,
    ( r1
    | ~ is_a_theorem(implies(or(esk43_0,esk43_0),esk43_0)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-evd4hxnp/input.p',i_0_58) ).

cnf(i_0_57,negated_conjecture,
    ~ r1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-evd4hxnp/input.p',i_0_57) ).

cnf(i_0_47,plain,
    ( not(and(not(X1),not(X2))) = or(X1,X2)
    | ~ op_or ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-evd4hxnp/input.p',i_0_47) ).

cnf(i_0_36,plain,
    op_or,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-evd4hxnp/input.p',i_0_36) ).

cnf(c_0_75,plain,
    ( is_a_theorem(X1)
    | ~ modus_ponens
    | ~ is_a_theorem(X2)
    | ~ is_a_theorem(implies(X2,X1)) ),
    i_0_40 ).

cnf(c_0_76,plain,
    modus_ponens,
    i_0_34 ).

cnf(c_0_77,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))
    | ~ cn1 ),
    i_0_8 ).

cnf(c_0_78,plain,
    cn1,
    i_0_31 ).

cnf(c_0_79,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_75,c_0_76])]) ).

cnf(c_0_80,plain,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78])]) ).

cnf(c_0_81,plain,
    ( is_a_theorem(implies(X1,implies(not(X1),X2)))
    | ~ cn2 ),
    i_0_10 ).

cnf(c_0_82,plain,
    cn2,
    i_0_32 ).

cnf(c_0_83,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
    | ~ is_a_theorem(implies(X3,X1)) ),
    inference(spm,[status(thm)],[c_0_79,c_0_80]) ).

cnf(c_0_84,plain,
    ( is_a_theorem(implies(implies(not(X1),X1),X1))
    | ~ cn3 ),
    i_0_12 ).

cnf(c_0_85,plain,
    cn3,
    i_0_33 ).

cnf(c_0_86,plain,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82])]) ).

cnf(c_0_87,plain,
    is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4))),
    inference(spm,[status(thm)],[c_0_83,c_0_80]) ).

cnf(c_0_88,plain,
    is_a_theorem(implies(implies(not(X1),X1),X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85])]) ).

cnf(c_0_89,plain,
    is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
    inference(spm,[status(thm)],[c_0_83,c_0_86]) ).

cnf(c_0_90,plain,
    ( is_a_theorem(implies(implies(X1,X2),X3))
    | ~ is_a_theorem(implies(implies(implies(X2,X4),implies(X1,X4)),X3)) ),
    inference(spm,[status(thm)],[c_0_79,c_0_87]) ).

cnf(c_0_91,plain,
    is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X1),X2))),
    inference(spm,[status(thm)],[c_0_83,c_0_88]) ).

cnf(c_0_92,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(implies(not(X1),X3),X2)) ),
    inference(spm,[status(thm)],[c_0_79,c_0_89]) ).

cnf(c_0_93,plain,
    is_a_theorem(implies(implies(X1,not(X2)),implies(X2,implies(X1,X3)))),
    inference(spm,[status(thm)],[c_0_90,c_0_89]) ).

cnf(c_0_94,plain,
    is_a_theorem(implies(implies(implies(implies(not(X1),X1),X2),X3),implies(implies(X1,X2),X3))),
    inference(spm,[status(thm)],[c_0_83,c_0_91]) ).

cnf(c_0_95,plain,
    is_a_theorem(implies(X1,implies(X2,implies(not(X1),X3)))),
    inference(spm,[status(thm)],[c_0_92,c_0_93]) ).

cnf(c_0_96,plain,
    is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(implies(X2,X3),implies(X1,X3)))),
    inference(spm,[status(thm)],[c_0_90,c_0_94]) ).

cnf(c_0_97,plain,
    ( is_a_theorem(implies(X1,implies(not(X2),X3)))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_79,c_0_95]) ).

cnf(c_0_98,plain,
    is_a_theorem(implies(X1,X1)),
    inference(spm,[status(thm)],[c_0_92,c_0_88]) ).

cnf(c_0_99,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
    | ~ is_a_theorem(implies(X3,implies(not(X1),X1))) ),
    inference(spm,[status(thm)],[c_0_79,c_0_96]) ).

cnf(c_0_100,plain,
    is_a_theorem(implies(X1,implies(not(implies(X2,X2)),X3))),
    inference(spm,[status(thm)],[c_0_97,c_0_98]) ).

cnf(c_0_101,plain,
    is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))),
    inference(spm,[status(thm)],[c_0_99,c_0_100]) ).

cnf(c_0_102,plain,
    is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X4,X2),implies(X1,implies(X4,X3))))),
    inference(spm,[status(thm)],[c_0_90,c_0_87]) ).

cnf(c_0_103,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(implies(X3,X3),X2)) ),
    inference(spm,[status(thm)],[c_0_79,c_0_101]) ).

cnf(c_0_104,plain,
    is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X3,X3),X1),X2))),
    inference(spm,[status(thm)],[c_0_99,c_0_101]) ).

cnf(c_0_105,plain,
    is_a_theorem(implies(implies(implies(X1,implies(not(X2),X3)),X4),implies(X2,X4))),
    inference(spm,[status(thm)],[c_0_83,c_0_95]) ).

cnf(c_0_106,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4))))
    | ~ is_a_theorem(implies(X3,implies(X2,X4))) ),
    inference(spm,[status(thm)],[c_0_79,c_0_102]) ).

cnf(c_0_107,plain,
    is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
    inference(spm,[status(thm)],[c_0_103,c_0_91]) ).

cnf(c_0_108,plain,
    ( is_a_theorem(implies(implies(implies(X1,X1),X2),X3))
    | ~ is_a_theorem(implies(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_79,c_0_104]) ).

cnf(c_0_109,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(implies(X3,implies(not(X1),X4)),X2)) ),
    inference(spm,[status(thm)],[c_0_79,c_0_105]) ).

cnf(c_0_110,plain,
    is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X3,implies(X1,X2)))),
    inference(spm,[status(thm)],[c_0_106,c_0_107]) ).

cnf(c_0_111,plain,
    is_a_theorem(implies(implies(implies(X1,X1),X2),X2)),
    inference(spm,[status(thm)],[c_0_108,c_0_98]) ).

cnf(c_0_112,plain,
    is_a_theorem(implies(X1,implies(X2,implies(X3,X1)))),
    inference(spm,[status(thm)],[c_0_109,c_0_110]) ).

cnf(c_0_113,plain,
    is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),X4),implies(implies(X2,not(X1)),X4))),
    inference(spm,[status(thm)],[c_0_83,c_0_93]) ).

cnf(c_0_114,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(implies(implies(X2,X2),X1)) ),
    inference(spm,[status(thm)],[c_0_79,c_0_111]) ).

cnf(c_0_115,plain,
    is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(X1,implies(not(X2),X2)),X3))),
    inference(spm,[status(thm)],[c_0_99,c_0_110]) ).

cnf(c_0_116,plain,
    is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
    inference(spm,[status(thm)],[c_0_99,c_0_112]) ).

cnf(c_0_117,plain,
    ( is_a_theorem(implies(implies(X1,not(X2)),X3))
    | ~ is_a_theorem(implies(implies(X2,implies(X1,X4)),X3)) ),
    inference(spm,[status(thm)],[c_0_79,c_0_113]) ).

cnf(c_0_118,plain,
    is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
    inference(spm,[status(thm)],[c_0_114,c_0_115]) ).

cnf(c_0_119,plain,
    ( or(not(X1),X2) = implies(X1,X2)
    | ~ op_implies_or ),
    i_0_46 ).

cnf(c_0_120,plain,
    op_implies_or,
    i_0_56 ).

cnf(c_0_121,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
    inference(spm,[status(thm)],[c_0_79,c_0_116]) ).

cnf(c_0_122,plain,
    is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
    inference(spm,[status(thm)],[c_0_117,c_0_118]) ).

cnf(c_0_123,plain,
    ( not(or(not(X1),not(X2))) = and(X1,X2)
    | ~ op_and ),
    i_0_43 ).

cnf(c_0_124,plain,
    or(not(X1),X2) = implies(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_119,c_0_120])]) ).

cnf(c_0_125,plain,
    op_and,
    i_0_54 ).

cnf(c_0_126,plain,
    is_a_theorem(implies(not(X1),implies(X1,X2))),
    inference(spm,[status(thm)],[c_0_121,c_0_122]) ).

cnf(c_0_127,plain,
    ( r1
    | ~ is_a_theorem(implies(or(esk43_0,esk43_0),esk43_0)) ),
    i_0_58 ).

cnf(c_0_128,negated_conjecture,
    ~ r1,
    i_0_57 ).

cnf(c_0_129,plain,
    ( not(and(not(X1),not(X2))) = or(X1,X2)
    | ~ op_or ),
    i_0_47 ).

cnf(c_0_130,plain,
    and(X1,X2) = not(implies(X1,not(X2))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_123,c_0_124]),c_0_125])]) ).

cnf(c_0_131,plain,
    op_or,
    i_0_36 ).

cnf(c_0_132,plain,
    is_a_theorem(implies(implies(X1,X2),implies(not(not(X1)),X2))),
    inference(spm,[status(thm)],[c_0_99,c_0_126]) ).

cnf(c_0_133,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
    inference(spm,[status(thm)],[c_0_79,c_0_118]) ).

cnf(c_0_134,plain,
    ~ is_a_theorem(implies(or(esk43_0,esk43_0),esk43_0)),
    inference(sr,[status(thm)],[c_0_127,c_0_128]) ).

cnf(c_0_135,plain,
    or(X1,X2) = not(not(implies(not(X1),not(not(X2))))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_129,c_0_130]),c_0_131])]) ).

cnf(c_0_136,plain,
    ( is_a_theorem(implies(not(not(X1)),X2))
    | ~ is_a_theorem(implies(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_79,c_0_132]) ).

cnf(c_0_137,plain,
    is_a_theorem(implies(implies(not(X1),not(not(X1))),X1)),
    inference(spm,[status(thm)],[c_0_133,c_0_122]) ).

cnf(c_0_138,plain,
    ~ is_a_theorem(implies(not(not(implies(not(esk43_0),not(not(esk43_0))))),esk43_0)),
    inference(rw,[status(thm)],[c_0_134,c_0_135]) ).

cnf(c_0_139,plain,
    is_a_theorem(implies(not(not(implies(not(X1),not(not(X1))))),X1)),
    inference(spm,[status(thm)],[c_0_136,c_0_137]) ).

cnf(c_0_140,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_138,c_0_139])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL475+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n004.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.19/0.34  % DateTime : Mon Jul  4 01:15:09 EDT 2022
% 0.19/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected SinE mode:
% 0.20/0.46  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 263.97/34.55  # ENIGMATIC: Solved by Enigma+T5d16l600+G_E___200_B02_F1_SE_CS_SP_PI_S0S+loop07+coop:
% 263.97/34.55  # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/T5d16l600/G_E___200_B02_F1_SE_CS_SP_PI_S0S/loop07/model.lgb' loaded. (hash_base: 32768; conj_feats: 9; version: 991; iters: 200)
% 263.97/34.55  # Preprocessing time       : 0.157 s
% 263.97/34.55  
% 263.97/34.55  # Proof found!
% 263.97/34.55  # SZS status Theorem
% 263.97/34.55  # SZS output start CNFRefutation
% See solution above
% 263.97/34.55  # Training examples: 0 positive, 0 negative
% 263.97/34.55  
% 263.97/34.55  # -------------------------------------------------
% 263.97/34.55  # User time                : 0.906 s
% 263.97/34.55  # System time              : 0.039 s
% 263.97/34.55  # Total time               : 0.945 s
% 263.97/34.55  # ...preprocessing         : 0.157 s
% 263.97/34.55  # ...main loop             : 0.788 s
% 263.97/34.55  # Maximum resident set size: 33660 pages
% 263.97/34.55  
%------------------------------------------------------------------------------