TSTP Solution File: SWC385+1 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n006.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 : Tue Jul 19 20:15:21 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_191,negated_conjecture,
    ( ~ singletonP(esk48_0)
    | ~ segmentP(esk49_0,esk48_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i3fo_fi_/lgb.p',i_0_191) ).

cnf(i_0_195,negated_conjecture,
    esk50_0 = esk48_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i3fo_fi_/lgb.p',i_0_195) ).

cnf(i_0_193,negated_conjecture,
    segmentP(esk51_0,esk50_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i3fo_fi_/lgb.p',i_0_193) ).

cnf(i_0_196,negated_conjecture,
    esk49_0 = esk51_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i3fo_fi_/lgb.p',i_0_196) ).

cnf(i_0_192,negated_conjecture,
    ( singletonP(esk50_0)
    | ~ neq(esk51_0,nil) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i3fo_fi_/lgb.p',i_0_192) ).

cnf(i_0_194,negated_conjecture,
    neq(esk49_0,nil),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i3fo_fi_/lgb.p',i_0_194) ).

cnf(c_0_203,negated_conjecture,
    ( ~ singletonP(esk48_0)
    | ~ segmentP(esk49_0,esk48_0) ),
    i_0_191 ).

cnf(c_0_204,negated_conjecture,
    esk50_0 = esk48_0,
    i_0_195 ).

cnf(c_0_205,negated_conjecture,
    segmentP(esk51_0,esk50_0),
    i_0_193 ).

cnf(c_0_206,negated_conjecture,
    esk49_0 = esk51_0,
    i_0_196 ).

cnf(c_0_207,negated_conjecture,
    ( ~ segmentP(esk49_0,esk50_0)
    | ~ singletonP(esk50_0) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_203,c_0_204]),c_0_204]) ).

cnf(c_0_208,negated_conjecture,
    segmentP(esk49_0,esk50_0),
    inference(rw,[status(thm)],[c_0_205,c_0_206]) ).

cnf(c_0_209,negated_conjecture,
    ( singletonP(esk50_0)
    | ~ neq(esk51_0,nil) ),
    i_0_192 ).

cnf(c_0_210,negated_conjecture,
    neq(esk49_0,nil),
    i_0_194 ).

cnf(c_0_211,negated_conjecture,
    ~ singletonP(esk50_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_207,c_0_208])]) ).

cnf(c_0_212,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_209,c_0_206]),c_0_210])]),c_0_211]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWC385+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n006.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jun 12 14:20:28 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.45  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 6.23/2.38  # ENIGMATIC: Solved by autoschedule-lgb:
% 6.23/2.38  # No SInE strategy applied
% 6.23/2.38  # Trying AutoSched0 for 150 seconds
% 6.23/2.38  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S01BI
% 6.23/2.38  # and selection function PSelectMinOptimalNoXTypePred.
% 6.23/2.38  #
% 6.23/2.38  # Preprocessing time       : 0.014 s
% 6.23/2.38  # Presaturation interreduction done
% 6.23/2.38  
% 6.23/2.38  # Proof found!
% 6.23/2.38  # SZS status Theorem
% 6.23/2.38  # SZS output start CNFRefutation
% See solution above
% 6.23/2.38  # Training examples: 0 positive, 0 negative
% 6.23/2.38  
% 6.23/2.38  # -------------------------------------------------
% 6.23/2.38  # User time                : 0.013 s
% 6.23/2.38  # System time              : 0.006 s
% 6.23/2.38  # Total time               : 0.019 s
% 6.23/2.38  # Maximum resident set size: 7128 pages
% 6.23/2.38  
%------------------------------------------------------------------------------