%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN986+1.003 : TPTP v8.1.0. Released v4.0.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 : n029.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 06:15:18 EDT 2022 % Result : Theorem 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN986+1.003 : TPTP v8.1.0. Released v4.0.0. % 0.07/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 : n029.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 : Mon Jul 11 15:54:47 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 3 Number of unprocessed: 3 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 3 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 1 conjectures. % 0.12/0.36 # There are 1 start rule candidates: % 0.12/0.36 # Found 1 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 2 extension rule candidate clauses % 0.12/0.36 # 1 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.36 # Ran out of tableaux, making start rules for all clauses % 0.12/0.36 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 8 tableaux to operate on % 0.12/0.37 # There were 1 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 1 total successful branch saturations. % 0.12/0.37 # There were 0 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 Theorem 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_1, plain, (r(X1,zero,succ(X1)))). % 0.12/0.37 cnf(i_0_3, negated_conjecture, (~r(zero,zero,X1)|~r(zero,X2,X3)|~r(zero,X4,X2)|~r(zero,X1,X4))). % 0.12/0.37 cnf(i_0_2, plain, (r(X1,succ(X2),X3)|~r(X4,X2,X3)|~r(X1,X2,X4))). % 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 9 steps % 0.12/0.37 cnf(i_0_1, plain, (r(zero,zero,succ(zero))), inference(start_rule)). % 0.12/0.37 cnf(i_0_50, plain, (r(zero,zero,succ(zero))), inference(extension_rule, [i_0_3])). % 0.12/0.37 cnf(i_0_61, plain, (~r(zero,zero,succ(zero))), inference(closure_rule, [i_0_1])). % 0.12/0.37 cnf(i_0_62, plain, (~r(zero,succ(zero),succ(succ(zero)))), inference(extension_rule, [i_0_2])). % 0.12/0.37 cnf(i_0_66, plain, (~r(succ(zero),zero,succ(succ(zero)))), inference(closure_rule, [i_0_1])). % 0.12/0.37 cnf(i_0_67, plain, (~r(zero,zero,succ(zero))), inference(closure_rule, [i_0_1])). % 0.12/0.37 cnf(i_0_64, plain, (~r(zero,succ(zero),zero)), inference(extension_rule, [i_0_2])). % 0.12/0.37 cnf(i_0_74, plain, (~r(zero,zero,succ(zero))), inference(closure_rule, [i_0_1])). % 0.12/0.37 cnf(i_0_73, plain, (~r(succ(zero),zero,zero)), inference(etableau_closure_rule, [i_0_73, ...])). % 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 # 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 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 2 successful branch saturations after the branch. % 0.12/0.37 # SZS status Theorem 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_1, plain, (r(X1,zero,succ(X1)))). % 0.12/0.37 cnf(i_0_3, negated_conjecture, (~r(zero,zero,X1)|~r(zero,X2,X3)|~r(zero,X4,X2)|~r(zero,X1,X4))). % 0.12/0.37 cnf(i_0_2, plain, (r(X1,succ(X2),X3)|~r(X4,X2,X3)|~r(X1,X2,X4))). % 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 7 steps % 0.12/0.37 cnf(i_0_1, plain, (r(zero,zero,succ(zero))), inference(start_rule)). % 0.12/0.37 cnf(i_0_50, plain, (r(zero,zero,succ(zero))), inference(extension_rule, [i_0_3])). % 0.12/0.37 cnf(i_0_62, plain, (~r(zero,zero,succ(zero))), inference(closure_rule, [i_0_1])). % 0.12/0.37 cnf(i_0_63, plain, (~r(zero,succ(zero),zero)), inference(extension_rule, [i_0_2])). % 0.12/0.37 cnf(i_0_67, plain, (~r(zero,zero,succ(zero))), inference(closure_rule, [i_0_1])). % 0.12/0.37 cnf(i_0_64, plain, (~r(zero,succ(zero),succ(zero))), inference(etableau_closure_rule, [i_0_64, ...])). % 0.12/0.37 cnf(i_0_66, plain, (~r(succ(zero),zero,zero)), inference(etableau_closure_rule, [i_0_66, ...])). % 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 # 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 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 2 successful branch saturations after the branch. % 0.12/0.37 # Child (3634) has found a proof. % 0.12/0.37 % 0.12/0.37 # SZS status Theorem 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_1, plain, (r(X1,zero,succ(X1)))). % 0.12/0.37 cnf(i_0_3, negated_conjecture, (~r(zero,zero,X1)|~r(zero,X2,X3)|~r(zero,X4,X2)|~r(zero,X1,X4))). % 0.12/0.37 cnf(i_0_2, plain, (r(X1,succ(X2),X3)|~r(X4,X2,X3)|~r(X1,X2,X4))). % 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 7 steps % 0.12/0.37 cnf(i_0_1, plain, (r(zero,zero,succ(zero))), inference(start_rule)). % 0.12/0.37 cnf(i_0_50, plain, (r(zero,zero,succ(zero))), inference(extension_rule, [i_0_3])). % 0.12/0.37 cnf(i_0_61, plain, (~r(zero,zero,succ(zero))), inference(closure_rule, [i_0_1])). % 0.12/0.37 cnf(i_0_63, plain, (~r(zero,succ(zero),zero)), inference(extension_rule, [i_0_2])). % 0.12/0.37 cnf(i_0_67, plain, (~r(zero,zero,succ(zero))), inference(closure_rule, [i_0_1])). % 0.12/0.37 cnf(i_0_64, plain, (~r(zero,succ(zero),succ(zero))), inference(etableau_closure_rule, [i_0_64, ...])). % 0.12/0.37 cnf(i_0_66, plain, (~r(succ(zero),zero,zero)), inference(etableau_closure_rule, [i_0_66, ...])). % 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 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------