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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SEU411+1 : TPTP v8.1.0. Released v3.4.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 : n022.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 : Tue Jul 19 09:26:36 EDT 2022

% Result   : Theorem 0.19s 0.41s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU411+1 : TPTP v8.1.0. Released v3.4.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 : n022.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 : Mon Jun 20 00:54:31 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___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.12/0.37  # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.37  #
% 0.12/0.37  # Number of axioms: 69 Number of unprocessed: 69
% 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.37  # The folding up rule is enabled...
% 0.12/0.37  # Local unification is enabled...
% 0.12/0.37  # Any saturation attempts will use folding labels...
% 0.12/0.37  # 69 beginning clauses after preprocessing and clausification
% 0.12/0.37  # Creating start rules for all 19 conjectures.
% 0.12/0.37  # There are 19 start rule candidates:
% 0.12/0.37  # Found 31 unit axioms.
% 0.12/0.37  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37  # 19 start rule tableaux created.
% 0.12/0.37  # 38 extension rule candidate clauses
% 0.12/0.37  # 31 unit axiom clauses
% 0.12/0.37  
% 0.12/0.37  # Requested 8, 32 cores available to the main process.
% 0.19/0.41  # There were 1 total branch saturation attempts.
% 0.19/0.41  # There were 0 of these attempts blocked.
% 0.19/0.41  # There were 0 deferred branch saturation attempts.
% 0.19/0.41  # There were 0 free duplicated saturations.
% 0.19/0.41  # There were 1 total successful branch saturations.
% 0.19/0.41  # There were 0 successful branch saturations in interreduction.
% 0.19/0.41  # There were 0 successful branch saturations on the branch.
% 0.19/0.41  # There were 1 successful branch saturations after the branch.
% 0.19/0.41  # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.41  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.41  # Begin clausification derivation
% 0.19/0.41  
% 0.19/0.41  # End clausification derivation
% 0.19/0.41  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.41  cnf(i_0_18, negated_conjecture, (v2_orders_2(esk1_0))).
% 0.19/0.41  cnf(i_0_11, negated_conjecture, (v2_orders_2(esk2_0))).
% 0.19/0.41  cnf(i_0_17, negated_conjecture, (v3_orders_2(esk1_0))).
% 0.19/0.41  cnf(i_0_10, negated_conjecture, (v3_orders_2(esk2_0))).
% 0.19/0.41  cnf(i_0_16, negated_conjecture, (v4_orders_2(esk1_0))).
% 0.19/0.41  cnf(i_0_9, negated_conjecture, (v4_orders_2(esk2_0))).
% 0.19/0.41  cnf(i_0_15, negated_conjecture, (v1_yellow_0(esk1_0))).
% 0.19/0.41  cnf(i_0_8, negated_conjecture, (v1_yellow_0(esk2_0))).
% 0.19/0.41  cnf(i_0_14, negated_conjecture, (v1_lattice3(esk1_0))).
% 0.19/0.41  cnf(i_0_7, negated_conjecture, (v1_lattice3(esk2_0))).
% 0.19/0.41  cnf(i_0_13, negated_conjecture, (l1_orders_2(esk1_0))).
% 0.19/0.41  cnf(i_0_6, negated_conjecture, (l1_orders_2(esk2_0))).
% 0.19/0.41  cnf(i_0_44, plain, (l1_orders_2(esk7_0))).
% 0.19/0.41  cnf(i_0_48, plain, (v1_xboole_0(k1_xboole_0))).
% 0.19/0.41  cnf(i_0_50, plain, (v1_xboole_0(esk10_0))).
% 0.19/0.41  cnf(i_0_45, plain, (l1_struct_0(esk8_0))).
% 0.19/0.41  cnf(i_0_53, plain, (l1_struct_0(esk12_0))).
% 0.19/0.41  cnf(i_0_19, negated_conjecture, (~v3_struct_0(esk1_0))).
% 0.19/0.41  cnf(i_0_12, negated_conjecture, (~v3_struct_0(esk2_0))).
% 0.19/0.41  cnf(i_0_52, plain, (~v3_struct_0(esk12_0))).
% 0.19/0.41  cnf(i_0_51, plain, (~v1_xboole_0(esk11_0))).
% 0.19/0.41  cnf(i_0_73, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))).
% 0.19/0.41  cnf(i_0_40, plain, (l1_struct_0(X1)|~l1_orders_2(X1))).
% 0.19/0.41  cnf(i_0_66, plain, (k3_xboole_0(X1,k1_xboole_0)=k1_xboole_0)).
% 0.19/0.41  cnf(i_0_62, plain, (r1_tarski(X1,X1))).
% 0.19/0.41  cnf(i_0_49, plain, (k3_xboole_0(X1,X1)=X1)).
% 0.19/0.41  cnf(i_0_75, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))).
% 0.19/0.41  cnf(i_0_46, plain, (m1_subset_1(esk9_1(X1),X1))).
% 0.19/0.41  cnf(i_0_28, plain, (X1=k1_xboole_0|r2_hidden(esk5_1(X1),X1))).
% 0.19/0.41  cnf(i_0_29, plain, (X1!=k1_xboole_0|~r2_hidden(X2,X1))).
% 0.19/0.41  cnf(i_0_21, plain, (k3_xboole_0(X1,X2)=k3_xboole_0(X2,X1))).
% 0.19/0.41  cnf(i_0_47, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(u1_struct_0(X1)))).
% 0.19/0.41  cnf(i_0_54, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(esk13_1(X1)))).
% 0.19/0.41  cnf(i_0_74, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))).
% 0.19/0.41  cnf(i_0_1, negated_conjecture, (~r2_hidden(k3_yellow_0(esk2_0),u1_struct_0(esk1_0)))).
% 0.19/0.41  cnf(i_0_39, plain, (m1_subset_1(k3_yellow_0(X1),u1_struct_0(X1))|~l1_orders_2(X1))).
% 0.19/0.41  cnf(i_0_65, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))).
% 0.19/0.41  cnf(i_0_67, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))).
% 0.19/0.41  cnf(i_0_58, plain, (v3_struct_0(X1)|~v2_orders_2(X1)|~v3_orders_2(X1)|~l1_orders_2(X1)|~v1_xboole_0(esk14_1(X1)))).
% 0.19/0.41  cnf(i_0_68, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))).
% 0.19/0.41  cnf(i_0_20, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))).
% 0.19/0.41  cnf(i_0_57, plain, (v3_struct_0(X1)|v1_waybel_0(esk14_1(X1),X1)|~v2_orders_2(X1)|~v3_orders_2(X1)|~l1_orders_2(X1))).
% 0.19/0.41  cnf(i_0_56, plain, (v3_struct_0(X1)|v12_waybel_0(esk14_1(X1),X1)|~v2_orders_2(X1)|~v3_orders_2(X1)|~l1_orders_2(X1))).
% 0.19/0.41  cnf(i_0_69, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))).
% 0.19/0.41  cnf(i_0_55, plain, (v3_struct_0(X1)|m1_subset_1(esk13_1(X1),k1_zfmisc_1(u1_struct_0(X1)))|~l1_struct_0(X1))).
% 0.19/0.41  cnf(i_0_4, negated_conjecture, (v1_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0))).
% 0.19/0.41  cnf(i_0_3, negated_conjecture, (v12_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0))).
% 0.19/0.41  cnf(i_0_34, plain, (r2_hidden(X1,X2)|X3!=k3_xboole_0(X4,X2)|~r2_hidden(X1,X3))).
% 0.19/0.41  cnf(i_0_35, plain, (r2_hidden(X1,X2)|X3!=k3_xboole_0(X2,X4)|~r2_hidden(X1,X3))).
% 0.19/0.41  cnf(i_0_72, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.19/0.41  cnf(i_0_2, negated_conjecture, (m1_subset_1(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),k1_zfmisc_1(u1_struct_0(esk2_0))))).
% 0.19/0.41  cnf(i_0_59, plain, (v3_struct_0(X1)|m1_subset_1(esk14_1(X1),k1_zfmisc_1(u1_struct_0(X1)))|~v2_orders_2(X1)|~v3_orders_2(X1)|~l1_orders_2(X1))).
% 0.19/0.41  cnf(i_0_5, negated_conjecture, (~v1_xboole_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0))))).
% 0.19/0.41  cnf(i_0_71, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.19/0.41  cnf(i_0_33, plain, (r2_hidden(X1,X4)|X4!=k3_xboole_0(X2,X3)|~r2_hidden(X1,X3)|~r2_hidden(X1,X2))).
% 0.19/0.41  cnf(i_0_24, plain, (v12_waybel_0(X2,X1)|r2_hidden(esk3_2(X1,X2),X2)|~l1_orders_2(X1)|~m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))))).
% 0.19/0.41  cnf(i_0_70, plain, (v3_struct_0(X1)|r1_orders_2(X1,k3_yellow_0(X1),X2)|~v4_orders_2(X1)|~v1_yellow_0(X1)|~l1_orders_2(X1)|~m1_subset_1(X2,u1_struct_0(X1)))).
% 0.19/0.41  cnf(i_0_26, plain, (v12_waybel_0(X2,X1)|m1_subset_1(esk3_2(X1,X2),u1_struct_0(X1))|~l1_orders_2(X1)|~m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))))).
% 0.19/0.41  cnf(i_0_25, plain, (v12_waybel_0(X2,X1)|m1_subset_1(esk4_2(X1,X2),u1_struct_0(X1))|~l1_orders_2(X1)|~m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))))).
% 0.19/0.41  cnf(i_0_22, plain, (v12_waybel_0(X2,X1)|~l1_orders_2(X1)|~r2_hidden(esk4_2(X1,X2),X2)|~m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))))).
% 0.19/0.41  cnf(i_0_63, plain, (v3_struct_0(X1)|r3_orders_2(X1,X2,X2)|~v2_orders_2(X1)|~l1_orders_2(X1)|~m1_subset_1(X3,u1_struct_0(X1))|~m1_subset_1(X2,u1_struct_0(X1)))).
% 0.19/0.41  cnf(i_0_64, plain, (v3_struct_0(X2)|v3_struct_0(X1)|m1_subset_1(X3,u1_struct_0(X2))|~l1_orders_2(X2)|~l1_orders_2(X1)|~r2_hidden(X3,k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2))))).
% 0.19/0.41  cnf(i_0_23, plain, (v12_waybel_0(X2,X1)|r1_orders_2(X1,esk4_2(X1,X2),esk3_2(X1,X2))|~l1_orders_2(X1)|~m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))))).
% 0.19/0.41  cnf(i_0_61, plain, (v3_struct_0(X1)|r1_orders_2(X1,X2,X3)|~v2_orders_2(X1)|~l1_orders_2(X1)|~r3_orders_2(X1,X2,X3)|~m1_subset_1(X3,u1_struct_0(X1))|~m1_subset_1(X2,u1_struct_0(X1)))).
% 0.19/0.41  cnf(i_0_60, plain, (v3_struct_0(X1)|r3_orders_2(X1,X2,X3)|~v2_orders_2(X1)|~l1_orders_2(X1)|~r1_orders_2(X1,X2,X3)|~m1_subset_1(X3,u1_struct_0(X1))|~m1_subset_1(X2,u1_struct_0(X1)))).
% 0.19/0.41  cnf(i_0_30, plain, (X3=k3_xboole_0(X1,X2)|r2_hidden(esk6_3(X1,X2,X3),X3)|r2_hidden(esk6_3(X1,X2,X3),X2))).
% 0.19/0.41  cnf(i_0_31, plain, (X3=k3_xboole_0(X1,X2)|r2_hidden(esk6_3(X1,X2,X3),X3)|r2_hidden(esk6_3(X1,X2,X3),X1))).
% 0.19/0.41  cnf(i_0_27, plain, (r2_hidden(X4,X1)|~l1_orders_2(X2)|~v12_waybel_0(X1,X2)|~r2_hidden(X3,X1)|~r1_orders_2(X2,X4,X3)|~m1_subset_1(X4,u1_struct_0(X2))|~m1_subset_1(X3,u1_struct_0(X2))|~m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2))))).
% 0.19/0.41  cnf(i_0_32, plain, (X3=k3_xboole_0(X1,X2)|~r2_hidden(esk6_3(X1,X2,X3),X3)|~r2_hidden(esk6_3(X1,X2,X3),X2)|~r2_hidden(esk6_3(X1,X2,X3),X1))).
% 0.19/0.41  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.41  # Begin printing tableau
% 0.19/0.41  # Found 5 steps
% 0.19/0.41  cnf(i_0_6, negated_conjecture, (l1_orders_2(esk2_0)), inference(start_rule)).
% 0.19/0.41  cnf(i_0_83, plain, (l1_orders_2(esk2_0)), inference(extension_rule, [i_0_40])).
% 0.19/0.41  cnf(i_0_97, plain, (l1_struct_0(esk2_0)), inference(extension_rule, [i_0_47])).
% 0.19/0.41  cnf(i_0_108, plain, (v3_struct_0(esk2_0)), inference(closure_rule, [i_0_12])).
% 0.19/0.41  cnf(i_0_110, plain, (~v1_xboole_0(u1_struct_0(esk2_0))), inference(etableau_closure_rule, [i_0_110, ...])).
% 0.19/0.41  # End printing tableau
% 0.19/0.41  # SZS output end
% 0.19/0.41  # Branches closed with saturation will be marked with an "s"
% 0.19/0.41  # There were 1 total branch saturation attempts.
% 0.19/0.41  # There were 0 of these attempts blocked.
% 0.19/0.41  # There were 0 deferred branch saturation attempts.
% 0.19/0.41  # There were 0 free duplicated saturations.
% 0.19/0.41  # There were 1 total successful branch saturations.
% 0.19/0.41  # There were 0 successful branch saturations in interreduction.
% 0.19/0.41  # There were 0 successful branch saturations on the branch.
% 0.19/0.41  # There were 1 successful branch saturations after the branch.
% 0.19/0.41  # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.41  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.41  # Begin clausification derivation
% 0.19/0.41  
% 0.19/0.41  # End clausification derivation
% 0.19/0.41  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.41  cnf(i_0_18, negated_conjecture, (v2_orders_2(esk1_0))).
% 0.19/0.41  cnf(i_0_11, negated_conjecture, (v2_orders_2(esk2_0))).
% 0.19/0.41  cnf(i_0_17, negated_conjecture, (v3_orders_2(esk1_0))).
% 0.19/0.41  cnf(i_0_10, negated_conjecture, (v3_orders_2(esk2_0))).
% 0.19/0.41  cnf(i_0_16, negated_conjecture, (v4_orders_2(esk1_0))).
% 0.19/0.41  cnf(i_0_9, negated_conjecture, (v4_orders_2(esk2_0))).
% 0.19/0.41  cnf(i_0_15, negated_conjecture, (v1_yellow_0(esk1_0))).
% 0.19/0.41  cnf(i_0_8, negated_conjecture, (v1_yellow_0(esk2_0))).
% 0.19/0.41  cnf(i_0_14, negated_conjecture, (v1_lattice3(esk1_0))).
% 0.19/0.41  cnf(i_0_7, negated_conjecture, (v1_lattice3(esk2_0))).
% 0.19/0.41  cnf(i_0_13, negated_conjecture, (l1_orders_2(esk1_0))).
% 0.19/0.41  cnf(i_0_6, negated_conjecture, (l1_orders_2(esk2_0))).
% 0.19/0.41  cnf(i_0_44, plain, (l1_orders_2(esk7_0))).
% 0.19/0.41  cnf(i_0_48, plain, (v1_xboole_0(k1_xboole_0))).
% 0.19/0.41  cnf(i_0_50, plain, (v1_xboole_0(esk10_0))).
% 0.19/0.41  cnf(i_0_45, plain, (l1_struct_0(esk8_0))).
% 0.19/0.41  cnf(i_0_53, plain, (l1_struct_0(esk12_0))).
% 0.19/0.41  cnf(i_0_19, negated_conjecture, (~v3_struct_0(esk1_0))).
% 0.19/0.41  cnf(i_0_12, negated_conjecture, (~v3_struct_0(esk2_0))).
% 0.19/0.41  cnf(i_0_52, plain, (~v3_struct_0(esk12_0))).
% 0.19/0.41  cnf(i_0_51, plain, (~v1_xboole_0(esk11_0))).
% 0.19/0.41  cnf(i_0_73, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))).
% 0.19/0.41  cnf(i_0_40, plain, (l1_struct_0(X1)|~l1_orders_2(X1))).
% 0.19/0.41  cnf(i_0_66, plain, (k3_xboole_0(X1,k1_xboole_0)=k1_xboole_0)).
% 0.19/0.41  cnf(i_0_62, plain, (r1_tarski(X1,X1))).
% 0.19/0.41  cnf(i_0_49, plain, (k3_xboole_0(X1,X1)=X1)).
% 0.19/0.41  cnf(i_0_75, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))).
% 0.19/0.41  cnf(i_0_46, plain, (m1_subset_1(esk9_1(X1),X1))).
% 0.19/0.41  cnf(i_0_28, plain, (X1=k1_xboole_0|r2_hidden(esk5_1(X1),X1))).
% 0.19/0.41  cnf(i_0_29, plain, (X1!=k1_xboole_0|~r2_hidden(X2,X1))).
% 0.19/0.41  cnf(i_0_21, plain, (k3_xboole_0(X1,X2)=k3_xboole_0(X2,X1))).
% 0.19/0.41  cnf(i_0_47, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(u1_struct_0(X1)))).
% 0.19/0.41  cnf(i_0_54, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(esk13_1(X1)))).
% 0.19/0.41  cnf(i_0_74, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))).
% 0.19/0.41  cnf(i_0_1, negated_conjecture, (~r2_hidden(k3_yellow_0(esk2_0),u1_struct_0(esk1_0)))).
% 0.19/0.41  cnf(i_0_39, plain, (m1_subset_1(k3_yellow_0(X1),u1_struct_0(X1))|~l1_orders_2(X1))).
% 0.19/0.41  cnf(i_0_65, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))).
% 0.19/0.41  cnf(i_0_67, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))).
% 0.19/0.41  cnf(i_0_58, plain, (v3_struct_0(X1)|~v2_orders_2(X1)|~v3_orders_2(X1)|~l1_orders_2(X1)|~v1_xboole_0(esk14_1(X1)))).
% 0.19/0.41  cnf(i_0_68, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))).
% 0.19/0.41  cnf(i_0_20, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))).
% 0.19/0.41  cnf(i_0_57, plain, (v3_struct_0(X1)|v1_waybel_0(esk14_1(X1),X1)|~v2_orders_2(X1)|~v3_orders_2(X1)|~l1_orders_2(X1))).
% 0.19/0.41  cnf(i_0_56, plain, (v3_struct_0(X1)|v12_waybel_0(esk14_1(X1),X1)|~v2_orders_2(X1)|~v3_orders_2(X1)|~l1_orders_2(X1))).
% 0.19/0.41  cnf(i_0_69, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))).
% 0.19/0.41  cnf(i_0_55, plain, (v3_struct_0(X1)|m1_subset_1(esk13_1(X1),k1_zfmisc_1(u1_struct_0(X1)))|~l1_struct_0(X1))).
% 0.19/0.41  cnf(i_0_4, negated_conjecture, (v1_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0))).
% 0.19/0.41  cnf(i_0_3, negated_conjecture, (v12_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0))).
% 0.19/0.41  cnf(i_0_34, plain, (r2_hidden(X1,X2)|X3!=k3_xboole_0(X4,X2)|~r2_hidden(X1,X3))).
% 0.19/0.41  cnf(i_0_35, plain, (r2_hidden(X1,X2)|X3!=k3_xboole_0(X2,X4)|~r2_hidden(X1,X3))).
% 0.19/0.41  cnf(i_0_72, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.19/0.41  cnf(i_0_2, negated_conjecture, (m1_subset_1(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),k1_zfmisc_1(u1_struct_0(esk2_0))))).
% 0.19/0.41  cnf(i_0_59, plain, (v3_struct_0(X1)|m1_subset_1(esk14_1(X1),k1_zfmisc_1(u1_struct_0(X1)))|~v2_orders_2(X1)|~v3_orders_2(X1)|~l1_orders_2(X1))).
% 0.19/0.41  cnf(i_0_5, negated_conjecture, (~v1_xboole_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0))))).
% 0.19/0.41  cnf(i_0_71, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.19/0.41  cnf(i_0_33, plain, (r2_hidden(X1,X4)|X4!=k3_xboole_0(X2,X3)|~r2_hidden(X1,X3)|~r2_hidden(X1,X2))).
% 0.19/0.41  cnf(i_0_24, plain, (v12_waybel_0(X2,X1)|r2_hidden(esk3_2(X1,X2),X2)|~l1_orders_2(X1)|~m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))))).
% 0.19/0.41  cnf(i_0_70, plain, (v3_struct_0(X1)|r1_orders_2(X1,k3_yellow_0(X1),X2)|~v4_orders_2(X1)|~v1_yellow_0(X1)|~l1_orders_2(X1)|~m1_subset_1(X2,u1_struct_0(X1)))).
% 0.19/0.41  cnf(i_0_26, plain, (v12_waybel_0(X2,X1)|m1_subset_1(esk3_2(X1,X2),u1_struct_0(X1))|~l1_orders_2(X1)|~m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))))).
% 0.19/0.41  cnf(i_0_25, plain, (v12_waybel_0(X2,X1)|m1_subset_1(esk4_2(X1,X2),u1_struct_0(X1))|~l1_orders_2(X1)|~m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))))).
% 0.19/0.41  cnf(i_0_22, plain, (v12_waybel_0(X2,X1)|~l1_orders_2(X1)|~r2_hidden(esk4_2(X1,X2),X2)|~m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))))).
% 0.19/0.41  cnf(i_0_63, plain, (v3_struct_0(X1)|r3_orders_2(X1,X2,X2)|~v2_orders_2(X1)|~l1_orders_2(X1)|~m1_subset_1(X3,u1_struct_0(X1))|~m1_subset_1(X2,u1_struct_0(X1)))).
% 0.19/0.41  cnf(i_0_64, plain, (v3_struct_0(X2)|v3_struct_0(X1)|m1_subset_1(X3,u1_struct_0(X2))|~l1_orders_2(X2)|~l1_orders_2(X1)|~r2_hidden(X3,k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2))))).
% 0.19/0.41  cnf(i_0_23, plain, (v12_waybel_0(X2,X1)|r1_orders_2(X1,esk4_2(X1,X2),esk3_2(X1,X2))|~l1_orders_2(X1)|~m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))))).
% 0.19/0.41  cnf(i_0_61, plain, (v3_struct_0(X1)|r1_orders_2(X1,X2,X3)|~v2_orders_2(X1)|~l1_orders_2(X1)|~r3_orders_2(X1,X2,X3)|~m1_subset_1(X3,u1_struct_0(X1))|~m1_subset_1(X2,u1_struct_0(X1)))).
% 0.19/0.41  cnf(i_0_60, plain, (v3_struct_0(X1)|r3_orders_2(X1,X2,X3)|~v2_orders_2(X1)|~l1_orders_2(X1)|~r1_orders_2(X1,X2,X3)|~m1_subset_1(X3,u1_struct_0(X1))|~m1_subset_1(X2,u1_struct_0(X1)))).
% 0.19/0.41  cnf(i_0_30, plain, (X3=k3_xboole_0(X1,X2)|r2_hidden(esk6_3(X1,X2,X3),X3)|r2_hidden(esk6_3(X1,X2,X3),X2))).
% 0.19/0.41  cnf(i_0_31, plain, (X3=k3_xboole_0(X1,X2)|r2_hidden(esk6_3(X1,X2,X3),X3)|r2_hidden(esk6_3(X1,X2,X3),X1))).
% 0.19/0.41  cnf(i_0_27, plain, (r2_hidden(X4,X1)|~l1_orders_2(X2)|~v12_waybel_0(X1,X2)|~r2_hidden(X3,X1)|~r1_orders_2(X2,X4,X3)|~m1_subset_1(X4,u1_struct_0(X2))|~m1_subset_1(X3,u1_struct_0(X2))|~m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2))))).
% 0.19/0.41  cnf(i_0_32, plain, (X3=k3_xboole_0(X1,X2)|~r2_hidden(esk6_3(X1,X2,X3),X3)|~r2_hidden(esk6_3(X1,X2,X3),X2)|~r2_hidden(esk6_3(X1,X2,X3),X1))).
% 0.19/0.41  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.41  # Begin printing tableau
% 0.19/0.41  # Found 7 steps
% 0.19/0.41  cnf(i_0_19, negated_conjecture, (~v3_struct_0(esk1_0)), inference(start_rule)).
% 0.19/0.41  cnf(i_0_82, plain, (~v3_struct_0(esk1_0)), inference(extension_rule, [i_0_47])).
% 0.19/0.41  cnf(i_0_107, plain, (~l1_struct_0(esk1_0)), inference(extension_rule, [i_0_40])).
% 0.19/0.41  cnf(i_0_112, plain, (~l1_orders_2(esk1_0)), inference(closure_rule, [i_0_13])).
% 0.19/0.41  cnf(i_0_108, plain, (~v1_xboole_0(u1_struct_0(esk1_0))), inference(extension_rule, [i_0_67])).
% 0.19/0.41  cnf(i_0_132, plain, (r2_hidden(k3_yellow_0(esk2_0),u1_struct_0(esk1_0))), inference(closure_rule, [i_0_1])).
% 0.19/0.41  cnf(i_0_133, plain, (~m1_subset_1(k3_yellow_0(esk2_0),u1_struct_0(esk1_0))), inference(etableau_closure_rule, [i_0_133, ...])).
% 0.19/0.41  # End printing tableau
% 0.19/0.41  # SZS output end
% 0.19/0.41  # Branches closed with saturation will be marked with an "s"
% 0.19/0.41  # Child (14503) has found a proof.
% 0.19/0.41  
% 0.19/0.41  # Proof search is over...
% 0.19/0.41  # Freeing feature tree
%------------------------------------------------------------------------------