TSTP Solution File: SET810+4 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET810+4 : 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 : n026.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:02:46 EDT 2022
% Result : Theorem 0.19s 0.43s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET810+4 : TPTP v8.1.0. Released v3.2.0.
% 0.07/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 : n026.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 Jul 10 07:26:11 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.13/0.37 #
% 0.13/0.37 # Number of axioms: 82 Number of unprocessed: 82
% 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 # 82 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 5 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 # 77 extension rule candidate clauses
% 0.13/0.37 # 5 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 27 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 27 tableaux to operate on
% 0.19/0.43 # There were 4 total branch saturation attempts.
% 0.19/0.43 # There were 0 of these attempts blocked.
% 0.19/0.43 # There were 0 deferred branch saturation attempts.
% 0.19/0.43 # There were 1 free duplicated saturations.
% 0.19/0.43 # There were 4 total successful branch saturations.
% 0.19/0.43 # There were 0 successful branch saturations in interreduction.
% 0.19/0.43 # There were 0 successful branch saturations on the branch.
% 0.19/0.43 # There were 3 successful branch saturations after the branch.
% 0.19/0.43 # There were 4 total branch saturation attempts.
% 0.19/0.43 # There were 0 of these attempts blocked.
% 0.19/0.43 # There were 0 deferred branch saturation attempts.
% 0.19/0.43 # There were 1 free duplicated saturations.
% 0.19/0.43 # There were 4 total successful branch saturations.
% 0.19/0.43 # There were 0 successful branch saturations in interreduction.
% 0.19/0.43 # There were 0 successful branch saturations on the branch.
% 0.19/0.43 # There were 3 successful branch saturations after the branch.
% 0.19/0.43 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.43 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.43 # Begin clausification derivation
% 0.19/0.43
% 0.19/0.43 # End clausification derivation
% 0.19/0.43 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.43 cnf(i_0_82, negated_conjecture, (member(esk14_0,on))).
% 0.19/0.43 cnf(i_0_80, negated_conjecture, (member(esk14_0,esk15_0))).
% 0.19/0.43 cnf(i_0_81, negated_conjecture, (member(esk15_0,on))).
% 0.19/0.43 cnf(i_0_79, negated_conjecture, (member(esk15_0,esk14_0))).
% 0.19/0.43 cnf(i_0_15, plain, (~member(X1,empty_set))).
% 0.19/0.43 cnf(i_0_19, plain, (member(X1,singleton(X2))|X1!=X2)).
% 0.19/0.43 cnf(i_0_34, plain, (set(X1)|~member(X1,on))).
% 0.19/0.43 cnf(i_0_33, plain, (strict_well_order(member_predicate,X1)|~member(X1,on))).
% 0.19/0.43 cnf(i_0_73, plain, (set(X2)|~set(X1)|~member(X2,X1))).
% 0.19/0.43 cnf(i_0_20, plain, (X1=X2|~member(X1,singleton(X2)))).
% 0.19/0.43 cnf(i_0_5, plain, (subset(X1,X2)|~equal_set(X2,X1))).
% 0.19/0.43 cnf(i_0_6, plain, (subset(X1,X2)|~equal_set(X1,X2))).
% 0.19/0.43 cnf(i_0_39, plain, (strict_order(X1,X2)|~strict_well_order(X1,X2))).
% 0.19/0.43 cnf(i_0_7, plain, (member(X1,power_set(X2))|~subset(X1,X2))).
% 0.19/0.43 cnf(i_0_21, plain, (member(X1,unordered_pair(X3,X2))|X1!=X2)).
% 0.19/0.43 cnf(i_0_22, plain, (member(X1,unordered_pair(X2,X3))|X1!=X2)).
% 0.19/0.43 cnf(i_0_8, plain, (subset(X1,X2)|~member(X1,power_set(X2)))).
% 0.19/0.43 cnf(i_0_2, plain, (subset(X1,X2)|member(esk1_2(X1,X2),X1))).
% 0.19/0.43 cnf(i_0_32, plain, (subset(X1,X2)|~member(X1,X2)|~member(X2,on))).
% 0.19/0.43 cnf(i_0_3, plain, (member(X3,X2)|~subset(X1,X2)|~member(X3,X1))).
% 0.19/0.43 cnf(i_0_4, plain, (equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2))).
% 0.19/0.43 cnf(i_0_28, plain, (member(X1,product(X2))|member(esk3_2(X1,X2),X2))).
% 0.19/0.43 cnf(i_0_31, plain, (member(X1,on)|member(esk4_1(X1),X1)|~set(X1)|~strict_well_order(member_predicate,X1))).
% 0.19/0.43 cnf(i_0_12, plain, (member(X1,union(X3,X2))|~member(X1,X2))).
% 0.19/0.43 cnf(i_0_13, plain, (member(X1,union(X2,X3))|~member(X1,X2))).
% 0.19/0.43 cnf(i_0_24, plain, (member(X3,sum(X2))|~member(X3,X1)|~member(X1,X2))).
% 0.19/0.43 cnf(i_0_23, plain, (X1=X3|X1=X2|~member(X1,unordered_pair(X2,X3)))).
% 0.19/0.43 cnf(i_0_29, plain, (member(X1,X3)|~member(X3,X2)|~member(X1,product(X2)))).
% 0.19/0.43 cnf(i_0_25, plain, (member(X1,esk2_2(X1,X2))|~member(X1,sum(X2)))).
% 0.19/0.43 cnf(i_0_26, plain, (member(esk2_2(X1,X2),X2)|~member(X1,sum(X2)))).
% 0.19/0.43 cnf(i_0_30, plain, (member(X1,on)|~set(X1)|~strict_well_order(member_predicate,X1)|~subset(esk4_1(X1),X1))).
% 0.19/0.43 cnf(i_0_45, plain, (apply(member_predicate,X1,X2)|~member(X1,X2))).
% 0.19/0.43 cnf(i_0_16, plain, (member(X1,X3)|member(X1,difference(X2,X3))|~member(X1,X2))).
% 0.19/0.43 cnf(i_0_37, plain, (strict_well_order(X1,X2)|subset(esk6_2(X1,X2),X2)|~strict_order(X1,X2))).
% 0.19/0.43 cnf(i_0_10, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))).
% 0.19/0.43 cnf(i_0_11, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))).
% 0.19/0.43 cnf(i_0_18, plain, (member(X1,X2)|~member(X1,difference(X2,X3)))).
% 0.19/0.43 cnf(i_0_1, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))).
% 0.19/0.43 cnf(i_0_27, plain, (member(X1,product(X2))|~member(X1,esk3_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_78, plain, (member(X1,union(X2,singleton(X2)))|~member(X1,suc(X2)))).
% 0.19/0.43 cnf(i_0_9, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))).
% 0.19/0.43 cnf(i_0_17, plain, (~member(X1,X2)|~member(X1,difference(X3,X2)))).
% 0.19/0.43 cnf(i_0_14, plain, (member(X1,X3)|member(X1,X2)|~member(X1,union(X2,X3)))).
% 0.19/0.43 cnf(i_0_70, plain, (strict_order(X1,X2)|member(esk9_2(X1,X2),X2)|member(esk11_2(X1,X2),X2))).
% 0.19/0.43 cnf(i_0_69, plain, (strict_order(X1,X2)|member(esk9_2(X1,X2),X2)|member(esk12_2(X1,X2),X2))).
% 0.19/0.43 cnf(i_0_68, plain, (strict_order(X1,X2)|member(esk9_2(X1,X2),X2)|member(esk13_2(X1,X2),X2))).
% 0.19/0.43 cnf(i_0_64, plain, (strict_order(X1,X2)|member(esk10_2(X1,X2),X2)|member(esk11_2(X1,X2),X2))).
% 0.19/0.43 cnf(i_0_63, plain, (strict_order(X1,X2)|member(esk10_2(X1,X2),X2)|member(esk12_2(X1,X2),X2))).
% 0.19/0.43 cnf(i_0_62, plain, (strict_order(X1,X2)|member(esk10_2(X1,X2),X2)|member(esk13_2(X1,X2),X2))).
% 0.19/0.43 cnf(i_0_46, plain, (member(X1,X2)|~apply(member_predicate,X1,X2))).
% 0.19/0.43 cnf(i_0_44, plain, (member(X1,X2)|~least(X1,X3,X2))).
% 0.19/0.43 cnf(i_0_77, plain, (member(X1,suc(X2))|~member(X1,union(X2,singleton(X2))))).
% 0.19/0.43 cnf(i_0_36, plain, (strict_well_order(X1,X2)|member(esk7_2(X1,X2),esk6_2(X1,X2))|~strict_order(X1,X2))).
% 0.19/0.43 cnf(i_0_67, plain, (strict_order(X1# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.43 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.43 # Begin clausification derivation
% 0.19/0.43
% 0.19/0.43 # End clausification derivation
% 0.19/0.43 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.43 cnf(i_0_82, negated_conjecture, (member(esk14_0,on))).
% 0.19/0.43 cnf(i_0_80, negated_conjecture, (member(esk14_0,esk15_0))).
% 0.19/0.43 cnf(i_0_81, negated_conjecture, (member(esk15_0,on))).
% 0.19/0.43 cnf(i_0_79, negated_conjecture, (member(esk15_0,esk14_0))).
% 0.19/0.43 cnf(i_0_15, plain, (~member(X1,empty_set))).
% 0.19/0.43 cnf(i_0_19, plain, (member(X1,singleton(X2))|X1!=X2)).
% 0.19/0.43 cnf(i_0_34, plain, (set(X1)|~member(X1,on))).
% 0.19/0.43 cnf(i_0_33, plain, (strict_well_order(member_predicate,X1)|~member(X1,on))).
% 0.19/0.43 cnf(i_0_73, plain, (set(X2)|~set(X1)|~member(X2,X1))).
% 0.19/0.43 cnf(i_0_20, plain, (X1=X2|~member(X1,singleton(X2)))).
% 0.19/0.43 cnf(i_0_5, plain, (subset(X1,X2)|~equal_set(X2,X1))).
% 0.19/0.43 cnf(i_0_6, plain, (subset(X1,X2)|~equal_set(X1,X2))).
% 0.19/0.43 cnf(i_0_39, plain, (strict_order(X1,X2)|~strict_well_order(X1,X2))).
% 0.19/0.43 cnf(i_0_7, plain, (member(X1,power_set(X2))|~subset(X1,X2))).
% 0.19/0.43 cnf(i_0_21, plain, (member(X1,unordered_pair(X3,X2))|X1!=X2)).
% 0.19/0.43 cnf(i_0_22, plain, (member(X1,unordered_pair(X2,X3))|X1!=X2)).
% 0.19/0.43 cnf(i_0_8, plain, (subset(X1,X2)|~member(X1,power_set(X2)))).
% 0.19/0.43 cnf(i_0_2, plain, (subset(X1,X2)|member(esk1_2(X1,X2),X1))).
% 0.19/0.43 cnf(i_0_32, plain, (subset(X1,X2)|~member(X1,X2)|~member(X2,on))).
% 0.19/0.43 cnf(i_0_3, plain, (member(X3,X2)|~subset(X1,X2)|~member(X3,X1))).
% 0.19/0.43 cnf(i_0_4, plain, (equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2))).
% 0.19/0.43 cnf(i_0_28, plain, (member(X1,product(X2))|member(esk3_2(X1,X2),X2))).
% 0.19/0.43 cnf(i_0_31, plain, (member(X1,on)|member(esk4_1(X1),X1)|~set(X1)|~strict_well_order(member_predicate,X1))).
% 0.19/0.43 cnf(i_0_12, plain, (member(X1,union(X3,X2))|~member(X1,X2))).
% 0.19/0.43 cnf(i_0_13, plain, (member(X1,union(X2,X3))|~member(X1,X2))).
% 0.19/0.43 cnf(i_0_24, plain, (member(X3,sum(X2))|~member(X3,X1)|~member(X1,X2))).
% 0.19/0.43 cnf(i_0_23, plain, (X1=X3|X1=X2|~member(X1,unordered_pair(X2,X3)))).
% 0.19/0.43 cnf(i_0_29, plain, (member(X1,X3)|~member(X3,X2)|~member(X1,product(X2)))).
% 0.19/0.43 cnf(i_0_25, plain, (member(X1,esk2_2(X1,X2))|~member(X1,sum(X2)))).
% 0.19/0.43 cnf(i_0_26, plain, (member(esk2_2(X1,X2),X2)|~member(X1,sum(X2)))).
% 0.19/0.43 cnf(i_0_30, plain, (member(X1,on)|~set(X1)|~strict_well_order(member_predicate,X1)|~subset(esk4_1(X1),X1))).
% 0.19/0.43 cnf(i_0_45, plain, (apply(member_predicate,X1,X2)|~member(X1,X2))).
% 0.19/0.43 cnf(i_0_16, plain, (member(X1,X3)|member(X1,difference(X2,X3))|~member(X1,X2))).
% 0.19/0.43 cnf(i_0_37, plain, (strict_well_order(X1,X2)|subset(esk6_2(X1,X2),X2)|~strict_order(X1,X2))).
% 0.19/0.43 cnf(i_0_10, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))).
% 0.19/0.43 cnf(i_0_11, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))).
% 0.19/0.43 cnf(i_0_18, plain, (member(X1,X2)|~member(X1,difference(X2,X3)))).
% 0.19/0.43 cnf(i_0_1, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))).
% 0.19/0.43 cnf(i_0_27, plain, (member(X1,product(X2))|~member(X1,esk3_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_78, plain, (member(X1,union(X2,singleton(X2)))|~member(X1,suc(X2)))).
% 0.19/0.43 cnf(i_0_9, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))).
% 0.19/0.43 cnf(i_0_17, plain, (~member(X1,X2)|~member(X1,difference(X3,X2)))).
% 0.19/0.43 cnf(i_0_14, plain, (member(X1,X3)|member(X1,X2)|~member(X1,union(X2,X3)))).
% 0.19/0.43 cnf(i_0_70, plain, (strict_order(X1,X2)|member(esk9_2(X1,X2),X2)|member(esk11_2(X1,X2),X2))).
% 0.19/0.43 cnf(i_0_69, plain, (strict_order(X1,X2)|member(esk9_2(X1,X2),X2)|member(esk12_2(X1,X2),X2))).
% 0.19/0.43 cnf(i_0_68, plain, (strict_order(X1,X2)|member(esk9_2(X1,X2),X2)|member(esk13_2(X1,X2),X2))).
% 0.19/0.43 cnf(i_0_64, plain, (strict_order(X1,X2)|member(esk10_2(X1,X2),X2)|member(esk11_2(X1,X2),X2))).
% 0.19/0.43 cnf(i_0_63, plain, (strict_order(X1,X2)|member(esk10_2(X1,X2),X2)|member(esk12_2(X1,X2),X2))).
% 0.19/0.43 cnf(i_0_62, plain, (strict_order(X1,X2)|member(esk10_2(X1,X2),X2)|member(esk13_2(X1,X2),X2))).
% 0.19/0.43 cnf(i_0_46, plain, (member(X1,X2)|~apply(member_predicate,X1,X2))).
% 0.19/0.43 cnf(i_0_44, plain, (member(X1,X2)|~least(X1,X3,X2))).
% 0.19/0.43 cnf(i_0_77, plain, (member(X1,suc(X2))|~member(X1,union(X2,singleton(X2))))).
% 0.19/0.43 cnf(i_0_36, plain, (strict_well_order(X1,X2)|member(esk7_2(X1,X2),esk6_2(X1,X2))|~strict_order(X1,X2))).
% 0.19/0.43 cnf(i_0_67, plain, (strict_order(X1,X2)|member(esk9_2(X1,X2),X2)|apply(X1,esk11_2(X1,X2),esk12_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_66, plain, (strict_order(X1,X2)|member(esk9_2(X1,X2),X2)|apply(X1,esk12_2(X1,X2),esk13_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_61, plain, (strict_order(X1,X2)|member(esk10_2(X1,X2),X2)|apply(X1,esk11_2(X1,X2),esk12_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_60, plain, (strict_order(X1,X2)|member(esk10_2(X1,X2),X2)|apply(X1,esk12_2(X1,X2),esk13_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_58, plain, (strict_order(X1,X2)|member(esk11_2(X1,X2),X2)|apply(X1,esk9_2(X1,X2),esk10_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_52, plain, (strict_order(X1,X2)|member(esk11_2(X1,X2),X2)|apply(X1,esk10_2(X1,X2),esk9_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_57, plain, (strict_order(X1,X2)|member(esk12_2(X1,X2),X2)|apply(X1,esk9_2(X1,X2),esk10_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_51, plain, (strict_order(X1,X2)|member(esk12_2(X1,X2),X2)|apply(X1,esk10_2(X1,X2),esk9_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_56, plain, (strict_order(X1,X2)|member(esk13_2(X1,X2),X2)|apply(X1,esk9_2(X1,X2),esk10_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_50, plain, (strict_order(X1,X2)|member(esk13_2(X1,X2),X2)|apply(X1,esk10_2(X1,X2),esk9_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_35, plain, (strict_well_order(X2,X3)|~strict_order(X2,X3)|~least(X1,X2,esk6_2(X2,X3)))).
% 0.19/0.43 cnf(i_0_41, plain, (least(X1,X2,X3)|esk8_3(X2,X3,X1)!=X1|~member(X1,X3))).
% 0.19/0.43 cnf(i_0_43, plain, (X1=X3|apply(X4,X3,X1)|~member(X1,X2)|~least(X3,X4,X2))).
% 0.19/0.43 cnf(i_0_42, plain, (least(X3,X1,X2)|member(esk8_3(X1,X2,X3),X2)|~member(X3,X2))).
% 0.19/0.43 cnf(i_0_76, plain, (member(X1,X2)|~member(X1,initial_segment(X3,X4,X2)))).
% 0.19/0.43 cnf(i_0_65, plain, (strict_order(X1,X2)|member(esk9_2(X1,X2),X2)|~apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_59, plain, (strict_order(X1,X2)|member(esk10_2(X1,X2),X2)|~apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_55, plain, (strict_order(X1,X2)|apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))|apply(X1,esk11_2(X1,X2),esk12_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_54, plain, (strict_order(X1,X2)|apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))|apply(X1,esk12_2(X1,X2),esk13_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_49, plain, (strict_order(X1,X2)|apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))|apply(X1,esk11_2(X1,X2),esk12_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_48, plain, (strict_order(X1,X2)|apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))|apply(X1,esk12_2(X1,X2),esk13_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_38, plain, (least(esk5_3(X4,X2,X1),X4,X1)|~subset(X1,X2)|~member(X3,X1)|~strict_well_order(X4,X2))).
% 0.19/0.43 cnf(i_0_74, plain, (member(X1,initial_segment(X4,X3,X2))|~member(X1,X2)|~apply(X3,X1,X4))).
% 0.19/0.43 cnf(i_0_72, plain, (~member(X3,X2)|~member(X1,X2)|~strict_order(X4,X2)|~apply(X4,X3,X1)|~apply(X4,X1,X3))).
% 0.19/0.43 cnf(i_0_75, plain, (apply(X1,X2,X3)|~member(X2,initial_segment(X3,X1,X4)))).
% 0.19/0.43 cnf(i_0_53, plain, (strict_order(X1,X2)|apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))|~apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_47, plain, (strict_order(X1,X2)|apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))|~apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_71, plain, (apply(X5,X1,X4)|~member(X4,X2)|~member(X3,X2)|~member(X1,X2)|~strict_order(X5,X2)|~apply(X5,X3,X4)|~apply(X5,X1,X3))).
% 0.19/0.43 cnf(i_0_40, plain, (least(X2,X1,X3)|~member(X2,X3)|~apply(X1,X2,esk8_3(X1,X3,X2)))).
% 0.19/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.43 # Begin printing tableau
% 0.19/0.43 # Found 9 steps
% 0.19/0.43 cnf(i_0_79, negated_conjecture, (member(esk15_0,esk14_0)), inference(start_rule)).
% 0.19/0.43 cnf(i_0_83, plain, (member(esk15_0,esk14_0)), inference(extension_rule, [i_0_71])).
% 0.19/0.43 cnf(i_0_290, plain, (~member(esk15_0,esk14_0)), inference(closure_rule, [i_0_79])).
% 0.19/0.43 cnf(i_0_291, plain, (~member(esk15_0,esk14_0)), inference(closure_rule, [i_0_79])).
% 0.19/0.43 cnf(i_0_288, plain, (apply(member_predicate,esk15_0,esk15_0)), inference(extension_rule, [i_0_46])).
% 0.19/0.43 cnf(i_0_292, plain, (~strict_order(member_predicate,esk14_0)), inference(etableau_closure_rule, [i_0_292, ...])).
% 0.19/0.43 cnf(i_0_293, plain, (~apply(member_predicate,esk15_0,esk15_0)), inference(etableau_closure_rule, [i_0_293, ...])).
% 0.19/0.43 cnf(i_0_294, plain, (~apply(member_predicate,esk15_0,esk15_0)), inference(etableau_closure_rule, [i_0_294, ...])).
% 0.19/0.43 cnf(i_0_407, plain, (member(esk15_0,esk15_0)), inference(etableau_closure_rule, [i_0_407, ...])).
% 0.19/0.43 # End printing tableau
% 0.19/0.43 # SZS output end
% 0.19/0.43 # Branches closed with saturation will be marked with an "s"
% 0.19/0.43 ,X2)|member(esk9_2(X1,X2),X2)|apply(X1,esk11_2(X1,X2),esk12_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_66, plain, (strict_order(X1,X2)|member(esk9_2(X1,X2),X2)|apply(X1,esk12_2(X1,X2),esk13_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_61, plain, (strict_order(X1,X2)|member(esk10_2(X1,X2),X2)|apply(X1,esk11_2(X1,X2),esk12_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_60, plain, (strict_order(X1,X2)|member(esk10_2(X1,X2),X2)|apply(X1,esk12_2(X1,X2),esk13_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_58, plain, (strict_order(X1,X2)|member(esk11_2(X1,X2),X2)|apply(X1,esk9_2(X1,X2),esk10_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_52, plain, (strict_order(X1,X2)|member(esk11_2(X1,X2),X2)|apply(X1,esk10_2(X1,X2),esk9_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_57, plain, (strict_order(X1,X2)|member(esk12_2(X1,X2),X2)|apply(X1,esk9_2(X1,X2),esk10_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_51, plain, (strict_order(X1,X2)|member(esk12_2(X1,X2),X2)|apply(X1,esk10_2(X1,X2),esk9_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_56, plain, (strict_order(X1,X2)|member(esk13_2(X1,X2),X2)|apply(X1,esk9_2(X1,X2),esk10_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_50, plain, (strict_order(X1,X2)|member(esk13_2(X1,X2),X2)|apply(X1,esk10_2(X1,X2),esk9_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_35, plain, (strict_well_order(X2,X3)|~strict_order(X2,X3)|~least(X1,X2,esk6_2(X2,X3)))).
% 0.19/0.43 cnf(i_0_41, plain, (least(X1,X2,X3)|esk8_3(X2,X3,X1)!=X1|~member(X1,X3))).
% 0.19/0.43 cnf(i_0_43, plain, (X1=X3|apply(X4,X3,X1)|~member(X1,X2)|~least(X3,X4,X2))).
% 0.19/0.43 cnf(i_0_42, plain, (least(X3,X1,X2)|member(esk8_3(X1,X2,X3),X2)|~member(X3,X2))).
% 0.19/0.43 cnf(i_0_76, plain, (member(X1,X2)|~member(X1,initial_segment(X3,X4,X2)))).
% 0.19/0.43 cnf(i_0_65, plain, (strict_order(X1,X2)|member(esk9_2(X1,X2),X2)|~apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_59, plain, (strict_order(X1,X2)|member(esk10_2(X1,X2),X2)|~apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_55, plain, (strict_order(X1,X2)|apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))|apply(X1,esk11_2(X1,X2),esk12_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_54, plain, (strict_order(X1,X2)|apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))|apply(X1,esk12_2(X1,X2),esk13_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_49, plain, (strict_order(X1,X2)|apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))|apply(X1,esk11_2(X1,X2),esk12_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_48, plain, (strict_order(X1,X2)|apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))|apply(X1,esk12_2(X1,X2),esk13_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_38, plain, (least(esk5_3(X4,X2,X1),X4,X1)|~subset(X1,X2)|~member(X3,X1)|~strict_well_order(X4,X2))).
% 0.19/0.43 cnf(i_0_74, plain, (member(X1,initial_segment(X4,X3,X2))|~member(X1,X2)|~apply(X3,X1,X4))).
% 0.19/0.43 cnf(i_0_72, plain, (~member(X3,X2)|~member(X1,X2)|~strict_order(X4,X2)|~apply(X4,X3,X1)|~apply(X4,X1,X3))).
% 0.19/0.43 cnf(i_0_75, plain, (apply(X1,X2,X3)|~member(X2,initial_segment(X3,X1,X4)))).
% 0.19/0.43 cnf(i_0_53, plain, (strict_order(X1,X2)|apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))|~apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_47, plain, (strict_order(X1,X2)|apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))|~apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)))).
% 0.19/0.43 cnf(i_0_71, plain, (apply(X5,X1,X4)|~member(X4,X2)|~member(X3,X2)|~member(X1,X2)|~strict_order(X5,X2)|~apply(X5,X3,X4)|~apply(X5,X1,X3))).
% 0.19/0.43 cnf(i_0_40, plain, (least(X2,X1,X3)|~member(X2,X3)|~apply(X1,X2,esk8_3(X1,X3,X2)))).
% 0.19/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.43 # Begin printing tableau
% 0.19/0.43 # Found 9 steps
% 0.19/0.43 cnf(i_0_79, negated_conjecture, (member(esk15_0,esk14_0)), inference(start_rule)).
% 0.19/0.43 cnf(i_0_83, plain, (member(esk15_0,esk14_0)), inference(extension_rule, [i_0_71])).
% 0.19/0.43 cnf(i_0_289, plain, (~member(esk15_0,esk14_0)), inference(closure_rule, [i_0_79])).
% 0.19/0.43 cnf(i_0_290, plain, (~member(esk15_0,esk14_0)), inference(closure_rule, [i_0_79])).
% 0.19/0.43 cnf(i_0_288, plain, (apply(member_predicate,esk15_0,esk15_0)), inference(extension_rule, [i_0_46])).
% 0.19/0.43 cnf(i_0_292, plain, (~strict_order(member_predicate,esk14_0)), inference(etableau_closure_rule, [i_0_292, ...])).
% 0.19/0.43 cnf(i_0_293, plain, (~apply(member_predicate,esk15_0,esk15_0)), inference(etableau_closure_rule, [i_0_293, ...])).
% 0.19/0.43 cnf(i_0_294, plain, (~apply(member_predicate,esk15_0,esk15_0)), inference(etableau_closure_rule, [i_0_294, ...])).
% 0.19/0.43 cnf(i_0_407, plain, (member(esk15_0,esk15_0)), inference(etableau_closure_rule, [i_0_407, ...])).
% 0.19/0.43 # End printing tableau
% 0.19/0.43 # SZS output end
% 0.19/0.43 # Branches closed with saturation will be marked with an "s"
% 0.19/0.43 # Child (14632) has found a proof.
% 0.19/0.43
% 0.19/0.43 # Proof search is over...
% 0.19/0.43 # Freeing feature tree
%------------------------------------------------------------------------------