TSTP Solution File: SET909+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET909+1 : TPTP v8.1.0. Released v3.2.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 : n029.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 01:03:45 EDT 2022
% Result : Theorem 0.19s 0.37s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET909+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 16:47:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.36 # No SInE strategy applied
% 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.36 #
% 0.19/0.36 # Presaturation interreduction done
% 0.19/0.36 # Number of axioms: 24 Number of unprocessed: 24
% 0.19/0.36 # Tableaux proof search.
% 0.19/0.36 # APR header successfully linked.
% 0.19/0.36 # Hello from C++
% 0.19/0.36 # The folding up rule is enabled...
% 0.19/0.36 # Local unification is enabled...
% 0.19/0.36 # Any saturation attempts will use folding labels...
% 0.19/0.36 # 24 beginning clauses after preprocessing and clausification
% 0.19/0.36 # Creating start rules for all 1 conjectures.
% 0.19/0.36 # There are 1 start rule candidates:
% 0.19/0.36 # Found 10 unit axioms.
% 0.19/0.36 # 1 start rule tableaux created.
% 0.19/0.36 # 14 extension rule candidate clauses
% 0.19/0.36 # 10 unit axiom clauses
% 0.19/0.36
% 0.19/0.36 # Requested 8, 32 cores available to the main process.
% 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.36 # Creating equality axioms
% 0.19/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.36 # Returning from population with 25 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.36 # We now have 25 tableaux to operate on
% 0.19/0.37 # There were 1 total branch saturation attempts.
% 0.19/0.37 # There were 0 of these attempts blocked.
% 0.19/0.37 # There were 0 deferred branch saturation attempts.
% 0.19/0.37 # There were 0 free duplicated saturations.
% 0.19/0.37 # There were 1 total successful branch saturations.
% 0.19/0.37 # There were 0 successful branch saturations in interreduction.
% 0.19/0.37 # There were 0 successful branch saturations on the branch.
% 0.19/0.37 # There were 1 successful branch saturations after the branch.
% 0.19/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 # Begin clausification derivation
% 0.19/0.37
% 0.19/0.37 # End clausification derivation
% 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.37 cnf(i_0_18, plain, (empty(empty_set))).
% 0.19/0.37 cnf(i_0_22, plain, (empty(esk4_0))).
% 0.19/0.37 cnf(i_0_21, plain, (set_union2(X1,X1)=X1)).
% 0.19/0.37 cnf(i_0_24, negated_conjecture, (set_union2(esk8_0,unordered_pair(esk6_0,esk7_0))=empty_set)).
% 0.19/0.37 cnf(i_0_9, plain, (in(X1,unordered_pair(X2,X1)))).
% 0.19/0.37 cnf(i_0_10, plain, (in(X1,unordered_pair(X1,X2)))).
% 0.19/0.37 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.19/0.37 cnf(i_0_3, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.19/0.37 cnf(i_0_23, plain, (~empty(esk5_0))).
% 0.19/0.37 cnf(i_0_5, plain, (~in(X1,empty_set))).
% 0.19/0.37 cnf(i_0_4, plain, (X1=empty_set|in(esk1_1(X1),X1))).
% 0.19/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.19/0.37 cnf(i_0_20, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.19/0.37 cnf(i_0_19, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.19/0.37 cnf(i_0_15, plain, (in(X1,set_union2(X2,X3))|~in(X1,X3))).
% 0.19/0.37 cnf(i_0_16, plain, (in(X1,set_union2(X2,X3))|~in(X1,X2))).
% 0.19/0.37 cnf(i_0_11, plain, (X1=X2|X1=X3|~in(X1,unordered_pair(X3,X2)))).
% 0.19/0.37 cnf(i_0_7, plain, (X1=unordered_pair(X2,X3)|esk2_3(X2,X3,X1)!=X3|~in(esk2_3(X2,X3,X1),X1))).
% 0.19/0.37 cnf(i_0_8, plain, (X1=unordered_pair(X2,X3)|esk2_3(X2,X3,X1)!=X2|~in(esk2_3(X2,X3,X1),X1))).
% 0.19/0.37 cnf(i_0_13, plain, (X1=set_union2(X2,X3)|~in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X3))).
% 0.19/0.37 cnf(i_0_17, plain, (in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2)))).
% 0.19/0.37 cnf(i_0_14, plain, (X1=set_union2(X2,X3)|~in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X2))).
% 0.19/0.37 cnf(i_0_6, plain, (esk2_3(X1,X2,X3)=X1|esk2_3(X1,X2,X3)=X2|X3=unordered_pair(X1,X2)|in(esk2_3(X1,X2,X3),X3))).
% 0.19/0.37 cnf(i_0_12, plain, (X1=set_union2(X2,X3)|in(esk3_3(X2,X3,X1),X2)|in(esk3_3(X2,X3,X1),X3)|in(esk3_3(X2,X3,X1),X1))).
% 0.19/0.37 cnf(i_0_73, plain, (X43=X43)).
% 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.37 # Begin printing tableau
% 0.19/0.37 # Found 5 steps
% 0.19/0.37 cnf(i_0_18, plain, (empty(empty_set)), inference(start_rule)).
% 0.19/0.37 cnf(i_0_81, plain, (empty(empty_set)), inference(extension_rule, [i_0_80])).
% 0.19/0.37 cnf(i_0_185, plain, (empty(esk5_0)), inference(closure_rule, [i_0_23])).
% 0.19/0.37 cnf(i_0_186, plain, (empty_set!=esk5_0), inference(extension_rule, [i_0_4])).
% 0.19/0.37 cnf(i_0_189, plain, (in(esk1_1(esk5_0),esk5_0)), inference(etableau_closure_rule, [i_0_189, ...])).
% 0.19/0.37 # End printing tableau
% 0.19/0.37 # SZS output end
% 0.19/0.37 # Branches closed with saturation will be marked with an "s"
% 0.19/0.37 # There were 1 total branch saturation attempts.
% 0.19/0.37 # There were 0 of these attempts blocked.
% 0.19/0.37 # There were 0 deferred branch saturation attempts.
% 0.19/0.37 # There were 0 free duplicated saturations.
% 0.19/0.37 # There were 1 total successful branch saturations.
% 0.19/0.37 # There were 0 successful branch saturations in interreduction.
% 0.19/0.37 # There were 0 successful branch saturations on the branch.
% 0.19/0.37 # There were 1 successful branch saturations after the branch.
% 0.19/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 # Begin clausification derivation
% 0.19/0.37
% 0.19/0.37 # End clausification derivation
% 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.37 cnf(i_0_18, plain, (empty(empty_set))).
% 0.19/0.37 cnf(i_0_22, plain, (empty(esk4_0))).
% 0.19/0.37 cnf(i_0_21, plain, (set_union2(X1,X1)=X1)).
% 0.19/0.37 cnf(i_0_24, negated_conjecture, (set_union2(esk8_0,unordered_pair(esk6_0,esk7_0))=empty_set)).
% 0.19/0.37 cnf(i_0_9, plain, (in(X1,unordered_pair(X2,X1)))).
% 0.19/0.37 cnf(i_0_10, plain, (in(X1,unordered_pair(X1,X2)))).
% 0.19/0.37 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.19/0.37 cnf(i_0_3, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.19/0.37 cnf(i_0_23, plain, (~empty(esk5_0))).
% 0.19/0.37 cnf(i_0_5, plain, (~in(X1,empty_set))).
% 0.19/0.37 cnf(i_0_4, plain, (X1=empty_set|in(esk1_1(X1),X1))).
% 0.19/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.19/0.37 cnf(i_0_20, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.19/0.37 cnf(i_0_19, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.19/0.37 cnf(i_0_15, plain, (in(X1,set_union2(X2,X3))|~in(X1,X3))).
% 0.19/0.37 cnf(i_0_16, plain, (in(X1,set_union2(X2,X3))|~in(X1,X2))).
% 0.19/0.37 cnf(i_0_11, plain, (X1=X2|X1=X3|~in(X1,unordered_pair(X3,X2)))).
% 0.19/0.37 cnf(i_0_7, plain, (X1=unordered_pair(X2,X3)|esk2_3(X2,X3,X1)!=X3|~in(esk2_3(X2,X3,X1),X1))).
% 0.19/0.37 cnf(i_0_8, plain, (X1=unordered_pair(X2,X3)|esk2_3(X2,X3,X1)!=X2|~in(esk2_3(X2,X3,X1),X1))).
% 0.19/0.37 cnf(i_0_13, plain, (X1=set_union2(X2,X3)|~in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X3))).
% 0.19/0.37 cnf(i_0_17, plain, (in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2)))).
% 0.19/0.37 cnf(i_0_14, plain, (X1=set_union2(X2,X3)|~in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X2))).
% 0.19/0.37 cnf(i_0_6, plain, (esk2_3(X1,X2,X3)=X1|esk2_3(X1,X2,X3)=X2|X3=unordered_pair(X1,X2)|in(esk2_3(X1,X2,X3),X3))).
% 0.19/0.37 cnf(i_0_12, plain, (X1=set_union2(X2,X3)|in(esk3_3(X2,X3,X1),X2)|in(esk3_3(X2,X3,X1),X3)|in(esk3_3(X2,X3,X1),X1))).
% 0.19/0.37 cnf(i_0_73, plain, (X43=X43)).
% 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.37 # Begin printing tableau
% 0.19/0.37 # Found 6 steps
% 0.19/0.37 cnf(i_0_22, plain, (empty(esk4_0)), inference(start_rule)).
% 0.19/0.37 cnf(i_0_82, plain, (empty(esk4_0)), inference(extension_rule, [i_0_80])).
% 0.19/0.37 cnf(i_0_243, plain, (empty(esk5_0)), inference(closure_rule, [i_0_23])).
% 0.19/0.37 cnf(i_0_244, plain, (esk4_0!=esk5_0), inference(extension_rule, [i_0_11])).
% 0.19/0.37 cnf(i_0_259, plain, (esk4_0=esk5_0), inference(closure_rule, [i_0_244])).
% 0.19/0.37 cnf(i_0_260, plain, (~in(esk4_0,unordered_pair(esk5_0,esk5_0))), inference(etableau_closure_rule, [i_0_260, ...])).
% 0.19/0.37 # End printing tableau
% 0.19/0.37 # SZS output end
% 0.19/0.37 # Branches closed with saturation will be marked with an "s"
% 0.19/0.37 # There were 1 total branch saturation attempts.
% 0.19/0.37 # There were 0 of these attempts blocked.
% 0.19/0.37 # There were 0 deferred branch saturation attempts.
% 0.19/0.37 # There were 0 free duplicated saturations.
% 0.19/0.37 # There were 1 total successful branch saturations.
% 0.19/0.37 # There were 0 successful branch saturations in interreduction.
% 0.19/0.37 # There were 0 successful branch saturations on the branch.
% 0.19/0.37 # There were 1 successful branch saturations after the branch.
% 0.19/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 # Begin clausification derivation
% 0.19/0.37
% 0.19/0.37 # End clausification derivation
% 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.37 cnf(i_0_18, plain, (empty(empty_set))).
% 0.19/0.37 cnf(i_0_22, plain, (empty(esk4_0))).
% 0.19/0.37 cnf(i_0_21, plain, (set_union2(X1,X1)=X1)).
% 0.19/0.37 cnf(i_0_24, negated_conjecture, (set_union2(esk8_0,unordered_pair(esk6_0,esk7_0))=empty_set)).
% 0.19/0.37 cnf(i_0_9, plain, (in(X1,unordered_pair(X2,X1)))).
% 0.19/0.37 cnf(i_0_10, plain, (in(X1,unordered_pair(X1,X2)))).
% 0.19/0.37 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.19/0.37 cnf(i_0_3, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.19/0.37 cnf(i_0_23, plain, (~empty(esk5_0))).
% 0.19/0.37 cnf(i_0_5, plain, (~in(X1,empty_set))).
% 0.19/0.37 cnf(i_0_4, plain, (X1=empty_set|in(esk1_1(X1),X1))).
% 0.19/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.19/0.37 cnf(i_0_20, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.19/0.37 cnf(i_0_19, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.19/0.37 cnf(i_0_15, plain, (in(X1,set_union2(X2,X3))|~in(X1,X3))).
% 0.19/0.37 cnf(i_0_16, plain, (in(X1,set_union2(X2,X3))|~in(X1,X2))).
% 0.19/0.37 cnf(i_0_11, plain, (X1=X2|X1=X3|~in(X1,unordered_pair(X3,X2)))).
% 0.19/0.37 cnf(i_0_7, plain, (X1=unordered_pair(X2,X3)|esk2_3(X2,X3,X1)!=X3|~in(esk2_3(X2,X3,X1),X1))).
% 0.19/0.37 cnf(i_0_8, plain, (X1=unordered_pair(X2,X3)|esk2_3(X2,X3,X1)!=X2|~in(esk2_3(X2,X3,X1),X1))).
% 0.19/0.37 cnf(i_0_13, plain, (X1=set_union2(X2,X3)|~in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X3))).
% 0.19/0.37 cnf(i_0_17, plain, (in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2)))).
% 0.19/0.37 cnf(i_0_14, plain, (X1=set_union2(X2,X3)|~in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X2))).
% 0.19/0.37 cnf(i_0_6, plain, (esk2_3(X1,X2,X3)=X1|esk2_3(X1,X2,X3)=X2|X3=unordered_pair(X1,X2)|in(esk2_3(X1,X2,X3),X3))).
% 0.19/0.37 cnf(i_0_12, plain, (X1=set_union2(X2,X3)|in(esk3_3(X2,X3,X1),X2)|in(esk3_3(X2,X3,X1),X3)|in(esk3_3(X2,X3,X1),X1))).
% 0.19/0.37 cnf(i_0_73, plain, (X43=X43)).
% 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.37 # Begin printing tableau
% 0.19/0.37 # Found 7 steps
% 0.19/0.37 cnf(i_0_24, negated_conjecture, (set_union2(esk8_0,unordered_pair(esk6_0,esk7_0))=empty_set), inference(start_rule)).
% 0.19/0.37 cnf(i_0_84, plain, (set_union2(esk8_0,unordered_pair(esk6_0,esk7_0))=empty_set), inference(extension_rule, [i_0_76])).
% 0.19/0.37 cnf(i_0_232, plain, (set_union2(empty_set,empty_set)!=empty_set), inference(closure_rule, [i_0_21])).
% 0.19/0.37 cnf(i_0_230, plain, (set_union2(esk8_0,unordered_pair(esk6_0,esk7_0))=set_union2(empty_set,empty_set)), inference(extension_rule, [i_0_77])).
% 0.19/0.37 cnf(i_0_275, plain, (in(set_union2(empty_set,empty_set),empty_set)), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_277, plain, (set_union2(empty_set,empty_set)!=empty_set), inference(closure_rule, [i_0_21])).
% 0.19/0.37 cnf(i_0_278, plain, (~in(set_union2(esk8_0,unordered_pair(esk6_0,esk7_0)),set_union2(empty_set,empty_set))), inference(etableau_closure_rule, [i_0_278, ...])).
% 0.19/0.37 # End printing tableau
% 0.19/0.37 # SZS output end
% 0.19/0.37 # Branches closed with saturation will be marked with an "s"
% 0.19/0.37 # There were 1 total branch saturation attempts.
% 0.19/0.37 # There were 0 of these attempts blocked.
% 0.19/0.37 # There were 0 deferred branch saturation attempts.
% 0.19/0.37 # There were 0 free duplicated saturations.
% 0.19/0.37 # There were 1 total successful branch saturations.
% 0.19/0.37 # There were 0 successful branch saturations in interreduction.
% 0.19/0.37 # There were 0 successful branch saturations on the branch.
% 0.19/0.37 # There were 1 successful branch saturations after the branch.
% 0.19/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 # Begin clausification derivation
% 0.19/0.37
% 0.19/0.37 # End clausification derivation
% 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.37 cnf(i_0_18, plain, (empty(empty_set))).
% 0.19/0.37 cnf(i_0_22, plain, (empty(esk4_0))).
% 0.19/0.37 cnf(i_0_21, plain, (set_union2(X1,X1)=X1)).
% 0.19/0.37 cnf(i_0_24, negated_conjecture, (set_union2(esk8_0,unordered_pair(esk6_0,esk7_0))=empty_set)).
% 0.19/0.37 cnf(i_0_9, plain, (in(X1,unordered_pair(X2,X1)))).
% 0.19/0.37 cnf(i_0_10, plain, (in(X1,unordered_pair(X1,X2)))).
% 0.19/0.37 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.19/0.37 cnf(i_0_3, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.19/0.37 cnf(i_0_23, plain, (~empty(esk5_0))).
% 0.19/0.37 cnf(i_0_5, plain, (~in(X1,empty_set))).
% 0.19/0.37 cnf(i_0_4, plain, (X1=empty_set|in(esk1_1(X1),X1))).
% 0.19/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.19/0.37 cnf(i_0_20, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.19/0.37 cnf(i_0_19, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.19/0.37 cnf(i_0_15, plain, (in(X1,set_union2(X2,X3))|~in(X1,X3))).
% 0.19/0.37 cnf(i_0_16, plain, (in(X1,set_union2(X2,X3))|~in(X1,X2))).
% 0.19/0.37 cnf(i_0_11, plain, (X1=X2|X1=X3|~in(X1,unordered_pair(X3,X2)))).
% 0.19/0.37 cnf(i_0_7, plain, (X1=unordered_pair(X2,X3)|esk2_3(X2,X3,X1)!=X3|~in(esk2_3(X2,X3,X1),X1))).
% 0.19/0.37 cnf(i_0_8, plain, (X1=unordered_pair(X2,X3)|esk2_3(X2,X3,X1)!=X2|~in(esk2_3(X2,X3,X1),X1))).
% 0.19/0.37 cnf(i_0_13, plain, (X1=set_union2(X2,X3)|~in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X3))).
% 0.19/0.37 cnf(i_0_17, plain, (in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2)))).
% 0.19/0.37 cnf(i_0_14, plain, (X1=set_union2(X2,X3)|~in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X2))).
% 0.19/0.37 cnf(i_0_6, plain, (esk2_3(X1,X2,X3)=X1|esk2_3(X1,X2,X3)=X2|X3=unordered_pair(X1,X2)|in(esk2_3(X1,X2,X3),X3))).
% 0.19/0.37 cnf(i_0_12, plain, (X1=set_union2(X2,X3)|in(esk3_3(X2,X3,X1),X2)|in(esk3_3(X2,X3,X1),X3)|in(esk3_3(X2,X3,X1),X1))).
% 0.19/0.37 cnf(i_0_73, plain, (X43=X43)).
% 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.37 # Begin printing tableau
% 0.19/0.37 # Found 7 steps
% 0.19/0.37 cnf(i_0_21, plain, (set_union2(X2,X2)=X2), inference(start_rule)).
% 0.19/0.37 cnf(i_0_83, plain, (set_union2(X2,X2)=X2), inference(extension_rule, [i_0_76])).
% 0.19/0.37 cnf(i_0_231, plain, (set_union2(set_union2(X2,X2),set_union2(X2,X2))!=set_union2(X2,X2)), inference(closure_rule, [i_0_21])).
% 0.19/0.37 cnf(i_0_230, plain, (set_union2(set_union2(X2,X2),set_union2(X2,X2))=X2), inference(extension_rule, [i_0_77])).
% 0.19/0.37 cnf(i_0_275, plain, (in(X2,empty_set)), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_277, plain, (set_union2(empty_set,empty_set)!=empty_set), inference(closure_rule, [i_0_21])).
% 0.19/0.37 cnf(i_0_278, plain, (~in(set_union2(set_union2(X2,X2),set_union2(X2,X2)),set_union2(empty_set,empty_set))), inference(etableau_closure_rule, [i_0_278, ...])).
% 0.19/0.37 # End printing tableau
% 0.19/0.37 # SZS output end
% 0.19/0.37 # Branches closed with saturation will be marked with an "s"
% 0.19/0.37 # Child (25355) has found a proof.
% 0.19/0.37
% 0.19/0.37 # Proof search is over...
% 0.19/0.37 # Freeing feature tree
%------------------------------------------------------------------------------