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

View Problem - Process Solution

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

% Computer : n026.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 8.98s 3.03s
% Output   : CNFRefutation 8.98s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   18 (  12 unt;   0 nHn;  18 RR)
%            Number of literals    :   47 (   0 equ;  36 neg)
%            Maximal clause size   :    9 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   34 (  20 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_677,negated_conjecture,
    ( ~ agt(X1,X2)
    | ~ attr(X3,X4)
    | ~ attr(X5,X6)
    | ~ attr(X2,X7)
    | ~ sub(X7,name_1_1)
    | ~ sub(X6,name_1_1)
    | ~ sub(X5,firma_1_1)
    | ~ val(X7,bmw_0)
    | ~ val(X6,bmw_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xyv2lru9/lgb.p',i_0_677) ).

cnf(i_0_187,hypothesis,
    val(c429,bmw_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xyv2lru9/lgb.p',i_0_187) ).

cnf(i_0_188,hypothesis,
    sub(c429,name_1_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xyv2lru9/lgb.p',i_0_188) ).

cnf(i_0_189,hypothesis,
    sub(c428,firma_1_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xyv2lru9/lgb.p',i_0_189) ).

cnf(i_0_190,hypothesis,
    attr(c428,c429),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xyv2lru9/lgb.p',i_0_190) ).

cnf(i_0_178,hypothesis,
    agt(c6,c428),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xyv2lru9/lgb.p',i_0_178) ).

cnf(c_0_684,negated_conjecture,
    ( ~ agt(X1,X2)
    | ~ attr(X3,X4)
    | ~ attr(X5,X6)
    | ~ attr(X2,X7)
    | ~ sub(X7,name_1_1)
    | ~ sub(X6,name_1_1)
    | ~ sub(X5,firma_1_1)
    | ~ val(X7,bmw_0)
    | ~ val(X6,bmw_0) ),
    i_0_677 ).

cnf(c_0_685,hypothesis,
    val(c429,bmw_0),
    i_0_187 ).

cnf(c_0_686,hypothesis,
    sub(c429,name_1_1),
    i_0_188 ).

cnf(c_0_687,hypothesis,
    ( ~ val(X1,bmw_0)
    | ~ sub(X1,name_1_1)
    | ~ sub(X2,firma_1_1)
    | ~ attr(X3,c429)
    | ~ attr(X2,X1)
    | ~ attr(X4,X5)
    | ~ agt(X6,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_684,c_0_685]),c_0_686])]) ).

cnf(c_0_688,hypothesis,
    ( ~ sub(X1,firma_1_1)
    | ~ attr(X2,c429)
    | ~ attr(X1,c429)
    | ~ attr(X3,X4)
    | ~ agt(X5,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_687,c_0_685]),c_0_686])]) ).

cnf(c_0_689,hypothesis,
    sub(c428,firma_1_1),
    i_0_189 ).

cnf(c_0_690,hypothesis,
    attr(c428,c429),
    i_0_190 ).

cnf(c_0_691,hypothesis,
    ( ~ attr(X1,c429)
    | ~ attr(X2,X3)
    | ~ agt(X4,X1) ),
    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,
    ( ~ attr(X1,X2)
    | ~ agt(X3,c428) ),
    inference(spm,[status(thm)],[c_0_691,c_0_690]) ).

cnf(c_0_693,hypothesis,
    agt(c6,c428),
    i_0_178 ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : CSR115+36 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.10  % Command  : enigmatic-eprover.py %s %d 1
% 0.10/0.30  % Computer : n026.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 600
% 0.10/0.30  % DateTime : Sat Jun 11 11:08:20 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.14/0.39  # ENIGMATIC: Selected SinE mode:
% 0.14/0.53  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.53  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.14/0.53  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.14/0.53  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.98/3.03  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.98/3.03  # No SInE strategy applied
% 8.98/3.03  # Trying AutoSched0 for 150 seconds
% 8.98/3.03  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.98/3.03  # and selection function SelectComplexExceptUniqMaxHorn.
% 8.98/3.03  #
% 8.98/3.03  # Preprocessing time       : 0.023 s
% 8.98/3.03  # Presaturation interreduction done
% 8.98/3.03  
% 8.98/3.03  # Proof found!
% 8.98/3.03  # SZS status Theorem
% 8.98/3.03  # SZS output start CNFRefutation
% See solution above
% 8.98/3.03  # Training examples: 0 positive, 0 negative
% 8.98/3.03  
% 8.98/3.03  # -------------------------------------------------
% 8.98/3.03  # User time                : 0.040 s
% 8.98/3.03  # System time              : 0.008 s
% 8.98/3.03  # Total time               : 0.048 s
% 8.98/3.03  # Maximum resident set size: 7124 pages
% 8.98/3.03  
%------------------------------------------------------------------------------