TSTP Solution File: SET980+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET980+1 : TPTP v8.1.0. Bugfixed v4.0.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 : n019.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:04:14 EDT 2022
% Result : Theorem 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET980+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 20:08:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 20 Number of unprocessed: 20
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 20 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 4 conjectures.
% 0.13/0.37 # There are 4 start rule candidates:
% 0.13/0.37 # Found 11 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 4 start rule tableaux created.
% 0.13/0.37 # 9 extension rule candidate clauses
% 0.13/0.37 # 11 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 4
% 0.13/0.37 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 11 tableaux to operate on
% 0.13/0.39 # There were 1 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 1 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 1 successful branch saturations after the branch.
% 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # Begin clausification derivation
% 0.13/0.39
% 0.13/0.39 # End clausification derivation
% 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.39 cnf(i_0_19, negated_conjecture, (cartesian_product2(esk6_0,esk7_0)=cartesian_product2(esk4_0,esk5_0))).
% 0.13/0.39 cnf(i_0_6, plain, (empty(empty_set))).
% 0.13/0.39 cnf(i_0_11, plain, (empty(esk2_0))).
% 0.13/0.39 cnf(i_0_13, plain, (cartesian_product2(X1,empty_set)=empty_set)).
% 0.13/0.39 cnf(i_0_14, plain, (cartesian_product2(empty_set,X1)=empty_set)).
% 0.13/0.39 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.13/0.39 cnf(i_0_18, negated_conjecture, (esk4_0!=empty_set)).
% 0.13/0.39 cnf(i_0_17, negated_conjecture, (esk5_0!=empty_set)).
% 0.13/0.39 cnf(i_0_12, plain, (~empty(esk3_0))).
% 0.13/0.39 cnf(i_0_4, plain, (~in(X1,empty_set))).
% 0.13/0.39 cnf(i_0_7, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.13/0.39 cnf(i_0_16, negated_conjecture, (esk6_0!=esk4_0|esk7_0!=esk5_0)).
% 0.13/0.39 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.13/0.39 cnf(i_0_15, plain, (X1=empty_set|X2=empty_set|cartesian_product2(X1,X2)!=empty_set)).
% 0.13/0.39 cnf(i_0_3, plain, (X1=empty_set|in(esk1_1(X1),X1))).
% 0.13/0.39 cnf(i_0_21, plain, (X1=X2|~in(esk8_2(X1,X2),X2)|~in(esk8_2(X1,X2),X1))).
% 0.13/0.39 cnf(i_0_9, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)))).
% 0.13/0.39 cnf(i_0_10, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)))).
% 0.13/0.39 cnf(i_0_20, plain, (X1=X2|in(esk8_2(X1,X2),X1)|in(esk8_2(X1,X2),X2))).
% 0.13/0.39 cnf(i_0_8, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.39 # Begin printing tableau
% 0.13/0.39 # Found 4 steps
% 0.13/0.39 cnf(i_0_17, negated_conjecture, (esk5_0!=empty_set), inference(start_rule)).
% 0.13/0.39 cnf(i_0_27, plain, (esk5_0!=empty_set), inference(extension_rule, [i_0_3])).
% 0.13/0.39 cnf(i_0_80, plain, (in(esk1_1(esk5_0),esk5_0)), inference(extension_rule, [i_0_1])).
% 0.13/0.39 cnf(i_0_97, plain, (~in(esk5_0,esk1_1(esk5_0))), inference(etableau_closure_rule, [i_0_97, ...])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches closed with saturation will be marked with an "s"
% 0.13/0.39 # There were 1 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 1 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 1 successful branch saturations after the branch.
% 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # Begin clausification derivation
% 0.13/0.39
% 0.13/0.39 # End clausification derivation
% 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.39 cnf(i_0_19, negated_conjecture, (cartesian_product2(esk6_0,esk7_0)=cartesian_product2(esk4_0,esk5_0))).
% 0.13/0.39 cnf(i_0_6, plain, (empty(empty_set))).
% 0.13/0.39 cnf(i_0_11, plain, (empty(esk2_0))).
% 0.13/0.39 cnf(i_0_13, plain, (cartesian_product2(X1,empty_set)=empty_set)).
% 0.13/0.39 cnf(i_0_14, plain, (cartesian_product2(empty_set,X1)=empty_set)).
% 0.13/0.39 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.13/0.39 cnf(i_0_18, negated_conjecture, (esk4_0!=empty_set)).
% 0.13/0.39 cnf(i_0_17, negated_conjecture, (esk5_0!=empty_set)).
% 0.13/0.39 cnf(i_0_12, plain, (~empty(esk3_0))).
% 0.13/0.39 cnf(i_0_4, plain, (~in(X1,empty_set))).
% 0.13/0.39 cnf(i_0_7, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.13/0.39 cnf(i_0_16, negated_conjecture, (esk6_0!=esk4_0|esk7_0!=esk5_0)).
% 0.13/0.39 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.13/0.39 cnf(i_0_15, plain, (X1=empty_set|X2=empty_set|cartesian_product2(X1,X2)!=empty_set)).
% 0.13/0.39 cnf(i_0_3, plain, (X1=empty_set|in(esk1_1(X1),X1))).
% 0.13/0.39 cnf(i_0_21, plain, (X1=X2|~in(esk8_2(X1,X2),X2)|~in(esk8_2(X1,X2),X1))).
% 0.13/0.39 cnf(i_0_9, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)))).
% 0.13/0.39 cnf(i_0_10, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)))).
% 0.13/0.39 cnf(i_0_20, plain, (X1=X2|in(esk8_2(X1,X2),X1)|in(esk8_2(X1,X2),X2))).
% 0.13/0.39 cnf(i_0_8, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.39 # Begin printing tableau
% 0.13/0.39 # Found 5 steps
% 0.13/0.39 cnf(i_0_17, negated_conjecture, (esk5_0!=empty_set), inference(start_rule)).
% 0.13/0.39 cnf(i_0_27, plain, (esk5_0!=empty_set), inference(extension_rule, [i_0_20])).
% 0.13/0.39 cnf(i_0_90, plain, (in(esk8_2(esk5_0,empty_set),empty_set)), inference(closure_rule, [i_0_4])).
% 0.13/0.39 cnf(i_0_89, plain, (in(esk8_2(esk5_0,empty_set),esk5_0)), inference(extension_rule, [i_0_1])).
% 0.13/0.39 cnf(i_0_97, plain, (~in(esk5_0,esk8_2(esk5_0,empty_set))), inference(etableau_closure_rule, [i_0_97, ...])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches closed with saturation will be marked with an "s"
% 0.13/0.39 # There were 1 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 1 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 1 successful branch saturations after the branch.
% 0.13/0.39 # There were 1 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 1 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 1 successful branch saturations after the branch.
% 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # Begin clausification derivation
% 0.13/0.39
% 0.13/0.39 # End clausification derivation
% 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.39 cnf(i_0_19, negated_conjecture, (cartesian_product2(esk6_0,esk7_0)=cartesian_product2(esk4_0,esk5_0))).
% 0.13/0.39 cnf(i_0_6, plain, (empty(empty_set))).
% 0.13/0.39 cnf(i_0_11, plain, (empty(esk2_0))).
% 0.13/0.39 cnf(i_0_13, plain, (cartesian_product2(X1,empty_set)=empty_set)).
% 0.13/0.39 cnf(i_0_14, plain, (cartesian_product2(empty_set,X1)=empty_set)).
% 0.13/0.39 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.13/0.39 cnf(i_0_18, negated_conjecture, (esk4_0!=empty_set)).
% 0.13/0.39 cnf(i_0_17, negated_conjecture, (esk5_0!=empty_set)).
% 0.13/0.39 cnf(i_0_12, plain, (~empty(esk3_0))).
% 0.13/0.39 cnf(i_0_4, plain, (~in(X1,empty_set))).
% 0.13/0.39 cnf(i_0_7, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.13/0.39 cnf(i_0_16, negated_conjecture, (esk6_0!=esk4_0|esk7_0!=esk5_0)).
% 0.13/0.39 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.13/0.39 cnf(i_0_15, plain, (X1=empty_set|X2=empty_set|cartesian_product2(X1,X2)!=empty_set)).
% 0.13/0.39 cnf(i_0_3, plain, (X1=empty_set|in(esk1_1(X1),X1))).
% 0.13/0.39 cnf(i_0_21, plain, (X1=X2|~in(esk8_2(X1,X2),X2)|~in(esk8_2(X1,X2),X1))).
% 0.13/0.39 cnf(i_0_9, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)))).
% 0.13/0.39 cnf(i_0_10, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)))).
% 0.13/0.39 cnf(i_0_20, plain, (X1=X2|in(esk8_2(X1,X2),X1)|in(esk8_2(X1,X2),X2))).
% 0.13/0.39 cnf(i_0_8, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.39 # Begin printing tableau
% 0.13/0.39 # Found 6 steps
% 0.13/0.39 cnf(i_0_17, negated_conjecture, (esk5_0!=empty_set), inference(start_rule)).
% 0.13/0.39 cnf(i_0_27, plain, (esk5_0!=empty_set), inference(extension_rule, [i_0_15])).
% 0.13/0.39 cnf(i_0_76, plain, (esk5_0=empty_set), inference(closure_rule, [i_0_17])).
% 0.13/0.39 cnf(i_0_78, plain, (cartesian_product2(esk5_0,esk5_0)!=empty_set), inference(extension_rule, [i_0_15])).
% 0.13/0.39 cnf(i_0_99, plain, (esk5_0=empty_set), inference(closure_rule, [i_0_17])).
% 0.13/0.39 cnf(i_0_100, plain, (cartesian_product2(cartesian_product2(esk5_0,esk5_0),esk5_0)!=empty_set), inference(etableau_closure_rule, [i_0_100, ...])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches closed with saturation will be marked with an "s"
% 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # Begin clausification derivation
% 0.13/0.39
% 0.13/0.39 # End clausification derivation
% 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.39 cnf(i_0_19, negated_conjecture, (cartesian_product2(esk6_0,esk7_0)=cartesian_product2(esk4_0,esk5_0))).
% 0.13/0.39 cnf(i_0_6, plain, (empty(empty_set))).
% 0.13/0.39 cnf(i_0_11, plain, (empty(esk2_0))).
% 0.13/0.39 cnf(i_0_13, plain, (cartesian_product2(X1,empty_set)=empty_set)).
% 0.13/0.39 cnf(i_0_14, plain, (cartesian_product2(empty_set,X1)=empty_set)).
% 0.13/0.39 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.13/0.39 cnf(i_0_18, negated_conjecture, (esk4_0!=empty_set)).
% 0.13/0.39 cnf(i_0_17, negated_conjecture, (esk5_0!=empty_set)).
% 0.13/0.39 cnf(i_0_12, plain, (~empty(esk3_0))).
% 0.13/0.39 cnf(i_0_4, plain, (~in(X1,empty_set))).
% 0.13/0.39 cnf(i_0_7, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.13/0.39 cnf(i_0_16, negated_conjecture, (esk6_0!=esk4_0|esk7_0!=esk5_0)).
% 0.13/0.39 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.13/0.39 cnf(i_0_15, plain, (X1=empty_set|X2=empty_set|cartesian_product2(X1,X2)!=empty_set)).
% 0.13/0.39 cnf(i_0_3, plain, (X1=empty_set|in(esk1_1(X1),X1))).
% 0.13/0.39 cnf(i_0_21, plain, (X1=X2|~in(esk8_2(X1,X2),X2)|~in(esk8_2(X1,X2),X1))).
% 0.13/0.39 cnf(i_0_9, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)))).
% 0.13/0.39 cnf(i_0_10, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)))).
% 0.13/0.39 cnf(i_0_20, plain, (X1=X2|in(esk8_2(X1,X2),X1)|in(esk8_2(X1,X2),X2))).
% 0.13/0.39 cnf(i_0_8, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.39 # Begin printing tableau
% 0.13/0.39 # Found 5 steps
% 0.13/0.39 cnf(i_0_18, negated_conjecture, (esk4_0!=empty_set), inference(start_rule)).
% 0.13/0.39 cnf(i_0_28, plain, (esk4_0!=empty_set), inference(extension_rule, [i_0_15])).
% 0.13/0.39 cnf(i_0_99, plain, (esk5_0=empty_set), inference(closure_rule, [i_0_17])).
% 0.13/0.39 cnf(i_0_100, plain, (cartesian_product2(esk4_0,esk5_0)!=empty_set), inference(extension_rule, [i_0_3])).
% 0.13/0.39 cnf(i_0_104, plain, (in(esk1_1(cartesian_product2(esk4_0,esk5_0)),cartesian_product2(esk4_0,esk5_0))), inference(etableau_closure_rule, [i_0_104, ...])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches closed with saturation will be marked with an "s"
% 0.13/0.39 # There were 1 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 1 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 1 successful branch saturations after the branch.
% 0.13/0.39 # Child (10475) has found a proof.
% 0.13/0.39
% 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # Begin clausification derivation
% 0.13/0.39
% 0.13/0.39 # End clausification derivation
% 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.39 cnf(i_0_19, negated_conjecture, (cartesian_product2(esk6_0,esk7_0)=cartesian_product2(esk4_0,esk5_0))).
% 0.13/0.39 cnf(i_0_6, plain, (empty(empty_set))).
% 0.13/0.39 cnf(i_0_11, plain, (empty(esk2_0))).
% 0.13/0.39 cnf(i_0_13, plain, (cartesian_product2(X1,empty_set)=empty_set)).
% 0.13/0.39 cnf(i_0_14, plain, (cartesian_product2(empty_set,X1)=empty_set)).
% 0.13/0.39 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.13/0.39 cnf(i_0_18, negated_conjecture, (esk4_0!=empty_set)).
% 0.13/0.39 cnf(i_0_17, negated_conjecture, (esk5_0!=empty_set)).
% 0.13/0.39 cnf(i_0_12, plain, (~empty(esk3_0))).
% 0.13/0.39 cnf(i_0_4, plain, (~in(X1,empty_set))).
% 0.13/0.39 cnf(i_0_7, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.13/0.39 cnf(i_0_16, negated_conjecture, (esk6_0!=esk4_0|esk7_0!=esk5_0)).
% 0.13/0.39 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.13/0.39 cnf(i_0_15, plain, (X1=empty_set|X2=empty_set|cartesian_product2(X1,X2)!=empty_set)).
% 0.13/0.39 cnf(i_0_3, plain, (X1=empty_set|in(esk1_1(X1),X1))).
% 0.13/0.39 cnf(i_0_21, plain, (X1=X2|~in(esk8_2(X1,X2),X2)|~in(esk8_2(X1,X2),X1))).
% 0.13/0.39 cnf(i_0_9, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)))).
% 0.13/0.39 cnf(i_0_10, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)))).
% 0.13/0.39 cnf(i_0_20, plain, (X1=X2|in(esk8_2(X1,X2),X1)|in(esk8_2(X1,X2),X2))).
% 0.13/0.39 cnf(i_0_8, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.39 # Begin printing tableau
% 0.13/0.39 # Found 6 steps
% 0.13/0.39 cnf(i_0_17, negated_conjecture, (esk5_0!=empty_set), inference(start_rule)).
% 0.13/0.39 cnf(i_0_27, plain, (esk5_0!=empty_set), inference(extension_rule, [i_0_15])).
% 0.13/0.39 cnf(i_0_77, plain, (esk5_0=empty_set), inference(closure_rule, [i_0_17])).
% 0.13/0.39 cnf(i_0_78, plain, (cartesian_product2(esk5_0,esk5_0)!=empty_set), inference(extension_rule, [i_0_15])).
% 0.13/0.39 cnf(i_0_99, plain, (esk5_0=empty_set), inference(closure_rule, [i_0_17])).
% 0.13/0.39 cnf(i_0_100, plain, (cartesian_product2(cartesian_product2(esk5_0,esk5_0),esk5_0)!=empty_set), inference(etableau_closure_rule, [i_0_100, ...])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches closed with saturation will be marked with an "s"
% 0.13/0.39 # Proof search is over...
% 0.13/0.39 # Freeing feature tree
%------------------------------------------------------------------------------