TSTP Solution File: SEU407+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU407+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 : n016.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:33 EDT 2022
% Result : Theorem 0.19s 0.40s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU407+1 : TPTP v8.1.0. Released v3.4.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.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 08:32:08 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.19/0.38 # No SInE strategy applied
% 0.19/0.38 # Auto-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 0.19/0.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.19/0.38 #
% 0.19/0.38 # Number of axioms: 68 Number of unprocessed: 68
% 0.19/0.38 # Tableaux proof search.
% 0.19/0.38 # APR header successfully linked.
% 0.19/0.38 # Hello from C++
% 0.19/0.38 # The folding up rule is enabled...
% 0.19/0.38 # Local unification is enabled...
% 0.19/0.38 # Any saturation attempts will use folding labels...
% 0.19/0.38 # 68 beginning clauses after preprocessing and clausification
% 0.19/0.38 # Creating start rules for all 7 conjectures.
% 0.19/0.38 # There are 7 start rule candidates:
% 0.19/0.38 # Found 24 unit axioms.
% 0.19/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.38 # 7 start rule tableaux created.
% 0.19/0.38 # 44 extension rule candidate clauses
% 0.19/0.38 # 24 unit axiom clauses
% 0.19/0.38
% 0.19/0.38 # Requested 8, 32 cores available to the main process.
% 0.19/0.38 # There are not enough tableaux to fork, creating more from the initial 7
% 0.19/0.38 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.38 # We now have 15 tableaux to operate on
% 0.19/0.40 # There were 1 total branch saturation attempts.
% 0.19/0.40 # There were 0 of these attempts blocked.
% 0.19/0.40 # There were 0 deferred branch saturation attempts.
% 0.19/0.40 # There were 0 free duplicated saturations.
% 0.19/0.40 # There were 1 total successful branch saturations.
% 0.19/0.40 # There were 0 successful branch saturations in interreduction.
% 0.19/0.40 # There were 0 successful branch saturations on the branch.
% 0.19/0.40 # There were 1 successful branch saturations after the branch.
% 0.19/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.40 # Begin clausification derivation
% 0.19/0.40
% 0.19/0.40 # End clausification derivation
% 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.40 cnf(i_0_6, negated_conjecture, (l1_orders_2(esk1_0))).
% 0.19/0.40 cnf(i_0_4, negated_conjecture, (l1_orders_2(esk2_0))).
% 0.19/0.40 cnf(i_0_39, plain, (l1_orders_2(esk5_0))).
% 0.19/0.40 cnf(i_0_40, plain, (l1_struct_0(esk6_0))).
% 0.19/0.40 cnf(i_0_58, plain, (l1_struct_0(esk12_0))).
% 0.19/0.40 cnf(i_0_47, plain, (v1_xboole_0(k1_xboole_0))).
% 0.19/0.40 cnf(i_0_55, plain, (v1_xboole_0(esk10_0))).
% 0.19/0.40 cnf(i_0_7, negated_conjecture, (~v3_struct_0(esk1_0))).
% 0.19/0.40 cnf(i_0_5, negated_conjecture, (~v3_struct_0(esk2_0))).
% 0.19/0.40 cnf(i_0_57, plain, (~v3_struct_0(esk12_0))).
% 0.19/0.40 cnf(i_0_56, plain, (~v1_xboole_0(esk11_0))).
% 0.19/0.40 cnf(i_0_75, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))).
% 0.19/0.40 cnf(i_0_32, plain, (l1_struct_0(X1)|~l1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_72, plain, (k4_xboole_0(k1_xboole_0,X1)=k1_xboole_0)).
% 0.19/0.40 cnf(i_0_69, plain, (k4_xboole_0(X1,k1_xboole_0)=X1)).
% 0.19/0.40 cnf(i_0_65, plain, (k2_xboole_0(X1,k1_xboole_0)=X1)).
% 0.19/0.40 cnf(i_0_64, plain, (r1_tarski(X1,X1))).
% 0.19/0.40 cnf(i_0_54, plain, (k2_xboole_0(X1,X1)=X1)).
% 0.19/0.40 cnf(i_0_77, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))).
% 0.19/0.40 cnf(i_0_42, plain, (m1_subset_1(esk8_1(X1),X1))).
% 0.19/0.40 cnf(i_0_2, negated_conjecture, (~r2_hidden(esk3_0,u1_struct_0(esk1_0)))).
% 0.19/0.40 cnf(i_0_11, plain, (k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1))).
% 0.19/0.40 cnf(i_0_46, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(u1_struct_0(X1)))).
% 0.19/0.40 cnf(i_0_59, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(esk13_1(X1)))).
% 0.19/0.40 cnf(i_0_76, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))).
% 0.19/0.40 cnf(i_0_66, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))).
% 0.19/0.40 cnf(i_0_67, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))).
% 0.19/0.40 cnf(i_0_8, plain, (g1_orders_2(u1_struct_0(X1),u1_orders_2(X1))=X1|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_70, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))).
% 0.19/0.40 cnf(i_0_23, plain, (l1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_24, plain, (v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_30, plain, (v1_relat_1(k5_relat_1(X1,X2))|~v1_relat_1(X2)|~v1_relat_1(X1))).
% 0.19/0.40 cnf(i_0_9, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))).
% 0.19/0.40 cnf(i_0_71, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))).
% 0.19/0.40 cnf(i_0_44, plain, (v3_struct_0(X2)|v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_48, plain, (v3_struct_0(X1)|v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_60, 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.40 cnf(i_0_51, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X2,X1)))).
% 0.19/0.40 cnf(i_0_50, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X1,X2)))).
% 0.19/0.40 cnf(i_0_68, plain, (k2_xboole_0(X1,k4_xboole_0(X2,X1))=k2_xboole_0(X1,X2))).
% 0.19/0.40 cnf(i_0_3, negated_conjecture, (m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))))).
% 0.19/0.40 cnf(i_0_18, plain, (r2_hidden(X1,X3)|X3!=k2_xboole_0(X4,X2)|~r2_hidden(X1,X2))).
% 0.19/0.40 cnf(i_0_19, plain, (r2_hidden(X1,X3)|X3!=k2_xboole_0(X2,X4)|~r2_hidden(X1,X2))).
% 0.19/0.40 cnf(i_0_74, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.19/0.40 cnf(i_0_45, plain, (v3_struct_0(X2)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v3_struct_0(k1_latsum_1(X1,X2)))).
% 0.19/0.40 cnf(i_0_49, plain, (v3_struct_0(X1)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v3_struct_0(k1_latsum_1(X1,X2)))).
% 0.19/0.40 cnf(i_0_73, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.19/0.40 cnf(i_0_20, plain, (r2_hidden(X1,X4)|r2_hidden(X1,X3)|X2!=k2_xboole_0(X3,X4)|~r2_hidden(X1,X2))).
% 0.19/0.40 cnf(i_0_1, negated_conjecture, (~r2_hidden(esk3_0,k4_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0))))).
% 0.19/0.40 cnf(i_0_37, plain, (m2_relset_1(u1_orders_2(X1),u1_struct_0(X1),u1_struct_0(X1))|~l1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_41, plain, (m1_relset_1(esk7_2(X1,X2),X1,X2))).
% 0.19/0.40 cnf(i_0_43, plain, (m2_relset_1(esk9_2(X1,X2),X1,X2))).
% 0.19/0.40 cnf(i_0_14, 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(X# There were 1 total branch saturation attempts.
% 0.19/0.40 # There were 0 of these attempts blocked.
% 0.19/0.40 # There were 0 deferred branch saturation attempts.
% 0.19/0.40 # There were 0 free duplicated saturations.
% 0.19/0.40 # There were 1 total successful branch saturations.
% 0.19/0.40 # There were 0 successful branch saturations in interreduction.
% 0.19/0.40 # There were 0 successful branch saturations on the branch.
% 0.19/0.40 # There were 1 successful branch saturations after the branch.
% 0.19/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.40 # Begin clausification derivation
% 0.19/0.40
% 0.19/0.40 # End clausification derivation
% 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.40 cnf(i_0_6, negated_conjecture, (l1_orders_2(esk1_0))).
% 0.19/0.40 cnf(i_0_4, negated_conjecture, (l1_orders_2(esk2_0))).
% 0.19/0.40 cnf(i_0_39, plain, (l1_orders_2(esk5_0))).
% 0.19/0.40 cnf(i_0_40, plain, (l1_struct_0(esk6_0))).
% 0.19/0.40 cnf(i_0_58, plain, (l1_struct_0(esk12_0))).
% 0.19/0.40 cnf(i_0_47, plain, (v1_xboole_0(k1_xboole_0))).
% 0.19/0.40 cnf(i_0_55, plain, (v1_xboole_0(esk10_0))).
% 0.19/0.40 cnf(i_0_7, negated_conjecture, (~v3_struct_0(esk1_0))).
% 0.19/0.40 cnf(i_0_5, negated_conjecture, (~v3_struct_0(esk2_0))).
% 0.19/0.40 cnf(i_0_57, plain, (~v3_struct_0(esk12_0))).
% 0.19/0.40 cnf(i_0_56, plain, (~v1_xboole_0(esk11_0))).
% 0.19/0.40 cnf(i_0_75, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))).
% 0.19/0.40 cnf(i_0_32, plain, (l1_struct_0(X1)|~l1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_72, plain, (k4_xboole_0(k1_xboole_0,X1)=k1_xboole_0)).
% 0.19/0.40 cnf(i_0_69, plain, (k4_xboole_0(X1,k1_xboole_0)=X1)).
% 0.19/0.40 cnf(i_0_65, plain, (k2_xboole_0(X1,k1_xboole_0)=X1)).
% 0.19/0.40 cnf(i_0_64, plain, (r1_tarski(X1,X1))).
% 0.19/0.40 cnf(i_0_54, plain, (k2_xboole_0(X1,X1)=X1)).
% 0.19/0.40 cnf(i_0_77, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))).
% 0.19/0.40 cnf(i_0_42, plain, (m1_subset_1(esk8_1(X1),X1))).
% 0.19/0.40 cnf(i_0_2, negated_conjecture, (~r2_hidden(esk3_0,u1_struct_0(esk1_0)))).
% 0.19/0.40 cnf(i_0_11, plain, (k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1))).
% 0.19/0.40 cnf(i_0_46, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(u1_struct_0(X1)))).
% 0.19/0.40 cnf(i_0_59, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(esk13_1(X1)))).
% 0.19/0.40 cnf(i_0_76, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))).
% 0.19/0.40 cnf(i_0_66, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))).
% 0.19/0.40 cnf(i_0_67, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))).
% 0.19/0.40 cnf(i_0_8, plain, (g1_orders_2(u1_struct_0(X1),u1_orders_2(X1))=X1|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_70, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))).
% 0.19/0.40 cnf(i_0_23, plain, (l1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_24, plain, (v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_30, plain, (v1_relat_1(k5_relat_1(X1,X2))|~v1_relat_1(X2)|~v1_relat_1(X1))).
% 0.19/0.40 cnf(i_0_9, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))).
% 0.19/0.40 cnf(i_0_71, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))).
% 0.19/0.40 cnf(i_0_44, plain, (v3_struct_0(X2)|v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_48, plain, (v3_struct_0(X1)|v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_60, 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.40 cnf(i_0_51, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X2,X1)))).
% 0.19/0.40 cnf(i_0_50, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X1,X2)))).
% 0.19/0.40 cnf(i_0_68, plain, (k2_xboole_0(X1,k4_xboole_0(X2,X1))=k2_xboole_0(X1,X2))).
% 0.19/0.40 cnf(i_0_3, negated_conjecture, (m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))))).
% 0.19/0.40 cnf(i_0_18, plain, (r2_hidden(X1,X3)|X3!=k2_xboole_0(X4,X2)|~r2_hidden(X1,X2))).
% 0.19/0.40 cnf(i_0_19, plain, (r2_hidden(X1,X3)|X3!=k2_xboole_0(X2,X4)|~r2_hidden(X1,X2))).
% 0.19/0.40 cnf(i_0_74, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.19/0.40 cnf(i_0_45, plain, (v3_struct_0(X2)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v3_struct_0(k1_latsum_1(X1,X2)))).
% 0.19/0.40 cnf(i_0_49, plain, (v3_struct_0(X1)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v3_struct_0(k1_latsum_1(X1,X2)))).
% 0.19/0.40 cnf(i_0_73, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.19/0.40 cnf(i_0_20, plain, (r2_hidden(X1,X4)|r2_hidden(X1,X3)|X2!=k2_xboole_0(X3,X4)|~r2_hidden(X1,X2))).
% 0.19/0.40 cnf(i_0_1, negated_conjecture, (~r2_hidden(esk3_0,k4_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0))))).
% 0.19/0.40 cnf(i_0_37, plain, (m2_relset_1(u1_orders_2(X1),u1_struct_0(X1),u1_struct_0(X1))|~l1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_41, plain, (m1_relset_1(esk7_2(X1,X2),X1,X2))).
% 0.19/0.40 cnf(i_0_43, plain, (m2_relset_1(esk9_2(X1,X2),X1,X2))).
% 0.19/0.40 cnf(i_0_14, 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.19/0.40 cnf(i_0_21, plain, (l1_orders_2(g1_orders_2(X1,X2))|~m1_relset_1(X2,X1,X1))).
% 0.19/0.40 cnf(i_0_22, plain, (v1_orders_2(g1_orders_2(X1,X2))|~m1_relset_1(X2,X1,X1))).
% 0.19/0.40 cnf(i_0_10, plain, (v1_relat_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))).
% 0.19/0.40 cnf(i_0_52, plain, (X1=X2|g1_orders_2(X3,X1)!=g1_orders_2(X4,X2)|~m1_relset_1(X1,X3,X3))).
% 0.19/0.40 cnf(i_0_53, plain, (X1=X2|g1_orders_2(X1,X3)!=g1_orders_2(X2,X4)|~m1_relset_1(X3,X1,X1))).
% 0.19/0.40 cnf(i_0_63, plain, (m1_relset_1(X1,X2,X3)|~m2_relset_1(X1,X2,X3))).
% 0.19/0.40 cnf(i_0_62, plain, (m2_relset_1(X1,X2,X3)|~m1_relset_1(X1,X2,X3))).
% 0.19/0.40 cnf(i_0_36, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m2_relset_1(X1,X2,X3))).
% 0.19/0.40 cnf(i_0_15, 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.19/0.40 cnf(i_0_16, plain, (X3=k2_xboole_0(X1,X2)|~r2_hidden(esk4_3(X1,X2,X3),X3)|~r2_hidden(esk4_3(X1,X2,X3),X2))).
% 0.19/0.40 cnf(i_0_17, plain, (X3=k2_xboole_0(X1,X2)|~r2_hidden(esk4_3(X1,X2,X3),X3)|~r2_hidden(esk4_3(X1,X2,X3),X1))).
% 0.19/0.40 cnf(i_0_61, 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.19/0.40 cnf(i_0_13, 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.19/0.40 cnf(i_0_31, 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.19/0.40 cnf(i_0_12, 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.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.40 # Begin printing tableau
% 0.19/0.40 # Found 5 steps
% 0.19/0.40 cnf(i_0_4, negated_conjecture, (l1_orders_2(esk2_0)), inference(start_rule)).
% 0.19/0.40 cnf(i_0_83, plain, (l1_orders_2(esk2_0)), inference(extension_rule, [i_0_32])).
% 0.19/0.40 cnf(i_0_483, plain, (l1_struct_0(esk2_0)), inference(extension_rule, [i_0_46])).
% 0.19/0.40 cnf(i_0_490, plain, (v3_struct_0(esk2_0)), inference(closure_rule, [i_0_5])).
% 0.19/0.40 cnf(i_0_492, plain, (~v1_xboole_0(u1_struct_0(esk2_0))), inference(etableau_closure_rule, [i_0_492, ...])).
% 0.19/0.40 # End printing tableau
% 0.19/0.40 # SZS output end
% 0.19/0.40 # Branches closed with saturation will be marked with an "s"
% 0.19/0.40 # There were 1 total branch saturation attempts.
% 0.19/0.40 # There were 0 of these attempts blocked.
% 0.19/0.40 # There were 0 deferred branch saturation attempts.
% 0.19/0.40 # There were 0 free duplicated saturations.
% 0.19/0.40 # There were 1 total successful branch saturations.
% 0.19/0.40 # There were 0 successful branch saturations in interreduction.
% 0.19/0.40 # There were 0 successful branch saturations on the branch.
% 0.19/0.40 # There were 1 successful branch saturations after the branch.
% 0.19/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.40 # Begin clausification derivation
% 0.19/0.40
% 0.19/0.40 # End clausification derivation
% 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.40 cnf(i_0_6, negated_conjecture, (l1_orders_2(esk1_0))).
% 0.19/0.40 cnf(i_0_4, negated_conjecture, (l1_orders_2(esk2_0))).
% 0.19/0.40 cnf(i_0_39, plain, (l1_orders_2(esk5_0))).
% 0.19/0.40 cnf(i_0_40, plain, (l1_struct_0(esk6_0))).
% 0.19/0.40 cnf(i_0_58, plain, (l1_struct_0(esk12_0))).
% 0.19/0.40 cnf(i_0_47, plain, (v1_xboole_0(k1_xboole_0))).
% 0.19/0.40 cnf(i_0_55, plain, (v1_xboole_0(esk10_0))).
% 0.19/0.40 cnf(i_0_7, negated_conjecture, (~v3_struct_0(esk1_0))).
% 0.19/0.40 cnf(i_0_5, negated_conjecture, (~v3_struct_0(esk2_0))).
% 0.19/0.40 cnf(i_0_57, plain, (~v3_struct_0(esk12_0))).
% 0.19/0.40 cnf(i_0_56, plain, (~v1_xboole_0(esk11_0))).
% 0.19/0.40 cnf(i_0_75, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))).
% 0.19/0.40 cnf(i_0_32, plain, (l1_struct_0(X1)|~l1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_72, plain, (k4_xboole_0(k1_xboole_0,X1)=k1_xboole_0)).
% 0.19/0.40 cnf(i_0_69, plain, (k4_xboole_0(X1,k1_xboole_0)=X1)).
% 0.19/0.40 cnf(i_0_65, plain, (k2_xboole_0(X1,k1_xboole_0)=X1)).
% 0.19/0.40 cnf(i_0_64, plain, (r1_tarski(X1,X1))).
% 0.19/0.40 cnf(i_0_54, plain, (k2_xboole_0(X1,X1)=X1)).
% 0.19/0.40 cnf(i_0_77, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))).
% 0.19/0.40 cnf(i_0_42, plain, (m1_subset_1(esk8_1(X1),X1))).
% 0.19/0.40 cnf(i_0_2, negated_conjecture, (~r2_hidden(esk3_0,u1_struct_0(esk1_0)))).
% 0.19/0.40 cnf(i_0_11, plain, (k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1))).
% 0.19/0.40 cnf(i_0_46, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(u1_struct_0(X1)))).
% 0.19/0.40 cnf(i_0_59, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(esk13_1(X1)))).
% 0.19/0.40 cnf(i_0_76, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))).
% 0.19/0.40 cnf(i_0_66, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))).
% 0.19/0.40 cnf(i_0_67, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))).
% 0.19/0.40 cnf(i_0_8, plain, (g1_orders_2(u1_struct_0(X1),u1_orders_2(X1))=X1|~l1_orders_2(X1)|~v1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_70, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))).
% 0.19/0.40 cnf(i_0_23, plain, (l1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_24, plain, (v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_30, plain, (v1_relat_1(k5_relat_1(X1,X2))|~v1_relat_1(X2)|~v1_relat_1(X1))).
% 0.19/0.40 cnf(i_0_9, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))).
% 0.19/0.40 cnf(i_0_71, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))).
% 0.19/0.40 cnf(i_0_44, plain, (v3_struct_0(X2)|v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_48, plain, (v3_struct_0(X1)|v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_60, 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.40 cnf(i_0_51, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X2,X1)))).
% 0.19/0.40 cnf(i_0_50, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X1,X2)))).
% 0.19/0.40 cnf(i_0_68, plain, (k2_xboole_0(X1,k4_xboole_0(X2,X1))=k2_xboole_0(X1,X2))).
% 0.19/0.40 cnf(i_0_3, negated_conjecture, (m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))))).
% 0.19/0.40 cnf(i_0_18, plain, (r2_hidden(X1,X3)|X3!=k2_xboole_0(X4,X2)|~r2_hidden(X1,X2))).
% 0.19/0.40 cnf(i_0_19, plain, (r2_hidden(X1,X3)|X3!=k2_xboole_0(X2,X4)|~r2_hidden(X1,X2))).
% 0.19/0.40 cnf(i_0_74, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.19/0.40 cnf(i_0_45, plain, (v3_struct_0(X2)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v3_struct_0(k1_latsum_1(X1,X2)))).
% 0.19/0.40 cnf(i_0_49, plain, (v3_struct_0(X1)|~l1_orders_2(X2)|~l1_orders_2(X1)|~v3_struct_0(k1_latsum_1(X1,X2)))).
% 0.19/0.40 cnf(i_0_73, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.19/0.40 cnf(i_0_20, plain, (r2_hidden(X1,X4)|r2_hidden(X1,X3)|X2!=k2_xboole_0(X3,X4)|~r2_hidden(X1,X2))).
% 0.19/0.40 cnf(i_0_1, negated_conjecture, (~r2_hidden(esk3_0,k4_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0))))).
% 0.19/0.40 cnf(i_0_37, plain, (m2_relset_1(u1_orders_2(X1),u1_struct_0(X1),u1_struct_0(X1))|~l1_orders_2(X1))).
% 0.19/0.40 cnf(i_0_41, plain, (m1_relset_1(esk7_2(X1,X2),X1,X2))).
% 0.19/0.40 cnf(i_0_43, plain, (m2_relset_1(esk9_2(X1,X2),X1,X2))).
% 0.19/0.40 cnf(i_0_14, 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.19/0.40 cnf(i_0_21, plain, (l1_orders_2(g1_orders_2(X1,X2))|~m1_relset_1(X2,X1,X1))).
% 0.19/0.40 cnf(i_0_22, plain, (v1_orders_2(g1_orders_2(X1,X2))|~m1_relset_1(X2,X1,X1))).
% 0.19/0.40 cnf(i_0_10, plain, (v1_relat_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))).
% 0.19/0.40 cnf(i_0_52, plain, (X1=X2|g1_orders_2(X3,X1)!=g1_orders_2(X4,X2)|~m1_relset_1(X1,X3,X3))).
% 0.19/0.40 cnf(i_0_53, plain, (X1=X2|g1_orders_2(X1,X3)!=g1_orders_2(X2,X4)|~m1_relset_1(X3,X1,X1))).
% 0.19/0.40 cnf(i_0_63, plain, (m1_relset_1(X1,X2,X3)|~m2_relset_1(X1,X2,X3))).
% 0.19/0.40 cnf(i_0_62, plain, (m2_relset_1(X1,X2,X3)|~m1_relset_1(X1,X2,X3))).
% 0.19/0.40 cnf(i_0_36, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m2_relset_1(X1,X2,X3))).
% 0.19/0.40 cnf(i_0_15, 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.19/0.40 cnf(i_0_16, plain, (X3=k2_xboole_0(X1,X2)|~r2_hidden(esk4_3(X1,X2,X3),X3)|~r2_hidden(esk4_3(X1,X2,X3),X2))).
% 0.19/0.40 cnf(i_0_17, plain, (X3=k2_xboole_0(X1,X2)|~r2_hidden(esk4_3(X1,X2,X3),X3)|~r2_hidden(esk4_3(X1,X2,X3),X1))).
% 0.19/0.40 cnf(i_0_61, 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.19/0.40 cnf(i_0_13, 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.19/0.40 cnf(i_0_31, 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.19/0.40 cnf(i_0_12, 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.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.40 # Begin printing tableau
% 0.19/0.40 # Found 5 steps
% 0.19/0.40 cnf(i_0_6, negated_conjecture, (l1_orders_2(esk1_0)), inference(start_rule)).
% 0.19/0.40 cnf(i_0_84, plain, (l1_orders_2(esk1_0)), inference(extension_rule, [i_0_32])).
% 0.19/0.40 cnf(i_0_483, plain, (l1_struct_0(esk1_0)), inference(extension_rule, [i_0_46])).
% 0.19/0.40 cnf(i_0_490, plain, (v3_struct_0(esk1_0)), inference(closure_rule, [i_0_7])).
% 0.19/0.40 cnf(i_0_492, plain, (~v1_xboole_0(u1_struct_0(esk1_0))), inference(etableau_closure_rule, [i_0_492, ...])).
% 0.19/0.40 # End printing tableau
% 0.19/0.40 # SZS output end
% 0.19/0.40 # Branches closed with saturation will be marked with an "s"
% 0.19/0.40 # Child (27782) has found a proof.
% 0.19/0.40
% 0.19/0.40 # Proof search is over...
% 0.19/0.40 # Freeing feature tree
%------------------------------------------------------------------------------