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

% Computer : n006.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:38:09 EDT 2022

% Result   : Theorem 4.42s 2.15s
% Output   : CNFRefutation 4.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   15 (   7 unt;   0 nHn;  15 RR)
%            Number of literals    :   27 (  12 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_55,plain,
    ( relation_dom_restriction(relation_dom_restriction(X1,X2),X3) = relation_dom_restriction(X1,X3)
    | ~ relation(X1)
    | ~ subset(X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fyzkuvdq/input.p',i_0_55) ).

cnf(i_0_51,negated_conjecture,
    subset(esk12_0,esk13_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fyzkuvdq/input.p',i_0_51) ).

cnf(i_0_53,negated_conjecture,
    relation(esk14_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fyzkuvdq/input.p',i_0_53) ).

cnf(i_0_54,plain,
    ( relation_dom_restriction(relation_dom_restriction(X1,X2),X3) = relation_dom_restriction(X1,X2)
    | ~ relation(X1)
    | ~ subset(X2,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fyzkuvdq/input.p',i_0_54) ).

cnf(i_0_50,negated_conjecture,
    ( relation_dom_restriction(relation_dom_restriction(esk14_0,esk12_0),esk13_0) != relation_dom_restriction(esk14_0,esk12_0)
    | relation_dom_restriction(relation_dom_restriction(esk14_0,esk13_0),esk12_0) != relation_dom_restriction(esk14_0,esk12_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fyzkuvdq/input.p',i_0_50) ).

cnf(c_0_61,plain,
    ( relation_dom_restriction(relation_dom_restriction(X1,X2),X3) = relation_dom_restriction(X1,X3)
    | ~ relation(X1)
    | ~ subset(X3,X2) ),
    i_0_55 ).

cnf(c_0_62,negated_conjecture,
    subset(esk12_0,esk13_0),
    i_0_51 ).

cnf(c_0_63,negated_conjecture,
    ( relation_dom_restriction(relation_dom_restriction(X1,esk13_0),esk12_0) = relation_dom_restriction(X1,esk12_0)
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_61,c_0_62]) ).

cnf(c_0_64,negated_conjecture,
    relation(esk14_0),
    i_0_53 ).

cnf(c_0_65,plain,
    ( relation_dom_restriction(relation_dom_restriction(X1,X2),X3) = relation_dom_restriction(X1,X2)
    | ~ relation(X1)
    | ~ subset(X2,X3) ),
    i_0_54 ).

cnf(c_0_66,negated_conjecture,
    ( relation_dom_restriction(relation_dom_restriction(esk14_0,esk12_0),esk13_0) != relation_dom_restriction(esk14_0,esk12_0)
    | relation_dom_restriction(relation_dom_restriction(esk14_0,esk13_0),esk12_0) != relation_dom_restriction(esk14_0,esk12_0) ),
    i_0_50 ).

cnf(c_0_67,negated_conjecture,
    relation_dom_restriction(relation_dom_restriction(esk14_0,esk13_0),esk12_0) = relation_dom_restriction(esk14_0,esk12_0),
    inference(spm,[status(thm)],[c_0_63,c_0_64]) ).

cnf(c_0_68,negated_conjecture,
    ( relation_dom_restriction(relation_dom_restriction(X1,esk12_0),esk13_0) = relation_dom_restriction(X1,esk12_0)
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_65,c_0_62]) ).

cnf(c_0_69,negated_conjecture,
    relation_dom_restriction(relation_dom_restriction(esk14_0,esk12_0),esk13_0) != relation_dom_restriction(esk14_0,esk12_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67])]) ).

cnf(c_0_70,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_64]),c_0_69]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU041+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n006.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 : Mon Jun 20 11:04:42 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 4.42/2.15  # ENIGMATIC: Solved by autoschedule:
% 4.42/2.15  # No SInE strategy applied
% 4.42/2.15  # Trying AutoSched0 for 150 seconds
% 4.42/2.15  # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 4.42/2.15  # and selection function SelectComplexG.
% 4.42/2.15  #
% 4.42/2.15  # Preprocessing time       : 0.012 s
% 4.42/2.15  
% 4.42/2.15  # Proof found!
% 4.42/2.15  # SZS status Theorem
% 4.42/2.15  # SZS output start CNFRefutation
% See solution above
% 4.42/2.15  # Training examples: 0 positive, 0 negative
% 4.42/2.15  
% 4.42/2.15  # -------------------------------------------------
% 4.42/2.15  # User time                : 0.014 s
% 4.42/2.15  # System time              : 0.004 s
% 4.42/2.15  # Total time               : 0.018 s
% 4.42/2.15  # Maximum resident set size: 7124 pages
% 4.42/2.15  
%------------------------------------------------------------------------------