↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR100+7 : TPTP v8.1.0. Bugfixed v7.3.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 : Fri Jul 15 02:47:56 EDT 2022

% Result   : Theorem 11.56s 5.33s
% Output   : CNFRefutation 11.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   23 (  13 unt;   5 nHn;  13 RR)
%            Number of literals    :   40 (   7 equ;  18 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-3 aty)
%            Number of variables   :   36 (  18 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_3480,plain,
    ( X1 = s__UnionFn(X2,X3)
    | s__instance(X3,s__SetOrClass) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85gurti_/lgb.p',i_0_3480) ).

cnf(i_0_4898,negated_conjecture,
    ~ s__instance(X1,s__Class31_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85gurti_/lgb.p',i_0_4898) ).

cnf(i_0_136,plain,
    s__instance(s__governmentType__m,s__BinaryPredicate),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85gurti_/lgb.p',i_0_136) ).

cnf(i_0_3479,plain,
    ( X1 = s__UnionFn(X2,X3)
    | s__instance(esk516_3(X3,X1,X2),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85gurti_/lgb.p',i_0_3479) ).

cnf(i_0_2455,plain,
    ( ~ s__instance(X1,X2)
    | ~ s__instance(X1,X3)
    | ~ s__disjoint(X3,X2)
    | ~ s__instance(X2,s__SetOrClass)
    | ~ s__instance(X3,s__SetOrClass) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85gurti_/lgb.p',i_0_2455) ).

cnf(i_0_304,plain,
    s__disjoint(s__Organization,s__Human),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85gurti_/lgb.p',i_0_304) ).

cnf(i_0_4889,plain,
    s__instance(s__Class31_1,s__Class),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85gurti_/lgb.p',i_0_4889) ).

cnf(c_0_4906,plain,
    ( X1 = s__UnionFn(X2,X3)
    | s__instance(X3,s__SetOrClass) ),
    i_0_3480 ).

cnf(c_0_4907,negated_conjecture,
    ~ s__instance(X1,s__Class31_1),
    i_0_4898 ).

cnf(c_0_4908,plain,
    ( X1 = X2
    | s__instance(X3,s__SetOrClass) ),
    inference(spm,[status(thm)],[c_0_4906,c_0_4906]) ).

cnf(c_0_4909,negated_conjecture,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__instance(X2,X3) ),
    inference(spm,[status(thm)],[c_0_4907,c_0_4908]) ).

cnf(c_0_4910,plain,
    s__instance(s__governmentType__m,s__BinaryPredicate),
    i_0_136 ).

cnf(c_0_4911,plain,
    ( X1 = s__UnionFn(X2,X3)
    | s__instance(esk516_3(X3,X1,X2),X2) ),
    i_0_3479 ).

cnf(c_0_4912,plain,
    ( ~ s__instance(X1,X2)
    | ~ s__instance(X1,X3)
    | ~ s__disjoint(X3,X2)
    | ~ s__instance(X2,s__SetOrClass)
    | ~ s__instance(X3,s__SetOrClass) ),
    i_0_2455 ).

cnf(c_0_4913,plain,
    s__instance(X1,s__SetOrClass),
    inference(spm,[status(thm)],[c_0_4909,c_0_4910]) ).

cnf(c_0_4914,negated_conjecture,
    X1 = s__UnionFn(s__Class31_1,X2),
    inference(spm,[status(thm)],[c_0_4907,c_0_4911]) ).

cnf(c_0_4915,plain,
    ( ~ s__disjoint(X1,X2)
    | ~ s__instance(X3,X1)
    | ~ s__instance(X3,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4912,c_0_4913]),c_0_4913])]) ).

cnf(c_0_4916,plain,
    s__disjoint(s__Organization,s__Human),
    i_0_304 ).

cnf(c_0_4917,plain,
    s__instance(s__Class31_1,s__Class),
    i_0_4889 ).

cnf(c_0_4918,negated_conjecture,
    X1 = X2,
    inference(spm,[status(thm)],[c_0_4914,c_0_4914]) ).

cnf(c_0_4919,plain,
    ( ~ s__instance(X1,s__Organization)
    | ~ s__instance(X1,s__Human) ),
    inference(spm,[status(thm)],[c_0_4915,c_0_4916]) ).

cnf(c_0_4920,plain,
    s__instance(s__Class31_1,X1),
    inference(spm,[status(thm)],[c_0_4917,c_0_4918]) ).

cnf(c_0_4921,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4919,c_0_4920]),c_0_4920])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : CSR100+7 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n015.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat Jun 11 17:25:37 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 1.28/1.48  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.28/1.48  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 1.28/1.48  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 1.28/1.48  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 11.56/5.33  # ENIGMATIC: Solved by autoschedule-lgb:
% 11.56/5.33  # No SInE strategy applied
% 11.56/5.33  # Trying AutoSched0 for 149 seconds
% 11.56/5.33  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 11.56/5.33  # and selection function SelectComplexExceptUniqMaxHorn.
% 11.56/5.33  #
% 11.56/5.33  # Preprocessing time       : 0.024 s
% 11.56/5.33  # Presaturation interreduction done
% 11.56/5.33  
% 11.56/5.33  # Proof found!
% 11.56/5.33  # SZS status Theorem
% 11.56/5.33  # SZS output start CNFRefutation
% See solution above
% 11.56/5.33  # Training examples: 0 positive, 0 negative
% 11.56/5.33  
% 11.56/5.33  # -------------------------------------------------
% 11.56/5.33  # User time                : 0.228 s
% 11.56/5.33  # System time              : 0.020 s
% 11.56/5.33  # Total time               : 0.248 s
% 11.56/5.33  # Maximum resident set size: 7128 pages
% 11.56/5.33  
%------------------------------------------------------------------------------