↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU113+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n005.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:32 EDT 2022

% Result   : Theorem 8.66s 2.46s
% Output   : CNFRefutation 8.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   22 (   8 unt;   7 nHn;  14 RR)
%            Number of literals    :   42 (   2 equ;  17 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   35 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_16,plain,
    ( subset(X1,X2)
    | X3 != finite_subsets(X2)
    | ~ preboolean(X3)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-02gj2_2w/lgb.p',i_0_16) ).

cnf(i_0_25,plain,
    preboolean(finite_subsets(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-02gj2_2w/lgb.p',i_0_25) ).

cnf(i_0_9,plain,
    ( subset(X1,X2)
    | in(esk1_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-02gj2_2w/lgb.p',i_0_9) ).

cnf(i_0_62,plain,
    ( element(X1,powerset(X2))
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-02gj2_2w/lgb.p',i_0_62) ).

cnf(i_0_61,plain,
    ( empty(X1)
    | in(X2,X1)
    | ~ element(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-02gj2_2w/lgb.p',i_0_61) ).

cnf(i_0_23,plain,
    ~ empty(powerset(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-02gj2_2w/lgb.p',i_0_23) ).

cnf(i_0_8,plain,
    ( subset(X1,X2)
    | ~ in(esk1_2(X1,X2),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-02gj2_2w/lgb.p',i_0_8) ).

cnf(i_0_60,negated_conjecture,
    ~ subset(finite_subsets(esk13_0),powerset(esk13_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-02gj2_2w/lgb.p',i_0_60) ).

cnf(c_0_71,plain,
    ( subset(X1,X2)
    | X3 != finite_subsets(X2)
    | ~ preboolean(X3)
    | ~ in(X1,X3) ),
    i_0_16 ).

cnf(c_0_72,plain,
    preboolean(finite_subsets(X1)),
    i_0_25 ).

cnf(c_0_73,plain,
    ( subset(X1,X2)
    | ~ in(X1,finite_subsets(X2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_71]),c_0_72])]) ).

cnf(c_0_74,plain,
    ( subset(X1,X2)
    | in(esk1_2(X1,X2),X1) ),
    i_0_9 ).

cnf(c_0_75,plain,
    ( element(X1,powerset(X2))
    | ~ subset(X1,X2) ),
    i_0_62 ).

cnf(c_0_76,plain,
    ( subset(esk1_2(finite_subsets(X1),X2),X1)
    | subset(finite_subsets(X1),X2) ),
    inference(spm,[status(thm)],[c_0_73,c_0_74]) ).

cnf(c_0_77,plain,
    ( empty(X1)
    | in(X2,X1)
    | ~ element(X2,X1) ),
    i_0_61 ).

cnf(c_0_78,plain,
    ( element(esk1_2(finite_subsets(X1),X2),powerset(X1))
    | subset(finite_subsets(X1),X2) ),
    inference(spm,[status(thm)],[c_0_75,c_0_76]) ).

cnf(c_0_79,plain,
    ~ empty(powerset(X1)),
    i_0_23 ).

cnf(c_0_80,plain,
    ( subset(X1,X2)
    | ~ in(esk1_2(X1,X2),X2) ),
    i_0_8 ).

cnf(c_0_81,plain,
    ( in(esk1_2(finite_subsets(X1),X2),powerset(X1))
    | subset(finite_subsets(X1),X2) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]) ).

cnf(c_0_82,negated_conjecture,
    ~ subset(finite_subsets(esk13_0),powerset(esk13_0)),
    i_0_60 ).

cnf(c_0_83,plain,
    subset(finite_subsets(X1),powerset(X1)),
    inference(spm,[status(thm)],[c_0_80,c_0_81]) ).

cnf(c_0_84,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_83])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU113+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.34  % Computer : n005.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sun Jun 19 04:08:25 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 8.66/2.46  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.66/2.46  # No SInE strategy applied
% 8.66/2.46  # Trying AutoSched0 for 150 seconds
% 8.66/2.46  # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S083N
% 8.66/2.46  # and selection function SelectCQArNT.
% 8.66/2.46  #
% 8.66/2.46  # Preprocessing time       : 0.023 s
% 8.66/2.46  # Presaturation interreduction done
% 8.66/2.46  
% 8.66/2.46  # Proof found!
% 8.66/2.46  # SZS status Theorem
% 8.66/2.46  # SZS output start CNFRefutation
% See solution above
% 8.66/2.46  # Training examples: 0 positive, 0 negative
% 8.66/2.46  
% 8.66/2.46  # -------------------------------------------------
% 8.66/2.46  # User time                : 0.047 s
% 8.66/2.46  # System time              : 0.006 s
% 8.66/2.46  # Total time               : 0.053 s
% 8.66/2.46  # Maximum resident set size: 7128 pages
% 8.66/2.46  
%------------------------------------------------------------------------------