↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n032.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:08 EDT 2022

% Result   : Theorem 4.29s 2.28s
% Output   : CNFRefutation 4.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   29 (  15 unt;   0 nHn;  29 RR)
%            Number of literals    :   71 (   0 equ;  50 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    :   10 (  10 usr;   9 con; 0-2 aty)
%            Number of variables   :   37 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_906,negated_conjecture,
    ( ~ in(X1,X2)
    | ~ loc(X3,X1)
    | ~ scar(X3,X4)
    | ~ attr(X2,X5)
    | ~ subs(X3,stehen_1_1)
    | ~ sub(X4,kolosseum_1_1)
    | ~ sub(X5,name_1_1)
    | ~ sub(X2,stadt__1_1)
    | ~ val(X5,rom_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v6k5wshv/lgb.p',i_0_906) ).

cnf(i_0_391,hypothesis,
    val(c203,rom_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v6k5wshv/lgb.p',i_0_391) ).

cnf(i_0_392,hypothesis,
    sub(c203,name_1_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v6k5wshv/lgb.p',i_0_392) ).

cnf(i_0_395,hypothesis,
    sub(c196,kolosseum_1_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v6k5wshv/lgb.p',i_0_395) ).

cnf(i_0_393,hypothesis,
    sub(c202,stadt__1_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v6k5wshv/lgb.p',i_0_393) ).

cnf(i_0_394,hypothesis,
    attr(c202,c203),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v6k5wshv/lgb.p',i_0_394) ).

cnf(i_0_773,plain,
    ( subs(esk27_2(X1,X2),stehen_1_1)
    | ~ loc(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v6k5wshv/lgb.p',i_0_773) ).

cnf(i_0_774,plain,
    ( scar(esk27_2(X1,X2),X1)
    | ~ loc(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v6k5wshv/lgb.p',i_0_774) ).

cnf(i_0_775,plain,
    ( loc(esk27_2(X1,X2),X2)
    | ~ loc(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v6k5wshv/lgb.p',i_0_775) ).

cnf(i_0_390,hypothesis,
    in(c205,c202),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v6k5wshv/lgb.p',i_0_390) ).

cnf(i_0_396,hypothesis,
    loc(c196,c205),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v6k5wshv/lgb.p',i_0_396) ).

cnf(c_0_918,negated_conjecture,
    ( ~ in(X1,X2)
    | ~ loc(X3,X1)
    | ~ scar(X3,X4)
    | ~ attr(X2,X5)
    | ~ subs(X3,stehen_1_1)
    | ~ sub(X4,kolosseum_1_1)
    | ~ sub(X5,name_1_1)
    | ~ sub(X2,stadt__1_1)
    | ~ val(X5,rom_0) ),
    i_0_906 ).

cnf(c_0_919,hypothesis,
    val(c203,rom_0),
    i_0_391 ).

cnf(c_0_920,hypothesis,
    sub(c203,name_1_1),
    i_0_392 ).

cnf(c_0_921,hypothesis,
    ( ~ sub(X1,kolosseum_1_1)
    | ~ sub(X2,stadt__1_1)
    | ~ subs(X3,stehen_1_1)
    | ~ attr(X2,c203)
    | ~ scar(X3,X1)
    | ~ loc(X3,X4)
    | ~ in(X4,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_918,c_0_919]),c_0_920])]) ).

cnf(c_0_922,hypothesis,
    sub(c196,kolosseum_1_1),
    i_0_395 ).

cnf(c_0_923,hypothesis,
    ( ~ sub(X1,stadt__1_1)
    | ~ subs(X2,stehen_1_1)
    | ~ attr(X1,c203)
    | ~ scar(X2,c196)
    | ~ loc(X2,X3)
    | ~ in(X3,X1) ),
    inference(spm,[status(thm)],[c_0_921,c_0_922]) ).

cnf(c_0_924,hypothesis,
    sub(c202,stadt__1_1),
    i_0_393 ).

cnf(c_0_925,hypothesis,
    attr(c202,c203),
    i_0_394 ).

cnf(c_0_926,hypothesis,
    ( ~ subs(X1,stehen_1_1)
    | ~ scar(X1,c196)
    | ~ loc(X1,X2)
    | ~ in(X2,c202) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_923,c_0_924]),c_0_925])]) ).

cnf(c_0_927,plain,
    ( subs(esk27_2(X1,X2),stehen_1_1)
    | ~ loc(X1,X2) ),
    i_0_773 ).

cnf(c_0_928,plain,
    ( ~ scar(esk27_2(X1,X2),c196)
    | ~ loc(esk27_2(X1,X2),X3)
    | ~ loc(X1,X2)
    | ~ in(X3,c202) ),
    inference(spm,[status(thm)],[c_0_926,c_0_927]) ).

cnf(c_0_929,plain,
    ( scar(esk27_2(X1,X2),X1)
    | ~ loc(X1,X2) ),
    i_0_774 ).

cnf(c_0_930,plain,
    ( ~ loc(esk27_2(c196,X1),X2)
    | ~ loc(c196,X1)
    | ~ in(X2,c202) ),
    inference(spm,[status(thm)],[c_0_928,c_0_929]) ).

cnf(c_0_931,plain,
    ( loc(esk27_2(X1,X2),X2)
    | ~ loc(X1,X2) ),
    i_0_775 ).

cnf(c_0_932,plain,
    ( ~ loc(c196,X1)
    | ~ in(X1,c202) ),
    inference(spm,[status(thm)],[c_0_930,c_0_931]) ).

cnf(c_0_933,hypothesis,
    in(c205,c202),
    i_0_390 ).

cnf(c_0_934,hypothesis,
    loc(c196,c205),
    i_0_396 ).

cnf(c_0_935,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_932,c_0_933]),c_0_934])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08  % Problem  : CSR114+23 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.08  % Command  : enigmatic-eprover.py %s %d 1
% 0.07/0.26  % Computer : n032.cluster.edu
% 0.07/0.26  % Model    : x86_64 x86_64
% 0.07/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26  % Memory   : 8042.1875MB
% 0.07/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26  % CPULimit : 300
% 0.07/0.26  % WCLimit  : 600
% 0.07/0.26  % DateTime : Thu Jun  9 19:04:54 EDT 2022
% 0.07/0.26  % CPUTime  : 
% 0.10/0.33  # ENIGMATIC: Selected SinE mode:
% 0.10/0.42  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.42  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.10/0.42  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.10/0.42  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 4.29/2.28  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.29/2.28  # No SInE strategy applied
% 4.29/2.28  # Trying AutoSched0 for 150 seconds
% 4.29/2.28  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.29/2.28  # and selection function SelectComplexExceptUniqMaxHorn.
% 4.29/2.28  #
% 4.29/2.28  # Preprocessing time       : 0.016 s
% 4.29/2.28  # Presaturation interreduction done
% 4.29/2.28  
% 4.29/2.28  # Proof found!
% 4.29/2.28  # SZS status Theorem
% 4.29/2.28  # SZS output start CNFRefutation
% See solution above
% 4.29/2.28  # Training examples: 0 positive, 0 negative
% 4.29/2.28  
% 4.29/2.28  # -------------------------------------------------
% 4.29/2.28  # User time                : 0.035 s
% 4.29/2.28  # System time              : 0.005 s
% 4.29/2.28  # Total time               : 0.039 s
% 4.29/2.28  # Maximum resident set size: 7128 pages
% 4.29/2.28  
%------------------------------------------------------------------------------