%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR044+1 : TPTP v8.1.0. Released v3.4.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 : Fri Jul 15 02:46:55 EDT 2022

% Result   : Theorem 7.82s 2.46s
% Output   : CNFRefutation 7.82s
% 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_48,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9z51xz7u/input.p',i_0_48) ).

cnf(i_0_9,plain,
    genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9z51xz7u/input.p',i_0_9) ).

cnf(i_0_66,negated_conjecture,
    mtvisible(c_tptp_member3633_mt),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9z51xz7u/input.p',i_0_66) ).

cnf(i_0_8,plain,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9z51xz7u/input.p',i_0_8) ).

cnf(i_0_11,plain,
    ( relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)
    | ~ mtvisible(c_cyclistsmt) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9z51xz7u/input.p',i_0_11) ).

cnf(i_0_10,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/sandbox2/tmp/enigma-theBenchmark.p-9z51xz7u/input.p',i_0_10) ).

cnf(i_0_1,plain,
    ( isa(f_relationallexistsfn(X1,X2,X3,X4),X4)
    | ~ isa(X1,X3)
    | ~ relationallexists(X2,X3,X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9z51xz7u/input.p',i_0_1) ).

cnf(i_0_34,plain,
    ( isa(X1,c_executionbyfiringsquad)
    | ~ executionbyfiringsquad(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9z51xz7u/input.p',i_0_34) ).

cnf(i_0_12,plain,
    executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9z51xz7u/input.p',i_0_12) ).

cnf(i_0_65,negated_conjecture,
    ( ~ tptpcol_16_29490(X1)
    | ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9z51xz7u/input.p',i_0_65) ).

cnf(i_0_31,plain,
    ( tptpcol_16_29490(X1)
    | ~ isa(X1,c_tptpcol_16_29490) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9z51xz7u/input.p',i_0_31) ).

cnf(c_0_78,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    i_0_48 ).

cnf(c_0_79,plain,
    genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
    i_0_9 ).

cnf(c_0_80,negated_conjecture,
    mtvisible(c_tptp_member3633_mt),
    i_0_66 ).

cnf(c_0_81,plain,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    i_0_8 ).

cnf(c_0_82,plain,
    mtvisible(c_tptp_spindleheadmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80])]) ).

cnf(c_0_83,plain,
    ( relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)
    | ~ mtvisible(c_cyclistsmt) ),
    i_0_11 ).

cnf(c_0_84,plain,
    mtvisible(c_cyclistsmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_81]),c_0_82])]) ).

cnf(c_0_85,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_10 ).

cnf(c_0_86,plain,
    ( isa(f_relationallexistsfn(X1,X2,X3,X4),X4)
    | ~ isa(X1,X3)
    | ~ relationallexists(X2,X3,X4) ),
    i_0_1 ).

cnf(c_0_87,plain,
    relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_84])]) ).

cnf(c_0_88,plain,
    ( isa(X1,c_executionbyfiringsquad)
    | ~ executionbyfiringsquad(X1) ),
    i_0_34 ).

cnf(c_0_89,plain,
    executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
    i_0_12 ).

cnf(c_0_90,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_85,c_0_84])]) ).

cnf(c_0_91,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_86,c_0_87]) ).

cnf(c_0_92,plain,
    isa(c_tptpexecutionbyfiringsquad_90,c_executionbyfiringsquad),
    inference(spm,[status(thm)],[c_0_88,c_0_89]) ).

cnf(c_0_93,negated_conjecture,
    ( ~ tptpcol_16_29490(X1)
    | ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1) ),
    i_0_65 ).

cnf(c_0_94,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_90,c_0_89]) ).

cnf(c_0_95,plain,
    ( tptpcol_16_29490(X1)
    | ~ isa(X1,c_tptpcol_16_29490) ),
    i_0_31 ).

cnf(c_0_96,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_91,c_0_92]) ).

cnf(c_0_97,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_93,c_0_94]) ).

cnf(c_0_98,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : CSR044+1 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n027.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Fri Jun 10 07:19:45 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.82/2.46  # ENIGMATIC: Solved by autoschedule:
% 7.82/2.46  # No SInE strategy applied
% 7.82/2.46  # Trying AutoSched0 for 150 seconds
% 7.82/2.46  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_S0e
% 7.82/2.46  # and selection function SelectLargestNegLit.
% 7.82/2.46  #
% 7.82/2.46  # Preprocessing time       : 0.023 s
% 7.82/2.46  
% 7.82/2.46  # Proof found!
% 7.82/2.46  # SZS status Theorem
% 7.82/2.46  # SZS output start CNFRefutation
% See solution above
% 7.82/2.46  # Training examples: 0 positive, 0 negative
% 7.82/2.46  
% 7.82/2.46  # -------------------------------------------------
% 7.82/2.46  # User time                : 0.028 s
% 7.82/2.46  # System time              : 0.005 s
% 7.82/2.46  # Total time               : 0.033 s
% 7.82/2.46  # Maximum resident set size: 7120 pages
% 7.82/2.46  
%------------------------------------------------------------------------------