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

View Problem - Process Solution

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

% Computer : n019.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:31 EDT 2022

% Result   : Theorem 8.82s 3.19s
% Output   : CNFRefutation 8.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   27 (  16 unt;   2 nHn;  25 RR)
%            Number of literals    :   59 (   5 equ;  34 neg)
%            Maximal clause size   :    7 (   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   :   23 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_574,plain,
    ( related(X1,X2,X3)
    | X2 != join_on_relstr(X1,X4)
    | ~ rel_str(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/sandbox2/tmp/enigma-theBenchmark.p-cllcqjx1/lgb.p',i_0_574) ).

cnf(i_0_590,plain,
    ( element(join_on_relstr(X1,X2),the_carrier(X1))
    | ~ rel_str(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cllcqjx1/lgb.p',i_0_590) ).

cnf(i_0_2749,lemma,
    ( relstr_set_smaller(X1,empty_set,X2)
    | ~ rel_str(X1)
    | ~ element(X2,the_carrier(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cllcqjx1/lgb.p',i_0_2749) ).

cnf(i_0_2654,negated_conjecture,
    element(esk442_0,the_carrier(esk441_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cllcqjx1/lgb.p',i_0_2654) ).

cnf(i_0_2655,negated_conjecture,
    rel_str(esk441_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cllcqjx1/lgb.p',i_0_2655) ).

cnf(i_0_133,plain,
    ( join_on_relstr(X1,empty_set) = bottom_of_relstr(X1)
    | ~ rel_str(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cllcqjx1/lgb.p',i_0_133) ).

cnf(i_0_2645,lemma,
    ( empty_carrier(X1)
    | ex_sup_of_relstr_set(X1,empty_set)
    | ~ rel_str(X1)
    | ~ lower_bounded_relstr(X1)
    | ~ antisymmetric_relstr(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cllcqjx1/lgb.p',i_0_2645) ).

cnf(i_0_2657,negated_conjecture,
    antisymmetric_relstr(esk441_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cllcqjx1/lgb.p',i_0_2657) ).

cnf(i_0_2656,negated_conjecture,
    lower_bounded_relstr(esk441_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cllcqjx1/lgb.p',i_0_2656) ).

cnf(i_0_2658,negated_conjecture,
    ~ empty_carrier(esk441_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cllcqjx1/lgb.p',i_0_2658) ).

cnf(i_0_2653,negated_conjecture,
    ~ related(esk441_0,bottom_of_relstr(esk441_0),esk442_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cllcqjx1/lgb.p',i_0_2653) ).

cnf(c_0_2761,plain,
    ( related(X1,X2,X3)
    | X2 != join_on_relstr(X1,X4)
    | ~ rel_str(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_574 ).

cnf(c_0_2762,plain,
    ( element(join_on_relstr(X1,X2),the_carrier(X1))
    | ~ rel_str(X1) ),
    i_0_590 ).

cnf(c_0_2763,lemma,
    ( relstr_set_smaller(X1,empty_set,X2)
    | ~ rel_str(X1)
    | ~ element(X2,the_carrier(X1)) ),
    i_0_2749 ).

cnf(c_0_2764,negated_conjecture,
    element(esk442_0,the_carrier(esk441_0)),
    i_0_2654 ).

cnf(c_0_2765,negated_conjecture,
    rel_str(esk441_0),
    i_0_2655 ).

cnf(c_0_2766,plain,
    ( join_on_relstr(X1,empty_set) = bottom_of_relstr(X1)
    | ~ rel_str(X1) ),
    i_0_133 ).

cnf(c_0_2767,lemma,
    ( empty_carrier(X1)
    | ex_sup_of_relstr_set(X1,empty_set)
    | ~ rel_str(X1)
    | ~ lower_bounded_relstr(X1)
    | ~ antisymmetric_relstr(X1) ),
    i_0_2645 ).

cnf(c_0_2768,negated_conjecture,
    antisymmetric_relstr(esk441_0),
    i_0_2657 ).

cnf(c_0_2769,negated_conjecture,
    lower_bounded_relstr(esk441_0),
    i_0_2656 ).

cnf(c_0_2770,negated_conjecture,
    ~ empty_carrier(esk441_0),
    i_0_2658 ).

cnf(c_0_2771,plain,
    ( related(X1,join_on_relstr(X1,X2),X3)
    | ~ relstr_set_smaller(X1,X2,X3)
    | ~ ex_sup_of_relstr_set(X1,X2)
    | ~ rel_str(X1)
    | ~ element(X3,the_carrier(X1)) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_2761]),c_0_2762]) ).

cnf(c_0_2772,negated_conjecture,
    relstr_set_smaller(esk441_0,empty_set,esk442_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2763,c_0_2764]),c_0_2765])]) ).

cnf(c_0_2773,negated_conjecture,
    join_on_relstr(esk441_0,empty_set) = bottom_of_relstr(esk441_0),
    inference(spm,[status(thm)],[c_0_2766,c_0_2765]) ).

cnf(c_0_2774,negated_conjecture,
    ex_sup_of_relstr_set(esk441_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_2767,c_0_2768]),c_0_2769]),c_0_2765])]),c_0_2770]) ).

cnf(c_0_2775,negated_conjecture,
    ~ related(esk441_0,bottom_of_relstr(esk441_0),esk442_0),
    i_0_2653 ).

cnf(c_0_2776,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2771,c_0_2772]),c_0_2773]),c_0_2774]),c_0_2765]),c_0_2764])]),c_0_2775]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SEU361+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n019.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 : Mon Jun 20 10:42:41 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.49  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.49  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.49  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.49  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.82/3.19  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.82/3.19  # No SInE strategy applied
% 8.82/3.19  # Trying AutoSched0 for 150 seconds
% 8.82/3.19  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S079N
% 8.82/3.19  # and selection function SelectGrCQArEqFirst.
% 8.82/3.19  #
% 8.82/3.19  # Preprocessing time       : 0.026 s
% 8.82/3.19  # Presaturation interreduction done
% 8.82/3.19  
% 8.82/3.19  # Proof found!
% 8.82/3.19  # SZS status Theorem
% 8.82/3.19  # SZS output start CNFRefutation
% See solution above
% 8.82/3.19  # Training examples: 0 positive, 0 negative
% 8.82/3.19  
% 8.82/3.19  # -------------------------------------------------
% 8.82/3.19  # User time                : 0.063 s
% 8.82/3.19  # System time              : 0.007 s
% 8.82/3.19  # Total time               : 0.070 s
% 8.82/3.19  # Maximum resident set size: 7192 pages
% 8.82/3.19  
%------------------------------------------------------------------------------