TSTP Solution File: SET684+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET684+3 : TPTP v8.1.0. Released v2.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 : n021.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:00 EDT 2022
% Result : Theorem 0.20s 0.42s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET684+3 : TPTP v8.1.0. Released v2.2.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 : n021.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 10:00:38 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 63 Number of unprocessed: 47
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 47 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 11 conjectures.
% 0.13/0.38 # There are 11 start rule candidates:
% 0.13/0.38 # Found 14 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 11 start rule tableaux created.
% 0.13/0.38 # 33 extension rule candidate clauses
% 0.13/0.38 # 14 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.20/0.42 # There were 1 total branch saturation attempts.
% 0.20/0.42 # There were 0 of these attempts blocked.
% 0.20/0.42 # There were 0 deferred branch saturation attempts.
% 0.20/0.42 # There were 0 free duplicated saturations.
% 0.20/0.42 # There were 1 total successful branch saturations.
% 0.20/0.42 # There were 0 successful branch saturations in interreduction.
% 0.20/0.42 # There were 0 successful branch saturations on the branch.
% 0.20/0.42 # There were 1 successful branch saturations after the branch.
% 0.20/0.42 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.42 # Begin clausification derivation
% 0.20/0.42
% 0.20/0.42 # End clausification derivation
% 0.20/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.42 cnf(i_0_27, plain, (ilf_type(esk5_0,binary_relation_type))).
% 0.20/0.42 cnf(i_0_54, plain, (ilf_type(X1,set_type))).
% 0.20/0.42 cnf(i_0_60, negated_conjecture, (ilf_type(esk17_0,member_type(esk12_0)))).
% 0.20/0.42 cnf(i_0_59, negated_conjecture, (ilf_type(esk18_0,member_type(esk14_0)))).
% 0.20/0.42 cnf(i_0_62, negated_conjecture, (ilf_type(esk15_0,relation_type(esk12_0,esk13_0)))).
% 0.20/0.42 cnf(i_0_61, negated_conjecture, (ilf_type(esk16_0,relation_type(esk13_0,esk14_0)))).
% 0.20/0.42 cnf(i_0_30, plain, (ilf_type(esk6_1(X1),subset_type(X1)))).
% 0.20/0.42 cnf(i_0_12, plain, (ilf_type(esk2_2(X1,X2),relation_type(X2,X1)))).
% 0.20/0.42 cnf(i_0_7, plain, (unordered_pair(unordered_pair(X1,X2),singleton(X1))=ordered_pair(X1,X2))).
% 0.20/0.42 cnf(i_0_22, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.20/0.42 cnf(i_0_68, negated_conjecture, (~empty(esk12_0))).
% 0.20/0.42 cnf(i_0_66, negated_conjecture, (~empty(esk13_0))).
% 0.20/0.42 cnf(i_0_64, negated_conjecture, (~empty(esk14_0))).
% 0.20/0.42 cnf(i_0_43, plain, (~empty(power_set(X1)))).
% 0.20/0.42 cnf(i_0_50, plain, (relation_like(X1)|~empty(X1))).
% 0.20/0.42 cnf(i_0_57, negated_conjecture, (member(ordered_pair(esk17_0,esk18_0),compose5(esk12_0,esk13_0,esk14_0,esk15_0,esk16_0))|ilf_type(esk19_0,member_type(esk13_0)))).
% 0.20/0.42 cnf(i_0_26, plain, (relation_like(X1)|~ilf_type(X1,binary_relation_type))).
% 0.20/0.42 cnf(i_0_24, plain, (ilf_type(X1,binary_relation_type)|~relation_like(X1))).
% 0.20/0.42 cnf(i_0_18, plain, (~empty(X1)|~member(X2,X1))).
% 0.20/0.42 cnf(i_0_56, negated_conjecture, (member(ordered_pair(esk17_0,esk18_0),compose5(esk12_0,esk13_0,esk14_0,esk15_0,esk16_0))|member(ordered_pair(esk17_0,esk19_0),esk15_0))).
% 0.20/0.42 cnf(i_0_55, negated_conjecture, (member(ordered_pair(esk17_0,esk18_0),compose5(esk12_0,esk13_0,esk14_0,esk15_0,esk16_0))|member(ordered_pair(esk19_0,esk18_0),esk16_0))).
% 0.20/0.42 cnf(i_0_58, negated_conjecture, (~member(ordered_pair(esk17_0,esk18_0),compose5(esk12_0,esk13_0,esk14_0,esk15_0,esk16_0))|~member(ordered_pair(X1,esk18_0),esk16_0)|~member(ordered_pair(esk17_0,X1),esk15_0)|~ilf_type(X1,member_type(esk13_0)))).
% 0.20/0.42 cnf(i_0_16, plain, (empty(X1)|member(esk4_1(X1),X1))).
% 0.20/0.42 cnf(i_0_45, plain, (relation_like(X1)|member(esk11_1(X1),X1))).
% 0.20/0.42 cnf(i_0_51, plain, (relation_like(X1)|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
% 0.20/0.42 cnf(i_0_38, plain, (member(X1,power_set(X2))|~member(esk8_2(X1,X2),X2))).
% 0.20/0.42 cnf(i_0_44, plain, (relation_like(X1)|esk11_1(X1)!=ordered_pair(X2,X3))).
% 0.20/0.42 cnf(i_0_15, plain, (empty(X1)|ilf_type(esk3_1(X1),member_type(X1)))).
% 0.20/0.42 cnf(i_0_14, plain, (empty(X1)|member(X2,X1)|~ilf_type(X2,member_type(X1)))).
% 0.20/0.42 cnf(i_0_13, plain, (ilf_type(X1,member_type(X2))|~member(X1,X2))).
% 0.20/0.42 cnf(i_0_23, plain, (ilf_type(compose(X1,X2),binary_relation_type)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))).
% 0.20/0.42 cnf(i_0_28, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X1,member_type(power_set(X2))))).
% 0.20/0.42 cnf(i_0_11, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
% 0.20/0.42 cnf(i_0_32, plain, (X1=X2|~member(esk7_2(X1,X2),X2)|~member(esk7_2(X1,X2),X1))).
% 0.20/0.42 cnf(i_0_29, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X1,subset_type(X2)))).
% 0.20/0.42 cnf(i_0_39, plain, (member(esk8_2(X1,X2),X1)|member(X1,power_set(X2)))).
% 0.20/0.42 cnf(i_0_10, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3)))).
% 0.20/0.42 cnf(i_0_41, plain, (member(X1,X2)|~member(X3,power_set(X2))|~member(X1,X3))).
% 0.20/0.42 cnf(i_0_47, plain, (ordered_pair(esk9_2(X1,X2),esk10_2(X1,X2))=X2|~relation_like(X1)|~member(X2,X1))).
% 0.20/0.42 cnf(i_0_5, plain, (member(X1,X2)|~member(ordered_pair(X3,X1),X4)|~ilf_type(X4,relation_type(X5,X2)))).
% 0.20/0.42 cnf(i_0_6, plain, (member(X1,X2)|~member(ordered_pair(X1,X3),X4)|~ilf_type(X4,relation_type(X2,X5)))).
% 0.20/0.42 cnf(i_0_31, plain, (X1=X2|member(esk7_2(X1,X2),X1)|member(esk7_2(X1,X2),X2))).
% 0.20/0.42 cnf(i_0_52, plain, (compose5(X1,X2,X3,X4,X5)=compose(X4,X5)|~ilf_type(X5,relation_type(X2,X3))|~ilf_type(X4,relation_type(X1,X2)))).
% 0.20/0.42 cnf(i_0_53, plain, (ilf_type(compose5(X1,X2,X3,X4,X5),relation_type(X1,X3))|~ilf_type(X5,relation_type(X2,X3))|~ilf_type(X4,relation_type(X1,X2)))).
% 0.20/0.42 cnf(i_0_3, plain, (member(ordered_pair(X1,esk1_4(X1,X2,X3,X4)),X3)|~member(ordered_pair(X1,X2),compose(X3,X4))|~ilf_type(X4,binary_relation_type)|~ilf_type(X3,binary_relation_type))).
% 0.20/0.42 cnf(i_0_2, plain, (member(ordered_pair(esk1_4(X1,X2,X3,X4),X2),X4)|~member(ordered_pair(X1,X2),compose(X3,X4))|~ilf_type(X4,binary_relation_type)|~ilf_type(X3,binary_relation_type))).
% 0.20/0.42 cnf(i_0_1, plain, (member(ordered_pair(X1,X2),compose(X3,X4))|~member(ordered_pair(X1,X5),X3)|~member(ordered_pair(X5,X2),X4)|~ilf_type(X4,binary_relation_type)|~ilf_type(X3,binary_relation_type))).
% 0.20/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.42 # Begin printing tableau
% 0.20/0.42 # Found 4 steps
% 0.20/0.42 cnf(i_0_64, negated_conjecture, (~empty(esk14_0)), inference(start_rule)).
% 0.20/0.42 cnf(i_0_80, plain, (~empty(esk14_0)), inference(extension_rule, [i_0_16])).
% 0.20/0.42 cnf(i_0_96, plain, (member(esk4_1(esk14_0),esk14_0)), inference(extension_rule, [i_0_13])).
% 0.20/0.42 cnf(i_0_118, plain, (ilf_type(esk4_1(esk14_0),member_type(esk14_0))), inference(etableau_closure_rule, [i_0_118, ...])).
% 0.20/0.42 # End printing tableau
% 0.20/0.42 # SZS output end
% 0.20/0.42 # Branches closed with saturation will be marked with an "s"
% 0.20/0.42 # There were 1 total branch saturation attempts.
% 0.20/0.42 # There were 0 of these attempts blocked.
% 0.20/0.42 # There were 0 deferred branch saturation attempts.
% 0.20/0.42 # There were 0 free duplicated saturations.
% 0.20/0.42 # There were 1 total successful branch saturations.
% 0.20/0.42 # There were 0 successful branch saturations in interreduction.
% 0.20/0.42 # There were 0 successful branch saturations on the branch.
% 0.20/0.42 # There were 1 successful branch saturations after the branch.
% 0.20/0.42 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.42 # Begin clausification derivation
% 0.20/0.42
% 0.20/0.42 # End clausification derivation
% 0.20/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.42 cnf(i_0_27, plain, (ilf_type(esk5_0,binary_relation_type))).
% 0.20/0.42 cnf(i_0_54, plain, (ilf_type(X1,set_type))).
% 0.20/0.42 cnf(i_0_60, negated_conjecture, (ilf_type(esk17_0,member_type(esk12_0)))).
% 0.20/0.42 cnf(i_0_59, negated_conjecture, (ilf_type(esk18_0,member_type(esk14_0)))).
% 0.20/0.42 cnf(i_0_62, negated_conjecture, (ilf_type(esk15_0,relation_type(esk12_0,esk13_0)))).
% 0.20/0.42 cnf(i_0_61, negated_conjecture, (ilf_type(esk16_0,relation_type(esk13_0,esk14_0)))).
% 0.20/0.42 cnf(i_0_30, plain, (ilf_type(esk6_1(X1),subset_type(X1)))).
% 0.20/0.42 cnf(i_0_12, plain, (ilf_type(esk2_2(X1,X2),relation_type(X2,X1)))).
% 0.20/0.42 cnf(i_0_7, plain, (unordered_pair(unordered_pair(X1,X2),singleton(X1))=ordered_pair(X1,X2))).
% 0.20/0.42 cnf(i_0_22, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.20/0.42 cnf(i_0_68, negated_conjecture, (~empty(esk12_0))).
% 0.20/0.42 cnf(i_0_66, negated_conjecture, (~empty(esk13_0))).
% 0.20/0.42 cnf(i_0_64, negated_conjecture, (~empty(esk14_0))).
% 0.20/0.42 cnf(i_0_43, plain, (~empty(power_set(X1)))).
% 0.20/0.42 cnf(i_0_50, plain, (relation_like(X1)|~empty(X1))).
% 0.20/0.42 cnf(i_0_57, negated_conjecture, (member(ordered_pair(esk17_0,esk18_0),compose5(esk12_0,esk13_0,esk14_0,esk15_0,esk16_0))|ilf_type(esk19_0,member_type(esk13_0)))).
% 0.20/0.42 cnf(i_0_26, plain, (relation_like(X1)|~ilf_type(X1,binary_relation_type))).
% 0.20/0.42 cnf(i_0_24, plain, (ilf_type(X1,binary_relation_type)|~relation_like(X1))).
% 0.20/0.42 cnf(i_0_18, plain, (~empty(X1)|~member(X2,X1))).
% 0.20/0.42 cnf(i_0_56, negated_conjecture, (member(ordered_pair(esk17_0,esk18_0),compose5(esk12_0,esk13_0,esk14_0,esk15_0,esk16_0))|member(ordered_pair(esk17_0,esk19_0),esk15_0))).
% 0.20/0.42 cnf(i_0_55, negated_conjecture, (member(ordered_pair(esk17_0,esk18_0),compose5(esk12_0,esk13_0,esk14_0,esk15_0,esk16_0))|member(ordered_pair(esk19_0,esk18_0),esk16_0))).
% 0.20/0.42 cnf(i_0_58, negated_conjecture, (~member(ordered_pair(esk17_0,esk18_0),compose5(esk12_0,esk13_0,esk14_0,esk15_0,esk16_0))|~member(ordered_pair(X1,esk18_0),esk16_0)|~member(ordered_pair(esk17_0,X1),esk15_0)|~ilf_type(X1,member_type(esk13_0)))).
% 0.20/0.42 cnf(i_0_16, plain, (empty(X1)|member(esk4_1(X1),X1))).
% 0.20/0.42 cnf(i_0_45, plain, (relation_like(X1)|member(esk11_1(X1),X1))).
% 0.20/0.42 cnf(i_0_51, plain, (relation_like(X1)|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
% 0.20/0.42 cnf(i_0_38, plain, (member(X1,power_set(X2))|~member(esk8_2(X1,X2),X2))).
% 0.20/0.42 cnf(i_0_44, plain, (relation_like(X1)|esk11_1(X1)!=ordered_pair(X2,X3))).
% 0.20/0.42 cnf(i_0_15, plain, (empty(X1)|ilf_type(esk3_1(X1),member_type(X1)))).
% 0.20/0.42 cnf(i_0_14, plain, (empty(X1)|member(X2,X1)|~ilf_type(X2,member_type(X1)))).
% 0.20/0.42 cnf(i_0_13, plain, (ilf_type(X1,member_type(X2))|~member(X1,X2))).
% 0.20/0.42 cnf(i_0_23, plain, (ilf_type(compose(X1,X2),binary_relation_type)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))).
% 0.20/0.42 cnf(i_0_28, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X1,member_type(power_set(X2))))).
% 0.20/0.42 cnf(i_0_11, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
% 0.20/0.42 cnf(i_0_32, plain, (X1=X2|~member(esk7_2(X1,X2),X2)|~member(esk7_2(X1,X2),X1))).
% 0.20/0.42 cnf(i_0_29, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X1,subset_type(X2)))).
% 0.20/0.42 cnf(i_0_39, plain, (member(esk8_2(X1,X2),X1)|member(X1,power_set(X2)))).
% 0.20/0.42 cnf(i_0_10, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3)))).
% 0.20/0.42 cnf(i_0_41, plain, (member(X1,X2)|~member(X3,power_set(X2))|~member(X1,X3))).
% 0.20/0.42 cnf(i_0_47, plain, (ordered_pair(esk9_2(X1,X2),esk10_2(X1,X2))=X2|~relation_like(X1)|~member(X2,X1))).
% 0.20/0.42 cnf(i_0_5, plain, (member(X1,X2)|~member(ordered_pair(X3,X1),X4)|~ilf_type(X4,relation_type(X5,X2)))).
% 0.20/0.42 cnf(i_0_6, plain, (member(X1,X2)|~member(ordered_pair(X1,X3),X4)|~ilf_type(X4,relation_type(X2,X5)))).
% 0.20/0.42 cnf(i_0_31, plain, (X1=X2|member(esk7_2(X1,X2),X1)|member(esk7_2(X1,X2),X2))).
% 0.20/0.42 cnf(i_0_52, plain, (compose5(X1,X2,X3,X4,X5)=compose(X4,X5)|~ilf_type(X5,relation_type(X2,X3))|~ilf_type(X4,relation_type(X1,X2)))).
% 0.20/0.42 cnf(i_0_53, plain, (ilf_type(compose5(X1# Child (340) has found a proof.
% 0.20/0.42
% 0.20/0.42 # Proof search is over...
% 0.20/0.42 # Freeing feature tree
%------------------------------------------------------------------------------