TSTP Solution File: SEU154+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU154+1 : TPTP v8.1.0. Released v3.3.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:24:15 EDT 2022
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU154+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/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 : n028.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 Jun 19 12:05:00 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___300_C01_F1_SE_CS_SP_S0Y
% 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.13/0.37 #
% 0.13/0.37 # Number of axioms: 29 Number of unprocessed: 29
% 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 # 29 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 2 conjectures.
% 0.13/0.37 # There are 2 start rule candidates:
% 0.13/0.37 # Found 9 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 2 start rule tableaux created.
% 0.13/0.37 # 20 extension rule candidate clauses
% 0.13/0.37 # 9 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 2
% 0.13/0.37 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 8 tableaux to operate on
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 1 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 1 successful branch saturations after the branch.
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 1 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 1 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_24, plain, (empty(empty_set))).
% 0.13/0.38 cnf(i_0_28, plain, (empty(esk6_0))).
% 0.13/0.38 cnf(i_0_29, plain, (~empty(esk7_0))).
% 0.13/0.38 cnf(i_0_32, plain, (subset(empty_set,X1))).
% 0.13/0.38 cnf(i_0_30, plain, (subset(X1,X1))).
% 0.13/0.38 cnf(i_0_25, plain, (set_intersection2(X1,X1)=X1)).
% 0.13/0.38 cnf(i_0_27, negated_conjecture, (~in(esk4_0,esk5_0))).
% 0.13/0.38 cnf(i_0_4, plain, (subset(X1,X2)|X1!=X2)).
% 0.13/0.38 cnf(i_0_5, plain, (subset(X1,X2)|X1!=X2)).
% 0.13/0.38 cnf(i_0_26, negated_conjecture, (~disjoint(singleton(esk4_0),esk5_0))).
% 0.13/0.38 cnf(i_0_8, plain, (in(X1,X3)|X1!=X2|X3!=singleton(X2))).
% 0.13/0.38 cnf(i_0_2, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 0.13/0.38 cnf(i_0_9, plain, (X1=X3|X2!=singleton(X3)|~in(X1,X2))).
% 0.13/0.38 cnf(i_0_20, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))).
% 0.13/0.38 cnf(i_0_19, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)).
% 0.13/0.38 cnf(i_0_31, plain, (disjoint(X2,X1)|~disjoint(X1,X2))).
% 0.13/0.38 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.13/0.38 cnf(i_0_3, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 0.13/0.38 cnf(i_0_11, plain, (subset(X1,X2)|in(esk2_2(X1,X2),X1))).
% 0.13/0.38 cnf(i_0_12, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))).
% 0.13/0.38 cnf(i_0_6, plain, (X2=singleton(X1)|esk1_2(X1,X2)=X1|in(esk1_2(X1,X2),X2))).
% 0.13/0.38 cnf(i_0_17, plain, (in(X1,X2)|X3!=set_intersection2(X4,X2)|~in(X1,X3))).
% 0.13/0.38 cnf(i_0_18, plain, (in(X1,X2)|X3!=set_intersection2(X2,X4)|~in(X1,X3))).
% 0.13/0.38 cnf(i_0_10, plain, (subset(X1,X2)|~in(esk2_2(X1,X2),X2))).
% 0.13/0.38 cnf(i_0_16, plain, (in(X1,X4)|X4!=set_intersection2(X2,X3)|~in(X1,X3)|~in(X1,X2))).
% 0.13/0.38 cnf(i_0_7, plain, (X2=singleton(X1)|esk1_2(X1,X2)!=X1|~in(esk1_2(X1,X2),X2))).
% 0.13/0.38 cnf(i_0_13, plain, (X3=set_intersection2(X1,X2)|in(esk3_3(X1,X2,X3),X3)|in(esk3_3(X1,X2,X3),X2))).
% 0.13/0.38 cnf(i_0_14, plain, (X3=set_intersection2(X1,X2)|in(esk3_3(X1,X2,X3),X3)|in(esk3_3(X1,X2,X3),X1))).
% 0.13/0.38 cnf(i_0_15, plain, (X3=set_intersection2(X1,X2)|~in(esk3_3(X1,X2,X3),X3)|~in(esk3_3(X1,X2,X3),X2)|~in(esk3_3(X1,X2,X3),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 6 steps
% 0.13/0.38 cnf(i_0_27, negated_conjecture, (~in(esk4_0,esk5_0)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_34, plain, (~in(esk4_0,esk5_0)), inference(extension_rule, [i_0_18])).
% 0.13/0.38 cnf(i_0_122, plain, (set_intersection2(set_intersection2(esk5_0,X7),set_intersection2(esk5_0,X7))!=set_intersection2(esk5_0,X7)), inference(closure_rule, [i_0_25])).
% 0.13/0.38 cnf(i_0_123, plain, (~in(esk4_0,set_intersection2(set_intersection2(esk5_0,X7),set_intersection2(esk5_0,X7)))), inference(extension_rule, [i_0_8])).
% 0.13/0.38 cnf(i_0_256, plain, (esk4_0!=set_intersection2(esk4_0,esk4_0)), inference(closure_rule, [i_0_25])).
% 0.13/0.38 cnf(i_0_257, plain, (set_intersection2(set_intersection2(esk5_0,X7),set_intersection2(esk5_0,X7))!=singleton(set_intersection2(esk4_0,esk4_0))), inference(etableau_closure_rule, [i_0_257, ...])).
% 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 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_24, plain, (empty(empty_set))).
% 0.13/0.38 cnf(i_0_28, plain, (empty(esk6_0))).
% 0.13/0.38 cnf(i_0_29, plain, (~empty(esk7_0))).
% 0.13/0.38 cnf(i_0_32, plain, (subset(empty_set,X1))).
% 0.13/0.38 cnf(i_0_30, plain, (subset(X1,X1))).
% 0.13/0.38 cnf(i_0_25, plain, (set_intersection2(X1,X1)=X1)).
% 0.13/0.38 cnf(i_0_27, negated_conjecture, (~in(esk4_0,esk5_0))).
% 0.13/0.38 cnf(i_0_4, plain, (subset(X1,X2)|X1!=X2)).
% 0.13/0.38 cnf(i_0_5, plain, (subset(X1,X2)|X1!=X2)).
% 0.13/0.38 cnf(i_0_26, negated_conjecture, (~disjoint(singleton(esk4_0),esk5_0))).
% 0.13/0.38 cnf(i_0_8, plain, (in(X1,X3)|X1!=X2|X3!=singleton(X2))).
% 0.13/0.38 cnf(i_0_2, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 0.13/0.38 cnf(i_0_9, plain, (X1=X3|X2!=singleton(X3)|~in(X1,X2))).
% 0.13/0.38 cnf(i_0_20, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))).
% 0.13/0.38 cnf(i_0_19, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)).
% 0.13/0.38 cnf(i_0_31, plain, (disjoint(X2,X1)|~disjoint(X1,X2))).
% 0.13/0.38 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.13/0.38 cnf(i_0_3, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 0.13/0.38 cnf(i_0_11, plain, (subset(X1,X2)|in(esk2_2(X1,X2),X1))).
% 0.13/0.38 cnf(i_0_12, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))).
% 0.13/0.38 cnf(i_0_6, plain, (X2=singleton(X1)|esk1_2(X1,X2)=X1|in(esk1_2(X1,X2),X2))).
% 0.13/0.38 cnf(i_0_17, plain, (in(X1,X2)|X3!=set_intersection2(X4,X2)|~in(X1,X3))).
% 0.13/0.38 cnf(i_0_18, plain, (in(X1,X2)|X3!=set_intersection2(X2,X4)|~in(X1,X3))).
% 0.13/0.38 cnf(i_0_10, plain, (subset(X1,X2)|~in(esk2_2(X1,X2),X2))).
% 0.13/0.38 cnf(i_0_16, plain, (in(X1,X4)|X4!=set_intersection2(X2,X3)|~in(X1,X3)|~in(X1,X2))).
% 0.13/0.38 cnf(i_0_7, plain, (X2=singleton(X1)|esk1_2(X1,X2)!=X1|~in(esk1_2(X1,X2),X2))).
% 0.13/0.38 cnf(i_0_13, plain, (X3=set_intersection2(X1,X2)|in(esk3_3(X1,X2,X3),X3)|in(esk3_3(X1,X2,X3),X2))).
% 0.13/0.38 cnf(i_0_14, plain, (X3=set_intersection2(X1,X2)|in(esk3_3(X1,X2,X3),X3)|in(esk3_3(X1,X2,X3),X1))).
% 0.13/0.38 cnf(i_0_15, plain, (X3=set_intersection2(X1,X2)|~in(esk3_3(X1,X2,X3),X3)|~in(esk3_3(X1,X2,X3),X2)|~in(esk3_3(X1,X2,X3),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 6 steps
% 0.13/0.38 cnf(i_0_27, negated_conjecture, (~in(esk4_0,esk5_0)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_34, plain, (~in(esk4_0,esk5_0)), inference(extension_rule, [i_0_12])).
% 0.13/0.38 cnf(i_0_114, plain, (~subset(empty_set,esk5_0)), inference(closure_rule, [i_0_32])).
% 0.13/0.38 cnf(i_0_113, plain, (~in(esk4_0,empty_set)), inference(extension_rule, [i_0_8])).
% 0.13/0.38 cnf(i_0_256, plain, (esk4_0!=set_intersection2(esk4_0,esk4_0)), inference(closure_rule, [i_0_25])).
% 0.13/0.38 cnf(i_0_257, plain, (singleton(set_intersection2(esk4_0,esk4_0))!=empty_set), inference(etableau_closure_rule, [i_0_257, ...])).
% 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 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 1 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 1 successful branch saturations after the branch.
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 1 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 1 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_24, plain, (empty(empty_set))).
% 0.13/0.38 cnf(i_0_28, plain, (empty(esk6_0))).
% 0.13/0.38 cnf(i_0_29, plain, (~empty(esk7_0))).
% 0.13/0.38 cnf(i_0_32, plain, (subset(empty_set,X1))).
% 0.13/0.38 cnf(i_0_30, plain, (subset(X1,X1))).
% 0.13/0.38 cnf(i_0_25, plain, (set_intersection2(X1,X1)=X1)).
% 0.13/0.38 cnf(i_0_27, negated_conjecture, (~in(esk4_0,esk5_0))).
% 0.13/0.38 cnf(i_0_4, plain, (subset(X1,X2)|X1!=X2)).
% 0.13/0.38 cnf(i_0_5, plain, (subset(X1,X2)|X1!=X2)).
% 0.13/0.38 cnf(i_0_26, negated_conjecture, (~disjoint(singleton(esk4_0),esk5_0))).
% 0.13/0.38 cnf(i_0_8, plain, (in(X1,X3)|X1!=X2|X3!=singleton(X2))).
% 0.13/0.38 cnf(i_0_2, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 0.13/0.38 cnf(i_0_9, plain, (X1=X3|X2!=singleton(X3)|~in(X1,X2))).
% 0.13/0.38 cnf(i_0_20, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))).
% 0.13/0.38 cnf(i_0_19, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)).
% 0.13/0.38 cnf(i_0_31, plain, (disjoint(X2,X1)|~disjoint(X1,X2))).
% 0.13/0.38 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.13/0.38 cnf(i_0_3, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 0.13/0.38 cnf(i_0_11, plain, (subset(X1,X2)|in(esk2_2(X1,X2),X1))).
% 0.13/0.38 cnf(i_0_12, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))).
% 0.13/0.38 cnf(i_0_6, plain, (X2=singleton(X1)|esk1_2(X1,X2)=X1|in(esk1_2(X1,X2),X2))).
% 0.13/0.38 cnf(i_0_17, plain, (in(X1,X2)|X3!=set_intersection2(X4,X2)|~in(X1,X3))).
% 0.13/0.38 cnf(i_0_18, plain, (in(X1,X2)|X3!=set_intersection2(X2,X4)|~in(X1,X3))).
% 0.13/0.38 cnf(i_0_10, plain, (subset(X1,X2)|~in(esk2_2(X1,X2),X2))).
% 0.13/0.38 cnf(i_0_16, plain, (in(X1,X4)|X4!=set_intersection2(X2,X3)|~in(X1,X3)|~in(X1,X2))).
% 0.13/0.38 cnf(i_0_7, plain, (X2=singleton(X1)|esk1_2(X1,X2)!=X1|~in(esk1_2(X1,X2),X2))).
% 0.13/0.38 cnf(i_0_13, plain, (X3=set_intersection2(X1,X2)|in(esk3_3(X1,X2,X3),X3)|in(esk3_3(X1,X2,X3),X2))).
% 0.13/0.38 cnf(i_0_14, plain, (X3=set_intersection2(X1,X2)|in(esk3_3(X1,X2,X3),X3)|in(esk3_3(X1,X2,X3),X1))).
% 0.13/0.38 cnf(i_0_15, plain, (X3=set_intersection2(X1,X2)|~in(esk3_3(X1,X2,X3),X3)|~in(esk3_3(X1,X2,X3),X2)|~in(esk3_3(X1,X2,X3),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 6 steps
% 0.13/0.38 cnf(i_0_27, negated_conjecture, (~in(esk4_0,esk5_0)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_34, plain, (~in(esk4_0,esk5_0)), inference(extension_rule, [i_0_17])).
% 0.13/0.38 cnf(i_0_119, plain, (set_intersection2(set_intersection2(X7,esk5_0),set_intersection2(X7,esk5_0))!=set_intersection2(X7,esk5_0)), inference(closure_rule, [i_0_25])).
% 0.13/0.38 cnf(i_0_120, plain, (~in(esk4_0,set_intersection2(set_intersection2(X7,esk5_0),set_intersection2(X7,esk5_0)))), inference(extension_rule, [i_0_8])).
% 0.13/0.38 cnf(i_0_256, plain, (esk4_0!=set_intersection2(esk4_0,esk4_0)), inference(closure_rule, [i_0_25])).
% 0.13/0.38 cnf(i_0_257, plain, (set_intersection2(set_intersection2(X7,esk5_0),set_intersection2(X7,esk5_0))!=singleton(set_intersection2(esk4_0,esk4_0))), inference(etableau_closure_rule, [i_0_257, ...])).
% 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 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_24, plain, (empty(empty_set))).
% 0.13/0.38 cnf(i_0_28, plain, (empty(esk6_0))).
% 0.13/0.38 cnf(i_0_29, plain, (~empty(esk7_0))).
% 0.13/0.38 cnf(i_0_32, plain, (subset(empty_set,X1))).
% 0.13/0.38 cnf(i_0_30, plain, (subset(X1,X1))).
% 0.13/0.38 cnf(i_0_25, plain, (set_intersection2(X1,X1)=X1)).
% 0.13/0.38 cnf(i_0_27, negated_conjecture, (~in(esk4_0,esk5_0))).
% 0.13/0.38 cnf(i_0_4, plain, (subset(X1,X2)|X1!=X2)).
% 0.13/0.38 cnf(i_0_5, plain, (subset(X1,X2)|X1!=X2)).
% 0.13/0.38 cnf(i_0_26, negated_conjecture, (~disjoint(singleton(esk4_0),esk5_0))).
% 0.13/0.38 cnf(i_0_8, plain, (in(X1,X3)|X1!=X2|X3!=singleton(X2))).
% 0.13/0.38 cnf(i_0_2, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 0.13/0.38 cnf(i_0_9, plain, (X1=X3|X2!=singleton(X3)|~in(X1,X2))).
% 0.13/0.38 cnf(i_0_20, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))).
% 0.13/0.38 cnf(i_0_19, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)).
% 0.13/0.38 cnf(i_0_31, plain, (disjoint(X2,X1)|~disjoint(X1,X2))).
% 0.13/0.38 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.13/0.38 cnf(i_0_3, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 0.13/0.38 cnf(i_0_11, plain, (subset(X1,X2)|in(esk2_2(X1,X2),X1))).
% 0.13/0.38 cnf(i_0_12, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))).
% 0.13/0.38 cnf(i_0_6, plain, (X2=singleton(X1)|esk1_2(X1,X2)=X1|in(esk1_2(X1,X2),X2))).
% 0.13/0.38 cnf(i_0_17, plain, (in(X1,X2)|X3!=set_intersection2(X4,X2)|~in(X1,X3))).
% 0.13/0.38 cnf(i_0_18, plain, (in(X1,X2)|X3!=set_intersection2(X2,X4)|~in(X1,X3))).
% 0.13/0.38 cnf(i_0_10, plain, (subset(X1,X2)|~in(esk2_2(X1,X2),X2))).
% 0.13/0.38 cnf(i_0_16, plain, (in(X1,X4)|X4!=set_intersection2(X2,X3)|~in(X1,X3)|~in(X1,X2))).
% 0.13/0.38 cnf(i_0_7, plain, (X2=singleton(X1)|esk1_2(X1,X2)!=X1|~in(esk1_2(X1,X2),X2))).
% 0.13/0.38 cnf(i_0_13, plain, (X3=set_intersection2(X1,X2)|in(esk3_3(X1,X2,X3),X3)|in(esk3_3(X1,X2,X3),X2))).
% 0.13/0.38 cnf(i_0_14, plain, (X3=set_intersection2(X1,X2)|in(esk3_3(X1,X2,X3),X3)|in(esk3_3(X1,X2,X3),X1))).
% 0.13/0.38 cnf(i_0_15, plain, (X3=set_intersection2(X1,X2)|~in(esk3_3(X1,X2,X3),X3)|~in(esk3_3(X1,X2,X3),X2)|~in(esk3_3(X1,X2,X3),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 4 steps
% 0.13/0.38 cnf(i_0_26, negated_conjecture, (~disjoint(singleton(esk4_0),esk5_0)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_33, plain, (~disjoint(singleton(esk4_0),esk5_0)), inference(extension_rule, [i_0_31])).
% 0.13/0.38 cnf(i_0_50, plain, (~disjoint(esk5_0,singleton(esk4_0))), inference(extension_rule, [i_0_19])).
% 0.13/0.38 cnf(i_0_264, plain, (set_intersection2(esk5_0,singleton(esk4_0))!=empty_set), inference(etableau_closure_rule, [i_0_264, ...])).
% 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 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 1 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 1 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_24, plain, (empty(empty_set))).
% 0.13/0.38 cnf(i_0_28, plain, (empty(esk6_0))).
% 0.13/0.38 cnf(i_0_29, plain, (~empty(esk7_0))).
% 0.13/0.38 cnf(i_0_32, plain, (subset(empty_set,X1))).
% 0.13/0.38 cnf(i_0_30, plain, (subset(X1,X1))).
% 0.13/0.38 cnf(i_0_25, plain, (set_intersection2(X1,X1)=X1)).
% 0.13/0.38 cnf(i_0_27, negated_conjecture, (~in(esk4_0,esk5_0))).
% 0.13/0.38 cnf(i_0_4, plain, (subset(X1,X2)|X1!=X2)).
% 0.13/0.38 cnf(i_0_5, plain, (subset(X1,X2)|X1!=X2)).
% 0.13/0.38 cnf(i_0_26, negated_conjecture, (~disjoint(singleton(esk4_0),esk5_0))).
% 0.13/0.38 cnf(i_0_8, plain, (in(X1,X3)|X1!=X2|X3!=singleton(X2))).
% 0.13/0.38 cnf(i_0_2, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 0.13/0.38 cnf(i_0_9, plain, (X1=X3|X2!=singleton(X3)|~in(X1,X2))).
% 0.13/0.38 cnf(i_0_20, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))).
% 0.13/0.38 cnf(i_0_19, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)).
% 0.13/0.38 cnf(i_0_31, plain, (disjoint(X2,X1)|~disjoint(X1,X2))).
% 0.13/0.38 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.13/0.38 cnf(i_0_3, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 0.13/0.38 cnf(i_0_11, plain, (subset(X1,X2)|in(esk2_2(X1,X2),X1))).
% 0.13/0.38 cnf(i_0_12, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))).
% 0.13/0.38 cnf(i_0_6, plain, (X2=singleton(X1)|esk1_2(X1,X2)=X1|in(esk1_2(X1,X2),X2))).
% 0.13/0.38 cnf(i_0_17, plain, (in(X1,X2)|X3!=set_intersection2(X4,X2)|~in(X1,X3))).
% 0.13/0.38 cnf(i_0_18, plain, (in(X1,X2)|X3!=set_intersection2(X2,X4)|~in(X1,X3))).
% 0.13/0.38 cnf(i_0_10, plain, (subset(X1,X2)|~in(esk2_2(X1,X2),X2))).
% 0.13/0.38 cnf(i_0_16, plain, (in(X1,X4)|X4!=set_intersection2(X2,X3)|~in(X1,X3)|~in(X1,X2))).
% 0.13/0.38 cnf(i_0_7, plain, (X2=singleton(X1)|esk1_2(X1,X2)!=X1|~in(esk1_2(X1,X2),X2))).
% 0.13/0.38 cnf(i_0_13, plain, (X3=set_intersection2(X1,X2)|in(esk3_3(X1,X2,X3),X3)|in(esk3_3(X1,X2,X3),X2))).
% 0.13/0.38 cnf(i_0_14, plain, (X3=set_intersection2(X1,X2)|in(esk3_3(X1,X2,X3),X3)|in(esk3_3(X1,X2,X3),X1))).
% 0.13/0.38 cnf(i_0_15, plain, (X3=set_intersection2(X1,X2)|~in(esk3_3(X1,X2,X3),X3)|~in(esk3_3(X1,X2,X3),X2)|~in(esk3_3(X1,X2,X3),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 9 steps
% 0.13/0.38 cnf(i_0_27, negated_conjecture, (~in(esk4_0,esk5_0)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_34, plain, (~in(esk4_0,esk5_0)), inference(extension_rule, [i_0_16])).
% 0.13/0.38 cnf(i_0_128, plain, (~in(esk4_0,set_intersection2(singleton(set_intersection2(esk4_0,esk4_0)),singleton(set_intersection2(esk4_0,esk4_0))))), inference(extension_rule, [i_0_8])).
% 0.13/0.38 cnf(i_0_148, plain, (esk4_0!=set_intersection2(esk4_0,esk4_0)), inference(closure_rule, [i_0_25])).
% 0.13/0.38 cnf(i_0_149, plain, (set_intersection2(singleton(set_intersection2(esk4_0,esk4_0)),singleton(set_intersection2(esk4_0,esk4_0)))!=singleton(set_intersection2(esk4_0,esk4_0))), inference(closure_rule, [i_0_25])).
% 0.13/0.38 cnf(i_0_129, plain, (~in(esk4_0,set_intersection2(singleton(set_intersection2(esk4_0,esk4_0)),singleton(set_intersection2(esk4_0,esk4_0))))), inference(closure_rule, [i_0_128])).
% 0.13/0.38 cnf(i_0_127, plain, (set_intersection2(set_intersection2(singleton(set_intersection2(esk4_0,esk4_0)),singleton(set_intersection2(esk4_0,esk4_0))),set_intersection2(singleton(set_intersection2(esk4_0,esk4_0)),singleton(set_intersection2(esk4_0,esk4_0))))!=esk5_0), inference(extension_rule, [i_0_9])).
% 0.13/0.38 cnf(i_0_259, plain, (set_intersection2(singleton(esk5_0),singleton(esk5_0))!=singleton(esk5_0)), inference(closure_rule, [i_0_25])).
% 0.13/0.38 cnf(i_0_260, plain, (~in(set_intersection2(set_intersection2(singleton(set_intersection2(esk4_0,esk4_0)),singleton(set_intersection2(esk4_0,esk4_0))),set_intersection2(singleton(set_intersection2(esk4_0,esk4_0)),singleton(set_intersection2(esk4_0,esk4_0)))),set_intersection2(singleton(esk5_0),singleton(esk5_0)))), inference(etableau_closure_rule, [i_0_260, ...])).
% 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 (6578) has found a proof.
% 0.13/0.38
% 0.13/0.38 # Proof search is over...
% 0.13/0.38 # Freeing feature tree
%------------------------------------------------------------------------------