TSTP Solution File: COL058-1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : COL058-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 : n032.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 00:24:43 EDT 2022

% Result   : Unsatisfiable 0.15s 0.34s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem  : COL058-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.11  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.10/0.30  % Computer : n032.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 600
% 0.10/0.30  % DateTime : Tue May 31 12:59:28 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.15/0.33  # No SInE strategy applied
% 0.15/0.33  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.33  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.15/0.33  #
% 0.15/0.33  # Presaturation interreduction done
% 0.15/0.33  # Number of axioms: 2 Number of unprocessed: 2
% 0.15/0.33  # Tableaux proof search.
% 0.15/0.33  # APR header successfully linked.
% 0.15/0.33  # Hello from C++
% 0.15/0.33  # The folding up rule is enabled...
% 0.15/0.33  # Local unification is enabled...
% 0.15/0.33  # Any saturation attempts will use folding labels...
% 0.15/0.33  # 2 beginning clauses after preprocessing and clausification
% 0.15/0.33  # Creating start rules for all 1 conjectures.
% 0.15/0.33  # There are 1 start rule candidates:
% 0.15/0.33  # Found 2 unit axioms.
% 0.15/0.33  # 1 start rule tableaux created.
% 0.15/0.33  # 0 extension rule candidate clauses
% 0.15/0.33  # 2 unit axiom clauses
% 0.15/0.33  
% 0.15/0.33  # Requested 8, 32 cores available to the main process.
% 0.15/0.33  # There are not enough tableaux to fork, creating more from the initial 1
% 0.15/0.33  # Creating equality axioms
% 0.15/0.33  # Ran out of tableaux, making start rules for all clauses
% 0.15/0.34  # There were 2 total branch saturation attempts.
% 0.15/0.34  # There were 0 of these attempts blocked.
% 0.15/0.34  # There were 0 deferred branch saturation attempts.
% 0.15/0.34  # There were 0 free duplicated saturations.
% 0.15/0.34  # There were 2 total successful branch saturations.
% 0.15/0.34  # There were 0 successful branch saturations in interreduction.
% 0.15/0.34  # There were 0 successful branch saturations on the branch.
% 0.15/0.34  # There were 2 successful branch saturations after the branch.
% 0.15/0.34  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.34  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.34  # Begin clausification derivation
% 0.15/0.34  
% 0.15/0.34  # End clausification derivation
% 0.15/0.34  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.34  cnf(i_0_3, plain, (response(response(lark,X1),X2)=response(X1,response(X2,X2)))).
% 0.15/0.34  cnf(i_0_4, negated_conjecture, (response(X1,X1)!=X1)).
% 0.15/0.34  cnf(i_0_6, plain, (X3=X3)).
% 0.15/0.34  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.15/0.34  # Begin printing tableau
% 0.15/0.34  # Found 6 steps
% 0.15/0.34  cnf(i_0_3, plain, (response(response(lark,X16),X15)=response(X16,response(X15,X15))), inference(start_rule)).
% 0.15/0.34  cnf(i_0_11, plain, (response(response(lark,X16),X15)=response(X16,response(X15,X15))), inference(extension_rule, [i_0_10])).
% 0.15/0.34  cnf(i_0_23, plain, (response(response(lark,X13),X14)!=response(X13,response(X14,X14))), inference(closure_rule, [i_0_3])).
% 0.15/0.34  cnf(i_0_21, plain, (response(response(response(lark,X16),X15),response(response(lark,X13),X14))=response(response(X16,response(X15,X15)),response(X13,response(X14,X14)))), inference(extension_rule, [i_0_9])).
% 0.15/0.34  cnf(i_0_69, plain, (response(response(X16,response(X15,X15)),response(X13,response(X14,X14)))!=response(response(response(lark,X16),X15),response(response(lark,X13),X14))), inference(closure_rule, [i_0_21])).
% 0.15/0.34  cnf(i_0_68, plain, (response(response(X16,response(X15,X15)),response(X13,response(X14,X14)))=response(response(X16,response(X15,X15)),response(X13,response(X14,X14)))), inference(etableau_closure_rule, [i_0_68, ...])).
% 0.15/0.34  # End printing tableau
% 0.15/0.34  # SZS output end
% 0.15/0.34  # Branches closed with saturation will be marked with an "s"
% 0.15/0.34  # Returning from population with 6 new_tableaux and 0 remaining starting tableaux.
% 0.15/0.34  # We now have 6 tableaux to operate on
% 0.15/0.34  # Found closed tableau during pool population.
% 0.15/0.34  # Proof search is over...
% 0.15/0.34  # Freeing feature tree
%------------------------------------------------------------------------------