TSTP Solution File: COM003+2 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : COM003+2 : TPTP v8.1.0. Bugfixed v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n019.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 01:06:22 EDT 2022

% Result   : Theorem 7.77s 2.32s
% Output   : CNFRefutation 7.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   54 (  12 unt;   6 nHn;  36 RR)
%            Number of literals    :  133 (   0 equ;  79 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   12 (  11 usr;   1 prp; 0-4 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-1 aty)
%            Number of variables   :   81 (  26 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_37,plain,
    ( program_not_halts2_halts2_outputs(esk6_0,X1,bad)
    | ~ program(X2)
    | ~ program_halts2_halts3_outputs(X2,esk4_1(X2),esk4_1(X2),good)
    | ~ program_not_halts2_halts3_outputs(X2,esk5_1(X2),esk5_1(X2),bad) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h23k4td/lgb.p',i_0_37) ).

cnf(i_0_35,plain,
    ( program_not_halts2_halts3_outputs(X1,X2,X3,bad)
    | ~ program_program_decides(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h23k4td/lgb.p',i_0_35) ).

cnf(i_0_6,plain,
    ( program(X1)
    | ~ program_program_decides(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h23k4td/lgb.p',i_0_6) ).

cnf(i_0_36,plain,
    ( program_halts2_halts3_outputs(X1,X2,X3,good)
    | ~ program_program_decides(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h23k4td/lgb.p',i_0_36) ).

cnf(i_0_34,plain,
    ( program_program_decides(esk3_0)
    | ~ algorithm_program_decides(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h23k4td/lgb.p',i_0_34) ).

cnf(i_0_43,negated_conjecture,
    algorithm_program_decides(esk10_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h23k4td/lgb.p',i_0_43) ).

cnf(i_0_39,plain,
    ( program(esk6_0)
    | ~ program(X1)
    | ~ program_halts2_halts3_outputs(X1,esk4_1(X1),esk4_1(X1),good)
    | ~ program_not_halts2_halts3_outputs(X1,esk5_1(X1),esk5_1(X1),bad) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h23k4td/lgb.p',i_0_39) ).

cnf(i_0_38,plain,
    ( program_halts2_halts2_outputs(esk6_0,X1,good)
    | ~ program(X2)
    | ~ program_halts2_halts3_outputs(X2,esk4_1(X2),esk4_1(X2),good)
    | ~ program_not_halts2_halts3_outputs(X2,esk5_1(X2),esk5_1(X2),bad) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h23k4td/lgb.p',i_0_38) ).

cnf(i_0_10,plain,
    ( program_halts2(X1,X2)
    | ~ program(X1)
    | ~ halts2(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h23k4td/lgb.p',i_0_10) ).

cnf(i_0_16,plain,
    ( halts2(X1,X2)
    | program_not_halts2(X1,X2)
    | ~ program(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h23k4td/lgb.p',i_0_16) ).

cnf(i_0_33,plain,
    ( halts2_outputs(X1,X2,X3)
    | ~ program_not_halts2(X2,X2)
    | ~ program_not_halts2_halts2_outputs(X1,X2,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h23k4td/lgb.p',i_0_33) ).

cnf(i_0_40,plain,
    ( program_not_halts2_halts2_outputs(esk9_0,X1,good)
    | ~ program(X2)
    | ~ program_halts2_halts2_outputs(X2,esk7_1(X2),good)
    | ~ program_not_halts2_halts2_outputs(X2,esk8_1(X2),bad) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h23k4td/lgb.p',i_0_40) ).

cnf(i_0_42,plain,
    ( program(esk9_0)
    | ~ program(X1)
    | ~ program_halts2_halts2_outputs(X1,esk7_1(X1),good)
    | ~ program_not_halts2_halts2_outputs(X1,esk8_1(X1),bad) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h23k4td/lgb.p',i_0_42) ).

cnf(i_0_41,plain,
    ( ~ program(X1)
    | ~ program_halts2(X2,X2)
    | ~ halts2(esk9_0,X2)
    | ~ program_halts2_halts2_outputs(X1,esk7_1(X1),good)
    | ~ program_not_halts2_halts2_outputs(X1,esk8_1(X1),bad) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h23k4td/lgb.p',i_0_41) ).

cnf(i_0_21,plain,
    ( halts2(X1,X2)
    | ~ halts2_outputs(X1,X2,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h23k4td/lgb.p',i_0_21) ).

cnf(i_0_11,plain,
    ( halts2(X1,X2)
    | ~ program_halts2(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h23k4td/lgb.p',i_0_11) ).

cnf(i_0_17,plain,
    ( ~ halts2(X1,X2)
    | ~ program_not_halts2(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h23k4td/lgb.p',i_0_17) ).

cnf(c_0_61,plain,
    ( program_not_halts2_halts2_outputs(esk6_0,X1,bad)
    | ~ program(X2)
    | ~ program_halts2_halts3_outputs(X2,esk4_1(X2),esk4_1(X2),good)
    | ~ program_not_halts2_halts3_outputs(X2,esk5_1(X2),esk5_1(X2),bad) ),
    i_0_37 ).

cnf(c_0_62,plain,
    ( program_not_halts2_halts3_outputs(X1,X2,X3,bad)
    | ~ program_program_decides(X1) ),
    i_0_35 ).

cnf(c_0_63,plain,
    ( program(X1)
    | ~ program_program_decides(X1) ),
    i_0_6 ).

cnf(c_0_64,plain,
    ( program_halts2_halts3_outputs(X1,X2,X3,good)
    | ~ program_program_decides(X1) ),
    i_0_36 ).

cnf(c_0_65,plain,
    ( program_program_decides(esk3_0)
    | ~ algorithm_program_decides(X1) ),
    i_0_34 ).

cnf(c_0_66,negated_conjecture,
    algorithm_program_decides(esk10_0),
    i_0_43 ).

cnf(c_0_67,plain,
    ( program(esk6_0)
    | ~ program(X1)
    | ~ program_halts2_halts3_outputs(X1,esk4_1(X1),esk4_1(X1),good)
    | ~ program_not_halts2_halts3_outputs(X1,esk5_1(X1),esk5_1(X1),bad) ),
    i_0_39 ).

cnf(c_0_68,plain,
    ( program_halts2_halts2_outputs(esk6_0,X1,good)
    | ~ program(X2)
    | ~ program_halts2_halts3_outputs(X2,esk4_1(X2),esk4_1(X2),good)
    | ~ program_not_halts2_halts3_outputs(X2,esk5_1(X2),esk5_1(X2),bad) ),
    i_0_38 ).

cnf(c_0_69,plain,
    ( program_halts2(X1,X2)
    | ~ program(X1)
    | ~ halts2(X1,X2) ),
    i_0_10 ).

cnf(c_0_70,plain,
    ( halts2(X1,X2)
    | program_not_halts2(X1,X2)
    | ~ program(X1) ),
    i_0_16 ).

cnf(c_0_71,plain,
    ( program_not_halts2_halts2_outputs(esk6_0,X1,bad)
    | ~ program_program_decides(X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_64]) ).

cnf(c_0_72,negated_conjecture,
    program_program_decides(esk3_0),
    inference(spm,[status(thm)],[c_0_65,c_0_66]) ).

cnf(c_0_73,plain,
    ( program(esk6_0)
    | ~ program_program_decides(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_62]),c_0_63]),c_0_64]) ).

cnf(c_0_74,plain,
    ( program_halts2_halts2_outputs(esk6_0,X1,good)
    | ~ program_program_decides(X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_62]),c_0_63]),c_0_64]) ).

cnf(c_0_75,plain,
    ( halts2_outputs(X1,X2,X3)
    | ~ program_not_halts2(X2,X2)
    | ~ program_not_halts2_halts2_outputs(X1,X2,X3) ),
    i_0_33 ).

cnf(c_0_76,plain,
    ( program_not_halts2(X1,X2)
    | program_halts2(X1,X2)
    | ~ program(X1) ),
    inference(spm,[status(thm)],[c_0_69,c_0_70]) ).

cnf(c_0_77,plain,
    ( program_not_halts2_halts2_outputs(esk9_0,X1,good)
    | ~ program(X2)
    | ~ program_halts2_halts2_outputs(X2,esk7_1(X2),good)
    | ~ program_not_halts2_halts2_outputs(X2,esk8_1(X2),bad) ),
    i_0_40 ).

cnf(c_0_78,negated_conjecture,
    program_not_halts2_halts2_outputs(esk6_0,X1,bad),
    inference(spm,[status(thm)],[c_0_71,c_0_72]) ).

cnf(c_0_79,negated_conjecture,
    program(esk6_0),
    inference(spm,[status(thm)],[c_0_73,c_0_72]) ).

cnf(c_0_80,negated_conjecture,
    program_halts2_halts2_outputs(esk6_0,X1,good),
    inference(spm,[status(thm)],[c_0_74,c_0_72]) ).

cnf(c_0_81,plain,
    ( halts2_outputs(X1,X2,X3)
    | program_halts2(X2,X2)
    | ~ program_not_halts2_halts2_outputs(X1,X2,X3)
    | ~ program(X2) ),
    inference(spm,[status(thm)],[c_0_75,c_0_76]) ).

cnf(c_0_82,plain,
    program_not_halts2_halts2_outputs(esk9_0,X1,good),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]),c_0_80])]) ).

cnf(c_0_83,plain,
    ( program(esk9_0)
    | ~ program(X1)
    | ~ program_halts2_halts2_outputs(X1,esk7_1(X1),good)
    | ~ program_not_halts2_halts2_outputs(X1,esk8_1(X1),bad) ),
    i_0_42 ).

cnf(c_0_84,plain,
    ( ~ program(X1)
    | ~ program_halts2(X2,X2)
    | ~ halts2(esk9_0,X2)
    | ~ program_halts2_halts2_outputs(X1,esk7_1(X1),good)
    | ~ program_not_halts2_halts2_outputs(X1,esk8_1(X1),bad) ),
    i_0_41 ).

cnf(c_0_85,plain,
    ( halts2_outputs(esk9_0,X1,good)
    | program_halts2(X1,X1)
    | ~ program(X1) ),
    inference(spm,[status(thm)],[c_0_81,c_0_82]) ).

cnf(c_0_86,plain,
    program(esk9_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_78]),c_0_79]),c_0_80])]) ).

cnf(c_0_87,plain,
    ( ~ halts2(esk9_0,X1)
    | ~ program_halts2(X1,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_78]),c_0_79]),c_0_80])]) ).

cnf(c_0_88,plain,
    ( halts2(X1,X2)
    | ~ halts2_outputs(X1,X2,X3) ),
    i_0_21 ).

cnf(c_0_89,plain,
    ( halts2_outputs(esk9_0,esk9_0,good)
    | program_halts2(esk9_0,esk9_0) ),
    inference(spm,[status(thm)],[c_0_85,c_0_86]) ).

cnf(c_0_90,plain,
    ( halts2(X1,X2)
    | ~ program_halts2(X1,X2) ),
    i_0_11 ).

cnf(c_0_91,plain,
    ( program_not_halts2(esk9_0,X1)
    | ~ program_halts2(X1,X1)
    | ~ program(esk9_0) ),
    inference(spm,[status(thm)],[c_0_87,c_0_70]) ).

cnf(c_0_92,plain,
    halts2(esk9_0,esk9_0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]) ).

cnf(c_0_93,plain,
    ( ~ halts2(X1,X2)
    | ~ program_not_halts2(X1,X2) ),
    i_0_17 ).

cnf(c_0_94,plain,
    ( program_not_halts2(esk9_0,X1)
    | ~ program_halts2(X1,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_86])]) ).

cnf(c_0_95,plain,
    program_halts2(esk9_0,esk9_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_92]),c_0_86])]) ).

cnf(c_0_96,plain,
    ~ program_not_halts2(esk9_0,esk9_0),
    inference(spm,[status(thm)],[c_0_93,c_0_92]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : COM003+2 : TPTP v8.1.0. Bugfixed v2.2.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n019.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 : Thu Jun 16 20:13:56 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.77/2.32  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.77/2.32  # No SInE strategy applied
% 7.77/2.32  # Trying AutoSched0 for 150 seconds
% 7.77/2.32  # AutoSched0-Mode selected heuristic G_E___208_C47_F1_SE_CS_SP_PS_S0Y
% 7.77/2.32  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.77/2.32  #
% 7.77/2.32  # Preprocessing time       : 0.012 s
% 7.77/2.32  # Presaturation interreduction done
% 7.77/2.32  
% 7.77/2.32  # Proof found!
% 7.77/2.32  # SZS status Theorem
% 7.77/2.32  # SZS output start CNFRefutation
% See solution above
% 7.77/2.32  # Training examples: 0 positive, 0 negative
% 7.77/2.32  
% 7.77/2.32  # -------------------------------------------------
% 7.77/2.32  # User time                : 0.034 s
% 7.77/2.32  # System time              : 0.004 s
% 7.77/2.32  # Total time               : 0.038 s
% 7.77/2.32  # Maximum resident set size: 7124 pages
% 7.77/2.32  
%------------------------------------------------------------------------------