↑ Up

Etableau---0.67.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SEU408+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 : n028.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:34 EDT 2022

% Result   : Theorem 0.13s 0.37s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SEU408+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33  % Computer : n028.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sun Jun 19 00:27:14 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.36  # No SInE strategy applied
% 0.13/0.36  # Auto-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 0.13/0.36  # and selection function SelectMaxLComplexAvoidPosPred.
% 0.13/0.36  #
% 0.13/0.36  # Number of axioms: 72 Number of unprocessed: 72
% 0.13/0.36  # Tableaux proof search.
% 0.13/0.36  # APR header successfully linked.
% 0.13/0.36  # Hello from C++
% 0.13/0.36  # The folding up rule is enabled...
% 0.13/0.36  # Local unification is enabled...
% 0.13/0.36  # Any saturation attempts will use folding labels...
% 0.13/0.36  # 72 beginning clauses after preprocessing and clausification
% 0.13/0.36  # Creating start rules for all 14 conjectures.
% 0.13/0.36  # There are 14 start rule candidates:
% 0.13/0.36  # Found 28 unit axioms.
% 0.13/0.36  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.36  # 14 start rule tableaux created.
% 0.13/0.36  # 44 extension rule candidate clauses
% 0.13/0.36  # 28 unit axiom clauses
% 0.13/0.36  
% 0.13/0.36  # Requested 8, 32 cores available to the main process.
% 0.13/0.37  # There were 1 total branch saturation attempts.
% 0.13/0.37  # There were 0 of these attempts blocked.
% 0.13/0.37  # There were 0 deferred branch saturation attempts.
% 0.13/0.37  # There were 0 free duplicated saturations.
% 0.13/0.37  # There were 1 total successful branch saturations.
% 0.13/0.37  # There were 0 successful branch saturations in interreduction.
% 0.13/0.37  # There were 0 successful branch saturations on the branch.
% 0.13/0.37  # There were 1 successful branch saturations after the branch.
% 0.13/0.37  # There were 1 total branch saturation attempts.
% 0.13/0.37  # There were 0 of these attempts blocked.
% 0.13/0.37  # There were 0 deferred branch saturation attempts.
% 0.13/0.37  # There were 0 free duplicated saturations.
% 0.13/0.37  # There were 1 total successful branch saturations.
% 0.13/0.37  # There were 0 successful branch saturations in interreduction.
% 0.13/0.37  # There were 0 successful branch saturations on the branch.
% 0.13/0.37  # There were 1 successful branch saturations after the branch.
% 0.13/0.37  # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # Begin clausification derivation
% 0.13/0.37  
% 0.13/0.37  # End clausification derivation
% 0.13/0.37  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37  cnf(i_0_13, negated_conjecture, (v2_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_7, negated_conjecture, (v2_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_12, negated_conjecture, (v3_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_6, negated_conjecture, (v3_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_11, negated_conjecture, (v4_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_5, negated_conjecture, (v4_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_10, negated_conjecture, (v1_lattice3(esk1_0))).
% 0.13/0.37  cnf(i_0_4, negated_conjecture, (v1_lattice3(esk2_0))).
% 0.13/0.37  cnf(i_0_9, negated_conjecture, (l1_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_3, negated_conjecture, (l1_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_45, plain, (l1_orders_2(esk5_0))).
% 0.13/0.37  cnf(i_0_46, plain, (l1_struct_0(esk6_0))).
% 0.13/0.37  cnf(i_0_64, plain, (l1_struct_0(esk12_0))).
% 0.13/0.37  cnf(i_0_53, plain, (v1_xboole_0(k1_xboole_0))).
% 0.13/0.37  cnf(i_0_61, plain, (v1_xboole_0(esk10_0))).
% 0.13/0.37  cnf(i_0_14, negated_conjecture, (~v3_struct_0(esk1_0))).
% 0.13/0.37  cnf(i_0_8, negated_conjecture, (~v3_struct_0(esk2_0))).
% 0.13/0.37  cnf(i_0_63, plain, (~v3_struct_0(esk12_0))).
% 0.13/0.37  cnf(i_0_62, plain, (~v1_xboole_0(esk11_0))).
% 0.13/0.37  cnf(i_0_78, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))).
% 0.13/0.37  cnf(i_0_38, plain, (l1_struct_0(X1)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_71, plain, (k2_xboole_0(X1,k1_xboole_0)=X1)).
% 0.13/0.37  cnf(i_0_70, plain, (r1_tarski(X1,X1))).
% 0.13/0.37  cnf(i_0_60, plain, (k2_xboole_0(X1,X1)=X1)).
% 0.13/0.37  cnf(i_0_2, negated_conjecture, (r2_hidden(esk3_0,u1_struct_0(esk2_0)))).
% 0.13/0.37  cnf(i_0_80, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))).
% 0.13/0.37  cnf(i_0_48, plain, (m1_subset_1(esk8_1(X1),X1))).
% 0.13/0.37  cnf(i_0_18, plain, (k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1))).
% 0.13/0.37  cnf(i_0_52, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(u1_struct_0(X1)))).
% 0.13/0.37  cnf(i_0_65, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(esk13_1(X1)))).
% 0.13/0.37  cnf(i_0_79, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_72, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_73, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))).
% 0.13/0.37  cnf(i_0_15, plain, (g1_orders_2(u1_struct_0(X1),u1_orders_2(X1))=X1|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_74, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))).
% 0.13/0.37  cnf(i_0_30, plain, (l1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_31, plain, (v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_36, plain, (v1_relat_1(k5_relat_1(X1,X2))|~v1_relat_1(X2)|~v1_relat_1(X1))).
% 0.13/0.37  cnf(i_0_16, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_75, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))).
% 0.13/0.37  cnf(i_0_50, plain, (v3_struct_0(X2)|v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_54, plain, (v3_struct_0(X1)|v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_66, plain, (v3_struct_0(X1)|m1_subset_1(esk13_1(X1),k1_zfmisc_1(u1_struct_0(X1)))|~l1_struct_0(X1))).
% 0.13/0.37  cnf(i_0_57, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X2,X1)))).
% 0.13/0.37  cnf(i_0_56, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X1,X2)))).
% 0.13/0.37  cnf(i_0_25, plain, (r2_hidden(X1,X3)|X3!=k2_xboole_0(X4,X2)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_26, plain, (r2_hidden(X1,X3)|X3!=k2_xboole_0(X2,X4)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_77, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.13/0.37  cnf(i_0_51, plain, (v3_struct_0(X2)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v3_struct_0(k1_latsum_1(X1,X2)))).
% 0.13/0.37  cnf(i_0_55, plain, (v3_struct_0(X1)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v3_struct_0(k1_latsum_1(X1,X2)))).
% 0.13/0.37  cnf(i_0_76, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.13/0.37  cnf(i_0_27, plain, (r2_hidden(X1,X4)|r2_hidden(X1,X3)|X2!=k2_xboole_0(X3,X4)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_43, plain, (m2_relset_1(u1_orders_2(X1),u1_struct_0(X1),u1_struct_0(X1))|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_47, plain, (m1_relset_1(esk7_2(X1,X2),X1,X2))).
% 0.13/0.37  cnf(i_0_49, plain, (m2_relset_1(esk9_2(X1,X2),X1,X2))).
% 0.13/0.37  cnf(i_0_21, plain, (u1_struct_0(X1)=k2_xboole_0(u1_struct_0(X2),u1_s# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # Begin clausification derivation
% 0.13/0.37  
% 0.13/0.37  # End clausification derivation
% 0.13/0.37  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37  cnf(i_0_13, negated_conjecture, (v2_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_7, negated_conjecture, (v2_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_12, negated_conjecture, (v3_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_6, negated_conjecture, (v3_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_11, negated_conjecture, (v4_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_5, negated_conjecture, (v4_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_10, negated_conjecture, (v1_lattice3(esk1_0))).
% 0.13/0.37  cnf(i_0_4, negated_conjecture, (v1_lattice3(esk2_0))).
% 0.13/0.37  cnf(i_0_9, negated_conjecture, (l1_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_3, negated_conjecture, (l1_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_45, plain, (l1_orders_2(esk5_0))).
% 0.13/0.37  cnf(i_0_46, plain, (l1_struct_0(esk6_0))).
% 0.13/0.37  cnf(i_0_64, plain, (l1_struct_0(esk12_0))).
% 0.13/0.37  cnf(i_0_53, plain, (v1_xboole_0(k1_xboole_0))).
% 0.13/0.37  cnf(i_0_61, plain, (v1_xboole_0(esk10_0))).
% 0.13/0.37  cnf(i_0_14, negated_conjecture, (~v3_struct_0(esk1_0))).
% 0.13/0.37  cnf(i_0_8, negated_conjecture, (~v3_struct_0(esk2_0))).
% 0.13/0.37  cnf(i_0_63, plain, (~v3_struct_0(esk12_0))).
% 0.13/0.37  cnf(i_0_62, plain, (~v1_xboole_0(esk11_0))).
% 0.13/0.37  cnf(i_0_78, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))).
% 0.13/0.37  cnf(i_0_38, plain, (l1_struct_0(X1)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_71, plain, (k2_xboole_0(X1,k1_xboole_0)=X1)).
% 0.13/0.37  cnf(i_0_70, plain, (r1_tarski(X1,X1))).
% 0.13/0.37  cnf(i_0_60, plain, (k2_xboole_0(X1,X1)=X1)).
% 0.13/0.37  cnf(i_0_2, negated_conjecture, (r2_hidden(esk3_0,u1_struct_0(esk2_0)))).
% 0.13/0.37  cnf(i_0_80, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))).
% 0.13/0.37  cnf(i_0_48, plain, (m1_subset_1(esk8_1(X1),X1))).
% 0.13/0.37  cnf(i_0_18, plain, (k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1))).
% 0.13/0.37  cnf(i_0_52, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(u1_struct_0(X1)))).
% 0.13/0.37  cnf(i_0_65, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(esk13_1(X1)))).
% 0.13/0.37  cnf(i_0_79, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_72, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_73, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))).
% 0.13/0.37  cnf(i_0_15, plain, (g1_orders_2(u1_struct_0(X1),u1_orders_2(X1))=X1|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_74, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))).
% 0.13/0.37  cnf(i_0_30, plain, (l1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_31, plain, (v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_36, plain, (v1_relat_1(k5_relat_1(X1,X2))|~v1_relat_1(X2)|~v1_relat_1(X1))).
% 0.13/0.37  cnf(i_0_16, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_75, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))).
% 0.13/0.37  cnf(i_0_50, plain, (v3_struct_0(X2)|v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_54, plain, (v3_struct_0(X1)|v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_66, plain, (v3_struct_0(X1)|m1_subset_1(esk13_1(X1),k1_zfmisc_1(u1_struct_0(X1)))|~l1_struct_0(X1))).
% 0.13/0.37  cnf(i_0_57, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X2,X1)))).
% 0.13/0.37  cnf(i_0_56, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X1,X2)))).
% 0.13/0.37  cnf(i_0_25, plain, (r2_hidden(X1,X3)|X3!=k2_xboole_0(X4,X2)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_26, plain, (r2_hidden(X1,X3)|X3!=k2_xboole_0(X2,X4)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_77, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.13/0.37  cnf(i_0_51, plain, (v3_struct_0(X2)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v3_struct_0(k1_latsum_1(X1,X2)))).
% 0.13/0.37  cnf(i_0_55, plain, (v3_struct_0(X1)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v3_struct_0(k1_latsum_1(X1,X2)))).
% 0.13/0.37  cnf(i_0_76, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.13/0.37  cnf(i_0_27, plain, (r2_hidden(X1,X4)|r2_hidden(X1,X3)|X2!=k2_xboole_0(X3,X4)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_43, plain, (m2_relset_1(u1_orders_2(X1),u1_struct_0(X1),u1_struct_0(X1))|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_47, plain, (m1_relset_1(esk7_2(X1,X2),X1,X2))).
% 0.13/0.37  cnf(i_0_49, plain, (m2_relset_1(esk9_2(X1,X2),X1,X2))).
% 0.13/0.37  cnf(i_0_21, plain, (u1_struct_0(X1)=k2_xboole_0(u1_struct_0(X2),u1_struct_0(X3))|X1!=k1_latsum_1(X2,X3)|~l1_orders_2(X3)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_1, negated_conjecture, (~m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))))).
% 0.13/0.37  cnf(i_0_28, plain, (l1_orders_2(g1_orders_2(X1,X2))|~m1_relset_1(X2,X1,X1))).
% 0.13/0.37  cnf(i_0_29, plain, (v1_orders_2(g1_orders_2(X1,X2))|~m1_relset_1(X2,X1,X1))).
% 0.13/0.37  cnf(i_0_17, plain, (v1_relat_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))).
% 0.13/0.37  cnf(i_0_58, plain, (X1=X2|g1_orders_2(X3,X1)!=g1_orders_2(X4,X2)|~m1_relset_1(X1,X3,X3))).
% 0.13/0.37  cnf(i_0_59, plain, (X1=X2|g1_orders_2(X1,X3)!=g1_orders_2(X2,X4)|~m1_relset_1(X3,X1,X1))).
% 0.13/0.37  cnf(i_0_69, plain, (m1_relset_1(X1,X2,X3)|~m2_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_68, plain, (m2_relset_1(X1,X2,X3)|~m1_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_42, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m2_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_22, plain, (X3=k2_xboole_0(X1,X2)|r2_hidden(esk4_3(X1,X2,X3),X3)|r2_hidden(esk4_3(X1,X2,X3),X2)|r2_hidden(esk4_3(X1,X2,X3),X1))).
% 0.13/0.37  cnf(i_0_23, plain, (X3=k2_xboole_0(X1,X2)|~r2_hidden(esk4_3(X1,X2,X3),X3)|~r2_hidden(esk4_3(X1,X2,X3),X2))).
% 0.13/0.37  cnf(i_0_24, plain, (X3=k2_xboole_0(X1,X2)|~r2_hidden(esk4_3(X1,X2,X3),X3)|~r2_hidden(esk4_3(X1,X2,X3),X1))).
% 0.13/0.37  cnf(i_0_67, plain, (k7_relset_1(X2,X3,X5,X6,X1,X4)=k5_relat_1(X1,X4)|~m1_relset_1(X4,X5,X6)|~m1_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_20, plain, (u1_orders_2(X1)=k2_xboole_0(k2_xboole_0(u1_orders_2(X2),u1_orders_2(X3)),k7_relset_1(u1_struct_0(X2),u1_struct_0(X2),u1_struct_0(X3),u1_struct_0(X3),u1_orders_2(X2),u1_orders_2(X3)))|X1!=k1_latsum_1(X2,X3)|~l1_orders_2(X3)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_37, plain, (m2_relset_1(k7_relset_1(X2,X3,X5,X6,X1,X4),X2,X6)|~m1_relset_1(X4,X5,X6)|~m1_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_19, plain, (X1=k1_latsum_1(X2,X3)|u1_struct_0(X1)!=k2_xboole_0(u1_struct_0(X2),u1_struct_0(X3))|u1_orders_2(X1)!=k2_xboole_0(k2_xboole_0(u1_orders_2(X2),u1_orders_2(X3)),k7_relset_1(u1_struct_0(X2),u1_struct_0(X2),u1_struct_0(X3),u1_struct_0(X3),u1_orders_2(X2),u1_orders_2(X3)))|~l1_orders_2(X3)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.37  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.37  # Begin printing tableau
% 0.13/0.37  # Found 5 steps
% 0.13/0.37  cnf(i_0_2, negated_conjecture, (r2_hidden(esk3_0,u1_struct_0(esk2_0))), inference(start_rule)).
% 0.13/0.37  cnf(i_0_82, plain, (r2_hidden(esk3_0,u1_struct_0(esk2_0))), inference(extension_rule, [i_0_79])).
% 0.13/0.37  cnf(i_0_108, plain, (~v1_xboole_0(u1_struct_0(esk2_0))), inference(extension_rule, [i_0_73])).
% 0.13/0.37  cnf(i_0_127, plain, (~m1_subset_1(esk8_1(u1_struct_0(esk2_0)),u1_struct_0(esk2_0))), inference(closure_rule, [i_0_48])).
% 0.13/0.37  cnf(i_0_126, plain, (r2_hidden(esk8_1(u1_struct_0(esk2_0)),u1_struct_0(esk2_0))), inference(etableau_closure_rule, [i_0_126, ...])).
% 0.13/0.37  # End printing tableau
% 0.13/0.37  # SZS output end
% 0.13/0.37  # Branches closed with saturation will be marked with an "s"
% 0.13/0.37  # There were 1 total branch saturation attempts.
% 0.13/0.37  # There were 0 of these attempts blocked.
% 0.13/0.37  # There were 0 deferred branch saturation attempts.
% 0.13/0.37  # There were 0 free duplicated saturations.
% 0.13/0.37  # There were 1 total successful branch saturations.
% 0.13/0.37  # There were 0 successful branch saturations in interreduction.
% 0.13/0.37  # There were 0 successful branch saturations on the branch.
% 0.13/0.37  # There were 1 successful branch saturations after the branch.
% 0.13/0.37  # There were 1 total branch saturation attempts.
% 0.13/0.37  # There were 0 of these attempts blocked.
% 0.13/0.37  # There were 0 deferred branch saturation attempts.
% 0.13/0.37  # There were 0 free duplicated saturations.
% 0.13/0.37  # There were 1 total successful branch saturations.
% 0.13/0.37  # There were 0 successful branch saturations in interreduction.
% 0.13/0.37  # There were 0 successful branch saturations on the branch.
% 0.13/0.37  # There were 1 successful branch saturations after the branch.
% 0.13/0.37  # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # Begin clausification derivation
% 0.13/0.37  
% 0.13/0.37  # End clausification derivation
% 0.13/0.37  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37  cnf(i_0_13, negated_conjecture, (v2_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_7, negated_conjecture, (v2_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_12, negated_conjecture, (v3_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_6, negated_conjecture, (v3_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_11, negated_conjecture, (v4_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_5, negated_conjecture, (v4_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_10, negated_conjecture, (v1_lattice3(esk1_0))).
% 0.13/0.37  cnf(i_0_4, negated_conjecture, (v1_lattice3(esk2_0))).
% 0.13/0.37  cnf(i_0_9, negated_conjecture, (l1_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_3, negated_conjecture, (l1_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_45, plain, (l1_orders_2(esk5_0))).
% 0.13/0.37  cnf(i_0_46, plain, (l1_struct_0(esk6_0))).
% 0.13/0.37  cnf(i_0_64, plain, (l1_struct_0(esk12_0))).
% 0.13/0.37  cnf(i_0_53, plain, (v1_xboole_0(k1_xboole_0))).
% 0.13/0.37  cnf(i_0_61, plain, (v1_xboole_0(esk10_0))).
% 0.13/0.37  cnf(i_0_14, negated_conjecture, (~v3_struct_0(esk1_0))).
% 0.13/0.37  cnf(i_0_8, negated_conjecture, (~v3_struct_0(esk2_0))).
% 0.13/0.37  cnf(i_0_63, plain, (~v3_struct_0(esk12_0))).
% 0.13/0.37  cnf(i_0_62, plain, (~v1_xboole_0(esk11_0))).
% 0.13/0.37  cnf(i_0_78, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))).
% 0.13/0.37  cnf(i_0_38, plain, (l1_struct_0(X1)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_71, plain, (k2_xboole_0(X1,k1_xboole_0)=X1)).
% 0.13/0.37  cnf(i_0_70, plain, (r1_tarski(X1,X1))).
% 0.13/0.37  cnf(i_0_60, plain, (k2_xboole_0(X1,X1)=X1)).
% 0.13/0.37  cnf(i_0_2, negated_conjecture, (r2_hidden(esk3_0,u1_struct_0(esk2_0)))).
% 0.13/0.37  cnf(i_0_80, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))).
% 0.13/0.37  cnf(i_0_48, plain, (m1_subset_1(esk8_1(X1),X1))).
% 0.13/0.37  cnf(i_0_18, plain, (k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1))).
% 0.13/0.37  cnf(i_0_52, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(u1_struct_0(X1)))).
% 0.13/0.37  cnf(i_0_65, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(esk13_1(X1)))).
% 0.13/0.37  cnf(i_0_79, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_72, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_73, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))).
% 0.13/0.37  cnf(i_0_15, plain, (g1_orders_2(u1_struct_0(X1),u1_orders_2(X1))=X1|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_74, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))).
% 0.13/0.37  cnf(i_0_30, plain, (l1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_31, plain, (v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_36, plain, (v1_relat_1(k5_relat_1(X1,X2))|~v1_relat_1(X2)|~v1_relat_1(X1))).
% 0.13/0.37  cnf(i_0_16, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_75, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))).
% 0.13/0.37  cnf(i_0_50, plain, (v3_struct_0(X2)|v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_54, plain, (v3_struct_0(X1)|v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_66, plain, (v3_struct_0(X1)|m1_subset_1(esk13_1(X1),k1_zfmisc_1(u1_struct_0(X1)))|~l1_struct_0(X1))).
% 0.13/0.37  cnf(i_0_57, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X2,X1)))).
% 0.13/0.37  cnf(i_0_56, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X1,X2)))).
% 0.13/0.37  cnf(i_0_25, plain, (r2_hidden(X1,X3)|X3!=k2_xboole_0(X4,X2)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_26, plain, (r2_hidden(X1,X3)|X3!=k2_xboole_0(X2,X4)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_77, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.13/0.37  cnf(i_0_51, plain, (v3_struct_0(X2)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v3_struct_0(k1_latsum_1(X1,X2)))).
% 0.13/0.37  cnf(i_0_55, plain, (v3_struct_0(X1)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v3_struct_0(k1_latsum_1(X1,X2)))).
% 0.13/0.37  cnf(i_0_76, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.13/0.37  cnf(i_0_27, plain, (r2_hidden(X1,X4)|r2_hidden(X1,X3)|X2!=k2_xboole_0(X3,X4)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_43, plain, (m2_relset_1(u1_orders_2(X1),u1_struct_0(X1),u1_struct_0(X1))|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_47, plain, (m1_relset_1(esk7_2(X1,X2),X1,X2))).
% 0.13/0.37  cnf(i_0_49, plain, (m2_relset_1(esk9_2(X1,X2),X1,X2))).
% 0.13/0.37  cnf(i_0_21, plain, (u1_struct_0(X1)=k2_xboole_0(u1_struct_0(X2),u1_struct_0(X3))|X1!=k1_latsum_1(X2,X3)|~l1_orders_2(X3)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_1, negated_conjecture, (~m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))))).
% 0.13/0.37  cnf(i_0_28, plain, (l1_orders_2(g1_orders_2(X1,X2))|~m1_relset_1(X2,X1,X1))).
% 0.13/0.37  cnf(i_0_29, plain, (v1_orders_2(g1_orders_2(X1,X2))|~m1_relset_1(X2,X1,X1))).
% 0.13/0.37  cnf(i_0_17, plain, (v1_relat_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))).
% 0.13/0.37  cnf(i_0_58, plain, (X1=X2|g1_orders_2(X3,X1)!=g1_orders_2(X4,X2)|~m1_relset_1(X1,X3,X3))).
% 0.13/0.37  cnf(i_0_59, plain, (X1=X2|g1_orders_2(X1,X3)!=g1_orders_2(X2,X4)|~m1_relset_1(X3,X1,X1))).
% 0.13/0.37  cnf(i_0_69, plain, (m1_relset_1(X1,X2,X3)|~m2_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_68, plain, (m2_relset_1(X1,X2,X3)|~m1_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_42, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m2_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_22, plain, (X3=k2_xboole_0(X1,X2)|r2_hidden(esk4_3(X1,X2,X3),X3)|r2_hidden(esk4_3(X1,X2,X3),X2)|r2_hidden(esk4_3(X1,X2,X3),X1))).
% 0.13/0.37  cnf(i_0_23, plain, (X3=k2_xboole_0(X1,X2)|~r2_hidden(esk4_3(X1,X2,X3),X3)|~r2_hidden(esk4_3(X1,X2,X3),X2))).
% 0.13/0.37  cnf(i_0_24, plain, (X3=k2_xboole_0(X1,X2)|~r2_hidden(esk4_3(X1,X2,X3),X3)|~r2_hidden(esk4_3(X1,X2,X3),X1))).
% 0.13/0.37  cnf(i_0_67, plain, (k7_relset_1(X2,X3,X5,X6,X1,X4)=k5_relat_1(X1,X4)|~m1_relset_1(X4,X5,X6)|~m1_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_20, plain, (u1_orders_2(X1)=k2_xboole_0(k2_xboole_0(u1_orders_2(X2),u1_orders_2(X3)),k7_relset_1(u1_struct_0(X2),u1_struct_0(X2),u1_struct_0(X3),u1_struct_0(X3),u1_orders_2(X2),u1_orders_2(X3)))|X1!=k1_latsum_1(X2,X3)|~l1_orders_2(X3)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_37, plain, (m2_relset_1(k7_relset_1(X2,X3,X5,X6,X1,X4),X2,X6)|~m1_relset_1(X4,X5,X6)|~m1_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_19, plain, (X1=k1_latsum_1(X2,X3)|u1_struct_0(X1)!=k2_xboole_0(u1_struct_0(X2),u1_struct_0(X3))|u1_orders_2(X1)!=k2_xboole_0(k2_xboole_0(u1_orders_2(X2),u1_orders_2(X3)),k7_relset_1(u1_struct_0(X2),u1_struct_0(X2),u1_struct_0(X3),u1_struct_0(X3),u1_orders_2(X2),u1_orders_2(X3)))|~l1_orders_2(X3)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.37  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.37  # Begin printing tableau
% 0.13/0.37  # Found 5 steps
% 0.13/0.37  cnf(i_0_3, negated_conjecture, (l1_orders_2(esk2_0)), inference(start_rule)).
% 0.13/0.37  cnf(i_0_85, plain, (l1_orders_2(esk2_0)), inference(extension_rule, [i_0_38])).
% 0.13/0.37  cnf(i_0_97, plain, (l1_struct_0(esk2_0)), inference(extension_rule, [i_0_52])).
% 0.13/0.37  cnf(i_0_104, plain, (v3_struct_0(esk2_0)), inference(closure_rule, [i_0_8])).
% 0.13/0.37  cnf(i_0_106, plain, (~v1_xboole_0(u1_struct_0(esk2_0))), inference(etableau_closure_rule, [i_0_106, ...])).
% 0.13/0.37  # End printing tableau
% 0.13/0.37  # SZS output end
% 0.13/0.37  # Branches closed with saturation will be marked with an "s"
% 0.13/0.37  # There were 1 total branch saturation attempts.
% 0.13/0.37  # There were 0 of these attempts blocked.
% 0.13/0.37  # There were 0 deferred branch saturation attempts.
% 0.13/0.37  # There were 0 free duplicated saturations.
% 0.13/0.37  # There were 1 total successful branch saturations.
% 0.13/0.37  # There were 0 successful branch saturations in interreduction.
% 0.13/0.37  # There were 0 successful branch saturations on the branch.
% 0.13/0.37  # There were 1 successful branch saturations after the branch.
% 0.13/0.37  # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # Begin clausification derivation
% 0.13/0.37  
% 0.13/0.37  # End clausification derivation
% 0.13/0.37  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37  cnf(i_0_13, negated_conjecture, (v2_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_7, negated_conjecture, (v2_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_12, negated_conjecture, (v3_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_6, negated_conjecture, (v3_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_11, negated_conjecture, (v4_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_5, negated_conjecture, (v4_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_10, negated_conjecture, (v1_lattice3(esk1_0))).
% 0.13/0.37  cnf(i_0_4, negated_conjecture, (v1_lattice3(esk2_0))).
% 0.13/0.37  cnf(i_0_9, negated_conjecture, (l1_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_3, negated_conjecture, (l1_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_45, plain, (l1_orders_2(esk5_0))).
% 0.13/0.37  cnf(i_0_46, plain, (l1_struct_0(esk6_0))).
% 0.13/0.37  cnf(i_0_64, plain, (l1_struct_0(esk12_0))).
% 0.13/0.37  cnf(i_0_53, plain, (v1_xboole_0(k1_xboole_0))).
% 0.13/0.37  cnf(i_0_61, plain, (v1_xboole_0(esk10_0))).
% 0.13/0.37  cnf(i_0_14, negated_conjecture, (~v3_struct_0(esk1_0))).
% 0.13/0.37  cnf(i_0_8, negated_conjecture, (~v3_struct_0(esk2_0))).
% 0.13/0.37  cnf(i_0_63, plain, (~v3_struct_0(esk12_0))).
% 0.13/0.37  cnf(i_0_62, plain, (~v1_xboole_0(esk11_0))).
% 0.13/0.37  cnf(i_0_78, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))).
% 0.13/0.37  cnf(i_0_38, plain, (l1_struct_0(X1)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_71, plain, (k2_xboole_0(X1,k1_xboole_0)=X1)).
% 0.13/0.37  cnf(i_0_70, plain, (r1_tarski(X1,X1))).
% 0.13/0.37  cnf(i_0_60, plain, (k2_xboole_0(X1,X1)=X1)).
% 0.13/0.37  cnf(i_0_2, negated_conjecture, (r2_hidden(esk3_0,u1_struct_0(esk2_0)))).
% 0.13/0.37  cnf(i_0_80, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))).
% 0.13/0.37  cnf(i_0_48, plain, (m1_subset_1(esk8_1(X1),X1))).
% 0.13/0.37  cnf(i_0_18, plain, (k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1))).
% 0.13/0.37  cnf(i_0_52, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(u1_struct_0(X1)))).
% 0.13/0.37  cnf(i_0_65, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(esk13_1(X1)))).
% 0.13/0.37  cnf(i_0_79, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_72, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_73, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))).
% 0.13/0.37  cnf(i_0_15, plain, (g1_orders_2(u1_struct_0(X1),u1_orders_2(X1))=X1|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_74, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))).
% 0.13/0.37  cnf(i_0_30, plain, (l1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_31, plain, (v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_36, plain, (v1_relat_1(k5_relat_1(X1,X2))|~v1_relat_1(X2)|~v1_relat_1(X1))).
% 0.13/0.37  cnf(i_0_16, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_75, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))).
% 0.13/0.37  cnf(i_0_50, plain, (v3_struct_0(X2)|v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_54, plain, (v3_struct_0(X1)|v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_66, plain, (v3_struct_0(X1)|m1_subset_1(esk13_1(X1),k1_zfmisc_1(u1_struct_0(X1)))|~l1_struct_0(X1))).
% 0.13/0.37  cnf(i_0_57, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X2,X1)))).
% 0.13/0.37  cnf(i_0_56, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X1,X2)))).
% 0.13/0.37  cnf(i_0_25, plain, (r2_hidden(X1,X3)|X3!=k2_xboole_0(X4,X2)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_26, plain, (r2_hidden(X1,X3)|X3!=k2_xboole_0(X2,X4)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_77, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.13/0.37  cnf(i_0_51, plain, (v3_struct_0(X2)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v3_struct_0(k1_latsum_1(X1,X2)))).
% 0.13/0.37  cnf(i_0_55, plain, (v3_struct_0(X1)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v3_struct_0(k1_latsum_1(X1,X2)))).
% 0.13/0.37  cnf(i_0_76, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.13/0.37  cnf(i_0_27, plain, (r2_hidden(X1,X4)|r2_hidden(X1,X3)|X2!=k2_xboole_0(X3,X4)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_43, plain, (m2_relset_1(u1_orders_2(X1),u1_struct_0(X1),u1_struct_0(X1))|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_47, plain, (m1_relset_1(esk7_2(X1,X2),X1,X2))).
% 0.13/0.37  cnf(i_0_49, plain, (m2_relset_1(esk9_2(X1,X2),X1,X2))).
% 0.13/0.37  cnf(i_0_21, plain, (u1_struct_0(X1)=k2_xboole_0(u1_struct_0(X2),u1_struct_0(X3))|X1!=k1_latsum_1(X2,X3)|~l1_orders_2(X3)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_1, negated_conjecture, (~m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))))).
% 0.13/0.37  cnf(i_0_28, plain, (l1_orders_2(g1_orders_2(X1,X2))|~m1_relset_1(X2,X1,X1))).
% 0.13/0.37  cnf(i_0_29, plain, (v1_orders_2(g1_orders_2(X1,X2))|~m1_relset_1(X2,X1,X1))).
% 0.13/0.37  cnf(i_0_17, plain, (v1_relat_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))).
% 0.13/0.37  cnf(i_0_58, plain, (X1=X2|g1_orders_2(X3,X1)!=g1_orders_2(X4,X2)|~m1_relset_1(X1,X3,X3))).
% 0.13/0.37  cnf(i_0_59, plain, (X1=X2|g1_orders_2(X1,X3)!=g1_orders_2(X2,X4)|~m1_relset_1(X3,X1,X1))).
% 0.13/0.37  cnf(i_0_69, plain, (m1_relset_1(X1,X2,X3)|~m2_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_68, plain, (m2_relset_1(X1,X2,X3)|~m1_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_42, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m2_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_22, plain, (X3=k2_xboole_0(X1,X2)|r2_hidden(esk4_3(X1,X2,X3),X3)|r2_hidden(esk4_3(X1,X2,X3),X2)|r2_hidden(esk4_3(X1,X2,X3),X1))).
% 0.13/0.37  cnf(i_0_23, plain, (X3=k2_xboole_0(X1,X2)|~r2_hidden(esk4_3(X1,X2,X3),X3)|~r2_hidden(esk4_3(X1,X2,X3),X2))).
% 0.13/0.37  cnf(i_0_24, plain, (X3=k2_xboole_0(X1,X2)|~r2_hidden(esk4_3(X1,X2,X3),X3)|~r2_hidden(esk4_3(X1,X2,X3),X1))).
% 0.13/0.37  cnf(i_0_67, plain, (k7_relset_1(X2,X3,X5,X6,X1,X4)=k5_relat_1(X1,X4)|~m1_relset_1(X4,X5,X6)|~m1_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_20, plain, (u1_orders_2(X1)=k2_xboole_0(k2_xboole_0(u1_orders_2(X2),u1_orders_2(X3)),k7_relset_1(u1_struct_0(X2),u1_struct_0(X2),u1_struct_0(X3),u1_struct_0(X3),u1_orders_2(X2),u1_orders_2(X3)))|X1!=k1_latsum_1(X2,X3)|~l1_orders_2(X3)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_37, plain, (m2_relset_1(k7_relset_1(X2,X3,X5,X6,X1,X4),X2,X6)|~m1_relset_1(X4,X5,X6)|~m1_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_19, plain, (X1=k1_latsum_1(X2,X3)|u1_struct_0(X1)!=k2_xboole_0(u1_struct_0(X2),u1_struct_0(X3))|u1_orders_2(X1)!=k2_xboole_0(k2_xboole_0(u1_orders_2(X2),u1_orders_2(X3)),k7_relset_1(u1_struct_0(X2),u1_struct_0(X2),u1_struct_0(X3),u1_struct_0(X3),u1_orders_2(X2),u1_orders_2(X3)))|~l1_orders_2(X3)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.37  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.37  # Begin printing tableau
% 0.13/0.37  # Found 7 steps
% 0.13/0.37  cnf(i_0_8, negated_conjecture, (~v3_struct_0(esk2_0)), inference(start_rule)).
% 0.13/0.37  cnf(i_0_83, plain, (~v3_struct_0(esk2_0)), inference(extension_rule, [i_0_52])).
% 0.13/0.37  cnf(i_0_103, plain, (~l1_struct_0(esk2_0)), inference(extension_rule, [i_0_38])).
% 0.13/0.37  cnf(i_0_108, plain, (~l1_orders_2(esk2_0)), inference(closure_rule, [i_0_3])).
% 0.13/0.37  cnf(i_0_104, plain, (~v1_xboole_0(u1_struct_0(esk2_0))), inference(extension_rule, [i_0_73])).
% 0.13/0.37  cnf(i_0_123, plain, (~m1_subset_1(esk8_1(u1_struct_0(esk2_0)),u1_struct_0(esk2_0))), inference(closure_rule, [i_0_48])).
% 0.13/0.37  cnf(i_0_122, plain, (r2_hidden(esk8_1(u1_struct_0(esk2_0)),u1_struct_0(esk2_0))), inference(etableau_closure_rule, [i_0_122, ...])).
% 0.13/0.37  # End printing tableau
% 0.13/0.37  # SZS output end
% 0.13/0.37  # Branches closed with saturation will be marked with an "s"
% 0.13/0.37  # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # Begin clausification derivation
% 0.13/0.37  
% 0.13/0.37  # End clausification derivation
% 0.13/0.37  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37  cnf(i_0_13, negated_conjecture, (v2_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_7, negated_conjecture, (v2_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_12, negated_conjecture, (v3_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_6, negated_conjecture, (v3_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_11, negated_conjecture, (v4_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_5, negated_conjecture, (v4_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_10, negated_conjecture, (v1_lattice3(esk1_0))).
% 0.13/0.37  cnf(i_0_4, negated_conjecture, (v1_lattice3(esk2_0))).
% 0.13/0.37  cnf(i_0_9, negated_conjecture, (l1_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_3, negated_conjecture, (l1_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_45, plain, (l1_orders_2(esk5_0))).
% 0.13/0.37  cnf(i_0_46, plain, (l1_struct_0(esk6_0))).
% 0.13/0.37  cnf(i_0_64, plain, (l1_struct_0(esk12_0))).
% 0.13/0.37  cnf(i_0_53, plain, (v1_xboole_0(k1_xboole_0))).
% 0.13/0.37  cnf(i_0_61, plain, (v1_xboole_0(esk10_0))).
% 0.13/0.37  cnf(i_0_14, negated_conjecture, (~v3_struct_0(esk1_0))).
% 0.13/0.37  cnf(i_0_8, negated_conjecture, (~v3_struct_0(esk2_0))).
% 0.13/0.37  cnf(i_0_63, plain, (~v3_struct_0(esk12_0))).
% 0.13/0.37  cnf(i_0_62, plain, (~v1_xboole_0(esk11_0))).
% 0.13/0.37  cnf(i_0_78, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))).
% 0.13/0.37  cnf(i_0_38, plain, (l1_struct_0(X1)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_71, plain, (k2_xboole_0(X1,k1_xboole_0)=X1)).
% 0.13/0.37  cnf(i_0_70, plain, (r1_tarski(X1,X1))).
% 0.13/0.37  cnf(i_0_60, plain, (k2_xboole_0(X1,X1)=X1)).
% 0.13/0.37  cnf(i_0_2, negated_conjecture, (r2_hidden(esk3_0,u1_struct_0(esk2_0)))).
% 0.13/0.37  cnf(i_0_80, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))).
% 0.13/0.37  cnf(i_0_48, plain, (m1_subset_1(esk8_1(X1),X1))).
% 0.13/0.37  cnf(i_0_18, plain, (k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1))).
% 0.13/0.37  cnf(i_0_52, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(u1_struct_0(X1)))).
% 0.13/0.37  cnf(i_0_65, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(esk13_1(X1)))).
% 0.13/0.37  cnf(i_0_79, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_72, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_73, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))).
% 0.13/0.37  cnf(i_0_15, plain, (g1_orders_2(u1_struct_0(X1),u1_orders_2(X1))=X1|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_74, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))).
% 0.13/0.37  cnf(i_0_30, plain, (l1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_31, plain, (v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_36, plain, (v1_relat_1(k5_relat_1(X1,X2))|~v1_relat_1(X2)|~v1_relat_1(X1))).
% 0.13/0.37  cnf(i_0_16, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_75, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))).
% 0.13/0.37  cnf(i_0_50, plain, (v3_struct_0(X2)|v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_54, plain, (v3_struct_0(X1)|v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_66, plain, (v3_struct_0(X1)|m1_subset_1(esk13_1(X1),k1_zfmisc_1(u1_struct_0(X1)))|~l1_struct_0(X1))).
% 0.13/0.37  cnf(i_0_57, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X2,X1)))).
% 0.13/0.37  cnf(i_0_56, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X1,X2)))).
% 0.13/0.37  cnf(i_0_25, plain, (r2_hidden(X1,X3)|X3!=k2_xboole_0(X4,X2)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_26, plain, (r2_hidden(X1,X3)|X3!=k2_xboole_0(X2,X4)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_77, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.13/0.37  cnf(i_0_51, plain, (v3_struct_0(X2)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v3_struct_0(k1_latsum_1(X1,X2)))).
% 0.13/0.37  cnf(i_0_55, plain, (v3_struct_0(X1)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v3_struct_0(k1_latsum_1(X1,X2)))).
% 0.13/0.37  cnf(i_0_76, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.13/0.37  cnf(i_0_27, plain, (r2_hidden(X1,X4)|r2_hidden(X1,X3)|X2!=k2_xboole_0(X3,X4)|~r2_hidden(X1,X2))).
% 0.13/0.37  cnf(i_0_43, plain, (m2_relset_1(u1_orders_2(X1),u1_struct_0(X1),u1_struct_0(X1))|~l1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_47, plain, (m1_relset_1(esk7_2(X1,X2),X1,X2))).
% 0.13/0.37  cnf(i_0_49, plain, (m2_relset_1(esk9_2(X1,X2),X1,X2))).
% 0.13/0.37  cnf(i_0_21, plain, (u1_struct_0(X1)=k2_xboole_0(u1_struct_0(X2),u1_s# There were 1 total branch saturation attempts.
% 0.13/0.37  # There were 0 of these attempts blocked.
% 0.13/0.37  # There were 0 deferred branch saturation attempts.
% 0.13/0.37  # There were 0 free duplicated saturations.
% 0.13/0.37  # There were 1 total successful branch saturations.
% 0.13/0.37  # There were 0 successful branch saturations in interreduction.
% 0.13/0.37  # There were 0 successful branch saturations on the branch.
% 0.13/0.37  # There were 1 successful branch saturations after the branch.
% 0.13/0.37  truct_0(X3))|X1!=k1_latsum_1(X2,X3)|~l1_orders_2(X3)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_1, negated_conjecture, (~m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))))).
% 0.13/0.37  cnf(i_0_28, plain, (l1_orders_2(g1_orders_2(X1,X2))|~m1_relset_1(X2,X1,X1))).
% 0.13/0.37  cnf(i_0_29, plain, (v1_orders_2(g1_orders_2(X1,X2))|~m1_relset_1(X2,X1,X1))).
% 0.13/0.37  cnf(i_0_17, plain, (v1_relat_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))).
% 0.13/0.37  cnf(i_0_58, plain, (X1=X2|g1_orders_2(X3,X1)!=g1_orders_2(X4,X2)|~m1_relset_1(X1,X3,X3))).
% 0.13/0.37  cnf(i_0_59, plain, (X1=X2|g1_orders_2(X1,X3)!=g1_orders_2(X2,X4)|~m1_relset_1(X3,X1,X1))).
% 0.13/0.37  cnf(i_0_69, plain, (m1_relset_1(X1,X2,X3)|~m2_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_68, plain, (m2_relset_1(X1,X2,X3)|~m1_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_42, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m2_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_22, plain, (X3=k2_xboole_0(X1,X2)|r2_hidden(esk4_3(X1,X2,X3),X3)|r2_hidden(esk4_3(X1,X2,X3),X2)|r2_hidden(esk4_3(X1,X2,X3),X1))).
% 0.13/0.37  cnf(i_0_23, plain, (X3=k2_xboole_0(X1,X2)|~r2_hidden(esk4_3(X1,X2,X3),X3)|~r2_hidden(esk4_3(X1,X2,X3),X2))).
% 0.13/0.37  cnf(i_0_24, plain, (X3=k2_xboole_0(X1,X2)|~r2_hidden(esk4_3(X1,X2,X3),X3)|~r2_hidden(esk4_3(X1,X2,X3),X1))).
% 0.13/0.37  cnf(i_0_67, plain, (k7_relset_1(X2,X3,X5,X6,X1,X4)=k5_relat_1(X1,X4)|~m1_relset_1(X4,X5,X6)|~m1_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_20, plain, (u1_orders_2(X1)=k2_xboole_0(k2_xboole_0(u1_orders_2(X2),u1_orders_2(X3)),k7_relset_1(u1_struct_0(X2),u1_struct_0(X2),u1_struct_0(X3),u1_struct_0(X3),u1_orders_2(X2),u1_orders_2(X3)))|X1!=k1_latsum_1(X2,X3)|~l1_orders_2(X3)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.37  cnf(i_0_37, plain, (m2_relset_1(k7_relset_1(X2,X3,X5,X6,X1,X4),X2,X6)|~m1_relset_1(X4,X5,X6)|~m1_relset_1(X1,X2,X3))).
% 0.13/0.37  cnf(i_0_19, plain, (X1=k1_latsum_1(X2,X3)|u1_struct_0(X1)!=k2_xboole_0(u1_struct_0(X2),u1_struct_0(X3))|u1_orders_2(X1)!=k2_xboole_0(k2_xboole_0(u1_orders_2(X2),u1_orders_2(X3)),k7_relset_1(u1_struct_0(X2),u1_struct_0(X2),u1_struct_0(X3),u1_struct_0(X3),u1_orders_2(X2),u1_orders_2(X3)))|~l1_orders_2(X3)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.37  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.37  # Begin printing tableau
% 0.13/0.37  # Found 5 steps
% 0.13/0.37  cnf(i_0_9, negated_conjecture, (l1_orders_2(esk1_0)), inference(start_rule)).
% 0.13/0.37  cnf(i_0_86, plain, (l1_orders_2(esk1_0)), inference(extension_rule, [i_0_38])).
% 0.13/0.37  cnf(i_0_97, plain, (l1_struct_0(esk1_0)), inference(extension_rule, [i_0_52])).
% 0.13/0.37  cnf(i_0_104, plain, (v3_struct_0(esk1_0)), inference(closure_rule, [i_0_14])).
% 0.13/0.37  cnf(i_0_106, plain, (~v1_xboole_0(u1_struct_0(esk1_0))), inference(etableau_closure_rule, [i_0_106, ...])).
% 0.13/0.37  # End printing tableau
% 0.13/0.37  # SZS output end
% 0.13/0.37  # Branches closed with saturation will be marked with an "s"
% 0.13/0.37  # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # Begin clausification derivation
% 0.13/0.37  
% 0.13/0.37  # End clausification derivation
% 0.13/0.37  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37  cnf(i_0_13, negated_conjecture, (v2_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_7, negated_conjecture, (v2_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_12, negated_conjecture, (v3_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_6, negated_conjecture, (v3_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_11, negated_conjecture, (v4_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_5, negated_conjecture, (v4_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_10, negated_conjecture, (v1_lattice3(esk1_0))).
% 0.13/0.37  cnf(i_0_4, negated_conjecture, (v1_lattice3(esk2_0))).
% 0.13/0.37  cnf(i_0_9, negated_conjecture, (l1_orders_2(esk1_0))).
% 0.13/0.37  cnf(i_0_3, negated_conjecture, (l1_orders_2(esk2_0))).
% 0.13/0.37  cnf(i_0_45, plain, (l1_orders_2(esk5_0))).
% 0.13/0.37  cnf(i_0_46, plain, (l1_struct_0(esk6_0))).
% 0.13/0.37  cnf(i_0_64, plain, (l1_struct_0(esk12_0))).
% 0.13/0.37  cnf(i_0_53, plain, (v1_xboole_0(k1_xboole_0))).
% 0.13/0.37  cnf(i_0_61, plain, (v1_xboole_0(esk10_0))).
% 0.13/0.37  cnf(i_0_14, negated_conjecture, (~v3_struct_0(esk1_0))).
% 0.13/0.37  cnf(i_0_8, negated_conjecture, (~v3_struct_0(esk2_0))).
% 0.13/0.38  cnf(i_0_63, plain, (~v3_struct_0(esk12_0))).
% 0.13/0.38  cnf(i_0_62, plain, (~v1_xboole_0(esk11_0))).
% 0.13/0.38  cnf(i_0_78, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))).
% 0.13/0.38  cnf(i_0_38, plain, (l1_struct_0(X1)|~l1_orders_2(X1))).
% 0.13/0.38  cnf(i_0_71, plain, (k2_xboole_0(X1,k1_xboole_0)=X1)).
% 0.13/0.38  cnf(i_0_70, plain, (r1_tarski(X1,X1))).
% 0.13/0.38  cnf(i_0_60, plain, (k2_xboole_0(X1,X1)=X1)).
% 0.13/0.38  cnf(i_0_2, negated_conjecture, (r2_hidden(esk3_0,u1_struct_0(esk2_0)))).
% 0.13/0.38  cnf(i_0_80, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))).
% 0.13/0.38  cnf(i_0_48, plain, (m1_subset_1(esk8_1(X1),X1))).
% 0.13/0.38  cnf(i_0_18, plain, (k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1))).
% 0.13/0.38  cnf(i_0_52, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(u1_struct_0(X1)))).
% 0.13/0.38  cnf(i_0_65, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(esk13_1(X1)))).
% 0.13/0.38  cnf(i_0_79, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))).
% 0.13/0.38  cnf(i_0_72, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))).
% 0.13/0.38  cnf(i_0_73, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))).
% 0.13/0.38  cnf(i_0_15, plain, (g1_orders_2(u1_struct_0(X1),u1_orders_2(X1))=X1|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.38  cnf(i_0_74, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))).
% 0.13/0.38  cnf(i_0_30, plain, (l1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.38  cnf(i_0_31, plain, (v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.38  cnf(i_0_36, plain, (v1_relat_1(k5_relat_1(X1,X2))|~v1_relat_1(X2)|~v1_relat_1(X1))).
% 0.13/0.38  cnf(i_0_16, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))).
% 0.13/0.38  cnf(i_0_75, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))).
% 0.13/0.38  cnf(i_0_50, plain, (v3_struct_0(X2)|v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.38  cnf(i_0_54, plain, (v3_struct_0(X1)|v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.13/0.38  cnf(i_0_66, plain, (v3_struct_0(X1)|m1_subset_1(esk13_1(X1),k1_zfmisc_1(u1_struct_0(X1)))|~l1_struct_0(X1))).
% 0.13/0.38  cnf(i_0_57, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X2,X1)))).
% 0.13/0.38  cnf(i_0_56, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X1,X2)))).
% 0.13/0.38  cnf(i_0_25, plain, (r2_hidden(X1,X3)|X3!=k2_xboole_0(X4,X2)|~r2_hidden(X1,X2))).
% 0.13/0.38  cnf(i_0_26, plain, (r2_hidden(X1,X3)|X3!=k2_xboole_0(X2,X4)|~r2_hidden(X1,X2))).
% 0.13/0.38  cnf(i_0_77, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.13/0.38  cnf(i_0_51, plain, (v3_struct_0(X2)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v3_struct_0(k1_latsum_1(X1,X2)))).
% 0.13/0.38  cnf(i_0_55, plain, (v3_struct_0(X1)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v3_struct_0(k1_latsum_1(X1,X2)))).
% 0.13/0.38  cnf(i_0_76, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.13/0.38  cnf(i_0_27, plain, (r2_hidden(X1,X4)|r2_hidden(X1,X3)|X2!=k2_xboole_0(X3,X4)|~r2_hidden(X1,X2))).
% 0.13/0.38  cnf(i_0_43, plain, (m2_relset_1(u1_orders_2(X1),u1_struct_0(X1),u1_struct_0(X1))|~l1_orders_2(X1))).
% 0.13/0.38  cnf(i_0_47, plain, (m1_relset_1(esk7_2(X1,X2),X1,X2))).
% 0.13/0.38  cnf(i_0_49, plain, (m2_relset_1(esk9_2(X1,X2),X1,X2))).
% 0.13/0.38  cnf(i_0_21, plain, (u1_struct_0(X1)=k2_xboole_0(u1_struct_0(X2),u1_struct_0(X3))|X1!=k1_latsum_1(X2,X3)|~l1_orders_2(X3)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.38  cnf(i_0_1, negated_conjecture, (~m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))))).
% 0.13/0.38  cnf(i_0_28, plain, (l1_orders_2(g1_orders_2(X1,X2))|~m1_relset_1(X2,X1,X1))).
% 0.13/0.38  cnf(i_0_29, plain, (v1_orders_2(g1_orders_2(X1,X2))|~m1_relset_1(X2,X1,X1))).
% 0.13/0.38  cnf(i_0_17, plain, (v1_relat_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))).
% 0.13/0.38  cnf(i_0_58, plain, (X1=X2|g1_orders_2(X3,X1)!=g1_orders_2(X4,X2)|~m1_relset_1(X1,X3,X3))).
% 0.13/0.38  cnf(i_0_59, plain, (X1=X2|g1_orders_2(X1,X3)!=g1_orders_2(X2,X4)|~m1_relset_1(X3,X1,X1))).
% 0.13/0.38  cnf(i_0_69, plain, (m1_relset_1(X1,X2,X3)|~m2_relset_1(X1,X2,X3))).
% 0.13/0.38  cnf(i_0_68, plain, (m2_relset_1(X1,X2,X3)|~m1_relset_1(X1,X2,X3))).
% 0.13/0.38  cnf(i_0_42, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m2_relset_1(X1,X2,X3))).
% 0.13/0.38  cnf(i_0_22, plain, (X3=k2_xboole_0(X1,X2)|r2_hidden(esk4_3(X1,X2,X3),X3)|r2_hidden(esk4_3(X1,X2,X3),X2)|r2_hidden(esk4_3(X1,X2,X3),X1))).
% 0.13/0.38  cnf(i_0_23, plain, (X3=k2_xboole_0(X1,X2)|~r2_hidden(esk4_3(X1,X2,X3),X3)|~r2_hidden(esk4_3(X1,X2,X3),X2))).
% 0.13/0.38  cnf(i_0_24, plain, (X3=k2_xboole_0(X1,X2)|~r2_hidden(esk4_3(X1,X2,X3),X3)|~r2_hidden(esk4_3(X1,X2,X3),X1))).
% 0.13/0.38  cnf(i_0_67, plain, (k7_relset_1(X2,X3,X5,X6,X1,X4)=k5_relat_1(X1,X4)|~m1_relset_1(X4,X5,X6)|~m1_relset_1(X1,X2,X3))).
% 0.13/0.38  cnf(i_0_20, plain, (u1_orders_2(X1)=k2_xboole_0(k2_xboole_0(u1_orders_2(X2),u1_orders_2(X3)),k7_relset_1(u1_struct_0(X2),u1_struct_0(X2),u1_struct_0(X3),u1_struct_0(X3),u1_orders_2(X2),u1_orders_2(X3)))|X1!=k1_latsum_1(X2,X3)|~l1_orders_2(X3)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.38  cnf(i_0_37, plain, (m2_relset_1(k7_relset_1(X2,X3,X5,X6,X1,X4),X2,X6)|~m1_relset_1(X4,X5,X6)|~m1_relset_1(X1,X2,X3))).
% 0.13/0.38  cnf(i_0_19, plain, (X1=k1_latsum_1(X2,X3)|u1_struct_0(X1)!=k2_xboole_0(u1_struct_0(X2),u1_struct_0(X3))|u1_orders_2(X1)!=k2_xboole_0(k2_xboole_0(u1_orders_2(X2),u1_orders_2(X3)),k7_relset_1(u1_struct_0(X2),u1_struct_0(X2),u1_struct_0(X3),u1_struct_0(X3),u1_orders_2(X2),u1_orders_2(X3)))|~l1_orders_2(X3)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.13/0.38  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.38  # Begin printing tableau
% 0.13/0.38  # Found 7 steps
% 0.13/0.38  cnf(i_0_14, negated_conjecture, (~v3_struct_0(esk1_0)), inference(start_rule)).
% 0.13/0.38  cnf(i_0_84, plain, (~v3_struct_0(esk1_0)), inference(extension_rule, [i_0_52])).
% 0.13/0.38  cnf(i_0_103, plain, (~l1_struct_0(esk1_0)), inference(extension_rule, [i_0_38])).
% 0.13/0.38  cnf(i_0_108, plain, (~l1_orders_2(esk1_0)), inference(closure_rule, [i_0_9])).
% 0.13/0.38  cnf(i_0_104, plain, (~v1_xboole_0(u1_struct_0(esk1_0))), inference(extension_rule, [i_0_73])).
% 0.13/0.38  cnf(i_0_123, plain, (~m1_subset_1(esk8_1(u1_struct_0(esk1_0)),u1_struct_0(esk1_0))), inference(closure_rule, [i_0_48])).
% 0.13/0.38  cnf(i_0_122, plain, (r2_hidden(esk8_1(u1_struct_0(esk1_0)),u1_struct_0(esk1_0))), inference(etableau_closure_rule, [i_0_122, ...])).
% 0.13/0.38  # End printing tableau
% 0.13/0.38  # SZS output end
% 0.13/0.38  # Branches closed with saturation will be marked with an "s"
% 0.13/0.38  # Child (19586) has found a proof.
% 0.13/0.38  
% 0.13/0.38  # Proof search is over...
% 0.13/0.38  # Freeing feature tree
%------------------------------------------------------------------------------