↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n015.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:06 EDT 2022

% Result   : Theorem 6.98s 2.55s
% Output   : CNFRefutation 6.98s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   30 (  15 unt;   0 nHn;  30 RR)
%            Number of literals    :   62 (   0 equ;  41 neg)
%            Maximal clause size   :    7 (   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   :   48 (  16 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_672,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)
    | ~ val(X5,rom_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ij3priem/lgb.p',i_0_672) ).

cnf(i_0_177,hypothesis,
    val(c137,rom_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ij3priem/lgb.p',i_0_177) ).

cnf(i_0_178,hypothesis,
    sub(c137,name_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ij3priem/lgb.p',i_0_178) ).

cnf(i_0_179,hypothesis,
    sub(c136,stadt__1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ij3priem/lgb.p',i_0_179) ).

cnf(i_0_180,hypothesis,
    attr(c136,c137),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ij3priem/lgb.p',i_0_180) ).

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

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

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

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

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

cnf(i_0_181,hypothesis,
    prop(c123,italienisch__1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ij3priem/lgb.p',i_0_181) ).

cnf(c_0_684,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)
    | ~ val(X5,rom_0) ),
    i_0_672 ).

cnf(c_0_685,hypothesis,
    val(c137,rom_0),
    i_0_177 ).

cnf(c_0_686,hypothesis,
    sub(c137,name_1_1),
    i_0_178 ).

cnf(c_0_687,hypothesis,
    ( ~ sub(X1,stadt__1_1)
    | ~ subs(X2,stehen_1_1)
    | ~ attr(X1,c137)
    | ~ scar(X2,X3)
    | ~ loc(X2,X4) ),
    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(c136,stadt__1_1),
    i_0_179 ).

cnf(c_0_689,hypothesis,
    attr(c136,c137),
    i_0_180 ).

cnf(c_0_690,hypothesis,
    ( ~ subs(X1,stehen_1_1)
    | ~ scar(X1,X2)
    | ~ loc(X1,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_687,c_0_688]),c_0_689])]) ).

cnf(c_0_691,plain,
    ( subs(esk27_2(X1,X2),stehen_1_1)
    | ~ loc(X1,X2) ),
    i_0_539 ).

cnf(c_0_692,plain,
    ( ~ scar(esk27_2(X1,X2),X3)
    | ~ loc(esk27_2(X1,X2),X4)
    | ~ loc(X1,X2) ),
    inference(spm,[status(thm)],[c_0_690,c_0_691]) ).

cnf(c_0_693,plain,
    ( scar(esk27_2(X1,X2),X1)
    | ~ loc(X1,X2) ),
    i_0_540 ).

cnf(c_0_694,plain,
    ( ~ loc(esk27_2(X1,X2),X3)
    | ~ loc(X1,X2) ),
    inference(spm,[status(thm)],[c_0_692,c_0_693]) ).

cnf(c_0_695,plain,
    ( loc(esk27_2(X1,X2),X2)
    | ~ loc(X1,X2) ),
    i_0_541 ).

cnf(c_0_696,plain,
    ~ loc(X1,X2),
    inference(spm,[status(thm)],[c_0_694,c_0_695]) ).

cnf(c_0_697,plain,
    ( loc(X1,esk50_3(X1,X2,X3))
    | ~ prop(X1,X2)
    | ~ state_adjective_state_binding(X2,X3) ),
    i_0_630 ).

cnf(c_0_698,plain,
    ( ~ state_adjective_state_binding(X1,X2)
    | ~ prop(X3,X1) ),
    inference(spm,[status(thm)],[c_0_696,c_0_697]) ).

cnf(c_0_699,plain,
    state_adjective_state_binding(italienisch__1_1,italien_0),
    i_0_433 ).

cnf(c_0_700,hypothesis,
    prop(c123,italienisch__1_1),
    i_0_181 ).

cnf(c_0_701,plain,
    ~ prop(X1,italienisch__1_1),
    inference(spm,[status(thm)],[c_0_698,c_0_699]) ).

cnf(c_0_702,hypothesis,
    $false,
    inference(sr,[status(thm)],[c_0_700,c_0_701]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : CSR114+13 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.33  % Computer : n015.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sat Jun 11 04:02:22 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected SinE mode:
% 0.44/0.61  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.44/0.61  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.44/0.61  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.44/0.61  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 6.98/2.55  # ENIGMATIC: Solved by autoschedule-lgb:
% 6.98/2.55  # No SInE strategy applied
% 6.98/2.55  # Trying AutoSched0 for 150 seconds
% 6.98/2.55  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.98/2.55  # and selection function SelectComplexExceptUniqMaxHorn.
% 6.98/2.55  #
% 6.98/2.55  # Preprocessing time       : 0.021 s
% 6.98/2.55  # Presaturation interreduction done
% 6.98/2.55  
% 6.98/2.55  # Proof found!
% 6.98/2.55  # SZS status Theorem
% 6.98/2.55  # SZS output start CNFRefutation
% See solution above
% 6.98/2.55  # Training examples: 0 positive, 0 negative
% 6.98/2.55  
% 6.98/2.55  # -------------------------------------------------
% 6.98/2.55  # User time                : 0.037 s
% 6.98/2.55  # System time              : 0.006 s
% 6.98/2.55  # Total time               : 0.042 s
% 6.98/2.55  # Maximum resident set size: 7120 pages
% 6.98/2.55  
%------------------------------------------------------------------------------