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

View Problem - Process Solution

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

% Computer : n008.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 : Mon Jul 18 08:37:53 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4276,negated_conjecture,
    ~ aElementOf0(esk42_0,xQ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9xg5iiss/lgb.p',i_0_4276) ).

cnf(i_0_4268,hypothesis,
    ( aElementOf0(X1,xQ)
    | ~ aElementOf0(X1,xP) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9xg5iiss/lgb.p',i_0_4268) ).

cnf(i_0_4277,negated_conjecture,
    aElementOf0(esk42_0,xP),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9xg5iiss/lgb.p',i_0_4277) ).

cnf(c_0_4281,negated_conjecture,
    ~ aElementOf0(esk42_0,xQ),
    i_0_4276 ).

cnf(c_0_4282,hypothesis,
    ( aElementOf0(X1,xQ)
    | ~ aElementOf0(X1,xP) ),
    i_0_4268 ).

cnf(c_0_4283,negated_conjecture,
    aElementOf0(esk42_0,xP),
    i_0_4277 ).

cnf(c_0_4284,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4281,c_0_4282]),c_0_4283])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM609+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n008.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 : Thu Jul  7 23:15:10 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.21/0.45  # ENIGMATIC: Selected complete mode:
% 9.38/3.31  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.38/3.31  # No SInE strategy applied
% 9.38/3.31  # Trying AutoSched0 for 150 seconds
% 9.38/3.31  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 9.38/3.31  # and selection function SelectMaxLComplexAvoidPosPred.
% 9.38/3.31  #
% 9.38/3.31  # Preprocessing time       : 0.024 s
% 9.38/3.31  
% 9.38/3.31  # Proof found!
% 9.38/3.31  # SZS status Theorem
% 9.38/3.31  # SZS output start CNFRefutation
% See solution above
% 9.38/3.31  # Training examples: 0 positive, 0 negative
% 9.38/3.31  
% 9.38/3.31  # -------------------------------------------------
% 9.38/3.31  # User time                : 0.025 s
% 9.38/3.31  # System time              : 0.006 s
% 9.38/3.31  # Total time               : 0.031 s
% 9.38/3.31  # Maximum resident set size: 7128 pages
% 9.38/3.31  
%------------------------------------------------------------------------------