TSTP Solution File: CSR051+5 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR051+5 : TPTP v8.1.0. Bugfixed v3.5.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:47:03 EDT 2022

% Result   : Theorem 18.04s 12.49s
% Output   : CNFRefutation 18.04s
% 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-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    2 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_519,plain,
    ( marriagelicensedocument(c_tptpmarriagelicensedocument)
    | ~ mtvisible(c_tptp_member3356_mt) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-18gi4m2n/lgb.p',i_0_519) ).

cnf(i_0_1502,negated_conjecture,
    mtvisible(c_tptp_member3356_mt),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-18gi4m2n/lgb.p',i_0_1502) ).

cnf(i_0_1501,negated_conjecture,
    ~ marriagelicensedocument(X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-18gi4m2n/lgb.p',i_0_1501) ).

cnf(c_0_1506,plain,
    ( marriagelicensedocument(c_tptpmarriagelicensedocument)
    | ~ mtvisible(c_tptp_member3356_mt) ),
    i_0_519 ).

cnf(c_0_1507,negated_conjecture,
    mtvisible(c_tptp_member3356_mt),
    i_0_1502 ).

cnf(c_0_1508,negated_conjecture,
    ~ marriagelicensedocument(X1),
    i_0_1501 ).

cnf(c_0_1509,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_1506,c_0_1507])]),c_0_1508]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : CSR051+5 : TPTP v8.1.0. Bugfixed v3.5.0.
% 0.00/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.32  % Computer : n032.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit : 300
% 0.13/0.32  % WCLimit  : 600
% 0.13/0.32  % DateTime : Fri Jun 10 18:18:10 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.17/0.41  # ENIGMATIC: Selected SinE mode:
% 9.89/10.08  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.89/10.08  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 9.89/10.08  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 9.89/10.08  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 18.04/12.49  # ENIGMATIC: Solved by autoschedule-lgb:
% 18.04/12.49  # No SInE strategy applied
% 18.04/12.49  # Trying AutoSched0 for 145 seconds
% 18.04/12.49  # AutoSched0-Mode selected heuristic G_____0021_C18_F1_SE_CS_SP_S4S
% 18.04/12.49  # and selection function SelectNewComplexAHPNS.
% 18.04/12.49  #
% 18.04/12.49  # Preprocessing time       : 0.022 s
% 18.04/12.49  
% 18.04/12.49  # Proof found!
% 18.04/12.49  # SZS status Theorem
% 18.04/12.49  # SZS output start CNFRefutation
% See solution above
% 18.04/12.49  # Training examples: 0 positive, 0 negative
% 18.04/12.49  
% 18.04/12.49  # -------------------------------------------------
% 18.04/12.49  # User time                : 0.022 s
% 18.04/12.49  # System time              : 0.005 s
% 18.04/12.49  # Total time               : 0.028 s
% 18.04/12.49  # Maximum resident set size: 7124 pages
% 18.04/12.49  
%------------------------------------------------------------------------------