%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET644+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 : n017.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:41 EDT 2022 % Result : Theorem 0.19s 0.41s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SET644+3 : TPTP v8.1.0. Released v2.2.0. % 0.04/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n017.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Sun Jul 10 20:20:48 EDT 2022 % 0.13/0.34 % CPUTime : % 0.19/0.39 # No SInE strategy applied % 0.19/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m % 0.19/0.39 # and selection function SelectCQArNTNpEqFirst. % 0.19/0.39 # % 0.19/0.39 # Presaturation interreduction done % 0.19/0.39 # Number of axioms: 60 Number of unprocessed: 40 % 0.19/0.39 # Tableaux proof search. % 0.19/0.39 # APR header successfully linked. % 0.19/0.39 # Hello from C++ % 0.19/0.39 # The folding up rule is enabled... % 0.19/0.39 # Local unification is enabled... % 0.19/0.39 # Any saturation attempts will use folding labels... % 0.19/0.39 # 40 beginning clauses after preprocessing and clausification % 0.19/0.39 # Creating start rules for all 3 conjectures. % 0.19/0.39 # There are 3 start rule candidates: % 0.19/0.39 # Found 10 unit axioms. % 0.19/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.39 # 3 start rule tableaux created. % 0.19/0.39 # 30 extension rule candidate clauses % 0.19/0.39 # 10 unit axiom clauses % 0.19/0.39 % 0.19/0.39 # Requested 8, 32 cores available to the main process. % 0.19/0.39 # There are not enough tableaux to fork, creating more from the initial 3 % 0.19/0.39 # Returning from population with 18 new_tableaux and 0 remaining starting tableaux. % 0.19/0.39 # We now have 18 tableaux to operate on % 0.19/0.41 # There were 1 total branch saturation attempts. % 0.19/0.41 # There were 0 of these attempts blocked. % 0.19/0.41 # There were 0 deferred branch saturation attempts. % 0.19/0.41 # There were 0 free duplicated saturations. % 0.19/0.41 # There were 1 total successful branch saturations. % 0.19/0.41 # There were 0 successful branch saturations in interreduction. % 0.19/0.41 # There were 0 successful branch saturations on the branch. % 0.19/0.41 # There were 1 successful branch saturations after the branch. % 0.19/0.41 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.41 # Begin clausification derivation % 0.19/0.41 % 0.19/0.41 # End clausification derivation % 0.19/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.41 cnf(i_0_59, negated_conjecture, (member(esk16_0,esk17_0))). % 0.19/0.41 cnf(i_0_60, negated_conjecture, (ilf_type(esk17_0,relation_type(esk14_0,esk15_0)))). % 0.19/0.41 cnf(i_0_23, plain, (ilf_type(esk4_0,binary_relation_type))). % 0.19/0.41 cnf(i_0_57, plain, (ilf_type(X1,set_type))). % 0.19/0.41 cnf(i_0_36, plain, (subset(X1,X1))). % 0.19/0.41 cnf(i_0_26, plain, (ilf_type(esk5_1(X1),subset_type(X1)))). % 0.19/0.41 cnf(i_0_12, plain, (ilf_type(esk3_2(X1,X2),relation_type(X2,X1)))). % 0.19/0.41 cnf(i_0_7, plain, (unordered_pair(unordered_pair(X1,X2),singleton(X1))=ordered_pair(X1,X2))). % 0.19/0.41 cnf(i_0_19, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.19/0.41 cnf(i_0_42, plain, (~empty(power_set(X1)))). % 0.19/0.41 cnf(i_0_56, plain, (relation_like(X1)|~empty(X1))). % 0.19/0.41 cnf(i_0_22, plain, (relation_like(X1)|~ilf_type(X1,binary_relation_type))). % 0.19/0.41 cnf(i_0_20, plain, (ilf_type(X1,binary_relation_type)|~relation_like(X1))). % 0.19/0.41 cnf(i_0_58, negated_conjecture, (ordered_pair(X1,X2)!=esk16_0|~member(X2,esk15_0)|~member(X1,esk14_0))). % 0.19/0.41 cnf(i_0_55, plain, (~empty(X1)|~member(X2,X1))). % 0.19/0.41 cnf(i_0_47, plain, (relation_like(X1)|member(esk12_1(X1),X1))). % 0.19/0.41 cnf(i_0_53, plain, (empty(X1)|member(esk13_1(X1),X1))). % 0.19/0.41 cnf(i_0_45, plain, (empty(X1)|ilf_type(esk9_1(X1),member_type(X1)))). % 0.19/0.41 cnf(i_0_13, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 0.19/0.41 cnf(i_0_32, plain, (subset(X1,X2)|~member(esk7_2(X1,X2),X2))). % 0.19/0.41 cnf(i_0_52, plain, (relation_like(X1)|~ilf_type(X1,subset_type(cross_product(X2,X3))))). % 0.19/0.41 cnf(i_0_37, plain, (member(X1,power_set(X2))|~member(esk8_2(X1,X2),X2))). % 0.19/0.41 cnf(i_0_46, plain, (relation_like(X1)|esk12_1(X1)!=ordered_pair(X2,X3))). % 0.19/0.41 cnf(i_0_24, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X1,member_type(power_set(X2))))). % 0.19/0.41 cnf(i_0_43, plain, (ilf_type(X1,member_type(X2))|~member(X1,X2))). % 0.19/0.41 cnf(i_0_44, plain, (empty(X1)|member(X2,X1)|~ilf_type(X2,member_type(X1)))). % 0.19/0.41 cnf(i_0_11, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,subset_type(cross_product(X2,X3))))). % 0.19/0.41 cnf(i_0_28, plain, (X1=X2|~member(esk6_2(X1,X2),X2)|~member(esk6_2(X1,X2),X1))). % 0.19/0.41 cnf(i_0_25, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X1,subset_type(X2)))). % 0.19/0.41 cnf(i_0_5, plain, (member(X1,X2)|~member(ordered_pair(X3,X1),cross_product(X4,X2)))). % 0.19/0.41 cnf(i_0_6, plain, (member(X1,X2)|~member(ordered_pair(X1,X3),cross_product(X2,X4)))). % 0.19/0.41 cnf(i_0_33, plain, (subset(X1,X2)|member(esk7_2(X1,X2),X1))). % 0.19/0.41 cnf(i_0_38, plain, (member(esk8_2(X1,X2),X1)|member(X1,power_set(X2)))). % 0.19/0.41 cnf(i_0_35, plain, (member(X1,X2)|~subset(X3,X2)|~member(X1,X3))). % 0.19/0.41 cnf(i_0_40, plain, (member(X1,X2)|~member(X3,power_set(X2))|~member(X1,X3))). % 0.19/0.41 cnf(i_0_10, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3)))). % 0.19/0.41 cnf(i_0_1, plain, (ordered_pair(esk1_2(X1,X2),esk2_2(X1,X2))=X1|~member(X1,X2)|~ilf_type(X2,binary_relation_type))). % 0.19/0.41 cnf(i_0_49, plain, (ordered_pair(esk10_2(X1,X2),esk11_2(X1,X2))=X2|~relation_like(X1)|~member(X2,X1))). % 0.19/0.41 cnf(i_0_4, plain, (member(ordered_pair(X1,X2),cross_product(X3,X4))|~member(X2,X4)|~member(X1,X3))). % 0.19/0.41 cnf(i_0_27, plain, (X1=X2|member(esk6_2(X1,X2),X1)|member(esk6_2(X1,X2),X2))). % 0.19/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.41 # Begin printing tableau % 0.19/0.41 # Found 4 steps % 0.19/0.41 cnf(i_0_60, negated_conjecture, (ilf_type(esk17_0,relation_type(esk14_0,esk15_0))), inference(start_rule)). % 0.19/0.41 cnf(i_0_70, plain, (ilf_type(esk17_0,relation_type(esk14_0,esk15_0))), inference(extension_rule, [i_0_10])). % 0.19/0.41 cnf(i_0_265, plain, (ilf_type(esk17_0,subset_type(cross_product(esk14_0,esk15_0)))), inference(extension_rule, [i_0_52])). % 0.19/0.41 cnf(i_0_286, plain, (relation_like(esk17_0)), inference(etableau_closure_rule, [i_0_286, ...])). % 0.19/0.41 # End printing tableau % 0.19/0.41 # SZS output end % 0.19/0.41 # Branches closed with saturation will be marked with an "s" % 0.19/0.41 # Child (7784) has found a proof. % 0.19/0.41 % 0.19/0.41 # Proof search is over... % 0.19/0.41 # Freeing feature tree %------------------------------------------------------------------------------