TSTP Solution File: CSR044+5 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR044+5 : TPTP v8.1.0. Bugfixed v3.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n022.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 : Fri Jul 15 02:46:56 EDT 2022

% Result   : Theorem 28.37s 13.42s
% Output   : CNFRefutation 28.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   32 (  16 unt;   0 nHn;  32 RR)
%            Number of literals    :   54 (   0 equ;  25 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-4 aty)
%            Number of variables   :   22 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2340,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i99x3tsb/input.p',i_0_2340) ).

cnf(i_0_850,plain,
    genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i99x3tsb/input.p',i_0_850) ).

cnf(i_0_2677,negated_conjecture,
    mtvisible(c_tptp_member3633_mt),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i99x3tsb/input.p',i_0_2677) ).

cnf(i_0_466,plain,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i99x3tsb/input.p',i_0_466) ).

cnf(i_0_205,plain,
    ( relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)
    | ~ mtvisible(c_cyclistsmt) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i99x3tsb/input.p',i_0_205) ).

cnf(i_0_204,plain,
    ( tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490))
    | ~ executionbyfiringsquad(X1)
    | ~ mtvisible(c_cyclistsmt) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i99x3tsb/input.p',i_0_204) ).

cnf(i_0_1058,plain,
    ( isa(f_relationallexistsfn(X1,X2,X3,X4),X4)
    | ~ isa(X1,X3)
    | ~ relationallexists(X2,X3,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i99x3tsb/input.p',i_0_1058) ).

cnf(i_0_2102,plain,
    ( isa(X1,c_executionbyfiringsquad)
    | ~ executionbyfiringsquad(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i99x3tsb/input.p',i_0_2102) ).

cnf(i_0_276,plain,
    executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i99x3tsb/input.p',i_0_276) ).

cnf(i_0_2676,negated_conjecture,
    ( ~ tptpcol_16_29490(X1)
    | ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i99x3tsb/input.p',i_0_2676) ).

cnf(i_0_1783,plain,
    ( tptpcol_16_29490(X1)
    | ~ isa(X1,c_tptpcol_16_29490) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i99x3tsb/input.p',i_0_1783) ).

cnf(c_0_2689,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    i_0_2340 ).

cnf(c_0_2690,plain,
    genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
    i_0_850 ).

cnf(c_0_2691,negated_conjecture,
    mtvisible(c_tptp_member3633_mt),
    i_0_2677 ).

cnf(c_0_2692,plain,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    i_0_466 ).

cnf(c_0_2693,plain,
    mtvisible(c_tptp_spindleheadmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2689,c_0_2690]),c_0_2691])]) ).

cnf(c_0_2694,plain,
    ( relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)
    | ~ mtvisible(c_cyclistsmt) ),
    i_0_205 ).

cnf(c_0_2695,plain,
    mtvisible(c_cyclistsmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2689,c_0_2692]),c_0_2693])]) ).

cnf(c_0_2696,plain,
    ( tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490))
    | ~ executionbyfiringsquad(X1)
    | ~ mtvisible(c_cyclistsmt) ),
    i_0_204 ).

cnf(c_0_2697,plain,
    ( isa(f_relationallexistsfn(X1,X2,X3,X4),X4)
    | ~ isa(X1,X3)
    | ~ relationallexists(X2,X3,X4) ),
    i_0_1058 ).

cnf(c_0_2698,plain,
    relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2694,c_0_2695])]) ).

cnf(c_0_2699,plain,
    ( isa(X1,c_executionbyfiringsquad)
    | ~ executionbyfiringsquad(X1) ),
    i_0_2102 ).

cnf(c_0_2700,plain,
    executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
    i_0_276 ).

cnf(c_0_2701,plain,
    ( tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490))
    | ~ executionbyfiringsquad(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2696,c_0_2695])]) ).

cnf(c_0_2702,plain,
    ( isa(f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490)
    | ~ isa(X1,c_executionbyfiringsquad) ),
    inference(spm,[status(thm)],[c_0_2697,c_0_2698]) ).

cnf(c_0_2703,plain,
    isa(c_tptpexecutionbyfiringsquad_90,c_executionbyfiringsquad),
    inference(spm,[status(thm)],[c_0_2699,c_0_2700]) ).

cnf(c_0_2704,negated_conjecture,
    ( ~ tptpcol_16_29490(X1)
    | ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1) ),
    i_0_2676 ).

cnf(c_0_2705,plain,
    tptp_9_720(c_tptpexecutionbyfiringsquad_90,f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)),
    inference(spm,[status(thm)],[c_0_2701,c_0_2700]) ).

cnf(c_0_2706,plain,
    ( tptpcol_16_29490(X1)
    | ~ isa(X1,c_tptpcol_16_29490) ),
    i_0_1783 ).

cnf(c_0_2707,plain,
    isa(f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490),
    inference(spm,[status(thm)],[c_0_2702,c_0_2703]) ).

cnf(c_0_2708,negated_conjecture,
    ~ tptpcol_16_29490(f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)),
    inference(spm,[status(thm)],[c_0_2704,c_0_2705]) ).

cnf(c_0_2709,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2706,c_0_2707]),c_0_2708]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : CSR044+5 : TPTP v8.1.0. Bugfixed v3.5.0.
% 0.11/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n022.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jun 11 15:20:50 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 9.11/9.35  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.11/9.35  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 9.11/9.35  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 9.11/9.35  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 28.37/13.42  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l4800-e0.15+coop-paramils157:
% 28.37/13.42  # SinE strategy is GSinE(CountFormulas,hypos,5.0,,3,500,1.0)
% 28.37/13.42  # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l4800-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 34; version: 991; iters: 150)
% 28.37/13.42  # Preprocessing time       : 0.985 s
% 28.37/13.42  
% 28.37/13.42  # Proof found!
% 28.37/13.42  # SZS status Theorem
% 28.37/13.42  # SZS output start CNFRefutation
% See solution above
% 28.37/13.42  # Training examples: 0 positive, 0 negative
% 28.37/13.42  
% 28.37/13.42  # -------------------------------------------------
% 28.37/13.42  # User time                : 1.101 s
% 28.37/13.42  # System time              : 0.104 s
% 28.37/13.42  # Total time               : 1.205 s
% 28.37/13.42  # ...preprocessing         : 0.985 s
% 28.37/13.42  # ...main loop             : 0.219 s
% 28.37/13.42  # Maximum resident set size: 160116 pages
% 28.37/13.42  
%------------------------------------------------------------------------------