TSTP Solution File: CSR114+20 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR114+20 : 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 7.23s 2.38s
% Output   : CNFRefutation 7.23s
% 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_732,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/sandbox2/tmp/enigma-theBenchmark.p-yjq674nm/lgb.p',i_0_732) ).

cnf(i_0_229,hypothesis,
    val(c495,rom_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yjq674nm/lgb.p',i_0_229) ).

cnf(i_0_230,hypothesis,
    sub(c495,name_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yjq674nm/lgb.p',i_0_230) ).

cnf(i_0_233,hypothesis,
    sub(c486,kolosseum_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yjq674nm/lgb.p',i_0_233) ).

cnf(i_0_231,hypothesis,
    sub(c494,stadt__1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yjq674nm/lgb.p',i_0_231) ).

cnf(i_0_232,hypothesis,
    attr(c494,c495),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yjq674nm/lgb.p',i_0_232) ).

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

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

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

cnf(i_0_222,hypothesis,
    in(c505,c494),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yjq674nm/lgb.p',i_0_222) ).

cnf(i_0_234,hypothesis,
    loc(c486,c505),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yjq674nm/lgb.p',i_0_234) ).

cnf(c_0_744,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_732 ).

cnf(c_0_745,hypothesis,
    val(c495,rom_0),
    i_0_229 ).

cnf(c_0_746,hypothesis,
    sub(c495,name_1_1),
    i_0_230 ).

cnf(c_0_747,hypothesis,
    ( ~ sub(X1,kolosseum_1_1)
    | ~ sub(X2,stadt__1_1)
    | ~ subs(X3,stehen_1_1)
    | ~ attr(X2,c495)
    | ~ scar(X3,X1)
    | ~ loc(X3,X4)
    | ~ in(X4,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_744,c_0_745]),c_0_746])]) ).

cnf(c_0_748,hypothesis,
    sub(c486,kolosseum_1_1),
    i_0_233 ).

cnf(c_0_749,hypothesis,
    ( ~ sub(X1,stadt__1_1)
    | ~ subs(X2,stehen_1_1)
    | ~ attr(X1,c495)
    | ~ scar(X2,c486)
    | ~ loc(X2,X3)
    | ~ in(X3,X1) ),
    inference(spm,[status(thm)],[c_0_747,c_0_748]) ).

cnf(c_0_750,hypothesis,
    sub(c494,stadt__1_1),
    i_0_231 ).

cnf(c_0_751,hypothesis,
    attr(c494,c495),
    i_0_232 ).

cnf(c_0_752,hypothesis,
    ( ~ subs(X1,stehen_1_1)
    | ~ scar(X1,c486)
    | ~ loc(X1,X2)
    | ~ in(X2,c494) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_749,c_0_750]),c_0_751])]) ).

cnf(c_0_753,plain,
    ( subs(esk27_2(X1,X2),stehen_1_1)
    | ~ loc(X1,X2) ),
    i_0_599 ).

cnf(c_0_754,plain,
    ( ~ scar(esk27_2(X1,X2),c486)
    | ~ loc(esk27_2(X1,X2),X3)
    | ~ loc(X1,X2)
    | ~ in(X3,c494) ),
    inference(spm,[status(thm)],[c_0_752,c_0_753]) ).

cnf(c_0_755,plain,
    ( scar(esk27_2(X1,X2),X1)
    | ~ loc(X1,X2) ),
    i_0_600 ).

cnf(c_0_756,plain,
    ( ~ loc(esk27_2(c486,X1),X2)
    | ~ loc(c486,X1)
    | ~ in(X2,c494) ),
    inference(spm,[status(thm)],[c_0_754,c_0_755]) ).

cnf(c_0_757,plain,
    ( loc(esk27_2(X1,X2),X2)
    | ~ loc(X1,X2) ),
    i_0_601 ).

cnf(c_0_758,plain,
    ( ~ loc(c486,X1)
    | ~ in(X1,c494) ),
    inference(spm,[status(thm)],[c_0_756,c_0_757]) ).

cnf(c_0_759,hypothesis,
    in(c505,c494),
    i_0_222 ).

cnf(c_0_760,hypothesis,
    loc(c486,c505),
    i_0_234 ).

cnf(c_0_761,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_758,c_0_759]),c_0_760])]),
    [proof] ).

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