0.00/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.12 % 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 : n021.cluster.edu 0.12/0.33 Model : x86_64 x86_64 0.12/0.33 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 RAMPerCPU : 8042.1875MB 0.12/0.33 OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 960 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Tue Aug 9 03:47:35 EDT 2022 0.12/0.33 % CPUTime : 0.18/0.35 # No SInE strategy applied 0.18/0.35 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 0.18/0.35 # and selection function SelectComplexExceptUniqMaxHorn. 0.18/0.35 # 0.18/0.35 # Presaturation interreduction done 0.18/0.35 # Number of axioms: 64 Number of unprocessed: 64 0.18/0.35 # Tableaux proof search. 0.18/0.35 # APR header successfully linked. 0.18/0.35 # Hello from C++ 0.18/0.35 # The folding up rule is enabled... 0.18/0.35 # Local unification is enabled... 0.18/0.35 # Any saturation attempts will use folding labels... 0.18/0.35 # 64 beginning clauses after preprocessing and clausification 0.18/0.35 # Creating start rules for all 13 conjectures. 0.18/0.35 # There are 13 start rule candidates: 0.18/0.35 # Found 24 unit axioms. 0.18/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.18/0.35 # 13 start rule tableaux created. 0.18/0.35 # 40 extension rule candidate clauses 0.18/0.35 # 24 unit axiom clauses 0.18/0.35 0.18/0.35 # Requested 8, 32 cores available to the main process. 0.18/0.42 # There were 1 total branch saturation attempts. 0.18/0.42 # There were 0 of these attempts blocked. 0.18/0.42 # There were 0 deferred branch saturation attempts. 0.18/0.42 # There were 0 free duplicated saturations. 0.18/0.42 # There were 1 total successful branch saturations. 0.18/0.42 # There were 0 successful branch saturations in interreduction. 0.18/0.42 # There were 0 successful branch saturations on the branch. 0.18/0.42 # There were 1 successful branch saturations after the branch. 0.18/0.42 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.18/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.18/0.42 # Begin clausification derivation 0.18/0.42 0.18/0.42 # End clausification derivation 0.18/0.42 # Begin listing active clauses obtained from FOF to CNF conversion 0.18/0.42 cnf(i_0_30, negated_conjecture, (esk8_0=esk6_0)). 0.18/0.42 cnf(i_0_26, negated_conjecture, (esk7_0=esk9_0)). 0.18/0.42 cnf(i_0_37, negated_conjecture, (rel_str(esk4_0))). 0.18/0.42 cnf(i_0_35, negated_conjecture, (subrelstr(esk5_0,esk4_0))). 0.18/0.42 cnf(i_0_60, plain, (rel_str(esk14_0))). 0.18/0.42 cnf(i_0_36, negated_conjecture, (full_subrelstr(esk5_0,esk4_0))). 0.18/0.42 cnf(i_0_42, plain, (finite(esk10_0))). 0.18/0.42 cnf(i_0_28, negated_conjecture, (in(esk6_0,the_carrier(esk5_0)))). 0.18/0.42 cnf(i_0_29, negated_conjecture, (in(esk9_0,the_carrier(esk5_0)))). 0.18/0.42 cnf(i_0_34, negated_conjecture, (element(esk6_0,the_carrier(esk4_0)))). 0.18/0.42 cnf(i_0_33, negated_conjecture, (element(esk9_0,the_carrier(esk4_0)))). 0.18/0.42 cnf(i_0_19, plain, (empty(empty_set))). 0.18/0.42 cnf(i_0_56, plain, (empty(esk13_0))). 0.18/0.42 cnf(i_0_61, plain, (one_sorted_str(esk15_0))). 0.18/0.42 cnf(i_0_11, plain, (subset(X1,X1))). 0.18/0.42 cnf(i_0_32, negated_conjecture, (element(esk6_0,the_carrier(esk5_0)))). 0.18/0.42 cnf(i_0_31, negated_conjecture, (element(esk9_0,the_carrier(esk5_0)))). 0.18/0.42 cnf(i_0_27, negated_conjecture, (related(esk4_0,esk6_0,esk9_0))). 0.18/0.42 cnf(i_0_72, plain, (element(esk17_1(X1),X1))). 0.18/0.42 cnf(i_0_3, plain, (relation_of2(esk1_2(X1,X2),X1,X2))). 0.18/0.42 cnf(i_0_14, plain, (relation_of2_as_subset(esk2_2(X1,X2),X1,X2))). 0.18/0.42 cnf(i_0_25, negated_conjecture, (~related(esk5_0,esk6_0,esk9_0))). 0.18/0.42 cnf(i_0_41, plain, (~empty(esk10_0))). 0.18/0.42 cnf(i_0_62, plain, (~empty(esk16_0))). 0.18/0.42 cnf(i_0_20, plain, (~empty(X1)|~in(X2,X1))). 0.18/0.42 cnf(i_0_16, plain, (finite(X1)|~empty(X1))). 0.18/0.42 cnf(i_0_71, plain, (one_sorted_str(X1)|~rel_str(X1))). 0.18/0.42 cnf(i_0_40, plain, (X1=empty_set|~empty(X1))). 0.18/0.42 cnf(i_0_63, plain, (rel_str(X1)|~subrelstr(X1,X2)|~rel_str(X2))). 0.18/0.42 cnf(i_0_59, plain, (element(X1,X2)|~in(X1,X2))). 0.18/0.42 cnf(i_0_24, plain, (empty(X1)|finite(esk3_1(X1)))). 0.18/0.42 cnf(i_0_67, plain, (~in(X1,X2)|~in(X2,X1))). 0.18/0.42 cnf(i_0_23, plain, (empty(X1)|~empty(esk3_1(X1)))). 0.18/0.42 cnf(i_0_52, plain, (empty(X1)|~empty(esk12_1(X1)))). 0.18/0.42 cnf(i_0_48, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). 0.18/0.42 cnf(i_0_53, plain, (empty(X1)|finite(esk12_1(X1)))). 0.18/0.42 cnf(i_0_49, plain, (subrelstr(esk11_1(X1),X1)|~rel_str(X1))). 0.18/0.42 cnf(i_0_17, plain, (finite(X1)|~finite(X2)|~element(X1,powerset(X2)))). 0.18/0.42 cnf(i_0_21, plain, (~empty(X1)|~element(X2,powerset(X1))|~in(X3,X2))). 0.18/0.42 cnf(i_0_70, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). 0.18/0.42 cnf(i_0_68, plain, (X1=X2|~empty(X2)|~empty(X1))). 0.18/0.42 cnf(i_0_2, plain, (relation(relation_restriction(X1,X2))|~relation(X1))). 0.18/0.42 cnf(i_0_54, plain, (relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3))). 0.18/0.42 cnf(i_0_58, plain, (relation(X1)|~element(X1,powerset(cartesian_product2(X2,X3))))). 0.18/0.42 cnf(i_0_55, plain, (relation_of2_as_subset(X1,X2,X3)|~relation_of2(X1,X2,X3))). 0.18/0.42 cnf(i_0_47, plain, (element(X1,powerset(X2))|~subset(X1,X2))). 0.18/0.42 cnf(i_0_7, plain, (in(X1,X2)|~in(X1,relation_restriction(X2,X3))|~relation(X2))). 0.18/0.42 cnf(i_0_22, plain, (empty(X1)|element(esk3_1(X1),powerset(X1)))). 0.18/0.42 cnf(i_0_51, plain, (empty(X1)|element(esk12_1(X1),powerset(X1)))). 0.18/0.42 cnf(i_0_46, plain, (in(X1,X2)|~in(ordered_pair(X3,X1),cartesian_product2(X4,X2)))). 0.18/0.42 cnf(i_0_18, plain, (relation_restriction(X1,X2)=relation_restriction_as_relation_of(X1,X2)|~relation(X1))). 0.18/0.42 cnf(i_0_45, plain, (in(X1,X2)|~in(ordered_pair(X1,X3),cartesian_product2(X2,X4)))). 0.18/0.42 cnf(i_0_66, plain, (finite(cartesian_product2(X1,X2))|~finite(X1)|~finite(X2))). 0.18/0.42 cnf(i_0_9, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). 0.18/0.42 cnf(i_0_69, plain, (relation_of2_as_subset(relation_restriction_as_relation_of(X1,X2),X2,X2)|~relation(X1))). 0.18/0.42 cnf(i_0_64, plain, (relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))|~rel_str(X1))). 0.18/0.42 cnf(i_0_4, plain, (full_subrelstr(X1,X2)|relation_restriction_as_relation_of(the_InternalRel(X2),the_carrier(X1))!=the_InternalRel(X1)|~subrelstr(X1,X2)|~rel_str(X2))). 0.18/0.42 cnf(i_0_43, plain, (element(X1,powerset(cartesian_product2(X2,X3)))|~relation_of2_as_subset(X1,X2,X3))). 0.18/0.42 cnf(i_0_6, plain, (in(X1,cartesian_product2(X2,X2))|~in(X1,relation_restriction(X3,X2))|~relation(X3))). 0.18/0.42 cnf(i_0_5, plain, (relation_restriction_as_relation_of(the_InternalRel(X1),the_carrier(X2))=the_InternalRel(X2)|~full_subrelstr(X2,X1)|~subrelstr(X2,X1)|~rel_str(X1))). 0.18/0.42 cnf(i_0_44, plain, (in(ordered_pair(X1,X2),cartesian_product2(X3,X4))|~in(X1,X3)|~in(X2,X4))). 0.18/0.42 cnf(i_0_8, plain, (in(X1,relation_restriction(X2,X3))|~in(X1,cartesian_product2(X3,X3))|~in(X1,X2)|~relation(X2))). 0.18/0.42 cnf(i_0_12, plain, (related(X1,X2,X3)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))|~in(ordered_pair(X2,X3),the_InternalRel(X1))|~rel_str(X1))). 0.18/0.42 cnf(i_0_13, plain, (in(ordered_pair(X1,X2),the_InternalRel(X3))|~related(X3,X1,X2)|~element(X2,the_carrier(X3))|~element(X1,the_carrier(X3))|~rel_str(X3))). 0.18/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.18/0.42 # Begin printing tableau 0.18/0.42 # Found 7 steps 0.18/0.42 cnf(i_0_27, negated_conjecture, (related(esk4_0,esk6_0,esk9_0)), inference(start_rule)). 0.18/0.42 cnf(i_0_74, plain, (related(esk4_0,esk6_0,esk9_0)), inference(extension_rule, [i_0_13])). 0.18/0.42 cnf(i_0_185, plain, (~element(esk9_0,the_carrier(esk4_0))), inference(closure_rule, [i_0_33])). 0.18/0.42 cnf(i_0_186, plain, (~element(esk6_0,the_carrier(esk4_0))), inference(closure_rule, [i_0_34])). 0.18/0.42 cnf(i_0_187, plain, (~rel_str(esk4_0)), inference(closure_rule, [i_0_37])). 0.18/0.42 cnf(i_0_183, plain, (in(ordered_pair(esk6_0,esk9_0),the_InternalRel(esk4_0))), inference(extension_rule, [i_0_20])). 0.18/0.42 cnf(i_0_188, plain, (~empty(the_InternalRel(esk4_0))), inference(etableau_closure_rule, [i_0_188, ...])). 0.18/0.42 # End printing tableau 0.18/0.42 # SZS output end 0.18/0.42 # Branches closed with saturation will be marked with an "s" 0.18/0.42 # Child (6311) has found a proof. 0.18/0.42 0.18/0.42 # Proof search is over... 0.18/0.42 # Freeing feature tree 0.18/0.42 EOF