↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n027.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 00:14:57 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_5,plain,
    ( X1 = X2
    | X3 != singleton(X2)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3py_zk4b/lgb.p',i_0_5) ).

cnf(i_0_6,plain,
    ( in(X1,X2)
    | disjoint(singleton(X1),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3py_zk4b/lgb.p',i_0_6) ).

cnf(i_0_10,negated_conjecture,
    ~ disjoint(singleton(esk4_0),singleton(esk5_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3py_zk4b/lgb.p',i_0_10) ).

cnf(i_0_11,negated_conjecture,
    esk4_0 != esk5_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3py_zk4b/lgb.p',i_0_11) ).

cnf(c_0_16,plain,
    ( X1 = X2
    | X3 != singleton(X2)
    | ~ in(X1,X3) ),
    i_0_5 ).

cnf(c_0_17,plain,
    ( X1 = X2
    | ~ in(X1,singleton(X2)) ),
    inference(er,[status(thm)],[c_0_16]) ).

cnf(c_0_18,plain,
    ( in(X1,X2)
    | disjoint(singleton(X1),X2) ),
    i_0_6 ).

cnf(c_0_19,negated_conjecture,
    ~ disjoint(singleton(esk4_0),singleton(esk5_0)),
    i_0_10 ).

cnf(c_0_20,plain,
    ( X1 = X2
    | disjoint(singleton(X1),singleton(X2)) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,negated_conjecture,
    esk4_0 != esk5_0,
    i_0_11 ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem  : SET876+1 : TPTP v8.1.0. Released v3.2.0.
% 0.13/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n027.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Mon Jul 11 09:11:20 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 8.20/2.66  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.20/2.66  # No SInE strategy applied
% 8.20/2.66  # Trying AutoSched0 for 150 seconds
% 8.20/2.66  # AutoSched0-Mode selected heuristic G_____0026_C18_F1_SE_CS_SP_S4S
% 8.20/2.66  # and selection function SelectNewComplexAHPNS.
% 8.20/2.66  #
% 8.20/2.66  # Preprocessing time       : 0.020 s
% 8.20/2.66  
% 8.20/2.66  # Proof found!
% 8.20/2.66  # SZS status Theorem
% 8.20/2.66  # SZS output start CNFRefutation
% See solution above
% 8.20/2.66  # Training examples: 0 positive, 0 negative
% 8.20/2.66  
% 8.20/2.66  # -------------------------------------------------
% 8.20/2.66  # User time                : 0.020 s
% 8.20/2.66  # System time              : 0.008 s
% 8.20/2.66  # Total time               : 0.028 s
% 8.20/2.66  # Maximum resident set size: 7124 pages
% 8.20/2.66  
%------------------------------------------------------------------------------