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

View Problem - Process Solution

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

% Computer : n023.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:22 EDT 2022

% Result   : Theorem 9.32s 2.93s
% Output   : CNFRefutation 9.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   28 (  10 unt;   0 nHn;  28 RR)
%            Number of literals    :   78 (   0 equ;  61 neg)
%            Maximal clause size   :    9 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-3 aty)
%            Number of variables   :   68 (  37 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_678,negated_conjecture,
    ( ~ obj(X1,X2)
    | ~ attr(X3,X4)
    | ~ attr(X5,X6)
    | ~ attr(X2,X7)
    | ~ 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/sandbox/tmp/enigma-theBenchmark.p-71xz12y5/lgb.p',i_0_678) ).

cnf(i_0_189,hypothesis,
    val(c148,bmw_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-71xz12y5/lgb.p',i_0_189) ).

cnf(i_0_190,hypothesis,
    sub(c148,name_1_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-71xz12y5/lgb.p',i_0_190) ).

cnf(i_0_191,hypothesis,
    sub(c147,firma_1_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-71xz12y5/lgb.p',i_0_191) ).

cnf(i_0_192,hypothesis,
    attr(c147,c148),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-71xz12y5/lgb.p',i_0_192) ).

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

cnf(i_0_674,plain,
    ( subr(esk59_2(X1,X2),sub_0)
    | ~ sub(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-71xz12y5/lgb.p',i_0_674) ).

cnf(i_0_676,plain,
    ( arg1(esk59_2(X1,X2),X1)
    | ~ sub(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-71xz12y5/lgb.p',i_0_676) ).

cnf(i_0_675,plain,
    ( arg2(esk59_2(X1,X2),X2)
    | ~ sub(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-71xz12y5/lgb.p',i_0_675) ).

cnf(c_0_688,negated_conjecture,
    ( ~ obj(X1,X2)
    | ~ attr(X3,X4)
    | ~ attr(X5,X6)
    | ~ attr(X2,X7)
    | ~ 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_678 ).

cnf(c_0_689,hypothesis,
    val(c148,bmw_0),
    i_0_189 ).

cnf(c_0_690,hypothesis,
    sub(c148,name_1_1),
    i_0_190 ).

cnf(c_0_691,hypothesis,
    ( ~ val(X1,bmw_0)
    | ~ sub(X1,name_1_1)
    | ~ sub(X2,firma_1_1)
    | ~ attr(X2,c148)
    | ~ attr(X3,X1)
    | ~ attr(X4,X5)
    | ~ obj(X6,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_688,c_0_689]),c_0_690])]) ).

cnf(c_0_692,hypothesis,
    ( ~ sub(X1,firma_1_1)
    | ~ attr(X1,c148)
    | ~ attr(X2,c148)
    | ~ attr(X3,X4)
    | ~ obj(X5,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_691,c_0_689]),c_0_690])]) ).

cnf(c_0_693,hypothesis,
    sub(c147,firma_1_1),
    i_0_191 ).

cnf(c_0_694,hypothesis,
    attr(c147,c148),
    i_0_192 ).

cnf(c_0_695,hypothesis,
    ( ~ attr(X1,c148)
    | ~ attr(X2,X3)
    | ~ obj(X4,c147) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_692,c_0_693]),c_0_694])]) ).

cnf(c_0_696,hypothesis,
    ( ~ attr(X1,X2)
    | ~ obj(X3,c147) ),
    inference(spm,[status(thm)],[c_0_695,c_0_694]) ).

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

cnf(c_0_698,plain,
    ( ~ subr(X1,sub_0)
    | ~ arg2(X1,X2)
    | ~ arg1(X1,c147)
    | ~ attr(X3,X4) ),
    inference(spm,[status(thm)],[c_0_696,c_0_697]) ).

cnf(c_0_699,plain,
    ( subr(esk59_2(X1,X2),sub_0)
    | ~ sub(X1,X2) ),
    i_0_674 ).

cnf(c_0_700,plain,
    ( ~ arg2(esk59_2(X1,X2),X3)
    | ~ arg1(esk59_2(X1,X2),c147)
    | ~ sub(X1,X2)
    | ~ attr(X4,X5) ),
    inference(spm,[status(thm)],[c_0_698,c_0_699]) ).

cnf(c_0_701,plain,
    ( arg1(esk59_2(X1,X2),X1)
    | ~ sub(X1,X2) ),
    i_0_676 ).

cnf(c_0_702,plain,
    ( ~ arg2(esk59_2(c147,X1),X2)
    | ~ sub(c147,X1)
    | ~ attr(X3,X4) ),
    inference(spm,[status(thm)],[c_0_700,c_0_701]) ).

cnf(c_0_703,plain,
    ( arg2(esk59_2(X1,X2),X2)
    | ~ sub(X1,X2) ),
    i_0_675 ).

cnf(c_0_704,plain,
    ( ~ sub(c147,X1)
    | ~ attr(X2,X3) ),
    inference(spm,[status(thm)],[c_0_702,c_0_703]) ).

cnf(c_0_705,hypothesis,
    ~ attr(X1,X2),
    inference(spm,[status(thm)],[c_0_704,c_0_693]) ).

cnf(c_0_706,hypothesis,
    $false,
    inference(sr,[status(thm)],[c_0_694,c_0_705]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : CSR115+68 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n023.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sat Jun 11 07:57:08 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected SinE mode:
% 0.43/0.63  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.63  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.43/0.63  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.43/0.63  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 9.32/2.93  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.32/2.93  # No SInE strategy applied
% 9.32/2.93  # Trying AutoSched0 for 150 seconds
% 9.32/2.93  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 9.32/2.93  # and selection function SelectComplexExceptUniqMaxHorn.
% 9.32/2.93  #
% 9.32/2.93  # Preprocessing time       : 0.029 s
% 9.32/2.93  # Presaturation interreduction done
% 9.32/2.93  
% 9.32/2.93  # Proof found!
% 9.32/2.93  # SZS status Theorem
% 9.32/2.93  # SZS output start CNFRefutation
% See solution above
% 9.32/2.93  # Training examples: 0 positive, 0 negative
% 9.32/2.93  
% 9.32/2.93  # -------------------------------------------------
% 9.32/2.93  # User time                : 0.047 s
% 9.32/2.93  # System time              : 0.010 s
% 9.32/2.93  # Total time               : 0.057 s
% 9.32/2.93  # Maximum resident set size: 7128 pages
% 9.32/2.93  
%------------------------------------------------------------------------------