↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n028.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:47:22 EDT 2022

% Result   : Theorem 7.63s 2.27s
% Output   : CNFRefutation 7.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    7 (   5 unt;   0 nHn;   7 RR)
%            Number of literals    :    9 (   0 equ;   4 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
    ( borderson(c_georegion_l4_x38_y24,c_georegion_l4_x39_y24)
    | ~ mtvisible(c_tptpgeo_member1_mt) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ib9jy21z/input.p',i_0_1) ).

cnf(i_0_31,negated_conjecture,
    mtvisible(c_tptpgeo_member1_mt),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ib9jy21z/input.p',i_0_31) ).

cnf(i_0_30,negated_conjecture,
    ~ borderson(c_georegion_l4_x38_y24,c_georegion_l4_x39_y24),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ib9jy21z/input.p',i_0_30) ).

cnf(c_0_35,plain,
    ( borderson(c_georegion_l4_x38_y24,c_georegion_l4_x39_y24)
    | ~ mtvisible(c_tptpgeo_member1_mt) ),
    i_0_1 ).

cnf(c_0_36,negated_conjecture,
    mtvisible(c_tptpgeo_member1_mt),
    i_0_31 ).

cnf(c_0_37,negated_conjecture,
    ~ borderson(c_georegion_l4_x38_y24,c_georegion_l4_x39_y24),
    i_0_30 ).

cnf(c_0_38,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),c_0_37]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : CSR069+1 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.32  % Computer : n028.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Sat Jun 11 01:03:21 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.63/2.27  # ENIGMATIC: Solved by autoschedule:
% 7.63/2.27  # No SInE strategy applied
% 7.63/2.27  # Trying AutoSched0 for 150 seconds
% 7.63/2.27  # AutoSched0-Mode selected heuristic H_____047_C18_F1_PI_AE_R8_CS_SP_S2S
% 7.63/2.27  # and selection function SelectNewComplexAHP.
% 7.63/2.27  #
% 7.63/2.27  # Preprocessing time       : 0.013 s
% 7.63/2.27  
% 7.63/2.27  # Proof found!
% 7.63/2.27  # SZS status Theorem
% 7.63/2.27  # SZS output start CNFRefutation
% See solution above
% 7.63/2.27  # Training examples: 0 positive, 0 negative
% 7.63/2.27  
% 7.63/2.27  # -------------------------------------------------
% 7.63/2.27  # User time                : 0.012 s
% 7.63/2.27  # System time              : 0.005 s
% 7.63/2.27  # Total time               : 0.018 s
% 7.63/2.27  # Maximum resident set size: 7116 pages
% 7.63/2.27  
%------------------------------------------------------------------------------