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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU308+2 : TPTP v8.1.0. Released v3.3.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:40:39 EDT 2022

% Result   : Theorem 8.23s 2.84s
% Output   : CNFRefutation 8.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   17 (  11 unt;   0 nHn;  15 RR)
%            Number of literals    :   25 (  10 equ;  12 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    :    8 (   8 usr;   2 con; 0-3 aty)
%            Number of variables   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1551,negated_conjecture,
    subset_difference(the_carrier(esk285_0),cast_as_carrier_subset(esk285_0),esk286_0) != subset_complement(the_carrier(esk285_0),esk286_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jwh94kf7/lgb.p',i_0_1551) ).

cnf(i_0_237,plain,
    ( cast_as_carrier_subset(X1) = the_carrier(X1)
    | ~ one_sorted_str(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jwh94kf7/lgb.p',i_0_237) ).

cnf(i_0_1553,negated_conjecture,
    one_sorted_str(esk285_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jwh94kf7/lgb.p',i_0_1553) ).

cnf(i_0_692,plain,
    ( subset_difference(X1,X2,X3) = set_difference(X2,X3)
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jwh94kf7/lgb.p',i_0_692) ).

cnf(i_0_1552,negated_conjecture,
    element(esk286_0,powerset(the_carrier(esk285_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jwh94kf7/lgb.p',i_0_1552) ).

cnf(i_0_390,plain,
    element(X1,powerset(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jwh94kf7/lgb.p',i_0_390) ).

cnf(i_0_315,plain,
    ( subset_complement(X1,X2) = set_difference(X1,X2)
    | ~ element(X2,powerset(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jwh94kf7/lgb.p',i_0_315) ).

cnf(c_0_1561,negated_conjecture,
    subset_difference(the_carrier(esk285_0),cast_as_carrier_subset(esk285_0),esk286_0) != subset_complement(the_carrier(esk285_0),esk286_0),
    i_0_1551 ).

cnf(c_0_1562,plain,
    ( cast_as_carrier_subset(X1) = the_carrier(X1)
    | ~ one_sorted_str(X1) ),
    i_0_237 ).

cnf(c_0_1563,negated_conjecture,
    one_sorted_str(esk285_0),
    i_0_1553 ).

cnf(c_0_1564,negated_conjecture,
    subset_difference(the_carrier(esk285_0),the_carrier(esk285_0),esk286_0) != subset_complement(the_carrier(esk285_0),esk286_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1561,c_0_1562]),c_0_1563])]) ).

cnf(c_0_1565,plain,
    ( subset_difference(X1,X2,X3) = set_difference(X2,X3)
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    i_0_692 ).

cnf(c_0_1566,negated_conjecture,
    element(esk286_0,powerset(the_carrier(esk285_0))),
    i_0_1552 ).

cnf(c_0_1567,plain,
    element(X1,powerset(X1)),
    i_0_390 ).

cnf(c_0_1568,plain,
    subset_complement(the_carrier(esk285_0),esk286_0) != set_difference(the_carrier(esk285_0),esk286_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1564,c_0_1565]),c_0_1566]),c_0_1567])]) ).

cnf(c_0_1569,plain,
    ( subset_complement(X1,X2) = set_difference(X1,X2)
    | ~ element(X2,powerset(X1)) ),
    i_0_315 ).

cnf(c_0_1570,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1568,c_0_1569]),c_0_1566])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SEU308+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.31  % Computer : n014.cluster.edu
% 0.12/0.31  % Model    : x86_64 x86_64
% 0.12/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31  % Memory   : 8042.1875MB
% 0.12/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31  % CPULimit : 300
% 0.12/0.31  % WCLimit  : 600
% 0.12/0.31  % DateTime : Sun Jun 19 18:23:20 EDT 2022
% 0.12/0.31  % CPUTime  : 
% 0.16/0.43  # ENIGMATIC: Selected SinE mode:
% 0.16/0.45  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.16/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.16/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.23/2.84  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.23/2.84  # No SInE strategy applied
% 8.23/2.84  # Trying AutoSched0 for 150 seconds
% 8.23/2.84  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 8.23/2.84  # and selection function SelectComplexExceptUniqMaxHorn.
% 8.23/2.84  #
% 8.23/2.84  # Preprocessing time       : 0.025 s
% 8.23/2.84  # Presaturation interreduction done
% 8.23/2.84  
% 8.23/2.84  # Proof found!
% 8.23/2.84  # SZS status Theorem
% 8.23/2.84  # SZS output start CNFRefutation
% See solution above
% 8.23/2.84  # Training examples: 0 positive, 0 negative
% 8.23/2.84  
% 8.23/2.84  # -------------------------------------------------
% 8.23/2.84  # User time                : 0.031 s
% 8.23/2.84  # System time              : 0.009 s
% 8.23/2.84  # Total time               : 0.040 s
% 8.23/2.84  # Maximum resident set size: 7120 pages
% 8.23/2.84  
%------------------------------------------------------------------------------