↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR035+4 : TPTP v8.1.0. Released v3.4.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:46:46 EDT 2022

% Result   : Theorem 8.32s 3.81s
% Output   : CNFRefutation 8.32s
% 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    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-3 aty)
%            Number of variables   :    2 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_437,plain,
    ( prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhoisaffiliatedwithbc)
    | ~ mtvisible(c_englishmt) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hz5o84no/lgb.p',i_0_437) ).

cnf(i_0_2624,negated_conjecture,
    mtvisible(c_englishmt),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hz5o84no/lgb.p',i_0_2624) ).

cnf(i_0_2623,negated_conjecture,
    ~ prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hz5o84no/lgb.p',i_0_2623) ).

cnf(c_0_2628,plain,
    ( prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhoisaffiliatedwithbc)
    | ~ mtvisible(c_englishmt) ),
    i_0_437 ).

cnf(c_0_2629,negated_conjecture,
    mtvisible(c_englishmt),
    i_0_2624 ).

cnf(c_0_2630,negated_conjecture,
    ~ prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X1),
    i_0_2623 ).

cnf(c_0_2631,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2628,c_0_2629])]),c_0_2630]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : CSR035+4 : TPTP v8.1.0. Released v3.4.0.
% 0.12/0.13  % 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 12:12:24 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.82/1.05  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.82/1.05  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.82/1.05  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.82/1.05  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.32/3.81  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.32/3.81  # No SInE strategy applied
% 8.32/3.81  # Trying AutoSched0 for 150 seconds
% 8.32/3.81  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.32/3.81  # and selection function SelectComplexExceptUniqMaxHorn.
% 8.32/3.81  #
% 8.32/3.81  # Preprocessing time       : 0.024 s
% 8.32/3.81  # Presaturation interreduction done
% 8.32/3.81  
% 8.32/3.81  # Proof found!
% 8.32/3.81  # SZS status Theorem
% 8.32/3.81  # SZS output start CNFRefutation
% See solution above
% 8.32/3.81  # Training examples: 0 positive, 0 negative
% 8.32/3.81  
% 8.32/3.81  # -------------------------------------------------
% 8.32/3.81  # User time                : 0.025 s
% 8.32/3.81  # System time              : 0.011 s
% 8.32/3.81  # Total time               : 0.035 s
% 8.32/3.81  # Maximum resident set size: 7124 pages
% 8.32/3.81  
%------------------------------------------------------------------------------