↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n015.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:09:55 EDT 2022

% Result   : Theorem 8.28s 2.52s
% Output   : CNFRefutation 8.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   16 (  10 unt;   4 nHn;   8 RR)
%            Number of literals    :   24 (  11 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 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   :   21 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
    ~ member(X1,empty_set),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4x6rlv7q/input.p',i_0_4) ).

cnf(i_0_15,plain,
    ( X1 = X2
    | member(esk3_2(X1,X2),X2)
    | member(esk3_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4x6rlv7q/input.p',i_0_15) ).

cnf(i_0_2,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X3,X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4x6rlv7q/input.p',i_0_2) ).

cnf(i_0_19,negated_conjecture,
    intersection(esk4_0,empty_set) != empty_set,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4x6rlv7q/input.p',i_0_19) ).

cnf(i_0_8,plain,
    intersection(X1,X2) = intersection(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4x6rlv7q/input.p',i_0_8) ).

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

cnf(c_0_26,plain,
    ( X1 = X2
    | member(esk3_2(X1,X2),X2)
    | member(esk3_2(X1,X2),X1) ),
    i_0_15 ).

cnf(c_0_27,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X3,X2)) ),
    i_0_2 ).

cnf(c_0_28,plain,
    ( X1 = empty_set
    | member(esk3_2(X1,empty_set),X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_29,plain,
    ( intersection(X1,X2) = empty_set
    | member(esk3_2(intersection(X1,X2),empty_set),X2) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_30,negated_conjecture,
    intersection(esk4_0,empty_set) != empty_set,
    i_0_19 ).

cnf(c_0_31,plain,
    intersection(X1,X2) = intersection(X2,X1),
    i_0_8 ).

cnf(c_0_32,plain,
    intersection(X1,empty_set) = empty_set,
    inference(spm,[status(thm)],[c_0_25,c_0_29]) ).

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

cnf(c_0_34,plain,
    intersection(empty_set,X1) = empty_set,
    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.06/0.12  % Problem  : SET146+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n015.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 00:55:39 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 8.28/2.52  # ENIGMATIC: Solved by autoschedule:
% 8.28/2.52  # No SInE strategy applied
% 8.28/2.52  # Trying AutoSched0 for 150 seconds
% 8.28/2.52  # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 8.28/2.52  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.28/2.52  #
% 8.28/2.52  # Preprocessing time       : 0.023 s
% 8.28/2.52  
% 8.28/2.52  # Proof found!
% 8.28/2.52  # SZS status Theorem
% 8.28/2.52  # SZS output start CNFRefutation
% See solution above
% 8.28/2.52  # Training examples: 0 positive, 0 negative
% 8.28/2.52  
% 8.28/2.52  # -------------------------------------------------
% 8.28/2.52  # User time                : 0.026 s
% 8.28/2.52  # System time              : 0.004 s
% 8.28/2.52  # Total time               : 0.030 s
% 8.28/2.52  # Maximum resident set size: 7124 pages
% 8.28/2.52  
%------------------------------------------------------------------------------