↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n029.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:51 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_21,negated_conjecture,
    ( union(difference(empty_set,esk4_0),difference(esk4_0,empty_set)) != esk4_0
    | union(difference(esk4_0,empty_set),difference(empty_set,esk4_0)) != esk4_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iv48wqbt/input.p',i_0_21) ).

cnf(i_0_4,plain,
    difference(empty_set,X1) = empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iv48wqbt/input.p',i_0_4) ).

cnf(i_0_3,plain,
    difference(X1,empty_set) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iv48wqbt/input.p',i_0_3) ).

cnf(i_0_2,plain,
    union(X1,empty_set) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iv48wqbt/input.p',i_0_2) ).

cnf(i_0_9,plain,
    union(X1,X2) = union(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iv48wqbt/input.p',i_0_9) ).

cnf(c_0_27,negated_conjecture,
    ( union(difference(empty_set,esk4_0),difference(esk4_0,empty_set)) != esk4_0
    | union(difference(esk4_0,empty_set),difference(empty_set,esk4_0)) != esk4_0 ),
    i_0_21 ).

cnf(c_0_28,plain,
    difference(empty_set,X1) = empty_set,
    i_0_4 ).

cnf(c_0_29,negated_conjecture,
    ( union(empty_set,difference(esk4_0,empty_set)) != esk4_0
    | union(difference(esk4_0,empty_set),empty_set) != esk4_0 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_28]) ).

cnf(c_0_30,plain,
    difference(X1,empty_set) = X1,
    i_0_3 ).

cnf(c_0_31,plain,
    union(X1,empty_set) = X1,
    i_0_2 ).

cnf(c_0_32,plain,
    union(X1,X2) = union(X2,X1),
    i_0_9 ).

cnf(c_0_33,negated_conjecture,
    union(empty_set,esk4_0) != esk4_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_30]),c_0_31])]) ).

cnf(c_0_34,plain,
    union(empty_set,X1) = X1,
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SET617+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n029.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sun Jul 10 08:07:18 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.54/2.26  # ENIGMATIC: Solved by autoschedule:
% 7.54/2.26  # No SInE strategy applied
% 7.54/2.26  # Trying AutoSched0 for 150 seconds
% 7.54/2.26  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 7.54/2.26  # and selection function SelectNewComplexAHP.
% 7.54/2.26  #
% 7.54/2.26  # Preprocessing time       : 0.022 s
% 7.54/2.26  # Presaturation interreduction done
% 7.54/2.26  
% 7.54/2.26  # Proof found!
% 7.54/2.26  # SZS status Theorem
% 7.54/2.26  # SZS output start CNFRefutation
% See solution above
% 7.54/2.26  # Training examples: 0 positive, 0 negative
% 7.54/2.26  
% 7.54/2.26  # -------------------------------------------------
% 7.54/2.26  # User time                : 0.020 s
% 7.54/2.26  # System time              : 0.009 s
% 7.54/2.26  # Total time               : 0.029 s
% 7.54/2.26  # Maximum resident set size: 7120 pages
% 7.54/2.26  
%------------------------------------------------------------------------------