%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV019-1 : TPTP v8.1.0. Released v2.4.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 : n010.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 : Wed Jul 20 18:18:58 EDT 2022 % Result : Unsatisfiable 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWV019-1 : TPTP v8.1.0. Released v2.4.0. % 0.06/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.34 % Computer : n010.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Tue Jun 14 22:18:39 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 10 Number of unprocessed: 10 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 10 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 1 conjectures. % 0.12/0.37 # There are 1 start rule candidates: % 0.12/0.37 # Found 5 unit axioms. % 0.12/0.37 # 1 start rule tableaux created. % 0.12/0.37 # 5 extension rule candidate clauses % 0.12/0.37 # 5 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 9 tableaux to operate on % 0.12/0.37 # There were 2 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 2 total successful branch saturations. % 0.12/0.37 # There were 1 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 1 successful branch saturations after the branch. % 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_16, plain, (less_than(index_of_maximal,an_index))). % 0.12/0.37 cnf(i_0_14, plain, (less_than(X1,successor(X1)))). % 0.12/0.37 cnf(i_0_18, plain, (~less_than(upper_bound,an_index))). % 0.12/0.37 cnf(i_0_19, plain, (~less_than(index_of_maximal,lower_bound))). % 0.12/0.37 cnf(i_0_17, plain, (~less_than(an_index,lower_bound))). % 0.12/0.37 cnf(i_0_15, plain, (array_value_at(array,index_of_maximal)=maximal_value|~in_array_bounds(array,index_of_maximal))). % 0.12/0.37 cnf(i_0_11, plain, (in_array_bounds(array,X1)|less_than(upper_bound,X1)|less_than(X1,lower_bound))). % 0.12/0.37 cnf(i_0_12, plain, (less_than(X1,X2)|~less_than(successor(X1),successor(X2)))). % 0.12/0.37 cnf(i_0_13, plain, (less_than(X1,X2)|~less_than(X3,X2)|~less_than(X1,X3))). % 0.12/0.37 cnf(i_0_20, negated_conjecture, (less_than(successor(upper_bound),successor(an_index))|less_than(successor(an_index),lower_bound)|~in_array_bounds(array,index_of_maximal)|~in_array_bounds(array,an_index)|~less_than(index_of_maximal,successor(an_index)))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 17 steps % 0.12/0.37 cnf(i_0_20, negated_conjecture, (less_than(successor(upper_bound),successor(an_index))|less_than(successor(an_index),lower_bound)|~in_array_bounds(array,index_of_maximal)|~in_array_bounds(array,an_index)|~less_than(index_of_maximal,successor(an_index))), inference(start_rule)). % 0.12/0.37 cnf(i_0_25, plain, (~less_than(index_of_maximal,successor(an_index))), inference(extension_rule, [i_0_13])). % 0.12/0.37 cnf(i_0_94, plain, (~less_than(an_index,successor(an_index))), inference(closure_rule, [i_0_14])). % 0.12/0.37 cnf(i_0_95, plain, (~less_than(index_of_maximal,an_index)), inference(closure_rule, [i_0_16])). % 0.12/0.37 cnf(i_0_21, plain, (less_than(successor(upper_bound),successor(an_index))), inference(extension_rule, [i_0_12])). % 0.12/0.37 cnf(i_0_106, plain, (less_than(upper_bound,an_index)), inference(closure_rule, [i_0_18])). % 0.12/0.37 cnf(i_0_22, plain, (less_than(successor(an_index),lower_bound)), inference(extension_rule, [i_0_13])). % 0.12/0.37 cnf(i_0_113, plain, (less_than(index_of_maximal,lower_bound)), inference(closure_rule, [i_0_19])). % 0.12/0.37 cnf(i_0_115, plain, (~less_than(index_of_maximal,successor(an_index))), inference(closure_rule, [i_0_25])). % 0.12/0.37 cnf(i_0_23, plain, (~in_array_bounds(array,index_of_maximal)), inference(extension_rule, [i_0_11])). % 0.12/0.37 cnf(i_0_120, plain, (less_than(index_of_maximal,lower_bound)), inference(closure_rule, [i_0_19])). % 0.12/0.37 cnf(i_0_119, plain, (less_than(upper_bound,index_of_maximal)), inference(extension_rule, [i_0_13])). % 0.12/0.37 cnf(i_0_24, plain, (~in_array_bounds(array,an_index)), inference(etableau_closure_rule, [i_0_24, ...])). % 0.12/0.37 cnf(i_0_130, plain, (less_than(upper_bound,index_of_maximal)), inference(extension_rule, [i_0_13])). % 0.12/0.37 cnf(i_0_146, plain, (less_than(upper_bound,an_index)), inference(closure_rule, [i_0_18])). % 0.12/0.37 cnf(i_0_147, plain, (~less_than(index_of_maximal,an_index)), inference(closure_rule, [i_0_16])). % 0.12/0.37 cnf(i_0_132, plain, (~less_than(upper_bound,upper_bound)), inference(etableau_closure_rule, [i_0_132, ...])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # Child (16433) has found a proof. % 0.12/0.37 % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------