TSTP Solution File: SET686+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET686+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 : n007.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:01 EDT 2022
% Result : Theorem 0.19s 0.39s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET686+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.13 % 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 : n007.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 03:18:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 61 Number of unprocessed: 43
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 43 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 9 conjectures.
% 0.12/0.37 # There are 9 start rule candidates:
% 0.12/0.37 # Found 11 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 9 start rule tableaux created.
% 0.12/0.37 # 32 extension rule candidate clauses
% 0.12/0.37 # 11 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.39 # There were 1 total branch saturation attempts.
% 0.19/0.39 # There were 0 of these attempts blocked.
% 0.19/0.39 # There were 0 deferred branch saturation attempts.
% 0.19/0.39 # There were 0 free duplicated saturations.
% 0.19/0.39 # There were 1 total successful branch saturations.
% 0.19/0.39 # There were 0 successful branch saturations in interreduction.
% 0.19/0.39 # There were 0 successful branch saturations on the branch.
% 0.19/0.39 # There were 1 successful branch saturations after the branch.
% 0.19/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.39 # Begin clausification derivation
% 0.19/0.39
% 0.19/0.39 # End clausification derivation
% 0.19/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.39 cnf(i_0_27, plain, (ilf_type(esk5_0,binary_relation_type))).
% 0.19/0.39 cnf(i_0_52, plain, (ilf_type(X1,set_type))).
% 0.19/0.39 cnf(i_0_57, negated_conjecture, (ilf_type(esk16_0,member_type(esk12_0)))).
% 0.19/0.39 cnf(i_0_58, negated_conjecture, (ilf_type(esk15_0,relation_type(esk12_0,esk14_0)))).
% 0.19/0.39 cnf(i_0_30, plain, (ilf_type(esk6_1(X1),subset_type(X1)))).
% 0.19/0.39 cnf(i_0_12, plain, (ilf_type(esk2_2(X1,X2),relation_type(X2,X1)))).
% 0.19/0.39 cnf(i_0_7, plain, (unordered_pair(unordered_pair(X1,X2),singleton(X1))=ordered_pair(X1,X2))).
% 0.19/0.39 cnf(i_0_64, negated_conjecture, (~empty(esk12_0))).
% 0.19/0.39 cnf(i_0_62, negated_conjecture, (~empty(esk13_0))).
% 0.19/0.39 cnf(i_0_60, negated_conjecture, (~empty(esk14_0))).
% 0.19/0.39 cnf(i_0_41, plain, (~empty(power_set(X1)))).
% 0.19/0.39 cnf(i_0_48, plain, (relation_like(X1)|~empty(X1))).
% 0.19/0.39 cnf(i_0_53, negated_conjecture, (member(esk16_0,inverse4(esk12_0,esk14_0,esk15_0,esk13_0))|member(esk17_0,esk13_0))).
% 0.19/0.39 cnf(i_0_55, negated_conjecture, (member(esk16_0,inverse4(esk12_0,esk14_0,esk15_0,esk13_0))|ilf_type(esk17_0,member_type(esk14_0)))).
% 0.19/0.39 cnf(i_0_54, negated_conjecture, (member(esk16_0,inverse4(esk12_0,esk14_0,esk15_0,esk13_0))|member(ordered_pair(esk16_0,esk17_0),esk15_0))).
% 0.19/0.39 cnf(i_0_26, plain, (relation_like(X1)|~ilf_type(X1,binary_relation_type))).
% 0.19/0.39 cnf(i_0_24, plain, (ilf_type(X1,binary_relation_type)|~relation_like(X1))).
% 0.19/0.39 cnf(i_0_18, plain, (~empty(X1)|~member(X2,X1))).
% 0.19/0.39 cnf(i_0_56, negated_conjecture, (~member(esk16_0,inverse4(esk12_0,esk14_0,esk15_0,esk13_0))|~member(ordered_pair(esk16_0,X1),esk15_0)|~member(X1,esk13_0)|~ilf_type(X1,member_type(esk14_0)))).
% 0.19/0.39 cnf(i_0_16, plain, (empty(X1)|member(esk4_1(X1),X1))).
% 0.19/0.39 cnf(i_0_43, plain, (relation_like(X1)|member(esk11_1(X1),X1))).
% 0.19/0.39 cnf(i_0_49, plain, (relation_like(X1)|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
% 0.19/0.39 cnf(i_0_36, plain, (member(X1,power_set(X2))|~member(esk8_2(X1,X2),X2))).
% 0.19/0.39 cnf(i_0_42, plain, (relation_like(X1)|esk11_1(X1)!=ordered_pair(X2,X3))).
% 0.19/0.39 cnf(i_0_15, plain, (empty(X1)|ilf_type(esk3_1(X1),member_type(X1)))).
% 0.19/0.39 cnf(i_0_14, plain, (empty(X1)|member(X2,X1)|~ilf_type(X2,member_type(X1)))).
% 0.19/0.39 cnf(i_0_13, plain, (ilf_type(X1,member_type(X2))|~member(X1,X2))).
% 0.19/0.39 cnf(i_0_28, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X1,member_type(power_set(X2))))).
% 0.19/0.39 cnf(i_0_11, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
% 0.19/0.39 cnf(i_0_32, plain, (X1=X2|~member(esk7_2(X1,X2),X2)|~member(esk7_2(X1,X2),X1))).
% 0.19/0.39 cnf(i_0_29, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X1,subset_type(X2)))).
% 0.19/0.39 cnf(i_0_37, plain, (member(esk8_2(X1,X2),X1)|member(X1,power_set(X2)))).
% 0.19/0.39 cnf(i_0_39, plain, (member(X1,X2)|~member(X3,power_set(X2))|~member(X1,X3))).
% 0.19/0.39 cnf(i_0_31, plain, (X1=X2|member(esk7_2(X1,X2),X1)|member(esk7_2(X1,X2),X2))).
% 0.19/0.39 cnf(i_0_10, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3)))).
% 0.19/0.39 cnf(i_0_2, plain, (member(esk1_3(X1,X2,X3),X1)|~member(X2,inverse2(X3,X1))|~ilf_type(X3,binary_relation_type))).
% 0.19/0.39 cnf(i_0_50, plain, (inverse4(X1,X2,X3,X4)=inverse2(X3,X4)|~ilf_type(X3,relation_type(X1,X2)))).
% 0.19/0.39 cnf(i_0_45, plain, (ordered_pair(esk9_2(X1,X2),esk10_2(X1,X2))=X2|~relation_like(X1)|~member(X2,X1))).
% 0.19/0.39 cnf(i_0_51, plain, (ilf_type(inverse4(X1,X2,X3,X4),subset_type(X1))|~ilf_type(X3,relation_type(X1,X2)))).
% 0.19/0.39 cnf(i_0_5, plain, (member(X1,X2)|~member(ordered_pair(X3,X1),X4)|~ilf_type(X4,relation_type(X5,X2)))).
% 0.19/0.39 cnf(i_0_6, plain, (member(X1,X2)|~member(ordered_pair(X1,X3),X4)|~ilf_type(X4,relation_type(X2,X5)))).
% 0.19/0.39 cnf(i_0_3, plain, (member(ordered_pair(X1,esk1_3(X2,X1,X3)),X3)|~member(X1,inverse2(X3,X2))|~ilf_type(X3,binary_relation_type))).
% 0.19/0.39 cnf(i_0_1, plain, (member(X1,inverse2(X2,X3))|~member(ordered_pair(X1,X4),X2)|~member(X4,X3)|~ilf_type(X2,binary_relation_type))).
% 0.19/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.39 # Begin printing tableau
% 0.19/0.39 # Found 4 steps
% 0.19/0.39 cnf(i_0_58, negated_conjecture, (ilf_type(esk15_0,relation_type(esk12_0,esk14_0))), inference(start_rule)).
% 0.19/0.39 cnf(i_0_79, plain, (ilf_type(esk15_0,relation_type(esk12_0,esk14_0))), inference(extension_rule, [i_0_10])).
% 0.19/0.39 cnf(i_0_123, plain, (ilf_type(esk15_0,subset_type(cross_product(esk12_0,esk14_0)))), inference(extension_rule, [i_0_49])).
% 0.19/0.39 cnf(i_0_137, plain, (relation_like(esk15_0)), inference(etableau_closure_rule, [i_0_137, ...])).
% 0.19/0.39 # End printing tableau
% 0.19/0.39 # SZS output end
% 0.19/0.39 # Branches closed with saturation will be marked with an "s"
% 0.19/0.39 # Child (27600) has found a proof.
% 0.19/0.39
% 0.19/0.39 # Proof search is over...
% 0.19/0.39 # Freeing feature tree
%------------------------------------------------------------------------------