%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET646+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 : n009.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:42 EDT 2022 % Result : Theorem 0.18s 0.43s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SET646+3 : TPTP v8.1.0. Released v2.2.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 : n009.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 23:25:07 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m % 0.12/0.37 # and selection function SelectCQArNTNpEqFirst. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 59 Number of unprocessed: 41 % 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 # 41 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 3 conjectures. % 0.12/0.37 # There are 3 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 # 3 start rule tableaux created. % 0.12/0.37 # 30 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.12/0.37 # There are not enough tableaux to fork, creating more from the initial 3 % 0.12/0.37 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 10 tableaux to operate on % 0.18/0.43 # There were 1 total branch saturation attempts. % 0.18/0.43 # There were 0 of these attempts blocked. % 0.18/0.43 # There were 0 deferred branch saturation attempts. % 0.18/0.43 # There were 0 free duplicated saturations. % 0.18/0.43 # There were 1 total successful branch saturations. % 0.18/0.43 # There were 0 successful branch saturations in interreduction. % 0.18/0.43 # There were 0 successful branch saturations on the branch. % 0.18/0.43 # There were 1 successful branch saturations after the branch. % 0.18/0.43 # There were 1 total branch saturation attempts. % 0.18/0.43 # There were 0 of these attempts blocked. % 0.18/0.43 # There were 0 deferred branch saturation attempts. % 0.18/0.43 # There were 0 free duplicated saturations. % 0.18/0.43 # There were 1 total successful branch saturations. % 0.18/0.43 # There were 0 successful branch saturations in interreduction. % 0.18/0.43 # There were 0 successful branch saturations on the branch. % 0.18/0.43 # There were 1 successful branch saturations after the branch. % 0.18/0.43 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.43 # Begin clausification derivation % 0.18/0.43 % 0.18/0.43 # End clausification derivation % 0.18/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.43 cnf(i_0_57, negated_conjecture, (member(esk14_0,esk12_0))). % 0.18/0.43 cnf(i_0_56, negated_conjecture, (member(esk15_0,esk13_0))). % 0.18/0.43 cnf(i_0_54, plain, (ilf_type(X1,set_type))). % 0.18/0.43 cnf(i_0_33, plain, (subset(X1,X1))). % 0.18/0.43 cnf(i_0_23, plain, (ilf_type(esk3_1(X1),subset_type(X1)))). % 0.18/0.43 cnf(i_0_8, plain, (ilf_type(esk1_2(X1,X2),relation_type(X2,X1)))). % 0.18/0.43 cnf(i_0_12, plain, (member(X1,singleton(X1)))). % 0.18/0.43 cnf(i_0_15, plain, (unordered_pair(singleton(X1),unordered_pair(X1,X2))=ordered_pair(X1,X2))). % 0.18/0.43 cnf(i_0_20, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.18/0.43 cnf(i_0_39, plain, (~empty(power_set(X1)))). % 0.18/0.43 cnf(i_0_55, negated_conjecture, (~ilf_type(singleton(ordered_pair(esk14_0,esk15_0)),relation_type(esk12_0,esk13_0)))). % 0.18/0.43 cnf(i_0_52, plain, (relation_like(X1)|~empty(X1))). % 0.18/0.43 cnf(i_0_45, plain, (~empty(X1)|~member(X2,X1))). % 0.18/0.43 cnf(i_0_2, plain, (member(X1,X2)|~subset(singleton(X1),X2))). % 0.18/0.43 cnf(i_0_43, plain, (empty(X1)|member(esk8_1(X1),X1))). % 0.18/0.43 cnf(i_0_47, plain, (relation_like(X1)|member(esk11_1(X1),X1))). % 0.18/0.43 cnf(i_0_29, plain, (subset(X1,X2)|~member(esk5_2(X1,X2),X2))). % 0.18/0.43 cnf(i_0_1, plain, (subset(singleton(X1),X2)|~member(X1,X2))). % 0.18/0.43 cnf(i_0_46, plain, (relation_like(X1)|esk11_1(X1)!=ordered_pair(X2,X3))). % 0.18/0.43 cnf(i_0_42, plain, (empty(X1)|ilf_type(esk7_1(X1),member_type(X1)))). % 0.18/0.43 cnf(i_0_53, plain, (relation_like(X1)|~ilf_type(X1,subset_type(cross_product(X2,X3))))). % 0.18/0.43 cnf(i_0_34, plain, (member(X1,power_set(X2))|~member(esk6_2(X1,X2),X2))). % 0.18/0.43 cnf(i_0_41, plain, (empty(X1)|member(X2,X1)|~ilf_type(X2,member_type(X1)))). % 0.18/0.43 cnf(i_0_21, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X1,member_type(power_set(X2))))). % 0.18/0.43 cnf(i_0_40, plain, (ilf_type(X1,member_type(X2))|~member(X1,X2))). % 0.18/0.43 cnf(i_0_30, plain, (member(esk5_2(X1,X2),X1)|subset(X1,X2))). % 0.18/0.43 cnf(i_0_7, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,subset_type(cross_product(X2,X3))))). % 0.18/0.43 cnf(i_0_25, plain, (X1=X2|~member(esk4_2(X1,X2),X2)|~member(esk4_2(X1,X2),X1))). % 0.18/0.43 cnf(i_0_22, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X1,subset_type(X2)))). % 0.18/0.43 cnf(i_0_32, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))). % 0.18/0.43 cnf(i_0_35, plain, (member(esk6_2(X1,X2),X1)|member(X1,power_set(X2)))). % 0.18/0.43 cnf(i_0_4, plain, (member(X1,X2)|~member(ordered_pair(X3,X1),cross_product(X4,X2)))). % 0.18/0.43 cnf(i_0_5, plain, (member(X1,X2)|~member(ordered_pair(X1,X3),cross_product(X2,X4)))). % 0.18/0.43 cnf(i_0_13, plain, (X1=X2|~member(X1,singleton(X2)))). % 0.18/0.43 cnf(i_0_6, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3)))). % 0.18/0.43 cnf(i_0_37, plain, (member(X1,X2)|~member(X3,power_set(X2))|~member(X1,X3))). % 0.18/0.43 cnf(i_0_10, plain, (X1=singleton(X2)|esk2_2(X2,X1)!=X2|~member(esk2_2(X2,X1),X1))). % 0.18/0.43 cnf(i_0_49, plain, (ordered_pair(esk9_2(X1,X2),esk10_2(X1,X2))=X2|~relation_like(X1)|~member(X2,X1))). % 0.18/0.43 cnf(i_0_24, plain, (X1=X2|member(esk4_2(X1,X2),X1)|member(esk4_2(X1,X2),X2))). % 0.18/0.43 cnf(i_0_3, plain, (member(ordered_pair(X1,X2),cross_product(X3,X4))|~member(X2,X4)|~member(X1,X3))). % 0.18/0.43 cnf(i_0_9, plain, (esk2_2(X1,X2)=X1|X2=singleton(X1)|member(esk2_2(X1,X2),X2))). % 0.18/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.43 # Begin printing tableau % 0.18/0.43 # Found 5 steps % 0.18/0.43 cnf(i_0_56, negated_conjecture, (member(esk15_0,esk13_0)), inference(start_rule)). % 0.18/0.43 cnf(i_0_67, plain, (member(esk15_0,esk13_0)), inference(extension_rule, [i_0_32])). % 0.18/0.43 cnf(i_0_176, plain, (member(esk15_0,esk13_0)), inference(extension_rule, [i_0_45])). % 0.18/0.43 cnf(i_0_178, plain, (~subset(esk13_0,esk13_0)), inference(closure_rule, [i_0_33])). % 0.18/0.43 cnf(i_0_209, plain, (~empty(esk13_0)), inference(etableau_closure_rule, [i_0_209, ...])). % 0.18/0.43 # End printing tableau % 0.18/0.43 # SZS output end % 0.18/0.43 # Branches closed with saturation will be marked with an "s" % 0.18/0.43 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.43 # Begin clausification derivation % 0.18/0.43 % 0.18/0.43 # End clausification derivation % 0.18/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.43 cnf(i_0_57, negated_conjecture, (member(esk14_0,esk12_0))). % 0.18/0.43 cnf(i_0_56, negated_conjecture, (member(esk15_0,esk13_0))). % 0.18/0.43 cnf(i_0_54, plain, (ilf_type(X1,set_type))). % 0.18/0.43 cnf(i_0_33, plain, (subset(X1,X1))). % 0.18/0.43 cnf(i_0_23, plain, (ilf_type(esk3_1(X1),subset_type(X1)))). % 0.18/0.43 cnf(i_0_8, plain, (ilf_type(esk1_2(X1,X2),relation_type(X2,X1)))). % 0.18/0.43 cnf(i_0_12, plain, (member(X1,singleton(X1)))). % 0.18/0.43 cnf(i_0_15, plain, (unordered_pair(singleton(X1),unordered_pair(X1,X2))=ordered_pair(X1,X2))). % 0.18/0.43 cnf(i_0_20, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.18/0.43 cnf(i_0_39, plain, (~empty(power_set(X1)))). % 0.18/0.43 cnf(i_0_55, negated_conjecture, (~ilf_type(singleton(ordered_pair(esk14_0,esk15_0)),relation_type(esk12_0,esk13_0)))). % 0.18/0.43 cnf(i_0_52, plain, (relation_like(X1)|~empty(X1))). % 0.18/0.43 cnf(i_0_45, plain, (~empty(X1)|~member(X2,X1))). % 0.18/0.43 cnf(i_0_2, plain, (member(X1,X2)|~subset(singleton(X1),X2))). % 0.18/0.43 cnf(i_0_43, plain, (empty(X1)|member(esk8_1(X1),X1))). % 0.18/0.43 cnf(i_0_47, plain, (relation_like(X1)|member(esk11_1(X1),X1))). % 0.18/0.43 cnf(i_0_29, plain, (subset(X1,X2)|~member(esk5_2(X1,X2),X2))). % 0.18/0.43 cnf(i_0_1, plain, (subset(singleton(X1),X2)|~member(X1,X2))). % 0.18/0.43 cnf(i_0_46, plain, (relation_like(X1)|esk11_1(X1)!=ordered_pair(X2,X3))). % 0.18/0.43 cnf(i_0_42, plain, (empty(X1)|ilf_type(esk7_1(X1),member_type(X1)))). % 0.18/0.43 cnf(i_0_53, plain, (relation_like(X1)|~ilf_type(X1,subset_type(cross_product(X2,X3))))). % 0.18/0.43 cnf(i_0_34, plain, (member(X1,power_set(X2))|~member(esk6_2(X1,X2),X2))). % 0.18/0.43 cnf(i_0_41, plain, (empty(X1)|member(X2,X1)|~ilf_type(X2,member_type(X1)))). % 0.18/0.43 cnf(i_0_21, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X1,member_type(power_set(X2))))). % 0.18/0.43 cnf(i_0_40, plain, (ilf_type(X1,member_type(X2))|~member(X1,X2))). % 0.18/0.43 cnf(i_0_30, plain, (member(esk5_2(X1,X2),X1)|subset(X1,X2))). % 0.18/0.43 cnf(i_0_7, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,subset_type(cross_product(X2,X3))))). % 0.18/0.43 cnf(i_0_25, plain, (X1=X2|~member(esk4_2(X1,X2),X2)|~member(esk4_2(X1,X2),X1))). % 0.18/0.43 cnf(i_0_22, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X1,subset_type(X2)))). % 0.18/0.43 cnf(i_0_32, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))). % 0.18/0.43 cnf(i_0_35, plain, (member(esk6_2(X1,X2),X1)|member(X1,power_set(X2)))). % 0.18/0.43 cnf(i_0_4, plain, (member(X1,X2)|~member(ordered_pair(X3,X1),cross_product(X4,X2)))). % 0.18/0.43 cnf(i_0_5, plain, (member(X1,X2)|~member(ordered_pair(X1,X3),cross_product(X2,X4)))). % 0.18/0.43 cnf(i_0_13, plain, (X1=X2|~member(X1,singleton(X2)))). % 0.18/0.43 cnf(i_0_6, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3)))). % 0.18/0.43 cnf(i_0_37, plain, (member(X1,X2)|~member(X3,power_set(X2))|~member(X1,X3))). % 0.18/0.43 cnf(i_0_10, plain, (X1=singleton(X2)|esk2_2(X2,X1)!=X2|~member(esk2_2(X2,X1),X1))). % 0.18/0.43 cnf(i_0_49, plain, (ordered_pair(esk9_2(X1,X2),esk10_2(X1,X2))=X2|~relation_like(X1)|~member(X2,X1))). % 0.18/0.43 cnf(i_0_24, plain, (X1=X2|member(esk4_2(X1,X2),X1)|member(esk4_2(X1,X2),X2))). % 0.18/0.43 cnf(i_0_3, plain, (member(ordered_pair(X1,X2),cross_product(X3,X4))|~member(X2,X4)|~member(X1,X3))). % 0.18/0.43 cnf(i_0_9, plain, (esk2_2(X1,X2)=X1|X2=singleton(X1)|member(esk2_2(X1,X2),X2))). % 0.18/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.43 # Begin printing tableau % 0.18/0.43 # Found 7 steps % 0.18/0.43 cnf(i_0_56, negated_conjecture, (member(esk15_0,esk13_0)), inference(start_rule)). % 0.18/0.43 cnf(i_0_67, plain, (member(esk15_0,esk13_0)), inference(extension_rule, [i_0_1])). % 0.18/0.43 cnf(i_0_150, plain, (subset(singleton(esk15_0),esk13_0)), inference(extension_rule, [i_0_32])). % 0.18/0.43 cnf(i_0_245, plain, (member(esk15_0,esk13_0)), inference(extension_rule, [i_0_45])). % 0.18/0.43 cnf(i_0_246, plain, (~member(esk15_0,singleton(esk15_0))), inference(extension_rule, [i_0_2])). % 0.18/0.43 cnf(i_0_255, plain, (~subset(singleton(esk15_0),singleton(esk15_0))), inference(closure_rule, [i_0_33])). % 0.18/0.43 cnf(i_0_250, plain, (~empty(esk13_0)), inference(etableau_closure_rule, [i_0_250, ...])). % 0.18/0.43 # End printing tableau % 0.18/0.43 # SZS output end % 0.18/0.43 # Branches closed with saturation will be marked with an "s" % 0.18/0.43 # Child (11521) has found a proof. % 0.18/0.43 % 0.18/0.43 # Proof search is over... % 0.18/0.43 # Freeing feature tree %------------------------------------------------------------------------------