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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU407+1 : TPTP v8.1.0. Released v3.4.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 : Tue Jul 19 08:41:58 EDT 2022

% Result   : Theorem 8.39s 2.48s
% Output   : CNFRefutation 8.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   48 (  18 unt;   9 nHn;  46 RR)
%            Number of literals    :  107 (   9 equ;  59 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   55 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_46,plain,
    ( v3_struct_0(X1)
    | ~ l1_struct_0(X1)
    | ~ v1_xboole_0(u1_struct_0(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kywyzbxq/input.p',i_0_46) ).

cnf(i_0_32,plain,
    ( l1_struct_0(X1)
    | ~ l1_orders_2(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kywyzbxq/input.p',i_0_32) ).

cnf(i_0_67,plain,
    ( v1_xboole_0(X1)
    | r2_hidden(X2,X1)
    | ~ m1_subset_1(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kywyzbxq/input.p',i_0_67) ).

cnf(i_0_3,negated_conjecture,
    m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kywyzbxq/input.p',i_0_3) ).

cnf(i_0_45,plain,
    ( v3_struct_0(X1)
    | ~ l1_orders_2(X1)
    | ~ l1_orders_2(X2)
    | ~ v3_struct_0(k1_latsum_1(X2,X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kywyzbxq/input.p',i_0_45) ).

cnf(i_0_6,negated_conjecture,
    l1_orders_2(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kywyzbxq/input.p',i_0_6) ).

cnf(i_0_4,negated_conjecture,
    l1_orders_2(esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kywyzbxq/input.p',i_0_4) ).

cnf(i_0_5,negated_conjecture,
    ~ v3_struct_0(esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kywyzbxq/input.p',i_0_5) ).

cnf(i_0_14,plain,
    ( u1_struct_0(X1) = k2_xboole_0(u1_struct_0(X2),u1_struct_0(X3))
    | X1 != k1_latsum_1(X2,X3)
    | ~ l1_orders_2(X3)
    | ~ l1_orders_2(X2)
    | ~ l1_orders_2(X1)
    | ~ v1_orders_2(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kywyzbxq/input.p',i_0_14) ).

cnf(i_0_23,plain,
    ( l1_orders_2(k1_latsum_1(X1,X2))
    | ~ l1_orders_2(X2)
    | ~ l1_orders_2(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kywyzbxq/input.p',i_0_23) ).

cnf(i_0_24,plain,
    ( v1_orders_2(k1_latsum_1(X1,X2))
    | ~ l1_orders_2(X2)
    | ~ l1_orders_2(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kywyzbxq/input.p',i_0_24) ).

cnf(i_0_20,plain,
    ( r2_hidden(X1,X2)
    | r2_hidden(X1,X3)
    | X4 != k2_xboole_0(X3,X2)
    | ~ r2_hidden(X1,X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kywyzbxq/input.p',i_0_20) ).

cnf(i_0_2,negated_conjecture,
    ~ r2_hidden(esk3_0,u1_struct_0(esk1_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kywyzbxq/input.p',i_0_2) ).

cnf(i_0_76,plain,
    ( ~ v1_xboole_0(X1)
    | ~ r2_hidden(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kywyzbxq/input.p',i_0_76) ).

cnf(i_0_68,plain,
    k2_xboole_0(X1,k4_xboole_0(X2,X1)) = k2_xboole_0(X1,X2),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kywyzbxq/input.p',i_0_68) ).

cnf(i_0_51,plain,
    ( v1_xboole_0(X1)
    | ~ v1_xboole_0(k2_xboole_0(X2,X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kywyzbxq/input.p',i_0_51) ).

cnf(i_0_1,negated_conjecture,
    ~ r2_hidden(esk3_0,k4_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kywyzbxq/input.p',i_0_1) ).

cnf(c_0_94,plain,
    ( v3_struct_0(X1)
    | ~ l1_struct_0(X1)
    | ~ v1_xboole_0(u1_struct_0(X1)) ),
    i_0_46 ).

cnf(c_0_95,plain,
    ( l1_struct_0(X1)
    | ~ l1_orders_2(X1) ),
    i_0_32 ).

cnf(c_0_96,plain,
    ( v1_xboole_0(X1)
    | r2_hidden(X2,X1)
    | ~ m1_subset_1(X2,X1) ),
    i_0_67 ).

cnf(c_0_97,negated_conjecture,
    m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
    i_0_3 ).

cnf(c_0_98,plain,
    ( v3_struct_0(X1)
    | ~ v1_xboole_0(u1_struct_0(X1))
    | ~ l1_orders_2(X1) ),
    inference(spm,[status(thm)],[c_0_94,c_0_95]) ).

cnf(c_0_99,negated_conjecture,
    ( r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
    | v1_xboole_0(u1_struct_0(k1_latsum_1(esk1_0,esk2_0))) ),
    inference(spm,[status(thm)],[c_0_96,c_0_97]) ).

cnf(c_0_100,plain,
    ( v3_struct_0(X1)
    | ~ l1_orders_2(X1)
    | ~ l1_orders_2(X2)
    | ~ v3_struct_0(k1_latsum_1(X2,X1)) ),
    i_0_45 ).

cnf(c_0_101,plain,
    ( r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
    | v3_struct_0(k1_latsum_1(esk1_0,esk2_0))
    | ~ l1_orders_2(k1_latsum_1(esk1_0,esk2_0)) ),
    inference(spm,[status(thm)],[c_0_98,c_0_99]) ).

cnf(c_0_102,negated_conjecture,
    l1_orders_2(esk1_0),
    i_0_6 ).

cnf(c_0_103,negated_conjecture,
    l1_orders_2(esk2_0),
    i_0_4 ).

cnf(c_0_104,negated_conjecture,
    ~ v3_struct_0(esk2_0),
    i_0_5 ).

cnf(c_0_105,plain,
    ( u1_struct_0(X1) = k2_xboole_0(u1_struct_0(X2),u1_struct_0(X3))
    | X1 != k1_latsum_1(X2,X3)
    | ~ l1_orders_2(X3)
    | ~ l1_orders_2(X2)
    | ~ l1_orders_2(X1)
    | ~ v1_orders_2(X1) ),
    i_0_14 ).

cnf(c_0_106,plain,
    ( l1_orders_2(k1_latsum_1(X1,X2))
    | ~ l1_orders_2(X2)
    | ~ l1_orders_2(X1) ),
    i_0_23 ).

cnf(c_0_107,plain,
    ( v1_orders_2(k1_latsum_1(X1,X2))
    | ~ l1_orders_2(X2)
    | ~ l1_orders_2(X1) ),
    i_0_24 ).

cnf(c_0_108,plain,
    ( r2_hidden(X1,X2)
    | r2_hidden(X1,X3)
    | X4 != k2_xboole_0(X3,X2)
    | ~ r2_hidden(X1,X4) ),
    i_0_20 ).

cnf(c_0_109,plain,
    ( r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
    | ~ l1_orders_2(k1_latsum_1(esk1_0,esk2_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102]),c_0_103])]),c_0_104]) ).

cnf(c_0_110,plain,
    ( u1_struct_0(k1_latsum_1(X1,X2)) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))
    | ~ l1_orders_2(X2)
    | ~ l1_orders_2(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_105]),c_0_106]),c_0_107]) ).

cnf(c_0_111,plain,
    ( r2_hidden(X1,X2)
    | r2_hidden(X1,X3)
    | ~ r2_hidden(X1,k2_xboole_0(X2,X3)) ),
    inference(er,[status(thm)],[c_0_108]) ).

cnf(c_0_112,plain,
    ( r2_hidden(esk3_0,k2_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)))
    | ~ l1_orders_2(k1_latsum_1(esk1_0,esk2_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_103]),c_0_102])]) ).

cnf(c_0_113,negated_conjecture,
    ~ r2_hidden(esk3_0,u1_struct_0(esk1_0)),
    i_0_2 ).

cnf(c_0_114,plain,
    ( r2_hidden(esk3_0,u1_struct_0(esk2_0))
    | ~ l1_orders_2(k1_latsum_1(esk1_0,esk2_0)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_113]) ).

cnf(c_0_115,plain,
    ( ~ v1_xboole_0(X1)
    | ~ r2_hidden(X2,X1) ),
    i_0_76 ).

cnf(c_0_116,plain,
    r2_hidden(esk3_0,u1_struct_0(esk2_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_106]),c_0_103]),c_0_102])]) ).

cnf(c_0_117,plain,
    k2_xboole_0(X1,k4_xboole_0(X2,X1)) = k2_xboole_0(X1,X2),
    i_0_68 ).

cnf(c_0_118,plain,
    ( v1_xboole_0(X1)
    | ~ v1_xboole_0(k2_xboole_0(X2,X1)) ),
    i_0_51 ).

cnf(c_0_119,negated_conjecture,
    ( r2_hidden(esk3_0,k2_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)))
    | v1_xboole_0(k2_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_110]),c_0_103]),c_0_102])]) ).

cnf(c_0_120,plain,
    ~ v1_xboole_0(u1_struct_0(esk2_0)),
    inference(spm,[status(thm)],[c_0_115,c_0_116]) ).

cnf(c_0_121,negated_conjecture,
    ~ r2_hidden(esk3_0,k4_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0))),
    i_0_1 ).

cnf(c_0_122,plain,
    ( r2_hidden(X1,k4_xboole_0(X2,X3))
    | r2_hidden(X1,X3)
    | ~ r2_hidden(X1,k2_xboole_0(X3,X2)) ),
    inference(spm,[status(thm)],[c_0_111,c_0_117]) ).

cnf(c_0_123,plain,
    r2_hidden(esk3_0,k2_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_120]) ).

cnf(c_0_124,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_123])]),c_0_113]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU407+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/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.12/0.34  % DateTime : Sun Jun 19 08:07:55 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 8.39/2.48  # ENIGMATIC: Solved by autoschedule:
% 8.39/2.48  # No SInE strategy applied
% 8.39/2.48  # Trying AutoSched0 for 150 seconds
% 8.39/2.48  # AutoSched0-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 8.39/2.48  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.39/2.48  #
% 8.39/2.48  # Preprocessing time       : 0.025 s
% 8.39/2.48  
% 8.39/2.48  # Proof found!
% 8.39/2.48  # SZS status Theorem
% 8.39/2.48  # SZS output start CNFRefutation
% See solution above
% 8.39/2.48  # Training examples: 0 positive, 0 negative
% 8.39/2.48  
% 8.39/2.48  # -------------------------------------------------
% 8.39/2.48  # User time                : 0.034 s
% 8.39/2.48  # System time              : 0.005 s
% 8.39/2.48  # Total time               : 0.039 s
% 8.39/2.48  # Maximum resident set size: 7116 pages
% 8.39/2.48  
%------------------------------------------------------------------------------