↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n020.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:07 EDT 2022

% Result   : Theorem 5.04s 2.67s
% Output   : CNFRefutation 5.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   36 (  18 unt;   0 nHn;  36 RR)
%            Number of literals    :   76 (   0 equ;  49 neg)
%            Maximal clause size   :    8 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-3 aty)
%            Number of variables   :   55 (  16 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_708,plain,
    ( sub(X1,X2)
    | ~ sub(X3,X2)
    | ~ sub(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h8vhcmgv/lgb.p',i_0_708) ).

cnf(i_0_203,hypothesis,
    sub(hauptsstadt_1_1,stadt__1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h8vhcmgv/lgb.p',i_0_203) ).

cnf(i_0_709,negated_conjecture,
    ( ~ loc(X1,X2)
    | ~ scar(X1,X3)
    | ~ attr(X4,X5)
    | ~ subs(X1,stehen_1_1)
    | ~ sub(X5,name_1_1)
    | ~ sub(X4,stadt__1_1)
    | ~ prop(X4,italienisch__1_1)
    | ~ val(X5,rom_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h8vhcmgv/lgb.p',i_0_709) ).

cnf(i_0_215,hypothesis,
    val(c1282,rom_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h8vhcmgv/lgb.p',i_0_215) ).

cnf(i_0_216,hypothesis,
    sub(c1282,name_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h8vhcmgv/lgb.p',i_0_216) ).

cnf(i_0_217,hypothesis,
    sub(c1281,hauptsstadt_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h8vhcmgv/lgb.p',i_0_217) ).

cnf(i_0_218,hypothesis,
    prop(c1281,italienisch__1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h8vhcmgv/lgb.p',i_0_218) ).

cnf(i_0_219,hypothesis,
    attr(c1281,c1282),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h8vhcmgv/lgb.p',i_0_219) ).

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

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

cnf(i_0_578,plain,
    ( loc(esk27_2(X1,X2),X2)
    | ~ loc(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h8vhcmgv/lgb.p',i_0_578) ).

cnf(i_0_667,plain,
    ( loc(X1,esk50_3(X1,X2,X3))
    | ~ prop(X1,X2)
    | ~ state_adjective_state_binding(X2,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h8vhcmgv/lgb.p',i_0_667) ).

cnf(i_0_471,plain,
    state_adjective_state_binding(italienisch__1_1,italien_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h8vhcmgv/lgb.p',i_0_471) ).

cnf(c_0_723,plain,
    ( sub(X1,X2)
    | ~ sub(X3,X2)
    | ~ sub(X1,X3) ),
    i_0_708 ).

cnf(c_0_724,hypothesis,
    sub(hauptsstadt_1_1,stadt__1_1),
    i_0_203 ).

cnf(c_0_725,negated_conjecture,
    ( ~ loc(X1,X2)
    | ~ scar(X1,X3)
    | ~ attr(X4,X5)
    | ~ subs(X1,stehen_1_1)
    | ~ sub(X5,name_1_1)
    | ~ sub(X4,stadt__1_1)
    | ~ prop(X4,italienisch__1_1)
    | ~ val(X5,rom_0) ),
    i_0_709 ).

cnf(c_0_726,hypothesis,
    val(c1282,rom_0),
    i_0_215 ).

cnf(c_0_727,hypothesis,
    sub(c1282,name_1_1),
    i_0_216 ).

cnf(c_0_728,hypothesis,
    ( sub(X1,stadt__1_1)
    | ~ sub(X1,hauptsstadt_1_1) ),
    inference(spm,[status(thm)],[c_0_723,c_0_724]) ).

cnf(c_0_729,hypothesis,
    sub(c1281,hauptsstadt_1_1),
    i_0_217 ).

cnf(c_0_730,hypothesis,
    ( ~ prop(X1,italienisch__1_1)
    | ~ sub(X1,stadt__1_1)
    | ~ subs(X2,stehen_1_1)
    | ~ attr(X1,c1282)
    | ~ scar(X2,X3)
    | ~ loc(X2,X4) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_725,c_0_726]),c_0_727])]) ).

cnf(c_0_731,hypothesis,
    prop(c1281,italienisch__1_1),
    i_0_218 ).

cnf(c_0_732,hypothesis,
    sub(c1281,stadt__1_1),
    inference(spm,[status(thm)],[c_0_728,c_0_729]) ).

cnf(c_0_733,hypothesis,
    attr(c1281,c1282),
    i_0_219 ).

cnf(c_0_734,hypothesis,
    ( ~ subs(X1,stehen_1_1)
    | ~ scar(X1,X2)
    | ~ loc(X1,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_730,c_0_731]),c_0_732]),c_0_733])]) ).

cnf(c_0_735,plain,
    ( subs(esk27_2(X1,X2),stehen_1_1)
    | ~ loc(X1,X2) ),
    i_0_576 ).

cnf(c_0_736,plain,
    ( ~ scar(esk27_2(X1,X2),X3)
    | ~ loc(esk27_2(X1,X2),X4)
    | ~ loc(X1,X2) ),
    inference(spm,[status(thm)],[c_0_734,c_0_735]) ).

cnf(c_0_737,plain,
    ( scar(esk27_2(X1,X2),X1)
    | ~ loc(X1,X2) ),
    i_0_577 ).

cnf(c_0_738,plain,
    ( ~ loc(esk27_2(X1,X2),X3)
    | ~ loc(X1,X2) ),
    inference(spm,[status(thm)],[c_0_736,c_0_737]) ).

cnf(c_0_739,plain,
    ( loc(esk27_2(X1,X2),X2)
    | ~ loc(X1,X2) ),
    i_0_578 ).

cnf(c_0_740,plain,
    ~ loc(X1,X2),
    inference(spm,[status(thm)],[c_0_738,c_0_739]) ).

cnf(c_0_741,plain,
    ( loc(X1,esk50_3(X1,X2,X3))
    | ~ prop(X1,X2)
    | ~ state_adjective_state_binding(X2,X3) ),
    i_0_667 ).

cnf(c_0_742,plain,
    ( ~ state_adjective_state_binding(X1,X2)
    | ~ prop(X3,X1) ),
    inference(spm,[status(thm)],[c_0_740,c_0_741]) ).

cnf(c_0_743,plain,
    state_adjective_state_binding(italienisch__1_1,italien_0),
    i_0_471 ).

cnf(c_0_744,plain,
    ~ prop(X1,italienisch__1_1),
    inference(spm,[status(thm)],[c_0_742,c_0_743]) ).

cnf(c_0_745,hypothesis,
    $false,
    inference(sr,[status(thm)],[c_0_731,c_0_744]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CSR114+15 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n020.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Fri Jun 10 03:36:07 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected SinE mode:
% 0.39/0.62  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.62  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.39/0.62  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.39/0.62  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 5.04/2.67  # ENIGMATIC: Solved by autoschedule-lgb:
% 5.04/2.67  # No SInE strategy applied
% 5.04/2.67  # Trying AutoSched0 for 150 seconds
% 5.04/2.67  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 5.04/2.67  # and selection function SelectComplexExceptUniqMaxHorn.
% 5.04/2.67  #
% 5.04/2.67  # Preprocessing time       : 0.015 s
% 5.04/2.67  # Presaturation interreduction done
% 5.04/2.67  
% 5.04/2.67  # Proof found!
% 5.04/2.67  # SZS status Theorem
% 5.04/2.67  # SZS output start CNFRefutation
% See solution above
% 5.04/2.67  # Training examples: 0 positive, 0 negative
% 5.04/2.67  
% 5.04/2.67  # -------------------------------------------------
% 5.04/2.67  # User time                : 0.026 s
% 5.04/2.67  # System time              : 0.007 s
% 5.04/2.67  # Total time               : 0.033 s
% 5.04/2.67  # Maximum resident set size: 7128 pages
% 5.04/2.67  
%------------------------------------------------------------------------------