%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET656+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 : n011.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:01:47 EDT 2022 % Result : Theorem 0.12s 0.38s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : SET656+3 : TPTP v8.1.0. Released v2.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.12/0.33 % Computer : n011.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 20:27:56 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y % 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.36 # % 0.12/0.36 # Number of axioms: 62 Number of unprocessed: 62 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # 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 # 62 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 4 conjectures. % 0.12/0.37 # There are 4 start rule candidates: % 0.12/0.37 # Found 6 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 4 start rule tableaux created. % 0.12/0.37 # 56 extension rule candidate clauses % 0.12/0.37 # 6 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 4 % 0.12/0.37 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 11 tableaux to operate on % 0.12/0.38 # There were 1 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 1 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 1 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_27, plain, (ilf_type(esk6_0,binary_relation_type))). % 0.12/0.38 cnf(i_0_69, negated_conjecture, (ilf_type(esk16_0,set_type))). % 0.12/0.38 cnf(i_0_68, negated_conjecture, (ilf_type(esk17_0,set_type))). % 0.12/0.38 cnf(i_0_65, plain, (ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_62, plain, (relation_like(X1)|~empty(X1)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_67, negated_conjecture, (ilf_type(esk18_0,relation_type(esk16_0,esk17_0)))). % 0.12/0.38 cnf(i_0_37, plain, (subset(X1,X1)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_43, plain, (~empty(power_set(X1))|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_42, plain, (ilf_type(power_set(X1),set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_24, plain, (ilf_type(X1,binary_relation_type)|~relation_like(X1)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_54, plain, (relation_like(X1)|ilf_type(esk14_1(X1),set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_60, plain, (empty(X1)|ilf_type(esk15_1(X1),set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_26, plain, (relation_like(X1)|~ilf_type(X1,set_type)|~ilf_type(X1,binary_relation_type))). % 0.12/0.38 cnf(i_0_53, plain, (relation_like(X1)|member(esk14_1(X1),X1)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_59, plain, (empty(X1)|member(esk15_1(X1),X1)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_30, plain, (ilf_type(esk7_1(X1),subset_type(X1))|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_66, negated_conjecture, (intersection(esk18_0,cross_product(esk16_0,esk17_0))!=esk18_0)). % 0.12/0.38 cnf(i_0_46, plain, (empty(X1)|ilf_type(esk10_1(X1),member_type(X1))|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_22, plain, (intersection(X1,X2)=intersection(X2,X1)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_61, plain, (~empty(X1)|~member(X2,X1)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_1, plain, (intersection(X1,X2)=X1|~subset(X1,X2)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_12, plain, (ilf_type(intersection(X1,X2),set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_8, plain, (ilf_type(cross_product(X1,X2),set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_23, plain, (ilf_type(ordered_pair(X1,X2),set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_19, plain, (X1=X2|ilf_type(esk4_2(X1,X2),set_type)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))). % 0.12/0.38 cnf(i_0_18, plain, (X1=X2|ilf_type(esk5_2(X1,X2),set_type)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))). % 0.12/0.38 cnf(i_0_49, plain, (X1=X2|ilf_type(esk11_2(X1,X2),set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_44, plain, (empty(X2)|ilf_type(X1,member_type(X2))|~member(X1,X2)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_45, plain, (empty(X2)|member(X1,X2)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~ilf_type(X1,member_type(X2)))). % 0.12/0.38 cnf(i_0_35, plain, (subset(X1,X2)|ilf_type(esk8_2(X1,X2),set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_52, plain, (relation_like(X3)|esk14_1(X3)!=ordered_pair(X1,X2)|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_34, plain, (subset(X1,X2)|member(esk8_2(X1,X2),X1)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_40, plain, (member(X1,power_set(X2))|ilf_type(esk9_2(X1,X2),set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_39, plain, (member(X1,power_set(X2))|member(esk9_2(X1,X2),X1)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_29, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~ilf_type(X1,subset_type(X2)))). % 0.12/0.38 cnf(i_0_15, plain, (ilf_type(esk3_2(X1,X2),relation_type(X2,X1))|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_57, plain, (ilf_type(esk12_2(X1,X2),set_type)|~relation_like(X1)|~member(X2,X1)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_56, plain, (ilf_type(esk13_2(X1,X2),set_type)|~relation_like(X1)|~member(X2,X1)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_28, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~ilf_type(X1,member_type(power_set(X2))))). % 0.12/0.38 cnf(i_0_33, plain, (subset(X1,X2)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(esk8_2(X1,X2),X2))). % 0.12/0.38 cnf(i_0_36, plain, (member(X3,X2)|~subset(X1,X2)|~member(X3,X1)|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_47, plain, (X1=X2|member(esk11_2(X1,X2),X2)|member(esk11_2(X1,X2),X1)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_38, plain, (member(X1,power_set(X2))|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(esk9_2(X1,X2),X2))). % 0.12/0.38 cnf(i_0_41, plain, (member(X3,X2)|~member(X3,X1)|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(X1,power_set(X2)))). % 0.12/0.38 cnf(i_0_55, plain, (ordered_pair(esk12_2(X2,X1),esk13_2(X2,X1))=X1|~relation_like(X2)|~member(X1,X2)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_10, plain, (member(X1,X2)|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(X1,intersection(X3,X2)))). % 0.12/0.38 cnf(i_0_11, plain, (member(X1,X2)|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(X1,intersection(X2,X3)))). % 0.12/0.38 cnf(i_0_9, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_58, plain, (relation_like(X3)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~ilf_type(X3,subset_type(cross_product(X1,X2))))). % 0.12/0.38 cnf(i_0_48, plain, (X1=X2|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(esk11_2(X1,X2),X2)|~member(esk11_2(X1,X2),X1))). % 0.12/0.38 cnf(i_0_13, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,relation_type(X2,X3)))). % 0.12/0.38 cnf(i_0_14, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,subset_type(cross_product(X2,X3))))). % 0.12/0.38 cnf(i_0_2, plain, (member(X5,cross_product(X3,X4))|X5!=ordered_pair(X1,X2)|~member(X2,X4)|~member(X1,X3)|~ilf_type(X5,set_type)|~ilf_type(X4,set_type)|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.12/0.38 cnf(i_0_7, plain, (ilf_type(esk1_3(X1,X2,X3),set_type)|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(X3,cross_product(X1,X2)))). % 0.12/0.38 cnf(i_0_6, plain, (ilf_type(esk2_3(X1,X2,X3),set_type)|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(X3,cross_product(X1,X2)))). % 0.12/0.38 cnf(i_0_5, plain, (member(esk1_3(X1,X2,X3),X1)|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(X3,cross_product(X1,X2)))). % 0.12/0.38 cnf(i_0_4, plain, (member(esk2_3(X1,X2,X3),X2)|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(X3,cross_product(X1,X2)))). % 0.12/0.38 cnf(i_0_16, plain, (X1=X2|member(ordered_pair(esk4_2(X1,X2),esk5_2(X1,X2)),X2)|member(ordered_pair(esk4_2(X1,X2),esk5_2(X1,X2)),X1)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))). % 0.12/0.38 cnf(i_0_3, plain, (ordered_pair(esk1_3(X2,X3,X1),esk2_3(X2,X3,X1))=X1|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(X1,cross_product(X2,X3)))). % 0.12/0.38 cnf(i_0_63, plain, (intersection4(X1,X2,X3,X4)=intersection(X3,X4)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~ilf_type(X4,relation_type(X1,X2))|~ilf_type(X3,relation_type(X1,X2)))). % 0.12/0.38 cnf(i_0_17, plain, (X1=X2|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type)|~member(ordered_pair(esk4_2(X1,X2),esk5_2(X1,X2)),X2)|~member(ordered_pair(esk4_2(X1,X2),esk5_2(X1,X2)),X1))). % 0.12/0.38 cnf(i_0_64, plain, (ilf_type(intersection4(X1,X2,X3,X4),relation_type(X1,X2))|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~ilf_type(X4,relation_type(X1,X2))|~ilf_type(X3,relation_type(X1,X2)))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 8 steps % 0.12/0.38 cnf(i_0_67, negated_conjecture, (ilf_type(esk18_0,relation_type(esk16_0,esk17_0))), inference(start_rule)). % 0.12/0.38 cnf(i_0_71, plain, (ilf_type(esk18_0,relation_type(esk16_0,esk17_0))), inference(extension_rule, [i_0_13])). % 0.12/0.38 cnf(i_0_479, plain, (~ilf_type(esk17_0,set_type)), inference(closure_rule, [i_0_65])). % 0.12/0.38 cnf(i_0_480, plain, (~ilf_type(esk16_0,set_type)), inference(closure_rule, [i_0_65])). % 0.12/0.38 cnf(i_0_478, plain, (ilf_type(esk18_0,subset_type(cross_product(esk16_0,esk17_0)))), inference(extension_rule, [i_0_29])). % 0.12/0.38 cnf(i_0_578, plain, (~ilf_type(cross_product(esk16_0,esk17_0),set_type)), inference(closure_rule, [i_0_65])). % 0.12/0.38 cnf(i_0_579, plain, (~ilf_type(esk18_0,set_type)), inference(closure_rule, [i_0_65])). % 0.12/0.38 cnf(i_0_577, plain, (ilf_type(esk18_0,member_type(power_set(cross_product(esk16_0,esk17_0))))), inference(etableau_closure_rule, [i_0_577, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # Child (19924) has found a proof. % 0.12/0.38 % 0.12/0.38 # Proof search is over... % 0.12/0.38 # Freeing feature tree %------------------------------------------------------------------------------