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

View Problem - Process Solution

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

% Computer : n018.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:16 EDT 2022

% Result   : Theorem 4.93s 2.72s
% Output   : CNFRefutation 4.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   34 (  12 unt;   0 nHn;  34 RR)
%            Number of literals    :   93 (   0 equ;  71 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    :    9 (   9 usr;   7 con; 0-3 aty)
%            Number of variables   :   80 (  41 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_646,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/sandbox2/tmp/enigma-theBenchmark.p-f4m9vocg/lgb.p',i_0_646) ).

cnf(i_0_153,hypothesis,
    val(c187,bmw_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f4m9vocg/lgb.p',i_0_153) ).

cnf(i_0_154,hypothesis,
    sub(c187,name_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f4m9vocg/lgb.p',i_0_154) ).

cnf(i_0_645,plain,
    ( sub(X1,X2)
    | ~ sub(X3,X2)
    | ~ sub(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f4m9vocg/lgb.p',i_0_645) ).

cnf(i_0_147,hypothesis,
    sub(verpackungsfirma_1_1,firma_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f4m9vocg/lgb.p',i_0_147) ).

cnf(i_0_155,hypothesis,
    sub(c186,verpackungsfirma_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f4m9vocg/lgb.p',i_0_155) ).

cnf(i_0_156,hypothesis,
    attr(c186,c187),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f4m9vocg/lgb.p',i_0_156) ).

cnf(i_0_625,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-f4m9vocg/lgb.p',i_0_625) ).

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

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

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

cnf(c_0_658,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_646 ).

cnf(c_0_659,hypothesis,
    val(c187,bmw_0),
    i_0_153 ).

cnf(c_0_660,hypothesis,
    sub(c187,name_1_1),
    i_0_154 ).

cnf(c_0_661,hypothesis,
    ( ~ val(X1,bmw_0)
    | ~ sub(X1,name_1_1)
    | ~ sub(X2,firma_1_1)
    | ~ attr(X2,c187)
    | ~ attr(X3,X1)
    | ~ attr(X4,X5)
    | ~ obj(X6,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_658,c_0_659]),c_0_660])]) ).

cnf(c_0_662,plain,
    ( sub(X1,X2)
    | ~ sub(X3,X2)
    | ~ sub(X1,X3) ),
    i_0_645 ).

cnf(c_0_663,hypothesis,
    sub(verpackungsfirma_1_1,firma_1_1),
    i_0_147 ).

cnf(c_0_664,hypothesis,
    ( ~ sub(X1,firma_1_1)
    | ~ attr(X1,c187)
    | ~ attr(X2,c187)
    | ~ attr(X3,X4)
    | ~ obj(X5,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_661,c_0_659]),c_0_660])]) ).

cnf(c_0_665,hypothesis,
    ( sub(X1,firma_1_1)
    | ~ sub(X1,verpackungsfirma_1_1) ),
    inference(spm,[status(thm)],[c_0_662,c_0_663]) ).

cnf(c_0_666,hypothesis,
    ( ~ sub(X1,verpackungsfirma_1_1)
    | ~ attr(X1,c187)
    | ~ attr(X2,c187)
    | ~ attr(X3,X4)
    | ~ obj(X5,X1) ),
    inference(spm,[status(thm)],[c_0_664,c_0_665]) ).

cnf(c_0_667,hypothesis,
    sub(c186,verpackungsfirma_1_1),
    i_0_155 ).

cnf(c_0_668,hypothesis,
    attr(c186,c187),
    i_0_156 ).

cnf(c_0_669,hypothesis,
    ( ~ attr(X1,c187)
    | ~ attr(X2,X3)
    | ~ obj(X4,c186) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_666,c_0_667]),c_0_668])]) ).

cnf(c_0_670,hypothesis,
    ( ~ attr(X1,X2)
    | ~ obj(X3,c186) ),
    inference(spm,[status(thm)],[c_0_669,c_0_668]) ).

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

cnf(c_0_672,plain,
    ( ~ subr(X1,sub_0)
    | ~ arg2(X1,X2)
    | ~ arg1(X1,c186)
    | ~ attr(X3,X4) ),
    inference(spm,[status(thm)],[c_0_670,c_0_671]) ).

cnf(c_0_673,plain,
    ( subr(esk59_2(X1,X2),sub_0)
    | ~ sub(X1,X2) ),
    i_0_642 ).

cnf(c_0_674,plain,
    ( ~ arg2(esk59_2(X1,X2),X3)
    | ~ arg1(esk59_2(X1,X2),c186)
    | ~ sub(X1,X2)
    | ~ attr(X4,X5) ),
    inference(spm,[status(thm)],[c_0_672,c_0_673]) ).

cnf(c_0_675,plain,
    ( arg1(esk59_2(X1,X2),X1)
    | ~ sub(X1,X2) ),
    i_0_644 ).

cnf(c_0_676,plain,
    ( ~ arg2(esk59_2(c186,X1),X2)
    | ~ sub(c186,X1)
    | ~ attr(X3,X4) ),
    inference(spm,[status(thm)],[c_0_674,c_0_675]) ).

cnf(c_0_677,plain,
    ( arg2(esk59_2(X1,X2),X2)
    | ~ sub(X1,X2) ),
    i_0_643 ).

cnf(c_0_678,plain,
    ( ~ sub(c186,X1)
    | ~ attr(X2,X3) ),
    inference(spm,[status(thm)],[c_0_676,c_0_677]) ).

cnf(c_0_679,hypothesis,
    ~ attr(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_678,c_0_665]),c_0_667])]) ).

cnf(c_0_680,hypothesis,
    $false,
    inference(sr,[status(thm)],[c_0_668,c_0_679]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : CSR115+32 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n018.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 : Fri Jun 10 21:56:56 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.21/0.47  # ENIGMATIC: Selected SinE mode:
% 0.47/0.65  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.65  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.47/0.65  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.47/0.65  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 4.93/2.72  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.93/2.72  # No SInE strategy applied
% 4.93/2.72  # Trying AutoSched0 for 150 seconds
% 4.93/2.72  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.93/2.72  # and selection function SelectComplexExceptUniqMaxHorn.
% 4.93/2.72  #
% 4.93/2.72  # Preprocessing time       : 0.031 s
% 4.93/2.72  # Presaturation interreduction done
% 4.93/2.72  
% 4.93/2.72  # Proof found!
% 4.93/2.72  # SZS status Theorem
% 4.93/2.72  # SZS output start CNFRefutation
% See solution above
% 4.93/2.72  # Training examples: 0 positive, 0 negative
% 4.93/2.72  
% 4.93/2.72  # -------------------------------------------------
% 4.93/2.72  # User time                : 0.050 s
% 4.93/2.72  # System time              : 0.009 s
% 4.93/2.72  # Total time               : 0.059 s
% 4.93/2.72  # Maximum resident set size: 7124 pages
% 4.93/2.72  
%------------------------------------------------------------------------------