%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET647+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 : n025.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:43 EDT 2022 % Result : Theorem 2.70s 0.74s % Output : CNFRefutation 2.70s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.14 % Problem : SET647+3 : TPTP v8.1.0. Released v2.2.0. % 0.14/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.15/0.36 % Computer : n025.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.36 % CPULimit : 300 % 0.15/0.36 % WCLimit : 600 % 0.15/0.36 % DateTime : Sun Jul 10 00:37:16 EDT 2022 % 0.15/0.36 % CPUTime : % 0.15/0.40 # No SInE strategy applied % 0.15/0.40 # Auto-Mode selected heuristic G_E___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y % 0.15/0.40 # and selection function SelectMaxLComplexAvoidPosPred. % 0.15/0.40 # % 0.15/0.40 # Presaturation interreduction done % 0.15/0.40 # Number of axioms: 53 Number of unprocessed: 39 % 0.15/0.40 # Tableaux proof search. % 0.15/0.40 # APR header successfully linked. % 0.15/0.40 # Hello from C++ % 0.15/0.40 # The folding up rule is enabled... % 0.15/0.40 # Local unification is enabled... % 0.15/0.40 # Any saturation attempts will use folding labels... % 0.15/0.40 # 39 beginning clauses after preprocessing and clausification % 0.15/0.40 # Creating start rules for all 3 conjectures. % 0.15/0.40 # There are 3 start rule candidates: % 0.15/0.40 # Found 9 unit axioms. % 0.15/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.15/0.40 # 3 start rule tableaux created. % 0.15/0.40 # 30 extension rule candidate clauses % 0.15/0.40 # 9 unit axiom clauses % 0.15/0.40 % 0.15/0.40 # Requested 8, 32 cores available to the main process. % 0.15/0.40 # There are not enough tableaux to fork, creating more from the initial 3 % 0.15/0.40 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.15/0.40 # We now have 12 tableaux to operate on % 2.70/0.74 # There were 1 total branch saturation attempts. % 2.70/0.74 # There were 0 of these attempts blocked. % 2.70/0.74 # There were 0 deferred branch saturation attempts. % 2.70/0.74 # There were 0 free duplicated saturations. % 2.70/0.74 # There were 1 total successful branch saturations. % 2.70/0.74 # There were 0 successful branch saturations in interreduction. % 2.70/0.74 # There were 0 successful branch saturations on the branch. % 2.70/0.74 # There were 1 successful branch saturations after the branch. % 2.70/0.74 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.70/0.74 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.70/0.74 # Begin clausification derivation % 2.70/0.74 % 2.70/0.74 # End clausification derivation % 2.70/0.74 # Begin listing active clauses obtained from FOF to CNF conversion % 2.70/0.74 cnf(i_0_53, negated_conjecture, (ilf_type(esk14_0,binary_relation_type))). % 2.70/0.74 cnf(i_0_50, plain, (ilf_type(X1,set_type))). % 2.70/0.74 cnf(i_0_52, negated_conjecture, (subset(domain_of(esk14_0),esk13_0))). % 2.70/0.74 cnf(i_0_19, plain, (ilf_type(esk4_0,binary_relation_type))). % 2.70/0.74 cnf(i_0_29, plain, (subset(X1,X1))). % 2.70/0.74 cnf(i_0_28, plain, (ilf_type(esk6_1(X1),subset_type(X1)))). % 2.70/0.74 cnf(i_0_7, plain, (ilf_type(esk1_2(X1,X2),relation_type(X2,X1)))). % 2.70/0.74 cnf(i_0_42, plain, (~empty(power_set(X1)))). % 2.70/0.74 cnf(i_0_51, negated_conjecture, (~ilf_type(esk14_0,relation_type(esk13_0,range_of(esk14_0))))). % 2.70/0.74 cnf(i_0_49, plain, (relation_like(X1)|~empty(X1))). % 2.70/0.74 cnf(i_0_16, plain, (ilf_type(X1,binary_relation_type)|~relation_like(X1))). % 2.70/0.74 cnf(i_0_18, plain, (relation_like(X1)|~ilf_type(X1,binary_relation_type))). % 2.70/0.74 cnf(i_0_31, plain, (relation_like(X1)|member(esk9_1(X1),X1))). % 2.70/0.74 cnf(i_0_2, plain, (subset(X1,cross_product(domain_of(X1),range_of(X1)))|~ilf_type(X1,binary_relation_type))). % 2.70/0.74 cnf(i_0_46, plain, (empty(X1)|member(esk12_1(X1),X1))). % 2.70/0.74 cnf(i_0_45, plain, (empty(X1)|ilf_type(esk11_1(X1),member_type(X1)))). % 2.70/0.74 cnf(i_0_48, plain, (~empty(X1)|~member(X2,X1))). % 2.70/0.74 cnf(i_0_43, plain, (ilf_type(X1,member_type(X2))|~member(X1,X2))). % 2.70/0.74 cnf(i_0_21, plain, (member(esk5_2(X1,X2),X1)|subset(X1,X2))). % 2.70/0.74 cnf(i_0_20, plain, (subset(X1,X2)|~member(esk5_2(X1,X2),X2))). % 2.70/0.74 cnf(i_0_1, plain, (subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3))). % 2.70/0.74 cnf(i_0_5, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3)))). % 2.70/0.74 cnf(i_0_6, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,subset_type(cross_product(X2,X3))))). % 2.70/0.74 cnf(i_0_36, plain, (relation_like(X1)|~ilf_type(X1,subset_type(cross_product(X2,X3))))). % 2.70/0.74 cnf(i_0_44, plain, (empty(X1)|member(X2,X1)|~ilf_type(X2,member_type(X1)))). % 2.70/0.74 cnf(i_0_27, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X1,subset_type(X2)))). % 2.70/0.74 cnf(i_0_26, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X1,member_type(power_set(X2))))). % 2.70/0.74 cnf(i_0_4, plain, (subset(cross_product(X1,X2),cross_product(X3,X2))|~subset(X1,X3))). % 2.70/0.74 cnf(i_0_3, plain, (subset(cross_product(X1,X2),cross_product(X1,X3))|~subset(X2,X3))). % 2.70/0.74 cnf(i_0_38, plain, (member(esk10_2(X1,X2),X1)|member(X1,power_set(X2)))). % 2.70/0.74 cnf(i_0_30, plain, (relation_like(X1)|esk9_1(X1)!=ordered_pair(X2,X3))). % 2.70/0.74 cnf(i_0_37, plain, (member(X1,power_set(X2))|~member(esk10_2(X1,X2),X2))). % 2.70/0.74 cnf(i_0_9, plain, (member(ordered_pair(X1,esk2_2(X2,X1)),X2)|~member(X1,domain_of(X2))|~ilf_type(X2,binary_relation_type))). % 2.70/0.74 cnf(i_0_13, plain, (member(ordered_pair(esk3_2(X1,X2),X2),X1)|~member(X2,range_of(X1))|~ilf_type(X1,binary_relation_type))). % 2.70/0.74 cnf(i_0_23, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))). % 2.70/0.74 cnf(i_0_8, plain, (member(X1,domain_of(X2))|~member(ordered_pair(X1,X3),X2)|~ilf_type(X2,binary_relation_type))). % 2.70/0.74 cnf(i_0_12, plain, (member(X1,range_of(X2))|~member(ordered_pair(X3,X1),X2)|~ilf_type(X2,binary_relation_type))). % 2.70/0.74 cnf(i_0_33, plain, (ordered_pair(esk7_2(X1,X2),esk8_2(X1,X2))=X2|~relation_like(X1)|~member(X2,X1))). % 2.70/0.74 cnf(i_0_40, plain, (member(X1,X2)|~member(X3,power_set(X2))|~member(X1,X3))). % 2.70/0.74 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.70/0.74 # Begin printing tableau % 2.70/0.74 # Found 4 steps % 2.70/0.74 cnf(i_0_52, negated_conjecture, (subset(domain_of(esk14_0),esk13_0)), inference(start_rule)). % 2.70/0.74 cnf(i_0_56, plain, (subset(domain_of(esk14_0),esk13_0)), inference(extension_rule, [i_0_4])). % 2.70/0.74 cnf(i_0_165, plain, (subset(cross_product(domain_of(esk14_0),X8),cross_product(esk13_0,X8))), inference(extension_rule, [i_0_3])). % 2.70/0.74 cnf(i_0_5952, plain, (subset(cross_product(X4,cross_product(domain_of(esk14_0),X8)),cross_product(X4,cross_product(esk13_0,X8)))), inference(etableau_closure_rule, [i_0_5952, ...])). % 2.70/0.74 # End printing tableau % 2.70/0.74 # SZS output end % 2.70/0.74 # Branches closed with saturation will be marked with an "s" % 2.70/0.74 # Child (15833) has found a proof. % 2.70/0.74 % 2.70/0.74 # Proof search is over... % 2.70/0.74 # Freeing feature tree %------------------------------------------------------------------------------