TSTP Solution File: CSR055+3 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR055+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n009.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:07 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_687,plain,
    ( ~ individual(X1)
    | ~ collection(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l6olr4iv/lgb.p',i_0_687) ).

cnf(i_0_805,plain,
    individual(c_xskijump_thegame),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l6olr4iv/lgb.p',i_0_805) ).

cnf(i_0_2166,plain,
    ( collection(X1)
    | ~ disjointwith(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l6olr4iv/lgb.p',i_0_2166) ).

cnf(i_0_2495,negated_conjecture,
    disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l6olr4iv/lgb.p',i_0_2495) ).

cnf(c_0_2500,plain,
    ( ~ individual(X1)
    | ~ collection(X1) ),
    i_0_687 ).

cnf(c_0_2501,plain,
    individual(c_xskijump_thegame),
    i_0_805 ).

cnf(c_0_2502,plain,
    ( collection(X1)
    | ~ disjointwith(X1,X2) ),
    i_0_2166 ).

cnf(c_0_2503,negated_conjecture,
    disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
    i_0_2495 ).

cnf(c_0_2504,plain,
    ~ collection(c_xskijump_thegame),
    inference(spm,[status(thm)],[c_0_2500,c_0_2501]) ).

cnf(c_0_2505,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2502,c_0_2503]),c_0_2504]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CSR055+3 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jun 11 10:25:25 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.37/0.60  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.60  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.37/0.60  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.37/0.60  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 9.12/3.27  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.12/3.27  # SinE strategy is gf600_h_gu_R05_F100_L20000
% 9.12/3.27  # Trying AutoSched0 for 150 seconds
% 9.12/3.27  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S063N
% 9.12/3.27  # and selection function SelectMaxLComplexAvoidPosUPred.
% 9.12/3.27  #
% 9.12/3.27  # Preprocessing time       : 0.036 s
% 9.12/3.27  # Presaturation interreduction done
% 9.12/3.27  
% 9.12/3.27  # Proof found!
% 9.12/3.27  # SZS status Theorem
% 9.12/3.27  # SZS output start CNFRefutation
% See solution above
% 9.12/3.27  # Training examples: 0 positive, 0 negative
% 9.12/3.27  
% 9.12/3.27  # -------------------------------------------------
% 9.12/3.27  # User time                : 0.069 s
% 9.12/3.27  # System time              : 0.016 s
% 9.12/3.27  # Total time               : 0.085 s
% 9.12/3.27  # Maximum resident set size: 7124 pages
% 9.12/3.27  
%------------------------------------------------------------------------------