%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU115+1 : TPTP v8.1.0. Released v3.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 : n028.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 09:23:53 EDT 2022 % Result : Theorem 0.19s 0.37s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SEU115+1 : TPTP v8.1.0. Released v3.2.0. % 0.03/0.13 % 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 : n028.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 Jun 19 09:05:45 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 64 Number of unprocessed: 61 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 0.19/0.37 # The folding up rule is enabled... % 0.19/0.37 # Local unification is enabled... % 0.19/0.37 # Any saturation attempts will use folding labels... % 0.19/0.37 # 61 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 1 conjectures. % 0.19/0.37 # There are 1 start rule candidates: % 0.19/0.37 # Found 36 unit axioms. % 0.19/0.37 # 1 start rule tableaux created. % 0.19/0.37 # 25 extension rule candidate clauses % 0.19/0.37 # 36 unit axiom clauses % 0.19/0.37 % 0.19/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.37 # There were 2 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 2 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 2 successful branch saturations after the branch. % 0.19/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_64, plain, (singleton(empty_set)=powerset(empty_set))). % 0.19/0.37 cnf(i_0_58, plain, (empty(empty_set))). % 0.19/0.37 cnf(i_0_59, plain, (empty(esk9_0))). % 0.19/0.37 cnf(i_0_27, plain, (preboolean(esk2_0))). % 0.19/0.37 cnf(i_0_30, plain, (cup_closed(esk2_0))). % 0.19/0.37 cnf(i_0_28, plain, (diff_closed(esk2_0))). % 0.19/0.37 cnf(i_0_34, plain, (finite(esk3_0))). % 0.19/0.37 cnf(i_0_29, plain, (cap_closed(esk2_0))). % 0.19/0.37 cnf(i_0_18, plain, (preboolean(finite_subsets(X1)))). % 0.19/0.37 cnf(i_0_25, plain, (cup_closed(finite_subsets(X1)))). % 0.19/0.37 cnf(i_0_24, plain, (diff_closed(finite_subsets(X1)))). % 0.19/0.37 cnf(i_0_32, plain, (finite(singleton(X1)))). % 0.19/0.37 cnf(i_0_44, plain, (empty(esk4_1(X1)))). % 0.19/0.37 cnf(i_0_56, plain, (empty(esk8_1(X1)))). % 0.19/0.37 cnf(i_0_1, plain, (subset(X1,X1))). % 0.19/0.37 cnf(i_0_19, plain, (preboolean(powerset(X1)))). % 0.19/0.37 cnf(i_0_21, plain, (cup_closed(powerset(X1)))). % 0.19/0.37 cnf(i_0_20, plain, (diff_closed(powerset(X1)))). % 0.19/0.37 cnf(i_0_36, plain, (finite(esk4_1(X1)))). % 0.19/0.37 cnf(i_0_43, plain, (relation(esk4_1(X1)))). % 0.19/0.37 cnf(i_0_42, plain, (function(esk4_1(X1)))). % 0.19/0.37 cnf(i_0_41, plain, (one_to_one(esk4_1(X1)))). % 0.19/0.37 cnf(i_0_40, plain, (epsilon_transitive(esk4_1(X1)))). % 0.19/0.37 cnf(i_0_39, plain, (epsilon_connected(esk4_1(X1)))). % 0.19/0.37 cnf(i_0_38, plain, (ordinal(esk4_1(X1)))). % 0.19/0.37 cnf(i_0_37, plain, (natural(esk4_1(X1)))). % 0.19/0.37 cnf(i_0_6, plain, (element(esk1_1(X1),X1))). % 0.19/0.37 cnf(i_0_45, plain, (element(esk4_1(X1),powerset(X1)))). % 0.19/0.37 cnf(i_0_57, plain, (element(esk8_1(X1),powerset(X1)))). % 0.19/0.37 cnf(i_0_62, negated_conjecture, (finite_subsets(empty_set)!=powerset(empty_set))). % 0.19/0.37 cnf(i_0_31, plain, (~empty(esk2_0))). % 0.19/0.37 cnf(i_0_35, plain, (~empty(esk3_0))). % 0.19/0.37 cnf(i_0_60, plain, (~empty(esk10_0))). % 0.19/0.37 cnf(i_0_22, plain, (~empty(powerset(X1)))). % 0.19/0.37 cnf(i_0_26, plain, (~empty(finite_subsets(X1)))). % 0.19/0.37 cnf(i_0_33, plain, (~empty(singleton(X1)))). % 0.19/0.37 cnf(i_0_61, plain, (X1=empty_set|~empty(X1))). % 0.19/0.37 cnf(i_0_16, plain, (~empty(X1)|~in(X2,X1))). % 0.19/0.37 cnf(i_0_8, plain, (cup_closed(X1)|~preboolean(X1))). % 0.19/0.37 cnf(i_0_7, plain, (diff_closed(X1)|~preboolean(X1))). % 0.19/0.37 cnf(i_0_11, plain, (finite(X1)|~empty(X1))). % 0.19/0.37 cnf(i_0_2, plain, (~in(X1,X2)|~in(X2,X1))). % 0.19/0.37 cnf(i_0_47, plain, (empty(X1)|~empty(esk5_1(X1)))). % 0.19/0.37 cnf(i_0_63, plain, (finite_subsets(X1)=powerset(X1)|~finite(X1))). % 0.19/0.37 cnf(i_0_50, plain, (empty(X1)|~empty(esk6_1(X1)))). % 0.19/0.37 cnf(i_0_54, plain, (empty(X1)|~empty(esk7_1(X1)))). % 0.19/0.37 cnf(i_0_9, plain, (preboolean(X1)|~diff_closed(X1)|~cup_closed(X1))). % 0.19/0.37 cnf(i_0_10, plain, (finite(X1)|~element(X1,finite_subsets(X2)))). % 0.19/0.37 cnf(i_0_46, plain, (finite(esk5_1(X1))|empty(X1))). % 0.19/0.37 cnf(i_0_3, plain, (element(X1,X2)|~in(X1,X2))). % 0.19/0.37 cnf(i_0_12, plain, (finite(X1)|~finite(X2)|~element(X1,powerset(X2)))). % 0.19/0.37 cnf(i_0_14, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.19/0.37 cnf(i_0_5, plain, (~empty(X1)|~element(X2,powerset(X1))|~in(X3,X2))). % 0.19/0.37 cnf(i_0_49, plain, (finite(esk6_1(X1))|empty(X1))). % 0.19/0.37 cnf(i_0_17, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.19/0.37 cnf(i_0_15, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.19/0.37 cnf(i_0_48, plain, (empty(X1)|element(esk5_1(X1),powerset(X1)))). % 0.19/0.37 cnf(i_0_51, plain, (empty(X1)|element(esk6_1(X1),powerset(X1)))). % 0.19/0.37 cnf(i_0_13, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 0.19/0.37 cnf(i_0_4, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). % 0.19/0.37 cnf(i_0_55, plain, (empty(X1)|element(esk7_1(X1),powerset(X1)))). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 5 steps % 0.19/0.37 cnf(i_0_62, negated_conjecture, (finite_subsets(empty_set)!=powerset(empty_set)), inference(start_rule)). % 0.19/0.37 cnf(i_0_65, plain, (finite_subsets(empty_set)!=powerset(empty_set)), inference(extension_rule, [i_0_17])). % 0.19/0.37 cnf(i_0_106, plain, (~empty(powerset(empty_set))), inference(extension_rule, [i_0_47])). % 0.19/0.37 cnf(i_0_107, plain, (~empty(finite_subsets(empty_set))), inference(etableau_closure_rule, [i_0_107, ...])). % 0.19/0.37 cnf(i_0_135, plain, (~empty(esk5_1(powerset(empty_set)))), inference(etableau_closure_rule, [i_0_135, ...])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 2 tableaux to operate on % 0.19/0.37 # Found closed tableau during pool population. % 0.19/0.37 # Proof search is over... % 0.19/0.37 # Freeing feature tree %------------------------------------------------------------------------------