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

View Problem - Process Solution

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

% Computer : n026.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 : Thu Jul 14 15:33:10 EDT 2022

% Result   : Theorem 7.76s 2.30s
% Output   : CNFRefutation 7.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   26 (  16 unt;   8 nHn;  26 RR)
%            Number of literals    :   56 (  19 equ;  25 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_24,plain,
    ( k1_funct_1(X1,X2) = k1_xboole_0
    | v1_xboole_0(X3)
    | r2_hidden(X4,a_2_0_closure3(X3,X1))
    | X2 != X4
    | ~ m1_pboole(X1,X3)
    | ~ m1_subset_1(X2,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vmty_ac6/lgb.p',i_0_24) ).

cnf(i_0_50,plain,
    ( X1 = k1_xboole_0
    | ~ v1_xboole_0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vmty_ac6/lgb.p',i_0_50) ).

cnf(i_0_33,plain,
    v1_xboole_0(esk7_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vmty_ac6/lgb.p',i_0_33) ).

cnf(i_0_13,plain,
    ( X1 = k1_closure3(X2,X3)
    | v1_xboole_0(X2)
    | X1 != a_2_0_closure3(X2,X3)
    | ~ m1_pboole(X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vmty_ac6/lgb.p',i_0_13) ).

cnf(i_0_3,negated_conjecture,
    m1_subset_1(esk3_0,esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vmty_ac6/lgb.p',i_0_3) ).

cnf(i_0_5,negated_conjecture,
    ~ v1_xboole_0(esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vmty_ac6/lgb.p',i_0_5) ).

cnf(i_0_4,negated_conjecture,
    m1_pboole(esk2_0,esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vmty_ac6/lgb.p',i_0_4) ).

cnf(i_0_1,negated_conjecture,
    k1_funct_1(esk2_0,esk3_0) != k1_xboole_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vmty_ac6/lgb.p',i_0_1) ).

cnf(i_0_2,negated_conjecture,
    ~ r2_hidden(esk3_0,k1_closure3(esk1_0,esk2_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vmty_ac6/lgb.p',i_0_2) ).

cnf(c_0_60,plain,
    ( k1_funct_1(X1,X2) = k1_xboole_0
    | v1_xboole_0(X3)
    | r2_hidden(X4,a_2_0_closure3(X3,X1))
    | X2 != X4
    | ~ m1_pboole(X1,X3)
    | ~ m1_subset_1(X2,X3) ),
    i_0_24 ).

cnf(c_0_61,plain,
    ( X1 = k1_xboole_0
    | ~ v1_xboole_0(X1) ),
    i_0_50 ).

cnf(c_0_62,plain,
    v1_xboole_0(esk7_0),
    i_0_33 ).

cnf(c_0_63,plain,
    ( k1_funct_1(X1,X2) = k1_xboole_0
    | v1_xboole_0(X3)
    | r2_hidden(X2,a_2_0_closure3(X3,X1))
    | ~ m1_subset_1(X2,X3)
    | ~ m1_pboole(X1,X3) ),
    inference(er,[status(thm)],[c_0_60]) ).

cnf(c_0_64,plain,
    k1_xboole_0 = esk7_0,
    inference(spm,[status(thm)],[c_0_61,c_0_62]) ).

cnf(c_0_65,plain,
    ( X1 = k1_closure3(X2,X3)
    | v1_xboole_0(X2)
    | X1 != a_2_0_closure3(X2,X3)
    | ~ m1_pboole(X3,X2) ),
    i_0_13 ).

cnf(c_0_66,plain,
    ( k1_funct_1(X1,X2) = esk7_0
    | v1_xboole_0(X3)
    | r2_hidden(X2,a_2_0_closure3(X3,X1))
    | ~ m1_subset_1(X2,X3)
    | ~ m1_pboole(X1,X3) ),
    inference(rw,[status(thm)],[c_0_63,c_0_64]) ).

cnf(c_0_67,negated_conjecture,
    m1_subset_1(esk3_0,esk1_0),
    i_0_3 ).

cnf(c_0_68,negated_conjecture,
    ~ v1_xboole_0(esk1_0),
    i_0_5 ).

cnf(c_0_69,plain,
    ( a_2_0_closure3(X1,X2) = k1_closure3(X1,X2)
    | v1_xboole_0(X1)
    | ~ m1_pboole(X2,X1) ),
    inference(er,[status(thm)],[c_0_65]) ).

cnf(c_0_70,negated_conjecture,
    m1_pboole(esk2_0,esk1_0),
    i_0_4 ).

cnf(c_0_71,negated_conjecture,
    k1_funct_1(esk2_0,esk3_0) != k1_xboole_0,
    i_0_1 ).

cnf(c_0_72,negated_conjecture,
    ( k1_funct_1(X1,esk3_0) = esk7_0
    | r2_hidden(esk3_0,a_2_0_closure3(esk1_0,X1))
    | ~ m1_pboole(X1,esk1_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]) ).

cnf(c_0_73,negated_conjecture,
    a_2_0_closure3(esk1_0,esk2_0) = k1_closure3(esk1_0,esk2_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_68]) ).

cnf(c_0_74,negated_conjecture,
    k1_funct_1(esk2_0,esk3_0) != esk7_0,
    inference(rw,[status(thm)],[c_0_71,c_0_64]) ).

cnf(c_0_75,negated_conjecture,
    ~ r2_hidden(esk3_0,k1_closure3(esk1_0,esk2_0)),
    i_0_2 ).

cnf(c_0_76,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_70]),c_0_73]),c_0_74]),c_0_75]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : ALG227+1 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n026.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 : Wed Jun  8 09:22:48 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.41  # ENIGMATIC: Selected complete mode:
% 7.76/2.30  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.76/2.30  # No SInE strategy applied
% 7.76/2.30  # Trying AutoSched0 for 150 seconds
% 7.76/2.30  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.76/2.30  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.76/2.30  #
% 7.76/2.30  # Preprocessing time       : 0.024 s
% 7.76/2.30  # Presaturation interreduction done
% 7.76/2.30  
% 7.76/2.30  # Proof found!
% 7.76/2.30  # SZS status Theorem
% 7.76/2.30  # SZS output start CNFRefutation
% See solution above
% 7.76/2.30  # Training examples: 0 positive, 0 negative
% 7.76/2.30  
% 7.76/2.30  # -------------------------------------------------
% 7.76/2.30  # User time                : 0.026 s
% 7.76/2.30  # System time              : 0.006 s
% 7.76/2.30  # Total time               : 0.032 s
% 7.76/2.30  # Maximum resident set size: 7124 pages
% 7.76/2.30  
%------------------------------------------------------------------------------