TSTP Solution File: KRS080+1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : KRS080+1 : TPTP v8.1.0. Released v3.1.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 : n023.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 03:00:29 EDT 2022

% Result   : Unsatisfiable 0.19s 0.57s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : KRS080+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/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.33  % Computer : n023.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 : Tue Jun  7 20:33:08 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.37  # No SInE strategy applied
% 0.12/0.37  # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.12/0.37  # and selection function SelectNewComplexAHP.
% 0.12/0.37  #
% 0.12/0.37  # Presaturation interreduction done
% 0.12/0.37  # Number of axioms: 42 Number of unprocessed: 42
% 0.12/0.37  # Tableaux proof search.
% 0.12/0.37  # APR header successfully linked.
% 0.12/0.37  # Hello from C++
% 0.12/0.38  # The folding up rule is enabled...
% 0.12/0.38  # Local unification is enabled...
% 0.12/0.38  # Any saturation attempts will use folding labels...
% 0.12/0.38  # 42 beginning clauses after preprocessing and clausification
% 0.12/0.38  # No conjectures after preprocessing.  Attempting to resurrect them from ax_archive.
% 0.12/0.38  # No conjectures.
% 0.12/0.38  # There are 42 start rule candidates:
% 0.12/0.38  # Found 2 unit axioms.
% 0.12/0.38  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.38  # 42 start rule tableaux created.
% 0.12/0.38  # 40 extension rule candidate clauses
% 0.12/0.38  # 2 unit axiom clauses
% 0.12/0.38  
% 0.12/0.38  # Requested 8, 32 cores available to the main process.
% 0.19/0.57  # Creating equality axioms
% 0.19/0.57  # Ran out of tableaux, making start rules for all clauses
% 0.19/0.57  # Creating equality axioms
% 0.19/0.57  # Ran out of tableaux, making start rules for all clauses
% 0.19/0.57  # There were 21 total branch saturation attempts.
% 0.19/0.57  # There were 0 of these attempts blocked.
% 0.19/0.57  # There were 0 deferred branch saturation attempts.
% 0.19/0.57  # There were 19 free duplicated saturations.
% 0.19/0.57  # There were 21 total successful branch saturations.
% 0.19/0.57  # There were 0 successful branch saturations in interreduction.
% 0.19/0.57  # There were 0 successful branch saturations on the branch.
% 0.19/0.57  # There were 2 successful branch saturations after the branch.
% 0.19/0.57  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.57  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.57  # Begin clausification derivation
% 0.19/0.57  
% 0.19/0.57  # End clausification derivation
% 0.19/0.57  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.57  cnf(i_0_56, plain, (cUnsatisfiable(i2003_11_14_17_19_21224))).
% 0.19/0.57  cnf(i_0_14, plain, (~cowlNothing(X1))).
% 0.19/0.57  cnf(i_0_49, plain, (~cp2(X1)|~cp1(X1))).
% 0.19/0.57  cnf(i_0_46, plain, (~cp3(X1)|~cp1(X1))).
% 0.19/0.57  cnf(i_0_48, plain, (~cp4(X1)|~cp1(X1))).
% 0.19/0.57  cnf(i_0_16, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.19/0.57  cnf(i_0_44, plain, (cp(esk1_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_47, plain, (~cp5(X1)|~cp1(X1))).
% 0.19/0.57  cnf(i_0_50, plain, (~cp3(X1)|~cp2(X1))).
% 0.19/0.57  cnf(i_0_52, plain, (~cp4(X1)|~cp2(X1))).
% 0.19/0.57  cnf(i_0_51, plain, (~cp5(X1)|~cp2(X1))).
% 0.19/0.57  cnf(i_0_54, plain, (~cp4(X1)|~cp3(X1))).
% 0.19/0.57  cnf(i_0_53, plain, (~cp5(X1)|~cp3(X1))).
% 0.19/0.57  cnf(i_0_55, plain, (~cp5(X1)|~cp4(X1))).
% 0.19/0.57  cnf(i_0_17, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.19/0.57  cnf(i_0_32, plain, (cp(esk6_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_28, plain, (cp(esk7_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_43, plain, (cp1(esk1_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_41, plain, (cp1(esk2_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_36, plain, (cp2(esk4_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_29, plain, (cp2(esk7_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_34, plain, (cp3(esk5_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_31, plain, (cp3(esk6_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_39, plain, (cp4(esk3_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_45, plain, (rr(X1,esk1_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_42, plain, (rr(X1,esk2_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_40, plain, (rr(X1,esk3_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_37, plain, (rr(X1,esk4_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_35, plain, (rr(X1,esk5_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_33, plain, (rr(X1,esk6_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_30, plain, (rr(X1,esk7_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_38, plain, (X1=X2|X1=X3|X1=X4|X2=X3|X2=X4|X3=X4|~rr(X5,X4)|~rr(X5,X3)|~rr(X5,X2)|~rr(X5,X1)|~cUnsatisfiable(X5))).
% 0.19/0.57  cnf(i_0_23, plain, (cUnsatisfiable(X1)|esk9_1(X1)!=esk8_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_22, plain, (cUnsatisfiable(X1)|esk10_1(X1)!=esk8_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_20, plain, (cUnsatisfiable(X1)|esk10_1(X1)!=esk9_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_21, plain, (cUnsatisfiable(X1)|esk11_1(X1)!=esk8_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_19, plain, (cUnsatisfiable(X1)|esk11_1(X1)!=esk9_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_18, plain, (cUnsatisfiable(X1)|esk11_1(X1)!=esk10_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_27, plain, (rr(X1,esk8_1(X1))|cUnsatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_26, plain, (rr(X1,esk9_1(X1))|cUnsatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_25, plain, (rr(X1,esk10_1(X1))|cUnsatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_24, plain, (rr(X1,esk11_1(X1))|cUnsatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_70610, plain, (X68=X68)).
% 0.19/0.57  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.57  # Begin printing tableau
% 0.19/0.57  # Found 5 steps
% 0.19/0.57  cnf(i_0_70610, plain, (i2003_11_14_17_19_21224=i2003_11_14_17_19_21224), inference(start_rule)).
% 0.19/0.57  cnf(i_0_70886, plain, (i2003_11_14_17_19_21224=i2003_11_14_17_19_21224), inference(extension_rule, [i_0_70614])).
% 0.19/0.57  cnf(i_0_71155, plain, (~cUnsatisfiable(i2003_11_14_17_19_21224)), inference(closure_rule, [i_0_56])).
% 0.19/0.57  cnf(i_0_71153, plain, (cUnsatisfiable(i2003_11_14_17_19_21224)), inference(extension_rule, [i_0_33])).
% 0.19/0.57  cnf(i_0_71160, plain, (rr(i2003_11_14_17_19_21224,esk6_1(i2003_11_14_17_19_21224))), inference(etableau_closure_rule, [i_0_71160, ...])).
% 0.19/0.57  # End printing tableau
% 0.19/0.57  # SZS output end
% 0.19/0.57  # Branches closed with saturation will be marked with an "s"
% 0.19/0.57  # There were 25 total branch saturation attempts.
% 0.19/0.57  # There were 0 of these attempts blocked.
% 0.19/0.57  # There were 0 deferred branch saturation attempts.
% 0.19/0.57  # There were 23 free duplicated saturations.
% 0.19/0.57  # There were 25 total successful branch saturations.
% 0.19/0.57  # There were 0 successful branch saturations in interreduction.
% 0.19/0.57  # There were 0 successful branch saturations on the branch.
% 0.19/0.57  # There were 2 successful branch saturations after the branch.
% 0.19/0.57  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.57  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.57  # Begin clausification derivation
% 0.19/0.57  
% 0.19/0.57  # End clausification derivation
% 0.19/0.57  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.57  cnf(i_0_56, plain, (cUnsatisfiable(i2003_11_14_17_19_21224))).
% 0.19/0.57  cnf(i_0_14, plain, (~cowlNothing(X1))).
% 0.19/0.57  cnf(i_0_49, plain, (~cp2(X1)|~cp1(X1))).
% 0.19/0.57  cnf(i_0_46, plain, (~cp3(X1)|~cp1(X1))).
% 0.19/0.57  cnf(i_0_48, plain, (~cp4(X1)|~cp1(X1))).
% 0.19/0.57  cnf(i_0_16, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.19/0.57  cnf(i_0_44, plain, (cp(esk1_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_47, plain, (~cp5(X1)|~cp1(X1))).
% 0.19/0.57  cnf(i_0_50, plain, (~cp3(X1)|~cp2(X1))).
% 0.19/0.57  cnf(i_0_52, plain, (~cp4(X1)|~cp2(X1))).
% 0.19/0.57  cnf(i_0_51, plain, (~cp5(X1)|~cp2(X1))).
% 0.19/0.57  cnf(i_0_54, plain, (~cp4(X1)|~cp3(X1))).
% 0.19/0.57  cnf(i_0_53, plain, (~cp5(X1)|~cp3(X1))).
% 0.19/0.57  cnf(i_0_55, plain, (~cp5(X1)|~cp4(X1))).
% 0.19/0.57  cnf(i_0_17, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.19/0.57  cnf(i_0_32, plain, (cp(esk6_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_28, plain, (cp(esk7_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_43, plain, (cp1(esk1_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_41, plain, (cp1(esk2_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_36, plain, (cp2(esk4_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_29, plain, (cp2(esk7_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_34, plain, (cp3(esk5_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_31, plain, (cp3(esk6_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_39, plain, (cp4(esk3_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_45, plain, (rr(X1,esk1_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_42, plain, (rr(X1,esk2_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_40, plain, (rr(X1,esk3_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_37, plain, (rr(X1,esk4_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_35, plain, (rr(X1,esk5_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_33, plain, (rr(X1,esk6_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_30, plain, (rr(X1,esk7_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.57  cnf(i_0_38, plain, (X1=X2|X1=X3|X1=X4|X2=X3|X2=X4|X3=X4|~rr(X5,X4)|~rr(X5,X3)|~rr(X5,X2)|~rr(X5,X1)|~cUnsatisfiable(X5))).
% 0.19/0.57  cnf(i_0_23, plain, (cUnsatisfiable(X1)|esk9_1(X1)!=esk8_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_22, plain, (cUnsatisfiable(X1)|esk10_1(X1)!=esk8_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_20, plain, (cUnsatisfiable(X1)|esk10_1(X1)!=esk9_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_21, plain, (cUnsatisfiable(X1)|esk11_1(X1)!=esk8_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_19, plain, (cUnsatisfiable(X1)|esk11_1(X1)!=esk9_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_18, plain, (cUnsatisfiable(X1)|esk11_1(X1)!=esk10_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_27, plain, (rr(X1,esk8_1(X1))|cUnsatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_26, plain, (rr(X1,esk9_1(X1))|cUnsatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_25, plain, (rr(X1,esk10_1(X1))|cUnsatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_24, plain, (rr(X1,esk11_1(X1))|cUnsatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~cp4(X6)|~cp3(X3)|~cp3(X4)|~cp2(X2)|~cp2(X5)|~cp1(X7)|~cp1(X8)|~cp(X2)|~cp(X3)|~cp(X8))).
% 0.19/0.57  cnf(i_0_75960, plain, (X68=X68)).
% 0.19/0.57  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.57  # Begin printing tableau
% 0.19/0.57  # Found 5 steps
% 0.19/0.57  cnf(i_0_75960, plain, (i2003_11_14_17_19_21224=i2003_11_14_17_19_21224), inference(start_rule)).
% 0.19/0.57  cnf(i_0_76236, plain, (i2003_11_14_17_19_21224=i2003_11_14_17_19_21224), inference(extension_rule, [i_0_75964])).
% 0.19/0.57  cnf(i_0_76505, plain, (~cUnsatisfiable(i2003_11_14_17_19_21224)), inference(closure_rule, [i_0_56])).
% 0.19/0.57  cnf(i_0_76503, plain, (cUnsatisfiable(i2003_11_14_17_19_21224)), inference(extension_rule, [i_0_39])).
% 0.19/0.57  cnf(i_0_76512, plain, (cp4(esk3_1(i2003_11_14_17_19_21224))), inference(etableau_closure_rule, [i_0_76512, ...])).
% 0.19/0.57  # End printing tableau
% 0.19/0.57  # SZS output end
% 0.19/0.57  # Branches closed with saturation will be marked with an "s"
% 0.19/0.57  # Child (9218) has found a proof.
% 0.19/0.57  
% 0.19/0.58  # Proof search is over...
% 0.19/0.58  # Freeing feature tree
%------------------------------------------------------------------------------