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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM610+3 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 08:37:53 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4278,negated_conjecture,
    ~ aElementOf0(esk42_0,xO),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dnje6pzw/lgb.p',i_0_4278) ).

cnf(i_0_4254,hypothesis,
    ( aElementOf0(X1,xO)
    | ~ aElementOf0(X1,xQ) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dnje6pzw/lgb.p',i_0_4254) ).

cnf(i_0_4276,hypothesis,
    ( aElementOf0(X1,xQ)
    | ~ aElementOf0(X1,xP) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dnje6pzw/lgb.p',i_0_4276) ).

cnf(i_0_4279,negated_conjecture,
    aElementOf0(esk42_0,xP),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dnje6pzw/lgb.p',i_0_4279) ).

cnf(c_0_4284,negated_conjecture,
    ~ aElementOf0(esk42_0,xO),
    i_0_4278 ).

cnf(c_0_4285,hypothesis,
    ( aElementOf0(X1,xO)
    | ~ aElementOf0(X1,xQ) ),
    i_0_4254 ).

cnf(c_0_4286,negated_conjecture,
    ~ aElementOf0(esk42_0,xQ),
    inference(spm,[status(thm)],[c_0_4284,c_0_4285]) ).

cnf(c_0_4287,hypothesis,
    ( aElementOf0(X1,xQ)
    | ~ aElementOf0(X1,xP) ),
    i_0_4276 ).

cnf(c_0_4288,negated_conjecture,
    aElementOf0(esk42_0,xP),
    i_0_4279 ).

cnf(c_0_4289,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4286,c_0_4287]),c_0_4288])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUM610+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n007.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.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Wed Jul  6 00:56:59 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 9.59/3.59  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.59/3.59  # No SInE strategy applied
% 9.59/3.59  # Trying AutoSched0 for 150 seconds
% 9.59/3.59  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 9.59/3.59  # and selection function SelectMaxLComplexAvoidPosPred.
% 9.59/3.59  #
% 9.59/3.59  # Preprocessing time       : 0.026 s
% 9.59/3.59  
% 9.59/3.59  # Proof found!
% 9.59/3.59  # SZS status Theorem
% 9.59/3.59  # SZS output start CNFRefutation
% See solution above
% 9.59/3.59  # Training examples: 0 positive, 0 negative
% 9.59/3.59  
% 9.59/3.59  # -------------------------------------------------
% 9.59/3.59  # User time                : 0.030 s
% 9.59/3.59  # System time              : 0.007 s
% 9.59/3.59  # Total time               : 0.037 s
% 9.59/3.59  # Maximum resident set size: 7124 pages
% 9.59/3.59  
%------------------------------------------------------------------------------