↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU408+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n005.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:59 EDT 2022

% Result   : Theorem 8.11s 2.46s
% Output   : CNFRefutation 8.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   25 (  13 unt;   0 nHn;  22 RR)
%            Number of literals    :   52 (   9 equ;  31 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   35 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
    ~ m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-45ihme6f/input.p',i_0_1) ).

cnf(i_0_72,plain,
    ( m1_subset_1(X1,X2)
    | ~ r2_hidden(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-45ihme6f/input.p',i_0_72) ).

cnf(i_0_21,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/sandbox/tmp/enigma-theBenchmark.p-45ihme6f/input.p',i_0_21) ).

cnf(i_0_30,plain,
    ( l1_orders_2(k1_latsum_1(X1,X2))
    | ~ l1_orders_2(X2)
    | ~ l1_orders_2(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-45ihme6f/input.p',i_0_30) ).

cnf(i_0_31,plain,
    ( v1_orders_2(k1_latsum_1(X1,X2))
    | ~ l1_orders_2(X2)
    | ~ l1_orders_2(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-45ihme6f/input.p',i_0_31) ).

cnf(i_0_3,negated_conjecture,
    l1_orders_2(esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-45ihme6f/input.p',i_0_3) ).

cnf(i_0_9,negated_conjecture,
    l1_orders_2(esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-45ihme6f/input.p',i_0_9) ).

cnf(i_0_18,plain,
    k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-45ihme6f/input.p',i_0_18) ).

cnf(i_0_26,plain,
    ( r2_hidden(X1,X2)
    | X2 != k2_xboole_0(X3,X4)
    | ~ r2_hidden(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-45ihme6f/input.p',i_0_26) ).

cnf(i_0_2,negated_conjecture,
    r2_hidden(esk3_0,u1_struct_0(esk2_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-45ihme6f/input.p',i_0_2) ).

cnf(c_0_83,negated_conjecture,
    ~ m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
    i_0_1 ).

cnf(c_0_84,plain,
    ( m1_subset_1(X1,X2)
    | ~ r2_hidden(X1,X2) ),
    i_0_72 ).

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

cnf(c_0_86,plain,
    ( l1_orders_2(k1_latsum_1(X1,X2))
    | ~ l1_orders_2(X2)
    | ~ l1_orders_2(X1) ),
    i_0_30 ).

cnf(c_0_87,plain,
    ( v1_orders_2(k1_latsum_1(X1,X2))
    | ~ l1_orders_2(X2)
    | ~ l1_orders_2(X1) ),
    i_0_31 ).

cnf(c_0_88,negated_conjecture,
    ~ r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
    inference(spm,[status(thm)],[c_0_83,c_0_84]) ).

cnf(c_0_89,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_85]),c_0_86]),c_0_87]) ).

cnf(c_0_90,negated_conjecture,
    l1_orders_2(esk2_0),
    i_0_3 ).

cnf(c_0_91,negated_conjecture,
    l1_orders_2(esk1_0),
    i_0_9 ).

cnf(c_0_92,plain,
    k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
    i_0_18 ).

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

cnf(c_0_94,negated_conjecture,
    ~ r2_hidden(esk3_0,k2_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0))),
    inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]),c_0_91])]),c_0_92]) ).

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

cnf(c_0_96,negated_conjecture,
    r2_hidden(esk3_0,u1_struct_0(esk2_0)),
    i_0_2 ).

cnf(c_0_97,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU408+1 : TPTP v8.1.0. Released v3.4.0.
% 0.00/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n005.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 : Sun Jun 19 00:19:55 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.46  # ENIGMATIC: Selected complete mode:
% 8.11/2.46  # ENIGMATIC: Solved by autoschedule:
% 8.11/2.46  # No SInE strategy applied
% 8.11/2.46  # Trying AutoSched0 for 150 seconds
% 8.11/2.46  # AutoSched0-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 8.11/2.46  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.11/2.46  #
% 8.11/2.46  # Preprocessing time       : 0.025 s
% 8.11/2.46  
% 8.11/2.46  # Proof found!
% 8.11/2.46  # SZS status Theorem
% 8.11/2.46  # SZS output start CNFRefutation
% See solution above
% 8.11/2.46  # Training examples: 0 positive, 0 negative
% 8.11/2.46  
% 8.11/2.46  # -------------------------------------------------
% 8.11/2.46  # User time                : 0.033 s
% 8.11/2.46  # System time              : 0.005 s
% 8.11/2.46  # Total time               : 0.038 s
% 8.11/2.46  # Maximum resident set size: 7124 pages
% 8.11/2.46  
%------------------------------------------------------------------------------