↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SET924+1 : TPTP v8.1.0. Released v3.2.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 00:15:17 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_5,negated_conjecture,
    ( in(esk3_0,esk4_0)
    | set_difference(singleton(esk3_0),esk4_0) != singleton(esk3_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qdyzpanj/lgb.p',i_0_5) ).

cnf(i_0_6,plain,
    ( set_difference(singleton(X1),X2) = singleton(X1)
    | in(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qdyzpanj/lgb.p',i_0_6) ).

cnf(i_0_4,negated_conjecture,
    ( set_difference(singleton(esk3_0),esk4_0) = singleton(esk3_0)
    | ~ in(esk3_0,esk4_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qdyzpanj/lgb.p',i_0_4) ).

cnf(i_0_7,plain,
    ( set_difference(singleton(X1),X2) != singleton(X1)
    | ~ in(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qdyzpanj/lgb.p',i_0_7) ).

cnf(c_0_12,negated_conjecture,
    ( in(esk3_0,esk4_0)
    | set_difference(singleton(esk3_0),esk4_0) != singleton(esk3_0) ),
    i_0_5 ).

cnf(c_0_13,plain,
    ( set_difference(singleton(X1),X2) = singleton(X1)
    | in(X1,X2) ),
    i_0_6 ).

cnf(c_0_14,negated_conjecture,
    ( set_difference(singleton(esk3_0),esk4_0) = singleton(esk3_0)
    | ~ in(esk3_0,esk4_0) ),
    i_0_4 ).

cnf(c_0_15,negated_conjecture,
    in(esk3_0,esk4_0),
    inference(csr,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,plain,
    ( set_difference(singleton(X1),X2) != singleton(X1)
    | ~ in(X1,X2) ),
    i_0_7 ).

cnf(c_0_17,negated_conjecture,
    set_difference(singleton(esk3_0),esk4_0) = singleton(esk3_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET924+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13  % 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 : Sun Jul 10 15:36:10 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.17/2.23  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.17/2.23  # No SInE strategy applied
% 7.17/2.23  # Trying AutoSched0 for 150 seconds
% 7.17/2.23  # AutoSched0-Mode selected heuristic G_____0010_evo
% 7.17/2.23  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.17/2.23  #
% 7.17/2.23  # Preprocessing time       : 0.023 s
% 7.17/2.23  
% 7.17/2.23  # Proof found!
% 7.17/2.23  # SZS status Theorem
% 7.17/2.23  # SZS output start CNFRefutation
% See solution above
% 7.17/2.23  # Training examples: 0 positive, 0 negative
% 7.17/2.23  
% 7.17/2.23  # -------------------------------------------------
% 7.17/2.23  # User time                : 0.024 s
% 7.17/2.23  # System time              : 0.004 s
% 7.17/2.23  # Total time               : 0.028 s
% 7.17/2.23  # Maximum resident set size: 7124 pages
% 7.17/2.23  
%------------------------------------------------------------------------------