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

View Problem - Process Solution

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

% Computer : n020.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:46 EDT 2022

% Result   : Theorem 7.96s 2.22s
% Output   : CNFRefutation 7.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   21 (   9 unt;   2 nHn;  21 RR)
%            Number of literals    :   41 (   3 equ;  21 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2,plain,
    ( element(subset_complement(X1,X2),powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ft9y7tyq/input.p',i_0_2) ).

cnf(i_0_16,negated_conjecture,
    element(esk5_0,powerset(the_carrier(esk4_0))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ft9y7tyq/input.p',i_0_16) ).

cnf(i_0_10,plain,
    ( subset_complement(X1,subset_complement(X1,X2)) = X2
    | ~ element(X2,powerset(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ft9y7tyq/input.p',i_0_10) ).

cnf(i_0_13,plain,
    ( open_subset(subset_complement(the_carrier(X1),X2),X1)
    | ~ top_str(X1)
    | ~ closed_subset(X2,X1)
    | ~ element(X2,powerset(the_carrier(X1))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ft9y7tyq/input.p',i_0_13) ).

cnf(i_0_17,negated_conjecture,
    top_str(esk4_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ft9y7tyq/input.p',i_0_17) ).

cnf(i_0_14,negated_conjecture,
    ( open_subset(esk5_0,esk4_0)
    | closed_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ft9y7tyq/input.p',i_0_14) ).

cnf(i_0_15,negated_conjecture,
    ( ~ open_subset(esk5_0,esk4_0)
    | ~ closed_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ft9y7tyq/input.p',i_0_15) ).

cnf(i_0_12,plain,
    ( closed_subset(X1,X2)
    | ~ top_str(X2)
    | ~ element(X1,powerset(the_carrier(X2)))
    | ~ open_subset(subset_complement(the_carrier(X2),X1),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ft9y7tyq/input.p',i_0_12) ).

cnf(c_0_26,plain,
    ( element(subset_complement(X1,X2),powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    i_0_2 ).

cnf(c_0_27,negated_conjecture,
    element(esk5_0,powerset(the_carrier(esk4_0))),
    i_0_16 ).

cnf(c_0_28,plain,
    ( subset_complement(X1,subset_complement(X1,X2)) = X2
    | ~ element(X2,powerset(X1)) ),
    i_0_10 ).

cnf(c_0_29,plain,
    ( open_subset(subset_complement(the_carrier(X1),X2),X1)
    | ~ top_str(X1)
    | ~ closed_subset(X2,X1)
    | ~ element(X2,powerset(the_carrier(X1))) ),
    i_0_13 ).

cnf(c_0_30,negated_conjecture,
    element(subset_complement(the_carrier(esk4_0),esk5_0),powerset(the_carrier(esk4_0))),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    subset_complement(the_carrier(esk4_0),subset_complement(the_carrier(esk4_0),esk5_0)) = esk5_0,
    inference(spm,[status(thm)],[c_0_28,c_0_27]) ).

cnf(c_0_32,negated_conjecture,
    top_str(esk4_0),
    i_0_17 ).

cnf(c_0_33,negated_conjecture,
    ( open_subset(esk5_0,esk4_0)
    | closed_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0) ),
    i_0_14 ).

cnf(c_0_34,negated_conjecture,
    ( ~ open_subset(esk5_0,esk4_0)
    | ~ closed_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0) ),
    i_0_15 ).

cnf(c_0_35,negated_conjecture,
    open_subset(esk5_0,esk4_0),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]),c_0_33]) ).

cnf(c_0_36,plain,
    ( closed_subset(X1,X2)
    | ~ top_str(X2)
    | ~ element(X1,powerset(the_carrier(X2)))
    | ~ open_subset(subset_complement(the_carrier(X2),X1),X2) ),
    i_0_12 ).

cnf(c_0_37,negated_conjecture,
    ~ closed_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).

cnf(c_0_38,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_30]),c_0_31]),c_0_35]),c_0_32])]),c_0_37]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11  % Problem  : SEU320+1 : TPTP v8.1.0. Released v3.3.0.
% 0.02/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.32  % Computer : n020.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Mon Jun 20 11:19:50 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.96/2.22  # ENIGMATIC: Solved by autoschedule:
% 7.96/2.22  # No SInE strategy applied
% 7.96/2.22  # Trying AutoSched0 for 150 seconds
% 7.96/2.22  # AutoSched0-Mode selected heuristic G_____0026_C18_F1_SE_CS_SP_S4S
% 7.96/2.22  # and selection function SelectNewComplexAHPNS.
% 7.96/2.22  #
% 7.96/2.22  # Preprocessing time       : 0.023 s
% 7.96/2.22  
% 7.96/2.22  # Proof found!
% 7.96/2.22  # SZS status Theorem
% 7.96/2.22  # SZS output start CNFRefutation
% See solution above
% 7.96/2.22  # Training examples: 0 positive, 0 negative
% 7.96/2.22  
% 7.96/2.22  # -------------------------------------------------
% 7.96/2.22  # User time                : 0.024 s
% 7.96/2.22  # System time              : 0.005 s
% 7.96/2.22  # Total time               : 0.029 s
% 7.96/2.22  # Maximum resident set size: 7124 pages
% 7.96/2.22  
%------------------------------------------------------------------------------