↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n007.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 7.42s 2.77s
% Output   : CNFRefutation 7.42s
% 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_670,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-hrmp6rgh/lgb.p',i_0_670) ).

cnf(i_0_175,hypothesis,
    val(c95,rom_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hrmp6rgh/lgb.p',i_0_175) ).

cnf(i_0_176,hypothesis,
    sub(c95,name_1_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hrmp6rgh/lgb.p',i_0_176) ).

cnf(i_0_179,hypothesis,
    sub(c88,kolosseum_1_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hrmp6rgh/lgb.p',i_0_179) ).

cnf(i_0_177,hypothesis,
    sub(c94,stadt__1_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hrmp6rgh/lgb.p',i_0_177) ).

cnf(i_0_178,hypothesis,
    attr(c94,c95),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hrmp6rgh/lgb.p',i_0_178) ).

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

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

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

cnf(i_0_174,hypothesis,
    in(c97,c94),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hrmp6rgh/lgb.p',i_0_174) ).

cnf(i_0_180,hypothesis,
    loc(c88,c97),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hrmp6rgh/lgb.p',i_0_180) ).

cnf(c_0_682,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_670 ).

cnf(c_0_683,hypothesis,
    val(c95,rom_0),
    i_0_175 ).

cnf(c_0_684,hypothesis,
    sub(c95,name_1_1),
    i_0_176 ).

cnf(c_0_685,hypothesis,
    ( ~ sub(X1,kolosseum_1_1)
    | ~ sub(X2,stadt__1_1)
    | ~ subs(X3,stehen_1_1)
    | ~ attr(X2,c95)
    | ~ scar(X3,X1)
    | ~ loc(X3,X4)
    | ~ in(X4,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_682,c_0_683]),c_0_684])]) ).

cnf(c_0_686,hypothesis,
    sub(c88,kolosseum_1_1),
    i_0_179 ).

cnf(c_0_687,hypothesis,
    ( ~ sub(X1,stadt__1_1)
    | ~ subs(X2,stehen_1_1)
    | ~ attr(X1,c95)
    | ~ scar(X2,c88)
    | ~ loc(X2,X3)
    | ~ in(X3,X1) ),
    inference(spm,[status(thm)],[c_0_685,c_0_686]) ).

cnf(c_0_688,hypothesis,
    sub(c94,stadt__1_1),
    i_0_177 ).

cnf(c_0_689,hypothesis,
    attr(c94,c95),
    i_0_178 ).

cnf(c_0_690,hypothesis,
    ( ~ subs(X1,stehen_1_1)
    | ~ scar(X1,c88)
    | ~ loc(X1,X2)
    | ~ in(X2,c94) ),
    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_537 ).

cnf(c_0_692,plain,
    ( ~ scar(esk27_2(X1,X2),c88)
    | ~ loc(esk27_2(X1,X2),X3)
    | ~ loc(X1,X2)
    | ~ in(X3,c94) ),
    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_538 ).

cnf(c_0_694,plain,
    ( ~ loc(esk27_2(c88,X1),X2)
    | ~ loc(c88,X1)
    | ~ in(X2,c94) ),
    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_539 ).

cnf(c_0_696,plain,
    ( ~ loc(c88,X1)
    | ~ in(X1,c94) ),
    inference(spm,[status(thm)],[c_0_694,c_0_695]) ).

cnf(c_0_697,hypothesis,
    in(c97,c94),
    i_0_174 ).

cnf(c_0_698,hypothesis,
    loc(c88,c97),
    i_0_180 ).

cnf(c_0_699,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_696,c_0_697]),c_0_698])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : CSR114+12 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n007.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 : Sat Jun 11 08:56:09 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected SinE mode:
% 0.19/0.58  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.58  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.58  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.58  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.42/2.77  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.42/2.77  # No SInE strategy applied
% 7.42/2.77  # Trying AutoSched0 for 150 seconds
% 7.42/2.77  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.42/2.77  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.42/2.77  #
% 7.42/2.77  # Preprocessing time       : 0.024 s
% 7.42/2.77  # Presaturation interreduction done
% 7.42/2.77  
% 7.42/2.77  # Proof found!
% 7.42/2.77  # SZS status Theorem
% 7.42/2.77  # SZS output start CNFRefutation
% See solution above
% 7.42/2.77  # Training examples: 0 positive, 0 negative
% 7.42/2.77  
% 7.42/2.77  # -------------------------------------------------
% 7.42/2.77  # User time                : 0.032 s
% 7.42/2.77  # System time              : 0.015 s
% 7.42/2.77  # Total time               : 0.046 s
% 7.42/2.77  # Maximum resident set size: 7128 pages
% 7.42/2.77  
%------------------------------------------------------------------------------