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

View Problem - Process Solution

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

% Computer : n025.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:30 EDT 2022

% Result   : Theorem 7.94s 2.41s
% Output   : CNFRefutation 7.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   28 (  16 unt;   2 nHn;  26 RR)
%            Number of literals    :   65 (   4 equ;  40 neg)
%            Maximal clause size   :    8 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   24 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_30,plain,
    ( related(X1,X2,X3)
    | X2 != join_on_relstr(X1,X4)
    | ~ rel_str(X1)
    | ~ antisymmetric_relstr(X1)
    | ~ ex_sup_of_relstr_set(X1,X4)
    | ~ relstr_set_smaller(X1,X4,X3)
    | ~ element(X2,the_carrier(X1))
    | ~ element(X3,the_carrier(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k4ar4qij/input.p',i_0_30) ).

cnf(i_0_5,plain,
    ( element(join_on_relstr(X1,X2),the_carrier(X1))
    | ~ rel_str(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k4ar4qij/input.p',i_0_5) ).

cnf(i_0_35,negated_conjecture,
    element(esk10_0,the_carrier(esk9_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k4ar4qij/input.p',i_0_35) ).

cnf(i_0_38,negated_conjecture,
    antisymmetric_relstr(esk9_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k4ar4qij/input.p',i_0_38) ).

cnf(i_0_36,negated_conjecture,
    rel_str(esk9_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k4ar4qij/input.p',i_0_36) ).

cnf(i_0_33,plain,
    ( empty_carrier(X1)
    | ex_sup_of_relstr_set(X1,empty_set)
    | ~ rel_str(X1)
    | ~ antisymmetric_relstr(X1)
    | ~ lower_bounded_relstr(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k4ar4qij/input.p',i_0_33) ).

cnf(i_0_37,negated_conjecture,
    lower_bounded_relstr(esk9_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k4ar4qij/input.p',i_0_37) ).

cnf(i_0_39,negated_conjecture,
    ~ empty_carrier(esk9_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k4ar4qij/input.p',i_0_39) ).

cnf(i_0_42,plain,
    ( relstr_set_smaller(X1,empty_set,X2)
    | ~ rel_str(X1)
    | ~ element(X2,the_carrier(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k4ar4qij/input.p',i_0_42) ).

cnf(i_0_34,negated_conjecture,
    ~ related(esk9_0,bottom_of_relstr(esk9_0),esk10_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k4ar4qij/input.p',i_0_34) ).

cnf(i_0_3,plain,
    ( join_on_relstr(X1,empty_set) = bottom_of_relstr(X1)
    | ~ rel_str(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k4ar4qij/input.p',i_0_3) ).

cnf(c_0_54,plain,
    ( related(X1,X2,X3)
    | X2 != join_on_relstr(X1,X4)
    | ~ rel_str(X1)
    | ~ antisymmetric_relstr(X1)
    | ~ ex_sup_of_relstr_set(X1,X4)
    | ~ relstr_set_smaller(X1,X4,X3)
    | ~ element(X2,the_carrier(X1))
    | ~ element(X3,the_carrier(X1)) ),
    i_0_30 ).

cnf(c_0_55,plain,
    ( element(join_on_relstr(X1,X2),the_carrier(X1))
    | ~ rel_str(X1) ),
    i_0_5 ).

cnf(c_0_56,plain,
    ( related(X1,join_on_relstr(X1,X2),X3)
    | ~ relstr_set_smaller(X1,X2,X3)
    | ~ ex_sup_of_relstr_set(X1,X2)
    | ~ element(X3,the_carrier(X1))
    | ~ antisymmetric_relstr(X1)
    | ~ rel_str(X1) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_54]),c_0_55]) ).

cnf(c_0_57,negated_conjecture,
    element(esk10_0,the_carrier(esk9_0)),
    i_0_35 ).

cnf(c_0_58,negated_conjecture,
    antisymmetric_relstr(esk9_0),
    i_0_38 ).

cnf(c_0_59,negated_conjecture,
    rel_str(esk9_0),
    i_0_36 ).

cnf(c_0_60,plain,
    ( empty_carrier(X1)
    | ex_sup_of_relstr_set(X1,empty_set)
    | ~ rel_str(X1)
    | ~ antisymmetric_relstr(X1)
    | ~ lower_bounded_relstr(X1) ),
    i_0_33 ).

cnf(c_0_61,negated_conjecture,
    lower_bounded_relstr(esk9_0),
    i_0_37 ).

cnf(c_0_62,negated_conjecture,
    ~ empty_carrier(esk9_0),
    i_0_39 ).

cnf(c_0_63,plain,
    ( relstr_set_smaller(X1,empty_set,X2)
    | ~ rel_str(X1)
    | ~ element(X2,the_carrier(X1)) ),
    i_0_42 ).

cnf(c_0_64,negated_conjecture,
    ~ related(esk9_0,bottom_of_relstr(esk9_0),esk10_0),
    i_0_34 ).

cnf(c_0_65,plain,
    ( join_on_relstr(X1,empty_set) = bottom_of_relstr(X1)
    | ~ rel_str(X1) ),
    i_0_3 ).

cnf(c_0_66,negated_conjecture,
    ( related(esk9_0,join_on_relstr(esk9_0,X1),esk10_0)
    | ~ relstr_set_smaller(esk9_0,X1,esk10_0)
    | ~ ex_sup_of_relstr_set(esk9_0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_59])]) ).

cnf(c_0_67,negated_conjecture,
    ex_sup_of_relstr_set(esk9_0,empty_set),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_58]),c_0_59])]),c_0_62]) ).

cnf(c_0_68,negated_conjecture,
    relstr_set_smaller(esk9_0,empty_set,esk10_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_57]),c_0_59])]) ).

cnf(c_0_69,negated_conjecture,
    ~ related(esk9_0,join_on_relstr(esk9_0,empty_set),esk10_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_59])]) ).

cnf(c_0_70,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68])]),c_0_69]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU361+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n025.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jun 19 22:51:01 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 7.94/2.41  # ENIGMATIC: Solved by autoschedule:
% 7.94/2.41  # No SInE strategy applied
% 7.94/2.41  # Trying AutoSched0 for 150 seconds
% 7.94/2.41  # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_SE_CS_SP_CO_S4S
% 7.94/2.41  # and selection function SelectNewComplexAHPNS.
% 7.94/2.41  #
% 7.94/2.41  # Preprocessing time       : 0.013 s
% 7.94/2.41  
% 7.94/2.41  # Proof found!
% 7.94/2.41  # SZS status Theorem
% 7.94/2.41  # SZS output start CNFRefutation
% See solution above
% 7.94/2.41  # Training examples: 0 positive, 0 negative
% 7.94/2.41  
% 7.94/2.41  # -------------------------------------------------
% 7.94/2.41  # User time                : 0.033 s
% 7.94/2.41  # System time              : 0.005 s
% 7.94/2.41  # Total time               : 0.038 s
% 7.94/2.41  # Maximum resident set size: 7124 pages
% 7.94/2.41  
%------------------------------------------------------------------------------