%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : TOP021+1 : TPTP v8.1.0. Released v3.1.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 : n023.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 : Thu Jul 21 21:25:37 EDT 2022 % Result : Theorem 0.18s 0.36s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : TOP021+1 : TPTP v8.1.0. Released v3.1.0. % 0.03/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 : n023.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 May 29 05:01:57 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.18/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.18/0.36 # % 0.18/0.36 # Presaturation interreduction done % 0.18/0.36 # Number of axioms: 5 Number of unprocessed: 5 % 0.18/0.36 # Tableaux proof search. % 0.18/0.36 # APR header successfully linked. % 0.18/0.36 # Hello from C++ % 0.18/0.36 # The folding up rule is enabled... % 0.18/0.36 # Local unification is enabled... % 0.18/0.36 # Any saturation attempts will use folding labels... % 0.18/0.36 # 5 beginning clauses after preprocessing and clausification % 0.18/0.36 # Creating start rules for all 2 conjectures. % 0.18/0.36 # There are 2 start rule candidates: % 0.18/0.36 # Found 4 unit axioms. % 0.18/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.18/0.36 # 2 start rule tableaux created. % 0.18/0.36 # 1 extension rule candidate clauses % 0.18/0.36 # 4 unit axiom clauses % 0.18/0.36 % 0.18/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 2 % 0.18/0.36 # Closed tableau found in foldup close cycle with 0 folds and 3 closures done. % 0.18/0.36 # There were 0 total branch saturation attempts. % 0.18/0.36 # There were 0 of these attempts blocked. % 0.18/0.36 # There were 0 deferred branch saturation attempts. % 0.18/0.36 # There were 0 free duplicated saturations. % 0.18/0.36 # There were 0 total successful branch saturations. % 0.18/0.36 # There were 0 successful branch saturations in interreduction. % 0.18/0.36 # There were 0 successful branch saturations on the branch. % 0.18/0.36 # There were 0 successful branch saturations after the branch. % 0.18/0.36 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.36 # Begin clausification derivation % 0.18/0.36 % 0.18/0.36 # End clausification derivation % 0.18/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.36 cnf(i_0_5, negated_conjecture, (a_locally_compact_top_space(the_product_top_space_over(esk1_0,esk2_0)))). % 0.18/0.36 cnf(i_0_1, plain, (a_continuous_function_from_onto(the_projection_function(X1,X2,X3),the_product_top_space_over(X2,X3),apply(X2,X1)))). % 0.18/0.36 cnf(i_0_2, plain, (an_open_function_from_onto(the_projection_function(X1,X2,X3),the_product_top_space_over(X4,X3),apply(X4,X1)))). % 0.18/0.36 cnf(i_0_4, negated_conjecture, (~a_locally_compact_top_space(apply(esk1_0,esk3_0)))). % 0.18/0.36 cnf(i_0_3, plain, (a_locally_compact_top_space(X1)|~a_locally_compact_top_space(X2)|~an_open_function_from_onto(X3,X2,X1)|~a_continuous_function_from_onto(X3,X2,X1))). % 0.18/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.36 # Begin printing tableau % 0.18/0.36 # Found 5 steps % 0.18/0.36 cnf(i_0_4, negated_conjecture, (~a_locally_compact_top_space(apply(esk1_0,esk3_0))), inference(start_rule)). % 0.18/0.36 cnf(i_0_6, plain, (~a_locally_compact_top_space(apply(esk1_0,esk3_0))), inference(extension_rule, [i_0_3])). % 0.18/0.36 cnf(i_0_9, plain, (~a_locally_compact_top_space(the_product_top_space_over(esk1_0,esk2_0))), inference(closure_rule, [i_0_5])). % 0.18/0.36 cnf(i_0_10, plain, (~an_open_function_from_onto(the_projection_function(esk3_0,esk1_0,esk2_0),the_product_top_space_over(esk1_0,esk2_0),apply(esk1_0,esk3_0))), inference(closure_rule, [i_0_2])). % 0.18/0.36 cnf(i_0_11, plain, (~a_continuous_function_from_onto(the_projection_function(esk3_0,esk1_0,esk2_0),the_product_top_space_over(esk1_0,esk2_0),apply(esk1_0,esk3_0))), inference(closure_rule, [i_0_1])). % 0.18/0.36 # End printing tableau % 0.18/0.36 # SZS output end % 0.18/0.36 # Branches closed with saturation will be marked with an "s" % 0.18/0.36 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.18/0.36 # We now have 2 tableaux to operate on % 0.18/0.36 # Found closed tableau during pool population. % 0.18/0.36 # Proof search is over... % 0.18/0.36 # Freeing feature tree %------------------------------------------------------------------------------