%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM395+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 : n015.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 : Mon Jul 18 09:40:41 EDT 2022 % Result : Theorem 0.21s 0.39s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.14 % Problem : NUM395+1 : TPTP v8.1.0. Released v3.2.0. % 0.14/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.36 % Computer : n015.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Thu Jul 7 02:16:04 EDT 2022 % 0.14/0.36 % CPUTime : % 0.21/0.39 # No SInE strategy applied % 0.21/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.21/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.21/0.39 # % 0.21/0.39 # Presaturation interreduction done % 0.21/0.39 # Number of axioms: 50 Number of unprocessed: 44 % 0.21/0.39 # Tableaux proof search. % 0.21/0.39 # APR header successfully linked. % 0.21/0.39 # Hello from C++ % 0.21/0.39 # The folding up rule is enabled... % 0.21/0.39 # Local unification is enabled... % 0.21/0.39 # Any saturation attempts will use folding labels... % 0.21/0.39 # 44 beginning clauses after preprocessing and clausification % 0.21/0.39 # Creating start rules for all 1 conjectures. % 0.21/0.39 # There are 1 start rule candidates: % 0.21/0.39 # Found 32 unit axioms. % 0.21/0.39 # 1 start rule tableaux created. % 0.21/0.39 # 12 extension rule candidate clauses % 0.21/0.39 # 32 unit axiom clauses % 0.21/0.39 % 0.21/0.39 # Requested 8, 32 cores available to the main process. % 0.21/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.21/0.39 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done. % 0.21/0.39 # There were 0 total branch saturation attempts. % 0.21/0.39 # There were 0 of these attempts blocked. % 0.21/0.39 # There were 0 deferred branch saturation attempts. % 0.21/0.39 # There were 0 free duplicated saturations. % 0.21/0.39 # There were 0 total successful branch saturations. % 0.21/0.39 # There were 0 successful branch saturations in interreduction. % 0.21/0.39 # There were 0 successful branch saturations on the branch. % 0.21/0.39 # There were 0 successful branch saturations after the branch. % 0.21/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.39 # Begin clausification derivation % 0.21/0.39 % 0.21/0.39 # End clausification derivation % 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.39 cnf(i_0_33, plain, (empty(empty_set))). % 0.21/0.39 cnf(i_0_32, plain, (relation(empty_set))). % 0.21/0.39 cnf(i_0_21, plain, (empty(esk4_0))). % 0.21/0.39 cnf(i_0_38, plain, (empty(esk8_0))). % 0.21/0.39 cnf(i_0_15, plain, (ordinal(esk2_0))). % 0.21/0.39 cnf(i_0_52, plain, (epsilon_transitive(empty_set))). % 0.21/0.39 cnf(i_0_51, plain, (epsilon_connected(empty_set))). % 0.21/0.39 cnf(i_0_34, plain, (relation_empty_yielding(empty_set))). % 0.21/0.39 cnf(i_0_44, plain, (empty(esk11_0))). % 0.21/0.39 cnf(i_0_18, plain, (function(esk3_0))). % 0.21/0.39 cnf(i_0_20, plain, (function(esk4_0))). % 0.21/0.39 cnf(i_0_24, plain, (function(esk5_0))). % 0.21/0.39 cnf(i_0_26, plain, (function(esk6_0))). % 0.21/0.39 cnf(i_0_29, plain, (function(esk7_0))). % 0.21/0.39 cnf(i_0_19, plain, (relation(esk3_0))). % 0.21/0.39 cnf(i_0_22, plain, (relation(esk4_0))). % 0.21/0.39 cnf(i_0_25, plain, (relation(esk5_0))). % 0.21/0.39 cnf(i_0_28, plain, (relation(esk6_0))). % 0.21/0.39 cnf(i_0_31, plain, (relation(esk7_0))). % 0.21/0.39 cnf(i_0_37, plain, (relation(esk8_0))). % 0.21/0.39 cnf(i_0_39, plain, (relation(esk9_0))). % 0.21/0.39 cnf(i_0_42, plain, (relation(esk10_0))). % 0.21/0.39 cnf(i_0_23, plain, (one_to_one(esk5_0))). % 0.21/0.39 cnf(i_0_17, plain, (epsilon_transitive(esk2_0))). % 0.21/0.39 cnf(i_0_16, plain, (epsilon_connected(esk2_0))). % 0.21/0.39 cnf(i_0_27, plain, (relation_empty_yielding(esk6_0))). % 0.21/0.39 cnf(i_0_41, plain, (relation_empty_yielding(esk10_0))). % 0.21/0.39 cnf(i_0_30, plain, (relation_non_empty(esk7_0))). % 0.21/0.39 cnf(i_0_1, plain, (element(esk1_1(X1),X1))). % 0.21/0.39 cnf(i_0_47, negated_conjecture, (~ordinal(empty_set))). % 0.21/0.39 cnf(i_0_40, plain, (~empty(esk9_0))). % 0.21/0.39 cnf(i_0_45, plain, (~empty(esk12_0))). % 0.21/0.39 cnf(i_0_10, plain, (~in(X1,X2)|~empty(X2))). % 0.21/0.39 cnf(i_0_46, plain, (X1=empty_set|~empty(X1))). % 0.21/0.39 cnf(i_0_13, plain, (epsilon_transitive(X1)|~ordinal(X1))). % 0.21/0.39 cnf(i_0_5, plain, (function(X1)|~empty(X1))). % 0.21/0.39 cnf(i_0_12, plain, (epsilon_connected(X1)|~ordinal(X1))). % 0.21/0.39 cnf(i_0_9, plain, (relation(X1)|~empty(X1))). % 0.21/0.39 cnf(i_0_3, plain, (~in(X1,X2)|~in(X2,X1))). % 0.21/0.39 cnf(i_0_14, plain, (ordinal(X1)|~epsilon_connected(X1)|~epsilon_transitive(X1))). % 0.21/0.39 cnf(i_0_4, plain, (element(X1,X2)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_11, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.21/0.39 cnf(i_0_6, plain, (one_to_one(X1)|~empty(X1))). % 0.21/0.39 cnf(i_0_2, plain, (in(X1,X2)|empty(X2)|~element(X1,X2))). % 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.39 # Begin printing tableau % 0.21/0.39 # Found 4 steps % 0.21/0.39 cnf(i_0_47, negated_conjecture, (~ordinal(empty_set)), inference(start_rule)). % 0.21/0.39 cnf(i_0_53, plain, (~ordinal(empty_set)), inference(extension_rule, [i_0_14])). % 0.21/0.39 cnf(i_0_69, plain, (~epsilon_connected(empty_set)), inference(closure_rule, [i_0_51])). % 0.21/0.39 cnf(i_0_70, plain, (~epsilon_transitive(empty_set)), inference(closure_rule, [i_0_52])). % 0.21/0.39 # End printing tableau % 0.21/0.39 # SZS output end % 0.21/0.39 # Branches closed with saturation will be marked with an "s" % 0.21/0.39 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 0.21/0.39 # We now have 1 tableaux to operate on % 0.21/0.39 # Found closed tableau during pool population. % 0.21/0.39 # Proof search is over... % 0.21/0.39 # Freeing feature tree %------------------------------------------------------------------------------