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

% Computer : n014.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:11 EDT 2022

% Result   : Theorem 7.43s 2.33s
% Output   : CNFRefutation 7.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   14 (   6 unt;   0 nHn;  14 RR)
%            Number of literals    :   26 (  11 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_53,plain,
    ( relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) = relation_rng_restriction(X1,X3)
    | ~ relation(X3)
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qf6xlfh8/lgb.p',i_0_53) ).

cnf(i_0_49,negated_conjecture,
    subset(esk12_0,esk13_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qf6xlfh8/lgb.p',i_0_49) ).

cnf(i_0_48,negated_conjecture,
    ( relation_rng_restriction(esk12_0,relation_rng_restriction(esk13_0,esk14_0)) != relation_rng_restriction(esk12_0,esk14_0)
    | relation_rng_restriction(esk13_0,relation_rng_restriction(esk12_0,esk14_0)) != relation_rng_restriction(esk12_0,esk14_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qf6xlfh8/lgb.p',i_0_48) ).

cnf(i_0_51,negated_conjecture,
    relation(esk14_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qf6xlfh8/lgb.p',i_0_51) ).

cnf(i_0_52,plain,
    ( relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) = relation_rng_restriction(X2,X3)
    | ~ relation(X3)
    | ~ subset(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qf6xlfh8/lgb.p',i_0_52) ).

cnf(c_0_59,plain,
    ( relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) = relation_rng_restriction(X1,X3)
    | ~ relation(X3)
    | ~ subset(X1,X2) ),
    i_0_53 ).

cnf(c_0_60,negated_conjecture,
    subset(esk12_0,esk13_0),
    i_0_49 ).

cnf(c_0_61,negated_conjecture,
    ( relation_rng_restriction(esk12_0,relation_rng_restriction(esk13_0,esk14_0)) != relation_rng_restriction(esk12_0,esk14_0)
    | relation_rng_restriction(esk13_0,relation_rng_restriction(esk12_0,esk14_0)) != relation_rng_restriction(esk12_0,esk14_0) ),
    i_0_48 ).

cnf(c_0_62,negated_conjecture,
    ( relation_rng_restriction(esk12_0,relation_rng_restriction(esk13_0,X1)) = relation_rng_restriction(esk12_0,X1)
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_63,negated_conjecture,
    relation(esk14_0),
    i_0_51 ).

cnf(c_0_64,plain,
    ( relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) = relation_rng_restriction(X2,X3)
    | ~ relation(X3)
    | ~ subset(X2,X1) ),
    i_0_52 ).

cnf(c_0_65,negated_conjecture,
    relation_rng_restriction(esk13_0,relation_rng_restriction(esk12_0,esk14_0)) != relation_rng_restriction(esk12_0,esk14_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63])]) ).

cnf(c_0_66,negated_conjecture,
    ( relation_rng_restriction(esk13_0,relation_rng_restriction(esk12_0,X1)) = relation_rng_restriction(esk12_0,X1)
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_64,c_0_60]) ).

cnf(c_0_67,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_63])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU047+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n014.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 06:44:04 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.43/2.33  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.43/2.33  # No SInE strategy applied
% 7.43/2.33  # Trying AutoSched0 for 150 seconds
% 7.43/2.33  # AutoSched0-Mode selected heuristic G_E___006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 7.43/2.33  # and selection function SelectNewComplexAHP.
% 7.43/2.33  #
% 7.43/2.33  # Preprocessing time       : 0.012 s
% 7.43/2.33  
% 7.43/2.33  # Proof found!
% 7.43/2.33  # SZS status Theorem
% 7.43/2.33  # SZS output start CNFRefutation
% See solution above
% 7.43/2.33  # Training examples: 0 positive, 0 negative
% 7.43/2.33  
% 7.43/2.33  # -------------------------------------------------
% 7.43/2.33  # User time                : 0.011 s
% 7.43/2.33  # System time              : 0.005 s
% 7.43/2.33  # Total time               : 0.016 s
% 7.43/2.33  # Maximum resident set size: 7120 pages
% 7.43/2.33  
%------------------------------------------------------------------------------