TSTP Solution File: CSR115+20 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR115+20 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n019.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:13 EDT 2022

% Result   : Theorem 7.26s 2.73s
% Output   : CNFRefutation 7.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   33 (  15 unt;   0 nHn;  33 RR)
%            Number of literals    :   87 (   0 equ;  66 neg)
%            Maximal clause size   :   10 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-3 aty)
%            Number of variables   :   61 (  24 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_912,negated_conjecture,
    ( ~ obj(X1,X2)
    | ~ attr(X3,X4)
    | ~ attr(X5,X6)
    | ~ attr(X2,X7)
    | ~ sub(X4,jahr__1_1)
    | ~ sub(X6,name_1_1)
    | ~ sub(X7,name_1_1)
    | ~ sub(X2,firma_1_1)
    | ~ val(X6,bmw_0)
    | ~ val(X7,bmw_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qod0txvp/lgb.p',i_0_912) ).

cnf(i_0_423,hypothesis,
    val(c1159,bmw_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qod0txvp/lgb.p',i_0_423) ).

cnf(i_0_424,hypothesis,
    sub(c1159,name_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qod0txvp/lgb.p',i_0_424) ).

cnf(i_0_410,hypothesis,
    sub(c1175,jahr__1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qod0txvp/lgb.p',i_0_410) ).

cnf(i_0_425,hypothesis,
    sub(c1158,firma_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qod0txvp/lgb.p',i_0_425) ).

cnf(i_0_426,hypothesis,
    attr(c1158,c1159),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qod0txvp/lgb.p',i_0_426) ).

cnf(i_0_411,hypothesis,
    attr(c1174,c1175),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qod0txvp/lgb.p',i_0_411) ).

cnf(i_0_891,plain,
    ( obj(esk54_3(X1,X2,X3),X2)
    | ~ arg1(X1,X2)
    | ~ arg2(X1,X3)
    | ~ subr(X1,sub_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qod0txvp/lgb.p',i_0_891) ).

cnf(i_0_908,plain,
    ( subr(esk59_2(X1,X2),sub_0)
    | ~ sub(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qod0txvp/lgb.p',i_0_908) ).

cnf(i_0_909,plain,
    ( arg2(esk59_2(X1,X2),X2)
    | ~ sub(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qod0txvp/lgb.p',i_0_909) ).

cnf(i_0_910,plain,
    ( arg1(esk59_2(X1,X2),X1)
    | ~ sub(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qod0txvp/lgb.p',i_0_910) ).

cnf(c_0_924,negated_conjecture,
    ( ~ obj(X1,X2)
    | ~ attr(X3,X4)
    | ~ attr(X5,X6)
    | ~ attr(X2,X7)
    | ~ sub(X4,jahr__1_1)
    | ~ sub(X6,name_1_1)
    | ~ sub(X7,name_1_1)
    | ~ sub(X2,firma_1_1)
    | ~ val(X6,bmw_0)
    | ~ val(X7,bmw_0) ),
    i_0_912 ).

cnf(c_0_925,hypothesis,
    val(c1159,bmw_0),
    i_0_423 ).

cnf(c_0_926,hypothesis,
    sub(c1159,name_1_1),
    i_0_424 ).

cnf(c_0_927,hypothesis,
    ( ~ val(X1,bmw_0)
    | ~ sub(X1,name_1_1)
    | ~ sub(X2,jahr__1_1)
    | ~ sub(X3,firma_1_1)
    | ~ attr(X3,c1159)
    | ~ attr(X4,X1)
    | ~ attr(X5,X2)
    | ~ obj(X6,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_924,c_0_925]),c_0_926])]) ).

cnf(c_0_928,hypothesis,
    ( ~ sub(X1,jahr__1_1)
    | ~ sub(X2,firma_1_1)
    | ~ attr(X2,c1159)
    | ~ attr(X3,c1159)
    | ~ attr(X4,X1)
    | ~ obj(X5,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_927,c_0_925]),c_0_926])]) ).

cnf(c_0_929,hypothesis,
    sub(c1175,jahr__1_1),
    i_0_410 ).

cnf(c_0_930,hypothesis,
    ( ~ sub(X1,firma_1_1)
    | ~ attr(X1,c1159)
    | ~ attr(X2,c1159)
    | ~ attr(X3,c1175)
    | ~ obj(X4,X1) ),
    inference(spm,[status(thm)],[c_0_928,c_0_929]) ).

cnf(c_0_931,hypothesis,
    sub(c1158,firma_1_1),
    i_0_425 ).

cnf(c_0_932,hypothesis,
    attr(c1158,c1159),
    i_0_426 ).

cnf(c_0_933,hypothesis,
    ( ~ attr(X1,c1159)
    | ~ attr(X2,c1175)
    | ~ obj(X3,c1158) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_930,c_0_931]),c_0_932])]) ).

cnf(c_0_934,hypothesis,
    ( ~ attr(X1,c1175)
    | ~ obj(X2,c1158) ),
    inference(spm,[status(thm)],[c_0_933,c_0_932]) ).

cnf(c_0_935,hypothesis,
    attr(c1174,c1175),
    i_0_411 ).

cnf(c_0_936,hypothesis,
    ~ obj(X1,c1158),
    inference(spm,[status(thm)],[c_0_934,c_0_935]) ).

cnf(c_0_937,plain,
    ( obj(esk54_3(X1,X2,X3),X2)
    | ~ arg1(X1,X2)
    | ~ arg2(X1,X3)
    | ~ subr(X1,sub_0) ),
    i_0_891 ).

cnf(c_0_938,plain,
    ( ~ subr(X1,sub_0)
    | ~ arg2(X1,X2)
    | ~ arg1(X1,c1158) ),
    inference(spm,[status(thm)],[c_0_936,c_0_937]) ).

cnf(c_0_939,plain,
    ( subr(esk59_2(X1,X2),sub_0)
    | ~ sub(X1,X2) ),
    i_0_908 ).

cnf(c_0_940,plain,
    ( ~ arg2(esk59_2(X1,X2),X3)
    | ~ arg1(esk59_2(X1,X2),c1158)
    | ~ sub(X1,X2) ),
    inference(spm,[status(thm)],[c_0_938,c_0_939]) ).

cnf(c_0_941,plain,
    ( arg2(esk59_2(X1,X2),X2)
    | ~ sub(X1,X2) ),
    i_0_909 ).

cnf(c_0_942,plain,
    ( ~ arg1(esk59_2(X1,X2),c1158)
    | ~ sub(X1,X2) ),
    inference(spm,[status(thm)],[c_0_940,c_0_941]) ).

cnf(c_0_943,plain,
    ( arg1(esk59_2(X1,X2),X1)
    | ~ sub(X1,X2) ),
    i_0_910 ).

cnf(c_0_944,plain,
    ~ sub(c1158,X1),
    inference(spm,[status(thm)],[c_0_942,c_0_943]) ).

cnf(c_0_945,hypothesis,
    $false,
    inference(sr,[status(thm)],[c_0_931,c_0_944]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : CSR115+20 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n019.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 15:56:41 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected SinE mode:
% 0.43/0.60  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.43/0.60  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.43/0.60  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.43/0.60  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.26/2.73  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.26/2.73  # No SInE strategy applied
% 7.26/2.73  # Trying AutoSched0 for 150 seconds
% 7.26/2.73  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.26/2.73  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.26/2.73  #
% 7.26/2.73  # Preprocessing time       : 0.017 s
% 7.26/2.73  # Presaturation interreduction done
% 7.26/2.73  
% 7.26/2.73  # Proof found!
% 7.26/2.73  # SZS status Theorem
% 7.26/2.73  # SZS output start CNFRefutation
% See solution above
% 7.26/2.73  # Training examples: 0 positive, 0 negative
% 7.26/2.73  
% 7.26/2.73  # -------------------------------------------------
% 7.26/2.73  # User time                : 0.034 s
% 7.26/2.73  # System time              : 0.008 s
% 7.26/2.73  # Total time               : 0.041 s
% 7.26/2.73  # Maximum resident set size: 7124 pages
% 7.26/2.73  
%------------------------------------------------------------------------------