↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n009.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:49:05 EDT 2022

% Result   : Theorem 9.18s 3.01s
% Output   : CNFRefutation 9.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   25 (  14 unt;   0 nHn;  21 RR)
%            Number of literals    :   47 (   0 equ;  30 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-3 aty)
%            Number of variables   :   40 (  19 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_754,negated_conjecture,
    ( ~ scar(X1,X2)
    | ~ attr(X3,X4)
    | ~ sub(X4,name_1_1)
    | ~ val(X4,usa_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-urqtgpyi/lgb.p',i_0_754) ).

cnf(i_0_259,hypothesis,
    val(c61244,usa_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-urqtgpyi/lgb.p',i_0_259) ).

cnf(i_0_260,hypothesis,
    sub(c61244,name_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-urqtgpyi/lgb.p',i_0_260) ).

cnf(i_0_262,hypothesis,
    attr(c61243,c61244),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-urqtgpyi/lgb.p',i_0_262) ).

cnf(i_0_33,plain,
    ( scar(esk6_3(X1,X2,X3),X3)
    | ~ sub(X1,X2)
    | ~ attr(X3,X1)
    | ~ member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-urqtgpyi/lgb.p',i_0_33) ).

cnf(i_0_625,plain,
    ( member(X1,cons(X2,X3))
    | ~ member(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-urqtgpyi/lgb.p',i_0_625) ).

cnf(i_0_624,plain,
    member(X1,cons(X1,X2)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-urqtgpyi/lgb.p',i_0_624) ).

cnf(i_0_258,hypothesis,
    attr(c61248,c61249),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-urqtgpyi/lgb.p',i_0_258) ).

cnf(i_0_256,hypothesis,
    sub(c61249,name_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-urqtgpyi/lgb.p',i_0_256) ).

cnf(c_0_764,negated_conjecture,
    ( ~ scar(X1,X2)
    | ~ attr(X3,X4)
    | ~ sub(X4,name_1_1)
    | ~ val(X4,usa_0) ),
    i_0_754 ).

cnf(c_0_765,hypothesis,
    val(c61244,usa_0),
    i_0_259 ).

cnf(c_0_766,hypothesis,
    sub(c61244,name_1_1),
    i_0_260 ).

cnf(c_0_767,hypothesis,
    ( ~ attr(X1,c61244)
    | ~ scar(X2,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_764,c_0_765]),c_0_766])]) ).

cnf(c_0_768,hypothesis,
    attr(c61243,c61244),
    i_0_262 ).

cnf(c_0_769,plain,
    ( scar(esk6_3(X1,X2,X3),X3)
    | ~ sub(X1,X2)
    | ~ attr(X3,X1)
    | ~ member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) ),
    i_0_33 ).

cnf(c_0_770,hypothesis,
    ~ scar(X1,X2),
    inference(spm,[status(thm)],[c_0_767,c_0_768]) ).

cnf(c_0_771,plain,
    ( ~ member(X1,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
    | ~ sub(X2,X1)
    | ~ attr(X3,X2) ),
    inference(sr,[status(thm)],[c_0_769,c_0_770]) ).

cnf(c_0_772,plain,
    ( member(X1,cons(X2,X3))
    | ~ member(X1,X3) ),
    i_0_625 ).

cnf(c_0_773,plain,
    ( ~ member(X1,cons(familiename_1_1,cons(name_1_1,nil)))
    | ~ sub(X2,X1)
    | ~ attr(X3,X2) ),
    inference(spm,[status(thm)],[c_0_771,c_0_772]) ).

cnf(c_0_774,plain,
    ( ~ member(X1,cons(name_1_1,nil))
    | ~ sub(X2,X1)
    | ~ attr(X3,X2) ),
    inference(spm,[status(thm)],[c_0_773,c_0_772]) ).

cnf(c_0_775,plain,
    member(X1,cons(X1,X2)),
    i_0_624 ).

cnf(c_0_776,plain,
    ( ~ sub(X1,name_1_1)
    | ~ attr(X2,X1) ),
    inference(spm,[status(thm)],[c_0_774,c_0_775]) ).

cnf(c_0_777,hypothesis,
    attr(c61248,c61249),
    i_0_258 ).

cnf(c_0_778,hypothesis,
    sub(c61249,name_1_1),
    i_0_256 ).

cnf(c_0_779,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_776,c_0_777]),c_0_778])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CSR113+5 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n009.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 : Sat Jun 11 08:57:39 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected SinE mode:
% 0.38/0.61  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.38/0.61  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.38/0.61  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.38/0.61  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 9.18/3.01  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.18/3.01  # No SInE strategy applied
% 9.18/3.01  # Trying AutoSched0 for 150 seconds
% 9.18/3.01  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 9.18/3.01  # and selection function SelectComplexExceptUniqMaxHorn.
% 9.18/3.01  #
% 9.18/3.01  # Preprocessing time       : 0.027 s
% 9.18/3.01  # Presaturation interreduction done
% 9.18/3.01  
% 9.18/3.01  # Proof found!
% 9.18/3.01  # SZS status Theorem
% 9.18/3.01  # SZS output start CNFRefutation
% See solution above
% 9.18/3.01  # Training examples: 0 positive, 0 negative
% 9.18/3.01  
% 9.18/3.01  # -------------------------------------------------
% 9.18/3.01  # User time                : 0.043 s
% 9.18/3.01  # System time              : 0.009 s
% 9.18/3.01  # Total time               : 0.052 s
% 9.18/3.01  # Maximum resident set size: 7120 pages
% 9.18/3.01  
%------------------------------------------------------------------------------