↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n032.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 08:39:10 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_22,plain,
    ( subset_complement(X1,X2) = set_difference(X1,X2)
    | ~ element(X2,powerset(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xpq409e1/input.p',i_0_22) ).

cnf(i_0_25,negated_conjecture,
    element(esk8_0,powerset(esk6_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xpq409e1/input.p',i_0_25) ).

cnf(i_0_30,plain,
    ( X1 != set_difference(X2,X3)
    | ~ in(X4,X1)
    | ~ in(X4,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xpq409e1/input.p',i_0_30) ).

cnf(i_0_24,negated_conjecture,
    in(esk7_0,subset_complement(esk6_0,esk8_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xpq409e1/input.p',i_0_24) ).

cnf(i_0_23,negated_conjecture,
    in(esk7_0,esk8_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xpq409e1/input.p',i_0_23) ).

cnf(c_0_36,plain,
    ( subset_complement(X1,X2) = set_difference(X1,X2)
    | ~ element(X2,powerset(X1)) ),
    i_0_22 ).

cnf(c_0_37,negated_conjecture,
    element(esk8_0,powerset(esk6_0)),
    i_0_25 ).

cnf(c_0_38,plain,
    ( X1 != set_difference(X2,X3)
    | ~ in(X4,X1)
    | ~ in(X4,X3) ),
    i_0_30 ).

cnf(c_0_39,negated_conjecture,
    in(esk7_0,subset_complement(esk6_0,esk8_0)),
    i_0_24 ).

cnf(c_0_40,negated_conjecture,
    subset_complement(esk6_0,esk8_0) = set_difference(esk6_0,esk8_0),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_41,plain,
    ( ~ in(X1,set_difference(X2,X3))
    | ~ in(X1,X3) ),
    inference(er,[status(thm)],[c_0_38]) ).

cnf(c_0_42,negated_conjecture,
    in(esk7_0,set_difference(esk6_0,esk8_0)),
    inference(rw,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_43,negated_conjecture,
    in(esk7_0,esk8_0),
    i_0_23 ).

cnf(c_0_44,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11  % Problem  : SEU172+1 : TPTP v8.1.0. Released v3.3.0.
% 0.05/0.11  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.31  % Computer : n032.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 600
% 0.11/0.31  % DateTime : Mon Jun 20 01:26:20 EDT 2022
% 0.11/0.31  % CPUTime  : 
% 0.16/0.39  # ENIGMATIC: Selected complete mode:
% 6.25/2.00  # ENIGMATIC: Solved by autoschedule:
% 6.25/2.00  # No SInE strategy applied
% 6.25/2.00  # Trying AutoSched0 for 150 seconds
% 6.25/2.00  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S02CN
% 6.25/2.00  # and selection function SelectAntiRROptimalLit.
% 6.25/2.00  #
% 6.25/2.00  # Preprocessing time       : 0.016 s
% 6.25/2.00  # Presaturation interreduction done
% 6.25/2.00  
% 6.25/2.00  # Proof found!
% 6.25/2.00  # SZS status Theorem
% 6.25/2.00  # SZS output start CNFRefutation
% See solution above
% 6.25/2.00  # Training examples: 0 positive, 0 negative
% 6.25/2.00  
% 6.25/2.00  # -------------------------------------------------
% 6.25/2.00  # User time                : 0.017 s
% 6.25/2.00  # System time              : 0.005 s
% 6.25/2.00  # Total time               : 0.022 s
% 6.25/2.00  # Maximum resident set size: 7120 pages
% 6.25/2.00  
%------------------------------------------------------------------------------