↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n024.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:12:24 EDT 2022

% Result   : Theorem 7.70s 2.31s
% Output   : CNFRefutation 7.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   15 (  10 unt;   2 nHn;  13 RR)
%            Number of literals    :   22 (   3 equ;  10 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    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   13 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_14,negated_conjecture,
    ~ not_equal(intersection(esk4_0,esk5_0),empty_set),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g6u3_tyu/lgb.p',i_0_14) ).

cnf(i_0_9,plain,
    ( X1 = X2
    | not_equal(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g6u3_tyu/lgb.p',i_0_9) ).

cnf(i_0_1,plain,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X3)
    | ~ member(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g6u3_tyu/lgb.p',i_0_1) ).

cnf(i_0_4,plain,
    ~ member(X1,empty_set),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g6u3_tyu/lgb.p',i_0_4) ).

cnf(i_0_15,negated_conjecture,
    member(esk3_0,esk5_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g6u3_tyu/lgb.p',i_0_15) ).

cnf(i_0_16,negated_conjecture,
    member(esk3_0,esk4_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g6u3_tyu/lgb.p',i_0_16) ).

cnf(c_0_23,negated_conjecture,
    ~ not_equal(intersection(esk4_0,esk5_0),empty_set),
    i_0_14 ).

cnf(c_0_24,plain,
    ( X1 = X2
    | not_equal(X1,X2) ),
    i_0_9 ).

cnf(c_0_25,plain,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X3)
    | ~ member(X1,X2) ),
    i_0_1 ).

cnf(c_0_26,negated_conjecture,
    intersection(esk4_0,esk5_0) = empty_set,
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,plain,
    ~ member(X1,empty_set),
    i_0_4 ).

cnf(c_0_28,negated_conjecture,
    ( ~ member(X1,esk5_0)
    | ~ member(X1,esk4_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).

cnf(c_0_29,negated_conjecture,
    member(esk3_0,esk5_0),
    i_0_15 ).

cnf(c_0_30,negated_conjecture,
    member(esk3_0,esk4_0),
    i_0_16 ).

cnf(c_0_31,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET581+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n024.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jul  9 17:12:30 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.70/2.31  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.70/2.31  # No SInE strategy applied
% 7.70/2.31  # Trying AutoSched0 for 150 seconds
% 7.70/2.31  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 7.70/2.31  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.70/2.31  #
% 7.70/2.31  # Preprocessing time       : 0.023 s
% 7.70/2.31  # Presaturation interreduction done
% 7.70/2.31  
% 7.70/2.31  # Proof found!
% 7.70/2.31  # SZS status Theorem
% 7.70/2.31  # SZS output start CNFRefutation
% See solution above
% 7.70/2.31  # Training examples: 0 positive, 0 negative
% 7.70/2.31  
% 7.70/2.31  # -------------------------------------------------
% 7.70/2.31  # User time                : 0.024 s
% 7.70/2.31  # System time              : 0.004 s
% 7.70/2.31  # Total time               : 0.028 s
% 7.70/2.31  # Maximum resident set size: 7132 pages
% 7.70/2.31  
%------------------------------------------------------------------------------