%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : LCL127-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s

% 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 : Sun Jul 17 10:19:48 EDT 2022

% Result   : Unknown 5.12s 5.31s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL127-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34  % Computer : n008.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % 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 : Sun Jul  3 08:32:08 EDT 2022
% 0.12/0.35  % CPUTime  : 
% 0.12/0.37  # No SInE strategy applied
% 0.12/0.37  # Auto-Mode selected heuristic G_____0019_C18_F1_PI_SE_CS_SP_S0Y
% 0.12/0.37  # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.37  #
% 0.12/0.37  # Number of axioms: 3 Number of unprocessed: 3
% 0.12/0.37  # Tableaux proof search.
% 0.12/0.37  # APR header successfully linked.
% 0.12/0.37  # Hello from C++
% 0.76/0.94  # The folding up rule is enabled...
% 0.76/0.94  # Local unification is enabled...
% 0.76/0.94  # Any saturation attempts will use folding labels...
% 0.76/0.94  # 3 beginning clauses after preprocessing and clausification
% 0.76/0.94  # Creating start rules for all 1 conjectures.
% 0.76/0.94  # There are 1 start rule candidates:
% 0.76/0.94  # Found 2 unit axioms.
% 0.76/0.94  # 1 start rule tableaux created.
% 0.76/0.94  # 1 extension rule candidate clauses
% 0.76/0.94  # 2 unit axiom clauses
% 0.76/0.94  
% 0.76/0.94  # Requested 8, 32 cores available to the main process.
% 0.76/0.94  # There are not enough tableaux to fork, creating more from the initial 1
% 1.93/2.16  # Ran out of tableaux, making start rules for all clauses
% 5.10/5.30  # Returning from population with 0 new_tableaux and 0 remaining starting tableaux.
% 5.10/5.30  # We now have 0 tableaux to operate on
% 5.12/5.30  # Proof search is over...
% 5.12/5.30  # SZS status ResourceOut
% 5.12/5.30  # Freeing feature tree
%------------------------------------------------------------------------------